ixset VS void

Compare ixset vs void and see what are their differences.

ixset

A Set type which supports multiple indexes (by Happstack)
Data structures Ixset
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
ixset void
- -
16 19
- -
0.0 0.0
about 2 years 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.

ixset

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

We haven't tracked posts mentioning ixset 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 ixset and void you can also consider the following projects:

ixset-typed - More strongly typed variant of the ixset Haskell package

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

subwordgraph - An implementation of a classic Subword Graph (also known as Directed Acyclic Word Graph).

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

monadic-arrays - MArray instances for monad transformers

naperian - Efficient representable functors

graphite - Haskell graphs and networks library

map-syntax - Syntax sugar and explicit semantics for statically defined maps

permutation - git import of patrick perry permutations lib from darcs

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

nonempty-containers - Efficient non-empty variants of containers data types, with full API

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

ixset vs ixset-typed void vs justified-containers ixset vs subwordgraph void vs miso ixset vs monadic-arrays void vs naperian ixset vs graphite void vs map-syntax ixset vs permutation void vs repa-array ixset vs nonempty-containers void vs hoq