| assignMany(const label nItems, InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| at(const Key &key) | HashTable< zero::null, Key, Hash > | inline |
| at(const Key &key) const | HashTable< zero::null, Key, Hash > | inline |
| begin() | HashSet< Key, Hash > | inline |
| begin() const | HashSet< Key, Hash > | inline |
| capacity() const noexcept | HashTable< zero::null, Key, Hash > | inline |
| cbegin() const | HashSet< Key, Hash > | inline |
| cend() const noexcept | HashSet< Key, Hash > | inline |
| cfind(const Key &key) const | HashTable< zero::null, Key, Hash > | inline |
| clear() | HashTable< zero::null, Key, Hash > | |
| clearStorage() | HashTable< zero::null, Key, Hash > | |
| const_iterator typedef | HashSet< Key, Hash > | |
| const_key_iterator typedef | HashTable< zero::null, Key, Hash > | |
| const_pointer | HashTable< zero::null, Key, Hash > | |
| const_reference | HashTable< zero::null, Key, Hash > | |
| countEntries(const BinaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::countEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| countKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| countKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< zero::null, Key, Hash > | |
| countValues(const UnaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::countValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| difference_type typedef | HashTable< zero::null, Key, Hash > | |
| emplace(const Key &key, Args &&... args) | HashTable< zero::null, Key, Hash > | inline |
| emplace_set(const Key &key, Args &&... args) | HashTable< zero::null, Key, Hash > | inline |
| empty() const noexcept | HashTable< zero::null, Key, Hash > | inline |
| end() noexcept | HashSet< Key, Hash > | inline |
| end() const noexcept | HashSet< Key, Hash > | inline |
| erase(const iterator &iter) | HashTable< zero::null, Key, Hash > | |
| erase(const Key &key) | HashTable< zero::null, Key, Hash > | |
| erase(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< zero::null, Key, Hash > | |
| erase(std::initializer_list< Key > keys) | HashTable< zero::null, Key, Hash > | inline |
| erase(InputIter first, InputIter last) | HashTable< zero::null, Key, Hash > | inline |
| erase(const FixedList< Key, N > &keys) | HashTable< zero::null, Key, Hash > | inline |
| erase(const UList< Key > &keys) | HashTable< zero::null, Key, Hash > | inline |
| erase(InputIter first, InputIter last) | HashTable< zero::null, Key, Hash > | inline |
| erase(const FixedList< Key, N > &keys) | HashTable< zero::null, Key, Hash > | inline |
| erase(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< zero::null, Key, Hash > | |
| filterEntries(const BinaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| filterKeys(const UnaryPredicate &pred, const bool pruning=false) | HashTable< zero::null, Key, Hash > | |
| filterKeys(const UnaryPredicate &pred, const bool pruning) | HashTable< zero::null, Key, Hash > | |
| filterValues(const UnaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| find(const Key &key) | HashTable< zero::null, Key, Hash > | inline |
| find(const Key &key) const | HashTable< zero::null, Key, Hash > | inline |
| found(const Key &key) const | HashTable< zero::null, Key, Hash > | inline |
| hasher typedef | HashTable< zero::null, Key, Hash > | |
| HashSet() | HashSet< Key, Hash > | inline |
| HashSet(const this_type &rhs) | HashSet< Key, Hash > | inline |
| HashSet(this_type &&rhs) | HashSet< Key, Hash > | inline |
| HashSet(const label size) | HashSet< Key, Hash > | inlineexplicit |
| HashSet(Istream &is) | HashSet< Key, Hash > | inlineexplicit |
| HashSet(const FixedList< Key, N > &list) | HashSet< Key, Hash > | explicit |
| HashSet(const UList< Key > &list) | HashSet< Key, Hash > | explicit |
| HashSet(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | explicit |
| HashSet(std::initializer_list< Key > list) | HashSet< Key, Hash > | |
| HashSet(const HashTable< AnyType, Key, AnyHash > &tbl) | HashSet< Key, Hash > | explicit |
| HashTable() | HashTable< zero::null, Key, Hash > | |
| HashTable(const label size) | HashTable< zero::null, Key, Hash > | explicit |
| HashTable(Istream &is, const label size=128) | HashTable< zero::null, Key, Hash > | |
| HashTable(const this_type &ht) | HashTable< zero::null, Key, Hash > | |
| HashTable(this_type &&rhs) | HashTable< zero::null, Key, Hash > | |
| HashTable(std::initializer_list< std::pair< Key, zero::null >> list) | HashTable< zero::null, Key, Hash > | |
| insert(const Key &key) | HashSet< Key, Hash > | inline |
| insert(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| insert(std::initializer_list< Key > list) | HashSet< Key, Hash > | inline |
| insert(const FixedList< Key, N > &list) | HashSet< Key, Hash > | inline |
| insert(const UList< Key > &list) | HashSet< Key, Hash > | inline |
| insert(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | inline |
| insert(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| insert(const FixedList< Key, N > &list) | HashSet< Key, Hash > | inline |
| insert(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::insert(const Key &key, const zero::null &obj) | HashTable< zero::null, Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::insert(const Key &key, zero::null &&obj) | HashTable< zero::null, Key, Hash > | inline |
| iterator typedef | HashSet< Key, Hash > | |
| iterator_erase(node_type *&entry, label &index) | HashTable< zero::null, Key, Hash > | protected |
| key_iterator typedef | HashTable< zero::null, Key, Hash > | |
| key_type typedef | HashTable< zero::null, Key, Hash > | |
| keys() const | HashTable< zero::null, Key, Hash > | inline |
| lookup(const Key &key, const zero::null &deflt) const | HashTable< zero::null, Key, Hash > | inline |
| mapped_type typedef | HashTable< zero::null, Key, Hash > | |
| operator!=(const this_type &rhs) const | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::operator!=(const this_type &rhs) const | HashTable< zero::null, Key, Hash > | |
| operator&=(const this_type &rhs) | HashSet< Key, Hash > | inline |
| operator()(const Key &key) const noexcept | HashSet< Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::operator()(const Key &key) | HashTable< zero::null, Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::operator()(const Key &key, const zero::null &deflt) | HashTable< zero::null, Key, Hash > | inline |
| operator+=(const this_type &rhs) | HashSet< Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::operator+=(const this_type &rhs) | HashTable< zero::null, Key, Hash > | |
| operator-=(const this_type &rhs) | HashSet< Key, Hash > | inline |
| operator=(const this_type &rhs) | HashSet< Key, Hash > | inline |
| operator=(this_type &&rhs) | HashSet< Key, Hash > | inline |
| operator=(const UList< Key > &rhs) | HashSet< Key, Hash > | |
| operator=(const FixedList< Key, N > &rhs) | HashSet< Key, Hash > | |
| operator=(std::initializer_list< Key > rhs) | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::operator=(const this_type &rhs) | HashTable< zero::null, Key, Hash > | |
| HashTable< zero::null, Key, Hash >::operator=(std::initializer_list< std::pair< Key, zero::null >> rhs) | HashTable< zero::null, Key, Hash > | |
| HashTable< zero::null, Key, Hash >::operator=(this_type &&rhs) | HashTable< zero::null, Key, Hash > | |
| operator==(const this_type &rhs) const | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::operator==(const this_type &rhs) const | HashTable< zero::null, Key, Hash > | |
| operator[](const Key &key) const noexcept | HashSet< Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::operator[](const Key &key) | HashTable< zero::null, Key, Hash > | inline |
| operator^=(const this_type &rhs) | HashSet< Key, Hash > | |
| operator|=(const this_type &rhs) | HashSet< Key, Hash > | |
| parent_type typedef | HashSet< Key, Hash > | |
| pointer typedef | HashTable< zero::null, Key, Hash > | |
| printInfo(Ostream &os) const | HashTable< zero::null, Key, Hash > | |
| reference typedef | HashTable< zero::null, Key, Hash > | |
| resize(const label sz) | HashTable< zero::null, Key, Hash > | |
| retain(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< zero::null, Key, Hash > | |
| retain(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< zero::null, Key, Hash > | |
| set(const Key &key) | HashSet< Key, Hash > | inline |
| set(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| set(std::initializer_list< Key > list) | HashSet< Key, Hash > | inline |
| set(const FixedList< Key, N > &list) | HashSet< Key, Hash > | inline |
| set(const UList< Key > &list) | HashSet< Key, Hash > | inline |
| set(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::set(const Key &key, const zero::null &obj) | HashTable< zero::null, Key, Hash > | inline |
| HashTable< zero::null, Key, Hash >::set(const Key &key, zero::null &&obj) | HashTable< zero::null, Key, Hash > | inline |
| setMany(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| size() const noexcept | HashTable< zero::null, Key, Hash > | inline |
| size_type typedef | HashTable< zero::null, Key, Hash > | |
| sortedToc() const | HashTable< zero::null, Key, Hash > | |
| sortedToc(const Compare &comp) const | HashTable< zero::null, Key, Hash > | |
| sortedToc(const Compare &comp) const | HashTable< zero::null, Key, Hash > | |
| swap(HashTable< zero::null, Key, Hash > &rhs) | HashTable< zero::null, Key, Hash > | |
| test(const Key &key) const noexcept | HashSet< Key, Hash > | inline |
| this_type typedef | HashSet< Key, Hash > | |
| toc() const | HashTable< zero::null, Key, Hash > | |
| tocEntries(const BinaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::tocEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| tocKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| tocKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< zero::null, Key, Hash > | |
| tocValues(const UnaryPredicate &, const bool)=delete | HashSet< Key, Hash > | |
| HashTable< zero::null, Key, Hash >::tocValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< zero::null, Key, Hash > | |
| transfer(HashTable< zero::null, Key, Hash > &rhs) | HashTable< zero::null, Key, Hash > | |
| unset(const Key &key) | HashSet< Key, Hash > | inline |
| unset(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| unset(std::initializer_list< Key > list) | HashSet< Key, Hash > | inline |
| unset(const FixedList< Key, N > &list) | HashSet< Key, Hash > | inline |
| unset(const UList< Key > &list) | HashSet< Key, Hash > | inline |
| unset(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | inline |
| unset(InputIter first, InputIter last) | HashSet< Key, Hash > | inline |
| unset(const FixedList< Key, N > &list) | HashSet< Key, Hash > | inline |
| unset(const IndirectListBase< Key, Addr > &list) | HashSet< Key, Hash > | inline |
| value_type typedef | HashTable< zero::null, Key, Hash > | |
| writeKeys(Ostream &os, const label shortLen=0) const | HashTable< zero::null, Key, Hash > | |
| writeList(Ostream &os, const label shortLen=0) const | HashSet< Key, Hash > | inline |
| ~HashTable() | HashTable< zero::null, Key, Hash > | |
1.8.17 