ixset-typed VS permutation

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

ixset-typed

More strongly typed variant of the ixset Haskell package (by well-typed)
Data structures Ixset
Source Code
Suggest alternative
Edit details

permutation

git import of patrick perry permutations lib from darcs (by spacekitteh)
Data structures
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
ixset-typed permutation
1 -
23 8
- -
3.2 0.0
almost 2 years ago about 6 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-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.

permutation

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

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

What are some alternatives?

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

ixset - A Set type which supports multiple indexes

multiset - multiset haskell package

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

psqueues - Priority Search Queues in three different flavors for Haskell

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

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

singletons - Fake dependent types in Haskell using singletons

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

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

naperian - Efficient representable functors

ixset-typed vs ixset permutation vs multiset ixset-typed vs multiset permutation vs Agda ixset-typed vs psqueues permutation vs type-level-sets ixset-typed vs btree-concurrent permutation vs singletons ixset-typed vs nibblestring permutation vs repa-array ixset-typed vs naperian permutation vs psqueues