distribution Member List

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

add(const scalar valueToAdd)	distribution
add(const label valueToAdd)	distribution
approxTotalEntries() const	distribution
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
binWidth() const	distribution	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()	HashTable< T, Key, Hash >
clearStorage()	HashTable< T, Key, Hash >
const_iterator typedef	Map< label >
const_key_iterator typedef	HashTable< T, Key, Hash >
const_pointer typedef	HashTable< T, Key, Hash >
const_reference typedef	HashTable< T, Key, Hash >
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 >
distribution()	distribution
distribution(const scalar binWidth)	distribution
distribution(const distribution &)	distribution
emplace(const Key &key, Args &&... args)	HashTable< T, Key, Hash >	inline
emplace_set(const Key &key, Args &&... args)	HashTable< 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(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) const	HashTable< T, Key, Hash >	inline
found(const Key &key) const	HashTable< T, Key, Hash >	inline
hasher typedef	HashTable< 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()=default	HashTableCore
insert(const Key &key, const T &obj)	HashTable< T, Key, Hash >	inline
insert(const Key &key, T &&obj)	HashTable< T, Key, Hash >	inline
insertMissingKeys()	distribution
iterator typedef	Map< label >
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 Key &key, const T &deflt) const	HashTable< T, Key, Hash >	inline
Map()	Map< label >	inline
Map(const label size)	Map< label >	inlineexplicit
Map(Istream &is)	Map< label >	inline
Map(const this_type &map)	Map< label >	inline
Map(this_type &&map)	Map< label >	inline
Map(std::initializer_list< std::pair< label, label > > map)	Map< label >	inline
mapped_type typedef	HashTable< T, Key, Hash >
maxTableSize	HashTableCore	static
mean() const	distribution
median()	distribution
node_type typedef	HashTable< T, Key, Hash >
normalised()	distribution
normalisedMinusMean()	distribution
normalisedShifted(scalar shiftValue)	distribution
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<<	distribution	friend
operator=(const distribution &)	distribution
Map< label >::operator=(const this_type &rhs)	Map< label >	inline
Map< label >::operator=(this_type &&rhs)	Map< label >	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) 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	Map< label >
pointer typedef	HashTable< T, Key, Hash >
printInfo(Ostream &os) const	HashTable< T, Key, Hash >
raw()	distribution
reference typedef	HashTable< 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() const noexcept	HashTable< T, Key, Hash >	inline
size_type typedef	HashTable< T, Key, Hash >
sorted() const	HashTable< T, Key, Hash >
sorted()	HashTable< T, Key, Hash >
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	Map< label >
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 >
totalEntries() const	distribution
transfer(HashTable< T, Key, Hash > &rhs)	HashTable< T, Key, Hash >
TypeName("distribution")	distribution
value_type typedef	HashTable< T, Key, Hash >
write(const fileName &file, const List< Pair< scalar > > &pairs)	distribution	static
writeKeys(Ostream &os, const label shortLen=0) const	HashTable< T, Key, Hash >
~distribution()	distribution	virtual
~HashTable()	HashTable< T, Key, Hash >