Tools.h++ Class Reference

Persistence
None
Public Typedefs
typedef K key_type;
typedef Hash key_hash;
typedef EQ key_equal;
typedef pair<K,V> value_type; // or ... "const K"
typedef (unsigned) size_type; //from rw_slist
typedef (int) difference_type; // from rw_slist
typedef (value_type&) reference;
typedef (const value_type&) const_reference; //from rw_slist
Iterators over rw_hashmap<K,V,Hash,EQ> are forward iterators.
typedef (scoped Iterator) iterator;
typedef (scoped ConstIterator) const_iterator;
Public Constructors
rw_hashmap<K,V,Hash,EQ>(size_type sz = 1024,
const Hash& h = Hash(),
const EQ& eq = EQ());
Construct an empty rw_hashmap<K,V,Hash,EQ> with sz slots, using h as the hash
object, and eq as the equality comparator.
rw_hashmap<K,V,Hash,EQ>(const rw_hashmap<K,V,Hash,EQ>& map);
Construct an rw_hashmap<K,V,Hash,EQ> which is a copy of map. Each element from
map will be copied into self.
rw_hashmap<K,V,Hash,EQ>(const_iterator first,
const_iterator bound
size_type sz=1024,
const Hash& h = Hash(),
const EQ& eq = EQ());
Construct an rw_hashmap<K,V,Hash,EQ> with sz slots, using h as the hash object, and
eq as the equality comparator, containing a copy of each pair referenced by the range
starting with first and bounded by bound.
rw_hashmap<K,V,Hash,EQ>(const value_type* first,
const value_type* bound
size_type sz=1024,
const Hash& h = Hash(),
const EQ& eq = EQ());