clojure.math.combinatorics — pfeodrippe/arrudeia 0.3.3

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

*' cljs

+' cljs

cartesian-product clj/s

(cartesian-product & seqs)

All the ways to take one item from each sequence

combinations clj/s

(combinations items t)

All the unique ways of taking t different elements from items

count-combinations clj/s

(count-combinations items t)

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

count-permutations clj/s

(count-permutations l)

Counts the number of distinct permutations of l

count-subsets clj/s

(count-subsets items)

(count (subsets items)) but computed more directly

drop-permutations clj/s

(drop-permutations items n)

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

nth-combination clj/s

(nth-combination items t n)

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

nth-permutation clj/s

(nth-permutation items n)

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

nth-subset clj/s

(nth-subset items n)

partitions clj/s

(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.

permutation-index clj/s

(permutation-index items)

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

permutations clj/s

(permutations items)

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

permuted-combinations clj/s

(permuted-combinations items t)

Every permutation of every combination of t elements from items

selections clj/s

(selections items n)

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

subsets clj/s

(subsets items)

All the subsets of items