#include <stringHashMap.h>
Inheritance diagram for StringHashMap< Value >:

Public Types | |
Type Definitions | |
|
typedef HashMap< String, Value >::Iterator | Iterator |
| Iterator type. | |
|
typedef HashMap< String, Value >::ConstIterator | ConstIterator |
| Const iterator type. | |
|
typedef HashMap< String, Value >::ValueType | ValueType |
| Value type. | |
Public Member Functions | |
Constructors and Destructors | |
| StringHashMap () throw () | |
| Default constructor. | |
| StringHashMap (const StringHashMap &map) throw () | |
| Copy constructor. | |
| virtual | ~StringHashMap () throw () |
| Destructor. | |
| void | destroy () throw () |
| Clear the hash map. | |
Assignment | |
| void | set (const StringHashMap &hash_map) throw () |
| Assign a hash map from another. | |
| const StringHashMap & | operator= (const StringHashMap &hash_map) throw () |
| Assign a hash map from another. | |
| void | get (StringHashMap &hash_map) const throw () |
| Assigns the content of a hash map to another. | |
| void | swap (StringHashMap &hash_map) throw () |
| Swaps the contents of two hash maps. | |
Accessors | |
| std::pair< Iterator, bool > | insert (const ValueType &obj) throw () |
| Insert a pair of key and value. | |
| ::std::pair< Iterator, bool > | insert (const String &key, const Value &value) throw () |
| Insert a given value and key. | |
| bool | remove (const String &key) throw () |
Remove the entry key from the map. | |
| Size | getSize () const throw () |
| Return the size of the hash map. | |
| float | getLoadFactor () const throw () |
| Return the load factor of the hash map. | |
Predicates | |
| bool | operator== (const StringHashMap< Value > &hash_map) const throw () |
| Compare two string hash maps. | |
| bool | operator!= (const StringHashMap< Value > &hash_map) const throw () |
| Compare two string hash maps. | |
| bool | has (const String &key) const throw () |
| Decide whether the hash map contains a given key. | |
| bool | isEmpty () const throw () |
| Return true if the hash map is empty. | |
Miscellaneous | |
| void | host (Visitor< StringHashMap< Value > > &visitor) throw () |
| Visitor host method. | |
|
|||||||||
|
Default constructor. Create an empty hash map. |
|
||||||||||
|
Copy constructor. Create a copy of an existing hash map.
|
|
|||||||||
|
Destructor. Destruct the hash map and free all used memory. |
|
|||||||||
|
Clear the hash map. Remove all contents from the hash map. Reimplemented from HashMap< String, Value >. |
|
|||||||||
|
Return the load factor of the hash map. The load factor is defined as the quotient of the hash map size (the number of entries) and the number of buckets. |
|
|||||||||
|
Return the size of the hash map.
Reimplemented from HashMap< String, Value >. |
|
||||||||||
|
Decide whether the hash map contains a given key.
Reimplemented from HashMap< String, Value >. |
|
||||||||||
|
Visitor host method. StringHashMaps may be visited.
|
|
||||||||||||||||
|
Insert a given value and key.
|
|
||||||||||
|
Insert a pair of key and value.
Reimplemented from HashMap< String, Value >. |
|
|||||||||
|
Return true if the hash map is empty. This method return true if the hash map does not contain any entries. Reimplemented from HashMap< String, Value >. |
|
||||||||||
|
Compare two string hash maps.
|
|
||||||||||
|
Compare two string hash maps.
|
|
||||||||||
|
Remove the entry
|
|
||||||||||
|
Assign a hash map from another. Create a copy of a hash map.
|