Description: Provides functions to compute the main characteristics of the

Imports: graphics, stats, utils, methods, reshape, iterators,
doParallel, foreach, fitdistrplus, grid, gridExtra

Title: Apply a Function to a Margin of an Array
Description: High performance variant of apply() for a fixed set of functions.
However, a considerable speedup is a trade-off for universality.
Only the following functions can be applied: sum(), prod(), all(), any(),
min(), max(), mean(), median(), sd(), var().

Considerable speedup is a trade-off for universality, user defined
functions cannot be used with this package. However, 20 most currently employed
functions are available for usage. They can be divided in three types:
reducing functions (like mean(), sum() etc., giving a scalar when applied to a vector),
mapping function (like normalise(), cumsum() etc., giving a vector of the same length
as the input vector) and finally, vector reducing function (like diff() which produces
result vector of a length different from the length of input vector).
Optional or mandatory additional arguments required by some functions
(e.g. norm type for norm() or normalise() functions) can be

functions cannot be used with this package. However, 21 most currently employed

Title: Fast Generators and Iterators for Permutations, Combinations and
person("Randy", "Lai", , "randy.cs.lai@gmail.com", role = c("aut", "cre"))
Description: Fast generators and iterators for permutations, combinations
and partitions. The iterators allow users to generate arrangements in
a memory efficient manner and the generated arrangements are in
lexicographical (dictionary) order. Permutations and combinations can
be drawn with/without replacement and support multisets. It has been
demonstrated that 'arrangements' outperforms most of the existing
packages of similar kind. Some benchmarks could be found at
Suggests: foreach, testthat, knitr, rmarkdown

Suggests: foreach, knitr, rmarkdown, testthat

Title: Fast Generators and Iterators for Permutations, Combinations,
Description: Fast generators and iterators for permutations, combinations,
integer partitions and compositions. The arrangements are in
lexicographical order and generated iteratively in a memory efficient manner.
It has been demonstrated that 'arrangements' outperforms most existing
packages of similar kind. Benchmarks could be found at