interfaceDefinitions Member List

This is the complete list of members for interfaceDefinitions, including all inherited members.

add(const interfaceEntry &entry)interfaceDefinitionsinline
at(const Key &key)HashTable< T, Key, Hash >inline
at(const Key &key) constHashTable< T, Key, Hash >inline
begin()HashTable< T, Key, Hash >inline
begin() constHashTable< T, Key, Hash >inline
canonicalSize(const label requested_size)HashTableCorestatic
capacity() const noexceptHashTable< T, Key, Hash >inline
cbegin() constHashTable< T, Key, Hash >inline
cend() const noexceptHashTable< T, Key, Hash >inline
cfind(const Key &key) constHashTable< T, Key, Hash >inline
ClassName("HashTable")HashTableCore
clear()interfaceDefinitionsinline
clearStorage()HashTable< T, Key, Hash >
const_iterator typedefMap< interfaceEntry >
const_key_iterator typedefHashTable< T, Key, Hash >
const_pointer typedefHashTable< T, Key, Hash >
const_reference typedefHashTable< T, Key, Hash >
countEntries(const BinaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
countEntries(const BinaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
countKeys(const UnaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
countKeys(const UnaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
countValues(const UnaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
countValues(const UnaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
csorted() constHashTable< T, Key, Hash >
difference_type typedefHashTable< T, Key, Hash >
emplace(const Key &key, Args &&... args)HashTable< T, Key, Hash >inline
emplace_set(const Key &key, Args &&... args)HashTable< T, Key, Hash >inline
empty() constinterfaceDefinitionsinline
end() noexceptHashTable< T, Key, Hash >inline
end() const noexceptHashTable< T, Key, Hash >inline
erase(const iterator &iter)HashTable< T, Key, Hash >
erase(const Key &key)HashTable< T, Key, Hash >
erase(const HashTable< AnyType, Key, AnyHash > &other)HashTable< T, Key, Hash >
erase(std::initializer_list< Key > keys)HashTable< T, Key, Hash >inline
erase(InputIter first, InputIter last)HashTable< T, Key, Hash >inline
erase(const FixedList< Key, N > &keys)HashTable< T, Key, Hash >inline
erase(const UList< Key > &keys)HashTable< T, Key, Hash >inline
erase(InputIter first, InputIter last)HashTable< T, Key, Hash >inline
erase(const FixedList< Key, N > &keys)HashTable< T, Key, Hash >inline
erase(const HashTable< AnyType, Key, AnyHash > &other)HashTable< T, Key, Hash >
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 >
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) constHashTable< T, Key, Hash >inline
found(const Key &key) constHashTable< T, Key, Hash >inline
hasher typedefHashTable< T, Key, Hash >
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()=defaultHashTableCore
insert(const Key &key, const T &obj)HashTable< T, Key, Hash >inline
insert(const Key &key, T &&obj)HashTable< T, Key, Hash >inline
interfaceDefinitions()interfaceDefinitionsinline
interfaceName(label bndId)interfaceDefinitionsinline
isInterface(label bndId)interfaceDefinitionsinline
iterator typedefMap< interfaceEntry >
iterator_erase(node_type *&entry, label &index)HashTable< T, Key, Hash >protected
key_iterator typedefHashTable< T, Key, Hash >
key_type typedefHashTable< T, Key, Hash >
keys() constHashTable< T, Key, Hash >inline
lookup(const Key &key, const T &deflt) constHashTable< T, Key, Hash >inline
Map()Map< interfaceEntry >inline
Map(const label size)Map< interfaceEntry >inlineexplicit
Map(Istream &is)Map< interfaceEntry >inline
Map(const this_type &map)Map< interfaceEntry >inline
Map(this_type &&map)Map< interfaceEntry >inline
Map(std::initializer_list< std::pair< label, interfaceEntry > > map)Map< interfaceEntry >inline
mapped_type typedefHashTable< T, Key, Hash >
maxTableSizeHashTableCorestatic
node_type typedefHashTable< T, Key, Hash >
operator!=(const this_type &rhs) constHashTable< 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<<interfaceDefinitionsfriend
operator=(const this_type &rhs)Map< interfaceEntry >inline
operator=(this_type &&rhs)Map< interfaceEntry >inline
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) constHashTable< T, Key, Hash >
operator[](const Key &key)HashTable< T, Key, Hash >inline
operator[](const Key &key) constHashTable< T, Key, Hash >inline
parent_type typedefMap< interfaceEntry >
pointer typedefHashTable< T, Key, Hash >
printInfo(Ostream &os) constHashTable< T, Key, Hash >
reference typedefHashTable< T, Key, Hash >
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 Key &key, const T &obj)HashTable< T, Key, Hash >inline
set(const Key &key, T &&obj)HashTable< T, Key, Hash >inline
size() constinterfaceDefinitionsinline
size_type typedefHashTable< T, Key, Hash >
sorted() constHashTable< T, Key, Hash >
sorted()HashTable< T, Key, Hash >
sortedToc() constHashTable< T, Key, Hash >
sortedToc(const Compare &comp) constHashTable< T, Key, Hash >
sortedToc(const Compare &comp) constHashTable< T, Key, Hash >
swap(HashTable< T, Key, Hash > &rhs)HashTable< T, Key, Hash >
this_type typedefMap< interfaceEntry >
toc() constHashTable< T, Key, Hash >
tocEntries(const BinaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
tocEntries(const BinaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
tocKeys(const UnaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
tocKeys(const UnaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
tocValues(const UnaryPredicate &pred, const bool invert=false) constHashTable< T, Key, Hash >
tocValues(const UnaryPredicate &pred, const bool invert) constHashTable< T, Key, Hash >
transfer(HashTable< T, Key, Hash > &rhs)HashTable< T, Key, Hash >
value_type typedefHashTable< T, Key, Hash >
writeKeys(Ostream &os, const label shortLen=0) constHashTable< T, Key, Hash >
~HashTable()HashTable< T, Key, Hash >