API for clojure.math.combinatorics - math.combinatorics 0.2.1-SNAPSHOT (in development)

Overview

Efficient, functional algorithms for generating lazy
sequences for common combinatorial functions. (See the source code 
for a longer description.)

Usage: (cartesian-product & seqs)

All the ways to take one item from each sequence

Usage: (combinations items t)

All the unique ways of taking t different elements from items

Usage: (count-combinations items t)

(count (combinations items t)) but computed more directly

Usage: (count-permutations l)

Counts the number of distinct permutations of l

Usage: (count-subsets items)

(count (subsets items)) but computed more directly

Usage: (drop-permutations items n)

(drop n (permutations items)) but calculated more directly.

Usage: (nth-combination items t n)

The nth element of the sequence of t-combinations of items

Usage: (nth-permutation items n)

(nth (permutations items)) but calculated more directly.

Usage: (partitions items & args)

All the lexicographic distinct partitions of items.
Optionally pass in :min and/or :max to specify inclusive bounds on the number of parts the items can be split into.

Usage: (permutation-index items)

Input must be a sortable collection of items.  Returns the n such that
(nth-permutation (sort items) n) is items.

Usage: (permutations items)

All the distinct permutations of items, lexicographic by index 
(special handling for duplicate items).

Usage: (permuted-combinations items t)

Every permutation of every combination of t elements from items

Usage: (selections items n)

All the ways of taking n (possibly the same) elements from the sequence of items

Usage: (subsets items)

All the subsets of items