Permutations of Multisets in Cool-Lex Order

A set of tools to permute multisets without loops or hash tables and to generate integer partitions. The permutation functions are based on C code from Aaron Williams. Cool-lex order is similar to colexicographical order. The algorithm is described in Williams, A. Loopless Generation of Multiset Permutations by Prefix Shifts. SODA 2009, Symposium on Discrete Algorithms, New York, United States. The permutation code is distributed without restrictions. The code for stable and efficient computation of multinomial coefficients comes from Dave Barber. The code can be download from <> and is distributed without conditions. The package also generates the integer partitions of a positive, non-zero integer n. The C++ code for this is based on Python code from Jerome Kelleher which can be found here <>. The C++ code and Python code are distributed without conditions.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1-12 by James Curran, 7 months ago

Browse source code at

Authors: James Curran , Aaron Williams , Jerome Kelleher , Dave Barber

Documentation:   PDF Manual  

GPL-2 license

Depends on methods, Rcpp

Linking to Rcpp

System requirements: C++11

Imported by BMRMM, DNAtools, SIDES, alphabetr, jack, ks, relSim, splitSelect.

Depended on by hpcwld.

See at CRAN