append(const dictionary &) | boundaryRegion | |
begin() | HashTable< T, Key, Hash > | inline |
begin() const | HashTable< T, Key, Hash > | inline |
boundaryRegion() | boundaryRegion | |
boundaryRegion(const objectRegistry &, const word &name="boundaryRegion", const fileName &instance="constant") | boundaryRegion | |
boundaryType(const word &name) const | boundaryRegion | |
boundaryTypes() const | boundaryRegion | |
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< dictionary > | |
const_reference typedef | HashTable< T, Key, Hash > | |
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 > | |
findIndex(const word &name) const | boundaryRegion | |
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 |
iterator typedef | Map< dictionary > | |
Map(const label size=128) | Map< dictionary > | inline |
Map(Istream &is) | Map< dictionary > | inline |
Map(const Map< dictionary > &map) | Map< dictionary > | inline |
Map(const Xfer< Map< dictionary >> &map) | Map< dictionary > | inline |
Map(const Xfer< HashTable< dictionary, label, Hash< label >>> &map) | Map< dictionary > | inline |
maxTableSize | HashTableCore | static |
names() const | boundaryRegion | |
names(const UList< wordRe > &patterns) const | boundaryRegion | |
operator!=(const HashTable< T, Key, Hash > &) const | HashTable< T, Key, Hash > | |
operator()(const Key &) | HashTable< T, Key, Hash > | inline |
operator=(const boundaryRegion &) | boundaryRegion | |
operator=(const Map< dictionary > &) | boundaryRegion | |
Map< dictionary >::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 > | |
readDict(const objectRegistry &, const word &name="boundaryRegion", const fileName &instance="constant") | boundaryRegion | |
reference typedef | HashTable< T, Key, Hash > | |
rename(const dictionary &) | boundaryRegion | |
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 > | |
transfer(HashTable< T, Key, Hash > &) | HashTable< T, Key, Hash > | |
value_type typedef | HashTable< T, Key, Hash > | |
writeDict(const objectRegistry &, const word &name="boundaryRegion", const fileName &instance="constant") const | boundaryRegion | |
xfer() | HashTable< T, Key, Hash > | inline |
~boundaryRegion() | boundaryRegion | |
~HashTable() | HashTable< T, Key, Hash > | |