33 template<
class Key,
class Hash>
45 template<
class Key,
class Hash>
46 template<
unsigned Size>
58 template<
class Key,
class Hash>
59 template<
class AnyType,
class AnyHash>
80 template<
class Key,
class Hash>
83 std::initializer_list<Key> lst
88 for (
const Key& key : lst)
97 template<
class Key,
class Hash>
103 if (this->
insert(lst[elemI]))
115 template<
class Key,
class Hash>
118 return this->
found(key);
122 template<
class Key,
class Hash>
129 <<
"attempted assignment to self" 137 template<
class Key,
class Hash>
144 <<
"attempted assignment to self" 152 template<
class Key,
class Hash>
156 for (
const_iterator iter = this->cbegin(); iter != this->cend(); ++iter)
158 if (!rhs.
found(iter.key()))
167 if (!this->
found(iter.key()))
177 template<
class Key,
class Hash>
184 template<
class Key,
class Hash>
195 template<
class Key,
class Hash>
199 for (
iterator iter = this->begin(); iter != this->end(); ++iter)
201 if (!rhs.
found(iter.key()))
209 template<
class Key,
class Hash>
215 if (this->
found(iter.key()))
217 this->
erase(iter.key());
227 template<
class Key,
class Hash>
233 this->
erase(iter.key());
240 template<
class Key,
class Hash>
254 template<
class Key,
class Hash>
268 template<
class Key,
class Hash>
A HashTable with keys but without contents.
#define forAll(list, i)
Loop across all elements in list.
HashTable< nil, Foam::triFace, Foam::Hash< Foam::triFace > >::const_iterator const_iterator
HashTable< nil, Foam::triFace, Foam::Hash< Foam::triFace > >::iterator iterator
An STL-conforming const_iterator.
A 1D vector of objects of type <T> with a fixed size <Size>.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
label count(const ListType &l, typename ListType::const_reference x)
Count the number of occurrences of a value in a list.
bool insert(const Key &key)
Insert a new entry.
label size() const
Return number of elements in table.
void insert(const scalar, DynamicList< floatScalar > &)
Append scalar to given DynamicList.
void operator-=(const HashSet< Key, Hash > &)
Remove entries listed in the given HashSet from this HashSet.
void operator &=(const HashSet< Key, Hash > &)
Only retain entries found in both HashSets.
HashSet(const label size=128)
Construct given initial size.
bool found(const Key &) const
Return true if hashedEntry is found in table.
tmp< fvMatrix< Type > > operator==(const fvMatrix< Type > &, const fvMatrix< Type > &)
bool operator!=(const HashSet< Key, Hash > &) const
The opposite of the equality operation.
An STL-conforming hash table.
errorManip< error > abort(error &err)
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
void operator|=(const HashSet< Key, Hash > &)
Combine entries from HashSets.
bool operator[](const Key &) const
Return true if the entry exists, same as found()
void operator=(const HashSet< Key, Hash > &)
Assignment operator.
bool operator==(const HashSet< Key, Hash > &) const
Equality. Two hashtables are equal when their contents are equal.
Hash function class for primitives. All non-primitives used to hash entries on hash tables likely nee...
void operator^=(const HashSet< Key, Hash > &)
Only retain unique entries (xor)
const_iterator cbegin() const
const_iterator set to the beginning of the HashTable
static iteratorEnd cend()
iteratorEnd set to beyond the end of any HashTable
A zero-sized class without any storage. Used, for example, in HashSet.