diff options
author | William Carroll <wpcarro@gmail.com> | 2020-09-01T12·44+0100 |
---|---|---|
committer | William Carroll <wpcarro@gmail.com> | 2020-09-01T13·00+0100 |
commit | 718899c629bb1b8bd05285c2e8c5a1709e8e5226 (patch) | |
tree | bd360e7b7779e8d8f05df3eb1059887ede6ed8c7 /emacs/.emacs.d/wpc/cycle.el | |
parent | 3b2fffe954e3927673e403ee124a78f78bb1c45c (diff) |
More Elisp linting
In order for this to scale, I need to solve two things: 1. Ad-hoc ignore fill-column rules for URLs and other exceptions. 2. Run Elisp flychecker without evaluating my Elisp code and firing its side-effects.
Diffstat (limited to 'emacs/.emacs.d/wpc/cycle.el')
-rw-r--r-- | emacs/.emacs.d/wpc/cycle.el | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/emacs/.emacs.d/wpc/cycle.el b/emacs/.emacs.d/wpc/cycle.el index cdf502fbdbb2..6b1181b4edd3 100644 --- a/emacs/.emacs.d/wpc/cycle.el +++ b/emacs/.emacs.d/wpc/cycle.el @@ -1,9 +1,9 @@ -;;; cycle.el --- Simple module for working with cycles. -*- lexical-binding: t -*- +;;; cycle.el --- Simple module for working with cycles -*- lexical-binding: t -*- ;; Author: William Carroll <wpcarro@gmail.com> ;; Version: 0.0.1 ;; URL: https://git.wpcarro.dev/wpcarro/briefcase -;; Package-Requires: ((emacs "24")) +;; Package-Requires: ((emacs "24.3")) ;;; Commentary: ;; Something like this may already exist, but I'm having trouble finding it, and @@ -56,7 +56,7 @@ "Return the list representation of a cycle, XS." (cycle-xs xs)) -(defun next-index<- (lo hi x) +(defun cycle--next-index<- (lo hi x) "Return the next index in a cycle when moving downwards. - `LO' is the lower bound. - `HI' is the upper bound. @@ -65,7 +65,7 @@ (- hi 1) (- x 1))) -(defun next-index-> (lo hi x) +(defun cycle--next-index-> (lo hi x) "Return the next index in a cycle when moving upwards. - `LO' is the lower bound. - `HI' is the upper bound. @@ -97,7 +97,7 @@ underlying struct." (defun cycle-next (xs) "Return the next value in `XS' and update `current-index'." (let* ((current-index (cycle-current-index xs)) - (next-index (next-index-> 0 (cycle-count xs) current-index))) + (next-index (cycle--next-index-> 0 (cycle-count xs) current-index))) (struct-set! cycle previous-index current-index xs) (struct-set! cycle current-index next-index xs) (nth next-index (cycle-xs xs)))) @@ -105,7 +105,7 @@ underlying struct." (defun cycle-prev (xs) "Return the previous value in `XS' and update `current-index'." (let* ((current-index (cycle-current-index xs)) - (next-index (next-index<- 0 (cycle-count xs) current-index))) + (next-index (cycle--next-index<- 0 (cycle-count xs) current-index))) (struct-set! cycle previous-index current-index xs) (struct-set! cycle current-index next-index xs) (nth next-index (cycle-xs xs)))) @@ -136,7 +136,7 @@ underlying struct." (error "No element in cycle matches predicate")))) (defun cycle-focus-item (x xs) - "Focus ITEM in cycle XS. + "Focus item, X, in cycle XS. ITEM is the first item in XS that t for `equal'." (cycle-focus (lambda (y) (equal x y)) xs)) |