Tools.h++ Class Reference

return 0;
}
Related Classes
Class RWTPtrHashMultiSet<T,H,EQ> offers the same interface to a pointer-based collection that
accepts multiple items that compare equal to each other.
Class rw_hashset<T*,rw_deref_hash<H,T>,rw_deref_compare<EQ,T> > is the C++-standard
collection that serves as the underlying implementation for RWTPtrHashSet<T,H,EQ>.
Public Typedefs
typedef rw_deref_compare<EQ,T> container_eq;
typedef rw_deref_hash<H,T> container_hash;
typedef rw_hashset<T*,container_hash, container_eq>
container_type;
typedef container_type::size_type size_type;
typedef container_type::difference_type difference_type;
typedef container_type::iterator iterator;
typedef container_type::const_iterator const_iterator;
typedef T* value_type;
typedef T* const& reference;
typedef T* const& const_reference;
Public Constructors
RWTPtrHashSet<T,H,EQ>
(size_type sz=1024,const H& h = H(),const EQ& eq = EQ());
Constructs an empty hashed set. The underlying hash table representation will have sz
buckets, will use h for its hashing function and will use eq to determine equality between
elements.
RWTPtrHashSet<T,H,EQ>(const RWTPtrHashSet<T,H,EQ>& rws);
Copy constructor.
RWTPtrHashSet<T,H,EQ>
(const H& h,size_type sz = RWDEFAULT_CAPACITY);
This Tools.h++ 6.xstyle constructor creates an empty hashed set which uses the hash object h
and has an initial hash table capacity of sz.
RWTPtrHashSet<T,H,EQ>
(const rw_hashset<T*,container_hash,container_eq>& s);
Constructs a pointer based hash set by copying all elements from s.
RWTPtrHashSet<T,H,EQ>(T*const* first,T*const* last,