Skiplists是由威廉普格发明的快速关联集合。键/值对添加到skiplist容器和值，这可以让数值搜索极为迅速。程序是建立在一个非常通用的， Bruno Grossniklaus 写的C，然后转换成C+ +类库的基础上。-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.