dwrz/exercism
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Refactor elisp/anagram/anagrams-for

Browse Source 
Reformat.

Use push macro over low-level list-manipulation.
This commit is contained in:
dwrz
2019-02-05 02:29:37 +00:00
parent 7ab5ac1638
commit bd7d8a2ccb
1 changed files with 6 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
elisp/anagram/anagram.el
+5 -7
View File
@@ -29,18 +29,16 @@ CHAR-COUNT and COMPARISON-CHAR-COUNT should be alists in (character . count) for
(setq are-equal nil)) (setq are-equal nil))
(setq are-equal nil))))) (setq are-equal nil)))))
(defun anagrams-for(word anagrams) (defun anagrams-for (word anagrams)
"Return all elements of ANAGRAMS which are anagrams for WORD. "Return all elements of ANAGRAMS which are anagrams for WORD.
Case insensitive." Case insensitive."
(let ((candidates ()) (let ((candidates ())
(word-char-count (get-char-count (downcase word)))) (word-char-count (get-char-count (downcase word))))
(dolist (candidate anagrams candidates) (dolist (candidate anagrams candidates)
(if (and (when (and (not (string-equal word candidate))
(not (string-equal word candidate)) (= (length word) (length candidate))
(equal (length word) (length candidate))
(equal-char-count word-char-count (get-char-count (downcase candidate)))) (equal-char-count word-char-count (get-char-count (downcase candidate))))
(if (> (length candidates) 0) (push candidate candidates)))
(add-to-list 'candidates candidate t) (reverse candidates)))
(setq candidates (cons candidate nil)))))))
;;; anagram.el ends here ;;; anagram.el ends here