SkipList

Search for usage in LXR

SkipList Class Reference

#include <skiphashlist.h>

Public Member Functions

 SkipList (float probability=0.5)
 
Key findMAX (const Key searchKey) const
 
Key findMIN (const Key searchKey) const
 
void free (const Key searchKey)
 
void freeRange (const Key loKey, const Key hiKey)
 
Key getkey ()
 
Value getvalue ()
 
void insert (const Key searchKey, const Value value)
 
void reset ()
 
void stat ()
 
int step ()
 

Detailed Description

Extends LineList by adding the skip hash to allow the same the data in a LineList to be drawn as a filled and an outlined polygon.

NOTE: there is no skiplist.cpp file. This is all there is.

Author
James B. Bowlin
Version
0.1

Definition at line 17 of file SkipList.h.

Member Function Documentation

◆ findMAX()

Key SkipList::findMAX ( const Key  searchKey) const

search element with key NGT searchKey

Definition at line 127 of file SkipList.cpp.

◆ findMIN()

Key SkipList::findMIN ( const Key  searchKey) const

search element with key NLT searchKey

Definition at line 163 of file SkipList.cpp.

◆ free()

void SkipList::free ( const Key  searchKey)

free element with key

Definition at line 227 of file SkipList.cpp.

◆ insert()

void SkipList::insert ( const Key  searchKey,
const Value  value 
)

insert new element

Definition at line 63 of file SkipList.cpp.

◆ stat()

void SkipList::stat ( )

statistics;

Definition at line 276 of file SkipList.cpp.


The documentation for this class was generated from the following files:
This file is part of the KDE documentation.
Documentation copyright © 1996-2022 The KDE developers.
Generated on Fri Aug 12 2022 04:01:02 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.