Tools.h++ Class Reference

Click on the banner to return to the Class Reference home page.
©Copyright 1996 Rogue Wave Software
rw_hashmap
Synopsis●
Description●
Persistence●
Public Typedefs●
Public Constructors●
Public Destructor●
Public Operators●
Accessors●
Const Public Member Functions●
Mutators●
Special Methods for Maps●
Synopsis
#include <rw/rwstl/hashmap.h>
rw_hashmap<K,V,Hash,EQ> map;
Description
Class rw_hashmap<K,V,Hash,EQ> maintains a collection of mappings between K and V,
implemented as a hash table of pair<const K,V> . Pairs with duplicate keys are not allowed.
Two pairs having duplicate keys is the result of the EQ comparison, applied to the first element
of each, is TRUE. Since this is a value based collection, objects are copied into and out of the
collection. As with all classes that meet the ANSI associative container specification,
rw_hashmap provides for iterators that reference its elements. Operations that alter the contents
of rw_hashmap may invalidate other iterators that reference the container. Since the contents of
rw_hashmap are in pseudo-random order, the only iterator ranges that will usually make sense
are the results of calling equal_range(key), and the entire range from begin() to end().