Description
This is a library implementing skip lists for the Go programming language.
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). "Skip lists: a
probabilistic alternative to balanced trees".
Communications of the ACM 33 (6): 668–676.
RPMs
2 files, 2 archessrc
noarch
Logs
riscv64
Changelog
* Thu Jul 24 2025 Fedora Release Engineering <releng@fedoraproject.org> - 0-0.16 - Rebuilt for https://fedoraproject.org/wiki/Fedora_43_Mass_Rebuild * Fri Jan 17 2025 Fedora Release Engineering <releng@fedoraproject.org> - 0-0.15 - Rebuilt for https://fedoraproject.org/wiki/Fedora_42_Mass_Rebuild * Thu Aug 08 2024 Mikel Olasagasti Uranga <mikel@olasagasti.info> - 0-0.14 - Update spec - Closes rhbz#2258252