Tools.h++ Class Reference

Table Of Contents
Persistence
None
Public Typedefs
typedef T key_type;
typedef T value_type; // or ... "const K"
typedef Hash key_hash;
typedef EQ key_equal;
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_hashset<T,Hash,EQ> are forward iterators.
typedef (scoped Iterator) iterator;
typedef (scoped ConsIterator) const_iterator;
Public Constructors
rw_hashset<T,Hash,EQ>(size_type sz = 1024,
const Hash& h = Hash(),
const EQ& eq = EQ());
Construct an empty rw_hashset<T,Hash,EQ> with sz slots, using h as the hash object,
and eq as the equality comparator.
rw_hashset<T,Hash,EQ>(const rw_hashset<T,Hash,EQ>& set);
Construct an rw_hashset<T,Hash,EQ> which is a copy of set. Each element from set
will be copied into self.
rw_hashset<T,Hash,EQ>(const_iterator first,
const_iterator bound
size_type sz=1024,
const Hash& h = Hash(),
const EQ& eq = EQ());
Construct an rw_hashset<T,Hash,EQ> with sz slots, using h as the hash object, and eq
as the equality comparator, containing a copy of each item referenced by the range
starting with first and bounded by bound.
rw_hashset<T,Hash,EQ>(const value_type* first,
const value_type* bound
size_type sz=1024,
const Hash& h = Hash(),
const EQ& eq = EQ());