Algorithm::Combinatorics 0.24

Algorithm::Combinatorics Perl module is an efficient generator of combinatorial sequences.

SYNOPSIS

use Algorithm::Combinatorics qw(permutations);

my @data = qw(a b c);

# scalar context gives an iterator
my $iter = permutations(@data);
while (my $p = $iter->next) {
# ...
}

# list context slurps
my @all_permutations = permutations(@data);

Algorithm::Combinatorics is an efficient generator of combinatorial sequences. Algorithms are selected from the literature (work in progress, see "REFERENCES"). Iterators do not use recursion, nor stacks, and are written in C.

Tuples are generated in lexicographic order.