3 unstable releases
0.2.1 | Oct 6, 2022 |
---|---|
0.2.0 | Oct 6, 2022 |
0.1.0 | Oct 6, 2022 |
#2482 in Algorithms
32KB
793 lines
Permoot - A general-purpose permutation library
A permutation is a mathematical object describing a rearrangement of some (finite) number of objects.
As an example, sorting an array gives you a permutation on the array indices.
Inversely, you can use any permutation on N
elements as a way to reorder an array of length N
(see Permutation::apply
)
Crate features
By default, permoot is no_std
.
No crate features are enabled by default.
- The
std
feature enables a few extra features that require the standard library - The
rand
feature enablesrand
support, allowing you to generate random permutations
Possible future features
I might add these if I come around to it:
- Iterator(s) over all permutations of a given length, according to some algorithm(s)
serde
support
Dependencies
~150KB