mir-algorithm ~master (2021-09-24T13:11:04Z)

cartesianPower

mir combinatorics

Lazily computes the Cartesian power of r with itself for a number of repetitions D repeat. If the input is sorted, the product is in lexicographic order.

While generating a new item is in O(k) (amortized O(1)), the total number of elements is n^k.

  1. CartesianPower!T cartesianPower(size_t n, size_t repeat)
  2. IndexedRoR!(CartesianPower!T, Range) cartesianPower(Range r, size_t repeat)
    IndexedRoR!(CartesianPower!T, Range)
    cartesianPower
    (
    T = uint
    Range
    )
    (
    Range r
    ,
    size_t repeat = 1
    )
    if (
    isUnsigned!T &&
    __traits(compiles, Range.init[size_t.init])
    )
  3. CartesianPower!T makeCartesianPower(Allocator alloc, size_t n, size_t repeat)

Parameters

r Range

random access field. A field may not have iteration primitivies.

repeat size_t

number of repetitions

Return Value

Type: IndexedRoR!(CartesianPower!T, Range)

Forward range, which yields the product items

See Also

CartesianPower

Meta

Source

See Implementation

mir combinatorics functionsstructs

Page generated by adrdox