O(1) |
O(logn) |
O(n) |
O(nlogn) |
List | insert | erase(iter) | search key | insert index | erase index | search index | ++iter | --iter | iter+n | iter-n |
---|---|---|---|---|---|---|---|---|---|---|
SkipList | ||||||||||
SSkipList | ||||||||||
KeyedSkipList | ||||||||||
KeyedSSkipList | ||||||||||
AutoSkipList | ||||||||||
AutoSSkipList | ||||||||||
AutoKeyedSkipList | ||||||||||
AutoKeyedSSkipList | ||||||||||
MultiSkipList | ||||||||||
MultiSSkipList | ||||||||||
MultiKeyedSkipList | ||||||||||
MultiKeyedSSkipList | ||||||||||
MultiAutoSkipList | ||||||||||
MultiAutoSSkipList | ||||||||||
MultiAutoKeyedSkipList | ||||||||||
MultiAutoKeyedSSkipList | ||||||||||
IndexedSkipList | ||||||||||
IndexedSSkipList | ||||||||||
IndexedTinySkipList | ||||||||||
set | ||||||||||
map | ||||||||||
multiset | ||||||||||
multimap | ||||||||||
vector | ||||||||||
list |
This is a rough indication of the functionality available in the different skiplists. For example, if both set and vector are properties of a container (AutoSkipList), insertion will be based on the key value, not on the index. However, random access will be available (usually in logn time). It is a guide to get a rough idea of the functionality without the implications of algorithmic complexity. Nothing more.