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

#include <skiplist_trail.h>

Inheritance diagram for balanced_structures::skiplist::trail::UpperBoundTrailFunction< T >:
Collaboration diagram for balanced_structures::skiplist::trail::UpperBoundTrailFunction< T >:

List of all members.

Public Member Functions

 UpperBoundTrailFunction (const T &value_)
virtual bool goFurther (const Node< T > *node, SizeType UNUSED(position))

Private Attributes

value

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


Constructor & Destructor Documentation

template<typename T>
balanced_structures::skiplist::trail::UpperBoundTrailFunction< T >::UpperBoundTrailFunction ( const T &  value_) [inline]

Member Function Documentation

template<typename T>
virtual bool balanced_structures::skiplist::trail::UpperBoundTrailFunction< T >::goFurther ( const Node< T > *  node,
SizeType   UNUSEDposition 
) [inline, virtual]

Goes further until we encounter a node with value greater than value


Member Data Documentation

Value we are searching for


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