iterpc: Efficient Iterator for Permutations and Combinations

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'.

Version: 0.4.2
Depends: R (≥ 3.0.0)
Imports: iterators, gmp (≥ 0.5-12), arrangements (≥ 1.0.0)
Suggests: foreach, testthat, knitr, rmarkdown
Published: 2020-01-10
DOI: 10.32614/CRAN.package.iterpc
Author: Randy Lai [aut, cre]
Maintainer: Randy Lai <randy.cs.lai at>
License: GPL-2
NeedsCompilation: no
Materials: README
CRAN checks: iterpc results


Reference manual: iterpc.pdf
Vignettes: Examples of generating combinations
Examples of generating permutations


Package source: iterpc_0.4.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): iterpc_0.4.2.tgz, r-oldrel (arm64): iterpc_0.4.2.tgz, r-release (x86_64): iterpc_0.4.2.tgz, r-oldrel (x86_64): iterpc_0.4.2.tgz
Old sources: iterpc archive

Reverse dependencies:

Reverse imports: cellOrigins, ldamatch, MendelianRandomization, robustrao
Reverse suggests: dartR, dartR.base, dartR.popgen


Please use the canonical form to link to this page.