HashPtrTable< T, Key, Hash > Member List

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

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
ClassName("HashTable")	HashTableCore
clear()	HashPtrTable< T, Key, Hash >
clearStorage()	HashTable< T *, Key, Hash >
const_iterator typedef	HashPtrTable< T, Key, Hash >
const_key_iterator typedef	HashTable< T *, Key, Hash >
const_pointer typedef	HashTable< T *, Key, Hash >
const_reference typedef	HashTable< T *, Key, Hash >
contains(const Key &key) const	HashTable< T *, Key, Hash >	inline
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 >
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 >
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 Key &key, Args &&... args)	HashPtrTable< T, Key, Hash >	inline
emplace_set(const Key &key, Args &&... args)	HashPtrTable< T, Key, Hash >	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< T, Key, Hash >
erase(const Key &key)	HashPtrTable< T, Key, Hash >
HashTable< T *, Key, Hash >::erase(const iterator &iter)	HashTable< T *, Key, Hash >
HashTable< T *, Key, Hash >::erase(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< T *, Key, Hash >
HashTable< T *, Key, Hash >::erase(std::initializer_list< Key > keys)	HashTable< T *, Key, Hash >	inline
HashTable< T *, Key, Hash >::erase(InputIter first, InputIter last)	HashTable< T *, Key, Hash >	inline
HashTable< T *, Key, Hash >::erase(const FixedList< Key, N > &keys)	HashTable< T *, Key, Hash >	inline
HashTable< T *, Key, Hash >::erase(const UList< Key > &keys)	HashTable< T *, Key, Hash >	inline
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) const	HashTable< T *, Key, Hash >	inline
found(const Key &key) const	HashTable< T *, Key, Hash >	inline
get(const Key &key) const	HashPtrTable< T, Key, Hash >	inline
hasher typedef	HashTable< T *, Key, Hash >
HashPtrTable()=default	HashPtrTable< T, Key, Hash >
HashPtrTable(const Foam::zero) noexcept	HashPtrTable< T, Key, Hash >	inlineexplicit
HashPtrTable(const label initialCapacity)	HashPtrTable< T, Key, Hash >	inlineexplicit
HashPtrTable(const this_type &rhs)	HashPtrTable< T, Key, Hash >
HashPtrTable(this_type &&rhs) noexcept	HashPtrTable< T, Key, Hash >	inline
HashPtrTable(Istream &is, const INew &inew)	HashPtrTable< T, Key, Hash >
HashPtrTable(Istream &is)	HashPtrTable< T, Key, Hash >
HashPtrTable(const dictionary &dict)	HashPtrTable< T, Key, Hash >	explicit
HashTable() noexcept	HashTable< T *, Key, Hash >
HashTable(const Foam::zero) noexcept	HashTable< T *, Key, Hash >	explicit
HashTable(const label initialCapacity)	HashTable< T *, Key, Hash >	explicit
HashTable(Istream &is)	HashTable< T *, Key, Hash >
HashTable(const this_type &ht)	HashTable< T *, Key, Hash >
HashTable(this_type &&rhs) noexcept	HashTable< T *, Key, Hash >
HashTable(std::initializer_list< std::pair< Key, T * >> list, const bool overwrite=false)	HashTable< T *, Key, Hash >
HashTable(const UList< Key > &keys, const UList< T * > &values, const bool overwrite=false)	HashTable< T *, Key, Hash >
HashTableCore() noexcept=default	HashTableCore
insert(const Key &, T *)=delete	HashPtrTable< T, Key, Hash >	inline
insert(const Key &key, std::unique_ptr< T > &&ptr)	HashPtrTable< T, Key, Hash >	inline
insert(const Key &key, autoPtr< T > &&ptr)	HashPtrTable< T, Key, Hash >	inline
insert(const Key &key, autoPtr< T > &ptr)	HashPtrTable< T, Key, Hash >	inline
HashTable< T *, Key, Hash >::insert(const Key &key, const T * &obj)	HashTable< T *, Key, Hash >	inline
HashTable< T *, Key, Hash >::insert(const Key &key, T * &&obj)	HashTable< T *, Key, Hash >	inline
iterator typedef	HashPtrTable< T, Key, Hash >
key_iterator typedef	HashTable< T *, Key, Hash >
key_type typedef	HashTable< T *, Key, Hash >
keys() const	HashTable< T *, Key, Hash >	inline
lookup(const Key &key, const T * &deflt) const	HashTable< T *, Key, Hash >	inline
mapped_type typedef	HashTable< T *, Key, Hash >
maxTableSize	HashTableCore	static
merge(HashPtrTable< T, Key, Hash > &source)	HashPtrTable< T, Key, Hash >
merge(HashPtrTable< T, Key, Hash > &&source)	HashPtrTable< T, Key, Hash >
HashTable< T *, Key, Hash >::merge(HashTable< T *, Key, Hash > &source)	HashTable< T *, Key, Hash >
HashTable< T *, Key, Hash >::merge(HashTable< T *, Key, Hash > &&source)	HashTable< T *, Key, Hash >
node_type typedef	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 T * &deflt)	HashTable< T *, Key, Hash >	inline
operator+=(const this_type &rhs)	HashTable< T *, Key, Hash >
operator=(const this_type &rhs)	HashPtrTable< T, Key, Hash >
operator=(this_type &&rhs)	HashPtrTable< T, Key, Hash >
HashTable< T *, Key, Hash >::operator=(const this_type &rhs)	HashTable< T *, Key, Hash >
HashTable< T *, Key, Hash >::operator=(std::initializer_list< std::pair< Key, T * >> rhs)	HashTable< T *, Key, Hash >
HashTable< T *, Key, Hash >::operator=(this_type &&rhs)	HashTable< T *, Key, Hash >
operator==(const this_type &rhs) const	HashTable< T *, Key, Hash >
operator>>(Istream &is, HashPtrTable< T, Key, Hash > &tbl)	HashPtrTable< T, Key, Hash >	friend
operator[](const Key &key)	HashTable< T *, Key, Hash >	inline
operator[](const Key &key) const	HashTable< T *, Key, Hash >	inline
parent_type typedef	HashPtrTable< T, Key, Hash >
pointer typedef	HashTable< T *, Key, Hash >
printInfo(Ostream &os) const	HashTable< T *, Key, Hash >
reference typedef	HashTable< T *, Key, Hash >
release(iterator &iter)	HashPtrTable< T, Key, Hash >
release(const Key &key)	HashPtrTable< T, Key, Hash >
remove(iterator &iter)	HashPtrTable< T, Key, Hash >
remove(const Key &key)	HashPtrTable< T, Key, Hash >
reserve(label numEntries)	HashTable< T *, Key, Hash >
resize(label newCapacity)	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, T *ptr)	HashPtrTable< T, Key, Hash >	inline
set(const Key &key, std::unique_ptr< T > &&ptr)	HashPtrTable< T, Key, Hash >	inline
set(const Key &key, autoPtr< T > &&ptr)	HashPtrTable< T, Key, Hash >	inline
set(const Key &key, const refPtr< T > &ptr)	HashPtrTable< T, Key, Hash >	inline
set(const Key &key, const tmp< T > &ptr)	HashPtrTable< T, Key, Hash >	inline
set(const Key &key, autoPtr< T > &ptr)	HashPtrTable< T, Key, Hash >	inline
HashTable< T *, Key, Hash >::set(const Key &key, const T * &obj)	HashTable< T *, Key, Hash >	inline
HashTable< T *, Key, Hash >::set(const Key &key, T * &&obj)	HashTable< T *, Key, Hash >	inline
setCapacity(label newCapacity)	HashTable< T *, Key, Hash >
size() const noexcept	HashTable< T *, Key, Hash >	inline
size_type typedef	HashTable< T *, Key, Hash >
sorted()	HashTable< T *, Key, Hash >
sorted() const	HashTable< T *, Key, Hash >	inline
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) noexcept	HashTable< T *, Key, Hash >
test(const Key &key) const	HashPtrTable< T, Key, Hash >	inline
this_type typedef	HashPtrTable< T, Key, Hash >
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 >
try_emplace(const Key &key, Args &&... args)	HashPtrTable< T, Key, Hash >	inline
value_type typedef	HashTable< T *, Key, Hash >
write(Ostream &os) const	HashPtrTable< T, Key, Hash >
writeKeys(Ostream &os, const label shortLen=0) const	HashTable< T *, Key, Hash >
~HashPtrTable()	HashPtrTable< T, Key, Hash >
~HashTable()	HashTable< T *, Key, Hash >