yogsototh/leiningen
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Only the suggestions that have the same minimum distance.

Browse source
This commit is contained in:
Joe Gallo 2012-08-08 09:22:51 -04:00
parent 363d1c61c2
commit 5e2ff4ebd3
1 changed files with 12 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
leiningen-core/src/leiningen/core/main.clj
View file

@ -89,19 +89,21 @@
(sort)))
(defn suggestions [task]
(for [t (tasks)
:let [n (.replaceAll (name t) "leiningen." "")]
:when (>= 3 (distance n task))]
n))
(let [suggestions (into {} (for [t (tasks)
:let [n (.replaceAll (name t)
"leiningen." "")]]
[n (distance n task)]))
min (apply min (vals suggestions))]
(when (<= min 4)
(map first (filter #(= min (second %)) suggestions)))))
(defn ^:no-project-needed task-not-found [task & _]
(println (str "'" task "' is not a task. See 'lein help'."))
(let [suggestions (suggestions task)]
(when (seq suggestions)
(when-let [suggestions (suggestions task)]
(println)
(println "Did you mean this?")
(doseq [suggestion suggestions]
(println " " suggestion))))
(println " " suggestion)))
(abort))
;; TODO: got to be a cleaner way to do this, right?