Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <skiplist_trail.h>
Public Member Functions | |
LowerBoundTrailFunction (const T &value_) | |
virtual bool | goFurther (const Node< T > *node, SizeType UNUSED(position)) |
Private Attributes | |
T | value |
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
balanced_structures::skiplist::trail::LowerBoundTrailFunction< T >::LowerBoundTrailFunction | ( | const T & | value_ | ) | [inline] |
Constructor
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
T balanced_structures::skiplist::trail::LowerBoundTrailFunction< T >::value [private] |
Value we are searching for