Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <skiplist_trail.h>
Public Member Functions | |
KthTrailFunction (SizeType pos_) | |
virtual bool | goFurther (const Node< T > *UNUSED(node), SizeType position) |
Private Attributes | |
SizeType | pos |
Find k-th element
balanced_structures::skiplist::trail::KthTrailFunction< T >::KthTrailFunction | ( | SizeType | pos_ | ) | [inline] |
Constructor
virtual bool balanced_structures::skiplist::trail::KthTrailFunction< T >::goFurther | ( | const Node< T > * | UNUSEDnode, |
SizeType | position | ||
) | [inline, virtual] |
goes further until we encounter node with specified position
SizeType balanced_structures::skiplist::trail::KthTrailFunction< T >::pos [private] |
index of an element we are searching for