https://github.com/gmalecha/skip-list

Pure skip lists in Haskell
https://github.com/gmalecha/skip-list

data-structures functional-programming haskell-library skiplist

Last synced: about 1 month ago
JSON representation

Pure skip lists in Haskell

• Host: GitHub
• URL: https://github.com/gmalecha/skip-list
• Owner: gmalecha
• License: mit
• Created: 2017-07-14T00:23:11.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-08-15T18:55:12.000Z (over 7 years ago)
• Last Synced: 2024-10-28T14:20:49.681Z (about 2 months ago)
• Topics: data-structures, functional-programming, haskell-library, skiplist
• Language: Haskell
• Size: 15.6 KB
• Stars: 9
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGES.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# skip-list

[![Build Status](https://travis-ci.org/gmalecha/skip-list.svg?branch=master)](https://travis-ci.org/gmalecha/skip-list)

Skip lists provide efficient *amortized* indexing deep into lists by

building an index that, essentially, converts the list into a balance

binary tree. See [the wikipedia entry on skip

lists](https://en.wikipedia.org/wiki/Skip_list) for more information.

## Performance

You can run the benchmarks using `stack bench`. The benchmark is the following:

```haskell

let big = [0..1000] in

big == get (make big) <$> big

```

* For lists (`get = !!` and `make = id`)

```

benchmarking all/!!

time                 864.6 μs   (858.1 μs .. 873.0 μs)

                     0.999 R²   (0.999 R² .. 1.000 R²)

mean                 859.3 μs   (855.5 μs .. 864.3 μs)

std dev              14.76 μs   (11.86 μs .. 21.57 μs)

```

* For `SkipList` (`get = SL.lookup` and `make = SL.toSkipList 32`)

```

benchmarking Quantities/SkipList<32>

time                 134.9 μs   (134.0 μs .. 135.7 μs)

                     1.000 R²   (0.999 R² .. 1.000 R²)

mean                 134.0 μs   (133.6 μs .. 134.5 μs)

std dev              1.559 μs   (1.317 μs .. 1.958 μs)

```