|
Zero
0.1.0
|
A pair of keys for the implementation of a deque as a doubly-linked list. More...
Public Member Functions | |
| KeyPair () | |
| Constructor for an empty pair of keys. More... | |
| KeyPair (const key_type &previous, const key_type &next) | |
| Constructor for a pair of keys with initial values. More... | |
| virtual | ~KeyPair () |
| Destructor for a pair of keys. More... | |
Public Attributes | |
| key_type | _previous |
| The previous element of this element. More... | |
| key_type | _next |
| The next element of this element. More... | |
A pair of keys for the implementation of a deque as a doubly-linked list.
Instances of this class can be used to represent entries of a doubly-linked list which only stores the pointer without any other value.
|
inline |
|
inline |
|
inlinevirtual |
Destructor for a pair of keys.
As this class does not allocate memory dynamically, this destructor does not do anything.
| zero::hashtable_deque::HashtableDeque< key_type, invalid_key >::KeyPair::_next |
The next element of this element.
The key of the next element with regard to the deque order. The next element is closer to the back of the deque. If this element represents the back of the deque, this member variable will contain an invalid key.
| zero::hashtable_deque::HashtableDeque< key_type, invalid_key >::KeyPair::_previous |
The previous element of this element.
The key of the previous element with regard to the deque order. The previous element is closer to the front of the deque. If this element represents the front of the deque, this member variable will contain an invalid key.
1.8.12