Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <skiplist_node.h>
Public Member Functions | |
Node (SizeType level_) | |
Self * | next () const |
Self * | prev () const |
~Node () | |
Public Attributes | |
T | value |
LevelType | level |
Self ** | forward |
SizeType * | forward_length |
Self * | previous |
Private Types | |
typedef int | SizeType |
typedef Node< T > | Self |
Skiplist node
typedef Node<T> balanced_structures::skiplist::Node< T >::Self [private] |
Type of this object
typedef int balanced_structures::skiplist::Node< T >::SizeType [private] |
Type of position in skiplist
balanced_structures::skiplist::Node< T >::Node | ( | SizeType | level_ | ) | [inline] |
balanced_structures::skiplist::Node< T >::~Node | ( | ) | [inline] |
Destructor
Self* balanced_structures::skiplist::Node< T >::next | ( | ) | const [inline] |
Return next node
If this node is last node (skiplist 'tail'), it will return NULL
Self* balanced_structures::skiplist::Node< T >::prev | ( | ) | const [inline] |
Return previous node
If this node is first node (skiplist 'head'), it will return NULL
Self** balanced_structures::skiplist::Node< T >::forward |
Forward links to next nodes.
SizeType* balanced_structures::skiplist::Node< T >::forward_length |
Lengths of forward links.
LevelType balanced_structures::skiplist::Node< T >::level |
Level of the node.
Also size of the forward and forward_length arrays
Self* balanced_structures::skiplist::Node< T >::previous |
Backward link.
T balanced_structures::skiplist::Node< T >::value |
A value this node is holding.