Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <skiplist_trail.h>
Public Attributes | |
Node< T > * | node [MAXLEVEL] |
SizeType | position [MAXLEVEL] |
Trail is a collection of nodes directly preceding the node we selected.
The trail holds useful information for insertions and deletions.
Example trail for node 19 (denoted @):
# -----------> @ ----------------> # # -> # ------> @ -----------> # -> # # -> # ------> # -> @ ------> # -> # # -> # -> # -> # -> # -> @ -> # -> # HEAD 1 2 7 14 19 26 TAIL
Trail nodes: 19, 14, 7, 7 Trail position: 5, 4, 3, 3
Node<T>* balanced_structures::skiplist::trail::Trail< T >::node[MAXLEVEL] |
SizeType balanced_structures::skiplist::trail::Trail< T >::position[MAXLEVEL] |