Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
balanced_structures::skiplist::trail::Trail< T > Struct Template Reference

#include <skiplist_trail.h>

List of all members.

Public Attributes

Node< T > * node [MAXLEVEL]
SizeType position [MAXLEVEL]

Detailed Description

template<typename T>
struct balanced_structures::skiplist::trail::Trail< T >

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
 

Member Data Documentation


The documentation for this struct was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines