graph Member List

This is the complete list of members for graph, 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< curve >
clearStorage()	HashTable< T, Key, Hash >
const_iterator typedef	HashPtrTable< curve >
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 word &key, Args &&... args)	HashPtrTable< curve >	inline
Foam::HashTable::emplace(const Key &key, Args &&... args)	HashTable< T, Key, Hash >	inline
emplace_set(const word &key, Args &&... args)	HashPtrTable< curve >	inline
Foam::HashTable::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(iterator &iter)	HashPtrTable< curve >
erase(const word &key)	HashPtrTable< curve >
Foam::HashTable::erase(const iterator &iter)	HashTable< T, Key, Hash >
Foam::HashTable::erase(const Key &key)	HashTable< T, Key, Hash >
Foam::HashTable::erase(const HashTable< AnyType, Key, AnyHash > &other)	HashTable< T, Key, Hash >
Foam::HashTable::erase(std::initializer_list< Key > keys)	HashTable< T, Key, Hash >	inline
Foam::HashTable::erase(InputIter first, InputIter last)	HashTable< T, Key, Hash >	inline
Foam::HashTable::erase(const FixedList< Key, N > &keys)	HashTable< T, Key, Hash >	inline
Foam::HashTable::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 word &key) const	HashPtrTable< curve >	inline
graph(const string &title, const string &xName, const string &yName, const scalarField &x)	graph
graph(const string &title, const string &xName, const string &yName, const scalarField &x, const scalarField &y)	graph
graph(const string &title, const string &xName, const string &yName, Istream &is)	graph
graph(Istream &is)	graph	explicit
hasher typedef	HashTable< T, Key, Hash >
HashPtrTable()=default	HashPtrTable< curve >
HashPtrTable(const Foam::zero) noexcept	HashPtrTable< curve >	inlineexplicit
HashPtrTable(const label initialCapacity)	HashPtrTable< curve >	inlineexplicit
HashPtrTable(const this_type &rhs)	HashPtrTable< curve >
HashPtrTable(this_type &&rhs) noexcept	HashPtrTable< curve >	inline
HashPtrTable(Istream &is, const INew &inew)	HashPtrTable< curve >
HashPtrTable(Istream &is)	HashPtrTable< curve >
HashPtrTable(const dictionary &dict)	HashPtrTable< curve >	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)	HashTable< T, Key, Hash >
HashTableCore() noexcept=default	HashTableCore
insert(const word &, curve *)=delete	HashPtrTable< curve >	inline
insert(const word &key, std::unique_ptr< curve > &&ptr)	HashPtrTable< curve >	inline
insert(const word &key, autoPtr< curve > &&ptr)	HashPtrTable< curve >	inline
insert(const word &key, autoPtr< curve > &ptr)	HashPtrTable< curve >	inline
Foam::HashTable::insert(const Key &key, const T &obj)	HashTable< T, Key, Hash >	inline
Foam::HashTable::insert(const Key &key, T &&obj)	HashTable< T, Key, Hash >	inline
iterator typedef	HashPtrTable< curve >
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< curve, word, Foam::Hash< word > > &source)	HashPtrTable< curve >
merge(HashPtrTable< curve, word, Foam::Hash< word > > &&source)	HashPtrTable< curve >
Foam::HashTable::merge(HashTable< T, Key, Hash > &source)	HashTable< T, Key, Hash >
Foam::HashTable::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<<(Ostream &, const graph &)	graph	friend
operator=(const this_type &rhs)	HashPtrTable< curve >
operator=(this_type &&rhs)	HashPtrTable< curve >
Foam::HashTable::operator=(std::initializer_list< std::pair< Key, T >> 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	HashPtrTable< curve >
pointer typedef	HashTable< T, Key, Hash >
printInfo(Ostream &os) const	HashTable< T, Key, Hash >
reference typedef	HashTable< T, Key, Hash >
release(iterator &iter)	HashPtrTable< curve >
release(const word &key)	HashPtrTable< curve >
remove(iterator &iter)	HashPtrTable< curve >
remove(const word &key)	HashPtrTable< curve >
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 word &key, curve *ptr)	HashPtrTable< curve >	inline
set(const word &key, std::unique_ptr< curve > &&ptr)	HashPtrTable< curve >	inline
set(const word &key, autoPtr< curve > &&ptr)	HashPtrTable< curve >	inline
set(const word &key, const refPtr< curve > &ptr)	HashPtrTable< curve >	inline
set(const word &key, const tmp< curve > &ptr)	HashPtrTable< curve >	inline
set(const word &key, autoPtr< curve > &ptr)	HashPtrTable< curve >	inline
Foam::HashTable::set(const Key &key, const T &obj)	HashTable< T, Key, Hash >	inline
Foam::HashTable::set(const Key &key, T &&obj)	HashTable< T, Key, Hash >	inline
setCapacity(label newCapacity)	HashTable< T, Key, Hash >
setXRange(const scalar x0, const scalar x1)	graph
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 word &key) const	HashPtrTable< curve >	inline
this_type typedef	HashPtrTable< curve >
title() const	graph	inline
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 word &key, Args &&... args)	HashPtrTable< curve >	inline
value_type typedef	HashTable< T, Key, Hash >
wordify(const string &sname)	graph	static
write(Ostream &, const word &format) const	graph
write(const fileName &pName, const word &format) const	graph
write(const fileName &path, const word &name, const word &format) const	graph
HashPtrTable< curve >::write(Ostream &os) const	HashPtrTable< curve >
writeKeys(Ostream &os, const label shortLen=0) const	HashTable< T, Key, Hash >
writeTable(Ostream &) const	graph
x() const	graph	inline
x()	graph	inline
xName() const	graph	inline
y() const	graph
y()	graph
yName() const	graph	inline
~HashPtrTable()	HashPtrTable< curve >
~HashTable()	HashTable< T, Key, Hash >