at(const edge &key) | HashTable< T, edge, Hash< edge > > | inline |
at(const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
begin() | HashTable< T, edge, Hash< edge > > | inline |
begin() const | HashTable< T, edge, Hash< edge > > | inline |
canonicalSize(const label requested_size) | HashTableCore | static |
capacity() const noexcept | HashTable< T, edge, Hash< edge > > | inline |
cbegin() const | HashTable< T, edge, Hash< edge > > | inline |
cend() const noexcept | HashTable< T, edge, Hash< edge > > | inline |
cfind(const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
ClassName("HashTable") | HashTableCore | |
clear() | HashTable< T, edge, Hash< edge > > | |
clearStorage() | HashTable< T, edge, Hash< edge > > | |
const_key_iterator typedef | HashTable< T, edge, Hash< edge > > | |
const_pointer typedef | HashTable< T, edge, Hash< edge > > | |
const_reference typedef | HashTable< T, edge, Hash< edge > > | |
contains(const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
countEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
countEntries(const BinaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
countKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
countKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
countValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
countValues(const UnaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
csorted() const | HashTable< T, edge, Hash< edge > > | |
difference_type typedef | HashTable< T, edge, Hash< edge > > | |
emplace(const edge &key, Args &&... args) | HashTable< T, edge, Hash< edge > > | inline |
emplace_set(const edge &key, Args &&... args) | HashTable< T, edge, Hash< edge > > | inline |
empty() const noexcept | HashTable< T, edge, Hash< edge > > | inline |
end() noexcept | HashTable< T, edge, Hash< edge > > | inline |
end() const noexcept | HashTable< T, edge, Hash< edge > > | inline |
erase(const iterator &iter) | HashTable< T, edge, Hash< edge > > | |
erase(const edge &key) | HashTable< T, edge, Hash< edge > > | |
erase(const HashTable< AnyType, edge, AnyHash > &other) | HashTable< T, edge, Hash< edge > > | |
erase(std::initializer_list< edge > keys) | HashTable< T, edge, Hash< edge > > | inline |
erase(InputIter first, InputIter last) | HashTable< T, edge, Hash< edge > > | inline |
erase(const FixedList< edge, N > &keys) | HashTable< T, edge, Hash< edge > > | inline |
erase(const UList< edge > &keys) | HashTable< T, edge, Hash< edge > > | inline |
erase(InputIter first, InputIter last) | HashTable< T, edge, Hash< edge > > | inline |
erase(const FixedList< edge, N > &keys) | HashTable< T, edge, Hash< edge > > | inline |
erase(const HashTable< AnyType, edge, AnyHash > &other) | HashTable< T, edge, Hash< edge > > | |
filterEntries(const BinaryPredicate &pred, const bool pruning=false) | HashTable< T, edge, Hash< edge > > | |
filterEntries(const BinaryPredicate &pred, const bool pruning) | HashTable< T, edge, Hash< edge > > | |
filterKeys(const UnaryPredicate &pred, const bool pruning=false) | HashTable< T, edge, Hash< edge > > | |
filterKeys(const UnaryPredicate &pred, const bool pruning) | HashTable< T, edge, Hash< edge > > | |
filterValues(const UnaryPredicate &pred, const bool pruning=false) | HashTable< T, edge, Hash< edge > > | |
filterValues(const UnaryPredicate &pred, const bool pruning) | HashTable< T, edge, Hash< edge > > | |
find(const edge &key) | HashTable< T, edge, Hash< edge > > | inline |
find(const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
found(const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
hasher typedef | HashTable< T, edge, Hash< edge > > | |
HashTable() noexcept | HashTable< T, edge, Hash< edge > > | |
HashTable(const Foam::zero) noexcept | HashTable< T, edge, Hash< edge > > | explicit |
HashTable(const label initialCapacity) | HashTable< T, edge, Hash< edge > > | explicit |
HashTable(Istream &is) | HashTable< T, edge, Hash< edge > > | |
HashTable(const this_type &ht) | HashTable< T, edge, Hash< edge > > | |
HashTable(this_type &&rhs) noexcept | HashTable< T, edge, Hash< edge > > | |
HashTable(std::initializer_list< std::pair< edge, T >> list, const bool overwrite=false) | HashTable< T, edge, Hash< edge > > | |
HashTable(const UList< edge > &keys, const UList< T > &values, const bool overwrite=false) | HashTable< T, edge, Hash< edge > > | |
HashTableCore() noexcept=default | HashTableCore | |
insert(const edge &key, const T &obj) | HashTable< T, edge, Hash< edge > > | inline |
insert(const edge &key, T &&obj) | HashTable< T, edge, Hash< edge > > | inline |
key_iterator typedef | HashTable< T, edge, Hash< edge > > | |
key_type typedef | HashTable< T, edge, Hash< edge > > | |
keys() const | HashTable< T, edge, Hash< edge > > | inline |
lookup(const edge &key, const T &deflt) const | HashTable< T, edge, Hash< edge > > | inline |
mapped_type typedef | HashTable< T, edge, Hash< edge > > | |
maxTableSize | HashTableCore | static |
merge(HashTable< T, edge, Hash< edge > > &source) | HashTable< T, edge, Hash< edge > > | |
merge(HashTable< T, edge, Hash< edge > > &&source) | HashTable< T, edge, Hash< edge > > | |
node_type typedef | HashTable< T, edge, Hash< edge > > | |
operator!=(const this_type &rhs) const | HashTable< T, edge, Hash< edge > > | |
operator()(const edge &key) | HashTable< T, edge, Hash< edge > > | inline |
operator()(const edge &key, const T &deflt) | HashTable< T, edge, Hash< edge > > | inline |
operator+=(const this_type &rhs) | HashTable< T, edge, Hash< edge > > | |
operator=(const this_type &rhs) | HashTable< T, edge, Hash< edge > > | |
operator=(std::initializer_list< std::pair< edge, T >> rhs) | HashTable< T, edge, Hash< edge > > | |
operator=(this_type &&rhs) | HashTable< T, edge, Hash< edge > > | |
operator==(const this_type &rhs) const | HashTable< T, edge, Hash< edge > > | |
operator[](const edge &key) | HashTable< T, edge, Hash< edge > > | inline |
operator[](const edge &key) const | HashTable< T, edge, Hash< edge > > | inline |
pointer typedef | HashTable< T, edge, Hash< edge > > | |
printInfo(Ostream &os) const | HashTable< T, edge, Hash< edge > > | |
reference typedef | HashTable< T, edge, Hash< edge > > | |
reserve(label numEntries) | HashTable< T, edge, Hash< edge > > | |
resize(label newCapacity) | HashTable< T, edge, Hash< edge > > | |
retain(const HashTable< AnyType, edge, AnyHash > &other) | HashTable< T, edge, Hash< edge > > | |
retain(const HashTable< AnyType, edge, AnyHash > &other) | HashTable< T, edge, Hash< edge > > | |
set(const edge &key, const T &obj) | HashTable< T, edge, Hash< edge > > | inline |
set(const edge &key, T &&obj) | HashTable< T, edge, Hash< edge > > | inline |
setCapacity(label newCapacity) | HashTable< T, edge, Hash< edge > > | |
size() const noexcept | HashTable< T, edge, Hash< edge > > | inline |
size_type typedef | HashTable< T, edge, Hash< edge > > | |
sorted() | HashTable< T, edge, Hash< edge > > | |
sorted() const | HashTable< T, edge, Hash< edge > > | inline |
sortedToc() const | HashTable< T, edge, Hash< edge > > | |
sortedToc(const Compare &comp) const | HashTable< T, edge, Hash< edge > > | |
sortedToc(const Compare &comp) const | HashTable< T, edge, Hash< edge > > | |
swap(HashTable< T, edge, Hash< edge > > &rhs) noexcept | HashTable< T, edge, Hash< edge > > | |
this_type typedef | HashTable< T, edge, Hash< edge > > | |
toc() const | HashTable< T, edge, Hash< edge > > | |
tocEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
tocEntries(const BinaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
tocKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
tocKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
tocValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, edge, Hash< edge > > | |
tocValues(const UnaryPredicate &pred, const bool invert) const | HashTable< T, edge, Hash< edge > > | |
transfer(HashTable< T, edge, Hash< edge > > &rhs) | HashTable< T, edge, Hash< edge > > | |
value_type typedef | HashTable< T, edge, Hash< edge > > | |
writeKeys(Ostream &os, const label shortLen=0) const | HashTable< T, edge, Hash< edge > > | |
~HashTable() | HashTable< T, edge, Hash< edge > > | |