Combinations

Given non-negative integers m and n, generate all size m combinations of the integers from 0 to n-1 in sorted order (each combination is sorted and the entire table is sorted).

For example, 3 comb 5 is 0 1 2 0 1 3 0 1 4 0 2 3 0 2 4 0 3 4 1 2 3 1 2 4 1 3 4 2 3 4

struct Combinations (

bool copy = true

bool useArray = true

) {

import std.container : Array;;

import std.traits : Unqual;;

alias Indices = Array!size_t;

alias Indices = size_t[];

this(T[] pool_, size_t r_);

size_t length [@property getter];

void popFront();

}

Constructors

this this(T[] pool_, size_t r_): Undocumented in source.

Members

Aliases

Indices alias Indices = Array!size_t: Undocumented in source.
Indices alias Indices = size_t[]: Undocumented in source.

Functions

popFront void popFront(): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

length size_t length [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.

Variables

empty bool empty;
front Unqual!T[] front;: Undocumented in source.
indices Indices indices;: Undocumented in source.
len size_t len;: Undocumented in source.
lenComputed bool lenComputed;
n size_t n;: Undocumented in source.
pool Unqual!T[] pool;: Undocumented in source.
r size_t r;: Undocumented in source.