skip-list VS hashtables

Compare skip-list vs hashtables and see what are their differences.

skip-list

Pure skip lists in Haskell (by gmalecha)
Data
Source Code
Suggest alternative
Edit details

hashtables

Mutable hash tables for Haskell, in the ST monad (by gregorycollins)
Data Hashtables
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
skip-list hashtables
- 1
9 125
- -
0.0 1.0
over 6 years ago 9 months ago
Haskell Haskell
MIT License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

skip-list

Posts with mentions or reviews of skip-list. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning skip-list yet.
Tracking mentions began in Dec 2020.

hashtables

Posts with mentions or reviews of hashtables. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-09-10.

What are some alternatives?

When comparing skip-list and hashtables you can also consider the following projects:

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

Octree - Octree is a shallow tree structure for 3-dimensional points

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

gps2htmlReport - Generates a HTML page report detailing a GPS journey, with charts, statistics and an OpenStreetMap graphic.

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

unordered-containers - Efficient hashing-based container types

massiv - Efficient Haskell Arrays featuring Parallel computation

llrbtree - Left-leaning red-black trees

jump - Jump start your Haskell development

minst-idx - Read and write data in the IDX format used in e.g. the MNIST database

tables - Deprecated because of

jsons-to-schema - Unifies JSON documents (and JSON Schemas) into a single schema

skip-list vs cassava hashtables vs Octree skip-list vs hashable hashtables vs gps2htmlReport skip-list vs binary hashtables vs unordered-containers skip-list vs massiv hashtables vs llrbtree skip-list vs jump hashtables vs minst-idx skip-list vs tables hashtables vs jsons-to-schema