36 #ifndef HashPtrTable_H
37 #define HashPtrTable_H
51 template<
class T,
class Key,
class Hash>
class HashPtrTable;
53 template<
class T,
class Key,
class Hash>
56 template<
class T,
class Key,
class Hash>
64 template<
class T,
class Key=word,
class Hash=
string::hash>
148 friend Ostream& operator<< <T, Key, Hash>
A HashTable specialisation for hashing pointers.
HashTable< T *, Key, Hash >::iterator iterator
void operator=(const HashPtrTable< T, Key, Hash > &)
Assignment operator.
bool erase(iterator &)
Erase an hashedEntry specified by given iterator.
void write(Ostream &os) const
Write.
HashTable< T *, Key, Hash >::const_iterator const_iterator
void clear()
Clear all entries from table.
T * remove(iterator &)
Remove and return the pointer specified by given iterator.
~HashPtrTable()
Destructor.
An STL-conforming const_iterator.
An STL-conforming iterator.
An STL-conforming hash table.
label size() const
Return number of elements in table.
friend class HashPtrTable
Declare friendship with the HashPtrTable class.
Hash function class for primitives. All non-primitives used to hash entries on hash tables likely nee...
A helper class when constructing from an Istream or dictionary.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
A list of keyword definitions, which are a keyword followed by any number of values (e....
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
Istream & operator>>(Istream &, pistonPointEdgeData &)
Ostream & operator<<(Ostream &os, const fvConstraints &constraints)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)