HashSet< Key, Hash > Member List

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

assignMany(const label nItems, InputIter first, InputIter last)	HashSet< Key, Hash >	inline
at(const Key &key)	HashTable< Foam::zero, Key, Hash >	inline
at(const Key &key) const	HashTable< Foam::zero, Key, Hash >	inline
begin()	HashSet< Key, Hash >	inline
begin() const	HashSet< Key, Hash >	inline
canonicalSize(const label requested_size)	HashTableCore	static
capacity() const noexcept	HashTable< Foam::zero, Key, Hash >	inline
cbegin() const	HashSet< Key, Hash >	inline
cend() const noexcept	HashSet< Key, Hash >	inline
cfind(const Key &key) const	HashTable< Foam::zero, Key, Hash >	inline
ClassName("HashTable")	HashTableCore
clear()	HashTable< Foam::zero, Key, Hash >
clearStorage()	HashTable< Foam::zero, Key, Hash >
const_iterator typedef	HashSet< Key, Hash >
const_key_iterator typedef	HashTable< Foam::zero, Key, Hash >
const_pointer typedef	HashTable< Foam::zero, Key, Hash >
const_reference typedef	HashTable< Foam::zero, Key, Hash >
contains(const Key &key) const	HashTable< Foam::zero, Key, Hash >	inline
countEntries(const BinaryPredicate &, const bool)=delete	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::countEntries(const BinaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
countKeys(const UnaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
countKeys(const UnaryPredicate &pred, const bool invert) const	HashTable< Foam::zero, Key, Hash >
countValues(const UnaryPredicate &, const bool)=delete	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::countValues(const UnaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
csorted() const	HashTable< Foam::zero, Key, Hash >
difference_type typedef	HashTable< Foam::zero, Key, Hash >
emplace(const Key &key, Args &&... args)	HashTable< Foam::zero, Key, Hash >	inline
emplace_set(const Key &key, Args &&... args)	HashTable< Foam::zero, Key, Hash >	inline
empty() const noexcept	HashTable< Foam::zero, Key, Hash >	inline
end() noexcept	HashSet< Key, Hash >	inline
end() const noexcept	HashSet< Key, Hash >	inline
erase(const iterator &iter)	HashTable< Foam::zero, Key, Hash >
erase(const Key &key)	HashTable< Foam::zero, Key, Hash >
erase(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< Foam::zero, Key, Hash >
erase(std::initializer_list< Key > keys)	HashTable< Foam::zero, Key, Hash >	inline
erase(InputIter first, InputIter last)	HashTable< Foam::zero, Key, Hash >	inline
erase(const FixedList< Key, N > &keys)	HashTable< Foam::zero, Key, Hash >	inline
erase(const UList< Key > &keys)	HashTable< Foam::zero, Key, Hash >	inline
erase(InputIter first, InputIter last)	HashTable< Foam::zero, Key, Hash >	inline
erase(const FixedList< Key, N > &keys)	HashTable< Foam::zero, Key, Hash >	inline
erase(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< Foam::zero, Key, Hash >
filterEntries(const BinaryPredicate &, const bool)=delete	HashSet< Key, Hash >
filterKeys(const UnaryPredicate &pred, const bool pruning=false)	HashTable< Foam::zero, Key, Hash >
filterKeys(const UnaryPredicate &pred, const bool pruning)	HashTable< Foam::zero, Key, Hash >
filterValues(const UnaryPredicate &, const bool)=delete	HashSet< Key, Hash >
find(const Key &key)	HashTable< Foam::zero, Key, Hash >	inline
find(const Key &key) const	HashTable< Foam::zero, Key, Hash >	inline
found(const Key &key) const	HashTable< Foam::zero, Key, Hash >	inline
hasher typedef	HashTable< Foam::zero, Key, Hash >
HashSet() noexcept=default	HashSet< Key, Hash >
HashSet(const Foam::zero) noexcept	HashSet< Key, Hash >	inlineexplicit
HashSet(const label initialCapacity)	HashSet< Key, Hash >	inlineexplicit
HashSet(const this_type &rhs)	HashSet< Key, Hash >	inline
HashSet(this_type &&rhs) noexcept	HashSet< Key, Hash >	inline
HashSet(Istream &is)	HashSet< Key, Hash >	inlineexplicit
HashSet(const FixedList< Key, N > &list)	HashSet< Key, Hash >	explicit
HashSet(const UList< Key > &list)	HashSet< Key, Hash >	explicit
HashSet(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	explicit
HashSet(std::initializer_list< Key > list)	HashSet< Key, Hash >
HashSet(const HashTable< AnyType, Key, AnyHash > &tbl)	HashSet< Key, Hash >	explicit
HashTable() noexcept	HashTable< Foam::zero, Key, Hash >
HashTable(const Foam::zero) noexcept	HashTable< Foam::zero, Key, Hash >	explicit
HashTable(const label initialCapacity)	HashTable< Foam::zero, Key, Hash >	explicit
HashTable(Istream &is)	HashTable< Foam::zero, Key, Hash >
HashTable(const this_type &ht)	HashTable< Foam::zero, Key, Hash >
HashTable(this_type &&rhs) noexcept	HashTable< Foam::zero, Key, Hash >
HashTable(std::initializer_list< std::pair< Key, Foam::zero >> list)	HashTable< Foam::zero, Key, Hash >
HashTableCore() noexcept=default	HashTableCore
insert(const Key &key)	HashSet< Key, Hash >	inline
insert(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
insert(std::initializer_list< Key > list)	HashSet< Key, Hash >	inline
insert(const FixedList< Key, N > &list)	HashSet< Key, Hash >	inline
insert(const UList< Key > &list)	HashSet< Key, Hash >	inline
insert(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	inline
insert(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
insert(const FixedList< Key, N > &list)	HashSet< Key, Hash >	inline
insert(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::insert(const Key &key, const Foam::zero &obj)	HashTable< Foam::zero, Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::insert(const Key &key, Foam::zero &&obj)	HashTable< Foam::zero, Key, Hash >	inline
iterator typedef	HashSet< Key, Hash >
key_iterator typedef	HashTable< Foam::zero, Key, Hash >
key_type typedef	HashTable< Foam::zero, Key, Hash >
keys() const	HashTable< Foam::zero, Key, Hash >	inline
lookup(const Key &key, const Foam::zero &deflt) const	HashTable< Foam::zero, Key, Hash >	inline
mapped_type typedef	HashTable< Foam::zero, Key, Hash >
maxTableSize	HashTableCore	static
merge(HashSet< Key, Hash > &source)	HashSet< Key, Hash >
merge(HashSet< Key, Hash > &&source)	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::merge(HashTable< Foam::zero, Key, Hash > &source)	HashTable< Foam::zero, Key, Hash >
HashTable< Foam::zero, Key, Hash >::merge(HashTable< Foam::zero, Key, Hash > &&source)	HashTable< Foam::zero, Key, Hash >
node_type typedef	HashTable< Foam::zero, Key, Hash >
operator &=(const this_type &rhs)	HashSet< Key, Hash >	inline
operator!=(const this_type &rhs) const	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::operator!=(const this_type &rhs) const	HashTable< Foam::zero, Key, Hash >
operator()(const Key &key) const noexcept	HashSet< Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::operator()(const Key &key)	HashTable< Foam::zero, Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::operator()(const Key &key, const Foam::zero &deflt)	HashTable< Foam::zero, Key, Hash >	inline
operator+=(const this_type &rhs)	HashSet< Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::operator+=(const this_type &rhs)	HashTable< Foam::zero, Key, Hash >
operator-=(const this_type &rhs)	HashSet< Key, Hash >	inline
operator=(const this_type &rhs)	HashSet< Key, Hash >	inline
operator=(this_type &&rhs)	HashSet< Key, Hash >	inline
operator=(const UList< Key > &rhs)	HashSet< Key, Hash >
operator=(const FixedList< Key, N > &rhs)	HashSet< Key, Hash >
operator=(std::initializer_list< Key > rhs)	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::operator=(const this_type &rhs)	HashTable< Foam::zero, Key, Hash >
HashTable< Foam::zero, Key, Hash >::operator=(std::initializer_list< std::pair< Key, Foam::zero >> rhs)	HashTable< Foam::zero, Key, Hash >
HashTable< Foam::zero, Key, Hash >::operator=(this_type &&rhs)	HashTable< Foam::zero, Key, Hash >
operator==(const this_type &rhs) const	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::operator==(const this_type &rhs) const	HashTable< Foam::zero, Key, Hash >
operator[](const Key &key) const noexcept	HashSet< Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::operator[](const Key &key)	HashTable< Foam::zero, Key, Hash >	inline
operator^=(const this_type &rhs)	HashSet< Key, Hash >
operator|=(const this_type &rhs)	HashSet< Key, Hash >
parent_type typedef	HashSet< Key, Hash >
pointer typedef	HashTable< Foam::zero, Key, Hash >
printInfo(Ostream &os) const	HashTable< Foam::zero, Key, Hash >
reference typedef	HashTable< Foam::zero, Key, Hash >
reserve(label numEntries)	HashTable< Foam::zero, Key, Hash >
resize(label newCapacity)	HashTable< Foam::zero, Key, Hash >
retain(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< Foam::zero, Key, Hash >
retain(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< Foam::zero, Key, Hash >
set(const Key &key)	HashSet< Key, Hash >	inline
set(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
set(std::initializer_list< Key > list)	HashSet< Key, Hash >	inline
set(const FixedList< Key, N > &list)	HashSet< Key, Hash >	inline
set(const UList< Key > &list)	HashSet< Key, Hash >	inline
set(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::set(const Key &key, const Foam::zero &obj)	HashTable< Foam::zero, Key, Hash >	inline
HashTable< Foam::zero, Key, Hash >::set(const Key &key, Foam::zero &&obj)	HashTable< Foam::zero, Key, Hash >	inline
setCapacity(label newCapacity)	HashTable< Foam::zero, Key, Hash >
setMany(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
size() const noexcept	HashTable< Foam::zero, Key, Hash >	inline
size_type typedef	HashTable< Foam::zero, Key, Hash >
sorted()	HashTable< Foam::zero, Key, Hash >
sorted() const	HashTable< Foam::zero, Key, Hash >	inline
sortedToc() const	HashTable< Foam::zero, Key, Hash >
sortedToc(const Compare &comp) const	HashTable< Foam::zero, Key, Hash >
sortedToc(const Compare &comp) const	HashTable< Foam::zero, Key, Hash >
swap(HashTable< Foam::zero, Key, Hash > &rhs) noexcept	HashTable< Foam::zero, Key, Hash >
test(const Key &key) const	HashSet< Key, Hash >	inline
this_type typedef	HashSet< Key, Hash >
toc() const	HashTable< Foam::zero, Key, Hash >
tocEntries(const BinaryPredicate &, const bool)=delete	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::tocEntries(const BinaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
tocKeys(const UnaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
tocKeys(const UnaryPredicate &pred, const bool invert) const	HashTable< Foam::zero, Key, Hash >
tocValues(const UnaryPredicate &, const bool)=delete	HashSet< Key, Hash >
HashTable< Foam::zero, Key, Hash >::tocValues(const UnaryPredicate &pred, const bool invert=false) const	HashTable< Foam::zero, Key, Hash >
transfer(HashTable< Foam::zero, Key, Hash > &rhs)	HashTable< Foam::zero, Key, Hash >
unset(const Key &key)	HashSet< Key, Hash >	inline
unset(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
unset(std::initializer_list< Key > list)	HashSet< Key, Hash >	inline
unset(const FixedList< Key, N > &list)	HashSet< Key, Hash >	inline
unset(const UList< Key > &list)	HashSet< Key, Hash >	inline
unset(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	inline
unset(InputIter first, InputIter last)	HashSet< Key, Hash >	inline
unset(const FixedList< Key, N > &list)	HashSet< Key, Hash >	inline
unset(const IndirectListBase< Key, Addr > &list)	HashSet< Key, Hash >	inline
value_type typedef	HashTable< Foam::zero, Key, Hash >
writeKeys(Ostream &os, const label shortLen=0) const	HashTable< Foam::zero, Key, Hash >
writeList(Ostream &os, const label shortLen=0) const	HashSet< Key, Hash >	inline
~HashTable()	HashTable< Foam::zero, Key, Hash >