ixset VS ixset-typed

Compare ixset vs ixset-typed and see what are their differences.

ixset

A Set type which supports multiple indexes (by Happstack)

ixset-typed

More strongly typed variant of the ixset Haskell package (by well-typed)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
ixset ixset-typed
- 1
16 23
- -
0.0 3.2
almost 2 years ago almost 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.

ixset-typed

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

What are some alternatives?

When comparing ixset and ixset-typed you can also consider the following projects:

monadic-arrays - MArray instances for monad transformers

multiset - multiset haskell package

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

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

permutation - git import of patrick perry permutations lib from darcs

psqueues - Priority Search Queues in three different flavors for Haskell

graphite - Haskell graphs and networks library

nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)

void - Provides Data.Void, which is in base since ghc 7.8 or so

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

naperian - Efficient representable functors