hashtables VS primitive-unaligned

Compare hashtables vs primitive-unaligned and see what are their differences.

hashtables

Mutable hash tables for Haskell, in the ST monad (by gregorycollins)
Data Hashtables
Source Code
Suggest alternative
Edit details

primitive-unaligned

Interface to byte arrays with unaligned words (by haskell-primitive)
Data Primitive
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
hashtables primitive-unaligned
1 1
125 0
- -
1.0 4.5
9 months ago 6 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

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.

primitive-unaligned

Posts with mentions or reviews of primitive-unaligned. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-09-10.
  • [ANN] vector-hashtables
    2 projects | /r/haskell | 10 Sep 2021
    It doesn't support tuples, I think I might have to use something from primitive-unaligned, but I don't know if it is better to use unaligned elements which take less memory or to widen the smallest of the two so that all the elements have the same size. I think the option to use less memory is better because that will also lead to less cache misses.

What are some alternatives?

When comparing hashtables and primitive-unaligned you can also consider the following projects:

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

primitive-unlifted - the PrimUnlifted typeclass, an interface arrays of unlifted values

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.

unordered-containers - Efficient hashing-based container types

primitive-convenience - convenience class for PrimMonad m/PrimState m

llrbtree - Left-leaning red-black trees

primitive-foreign - using the `Prim` interface for the FFI

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

primitive-stablename - primitive operations on StableNames

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

primitive-atomic - Atomic operations on PrimArray and ByteArray

hashtables vs Octree primitive-unaligned vs primitive-unlifted hashtables vs gps2htmlReport primitive-unaligned vs primitive hashtables vs unordered-containers primitive-unaligned vs primitive-convenience hashtables vs llrbtree primitive-unaligned vs primitive-foreign hashtables vs minst-idx primitive-unaligned vs primitive-stablename hashtables vs jsons-to-schema primitive-unaligned vs primitive-atomic