'Rcpp Gallery' site at <https://gallery.rcpp.org>, the paper by Eddelbuettel and

Nathan Russell, Inaki Ucar, Douglas Bates and John Chambers

person("Romain", "Francois", role = c("aut", "cre"), email = "romain@r-enthusiasts.com"),
person("Kevin", "Ushey", role = "aut", email = "kevinushey@gmail.com"),
person("John", "Chambers", role = "ctb", email = "jmc@r-project.org")
Description: Rcpp11 includes a header only C++11 library that facilitates

Title: Rcpp Interface to the APT Package Manager
Description: The APT Package Management System provides Debian and
Debian-derived Linux systems with a powerful system to resolve package
dependencies. This package offers access directly from R.
SystemRequirements: A Debian-based system with the libapt-pkg-dev

Title: 'Rcpp' Interface to the APT Package Manager
Description: The 'APT Package Management System' provides Debian and

dependencies. This package offers access directly from R.  This can
only work on a system with a suitable 'libapt-pkg-dev' installation
so functionality is curtailed if such a library is not found.

Title: Tools for Combinatorics and Computational Mathematics
Description: Provides optimized functions implemented in C++ with 'Rcpp'.
There is a generalized combinations function that is highly efficient
(both speed and memory). There are optional contraint arguments that
when employed, generate all combinations of a vector meeting a specific
criteria (E.g. finding all combinations such that the sum is less than
a bound). Additionally, there are various sieving functions that quickly
generate essential components for problems common in computational
mathematics (E.g. number of comprime elements, divisors, prime
factorizations, and complete factorizations for many numbers as well
Packaged: 2017-10-26 14:11:11 UTC; josephwood

Packaged: 2017-11-03 01:48:20 UTC; josephwood

Packaged: 2017-11-03 02:48:24 UTC; josephwood

Description: Provides optimized functions implemented in C++ with 'Rcpp'
for solving problems in combinatorics and computational mathematics.
There is a combination function and a permutation function that are
both flexible as well as efficient with respect to speed and memory.
There are optional contraint arguments that when employed, generate
all combinations/permutations of a vector meeting a specific criteria
(E.g. finding all combinations such that the sum is less than a
bound). The generalized permutation function is also capable of
producing all permutations of multisets. Additionally, there are
various sieving functions that quickly generate essential components
for problems common in computational mathematics (E.g. number of
comprime elements, divisors, prime factorizations, and complete
factorizations for many numbers as well as primes in a range).
Packaged: 2017-11-28 20:31:38 UTC; josephwood