G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node Class Reference

Public Member Functions
Node *	clone (MemoryManager::Ref &mm)

Static Public Member Functions
static Node *	create (const Key &k, const Value &v, size_t h, Node *n, MemoryManager::Ref &mm)
static Node *	create (const Key &k, size_t hashCode, Node *n, MemoryManager::Ref &mm)
static void	destroy (Node *n, MemoryManager::Ref &mm)

Public Attributes
Entry	entry
size_t	hashCode
Node *	next

Private Member Functions
	Node (const Key &k, const Value &v, size_t h, Node *n)
	Node (const Key &k, size_t h, Node *n)

Detailed Description

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>
class G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node

Linked list nodes used internally by HashTable.

Constructor & Destructor Documentation

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::Node ( const Key &  k, const Value &  v, size_t  h, Node *  n  )

inlineprivate

 : entry(k, v), hashCode(h), next(n) {
 debugAssert((next == NULL) || isValidHeapPointer(next));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::Node ( const Key &  k, size_t  h, Node *  n  )

inlineprivate

 : entry(k), hashCode(h), next(n) {
 debugAssert((next == NULL) || isValidHeapPointer(next));
 }

Here is the call graph for this function:

Member Function Documentation

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

Node* G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::clone ( MemoryManager::Ref &  mm )

inline

Clones a whole chain;

 {
 return create(this->entry.key, this->entry.value, hashCode, (next == NULL) ? NULL : next->clone(mm), mm);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

static Node* G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::create ( const Key &  k, const Value &  v, size_t  h, Node *  n, MemoryManager::Ref &  mm  )

inlinestatic

 {
 Node* node = (Node*)mm->alloc(sizeof(Node));
 return new (node) Node(k, v, h, n);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

static Node* G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::create ( const Key &  k, size_t  hashCode, Node *  n, MemoryManager::Ref &  mm  )

inlinestatic

 {
 Node* node = (Node*)mm->alloc(sizeof(Node));
 return new (node) Node(k, hashCode, n);
 }

Here is the call graph for this function:

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

static void G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::destroy ( Node *  n, MemoryManager::Ref &  mm  )

inlinestatic

 {
 n->~Node();
 mm->free(n);
 }

Here is the caller graph for this function:

Member Data Documentation

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

Entry G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::entry

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

size_t G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::hashCode

template<class Key, class Value, class HashFunc = HashTrait<Key>, class EqualsFunc = EqualsTrait<Key>>

Node* G3D::Table< Key, Value, HashFunc, EqualsFunc >::Node::next

---

The documentation for this class was generated from the following file:

• dep/g3dlite/include/G3D/Table.h