Quick Links: |
#include <bdlcc_stripedunorderedcontainerimpl.h>
Public Member Functions | |
StripedUnorderedContainerImpl_Node (const KEY &key, const VALUE &value, StripedUnorderedContainerImpl_Node *nextPtr, bslma::Allocator *basicAllocator=0) | |
StripedUnorderedContainerImpl_Node (const KEY &key, bslmf::MovableRef< VALUE > value, StripedUnorderedContainerImpl_Node *nextPtr, bslma::Allocator *basicAllocator=0) | |
StripedUnorderedContainerImpl_Node (const KEY &key, StripedUnorderedContainerImpl_Node *nextPtr, bslma::Allocator *basicAllocator=0) | |
~StripedUnorderedContainerImpl_Node () | |
StripedUnorderedContainerImpl_Node ** | nextAddress () |
void | setNext (StripedUnorderedContainerImpl_Node *nextPtr) |
VALUE & | value () |
const KEY & | key () const |
StripedUnorderedContainerImpl_Node * | next () const |
const VALUE & | value () const |
bslma::Allocator * | allocator () const |
This class template represents a node in the singly-linked list of (KEY, VALUE)
elements for each bucket of a hash map.
See Component bdlcc_stripedunorderedcontainerimpl
bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::StripedUnorderedContainerImpl_Node | ( | const KEY & | key, | |
const VALUE & | value, | |||
StripedUnorderedContainerImpl_Node< KEY, VALUE > * | nextPtr, | |||
bslma::Allocator * | basicAllocator = 0 | |||
) |
bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::StripedUnorderedContainerImpl_Node | ( | const KEY & | key, | |
bslmf::MovableRef< VALUE > | value, | |||
StripedUnorderedContainerImpl_Node< KEY, VALUE > * | nextPtr, | |||
bslma::Allocator * | basicAllocator = 0 | |||
) |
Create a bdlcc::StripedUnorderedContainerImpl_Node
object having the specified key
and value
, and with the specified nextPtr
pointer to the next node. Optionally specify a basicAllocator
used to supply memory. If basicAllocator
is 0, the currently installed default allocator is used.
bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::StripedUnorderedContainerImpl_Node | ( | const KEY & | key, | |
StripedUnorderedContainerImpl_Node< KEY, VALUE > * | nextPtr, | |||
bslma::Allocator * | basicAllocator = 0 | |||
) |
Create a bdlcc::StripedUnorderedContainerImpl_Node
object having the specified key
and a value initialized to VALUE()
, and with the specified nextPtr
pointer to the next node. Optionally specify a basicAllocator
used to supply memory. If basicAllocator
is 0, the currently installed default allocator is used.
bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::~StripedUnorderedContainerImpl_Node | ( | ) |
Destroy this object.
StripedUnorderedContainerImpl_Node** bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::nextAddress | ( | ) |
Return the address of the pointer to the next node.
void bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::setNext | ( | StripedUnorderedContainerImpl_Node< KEY, VALUE > * | nextPtr | ) |
Set this node's pointer-to-next-node to the specified nextPtr
.
VALUE& bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::value | ( | ) |
Return a reference providing modifiable access to the value
attribute of this object.
const KEY& bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::key | ( | ) | const |
Return a const
reference to the key
attribute of this object.
StripedUnorderedContainerImpl_Node* bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::next | ( | ) | const |
Return the pointer to the next node.
const VALUE& bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::value | ( | ) | const |
Return a const
reference to the value
attribute of this object.
bslma::Allocator* bdlcc::StripedUnorderedContainerImpl_Node< KEY, VALUE >::allocator | ( | ) | const |
Return the allocator used by StripedUnorderedContainerImpl_Node
to allocate memory.