In This Package:

GaudiUtils::HashMap< K, T, H, M > Class Template Reference

Common class providing an architecture-independent hash map. More...

#include <GaudiKernel/HashMap.h>

Inheritance diagram for GaudiUtils::HashMap< K, T, H, M >:

[legend]Collaboration diagram for GaudiUtils::HashMap< K, T, H, M >:[legend]List of all members.

Public Types
typedef H	hasher
typedef M	map_type
typedef K	key_type
typedef T	mapped_type
typedef K	argument_type
typedef T	result_type
typedef std::pair< const K, T >	value_type
typedef map_type::size_type	size_type
typedef map_type::iterator	iterator
typedef map_type::const_iterator	const_iterator
Public Member Functions
hasher	hash_funct () const
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
mapped_type &	operator[] (const key_type &key)
const mapped_type &	operator[] (const key_type &key) const
	Access elements of a const Map.
iterator	find (const key_type &key)
const_iterator	find (const key_type &key) const
size_type	count (const key_type &key) const
iterator	lower_bound (const key_type &key)
const_iterator	lower_bound (const key_type &key) const
iterator	upper_bound (const key_type &key)
const_iterator	upper_bound (const key_type &key) const
std::pair< iterator, iterator >	equal_range (const key_type &key)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const
std::pair< iterator, bool >	insert (const value_type &val)
iterator	insert (iterator pos, const value_type &val)
template<typename In>
void	insert (In first, In last)
void	erase (iterator pos)
size_type	erase (const key_type &key)
void	erase (iterator first, iterator last)
void	clear ()
size_type	size () const
size_type	max_size () const
bool	empty () const
void	swap (map_type &other)
const result_type &	operator() (const argument_type &key) const
	Allow to use Map as an unary function.
Map &	merge (const map_type &other)
	Merge two maps.
	operator map_type & ()
	Allows to use the Map wherever an std::map is explicitly requested.
	operator const map_type & () const
Protected Attributes
map_type	m_map
Static Protected Attributes
static const result_type	s_null_value = typename Map<K,T,M>::result_type()

---

Detailed Description

template<typename K, typename T, typename H = Hash<K>, typename M = __gnu_cxx::hash_map<K,T,H>>
class GaudiUtils::HashMap< K, T, H, M >

Common class providing an architecture-independent hash map.

Author:

Marco Clemencic

Date:

2005-10-06

Definition at line 48 of file HashMap.h.

---

Member Typedef Documentation

template<typename K, typename T, typename H = Hash<K>, typename M = __gnu_cxx::hash_map<K,T,H>>

typedef H GaudiUtils::HashMap< K, T, H, M >::hasher

Definition at line 51 of file HashMap.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef M GaudiUtils::Map< K, T, M >::map_type [inherited]

Definition at line 35 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef K GaudiUtils::Map< K, T, M >::key_type [inherited]

Definition at line 36 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef T GaudiUtils::Map< K, T, M >::mapped_type [inherited]

Definition at line 37 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef K GaudiUtils::Map< K, T, M >::argument_type [inherited]

Definition at line 40 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef T GaudiUtils::Map< K, T, M >::result_type [inherited]

Definition at line 41 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef std::pair<const K,T> GaudiUtils::Map< K, T, M >::value_type [inherited]

Definition at line 42 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef map_type::size_type GaudiUtils::Map< K, T, M >::size_type [inherited]

Definition at line 44 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef map_type::iterator GaudiUtils::Map< K, T, M >::iterator [inherited]

Definition at line 46 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

typedef map_type::const_iterator GaudiUtils::Map< K, T, M >::const_iterator [inherited]

Definition at line 47 of file Map.h.

---

Member Function Documentation

template<typename K, typename T, typename H = Hash<K>, typename M = __gnu_cxx::hash_map<K,T,H>>

hasher GaudiUtils::HashMap< K, T, H, M >::hash_funct

(

)

const [inline]

Definition at line 53 of file HashMap.h.

                                     {
// Marco Cl.: since on windows we are using a std::map, we have to provide a different implementation
// for GaudiUtils::HashMap::hash_funct(). (std::map::hash_funct does not exist)
#ifdef _WIN32
      return hasher();
#else
      return this->m_map.hash_funct();
#endif
    }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::begin

(

)

[inline, inherited]

Definition at line 78 of file Map.h.

{ return m_map.begin(); }

template<typename K, typename T, typename M = std::map<K,T>>

