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

#include <skiplist_trail.h>

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

List of all members.

Public Member Functions

 KthTrailFunction (SizeType pos_)
virtual bool goFurther (const Node< T > *UNUSED(node), SizeType position)

Private Attributes

SizeType pos

Detailed Description

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

Find k-th element


Constructor & Destructor Documentation

Constructor


Member Function Documentation

template<typename T>
virtual bool balanced_structures::skiplist::trail::KthTrailFunction< T >::goFurther ( const Node< T > *  UNUSEDnode,
SizeType  position 
) [inline, virtual]

goes further until we encounter node with specified position


Member Data Documentation

index of an element 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