65template<
class Key=word,
class HashType=Foam::Hash<Key>>
130namespace HashTableOps
134template<
class T,
class Key=word,
class HashType=Foam::Hash<Key>>
147template<
class T,
class Key,
class Hash>
151 const bool doSort=
false
A HashTable with keys but without contents that is similar to std::unordered_set.
A HashTable similar to std::unordered_map.
label size() const noexcept
The number of elements in table.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
labelHashSet used(const bitSet &select)
Convert a bitset to a labelHashSet of the indices used.
bitSet bitset(const labelHashSet &locations)
Transform the on locations to a bitSet.
List< bool > bools(const labelHashSet &locations)
List< T > values(const HashTable< T, Key, Hash > &tbl, const bool doSort=false)
List of values from HashTable, optionally sorted.
void sort(UList< T > &list)
Sort the list.
static Ostream & output(Ostream &os, const IntRange< T > &range)
#define forAllConstIters(container, iter)
Iterate across all elements of the container object with const access.
Combine HashSet operation. Equivalent to 'a |= b'.
HashSet< Key, HashType > value_type
void operator()(value_type &a, const value_type &b) const
Combine HashTable operation. Equivalent to 'a += b'.
void operator()(value_type &a, const value_type &b) const
HashTable< T, Key, HashType > value_type