|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Dynamic ordered set implemented with a Skip List. More...
#include <climits>#include <ctime>#include <utility>#include <initializer_list>#include <gsl/gsl_rng.h>#include <ah-errors.H>#include <ah-args-ctor.H>#include <ahDry.H>#include <ahFunctional.H>#include <ahIterator.H>#include <ah-iterator.H>#include <ah-dry.H>Go to the source code of this file.
Classes | |
| class | Aleph::DynSkipList< Key, Compare > |
| Dynamic ordered set implemented with a Skip List. More... | |
| struct | Aleph::DynSkipList< Key, Compare >::Node |
| Internal node structure. More... | |
| class | Aleph::DynSkipList< Key, Compare >::Iterator |
| Forward iterator for DynSkipList. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Dynamic ordered set implemented with a Skip List.
DynSkipList<Key, Compare> is a dynamic set that automatically manages memory for its elements. It uses a Skip List as the underlying data structure, providing expected O(log n) time for search, insert, and delete operations.
The class internally uses the gsl random number generator of GSL - GNU Scientific Library. By default, the Mersenne twister is used and the seed is taken from system time.
Definition in file tpl_dynSkipList.H.