Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <skiplist_trail.h>
Public Member Functions | |
virtual bool | goFurther (const Node< T > *node, SizeType position)=0 |
virtual | ~TrailFunction () |
Trail function is a function which determines the node which should be a result of the search.
virtual balanced_structures::skiplist::trail::TrailFunction< T >::~TrailFunction | ( | ) | [inline, virtual] |
Destructor
virtual bool balanced_structures::skiplist::trail::TrailFunction< T >::goFurther | ( | const Node< T > * | node, |
SizeType | position | ||
) | [pure virtual] |
Determine if the search should continue
node | pointer to the current node |
position | distance of the current node from the start of the skiplist |