const_iterator GaudiUtils::Map< K, T, M >::begin

(

)

const [inline, inherited]

Definition at line 81 of file Map.h.

{ return m_map.begin(); }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::end

(

)

[inline, inherited]

Definition at line 79 of file Map.h.

{ return m_map.end(); }

template<typename K, typename T, typename M = std::map<K,T>>

const_iterator GaudiUtils::Map< K, T, M >::end

(

)

const [inline, inherited]

Definition at line 82 of file Map.h.

{ return m_map.end(); }

template<typename K, typename T, typename M = std::map<K,T>>

mapped_type& GaudiUtils::Map< K, T, M >::operator[]

(

const key_type &

key

)

[inline, inherited]

Definition at line 92 of file Map.h.

{ return m_map[key]; }

template<typename K, typename T, typename M = std::map<K,T>>

const mapped_type& GaudiUtils::Map< K, T, M >::operator[]

(

const key_type &

key

)

const [inline, inherited]

Access elements of a const Map.

There is no automatic extension of the map for missing keys!

Attention:

The behaviour is different from std::map

   const GaudiUtils::Map<KEY,VALUE> m = ... ;
  
   // OK: 
   KEY key = ... ;
   std::cout << " Value: " << m[key] << std::end ; // it is OK! 
 
   // ERROR:
   VALUE value = ... ;
   m[key] = value ;                                // ERROR!

Parameters:

key

the key

Returns:

the mapped value(const reference!) for the existing key, and the default value overwise

Definition at line 185 of file Map.h.

    { return (*this)(key); }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::find

(

const key_type &

key

)

[inline, inherited]

Definition at line 96 of file Map.h.

{ return m_map.find(key); }

template<typename K, typename T, typename M = std::map<K,T>>

const_iterator GaudiUtils::Map< K, T, M >::find

(

const key_type &

key

)

const [inline, inherited]

Definition at line 97 of file Map.h.

{ return m_map.find(key); }

template<typename K, typename T, typename M = std::map<K,T>>

size_type GaudiUtils::Map< K, T, M >::count

(

const key_type &

key

)

const [inline, inherited]

Definition at line 99 of file Map.h.

{ return m_map.count(key); }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::lower_bound

(

const key_type &

key

)

[inline, inherited]

Definition at line 101 of file Map.h.

{ return m_map.lower_bound(key); }

template<typename K, typename T, typename M = std::map<K,T>>

const_iterator GaudiUtils::Map< K, T, M >::lower_bound

(

const key_type &

key

)

const [inline, inherited]

Definition at line 102 of file Map.h.

{ return m_map.lower_bound(key); }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::upper_bound

(

const key_type &

key

)

[inline, inherited]

Definition at line 103 of file Map.h.

{ return m_map.upper_bound(key); }  

template<typename K, typename T, typename M = std::map<K,T>>

const_iterator GaudiUtils::Map< K, T, M >::upper_bound

(

const key_type &

key

)

const [inline, inherited]

Definition at line 104 of file Map.h.

{ return m_map.upper_bound(key); }

template<typename K, typename T, typename M = std::map<K,T>>

std::pair<iterator,iterator> GaudiUtils::Map< K, T, M >::equal_range

(

const key_type &

key

)

[inline, inherited]

Definition at line 106 of file Map.h.

    { return m_map.equal_range(key); }

template<typename K, typename T, typename M = std::map<K,T>>

std::pair<const_iterator,const_iterator> GaudiUtils::Map< K, T, M >::equal_range

(

const key_type &

key

)

const [inline, inherited]

Definition at line 108 of file Map.h.

    { return m_map.equal_range(key); }

template<typename K, typename T, typename M = std::map<K,T>>

std::pair<iterator,bool> GaudiUtils::Map< K, T, M >::insert

(

const value_type &

val

)

[inline, inherited]

Definition at line 113 of file Map.h.

{ return m_map.insert(val); }

template<typename K, typename T, typename M = std::map<K,T>>

iterator GaudiUtils::Map< K, T, M >::insert	(	iterator	pos,
		const value_type &	val
	)			[inline, inherited]

Definition at line 114 of file Map.h.

{ return m_map.insert(pos,val); }

template<typename K, typename T, typename M = std::map<K,T>>

template<typename In>

void GaudiUtils::Map< K, T, M >::insert	(	In	first,
		In	last
	)			[inline, inherited]

Definition at line 116 of file Map.h.

{ m_map.insert(first,last); }

