Package: iterpc
Type: Package
Title: Efficient Iterator for Permutations and Combinations
Version: 0.2.7
Date: 2015-4-16
Author: Randy Lai [aut, cre], Martin Broadhurst [aut]
Maintainer: Randy Lai <randy.cs.lai@gmail.com>
Description: 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.
URL: http://randy.city/iterpc
License: GPL-2
Depends: R (>= 3.0.0)
Imports: Rcpp (>= 0.11.0), polynom
Suggests: testthat
LinkingTo: Rcpp
SystemRequirements: GNU make
Packaged: 2015-04-16 07:39:22 UTC; randy
NeedsCompilation: yes
Repository: CRAN
Date/Publication: 2015-04-16 13:07:23
Built: R 3.1.3; x86_64-apple-darwin10.8.0; 2015-04-17 09:21:03 UTC; unix
Archs: iterpc.so.dSYM
