permutations

Lazily computes all permutations of r using Heap's algorithm.

While generating a new item is in O(k) (amortized O(1)), the number of permutations is |n|!.

Permutations!T permutations(size_t n)
IndexedRoR!(Permutations!T, Range) permutations(Range r)
@safe pure nothrow
IndexedRoR!(Permutations!T, Range)
permutations
(
T = uint
Range
)
(
Range r
)
if (
__traits(compiles, Range.init[size_t.init])
)
Permutations!T makePermutations(Allocator alloc, size_t n)

Parameters

r Range: random access field. A field may not have iteration primitivies.

Return Value

Type: IndexedRoR!(Permutations!T, Range)

Forward range, which yields the permutations

See Also

Meta

Source

See Implementation

mir combinatorics functions

structs