golang-github-ryszard-goskiplist-dev 0.0~git20150312.2dfbae5-3 (amd64 binary) in ubuntu lunar
This is a library implementing skip lists for the Go programming
language (http://
.
Skip lists are a data structure that can be used in place of balanced
trees. Skip lists use probabilistic balancing rather than strictly
enforced balancing and as a result the algorithms for insertion and
deletion in skip lists are much simpler and significantly faster than
equivalent algorithms for balanced trees.
.
Skip lists were first described in Pugh, William (June 1990)
(ftp://ftp.
a probabilistic alternative to balanced trees". Communications of the
ACM 33 (6): 668–676
Details
- Package version:
- 0.0~git20150312.2dfbae5-3
- Status:
- Published
- Component:
- universe
- Priority:
- Optional