https://github.com/stevenroose/dart-skiplist

A skiplist implementation in Dart.
https://github.com/stevenroose/dart-skiplist

Last synced: about 1 month ago
JSON representation

A skiplist implementation in Dart.

• Host: GitHub
• URL: https://github.com/stevenroose/dart-skiplist
• Owner: stevenroose
• License: mit
• Created: 2016-01-14T20:26:36.000Z (about 9 years ago)
• Default Branch: master
• Last Pushed: 2016-01-14T20:29:53.000Z (about 9 years ago)
• Last Synced: 2024-10-30T20:23:56.862Z (3 months ago)
• Language: Dart
• Size: 5.86 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# skiplist

This class provides an implementation of skip lists, as they are described

in William Pugh's paper "Skip Lists: A probabilistic Alternative to

Balanced Trees".

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 have fast search by key, insert, update and delete operations,

all having a time complexity of O(log n).

All other type of operations are usually very bad.

This class implements Map, but can just as easily be used as a Set by

putting in null elements.

The implementation is largely based on the suggested implementation from

the paper. Also the configuration parameters are the same.