Description: Skiplists are fast associative collections invented by William Pugh. Key/Value pairs are added to skiplist containers and can then values looked up extremely quickly by key. The implementation is based on a fairly generic one originally in "C" by Bruno Grossniklaus which I converted into a C++ class library.
To Search:
File list (Check if you may need any files):
TestSkipLists.cpp
SkipList.cpp
SkipList.h
mtrand.cpp
Download