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'.
- Version0.4.2
- R versionunknown
- LicenseGPL-2
- Needs compilation?No
- Last release01/10/2020
Documentation
Team
Randy Lai
Insights
Last 30 days
This package has been downloaded 2,572 times in the last 30 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 44 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 39,416 times in the last 365 days. That's enough downloads to make it mildly famous in niche technical communities. A badge of honor! The day with the most downloads was Oct 06, 2024 with 442 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports3 packages
- Suggests4 packages
- Reverse Imports4 packages
- Reverse Suggests3 packages