Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::Hashing< K, I, H > Member List

This is the complete list of members for ogdf::Hashing< K, I, H >, including all inherited members.

begin() constogdf::Hashing< K, I, H >inline
clear()ogdf::Hashing< K, I, H >inline
const_iterator typedefogdf::Hashing< K, I, H >
copy(HashElementBase *pElement) const overrideogdf::Hashing< K, I, H >inlineprivatevirtual
copyAll(const HashingBase &H)ogdf::HashingBaseprivate
del(const K &key)ogdf::Hashing< K, I, H >inline
ogdf::HashingBase::del(HashElementBase *pElement)ogdf::HashingBaseprivate
destroy(HashElementBase *pElement) overrideogdf::Hashing< K, I, H >inlineprivatevirtual
destroyAll()ogdf::HashingBaseprivate
empty() constogdf::Hashing< K, I, H >inline
fastInsert(const K &key, const I &info)ogdf::Hashing< K, I, H >inline
firstElement(HashElement< K, I > ***pList) constogdf::Hashing< K, I, H >inlineprotected
ogdf::HashingBase::firstElement(HashElementBase ***pList) constogdf::HashingBaseprivate
firstListElement(size_t hashValue) constogdf::HashingBaseinlineprivate
HashConstIterator< K, I, H > classogdf::Hashing< K, I, H >friend
Hashing(int minTableSize=256, const H &hashFunc=H())ogdf::Hashing< K, I, H >inlineexplicit
Hashing(const Hashing< K, I, H > &h)=defaultogdf::Hashing< K, I, H >
HashingBase(int minTableSize)ogdf::HashingBaseexplicitprivate
HashingBase(const HashingBase &H)ogdf::HashingBaseprivate
init(int tableSize)ogdf::HashingBaseprivate
insert(const K &key, const I &info)ogdf::Hashing< K, I, H >inline
ogdf::HashingBase::insert(HashElementBase *pElement)ogdf::HashingBaseprivate
insertByNeed(const K &key, const I &info)ogdf::Hashing< K, I, H >inline
lookup(const K &key) constogdf::Hashing< K, I, H >inline
m_countogdf::HashingBaseprivate
m_hashFuncogdf::Hashing< K, I, H >private
m_hashMaskogdf::HashingBaseprivate
m_minTableSizeogdf::HashingBaseprivate
m_tableogdf::HashingBaseprivate
m_tableSizeogdf::HashingBaseprivate
m_tableSizeHighogdf::HashingBaseprivate
m_tableSizeLowogdf::HashingBaseprivate
member(const K &key) constogdf::Hashing< K, I, H >inline
nextElement(HashElement< K, I > ***pList, HashElement< K, I > *pElement) constogdf::Hashing< K, I, H >inlineprotected
ogdf::HashingBase::nextElement(HashElementBase ***pList, HashElementBase *pElement) constogdf::HashingBaseprivate
operator=(const Hashing< K, I, H > &hashing)=defaultogdf::Hashing< K, I, H >
ogdf::HashingBase::operator=(const HashingBase &H)ogdf::HashingBaseprivate
resize(int newTableSize)ogdf::HashingBaseprivate
size() constogdf::Hashing< K, I, H >inline
~Hashing()ogdf::Hashing< K, I, H >inline
~HashingBase()ogdf::HashingBaseprivatevirtual