map-syntax VS void

Compare map-syntax vs void and see what are their differences.

map-syntax

Syntax sugar and explicit semantics for statically defined maps (by mightybyte)
Data structures Map
Source Code
Suggest alternative
Edit details

void

Provides Data.Void, which is in base since ghc 7.8 or so (by ekmett)
Data structures
Source Code
hackage.haskell.org
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
map-syntax void
- -
7 19
- -
0.0 0.0
9 months ago about 2 years 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.

map-syntax

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

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

void

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

We haven't tracked posts mentioning void yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing map-syntax and void you can also consider the following projects:

loc - Types representing line and column positions and ranges in text files

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

bytestring-trie - An efficient finite map from (byte)strings to values.

repa-array - High performance, regular, shape polymorphic parallel arrays.

Agda - Agda is a dependently typed programming language / interactive theorem prover.

miso - :ramen: A tasty Haskell front-end framework

map-exts

naperian - Efficient representable functors

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

hoq - A language based on homotopy type theory with an interval

exposed-containers - A redistribution of 'containers', with all hidden modules exposed.

distributive - Dual Traversable

map-syntax vs loc void vs justified-containers map-syntax vs bytestring-trie void vs repa-array map-syntax vs Agda void vs miso map-syntax vs map-exts void vs naperian map-syntax vs btree-concurrent void vs hoq map-syntax vs exposed-containers void vs distributive