hashtables VS hebrew-time

Compare hashtables vs hebrew-time and see what are their differences.

hashtables

Mutable hash tables for Haskell, in the ST monad (by gregorycollins)

hebrew-time

Hebrew dates and prayer times. (by snoyberg)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
hashtables hebrew-time
1 -
125 2
- -
1.0 0.0
9 months ago about 5 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License MIT 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.

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.

hebrew-time

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

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

What are some alternatives?

When comparing hashtables and hebrew-time you can also consider the following projects:

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

massiv - Efficient Haskell Arrays featuring Parallel computation

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

primitive - This package provides various primitive memory-related operations.

llrbtree - Left-leaning red-black trees

audiovisual - Extensible records, variants, structs, effects, tangles

unordered-containers - Efficient hashing-based container types

aig - Provides an interface for AIGs and word-level operations on them

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

b-tree - Haskell on-disk B* tree implementation

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

critbit - A Haskell implementation of crit-bit trees.