# --------------------------------------------
# CITATION file created with {cffr} R package
# See also: https://docs.ropensci.org/cffr/
# --------------------------------------------
 
cff-version: 1.2.0
message: 'To cite package "RcppAlgos" in publications use:'
type: software
title: 'RcppAlgos: High Performance Tools for Combinatorics and Computational Mathematics'
version: 2.10.0
identifiers:
- type: doi
  value: 10.32614/CRAN.package.RcppAlgos
- type: url
  value: https://gmplib.org/
- type: url
  value: https://github.com/kimwalisch/primesieve
- type: url
  value: https://libdivide.com
- type: url
  value: https://github.com/kimwalisch/primecount
- type: url
  value: https://ridiculousfish.com/
- type: url
  value: https://sweet.ua.pt/tos/software/prime_sieve.html
abstract: Provides optimized functions and flexible iterators implemented in C++ for
  solving problems in combinatorics and computational mathematics. Handles various
  combinatorial objects including combinations, permutations, integer partitions and
  compositions, Cartesian products, unordered Cartesian products, and partition of
  groups. Utilizes the RMatrix class from 'RcppParallel' for thread safety. The combination
  and permutation functions contain constraint parameters that allow for generation
  of all results of a vector meeting specific criteria (e.g. finding all combinations
  such that the sum is between two bounds). Capable of ranking/unranking combinatorial
  objects efficiently (e.g. retrieve only the nth lexicographical result) which sets
  up nicely for parallelization as well as random sampling. Gmp support permits exploration
  where the total number of results is large (e.g. comboSample(10000, 500, n = 4)).
  Additionally, there are several high performance number theoretic functions that
  are useful for problems common in computational mathematics. Some of these functions
  make use of the fast integer division library 'libdivide'. The primeSieve function
  is based on the segmented sieve of Eratosthenes implementation by Kim Walisch. It
  is also efficient for large numbers by using the cache friendly improvements originally
  developed by Tomás Oliveira. Finally, there is a prime counting function that implements
  Legendre's formula based on the work of Kim Walisch.
authors:
- family-names: Wood
  given-names: Joseph
  email: jwood000@gmail.com
preferred-citation:
  type: manual
  title: 'RcppAlgos: High Performance Tools for Combinatorics and Computational Mathematics'
  authors:
  - family-names: Wood
    given-names: Joseph
    email: jwood000@gmail.com
  year: '2026'
  notes: RcppAlgos package version 2.9.5
  url: https://jwood000.github.io/RcppAlgos/
repository: https://fastverse.r-universe.dev
repository-code: https://github.com/jwood000/RcppAlgos
commit: 94055646055da88e714fd3e1c2c8dee2a4ba05d7
url: https://jwood000.github.io/RcppAlgos/
date-released: '2026-03-16'
contact:
- family-names: Wood
  given-names: Joseph
  email: jwood000@gmail.com