FastGenericSkipList

Fast and Templated Skip List implementation in C++

The idea for this project was to offer a fast replacement for std::multimap (which uses a self-balancing binary search tree).

Functionality

This skiplist covers all general functionality offered by multimap in the exact same way (as in the C++11 multimap), so the documentation for multimap (C++11) is valid for this SkipList as well:

• fully templated

• emplace

• emplace_hint

• find

• erase

• lower_bound

• upper_bound

• bidirectional iterators

• begin

• end

Helper functions (which are not fundamental to this data-structure) are a work in progress.

Benchmarks

To come. The situation currently is that the skip-list is on average a bit slower than the std::multimap container.