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

Permutations.popFront

mir combinatorics Permutations

Input range primitives

  1. Slice!(const(T)*) front [@property getter]
  2. void popFront()
    struct Permutations(T)
    scope @safe pure nothrow @nogc
    void
    popFront
    ()
    ()
    if (
    isUnsigned!T &&
    T.sizeof <= size_t.sizeof
    )
  3. bool empty [@property getter]
  4. size_t length [@property getter]

Meta

Source

See Implementation

mir combinatorics Permutations aliasesconstructorsfunctionsproperties

Page generated by adrdox