31 template<
class T,
class Key,
class Hash>
38 template<
class T,
class Key,
class Hash>
48 this->
insert(iter.key(),
new T(**iter));
53 template<
class T,
class Key,
class Hash>
65 template<
class T,
class Key,
class Hash>
74 template<
class T,
class Key,
class Hash>
83 template<
class T,
class Key,
class Hash>
104 template<
class T,
class Key,
class Hash>
123 template<
class T,
class Key,
class Hash>
124 void Foam::HashPtrTable<T, Key, Hash>::operator=
133 <<
"attempted assignment to self" 139 for (
const_iterator iter = rhs.begin(); iter != rhs.end(); ++iter)
141 this->
insert(iter.key(),
new T(**iter));
146 template<
class T,
class Key,
class Hash>
147 void Foam::HashPtrTable<T, Key, Hash>::operator=
156 <<
"attempted assignment to self" ~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.
void insert(const scalar, DynamicList< floatScalar > &)
Append scalar to given DynamicList.
An STL-conforming iterator.
iterator begin()
Iterator set to the beginning of the HashTable.
An STL-conforming hash table.
errorManip< error > abort(error &err)
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.
bool erase(iterator &)
Erase an hashedEntry specified by given iterator.