diff options
author | Aryadev Chavali <aryadev@aryadevchavali.com> | 2024-10-29 20:00:39 +0000 |
---|---|---|
committer | Aryadev Chavali <aryadev@aryadevchavali.com> | 2024-10-29 20:00:39 +0000 |
commit | cd94c350e69a931f4dfc84ecfe34a333a91b3552 (patch) | |
tree | 478f21514e7f37082d02948950779cefc55e3c2c /2022/puzzle-8.lisp | |
parent | b2c570524c7371e40e21ae107f4b62790607717a (diff) | |
download | advent-of-code-cd94c350e69a931f4dfc84ecfe34a333a91b3552.tar.gz advent-of-code-cd94c350e69a931f4dfc84ecfe34a333a91b3552.tar.bz2 advent-of-code-cd94c350e69a931f4dfc84ecfe34a333a91b3552.zip |
Use every instead of all
Diffstat (limited to '2022/puzzle-8.lisp')
-rw-r--r-- | 2022/puzzle-8.lisp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/2022/puzzle-8.lisp b/2022/puzzle-8.lisp index 85fd1ae..54aca27 100644 --- a/2022/puzzle-8.lisp +++ b/2022/puzzle-8.lisp @@ -23,7 +23,7 @@ (defun is-visible? (x y) (if (or (= x 0) (= x (- n-trees 1)) - (= y 0) (= y (- n-trees 1))) + (= y 0) (= y (- n-trees 1))) t (let* ((tree (get-tree x y)) (lt-tree? (lambda (a) (< a tree))) @@ -34,8 +34,8 @@ (col-top (subseq col 0 y)) (col-bottom (subseq col (+ y 1)))) (some #'id - (mapcar (lambda (x) (all lt-tree? x)) - (list row-left row-right col-top col-bottom)))))) + (mapcar (lambda (x) (every lt-tree? x)) + (list row-left row-right col-top col-bottom)))))) (defun how-many-visible () (loop |