Popularity

3.3

Stable

Activity

0.0

Stable

Stars 9

Watchers 2

Forks 0

Last Commit over 7 years ago

Monthly Downloads: 8

Programming language: Haskell

License: MIT License

Tags: Data

Latest version: v0.1.0.1

skip-list alternatives and similar packages

Based on the "Data" category.
Alternatively, view skip-list alternatives based on common mentions on social networks and blogs.

lens

10.0 7.3 skip-list VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source

10.0 8.9 skip-list VS semantic-source

Parsing, analyzing, and comparing source code across many languages

SaaSHub - Software Alternatives and Reviews

SaaSHub helps you find the best software and product alternatives

Promo www.saashub.com

hnix

9.9 6.8 skip-list VS hnix

A Haskell re-implementation of the Nix expression language
text

9.8 7.9 skip-list VS text

Haskell library for space- and time-efficient operations over Unicode text.
code-builder

9.8 0.0 skip-list VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
compendium-client

9.7 0.0 skip-list VS compendium-client

DISCONTINUED. Mu (μ) is a purely functional framework for building micro services.
Frames

9.7 6.1 skip-list VS Frames

Data frames for tabular data.
unordered-containers

9.7 2.9 skip-list VS unordered-containers

Efficient hashing-based container types
cassava

9.7 4.8 skip-list VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
massiv

9.7 2.9 skip-list VS massiv

Efficient Haskell Arrays featuring Parallel computation
alfred-margaret

9.6 5.5 skip-list VS alfred-margaret

Fast Aho-Corasick string searching
holmes

9.6 0.0 skip-list VS holmes

A reference library for constraint-solving with propagators and CDCL.
critbit

9.5 0.0 skip-list VS critbit

A Haskell implementation of crit-bit trees.
binary

9.5 4.1 skip-list VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
resource-pool

9.5 0.0 skip-list VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 6.5 skip-list VS hashable

A class for types that can be converted to a hash value
refined

9.5 4.8 skip-list VS refined

Refinement types with static checking
primitive

9.5 6.0 skip-list VS primitive

This package provides various primitive memory-related operations.
network-msgpack-rpc

9.4 skip-list VS network-msgpack-rpc

A MessagePack-RPC Implementation
higgledy

9.4 2.6 skip-list VS higgledy

Higher-kinded data via generics
data-msgpack

9.4 skip-list VS data-msgpack

A Haskell implementation of MessagePack
diskhash

9.4 3.2 skip-list VS diskhash

Diskbased (persistent) hashtable
jump

9.4 0.0 skip-list VS jump

Jump start your Haskell development
caledon

9.4 0.0 skip-list VS caledon

higher order dependently typed logic programing
hashtables

9.4 1.0 skip-list VS hashtables

Mutable hash tables for Haskell, in the ST monad
cereal

9.4 0.0 skip-list VS cereal

A binary serialization library
aeson-qq

9.4 3.6 skip-list VS aeson-qq

JSON quasiquoter for Haskell
json-autotype

9.3 0.0 skip-list VS json-autotype

Automatic Haskell type inference from JSON input
discrimination

9.3 3.6 skip-list VS discrimination

Fast linear time sorting and discrimination for a large class of data types
audiovisual

9.3 4.7 skip-list VS audiovisual

Extensible records, variants, structs, effects, tangles
dependent-sum

9.3 4.3 skip-list VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
IORefCAS

9.3 5.7 skip-list VS IORefCAS

A collection of different packages for CAS based data structures.
certificate

9.3 0.0 skip-list VS certificate

Certificate and Key Reader/Writer in haskell
dependent-map

9.3 4.7 skip-list VS dependent-map

Dependently-typed finite maps (partial dependent products)
rei

9.2 0.0 skip-list VS rei

Process lists easily
bifunctors

9.2 3.7 skip-list VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
orgmode-parse

9.2 0.0 skip-list VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
protobuf

9.2 2.6 skip-list VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
reflection

9.2 5.2 skip-list VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
safecopy

9.2 4.2 skip-list VS safecopy

An extension to Data.Serialize with built-in version control
avro

9.2 5.2 skip-list VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
uuid

9.2 4.6 skip-list VS uuid

A Haskell library for creating, printing and parsing UUIDs
uuid-types

9.2 4.6 skip-list VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
scientific

9.2 0.0 skip-list VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
b-tree

9.1 1.8 skip-list VS b-tree

Haskell on-disk B* tree implementation
streaming

9.1 0.0 skip-list VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
witherable

9.1 2.4 skip-list VS witherable

Filter with effects
stdio

9.1 1.8 skip-list VS stdio

Haskell Standard Input and Output
typerep-map

9.1 2.1 skip-list VS typerep-map

⚡️Efficient implementation of Map with types as keys
text-icu

9.1 5.8 skip-list VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.

Do you think we are missing an alternative of skip-list or a related project?

Add another 'Data' Package

Popular Comparisons

README

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 for more information.

Performance

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

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)

skip-list

Pure skip lists in Haskell

skip-list alternatives and similar packages

Popular Comparisons

README

skip-list

Performance