template<typename K, typename T, typename M = std::map<K,T>>

void GaudiUtils::Map< K, T, M >::erase

(

iterator

pos

)

[inline, inherited]

Definition at line 118 of file Map.h.

{ m_map.erase(pos); }

template<typename K, typename T, typename M = std::map<K,T>>

size_type GaudiUtils::Map< K, T, M >::erase

(

const key_type &

key

)

[inline, inherited]

Definition at line 119 of file Map.h.

{ return m_map.erase(key); }

template<typename K, typename T, typename M = std::map<K,T>>

void GaudiUtils::Map< K, T, M >::erase	(	iterator	first,
		iterator	last
	)			[inline, inherited]

Definition at line 120 of file Map.h.

{ m_map.erase(first,last); }

template<typename K, typename T, typename M = std::map<K,T>>

void GaudiUtils::Map< K, T, M >::clear

(

)

[inline, inherited]

Definition at line 121 of file Map.h.

{ m_map.clear(); }

template<typename K, typename T, typename M = std::map<K,T>>

size_type GaudiUtils::Map< K, T, M >::size

(

)

const [inline, inherited]

Definition at line 125 of file Map.h.

{ return m_map.size(); }

template<typename K, typename T, typename M = std::map<K,T>>

size_type GaudiUtils::Map< K, T, M >::max_size

(

)

const [inline, inherited]

Definition at line 126 of file Map.h.

{ return m_map.max_size(); }

template<typename K, typename T, typename M = std::map<K,T>>

bool GaudiUtils::Map< K, T, M >::empty

(

)

const [inline, inherited]

Definition at line 127 of file Map.h.

{ return size() == 0; }

template<typename K, typename T, typename M = std::map<K,T>>

void GaudiUtils::Map< K, T, M >::swap

(

map_type &

other

)

[inline, inherited]

Definition at line 128 of file Map.h.

{ m_map.swap(other); }

template<typename K, typename T, typename M = std::map<K,T>>

const result_type& GaudiUtils::Map< K, T, M >::operator()

(

const argument_type &

key

)

const [inline, inherited]

Allow to use Map as an unary function.

There is no automatic extension of the map for missing keys!

Attention:

The behaviour is different from std::map

   const GaudiUtils::Map<KEY,VALUE> m = ... ;
  
   // OK: 
   KEY key = ... ;
   std::cout << " Value: " << m(key) << std::end ; // it is OK! 
 
   // ERROR:
   VALUE value = ... ;
   m(key) = value ;                                // ERROR!

Parameters:

key

the key

Returns:

the mapped value(const reference!) for the existing key, and the default value overwise

< return the default value

Definition at line 154 of file Map.h.

    {
      // static const result_type s_null_value;
      const_iterator it = m_map.find(key);
      if ( it != m_map.end() ) { return it->second ; }   
      // return the default value 
      return s_null_value;  
    }

template<typename K, typename T, typename M = std::map<K,T>>

Map& GaudiUtils::Map< K, T, M >::merge

(

const map_type &

other

)

[inline, inherited]

Merge two maps.

Definition at line 189 of file Map.h.

    {
      for ( typename map_type::const_iterator it = other.begin() ; 
            other.end() != it ; ++it ) { (*this)[it->first] = it->second ; }
      return *this;
    }

template<typename K, typename T, typename M = std::map<K,T>>

GaudiUtils::Map< K, T, M >::operator map_type &

(

)

[inline, inherited]

Allows to use the Map wherever an std::map is explicitly requested.

Definition at line 197 of file Map.h.

{ return m_map ; }

template<typename K, typename T, typename M = std::map<K,T>>

GaudiUtils::Map< K, T, M >::operator const map_type &

(

)

const [inline, inherited]

Definition at line 198 of file Map.h.

{ return m_map ; }

---

Member Data Documentation

template<typename K, typename T, typename M = std::map<K,T>>

map_type GaudiUtils::Map< K, T, M >::m_map [protected, inherited]

Definition at line 53 of file Map.h.

template<typename K, typename T, typename M = std::map<K,T>>

const Map< K, T, M >::result_type GaudiUtils::Map< K, T, M >::s_null_value = typename Map<K,T,M>::result_type() [static, protected, inherited]

Definition at line 54 of file Map.h.

---

The documentation for this class was generated from the following file:

• /home/dayabay/installs/trunk_2011_04_11_opt/NuWa-trunk/gaudi/GaudiKernel/GaudiKernel/HashMap.h

---