The OpenD Programming Language

Permutations

std algorithm iteration

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

struct Permutations (
Range
) {
this(Range r);
bool empty [@property getter];
auto front [@property getter];
void popFront();
auto save();
}

Constructors

this
this(Range r)

Members

Functions

popFront
void popFront()
save
auto save()

Properties

empty
bool empty [@property getter]
front
auto front [@property getter]

Parameters

Range

the range type

Return Value

A forward range of elements of which are an std.range.indexed view into r.

Examples

import std.algorithm.comparison : equal;
import std.range : iota;
assert(equal!equal(iota(3).permutations,
    [[0, 1, 2],
     [1, 0, 2],
     [2, 0, 1],
     [0, 2, 1],
     [1, 2, 0],
     [2, 1, 0]]));

See Also

std.algorithm.sorting.nextPermutation.

Meta

Source

See Implementation

std algorithm iteration functionsstructstemplates
Page generated by adrdox