31 template<
class T,
class Key,
class Hash>
38 template<
class T,
class Key,
class Hash>
48 this->
insert(iter.key(),
new T(**iter));
55 template<
class T,
class Key,
class Hash>
64 template<
class T,
class Key,
class Hash>
73 template<
class T,
class Key,
class Hash>
94 template<
class T,
class Key,
class Hash>
113 template<
class T,
class Key,
class Hash>
114 void Foam::HashPtrTable<T, Key, Hash>::operator=
123 <<
"attempted assignment to self" 129 for (
const_iterator iter = rhs.begin(); iter != rhs.end(); ++iter)
131 this->
insert(iter.key(),
new T(**iter));
~HashPtrTable()
Destructor.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
HashPtrTable(const label size=128)
Construct given initial table size.
An STL-conforming const_iterator.
static iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
A HashTable specialization for hashing pointers.
void clear()
Clear all entries from table.
bool erase(const iterator &)
Erase a hashedEntry specified by given iterator.
bool insert(const Key &, const T *&newElmt)
Insert a new hashedEntry.
void clear()
Clear all entries from table.
iterator begin()
Iterator set to the beginning of the HashTable.
An STL-conforming hash table.
errorManip< error > abort(error &err)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
Hash function class for primitives. All non-primitives used to hash entries on hash tables likely nee...
T * remove(iterator &)
Remove and return the pointer specified by given iterator.
HashTable< T *, Key, Hash >::iterator iterator
bool erase(iterator &)
Erase an hashedEntry specified by given iterator.