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

#include <skiplist_trail.h>

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

List of all members.

Public Member Functions

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

Private Attributes

value

Detailed Description

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

Trail function which points to the first position where element can be inserted without violating ordering.

Note that this is equivalent to the first element >= value


Constructor & Destructor Documentation

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

Constructor


Member Function Documentation

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

Goes further until we encounter a node with value greater or equal 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