Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
goFurther(const Node< T > *UNUSED(node), SizeType position) | balanced_structures::skiplist::trail::KthTrailFunction< T > | [inline, virtual] |
balanced_structures::skiplist::trail::TrailFunction::goFurther(const Node< T > *node, SizeType position)=0 | balanced_structures::skiplist::trail::TrailFunction< T > | [pure virtual] |
KthTrailFunction(SizeType pos_) | balanced_structures::skiplist::trail::KthTrailFunction< T > | [inline] |
pos | balanced_structures::skiplist::trail::KthTrailFunction< T > | [private] |
~TrailFunction() | balanced_structures::skiplist::trail::TrailFunction< T > | [inline, virtual] |