This is the complete list of members for IOobjectList, including all inherited members.
add(autoPtr< IOobject > &objectPtr) | IOobjectList | |
add(autoPtr< IOobject > &&objectPtr) | IOobjectList | |
allNames() const | IOobjectList | |
allNames() const | IOobjectList | |
allNames() const | IOobjectList | |
append(const IOobjectList &other) | IOobjectList | |
append(IOobjectList &&other) | IOobjectList | |
at(const Key &key) | HashTable< T, Key, Hash > | inline |
at(const Key &key) const | HashTable< T, Key, Hash > | inline |
begin() | HashTable< T, Key, Hash > | inline |
begin() const | HashTable< T, Key, Hash > | inline |
canonicalSize(const label requested_size) | HashTableCore | static |
capacity() const noexcept | HashTable< T, Key, Hash > | inline |
cbegin() const | HashTable< T, Key, Hash > | inline |
cend() const noexcept | HashTable< T, Key, Hash > | inline |
cfind(const Key &key) const | HashTable< T, Key, Hash > | inline |
cfindObject(const word &objName) const | IOobjectList | |
cfindObject(const word &objName) const | IOobjectList | |
cfindObject(const word &objName) const | IOobjectList | |
checkNames(const bool syncPar=true) const | IOobjectList | |
classes() const | IOobjectList | |
classes(const MatchPredicate &matchName) const | IOobjectList | |
classes(const MatchPredicate &matchName) const | IOobjectList | |
classesImpl(const IOobjectList &list, const MatchPredicate &matchName) | IOobjectList | |
ClassName("HashTable") | HashTableCore | |
clear() | HashPtrTable< IOobject > | |
clearStorage() | HashTable< T, Key, Hash > | |
const_iterator typedef | HashPtrTable< IOobject > | |
const_key_iterator typedef | HashTable< T, Key, Hash > | |
const_pointer typedef | HashTable< T, Key, Hash > | |
const_reference typedef | HashTable< T, Key, Hash > | |
count(const char *clsName) const | IOobjectList | |
count(const MatchPredicate &matchClass) const | IOobjectList | |
count(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
count() const | IOobjectList | |
count(const MatchPredicate &matchName) const | IOobjectList | |
count(const MatchPredicate &matchClass) const | IOobjectList | |
count(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
count() const | IOobjectList | |
count(const MatchPredicate &matchName) const | IOobjectList | |
countEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
countEntries(const BinaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
countImpl(const IOobjectList &list, const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) | IOobjectList | |
countKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
countKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
countTypeImpl(const IOobjectList &list, const MatchPredicate &matchName) | IOobjectList | |
countValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
countValues(const UnaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
csorted() const | HashTable< T, Key, Hash > | |
difference_type typedef | HashTable< T, Key, Hash > | |
emplace(const word &key, Args &&... args) | HashPtrTable< IOobject > | inline |
emplace_set(const word &key, Args &&... args) | HashPtrTable< IOobject > | inline |
empty() const noexcept | HashTable< T, Key, Hash > | inline |
end() noexcept | HashTable< T, Key, Hash > | inline |
end() const noexcept | HashTable< T, Key, Hash > | inline |
erase(iterator &iter) | HashPtrTable< IOobject > | |
erase(const word &key) | HashPtrTable< IOobject > | |
Foam::HashTable::erase(const iterator &iter) | HashTable< T, Key, Hash > | |
Foam::HashTable::erase(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< T, Key, Hash > | |
Foam::HashTable::erase(std::initializer_list< Key > keys) | HashTable< T, Key, Hash > | inline |
Foam::HashTable::erase(InputIter first, InputIter last) | HashTable< T, Key, Hash > | inline |
Foam::HashTable::erase(const FixedList< Key, N > &keys) | HashTable< T, Key, Hash > | inline |
Foam::HashTable::erase(const UList< Key > &keys) | HashTable< T, Key, Hash > | inline |
filterClasses(const UnaryPredicate &pred, const bool pruning=false) | IOobjectList | |
filterClasses(const UnaryPredicate &pred, const bool pruning) | IOobjectList | |
filterEntries(const BinaryPredicate &pred, const bool pruning=false) | HashTable< T, Key, Hash > | |
filterEntries(const BinaryPredicate &pred, const bool pruning) | HashTable< T, Key, Hash > | |
filterKeys(const UnaryPredicate &pred, const bool pruning=false) | HashTable< T, Key, Hash > | |
filterKeys(const UnaryPredicate &pred, const bool pruning) | HashTable< T, Key, Hash > | |
filterObjects(const UnaryPredicate &pred, const bool pruning=false) | IOobjectList | |
filterObjects(const UnaryPredicate &pred, const bool pruning) | IOobjectList | |
filterValues(const UnaryPredicate &pred, const bool pruning=false) | HashTable< T, Key, Hash > | |
filterValues(const UnaryPredicate &pred, const bool pruning) | HashTable< T, Key, Hash > | |
find(const Key &key) | HashTable< T, Key, Hash > | inline |
find(const Key &key) const | HashTable< T, Key, Hash > | inline |
findObject(const word &objName) const | IOobjectList | |
findObject(const word &objName) const | IOobjectList | |
findObject(const word &objName) | IOobjectList | |
findObject(const word &objName) | IOobjectList | |
findObject(const word &objName) const | IOobjectList | |
findObject(const word &objName) | IOobjectList | |
found(const Key &key) const | HashTable< T, Key, Hash > | inline |
get(const word &key) const | HashPtrTable< IOobject > | inline |
getObject(const word &objName) const | IOobjectList | |
getObject(const word &objName) const | IOobjectList | |
getObject(const word &objName) const | IOobjectList | |
hasher typedef | HashTable< T, Key, Hash > | |
HashPtrTable()=default | HashPtrTable< IOobject > | |
HashPtrTable(const label size) | HashPtrTable< IOobject > | inlineexplicit |
HashPtrTable(Istream &is, const INew &inew) | HashPtrTable< IOobject > | |
HashPtrTable(Istream &is) | HashPtrTable< IOobject > | |
HashPtrTable(const dictionary &dict) | HashPtrTable< IOobject > | explicit |
HashPtrTable(const this_type &rhs) | HashPtrTable< IOobject > | |
HashPtrTable(this_type &&rhs) | HashPtrTable< IOobject > | |
HashTable() | HashTable< T, Key, Hash > | |
HashTable(const label size) | HashTable< T, Key, Hash > | explicit |
HashTable(Istream &is, const label size=128) | HashTable< T, Key, Hash > | |
HashTable(const this_type &ht) | HashTable< T, Key, Hash > | |
HashTable(this_type &&rhs) | HashTable< T, Key, Hash > | |
HashTable(std::initializer_list< std::pair< Key, T > > list) | HashTable< T, Key, Hash > | |
HashTableCore()=default | HashTableCore | |
insert(const word &, IOobject *)=delete | HashPtrTable< IOobject > | inline |
insert(const word &key, autoPtr< IOobject > &ptr) | HashPtrTable< IOobject > | inline |
insert(const word &key, autoPtr< IOobject > &&ptr) | HashPtrTable< IOobject > | inline |
insert(const word &key, std::unique_ptr< IOobject > &&ptr) | HashPtrTable< IOobject > | inline |
Foam::HashTable::insert(const Key &key, const T &obj) | HashTable< T, Key, Hash > | inline |
Foam::HashTable::insert(const Key &key, T &&obj) | HashTable< T, Key, Hash > | inline |
IOobjectList() | IOobjectList | |
IOobjectList(const label nObjects) | IOobjectList | explicit |
IOobjectList(const IOobjectList &list) | IOobjectList | |
IOobjectList(IOobjectList &&list) | IOobjectList | |
IOobjectList(const objectRegistry &db, const fileName &instance, const fileName &local="", IOobject::readOption rOpt=IOobject::MUST_READ, IOobject::writeOption wOpt=IOobject::NO_WRITE, bool registerObject=true) | IOobjectList | |
iterator typedef | HashPtrTable< IOobject > | |
iterator_erase(node_type *&entry, label &index) | HashTable< T, Key, Hash > | protected |
key_iterator typedef | HashTable< T, Key, Hash > | |
key_type typedef | HashTable< T, Key, Hash > | |
keys() const | HashTable< T, Key, Hash > | inline |
lookup(const MatchPredicate &matchName) const | IOobjectList | |
lookup(const char *objName) const | IOobjectList | inline |
lookup(const word &objName) const | IOobjectList | inline |
lookup(const MatchPredicate &matchName) const | IOobjectList | |
HashPtrTable< IOobject >::lookup(const Key &key, const T &deflt) const | HashTable< T, Key, Hash > | inline |
lookupClass(const char *clsName) const | IOobjectList | |
lookupClass(const MatchPredicate &matchClass) const | IOobjectList | |
lookupClass(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
lookupClass() const | IOobjectList | |
lookupClass(const MatchPredicate &matchName) const | IOobjectList | |
lookupClass(const MatchPredicate &matchClass) const | IOobjectList | |
lookupClass(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
lookupClass() const | IOobjectList | |
lookupClass(const MatchPredicate &matchName) const | IOobjectList | |
lookupClassImpl(const IOobjectList &list, const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) | IOobjectList | |
lookupClassTypeImpl(const IOobjectList &list, const MatchPredicate &matchName) | IOobjectList | |
lookupImpl(const IOobjectList &list, const MatchPredicate &matchName) | IOobjectList | |
mapped_type typedef | HashTable< T, Key, Hash > | |
maxTableSize | HashTableCore | static |
names() const | IOobjectList | |
names(const bool syncPar) const | IOobjectList | |
names(const char *clsName) const | IOobjectList | |
names(const char *clsName, const bool syncPar) const | IOobjectList | |
names(const MatchPredicate &matchClass) const | IOobjectList | |
names(const MatchPredicate &matchClass, const bool syncPar) const | IOobjectList | |
names(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
names(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName, const bool syncPar) const | IOobjectList | |
names() const | IOobjectList | |
names(bool syncPar) const | IOobjectList | |
names(const MatchPredicate &matchName) const | IOobjectList | |
names(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
names(const MatchPredicate &matchClass) const | IOobjectList | |
names(const MatchPredicate &matchClass, const bool syncPar) const | IOobjectList | |
names(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
names(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName, const bool syncPar) const | IOobjectList | |
names() const | IOobjectList | |
names(const bool syncPar) const | IOobjectList | |
names(const MatchPredicate &matchName) const | IOobjectList | |
names(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
namesImpl(const IOobjectList &list, const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName, const bool doSort) | IOobjectList | |
namesTypeImpl(const IOobjectList &list, const MatchPredicate &matchName, const bool doSort) | IOobjectList | |
node_type typedef | HashTable< T, Key, Hash > | |
objectsTypeImpl(const IOobjectList &list, const MatchPredicate &matchName) | IOobjectList | |
operator!=(const this_type &rhs) const | HashTable< T, Key, Hash > | |
operator()(const Key &key) | HashTable< T, Key, Hash > | inline |
operator()(const Key &key, const T &deflt) | HashTable< T, Key, Hash > | inline |
operator+=(const this_type &rhs) | HashTable< T, Key, Hash > | |
operator=(const IOobjectList &)=delete | IOobjectList | |
operator=(IOobjectList &&list) | IOobjectList | |
HashPtrTable< IOobject >::operator=(const this_type &rhs) | HashPtrTable< IOobject > | |
HashPtrTable< IOobject >::operator=(this_type &&rhs) | HashPtrTable< IOobject > | |
Foam::HashTable::operator=(const this_type &rhs) | HashTable< T, Key, Hash > | |
Foam::HashTable::operator=(std::initializer_list< std::pair< Key, T > > rhs) | HashTable< T, Key, Hash > | |
Foam::HashTable::operator=(this_type &&rhs) | HashTable< T, Key, Hash > | |
operator==(const this_type &rhs) const | HashTable< T, Key, Hash > | |
operator[](const Key &key) | HashTable< T, Key, Hash > | inline |
operator[](const Key &key) const | HashTable< T, Key, Hash > | inline |
parent_type typedef | HashPtrTable< IOobject > | |
pointer typedef | HashTable< T, Key, Hash > | |
printInfo(Ostream &os) const | HashTable< T, Key, Hash > | |
prune_0() | IOobjectList | |
reference typedef | HashTable< T, Key, Hash > | |
release(iterator &iter) | HashPtrTable< IOobject > | |
release(const word &key) | HashPtrTable< IOobject > | |
remove(const IOobject &io) | IOobjectList | |
HashPtrTable< IOobject >::remove(iterator &iter) | HashPtrTable< IOobject > | |
HashPtrTable< IOobject >::remove(const word &key) | HashPtrTable< IOobject > | |
resize(const label sz) | HashTable< T, Key, Hash > | |
retain(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< T, Key, Hash > | |
retain(const HashTable< AnyType, Key, AnyHash > &other) | HashTable< T, Key, Hash > | |
set(const word &key, IOobject *ptr) | HashPtrTable< IOobject > | inline |
set(const word &key, autoPtr< IOobject > &ptr) | HashPtrTable< IOobject > | inline |
set(const word &key, autoPtr< IOobject > &&ptr) | HashPtrTable< IOobject > | inline |
set(const word &key, std::unique_ptr< IOobject > &&ptr) | HashPtrTable< IOobject > | inline |
Foam::HashTable::set(const Key &key, const T &obj) | HashTable< T, Key, Hash > | inline |
Foam::HashTable::set(const Key &key, T &&obj) | HashTable< T, Key, Hash > | inline |
size() const noexcept | HashTable< T, Key, Hash > | inline |
size_type typedef | HashTable< T, Key, Hash > | |
sorted() const | IOobjectList | |
sorted(const bool syncPar) const | IOobjectList | |
sorted() const | IOobjectList | |
sorted(const bool syncPar) const | IOobjectList | |
sorted(const MatchPredicate &matchName) const | IOobjectList | |
sorted(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
sorted() const | IOobjectList | |
sorted(const bool syncPar) const | IOobjectList | |
sorted(const MatchPredicate &matchName) const | IOobjectList | |
sorted(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
HashPtrTable< IOobject >::sorted() | HashTable< T, Key, Hash > | |
sortedNames() const | IOobjectList | |
sortedNames(const bool syncPar) const | IOobjectList | |
sortedNames(const char *clsName) const | IOobjectList | |
sortedNames(const char *clsName, const bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate &matchClass) const | IOobjectList | |
sortedNames(const MatchPredicate &matchClass, const bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
sortedNames(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName, const bool syncPar) const | IOobjectList | |
sortedNames() const | IOobjectList | |
sortedNames(bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate &matchName) const | IOobjectList | |
sortedNames(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate &matchClass) const | IOobjectList | |
sortedNames(const MatchPredicate &matchClass, const bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName) const | IOobjectList | |
sortedNames(const MatchPredicate1 &matchClass, const MatchPredicate2 &matchName, const bool syncPar) const | IOobjectList | |
sortedNames() const | IOobjectList | |
sortedNames(const bool syncPar) const | IOobjectList | |
sortedNames(const MatchPredicate &matchName) const | IOobjectList | |
sortedNames(const MatchPredicate &matchName, const bool syncPar) const | IOobjectList | |
sortedToc() const | HashTable< T, Key, Hash > | |
sortedToc(const Compare &comp) const | HashTable< T, Key, Hash > | |
sortedToc(const Compare &comp) const | HashTable< T, Key, Hash > | |
swap(HashTable< T, Key, Hash > &rhs) | HashTable< T, Key, Hash > | |
this_type typedef | HashPtrTable< IOobject > | |
toc() const | HashTable< T, Key, Hash > | |
tocEntries(const BinaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
tocEntries(const BinaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
tocKeys(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
tocKeys(const UnaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
tocValues(const UnaryPredicate &pred, const bool invert=false) const | HashTable< T, Key, Hash > | |
tocValues(const UnaryPredicate &pred, const bool invert) const | HashTable< T, Key, Hash > | |
transfer(HashTable< T, Key, Hash > &rhs) | HashTable< T, Key, Hash > | |
value_type typedef | HashTable< T, Key, Hash > | |
write(Ostream &os) const | HashPtrTable< IOobject > | |
writeKeys(Ostream &os, const label shortLen=0) const | HashTable< T, Key, Hash > | |
~HashPtrTable() | HashPtrTable< IOobject > | |
~HashTable() | HashTable< T, Key, Hash > | |
~IOobjectList()=default | IOobjectList |