Skip Lists
From charlesreid1
Skip lists are data containers useful in storing value or key-value data in a fast but sorted manner. They can be thought of as what would happen if you smeared different parts of a liked list out over different hierarchical layers.
Skip lists are implemented in the Java API, and the ConcurrentSkipList class does an excellent job of describing skip list implementations: see Java/ConcurrentSkipList page for a guided tour through the source code of the ConcurentSkipList class.
 |
Maps and Dictionaries Part of Computer Science Notes
Series on Data Structures
Maps/Dictionaries Maps · Maps/ADT · Maps in Java · Maps/OOP · Maps/Operations and Performance Map implementations: Maps/AbstractMap · Maps/UnsortedArrayMap · Maps/SortedArrayMap Dictionary implementations: Dictionaries/LinkedDict · Dictionaries/ArrayDict
Hashes Hash Maps/OOP · Hash Maps/Operations and Performance Hash Maps/Dynamic Resizing · Hash Maps/Collision Handling with Chaining Hash functions: Hash Functions · Hash Functions/Cyclic Permutation Hash map implementations: Hash Maps/AbstractHashMap · Hash Maps/ChainedHashMap
Skip Lists · Java/ConcurrentSkipList · Java implementations: SkipList
Sets Sets · Sets/ADT · Sets in Java · Sets/OOP · Multisets
|