iterpc (0.3.3)

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.

Maintainer: Randy Lai
Author(s): Randy Lai [aut, cre]

License: GPL-2

Uses: gmp, iterators, Rcpp, foreach, testthat, knitr, rmarkdown
Reverse depends: glm.predict

Released 9 months ago.