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

#include <skiplist_trail.h>

Inheritance diagram for balanced_structures::skiplist::trail::TrailFunction< T >:

List of all members.

Public Member Functions

virtual bool goFurther (const Node< T > *node, SizeType position)=0
virtual ~TrailFunction ()

Detailed Description

template<typename T>
class balanced_structures::skiplist::trail::TrailFunction< T >

Trail function is a function which determines the node which should be a result of the search.

Precondition:
  • The function should be a binary predicate returning True on all elements less/equal than the correct one, and returning False on all elements greater.

Constructor & Destructor Documentation

template<typename T>
virtual balanced_structures::skiplist::trail::TrailFunction< T >::~TrailFunction ( ) [inline, virtual]

Destructor


Member Function Documentation

template<typename T>
virtual bool balanced_structures::skiplist::trail::TrailFunction< T >::goFurther ( const Node< T > *  node,
SizeType  position 
) [pure virtual]

Determine if the search should continue

Parameters:
nodepointer to the current node
positiondistance of the current node from the start of the skiplist
Returns:
true if the search should continue

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