Library: Foundation
Package: Hashing
Header: Poco/HashMap.h
This class implements a map using a LinearHashTable.
A HashMap can be used just like a std::map.
Member Functions: begin, clear, count, empty, end, erase, find, insert, operator =, operator [], size, swap
typedef typename HashTable::ConstIterator ConstIterator;
typedef const Mapped * ConstPointer;
typedef const Mapped & ConstReference;
typedef LinearHashTable < ValueType, HashType > HashTable;
typedef HashMapEntryHash < ValueType, HashFunc > HashType;
typedef typename HashTable::Iterator Iterator;
typedef Key KeyType;
typedef Mapped MappedType;
typedef std::pair < KeyType, MappedType > PairType;
typedef Mapped * Pointer;
typedef Mapped & Reference;
typedef HashMapEntry < Key, Mapped > ValueType;
HashMap();
Creates an empty HashMap.
HashMap(
std::size_t initialReserve
);
Creates the HashMap with room for initialReserve entries.
ConstIterator begin() const;
Iterator begin();
void clear();
std::size_t count(
const KeyType & key
) const;
bool empty() const;
ConstIterator end() const;
Iterator end();
void erase(
Iterator it
);
void erase(
const KeyType & key
);
ConstIterator find(
const KeyType & key
) const;
Iterator find(
const KeyType & key
);
std::pair < Iterator, bool > insert(
const PairType & pair
);
std::pair < Iterator, bool > insert(
const ValueType & value
);
HashMap & operator = (
const HashMap & map
);
Assigns another HashMap.
ConstReference operator[] (
const KeyType & key
) const;
Reference operator[] (
const KeyType & key
);
std::size_t size() const;
void swap(
HashMap & map
);
Swaps the HashMap with another one.