Skip List Implementation. More...
Go to the source code of this file.
Classes | |
| class | Node |
| Skip List Node Class. More... | |
| class | SkipList |
| Skip List Class. More... | |
| class | SkipList::Iterator |
| A Iterator class for the skip list. More... | |
Enumerations | |
| enum class | SentinelType { NEGATIVE_INFINITY , NORMAL , POSITIVE_INFINITY } |
| To represent the type of node in the skip list. More... | |
Skip List Implementation.
This file contains the implementation of a skip list data structure for efficient key-value storage and retrieval. The skip list is used as a Memtable (In-Memory) for the LSM-Tree
|
strong |
To represent the type of node in the skip list.
This enum class defines the types of nodes in the skip list. It includes three types: NEGATIVE_INFINITY, NORMAL, and POSITIVE_INFINITY. NEGATIVE_INFINITY is used to represent the head of the skip list, NORMAL is used for regular nodes, and POSITIVE_INFINITY is used to represent the tail of the skip list.