Skip list (linked lists with express lanes), randomized but with an expected O(log n) for search/insert/delete. Uses memory pool for nodes and O(1) level generation from Skip Lists Done Right to reduce random coin flips. Includes a lock-free concurrent version.
-
Notifications
You must be signed in to change notification settings - Fork 0
Skip list (linked lists with express lanes), randomized but with an expected O(log n) for search/insert/delete. Uses memory pool for nodes and O(1) level generation from Skip Lists Done Right to reduce random coin flips. Includes a lock-free concurrent version.
License
goodcleanfun/skip_list
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Skip list (linked lists with express lanes), randomized but with an expected O(log n) for search/insert/delete. Uses memory pool for nodes and O(1) level generation from Skip Lists Done Right to reduce random coin flips. Includes a lock-free concurrent version.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published