iterpc: Efficient Iterator for Permutations and Combinations

A collection of iterators for generating permutations and combinations with or without replacement; with distinct items or 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 performances.

Version: 0.3.0
Depends: R (≥ 3.0.0)
Imports: iterators, gmp (≥ 0.5-12), Rcpp (≥ 0.11.0)
LinkingTo: Rcpp
Suggests: foreach, testthat
Published: 2016-05-31
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.3.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: not available
OS X Mavericks binaries: r-oldrel: iterpc_0.3.0.tgz
Old sources: iterpc archive

Reverse dependencies:

Reverse depends: glm.predict
Reverse imports: ldamatch, robustrao, starmie


Please use the canonical form to link to this page.