iterpc: Efficient Iterators 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.3
Depends: R (≥ 3.0.0)
Imports: iterators, gmp (≥ 0.5-12), Rcpp (≥ 0.11.0)
LinkingTo: Rcpp
Suggests: foreach, testthat, knitr, rmarkdown
Published: 2017-09-12
Author: Randy Lai [aut, cre]
Maintainer: Randy Lai <randy.cs.lai at gmail.com>
License: GPL-2
URL: https://randy3k.github.io/iterpc
NeedsCompilation: yes
Materials: README
CRAN checks: iterpc results

Downloads:

Reference manual: iterpc.pdf
Vignettes: Examples of generating combinations
Examples of generating permutations
Package source: iterpc_0.3.3.tar.gz
Windows binaries: r-devel: iterpc_0.3.3.zip, r-release: iterpc_0.3.3.zip, r-oldrel: iterpc_0.3.3.zip
OS X El Capitan binaries: r-release: iterpc_0.3.3.tgz
OS X Mavericks binaries: r-oldrel: iterpc_0.3.3.tgz
Old sources: iterpc archive

Reverse dependencies:

Reverse imports: ldamatch, MOLHD, robustrao, starmie

Linking:

Please use the canonical form https://CRAN.R-project.org/package=iterpc to link to this page.