maurice/snix
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Lint maybe.el

Browse source 
This change had rippling implications.
This commit is contained in:
William Carroll 2020-08-31 14:59:48 +01:00
parent 1c87082648
commit a35f723d92
12 changed files with 53 additions and 49 deletions
Download patch file Download diff file Expand all files Collapse all files

6
emacs/.emacs.d/wpc/tree.el
View file

@ -69,7 +69,7 @@ Depth-first traversals have the advantage of typically consuming less memory
(cl-labels ((do-reduce-depth
(acc f node depth)
(let ((acc-new (funcall f node acc depth)))
(if (or (maybe/nil? node)
(if (or (maybe-nil? node)
(tree-leaf? node))
acc-new
(list/reduce
@ -98,7 +98,7 @@ Depth-first traversals have the advantage of typically consuming less memory
(tree-reduce-depth
'()
(lambda (node acc depth)
(if (or (maybe/nil? node)
(if (or (maybe-nil? node)
(tree-leaf? node))
(list/cons depth acc)
acc))
@ -139,7 +139,7 @@ generating test data. Warning this function can overflow the stack."
(defun tree-leaf? (node)
"Return t if NODE has no children."
(maybe/nil? (node-children node)))
(maybe-nil? (node-children node)))
(defun tree-balanced? (n xs)
"Return t if the tree, XS, is balanced.