getnext

a permutation/combination iterator

number of permutation(s)/combination(s) wanted, default to 1

if <code>d</code> is 1, drop simplify to vector if possible, default to <code>TRUE</code>.

drop

Get the next permutation(s)/combination(s) for a iterator

Iterator for generating permutations and combinations. They
can be either drawn with or without replacement, or with distinct/ non-distinct
items (multiset). The generated sequences are in lexicographical order
(dictionary order). The algorithms to generate permutations and combinations are
memory efficient. These iterative algorithms enable users to process all sequences
without putting all results in the memory at the same time.
The algorithms are written in C/C++ for faster performance. Note: 'iterpc' is no longer
being maintained. Users are recommended to switch to 'arrangements'.

getnext: Get the next permutation(s)/combination(s) for a iterator

Description

Usage

Arguments

Value