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