All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
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() constdistribution
begin()HashTable< T, Key, Hash >inline
begin() constHashTable< T, Key, Hash >inline
binWidth() constdistributioninline
capacity() constHashTable< T, Key, Hash >inline
cbegin() constHashTable< T, Key, Hash >inline
cend()HashTableCoreinlinestatic
ClassName("HashTable")HashTableCore
clear()HashTable< T, Key, Hash >
clearStorage()HashTable< T, Key, Hash >
clipPDF(const scalarField &x, const tmp< scalarField > &pdf) constdistributionprotected
clone(const label sampleQ) const =0distributionpure virtual
clone() constdistributioninline
const_iterator typedefMap< label >
const_reference typedefHashTable< T, Key, Hash >
declareRunTimeSelectionTable(autoPtr, distribution, dictionary,(const dictionary &dict, Random &rndGen, const label sampleQ),(dict, rndGen, sampleQ))distribution
distribution()distribution
distribution(const scalar binWidth)distribution
distribution(const distribution &)distribution
distribution(const word &name, const dictionary &dict, Random &rndGen, const label sampleQ)distribution
distribution(Random &rndGen, const label Q, const label sampleQ)distribution
distribution(const distribution &d, const label sampleQ)distribution
empty() constHashTable< T, Key, Hash >inline
end()HashTableCoreinlinestatic
erase(const iterator &)HashTable< T, Key, Hash >
erase(const Key &)HashTable< T, Key, Hash >
erase(const UList< Key > &)HashTable< T, Key, Hash >
erase(const HashTable< AnyType, Key, AnyHash > &)HashTable< T, Key, Hash >
erase(const HashTable< AnyType, Key, AnyHash > &rhs)HashTable< T, Key, Hash >
find(const Key &)HashTable< T, Key, Hash >
find(const Key &) constHashTable< T, Key, Hash >
found(const Key &) constHashTable< T, Key, Hash >
HashTable(const label size=128)HashTable< T, Key, Hash >
HashTable(Istream &, const label size=128)HashTable< T, Key, Hash >
HashTable(const HashTable< T, Key, Hash > &)HashTable< T, Key, Hash >
HashTable(HashTable< T, Key, Hash > &&)HashTable< T, Key, Hash >
HashTable(std::initializer_list< Tuple2< Key, T >>)HashTable< T, Key, Hash >
HashTableCore()HashTableCoreinline
insert(const Key &, const T &newElmt)HashTable< T, Key, Hash >inline
insertMissingKeys()distribution
iterator typedefMap< label >
Map(const label size=128)Map< label >inline
Map(Istream &is)Map< label >inline
Map(const Map< label > &map)Map< label >inline
Map(Map< label > &&map)Map< label >inline
Map(HashTable< label, label, Hash< label >> &&map)Map< label >inline
Map(std::initializer_list< Tuple2< label, label >> map)Map< label >inline
max() const =0distributionpure virtual
maxTableSizeHashTableCorestatic
mean() constdistribution
mean() const =0distributionpure virtual
median()distribution
min() const =0distributionpure virtual
New(const dictionary &dict, Random &rndGen, const label sampleQ)distributionstatic
normalised()distribution
normalisedMinusMean()distribution
normalisedShifted(scalar shiftValue)distribution
operator!=(const HashTable< T, Key, Hash > &) constHashTable< T, Key, Hash >
operator()(const Key &)HashTable< T, Key, Hash >inline
operator<<(Ostream &, const distribution &)distributionfriend
operator=(const distribution &)distribution
Map< label >::operator=(const Map< label > &map)Map< label >inline
Map< label >::operator=(Map< label > &&map)Map< label >inline
Foam::HashTable::operator=(const HashTable< T, Key, Hash > &)HashTable< T, Key, Hash >
Foam::HashTable::operator=(HashTable< T, Key, Hash > &&)HashTable< T, Key, Hash >
Foam::HashTable::operator=(std::initializer_list< Tuple2< Key, T >>)HashTable< T, Key, Hash >
operator==(const HashTable< T, Key, Hash > &) constHashTable< T, Key, Hash >
operator[](const Key &)HashTable< T, Key, Hash >inline
operator[](const Key &) constHashTable< T, Key, Hash >inline
PDF(const scalarField &x) const =0distributionpure virtual
printInfo(Ostream &) constHashTable< T, Key, Hash >
q() constdistributioninlineprotected
Q_distributionprotected
raw()distribution
reference typedefHashTable< T, Key, Hash >
report() constdistribution
resize(const label newSize)HashTable< T, Key, Hash >
rndGen_distributionprotected
sample() const =0distributionpure virtual
sample(const label n) const =0distributionpure virtual
sampleQ_distributionprotected
set(const Key &, const T &newElmt)HashTable< T, Key, Hash >inline
shrink()HashTable< T, Key, Hash >
size() constHashTable< T, Key, Hash >inline
size_type typedefHashTable< T, Key, Hash >
sortedToc() constHashTable< T, Key, Hash >
toc() constHashTable< T, Key, Hash >
totalEntries() constdistribution
transfer(HashTable< T, Key, Hash > &)HashTable< T, Key, Hash >
TypeName("distribution")distribution
TypeName("distribution")distribution
validateBounds(const dictionary &dict) constdistributionprotectedvirtual
validatePositive(const dictionary &dict) constdistributionprotectedvirtual
value_type typedefHashTable< T, Key, Hash >
write(const fileName &file, const List< Pair< scalar >> &pairs)distributionstatic
x(const label n) constdistributionvirtual
~distribution()distributionvirtual
~distribution()distributionvirtual
~HashTable()HashTable< T, Key, Hash >