iterpc: Efficient Iterator for Permutations and Combinations

It helps in 1) generating permutations and combinations with or without replacement; 2) with distinct items or non-distinct items (multiset); 3) calculating number of combinations or permutations in various situations. All generated sequences are in lexicographical order (AKA, 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 performances.

Version: 0.2.8
Depends: R (≥ 3.0.0)
Imports: iterators, Rcpp (≥ 0.11.0), polynom
LinkingTo: Rcpp
Suggests: foreach, testthat
Published: 2016-01-28
Author: Randy Lai [aut, cre], Martin Broadhurst [aut]
Maintainer: Randy Lai <randy.cs.lai at>
License: GPL-2
NeedsCompilation: yes
SystemRequirements: GNU make
Materials: README
CRAN checks: iterpc results


Reference manual: iterpc.pdf
Package source: iterpc_0.2.8.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X Snow Leopard binaries: r-release: iterpc_0.2.8.tgz, r-oldrel: iterpc_0.2.7.tgz
OS X Mavericks binaries: r-release: iterpc_0.2.8.tgz
Old sources: iterpc archive

Reverse dependencies:

Reverse imports: ldamatch, robustrao