permutation alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view permutation alternatives based on common mentions on social networks and blogs.
-
Agda
Agda is a dependently typed programming language / interactive theorem prover. -
-
-
vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. -
-
repa-eval
High performance, regular, shape polymorphic parallel arrays. -
repa-array
High performance, regular, shape polymorphic parallel arrays. -
repa-convert
High performance, regular, shape polymorphic parallel arrays. -
repa-scalar
High performance, regular, shape polymorphic parallel arrays. -
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison. -
psqueues
Priority Search Queues in three different flavors for Haskell -
ethereum-client-haskell
A Haskell version of an Ethereum client -
-
type-level-sets
Type-level sets for Haskell (with value-level counterparts and various operations) -
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. -
-
ixset-typed
More strongly typed variant of the ixset Haskell package -
-
knit
Ties the knot on data structures that reference each other by unique keys -
nonempty-containers
Efficient non-empty variants of containers data types, with full API -
-
eliminators
Dependently typed elimination functions using singletons -
claferIG
Support for reasoning on Clafer models by instantiation and counter example generation. -
-
map-syntax
Syntax sugar and explicit semantics for statically defined maps -
hw-fingertree-strict
Generic strict finger-tree structure -
igraph
Incomplete Haskell bindings to the igraph library (which is written in C)
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of permutation or a related project?
|
Less time debugging, more time building
sponsored
scoutapm.com
|
Popular Comparisons
-
permutationvsmultiset
-
data-clistvspomaps
-
naperianvsjustified-containers
-
ethereum-client-haskellvsethereum-analyzer
-
rawrvsgraphite
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
permutation
This library includes data types for storing permutations and combinations. It implements pure and impure types, the latter of which can be modified in-place. The library uses aggressive inlining and MutableByteArray#s internally, so it is very efficient.
The main utility of the library is converting between the linear representation of a permutation and a sequence of swaps. This allows, for instance, applying a permutation or its inverse to an array with O(1) memory use.
Much of the interface for the library is based on the permutation and combination functions in the GNU Scientific Library (GSL).