cartesian-product function clojure.math.combinatorics All the ways to take one item from each se... combinations function clojure.math.combinatorics All the unique ways of taking t different ... count-combinations function clojure.math.combinatorics (count (combinations items t)) but compute... count-permutations function clojure.math.combinatorics Counts the number of distinct permutations... count-subsets function clojure.math.combinatorics (count (subsets items)) but computed more ...

```
drop-permutations function clojure.math.combinatorics (drop n (permutations items)) but calculat...
```

nth-combination function clojure.math.combinatorics The nth element of the sequence of t-combi... nth-permutation function clojure.math.combinatorics (nth (permutations items)) but calculated ...

partitions function clojure.math.combinatorics All the lexicographic distinct partitions ... permutation-index function clojure.math.combinatorics Input must be a sortable collection of ite... permutations function clojure.math.combinatorics All the distinct permutations of items, le...

selections function clojure.math.combinatorics All the ways of taking n (possibly the sam... subsets function clojure.math.combinatorics All the subsets of items.

Copyright 2007-2017 by Rich Hickey and the various contributors

Logo & site design by Tom Hickey.

Clojure auto-documentation system by Tom Faulhaber.

Clojure auto-documentation system by Tom Faulhaber.