29 template<
class T,
class Key,
class Hash>
32 return erase(this->find(key));
38 template<
class T,
class Key,
class Hash>
45 template<
class T,
class Key,
class Hash>
A HashTable specialisation for hashing pointers.
T & operator[](const Key &)
Find and return a hashedEntry.
bool erase(const iterator &)
Erase an hashedEntry specified by given iterator.
An STL-conforming hash table.
void T(GeometricField< Type, GeoMesh, PrimitiveField1 > &gf, const GeometricField< Type, GeoMesh, PrimitiveField2 > &gf1)