|
version 1.5, 2001/04/29 18:57:33
|
version 1.6, 2001/05/20 20:34:00
|
|
|
|
| { | { |
| }; | }; |
| | |
| template<> struct PEGASUS_COMMON_LINKAGE HashFunc<String> |
PEGASUS_TEMPLATE_SPECIALIZATION struct PEGASUS_COMMON_LINKAGE HashFunc<String> |
| { | { |
| static Uint32 hash(const String& str); | static Uint32 hash(const String& str); |
| }; | }; |
| | |
| template<> struct HashFunc<Uint32> |
PEGASUS_TEMPLATE_SPECIALIZATION struct HashFunc<Uint32> |
| { | { |
| static Uint32 hash(Uint32 x) { return x + 13; } | static Uint32 hash(Uint32 x) { return x + 13; } |
| }; | }; |
|
|
|
| | |
| _HashTableIteratorBase() : _first(0), _last(0), _bucket(0) { } | _HashTableIteratorBase() : _first(0), _last(0), _bucket(0) { } |
| | |
| operator Boolean() const { return _bucket != 0; } |
operator int() const { return _bucket != 0; } |
| | |
| _HashTableIteratorBase operator++(int); | _HashTableIteratorBase operator++(int); |
| | |
|
|
|
| the pathalogical case in which all entries are placed in the first | the pathalogical case in which all entries are placed in the first |
| chain. | chain. |
| */ | */ |
| template<class K, class V, class E = EqualFunc<K>, class H = HashFunc<K> > |
template<class K, class V, class E , class H > |
| class HashTable | class HashTable |
| { | { |
| public: | public: |
|
|
|
| } | } |
| | |
| /** Copy constructor. */ | /** Copy constructor. */ |
| HashTable(const HashTable& x) : _rep(x._rep) |
HashTable(const HashTable<K,V,E,H>& x) : _rep(x._rep) |
| { | { |
| | |
| } | } |
| | |
| /** Assignment operator. */ | /** Assignment operator. */ |
| HashTable& operator=(const HashTable& x) |
HashTable<K,V,E,H>& operator=(const HashTable<K,V,E,H>& x) |
| { | { |
| if (this != &x) | if (this != &x) |
| _rep = x._rep; | _rep = x._rep; |
Return to
HashTable.h
CVS log
Up to [Pegasus] / pegasus / src / Pegasus / Common