Full namespace name:
clojure.math.combinatorics OverviewEfficient, 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 sequenceSource
Usage: (combinations items t)
All the unique ways of taking t different elements from itemsSource
Usage: (count-combinations items t)
(count (combinations items t)) but computed more directlySource
Usage: (count-permutations l)
Counts the number of distinct permutations of lSource
Usage: (count-subsets items)
(count (subsets items)) but computed more directlySource
Usage: (drop-permutations items n)
(drop n (permutations items)) but calculated more directly.Source
Usage: (nth-combination items t n)
The nth element of the sequence of t-combinations of itemsSource
Usage: (nth-permutation items n)
(nth (permutations items)) but calculated more directly.Source
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.Source
Usage: (permutation-index items)
Input must be a sortable collection of items. Returns the n such that (nth-permutation (sort items) n) is items.Source
Usage: (permutations items)
All the distinct permutations of items, lexicographic by index (special handling for duplicate items).Source
Usage: (permuted-combinations items t)
Every permutation of every combination of t elements from itemsSource
Usage: (selections items n)
All the ways of taking n (possibly the same) elements from the sequence of itemsSource
Usage: (subsets items)
All the subsets of itemsSource
Logo & site design by
Tom Hickey.
Clojure auto-documentation system by Tom Faulhaber.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4