combinationsRepeat

Lazily computes all k-combinations of r with repetitions. A k-combination with repetitions, or k-multicombination, or multisubset of size k from a set S is given by a sequence of k not necessarily distinct elements of S, where order is not taken into account. Imagine this as the cartesianPower filtered for only ordered items.

While generating a new combination with repeats is in O(k), the number of combinations with repeats is binomial(n + k - 1, k).

CombinationsRepeat!T combinationsRepeat(size_t n, size_t k)
IndexedRoR!(CombinationsRepeat!T, Range) combinationsRepeat(Range r, size_t k)
IndexedRoR!(CombinationsRepeat!T, Range)
combinationsRepeat
(
T = uint
Range
)
(
Range r
,
size_t k = 1
)
if (
isUnsigned!T &&
__traits(compiles, Range.init[size_t.init])
)
CombinationsRepeat!T makeCombinationsRepeat(Allocator alloc, size_t n, size_t repeat)

Parameters

r Range: random access field. A field may not have iteration primitivies.
k size_t: number of combinations

Return Value

Type: IndexedRoR!(CombinationsRepeat!T, Range)

Forward range, which yields the k-multicombinations items

combinationsRepeat

Parameters

Return Value

See Also

Meta

Source