| add(const scalar valueToAdd) | distribution | |
| add(const label valueToAdd) | distribution | |
| approxTotalEntries() const | distribution | |
| begin() | HashTable< T, Key, Hash > | inline |
| begin() const | HashTable< T, Key, Hash > | inline |
| binWidth() const | distribution | inline |
| capacity() const | HashTable< T, Key, Hash > | inline |
| cbegin() const | HashTable< T, Key, Hash > | inline |
| cend() | HashTableCore | inlinestatic |
| ClassName("HashTable") | HashTableCore | |
| clear() | HashTable< T, Key, Hash > | |
| clearStorage() | HashTable< T, Key, Hash > | |
| const_iterator typedef | Map< label > | |
| const_reference typedef | HashTable< T, Key, Hash > | |
| distribution() | distribution | |
| distribution(const scalar binWidth) | distribution | |
| distribution(const distribution &) | distribution | |
| empty() const | HashTable< T, Key, Hash > | inline |
| end() | HashTableCore | inlinestatic |
| erase(const iterator &) | HashTable< T, Key, Hash > | |
| erase(const Key &) | HashTable< T, Key, Hash > | |
| erase(const UList< Key > &) | HashTable< T, Key, Hash > | |
| erase(const HashTable< AnyType, Key, AnyHash > &) | HashTable< T, Key, Hash > | |
| erase(const HashTable< AnyType, Key, AnyHash > &rhs) | HashTable< T, Key, Hash > | |
| find(const Key &) | HashTable< T, Key, Hash > | |
| find(const Key &) const | HashTable< T, Key, Hash > | |
| found(const Key &) const | HashTable< T, Key, Hash > | |
| HashTable(const label size=128) | HashTable< T, Key, Hash > | |
| HashTable(Istream &, const label size=128) | HashTable< T, Key, Hash > | |
| HashTable(const HashTable< T, Key, Hash > &) | HashTable< T, Key, Hash > | |
| HashTable(const Xfer< HashTable< T, Key, Hash >> &) | HashTable< T, Key, Hash > | |
| HashTableCore() | HashTableCore | inline |
| insert(const Key &, const T &newElmt) | HashTable< T, Key, Hash > | inline |
| insertMissingKeys() | distribution | |
| iterator typedef | Map< label > | |
| Map(const label size=128) | Map< label > | inline |
| Map(Istream &is) | Map< label > | inline |
| Map(const Map< label > &map) | Map< label > | inline |
| Map(const Xfer< Map< label >> &map) | Map< label > | inline |
| Map(const Xfer< HashTable< label, label, Hash< label >>> &map) | Map< label > | inline |
| maxTableSize | HashTableCore | static |
| mean() const | distribution | |
| median() | distribution | |
| normalised() | distribution | |
| normalisedMinusMean() | distribution | |
| normalisedShifted(scalar shiftValue) | distribution | |
| operator!=(const HashTable< T, Key, Hash > &) const | HashTable< T, Key, Hash > | |
| operator()(const Key &) | HashTable< T, Key, Hash > | inline |
| operator<<(Ostream &, const distribution &) | distribution | friend |
| operator=(const distribution &) | distribution | |
| Map< label >::operator=(const HashTable< T, Key, Hash > &) | HashTable< T, Key, Hash > | |
| operator==(const HashTable< T, Key, Hash > &) const | HashTable< T, Key, Hash > | |
| operator[](const Key &) | HashTable< T, Key, Hash > | inline |
| operator[](const Key &) const | HashTable< T, Key, Hash > | inline |
| printInfo(Ostream &) const | HashTable< T, Key, Hash > | |
| raw() | distribution | |
| reference typedef | HashTable< T, Key, Hash > | |
| resize(const label newSize) | HashTable< T, Key, Hash > | |
| set(const Key &, const T &newElmt) | HashTable< T, Key, Hash > | inline |
| shrink() | HashTable< T, Key, Hash > | |
| size() const | HashTable< T, Key, Hash > | inline |
| size_type typedef | HashTable< T, Key, Hash > | |
| sortedToc() const | HashTable< T, Key, Hash > | |
| toc() const | HashTable< T, Key, Hash > | |
| totalEntries() const | distribution | |
| transfer(HashTable< T, Key, Hash > &) | HashTable< T, Key, Hash > | |
| TypeName("distribution") | distribution | |
| value_type typedef | HashTable< T, Key, Hash > | |
| write(const fileName &file, const List< Pair< scalar >> &pairs) | distribution | static |
| xfer() | HashTable< T, Key, Hash > | inline |
| ~distribution() | distribution | virtual |
| ~HashTable() | HashTable< T, Key, Hash > | |
1.8.11
