quadprog, randtoolbox, parallel, R (>= 2.15)

Approximate Probability Densities by Iterated Laplace
Approximations

Print Loop Iterations at Exponentially Disparate Intervals
c(
person("Steve", "Condylios", , "steve.condylios@gmail.com", c("aut", "cre",
"cph"), comment = c(ORCID = "0000-0003-0599-844X")),
person("Zane", "Dax", , , "ctb")
)
Know which loop iteration the code execution is up to by including
a single, convenient function call inside the loop.
Steve Condylios [aut, cre, cph]
(<https://orcid.org/0000-0003-0599-844X>),
Zane Dax [ctb]

Support for iterators, which allow a programmer to
traverse through all the elements of a vector, list, or other
collection of data.

Support for iterators, which allow a programmer to traverse
through all the elements of a vector, list, or other collection
of data.

Support for iterators, which allow a programmer to traverse
through all the elements of a vector, list, or other collection of data.

Efficient iterator for permutations and combinations
Randy Lai [aut, cre], Martin Broadhurst [aut]
This package 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, only previous sequence is required to generate next sequence. These iteratively 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++ and hence very computational efficient.

Efficient Iterator for Permutations and Combinations
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.