Map< T > Member List

This is the complete list of members for Map< T >, including all inherited members.

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