randy3k/iterpc: Efficient Iterator for Permutations and Combinations
Version 0.3.4

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.

Getting started

Package details

AuthorRandy Lai [aut, cre]
MaintainerRandy Lai <[email protected]>
LicenseGPL-2
Version0.3.4
URL https://randy3k.github.io/iterpc
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("devtools")
library(devtools)
install_github("randy3k/iterpc")
randy3k/iterpc documentation built on Dec. 8, 2017, 12:26 a.m.