diff options
| author | Mark Engelberg <mark.engelberg@gmail.com> | 2009-03-01 01:50:21 +0000 |
|---|---|---|
| committer | Mark Engelberg <mark.engelberg@gmail.com> | 2009-03-01 01:50:21 +0000 |
| commit | 942551b4d92ef0413a07955c08653fbd8300bbc1 (patch) | |
| tree | cb4e8d224c10976f15caa80af8021950aa659820 /src/clojure/contrib | |
| parent | 153681b4ed497361fbbbf0bc8a9ca5190363a630 (diff) | |
Changed doc string for lex-permutations.
Diffstat (limited to 'src/clojure/contrib')
| -rw-r--r-- | src/clojure/contrib/combinatorics.clj | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/clojure/contrib/combinatorics.clj b/src/clojure/contrib/combinatorics.clj index 8303aebc..d777cf2b 100644 --- a/src/clojure/contrib/combinatorics.clj +++ b/src/clojure/contrib/combinatorics.clj @@ -40,7 +40,7 @@ Example: (lex-permutations [1 1 2]) -> ([1 1 2] [1 2 1] [2 1 1]) About permutations vs. lex-permutations:
lex-permutations is faster than permutations, but only works
-on sequences with comparable elements. They operate differently
+on sequences of numbers. They operate differently
on sequences with duplicate items (lex-permutations will only
give you back distinct permutations). lex-permutations always
returns the permutations sorted lexicographically whereas
@@ -144,7 +144,7 @@ On my own computer, I use versions of all these algorithms that return sequences (when v (cons v (lazy-seq (vec-lex-permutations (iter-perm v))))))
(defn lex-permutations
- "Fast lexicographic permutation generator for a sequence of comparable items"
+ "Fast lexicographic permutation generator for a sequence of numbers"
[c]
(lazy-seq
(let [vec-sorted (vec (sort c))]
|