Work in progress. The ease-cpp-skip-list library provides an implementation of standard compliant [[*]] ordered associative containers (map, multimap, set, multiset) based on the skip list data structure.

The ease-skip-list library is header only, thus to use it, simply copy the files into your project.

Note that the benchmarks/ subdirectory contains benchmarks which were adapted from Google's cpp-btree library. For convenience (and for now), the subdirectory also includes the cpp-btree library itself.

[*]: Not yet. There are some minor differences.