After developing some little Emacs packages for a year or so, I began to notice how I’d forget little things that I learned, and then I’d have to go hunting for that information again. I also noticed how there are some issues for which there doesn’t seem to be a “best practice” or “Standard Operating Procedure” to refer to.
So this is intended to be a place to collect and organize information related to Emacs package development. Built with Emacs, by Emacs package developers, for Emacs package developers.
You can read this Org file directly on the repository rendered by GitHub (which lacks support for some minor features of the document), or you can read the HTML version.
Note: The primary sections are listed at the top of the page in the horizontal bar.
- Animations / Screencasts
- Asynchronicity
- Auditing / Reviewing
- Binding
- Buffers
- Checkers / linters
- Collections (lists, vectors, hash-tables, etc.)
- Color
- Data structure
- Date / Time
- Debugging
- Destructuring
- Documentation
- Editing
- General
- Highlighting / font-locking
- Multiprocessing (generators, threads)
- Networking
- Packaging
- Pattern matching
- Processes (incl. IPC, RPC)
- Optimization
- Refactoring
- Regular expressions
- Strings
- Testing
- User interface
- Version control
- XML / HTML
Note: Usable Emacs Lisp code snippets (not examples) are tangled to the file epdh.el, which may be found in the repository. You could even install the file as a package with quelpa-use-package, like this:
(use-package epdh
:quelpa (epdh :fetcher github :repo "alphapapa/emacs-package-dev-handbook"))Tools to aid demonstrating use of Emacs.
Tools to record screencasts of Emacs.
Most Emacs screencasts are done by first recording a video, then converting it to a GIF. It seems like a waste of resources considering the little animation Emacs features.
Most of the time, one user action equals one visual change. By exploiting this fact, this package tailors GIF-screencasting for Emacs and captures one frame per user action. It’s much more efficient than capturing frames even at a frequency as low as 10 per second. You could roughly expect 3 to 10 times smaller files compared to videos of the same quality. (Benchmarks are welcome.)
Another neat perk of action-based captures is that it produces editable GIF files: programs such as Gifsicle or The GIMP can be used to edit the delays or rearrange frames. This is particularly useful to fix mistakes in “post-processing”, without having to record the demo all over again.
The author of this document can vouch for the fact that this package is the easiest, most powerful way to make screencast animations in Emacs!
While emacs-gif-screencast should usually be your first choice, the way it works, recording one frame per Emacs command, isn’t suitable for every case. For general use, your editor can recommend Bashcaster, which is an easy-to-use script that can record the whole screen or individual windows, to videos or GIFs.
See Multiprocessing (generators, threads).
Auditing, reviewing, and analyzing source code.
Comb is a native Emacs Lisp solution to search, browse and annotate occurrences of regular expressions in files. The interactive interface allows to perform an exhaustive classification of all the results to rule out false positives and asses proper matches during manual static analysis.
Information related to variable scope and binding in elisp code (e.g. lexical vs. dynamic scope).
:archive.today: http://archive.today/T8dHMChris Wellons explains how the old cl macro flet changes in its new cl-lib version, cl-flet, and how to use cl-letf to achieve the old functionality. It’s a way to override functions in both lexical and dynamic scope, which is especially useful for unit testing.
Thunk provides functions and macros to delay the evaluation of forms.
Use
thunk-delayto delay the evaluation of a form (requires lexical-binding), andthunk-forceto evaluate it. The result of the evaluation is cached, and only happens once.Here is an example of a form which evaluation is delayed:
(setq delayed (thunk-delay (message "this message is delayed")))
delayedis not evaluated untilthunk-forceis called, like the following:
(thunk-force delayed)This file also defines macros
thunk-letandthunk-let*that are analogous toletandlet*but provide lazy evaluation of bindings by using thunks implicitly (i.e. in the expansion).
It’s much faster to use buffer-local-value than with-current-buffer to access the value of a variable in a buffer.
(bench-multi :times 1000 :ensure-equal t
:forms (("buffer-local-value" (--filter (equal 'magit-status-mode (buffer-local-value 'major-mode it))
(buffer-list)))
("with-current-buffer" (--filter (equal 'magit-status-mode (with-current-buffer it
major-mode))
(buffer-list)))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| buffer-local-value | 50.34 | 0.047657734 | 0 | 0.0 |
| with-current-buffer | slowest | 2.399323452 | 0 | 0.0 |
Inserting strings into buffers with insert is generally fast, but it can slow down in buffers with lots of markers or overlays. In general, it can be faster to insert one large string (which may include newlines). For example:
(let ((strings (cl-loop for i from 1 to 1000
collect (number-to-string i))))
(garbage-collect)
(--sort (< (caddr it) (caddr other))
(cl-loop for times in '(1 10 100)
append (a-list "(loop do (insert ..."
(cons times
(benchmark-run-compiled times
(with-temp-buffer
(cl-loop for string in strings
do (insert string)))))
"(apply #'insert ..."
(cons times
(benchmark-run-compiled times
(with-temp-buffer
(apply #'insert strings))))
"(insert (apply #'concat ..."
(cons times
(benchmark-run-compiled times
(with-temp-buffer
(insert (apply #'concat strings)))))))))#+RESULTS[aa866ca87dbf71476c735ed51fca7373934bbf4f]:
| (insert (apply #’concat … | 100 | 0.000142085 | 0 | 0.0 |
| (insert (apply #’concat … | 10 | 0.000161172 | 0 | 0.0 |
| (insert (apply #’concat … | 1 | 0.00018764 | 0 | 0.0 |
| (apply #’insert … | 10 | 0.000665472 | 0 | 0.0 |
| (apply #’insert … | 100 | 0.000678471 | 0 | 0.0 |
| (apply #’insert … | 1 | 0.000755329 | 0 | 0.0 |
| (loop do (insert … | 10 | 0.000817031 | 0 | 0.0 |
| (loop do (insert … | 100 | 0.000869779 | 0 | 0.0 |
| (loop do (insert … | 1 | 0.001490397 | 0 | 0.0 |
The fastest method here is to call insert once with the result of calling concat once, using apply to pass all of the strings. With 100 iterations, it’s about 6x faster than the next-fastest method, and even with 1 iteration, it’s over 2x faster.
BUI (Buffer User Interface) is an Emacs library that can be used to make user interfaces to display some kind of entries (like packages, buffers, functions, etc.). The intention of BUI is to be a high-level library which is convenient to be used both by:
package makers, as there is no need to bother about implementing routine details and usual features (like buffer history, filtering displayed entries, etc.);
users, as it provides familiar and intuitive interfaces with usual keys (for moving by lines, marking, sorting, switching between buttons); and what is also important, the defined interfaces are highly configurable through various generated variables.
Includes the following validators:
- byte-compile
- check-declare
- checkdoc
- fill-column
- indent
- indent-character
- package-format
- trailing-whitespace
This library provides a
flycheckchecker for the metadata in Emacs Lisp files which are intended to be packages. That metadata includes the package description, its dependencies and more. The checks are performed by the separatepackage-lintlibrary.
Relint scans elisp files for mistakes in regexps, including deprecated syntax and bad practice. It also checks the regexp-like arguments to
skip-chars-forward,skip-chars-backward,skip-syntax-forwardandskip-syntax-backward.
Here are some examples of fast ways to collect items into a list.
(bench-multi-lexical :times 500000 :ensure-equal t
:forms (("cl-loop" (let ((l '(1 2 3 4)))
(cl-loop for val in l
collect val)))
("push-nreverse with setf/pop" (let ((l '(1 2 3 4))
val r)
(while (setf val (pop l))
(push val r))
(nreverse r)))
("push-nreverse with when-let*/pop" (let ((l '(1 2 3 4))
r)
(while (when-let* ((val (pop l)))
(push val r)))
(nreverse r)))
("nconc with when-let*/pop" (let ((l '(1 2 3 4))
r)
(while (when-let* ((val (pop l)))
(setf r (nconc r (list val)))))
r))
("nconc with setf/pop" (let ((l '(1 2 3 4))
val r)
(while (setf val (pop l))
(setf r (nconc r (list val))))
r))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| cl-loop | 1.01 | 0.154578 | 0 | 0 |
| push-nreverse with setf/pop | 1.02 | 0.155930 | 0 | 0 |
| push-nreverse with when-let*/pop | 1.23 | 0.159211 | 0 | 0 |
| nconc with setf/pop | 1.06 | 0.195685 | 0 | 0 |
| nconc with when-let*/pop | slowest | 0.207103 | 0 | 0 |
As is usually the case, the cl-loop macro expands to the most efficient code, which uses (setq val (car ..., push, and nreverse:
(cl-block nil
(let* ((--cl-var-- l)
(val nil)
(--cl-var-- nil))
(while (consp --cl-var--)
(setq val (car --cl-var--))
(push val --cl-var--)
(setq --cl-var-- (cdr --cl-var--)))
(nreverse --cl-var--)))However, in some cases cl-loop may expand to code which uses nconc, which, as the benchmark shows, is much slower. In that case, you may write the loop without cl-loop to avoid using nconc.
As expected, seq-difference is the slowest, because it’s a generic function that dispatches based on the types of its arguments, which is relatively slow in Emacs. And it’s not surprising that cl-nset-difference is generally slightly faster than cl-set-difference, since it’s destructive.
However, it is surprising how much faster -difference is than cl-nset-difference.
It’s also nonintuitive that -difference suffers a large performance penalty by binding -compare-fn (the equivalent of the :test argument to cl-set-difference): while one might expect that setting it to string= would give a slight performance increase, it’s actually faster to let -difference use its default, equal.
Note that since this benchmark compares lists of strings, cl-nset-difference requires setting the :test argument, since it uses eql by default, which does not work for comparing strings.
(defmacro test/set-lists ()
`(setf list1 (cl-loop for i from 0 below 1000
collect (number-to-string i))
list2 (cl-loop for i from 500 below 1500
collect (number-to-string i))))
(let (list1 list2)
(bench-multi-lexical :times 10 :ensure-equal t
:forms (("-difference"
(progn
(test/set-lists)
(-difference list1 list2)))
("-difference string="
(progn
;; This is much slower because of the way `-contains?'
;; works when `-compare-fn' is non-nil.
(test/set-lists)
(let ((-compare-fn #'string=))
(-difference list1 list2))))
("cl-set-difference equal"
(progn
(test/set-lists)
(cl-set-difference list1 list2 :test #'equal)))
("cl-set-difference string="
(progn
(test/set-lists)
(cl-set-difference list1 list2 :test #'string=)))
("cl-nset-difference equal"
(progn
(test/set-lists)
(cl-nset-difference list1 list2 :test #'equal)))
("cl-nset-difference string="
(progn
(test/set-lists)
(cl-nset-difference list1 list2 :test #'string=)))
("seq-difference"
(progn
(test/set-lists)
(seq-difference list1 list2)))
("seq-difference string="
(progn
(test/set-lists)
(seq-difference list1 list2 #'string=))))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| -difference | 7.16 | 0.084484 | 0 | 0 |
| cl-nset-difference equal | 1.05 | 0.605193 | 0 | 0 |
| cl-set-difference string= | 1.01 | 0.636973 | 0 | 0 |
| cl-set-difference equal | 1.01 | 0.644919 | 0 | 0 |
| cl-nset-difference string= | 1.19 | 0.650708 | 0 | 0 |
| -difference string= | 1.59 | 0.773919 | 0 | 0 |
| seq-difference | 1.05 | 1.232616 | 0 | 0 |
| seq-difference string= | slowest | 1.293030 | 0 | 0 |
Using -select from dash.el seems to be the fastest way:
(let ((list (cl-loop for i from 1 to 1000
collect i)))
(bench-multi :times 100
:ensure-equal t
:forms (("(-non-nil (--map (when ..." (-non-nil
(--map (when (cl-evenp it) it) list)))
("(delq nil (--map (when ..." (delq nil
(--map (when (cl-evenp it) it) list)))
("cl-loop" (cl-loop for i in list
when (cl-evenp i)
collect i))
("-select" (-select #'cl-evenp list))
("cl-remove-if-not" (cl-remove-if-not #'cl-evenp list))
("seq-filter" (seq-filter #'cl-evenp list)))))#+RESULTS[6b2e97c1ebead84a53fd771684cc3e155e7f6b1e]:
| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| -select | 1.17 | 0.01540391 | 0 | 0.0 |
| cl-loop | 1.05 | 0.01808226 | 0 | 0.0 |
| seq-filter | 1.13 | 0.01891708 | 0 | 0.0 |
| (delq nil (–map (when … | 1.15 | 0.02134727 | 0 | 0.0 |
| cl-remove-if-not | 1.18 | 0.02459478 | 0 | 0.0 |
| (-non-nil (–map (when … | slowest | 0.02903999 | 0 | 0.0 |
There are a few options in Emacs Lisp for looking up values in associative data structures: association lists (alists), property lists (plists), and hash tables. Which one performs best in a situation may depend on several factors. This benchmark shows what may be a common case: looking up values using a string as the key. We compare several combinations, including the case of prepending a prefix to the string, interning it, and looking up the resulting symbol (which might be done, e.g. when looking up a function to call based on the value of a string).
(bench-multi-lets :times 10000 :ensure-equal t
:lets (("with 26 pairs"
((char-range (cons ?A ?Z))
(strings (cl-loop for char from (car char-range) to (cdr char-range)
collect (concat "prefix-" (char-to-string char))))
(strings-alist (cl-loop for string in strings
collect (cons string string)))
(symbols-alist (cl-loop for string in strings
collect (cons (intern string) string)))
(strings-plist (map-into strings-alist 'plist))
(symbols-plist (map-into symbols-alist 'plist))
(strings-ht (map-into strings-alist '(hash-table :test equal)))
(symbols-ht-equal (map-into symbols-alist '(hash-table :test equal)))
(symbols-ht-eq (map-into symbols-alist '(hash-table :test eq)))))
("with 52 pairs"
((char-range (cons ?A ?z))
(strings (cl-loop for char from (car char-range) to (cdr char-range)
collect (concat "prefix-" (char-to-string char))))
(strings-alist (cl-loop for string in strings
collect (cons string string)))
(symbols-alist (cl-loop for string in strings
collect (cons (intern string) string)))
(strings-plist (map-into strings-alist 'plist))
(symbols-plist (map-into symbols-alist 'plist))
(strings-ht (map-into strings-alist '(hash-table :test equal)))
(symbols-ht-equal (map-into symbols-alist '(hash-table :test equal)))
(symbols-ht-eq (map-into symbols-alist '(hash-table :test eq))))))
:forms (("strings/alist-get/string=" (sort (cl-loop for string in strings
collect (alist-get string strings-alist nil nil #'string=))
#'string<))
("strings/plist" (sort (cl-loop for string in strings
collect (plist-get strings-plist string))
#'string<))
("symbols/concat/intern/plist" (sort (cl-loop for char from (car char-range) to (cdr char-range)
for string = (concat "prefix-" (char-to-string char))
for symbol = (intern string)
collect (plist-get symbols-plist symbol))
#'string<))
("strings/alist-get/equal" (sort (cl-loop for string in strings
collect (alist-get string strings-alist nil nil #'equal))
#'string<))
("strings/hash-table/equal" (sort (cl-loop for string in strings
collect (gethash string strings-ht))
#'string<))
("symbols/concat/intern/hash-table/equal" (sort (cl-loop for char from (car char-range) to (cdr char-range)
for string = (concat "prefix-" (char-to-string char))
for symbol = (intern string)
collect (gethash symbol symbols-ht-equal))
#'string<))
("symbols/concat/intern/hash-table/eq" (sort (cl-loop for char from (car char-range) to (cdr char-range)
for string = (concat "prefix-" (char-to-string char))
for symbol = (intern string)
collect (gethash symbol symbols-ht-eq))
#'string<))
("symbols/concat/intern/alist-get" (sort (cl-loop for char from (car char-range) to (cdr char-range)
for string = (concat "prefix-" (char-to-string char))
for symbol = (intern string)
collect (alist-get symbol symbols-alist))
#'string<))
("symbols/concat/intern/alist-get/equal" (sort (cl-loop for char from (car char-range) to (cdr char-range)
for string = (concat "prefix-" (char-to-string char))
for symbol = (intern string)
collect (alist-get symbol symbols-alist nil nil #'equal))
#'string<))))#+RESULTS[041dd7c6644612027379e3558fcf60e61eb4896a]:
| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| with 26 pairs: strings/hash-table/equal | 1.06 | 0.040321 | 0 | 0 |
| with 26 pairs: strings/plist | 2.26 | 0.042848 | 0 | 0 |
| with 52 pairs: strings/hash-table/equal | 1.27 | 0.096877 | 0 | 0 |
| with 26 pairs: strings/alist-get/equal | 1.04 | 0.123039 | 0 | 0 |
| with 26 pairs: strings/alist-get/string= | 1.03 | 0.128221 | 0 | 0 |
| with 52 pairs: strings/plist | 2.62 | 0.131451 | 0 | 0 |
| with 26 pairs: symbols/concat/intern/hash-table/eq | 1.00 | 0.344524 | 1 | 0.266744 |
| with 26 pairs: symbols/concat/intern/hash-table/equal | 1.01 | 0.344951 | 1 | 0.267860 |
| with 26 pairs: symbols/concat/intern/plist | 1.02 | 0.349360 | 1 | 0.266529 |
| with 26 pairs: symbols/concat/intern/alist-get | 1.19 | 0.358071 | 1 | 0.267457 |
| with 26 pairs: symbols/concat/intern/alist-get/equal | 1.11 | 0.424895 | 1 | 0.271568 |
| with 52 pairs: strings/alist-get/equal | 1.03 | 0.471979 | 0 | 0 |
| with 52 pairs: strings/alist-get/string= | 1.50 | 0.485663 | 0 | 0 |
| with 52 pairs: symbols/concat/intern/hash-table/equal | 1.00 | 0.730628 | 2 | 0.547082 |
| with 52 pairs: symbols/concat/intern/hash-table/eq | 1.05 | 0.733726 | 2 | 0.548910 |
| with 52 pairs: symbols/concat/intern/alist-get | 1.00 | 0.773320 | 2 | 0.545707 |
| with 52 pairs: symbols/concat/intern/plist | 1.36 | 0.774225 | 2 | 0.549963 |
| with 52 pairs: symbols/concat/intern/alist-get/equal | slowest | 1.056641 | 2 | 0.545522 |
We see that hash-tables are generally the fastest solution.
Comparing alists and plists, we see that, when using string keys, plists are significantly faster than alists, even with 52 pairs. When using symbol keys, plists are faster with 26 pairs; with 52, plists and alists (using alist-get with eq as the test function) are nearly the same in performance.
Also, perhaps surprisingly, when looking up a string in an alist, using equal as the test function may be faster than using the type-specific string= function (possibly indicating an optimization to be made in Emacs’s C code).
;;;; Built-in methods
(list (cons 'one 1) (cons 'two 2)) ;; => ((one . 1) (two . 2))
'((one . 1) (two . 2)) ;; => ((one . 1) (two . 2))
(let ((numbers (list)))
(map-put numbers 'one 1)
(map-put numbers 'two 2)) ;; => ((two . 2) (one . 1))
;;;; Packages
;; `a-list' from a.el is the best way to make a new alist.
(a-list 'one 1
'two 2) ;; => ((one . 1) (two . 2));;;; Built-in methods
;; `map-put' is the best built-in way. Requires Emacs 25.1+.
(let ((numbers (list (cons 'one 1))))
(map-put numbers 'two 2)
numbers) ; => ((two . 2) (one . 1))
;; More primitive methods
;; Not recommended, but not too complicated:
(let ((numbers (list (cons 'one 1)))
(more-numbers (a-list 'two 2
'three 3)))
(append numbers more-numbers)) ;; => ((one . 1) (two . 2) (three . 3))
;; Don't do it this way, but it does demonstrate list/cons-cell
;; structure:
(let ((numbers (list (cons 'one 1))))
(cons (cons 'three 3)
(cons (cons 'two 2)
numbers))) ;; => ((three . 3) (two . 2) (one . 1));;;; Built-in methods
;; `map-merge': if you're restricted to built-in packages, this works
;; well (requires Emacs 25.1+):
(let ((numbers (list (cons 'one 1)))
(more-numbers (a-list 'two 2
'three 3)))
(map-merge 'list numbers more-numbers)) ;; => ((three . 3) (two . 2) (one . 1))
;; Without map.el, you could use `append':
(let ((numbers (list (cons 'one 1)))
(more-numbers (a-list 'two 2
'three 3)))
(append numbers more-numbers)) ;; => ((one . 1) (two . 2) (three . 3))
;;;; Packages
;; `a-merge' from a.el is probably the best way:
(let ((numbers (list (cons 'one 1)))
(more-numbers (a-list 'two 2
'three 3)))
(a-merge numbers more-numbers)) ;; => ((three . 3) (two . 2) (one . 1))The plist design in Elisp was based on the idea that you shouldn’t distinguish an entry with a nil value from an entry that’s absent. Hence
plist-removeis not needed because you can do(plist-put PLIST PROP nil)instead.Of course, in the mean time,
plist-memberappeared, breaking the design, so this answer is probably not 100% satisfactory, but I still think you’ll generally be better off if you can ignore the difference betweenniland “absent”.
If you do need to remove a key and value from a plist, you could use cl-remf or map-delete (the former probably being faster).
This library provides a consistent and comprehensive set of functions for working with hash tables: they’re named consistently, take a natural and consistent argument order, and cover operations that the standard Emacs functions don’t.
Similar to dash.el, but with slightly different behavior that may be useful, and some unique features. These functions are provided:
make-tconc | list-utils-depth |
tconc-p | list-utils-flat-length |
tconc-list | list-utils-flatten |
tconc | list-utils-alist-or-flat-length |
list-utils-cons-cell-p | list-utils-alist-flatten |
list-utils-cyclic-length | list-utils-insert-before |
list-utils-improper-p | list-utils-insert-after |
list-utils-make-proper-copy | list-utils-insert-before-pos |
list-utils-make-proper-inplace | list-utils-insert-after-pos |
list-utils-make-improper-copy | list-utils-and |
list-utils-make-improper-inplace | list-utils-not |
list-utils-linear-p | list-utils-xor |
list-utils-linear-subseq | list-utils-uniq |
list-utils-cyclic-p | list-utils-dupes |
list-utils-cyclic-subseq | list-utils-singlets |
list-utils-make-linear-copy | list-utils-partition-dupes |
list-utils-make-linear-inplace | list-utils-plist-reverse |
list-utils-safe-length | list-utils-plist-del |
list-utils-safe-equal |
map is included with Emacs, but the latest version, which may include improvements since the last Emacs release, is now available separately on GNU ELPA.
stream.elprovides an implementation of streams, implemented as delayed evaluation of cons cells.Functions defined in seq.el can also take a stream as input.
Streams could be created from any sequential input data:
- sequences, making operation on them lazy
- a set of 2 forms (first and rest), making it easy to represent infinite sequences
- buffers (by character)
- buffers (by line)
- buffers (by page)
- IO streams
- orgmode table cells
- …
This package provides variables which persist across sessions.
The main entry point is `persist-defvar’ which behaves like `defvar’ but which persists the variables between session. Variables are automatically saved when Emacs exits.
Other useful functions are `persist-save’ which saves the variable immediately, `persist-load’ which loads the saved value, `persist-reset’ which resets to the default value.
Values are stored in a directory in `user-emacs-directory’, using one file per value. This makes it easy to delete or remove unused variables.
Includes these functions:
yk-color-adjustyk-color-adjust-rgbyk-color-blendyk-color-blend-rgbyk-color-contrast-ratioyk-color-contrast-ratio-rgbyk-color-from-rgbyk-color-relative-luminanceyk-color-relative-luminance-rgbyk-color-rgb-to-srgbyk-color-srgb-to-rgbyk-color-to-rgb
Individual libraries from this article are listed below.
- heap.el
- myers
- queue.el
- Tagged Non-deterministic Finite state Automata (tNFA.el)
- trie.el
- dict-tree.el
- extmap: Externally-stored constant mapping
A heap is a form of efficient self-sorting tree. In particular, the root node is guaranteed to be the highest-ranked entry in the tree. (The comparison function used for ranking the data can, of course, be freely defined). They are often used as priority queues, for scheduling tasks in order of importance, and for implementing efficient sorting algorithms (such as heap-sort).
This package implements Eugene W. Myers’s “stacks” which are like standard singly-linked lists, except that they also provide efficient lookup. More specifically:
cons/car/cdr are O(1), while (nthcdr N L) is O(min (N, log L))
For details, see “An applicative random-access stack”, Eugene W. Myers, 1983, Information Processing Letters.
A queue can be used both as a first-in last-out and as a first-in first-out stack, i.e. elements can be added to and removed from the front or back of the queue. (This library is an updated re-implementation of the old Elib queue library.)
Features of modern regexp implementations, including Emacs’, mean they can recognise much more than regular languages. This comes with a big downside: matching certain pathological regexps is very time-consuming. (In fact, it’s NP-complete.)
A tagged, non-deterministic finite state automata (NFA) is an abstract computing machine that recognises regular languages. In layman’s terms, they are used to decide whether a string matches a regular expression. The “tagged” part lets the NFA do group-capture: it returns information about which parts of a string matched which subgroup of the regular expression.
Why re-implement regular expression matching when Emacs comes with extensive built-in support for regexps? Primarily, because some algorithms require access to the NFA states produced part way through the regular expression matching process. Secondarily, because Emacs regexps only work on strings, whereas regular expressions can equally well be used to match other Lisp sequence types.
A trie stores data associated with “strings” (not necessarily the string data type; any ordered sequence of elements can be used). It stores them in such a way that both storage size and data lookup are reasonably space- and time- efficient, respectively. But, more importantly, advanced string queries are also very efficient, such as finding all strings with a given prefix, finding approximate matches, finding all strings matching a regular expression, returning results in alphabetical or any other order, returning only the first few results, etc.
The dictionary tree data structures are a hybrid between tries and hash tables. Data is stored in a trie, but results that take particularly long to retrieve are cached in hash tables, which are automatically synchronised with the trie. The dictionary package provides persistent storage of the data structures in files, and many other convenience features.
extmap is a very simple package that lets you build a read-only, constant database that maps Elisp symbols to almost arbitrary Elisp objects. The idea is to avoid preloading all data to memory and only retrieve it when needed. This package doesn’t use any external programs, making it a suitable dependency for smaller libraries.
ts aids in parsing, formatting, and manipulating timestamps.
ts is a date and time library for Emacs. It aims to be more convenient than patterns like
(string-to-number (format-time-string "%Y"))by providing easy accessors, like(ts-year (ts-now)).To improve performance (significantly), formatted date parts are computed lazily rather than when a timestamp object is instantiated, and the computed parts are then cached for later access without recomputing. Behind the scenes, this avoids unnecessary
(string-to-number (format-time-string...calls, which are surprisingly expensive.
Get parts of the current date:
;; When the current date is 2018-12-08 23:09:14 -0600:
(ts-year (ts-now)) ;=> 2018
(ts-month (ts-now)) ;=> 12
(ts-day (ts-now)) ;=> 8
(ts-hour (ts-now)) ;=> 23
(ts-minute (ts-now)) ;=> 9
(ts-second (ts-now)) ;=> 14
(ts-tz-offset (ts-now)) ;=> "-0600"
(ts-dow (ts-now)) ;=> 6
(ts-day-abbr (ts-now)) ;=> "Sat"
(ts-day-name (ts-now)) ;=> "Saturday"
(ts-month-abbr (ts-now)) ;=> "Dec"
(ts-month-name (ts-now)) ;=> "December"
(ts-tz-abbr (ts-now)) ;=> "CST"Increment the current date:
;; By 10 years:
(list :now (ts-format)
:future (ts-format (ts-adjust 'year 10 (ts-now))))
;;=> ( :now "2018-12-15 22:00:34 -0600"
;; :future "2028-12-15 22:00:34 -0600")
;; By 10 years, 2 months, 3 days, 5 hours, and 4 seconds:
(list :now (ts-format)
:future (ts-format
(ts-adjust 'year 10 'month 2 'day 3
'hour 5 'second 4
(ts-now))))
;;=> ( :now "2018-12-15 22:02:31 -0600"
;; :future "2029-02-19 03:02:35 -0600")What day of the week was 2 days ago?
(ts-day-name (ts-dec 'day 2 (ts-now))) ;=> "Thursday"
;; Or, with threading macros:
(thread-last (ts-now) (ts-dec 'day 2) ts-day-name) ;=> "Thursday"
(->> (ts-now) (ts-dec 'day 2) ts-day-name) ;=> "Thursday"Get timestamp for this time last week:
(ts-unix (ts-adjust 'day -7 (ts-now)))
;;=> 1543728398.0
;; To confirm that the difference really is 7 days:
(/ (- (ts-unix (ts-now))
(ts-unix (ts-adjust 'day -7 (ts-now))))
86400)
;;=> 7.000000567521762
;; Or human-friendly as a list:
(ts-human-duration
(ts-difference (ts-now)
(ts-dec 'day 7 (ts-now))))
;;=> (:years 0 :days 7 :hours 0 :minutes 0 :seconds 0)
;; Or as a string:
(ts-human-format-duration
(ts-difference (ts-now)
(ts-dec 'day 7 (ts-now))))
;;=> "7 days"
;; Or confirm by formatting:
(list :now (ts-format)
:last-week (ts-format (ts-dec 'day 7 (ts-now))))
;;=> ( :now "2018-12-08 23:31:37 -0600"
;; :last-week "2018-12-01 23:31:37 -0600")The primary function provided is: (datetime-format SYM-OR-FMT &optional TIME &rest OPTION)
(datetime-format "%Y-%m-%d") ;=> "2018-08-22"
(datetime-format 'atom) ;=> "2018-08-22T18:23:47-05:00"
(datetime-format 'atom "2112-09-03 00:00:00" :timezone "UTC") ;=> "2112-09-03T00:00:00+00:00"There are several other symbols provided besides atom, such as rfc-3339, which formats dates according to that RFC.
Edebug is a built-in stepping debugger in Emacs. It’s thoroughly documented in the elisp manual.
Declaring debug forms for functions and macros that take keyword arguments can be confusing. Here’s a contrived example:
(cl-defmacro make-fn (name docstring &key args bindings body)
(declare (indent defun)
(debug (&define symbolp stringp
&rest [&or [":body" def-form] [keywordp listp]])))
`(defun ,name ,args
,docstring
(let* ,bindings
,body)))
(make-fn my-fn
"This is my function."
:bindings ((one 1)
(two 2))
:body (list one two))Probably should first replace the :bindings part with this, which correctly matches let bindings: (&rest &or symbolp (gate symbolp &optional def-form)).
This macro simplifies print-style debugging by automatically including the names of the containing function and argument forms, rather than requiring the programmer to write format strings manually. If warning-minimum-log-level is not :debug at expansion time, the macro expands to nil, which the byte-compiler eliminates, so in byte-compiled code, the macro has no overhead at runtime when not debugging. In interpreted code, the overhead when not debugging is minimal. When debugging, the expanded form also returns nil so, e.g. it may be used in a conditional in place of nil. The macro is tangled to epdh.el, but it may also be added directly to source files.
For example, when used like:
(eval-and-compile
(setq-local warning-minimum-log-level :debug))
(defun argh (var)
(debug-warn (current-buffer) "This is bad!" (point) var)
var)
(argh 1)This warning would be shown in the *Warnings* buffer:
Debug (argh): (CURRENT-BUFFER):*scratch* This is bad! (POINT):491845 VAR:1
But if warning-minimum-log-level had any other value, and the buffer were recompiled, there would be no output, and none of the arguments to the macro would be evaluated at runtime.
It may even be used in place of comments! For example, instead of:
(if (foo-p thing)
;; It's a foo: frob it.
(frob thing)
;; Not a foo: flub it.
(flub thing))You could write:
(if (foo-p thing)
(progn
(debug-warn "It's a foo: frob it." thing)
(frob thing))
(debug-warn "Not a foo: flub it." thing)
(flub thing));; To make newer versions of `map' load for the `pcase' pattern.
(require 'map)
(cl-defmacro epdh/debug-warn (&rest args)
"Display a debug warning showing the runtime value of ARGS.
The warning automatically includes the name of the containing
function, and it is only displayed if `warning-minimum-log-level'
is `:debug' at expansion time (otherwise the macro expands to nil
and is eliminated by the byte-compiler). When debugging, the
form also returns nil so, e.g. it may be used in a conditional in
place of nil.
Each of ARGS may be a string, which is displayed as-is, or a
symbol, the value of which is displayed prefixed by its name, or
a Lisp form, which is displayed prefixed by its first symbol.
Before the actual ARGS arguments, you can write keyword
arguments, i.e. alternating keywords and values. The following
keywords are supported:
:buffer BUFFER Name of buffer to pass to `display-warning'.
:level LEVEL Level passed to `display-warning', which see.
Default is :debug."
;; TODO: Can we use a compiler macro to handle this more elegantly?
(pcase-let* ((fn-name (when byte-compile-current-buffer
(with-current-buffer byte-compile-current-buffer
;; This is a hack, but a nifty one.
(save-excursion
(beginning-of-defun)
(cl-second (read (current-buffer)))))))
(plist-args (cl-loop while (keywordp (car args))
collect (pop args)
collect (pop args)))
((map (:buffer buffer) (:level level)) plist-args)
(level (or level :debug))
(string (cl-loop for arg in args
concat (pcase arg
((pred stringp) "%S ")
((pred symbolp)
(concat (upcase (symbol-name arg)) ":%S "))
((pred listp)
(concat "(" (upcase (symbol-name (car arg)))
(pcase (length arg)
(1 ")")
(_ "...)"))
":%S "))))))
(when (eq :debug warning-minimum-log-level)
`(let ((fn-name ,(if fn-name
`',fn-name
;; In an interpreted function: use `backtrace-frame' to get the
;; function name (we have to use a little hackery to figure out
;; how far up the frame to look, but this seems to work).
`(cl-loop for frame in (backtrace-frames)
for fn = (cl-second frame)
when (not (or (subrp fn)
(special-form-p fn)
(eq 'backtrace-frames fn)))
return (make-symbol (format "%s [interpreted]" fn))))))
(display-warning fn-name (format ,string ,@args) ,level ,buffer)
nil))))See Pattern matching.
- Tools
- aggressive-indent-mode: minor mode that keeps your code always indented
- beginend.el
- expand-region.el: Increase selected region by semantic units
- helm-navi: Navigate file sections and language keywords using Helm
- iedit: Edit multiple regions simultaneously in a buffer or a region
- lispy: short and sweet LISP editing
- multi-line: multi-line everything from function invocations and definitions to array and map literals in a wide variety of languages
- multiple-cursors.el: Multiple cursors
- smartparens: Minor mode that deals with parens pairs and tries to be smart about it
This package, by Damien Cassou and Matus Goljer, helps navigation by redefining the M-< and M-> keys do, depending on the major-mode.
iedit makes it easy to rename symbols within a function or in a whole buffer. Simply activate iedit-mode with point on a symbol, and it will be highlighted in the chosen scope, and any changes you make to the symbol are made in each highlighted occurrence. It’s like a smart, purposeful version of multiple-cursors.
The editor of this handbook uses iedit with these customizations:
ap/iedit-or-flyspell- Globally bound to C-;. In a
prog-mode-derived buffer, either corrects the last misspelled word withflyspellwhen point is in a comment or string, or activatesiedit-mode. In non-prog-mode-derived buffers, corrects withflyspell.
(defun ap/iedit-or-flyspell ()
"Call `iedit-mode' or correct misspelling with flyspell, depending..."
(interactive)
(if (or iedit-mode
(and (derived-mode-p 'prog-mode)
(not (or (nth 4 (syntax-ppss))
(nth 3 (syntax-ppss))))))
;; prog-mode is active and point is in a comment, string, or
;; already in iedit-mode
(call-interactively #'ap/iedit-mode)
;; Not prog-mode or not in comment or string
(if (not (equal flyspell-previous-command this-command))
;; FIXME: This mostly works, but if there are two words on the
;; same line that are misspelled, it doesn't work quite right
;; when correcting the earlier word after correcting the later
;; one
;; First correction; autocorrect
(call-interactively 'flyspell-auto-correct-previous-word)
;; First correction was not wanted; use popup to choose
(progn
(save-excursion
(undo)) ; This doesn't move point, which I think may be the problem.
(flyspell-region (line-beginning-position) (line-end-position))
(call-interactively 'flyspell-correct-previous-word-generic)))))ap/iedit-mode- Calls
iedit-modewith function-local scope by default, or global scope when called with a universal prefix.
(defun ap/iedit-mode (orig-fn)
"Call `iedit-mode' with function-local scope by default, or global scope if called with a universal prefix."
(interactive)
(pcase current-prefix-arg
('nil (funcall orig-fn '(0)))
('(4) (funcall orig-fn))
(_ (user-error "`ap/iedit-mode' called with prefix: %s" prefix))))
;; Override default `iedit-mode' function with advice.
(advice-add #'iedit-mode :around #'ap/iedit-mode)- Helpful minibuffer message
- Confirms when an
ieditsession has started.
(advice-add 'iedit-mode :after (lambda (&optional ignore)
(when iedit-mode
(minibuffer-message "iedit session started. Press C-; to end."))))multi-line: multi-line everything from function invocations and definitions to array and map literals in a wide variety of languages
- Libraries
- Tools
- chemacs: Emacs profile switcher
- el2markdown: Convert Emacs Lisp comments to MarkDown
- multicolumn: Multiple side-by-side windows support
- lentic: Create views of the same content in two buffers
- suggest.el: discover elisp functions that do what you want
- Byte-compile and load directory
- emacs-lisp-macroreplace
- Tutorials
Common Lisp Extensions (cl-lib)
This is the built-in cl-lib package which implements Common Lisp functions and control structures for Emacs Lisp.
Dash is a powerful general-purpose library that provides many useful functions and macros.
Emacs Lisp is missing loop structures familiar to users of newer languages. This library adds a selection of popular loop structures as well as break and continue.
Less commonly used functions that complement basic APIs, often implemented in C code (like hash-tables and strings), and are not eligible for inclusion in subr.el.
This is a built-in package that provides several useful functions and macros, such as thread-first / last, if-let / when-let, hash-table functions, and string functions. It’s easy to forget about this, since:
Do not document these functions in the lispref. http://lists.gnu.org/archive/html/emacs-devel/2014-01/msg01006.html
This package may be especially helpful for developing in one’s own environment and testing in another, like default Emacs, Spacemacs, etc.
Chemacs is an Emacs profile switcher, it makes it easy to run multiple Emacs configurations side by side. Think of it as a bootloader for Emacs.
Emacs configuration is either kept in a
~/.emacsfile or, more commonly, in a~/.emacs.ddirectory. These paths are hard-coded. If you want to try out someone else’s configuration, or run different distributions like Prelude or Spacemacs, then you either need to swap out~/.emacs.d, or run Emacs with a different$HOMEdirectory set. This last approach is quite common, but has some real drawbacks, since now packages will no longer know where your actual home directory is.All of these makes trying out different Emacs configurations and distributions needlessly cumbersome. Various approaches to solving this have been floated over the years. There’s an Emacs patch around that adds an extra command line option, and various examples of how to add a command line option in userspace from Emacs Lisp.
Chemacs tries to implement this idea in a user-friendly way, taking care of the various edge cases and use cases that come up.
Byte-compile and load all elisp files in DIRECTORY. Interactively, directory defaults to default-directory and asks for confirmation.
;;;###autoload
(defun epdh/byte-compile-and-load-directory (directory)
"Byte-compile and load all elisp files in DIRECTORY.
Interactively, directory defaults to `default-directory' and asks
for confirmation."
(interactive (list default-directory))
(if (or (not (called-interactively-p))
(yes-or-no-p (format "Compile and load all files in %s?" directory)))
;; Not sure if binding `load-path' is necessary.
(let* ((load-path (cons directory load-path))
(files (directory-files directory 't (rx ".el" eos))))
(dolist (file files)
(byte-compile-file file 'load)))))Replace macro form before or after point with its expansion.
;;;###autoload
(defun epdh/emacs-lisp-macroreplace ()
"Replace macro form before or after point with its expansion."
(interactive)
(if-let* ((beg (point))
(end t)
(form (or (ignore-errors
(save-excursion
(prog1 (read (current-buffer))
(setq end (point)))))
(ignore-errors
(forward-sexp -1)
(setq beg (point))
(prog1 (read (current-buffer))
(setq end (point))))))
(expansion (macroexpand-all form)))
(setf (buffer-substring beg end) (pp-to-string expansion))
(user-error "Unable to expand")))Wilfred’s walkthrough is helpful for learning how to study an Elisp function and determine what it does and how. He also shows the use of trace-function.
- Packages
- Tools
- face-explorer: Library and tools for faces and text properties
- faceup: Regression test system for font-lock keywords
- font-lock-profiler: Coverage and timing tool for font-lock keywords
- font-lock-regression-suite: Regression test suite for font-lock keywords of Emacs standard modes
- font-lock-studio: Debugger for Font Lock keywords
- highlight-refontification: Visualize how font-lock refontifies a buffer
Packages that do highlighting/font-locking.
Tools for developing highlighting/font-locking packages.
:archive.today: http://archive.today/IraneChris Wellons explains the new generators and threads that Emacs 26 provides. He also shows an example of writing a cl-case form that uses the new switch jump table opcode in Emacs 26.
aiois to Emacs Lisp as asyncio is to Python. This package builds upon Emacs 25 generators to provide functions that pause while they wait on asynchronous events. They do not block any thread while paused.
For very simple use cases, the built-in url library should be sufficient. But for more complex cases, and for a simpler API and more reliability, it’s generally recommended to use [[*\[\[https://github.com/alphapapa/plz.el\]\[plz.el: HTTP client library\]\]][plz]].
Other libraries, such as request, can also provide improvements over url. However, in this author’s experience, both url and request, while mostly reliable, tend to have some obscure bugs that can occasionally be problematic. plz, while not yet as featureful as request, is intended to be developed into the best all-around client, and is now a mature, reliable library.
Inspired by [[*\[\[https://github.com/skeeto/elfeed/blob/master/elfeed-curl.el\]\[elfeed-curl\]\]][elfeed-curl]] and endorsed by its author, plz supports both synchronous and asynchronous requests. Its API is intended to be simple, natural, and expressive. Its code is intended to be simple and well-organized. Every feature is tested against httpbin. Written by this author, plz is available on GNU ELPA, so it’s installable in Emacs by default.
url is included with Emacs and used by a variety of packages.
request is the most commonly used third-party HTTP library. It has both curl and url.el backends.
Not a standalone package, but part of Elfeed. A solid, well-designed library, but purpose-built for Elfeed. Inspired the development of [[*\[\[https://github.com/alphapapa/plz.el\]\[plz.el: HTTP client library\]\]][plz]].
This may actually be a bug, or at least an unanswered question.
How to use autoload cookies for custom defun-like macros? : emacs:
Say I have a macro
deffoothat expands to some custom kind ofdefun, and I want to use an autoload cookie to autoload the result. According to the manual,;;;###autoload (deffoo bar ...)copies the entire form to
autoloads.el, and something like;;;###autoload (autoload 'bar "this-file") (deffoo bar ...)should be used instead. What confuses me is this StackOverflow comment by who appears to be Stefan Monnier, saying that Emacs should expand the macro before generating the autoload, and that it’s probably a bug when this does not happen.
Can anyone clear up what the intended behaviour is?
[2018-01-15 Mon 03:37] The correct way to do this is documented in this bug report.
:archive.today: http://archive.today/UZHhSSometimes you want your package to integrate with other packages, but you don’t want to require users to install those other packages. For example, you might want your package to work with Helm, Ivy, or the built-in Emacs completing-read, but you don’t want to declare a dependency on and require Helm or Ivy, which would force users to install them to use your package.
The best way to handle this is with the =with-eval-after-load= macro. The Emacs manual has a page on it, and this StackOverflow question has some more info. You can also see an example, which also uses =declare-function= to prevent byte-compiler warnings. Note as well that, according to this StackOverflow comment, when a function call is guarded by fboundp, it’s not necessary to use declare-function to avoid a warning.
You should always use lexical binding by setting the header in the first line of the file:
;;; filename.el --- File description -*- lexical-binding: t; -*-:archive.today: http://archive.today/0nfB4 :archive.today: http://archive.today/LUtfZ
Sebastian Wiesner provides a detailed explanation.
:archive.today: http://archive.today/2VtOUA lot of good examples and discussion.
When you make a new package, the auto-insert command will insert a set of standard package headers for you. However, here is a more comprehensive template you can use:
;;; package-name.el --- Package description (don't include the word "Emacs") -*- lexical-binding: t; -*-
;; Copyright (C) 2017 First Last
;; Author: First Last <name@example.com>
;; URL: https://example.com/package-name.el
;; Version: 0.1-pre
;; Package-Requires: ((emacs "25.2"))
;; Keywords: something
;; This file is not part of GNU Emacs.
;; This program is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with this program. If not, see <http://www.gnu.org/licenses/>.
;;; Commentary:
;; This package allows flanges to be easily frobnicated.
;;;; Installation
;;;;; MELPA
;; If you installed from MELPA, you're done.
;;;;; Manual
;; Install these required packages:
;; + foo
;; + bar
;; Then put this file in your load-path, and put this in your init
;; file:
;; (require 'package-name)
;;;; Usage
;; Run one of these commands:
;; `package-name-command': Frobnicate the flange.
;;;; Tips
;; + You can customize settings in the `package-name' group.
;;;; Credits
;; This package would not have been possible without the following
;; packages: foo[1], which showed me how to bifurcate, and bar[2],
;; which takes care of flanges.
;;
;; [1] https://example.com/foo.el
;; [2] https://example.com/bar.el
;;; Code:
;;;; Requirements
(require 'foo)
(require 'bar)
;;;; Customization
(defgroup package-name nil
"Settings for `package-name'."
:link '(url-link "https://example.com/package-name.el"))
(defcustom package-name-something nil
"This setting does something."
:type 'something)
;;;; Variables
(defvar package-name-var nil
"A variable.")
;;;;; Keymaps
;; This technique makes it easier and less verbose to define keymaps
;; that have many bindings.
(defvar package-name-map
;; This makes it easy and much less verbose to define keys
(let ((map (make-sparse-keymap "package-name map"))
(maps (list
;; Mappings go here, e.g.:
"RET" #'package-name-RET-command
[remap search-forward] #'package-name-search-forward
)))
(cl-loop for (key fn) on maps by #'cddr
do (progn
(when (stringp key)
(setq key (kbd key)))
(define-key map key fn)))
map))
;;;; Commands
;;;###autoload
(defun package-name-command (args)
"Frobnicate the flange."
(interactive)
(package-name-foo
(package-name--bar args)))
;;;; Functions
;;;;; Public
(defun package-name-foo (args)
"Return foo for ARGS."
(foo args))
;;;;; Private
(defun package-name--bar (args)
"Return bar for ARGS."
(bar args))
;;;; Footer
(provide 'package-name)
;;; package-name.el ends hereYou should always include a readme with your project. Typically it will be include most of the commentary section. Here’s a template that goes with the package template above:
#+TITLE: package-name
#+PROPERTY: LOGGING nil
# Note: This readme works with the org-make-toc <https://github.com/alphapapa/org-make-toc> package, which automatically updates the table of contents.
[[https://melpa.org/#/package-name][file:https://melpa.org/packages/package-name-badge.svg]] [[https://stable.melpa.org/#/package-name][file:https://stable.melpa.org/packages/package-name-badge.svg]]
This is my package. It is nice. You should try it.
* Screenshots
This screenshot shows how to frobnicate the fripulator:
[[screenshot1.png]]
* Contents :noexport:
:PROPERTIES:
:TOC: :include siblings
:END:
:CONTENTS:
:END:
* Installation
:PROPERTIES:
:TOC: :depth 0
:END:
** MELPA
If you installed from MELPA, you're done. Just run one of the commands below.
** Manual
Install these required packages:
+ =foo=
+ =bar=
Then put this file in your load-path, and put this in your init file:
#+BEGIN_SRC elisp
(require 'package-name)
#+END_SRC
* Usage
:PROPERTIES:
:TOC: :depth 0
:END:
Run one of these commands:
+ =package-name-command=: Frobnicate the flange.
** Tips
+ You can customize settings in the =package-name= group.
* Changelog
:PROPERTIES:
:TOC: :depth 0
:END:
** 1.1.0
*Additions*
+ Add command =package-name-debarnacle= to de-barnacle the hull.
*Changes*
+ Command =package-name-anchor= now takes an argument, =weigh= or =let-go=.
*Internal*
+ Rewrote input parsing.
+ Factored out anchor-weighing.
** 1.0.1
*Fixes*
+ Ensure anchor is secure before returning from =package-name-anchor=.
** 1.0.0
Initial release.
* Credits
This package would not have been possible without the following packages: [[https://example.com/foo.el][foo]] which showed me how to bifurcate, and [[https://example.com/bar.el][bar]], which takes care of flanges.
* Development
Bug reports, feature requests, suggestions — /oh my/!
* License
GPLv3
# Local Variables:
# eval: (require 'org-make-toc)
# before-save-hook: org-make-toc
# org-export-with-properties: ()
# org-export-with-title: t
# End:
Version numbers which are valid in Emacs are those accepted by the function version-to-list, which uses the variables version-separator and version-regexp-alist. See their documentation for specific, up-to-date information. version-to-list’s documentation (as of Emacs 26.1) is reproduced here for convenience:
The version syntax is given by the following EBNF: VERSION ::= NUMBER ( SEPARATOR NUMBER )*. NUMBER ::= (0|1|2|3|4|5|6|7|8|9)+. SEPARATOR ::= ‘version-separator’ (which see) | ‘version-regexp-alist’ (which see). The NUMBER part is optional if SEPARATOR is a match for an element in ‘version-regexp-alist’. Examples of valid version syntax: 1.0pre2 1.0.7.5 22.8beta3 0.9alpha1 6.9.30Beta 2.4.snapshot .5 Examples of invalid version syntax: 1.0prepre2 1.0..7.5 22.8X3 alpha3.2 Examples of version conversion: Version String Version as a List of Integers ".5" (0 5) "0.9 alpha" (0 9 -3) "0.9AlphA1" (0 9 -3 1) "0.9snapshot" (0 9 -4) "1.0-git" (1 0 -4) "1.0.7.5" (1 0 7 5) "1.0.cvs" (1 0 -4) "1.0PRE2" (1 0 -1 2) "1.0pre2" (1 0 -1 2) "22.8 Beta3" (22 8 -2 3) "22.8beta3" (22 8 -2 3)
This library includes functions helpful for working with and verifying the format of Emacs Lisp package files, including headers, commentary, etc. It’s easy to overlook and hard to re-discover this package because of its lm symbol prefix. It’s listed here because your editor keeps forgetting what it’s called.
The Emacs manual gives this example (I’ve added the lexical-binding part). Also see template.
;;; superfrobnicator.el --- Frobnicate and bifurcate flanges -*- lexical-binding: t; -*- ;; Copyright (C) 2011 Free Software Foundation, Inc. ;; Author: J. R. Hacker <jrh@example.com> ;; Version: 1.3 ;; Package-Requires: ((flange "1.0")) ;; Keywords: multimedia, frobnicate ;; URL: http://example.com/jrhacker/superfrobnicate ... ;;; Commentary: ;; This package provides a minor mode to frobnicate and/or ;; bifurcate any flanges you desire. To activate it, just type ... ;;;###autoload (define-minor-mode superfrobnicator-mode ...
- Building / Testing
- cask: Project management tool for Emacs
- Eask: CLI for building, running, testing, and managing dependencies
- eldev: Elisp Development Tool
- emacs-package-checker: Check Emacs Lisp packages in a clean environment
- emake.el: Test Elisp without the hoops
- makel: A makefile to facilitate checking Emacs packages
- makem.sh: Makefile-like script for building and testing packages
- Package installation/management
- straight.el: Next-generation, purely functional package manager for the Emacs hacker
- use-package: A use-package declaration for simplifying your .emacs
- paradox: modernizing Emacs’ Package Menu. With package ratings, usage statistics, customizability, and more.
- el-get: Manage the external elisp bits and pieces upon which you depend!
Tools for building and testing packages, especially from scripts or Makefiles.
Cask is a project management tool for Emacs that helps automate the package development cycle; development, dependencies, testing, building, packaging and more.
Eask was built to use as a package development tool in Elisp packages. It can be used in three major ways:
- Dev tool for Elisp packages
- Dependency management for your configuration
- Run Elisp programs for all other purposes
Eask aims to be:
- Consistent enough to sandbox across all systems
- General enough to have Emacsers’ frequently used commands (byte-compile, checkdoc, etc)
- Robust enough to provide useful results even in the presence of user errors
- Dependency-free so that the tool can be run on any platform
See Why Eask? for more detailed information.
Note that although Eask is implemented in JavaScript and Node.js, it is also distributed as an all-in-one binary that doesn’t require Node.js to be installed.
Eldev (Elisp Development Tool) is an Emacs-based build tool, targeted solely at Elisp projects. It is an alternative to Cask. Unlike Cask, Eldev itself is fully written in Elisp and its configuration files are also Elisp programs. If you are familiar with Java world, Cask can be seen as a parallel to Maven — it uses project description, while Eldev is sort of a parallel to Gradle — its configuration is a program on its own.
Emacs Package Checker lets you quickly configure typical linters (i.e. package-lint, byte-compile, and checkdoc) for your Emacs package.
There are existing solutions in this field like emake.el and makel. Emacs Package Checker is not any more capable than those existing solutions, but it is based on Nix package manager and runs tests in a pure, sandboxed environment. This is useful for testing Emacs packages on local machines.
Test Elisp with services like Travis CI without the fuss of Cask – just you, your project, and (Emacs-)Make.
Things EMake does:
- parses, installs, and runs tests for your package
- provides all the power of Elisp to extend its capabilities on-demand
Things EMake will never do (or ‘reasons you may still need Cask’):
- manage your development environment or provide tools to do so
- provide ’bundler-like’ exec abilities (this includes Cask’s emacs and eval commands)
makel is a project consisting of a Makefile (
makel.mk) that Emacs package authors can use to facilitate quality checking (linting and tests). The Makefile can be used both locally on the developer machine and remotely on a continuous integration machine.
makem.sh is a script helps to build, lint, and test Emacs Lisp packages. It aims to make linting and testing as simple as possible without requiring per-package configuration.
It works similarly to a Makefile in that “rules” are called to perform actions such as byte-compiling, linting, testing, etc.
Source and test files are discovered automatically from the project’s Git repo, and package dependencies within them are parsed automatically.
Output is simple: by default, there is no output unless errors occur. With increasing verbosity levels, more detail gives positive feedback. Output is colored by default to make reading easy.
The script can run Emacs with the developer’s local Emacs configuration, or with a clean, “sandbox” configuration that can be optionally removed afterward. This is especially helpful when upstream dependencies may have released new versions that differ from those installed in the developer’s personal configuration.
- State “TODO” from [2018-07-29 Sun 13:11]
- State “TODO” from [2018-07-29 Sun 13:11]
Developed by the current maintainer of Emacs, himself, John Wiegley.
paradox: modernizing Emacs’ Package Menu. With package ratings, usage statistics, customizability, and more.
:archive.today: http://archive.today/vmITXPattern matching is invaluable in elisp. Lists are ubiquitous, and a small amount of pattern matching can often replace a ton of verbose list fiddling.
Since this is Lisp, we have lots of choices! In this post, we’ll compare cl.el, pcase.el, dash.el, and shadchen, so you can choose the best fit for your project. We’ll look at the most common use cases, and end with some recommendations.
For the sake of this post, we’ll consider both pattern matching and destructuring, as they’re closely related concepts.
John Kitchin demonstrates some macros that make it easy to access plist values.
Dash is a powerful library, and one of its features is powerful destructuring with its -let macro, and several others that work the same way.
pcase is built-in to Emacs. Its syntax can be confusing, but it is very powerful.
This tutorial by John Wiegley is a great introduction to pcase.
There are lots of examples here.
Nic Ferrier, Using Polymorphism as a Lisp refactoring tool
[2018-07-27 Fri 23:29] Dash has new abilities, including -setq, and destructuring plists with implied variable names (i.e. just the keys can be specified, reducing repetition).
This example shows the use of pcase-let* to destructure and bind a nested alist:
(let ((alphabets (a-list 'English (a-list 'first "a"
'second "b")
'Greek (a-list 'first "α"
'second "β"))))
(pcase-let* (((map English) alphabets)
((map ('first letter) second) English))
(list letter second))) ;; => ("a" "b")A powerful, Racket-style pattern-matching library.
let-alist is the best thing to happen to associative lists since the invention of the cons cell. This little macro lets you easily access the contents of an alist, concisely and efficiently, without having to specify them preemptively. It comes built-in with 25.1, and is also available on GNU Elpa for older Emacsen.
(defun sx-question-list--print-info (question-data)
"DOC"
(let-alist question-data
(list
question-data
(vector
(int-to-string .score)
(int-to-string .answer_count)
.title " "
.owner.display_name
.last_activity_date sx-question-list-ago-string
" " .tags))))Here Artur introduces the macro and gives examples.
Courtesy of John Kitchin:[fn:1:Copyright by John Kitchin, licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.]
(defmacro with-dict (key-vals &rest body)
"A context-manager for a plist where each key is a callable
function that returns the value."
(declare (indent 1))
(let* ((g (if (symbolp key-vals)
(symbol-value key-vals)
key-vals))
(keys (-slice g 0 nil 2)))
`(labels ,(loop for key in keys
collect
(list key '() `(plist-get ',g ,key)))
,@body)))
;; Used as:
(with-dict (:a 1 :b 'some-symbol :c 3)
(:b))
(let ((d '(:key1 1 :key2 some-other-symbol :key3 3)))
(with-dict d
(format "We got %s" (:key2))))And:
(defmacro with-plist-vals (plist &rest body)
"Bind the values of a plist to variables with the name of the keys."
(declare (indent 1))
`(let ,(loop for key in (-slice plist 0 nil 2)
for val in (-slice plist 1 nil 2)
collect (list (intern
(substring (symbol-name key) 1))
val))
,@body))
;; Used like:
(with-plist-vals (:a 4 :b 6)
(* 2 a))Including inter-process communication (IPC) and remote procedure calls (RPC).
D-Bus is an IPC system which is ubiquitous on Linux, and (in this author’s opinion) not very good. Emacs has bindings for interfacing with it (see the former point), which are annoying to use (see the latter point).
These days, numerous common system management tasks are implemented as D-Bus services rather than tradidional *nix commands, and many of the command-line tools themselves are now front-ends which communicate via D-Bus. Mounting and unmounting disks, monitoring battery status, controlling display brightness, connecting to wireless networks and more are now handled with D-Bus services.
It makes no sense to shell out to the tools when one could interact with them directly via D-Bus, if only it was less annoying to do so.
Debase frees you from writing repetitive, annoying boilerplate code to drive D-Bus services by throwing another pile of abstraction at the problem, in the form of unreadably dense, macro-heavy, profoundly cursed Lisp.
Including benchmarking, byte-compilation, profiling, etc.
- Efficient Alias of a Built-In Emacs Lisp Function « null program
- Emacs Byte-code Internals
- Faster Elfeed Search Through JIT Byte-code Compilation
- How to Write Fast(er) Emacs Lisp « null program
- Some Performance Advantages of Lexical Scope « null program
- What’s in an Emacs Lambda « null program
Chris Wellons compares the use of defalias and defsubst and how they are optimized by the byte-compiler.
Byte-code compilation is an underdocumented — and in the case of the recent lexical binding updates, undocumented — part of Emacs. Most users know that Elisp is usually compiled into a byte-code saved to
.elcfiles, and that byte-code loads and runs faster than uncompiled Elisp. That’s all users really need to know, and the GNU Emacs Lisp Reference Manual specifically discourages poking around too much.People do not write byte-code; that job is left to the byte compiler. But we provide a disassembler to satisfy a cat-like curiosity.
Screw that! What if I want to handcraft some byte-code myself? :-) The purpose of this article is to introduce the internals of Elisp byte-code interpreter. I will explain how it works, why lexically scoped code is faster, and demonstrate writing some byte-code by hand.
Chris Wellons shows how he substantially improved Elfeed’s search by byte-compiling functions at runtime and avoiding function call overhead. He also demonstrates some simple benchmarking tools he wrote in the process.
:archive.today: http://archive.today/xe0JsChris Wellons explains five ways to write faster Emacs Lisp code.
:archive.today: http://archive.today/xm5zq:archive.today: http://archive.today/ppIuJI recently had a discussion with Xah Lee about lexical scope in Emacs Lisp. The topic was why lexical-binding exists at a file-level when there was already lexical-let (from cl-lib), prompted by my previous article on JIT byte-code compilation. The specific context is Emacs Lisp, but these concepts apply to language design in general.
Chris explains how lambdas work with regard to byte-compilation and lexical binding.
Rocky Bernstein’s project to document the Elisp bytecode format (aka LAP, or Lisp Assembly Program).
From Phil Lord’s m-buffer-el:
;;;###autoload
(cl-defmacro bench (&optional (times 100000) &rest body)
"Call `benchmark-run-compiled' on BODY with TIMES iterations, returning list suitable for Org source block evaluation.
Garbage is collected before calling `benchmark-run-compiled' to
avoid counting existing garbage which needs collection."
(declare (indent defun))
`(progn
(garbage-collect)
(list '("Total runtime" "# of GCs" "Total GC runtime")
'hline
(benchmark-run-compiled ,times
(progn
,@body)))))Used like this:
(bench 1000000
(cons 'time (current-time)))When called from an Org source block, it gives output like this:
| Total runtime | # of GCs | Total GC runtime |
|---|---|---|
| 1.657838266 | 3 | 1.4723854609999876 |
These macros make comparing multiple forms easy:
;;;###autoload
(cl-defmacro bench-multi (&key (times 1) forms ensure-equal raw)
"Return Org table as a list with benchmark results for FORMS.
Runs FORMS with `benchmark-run-compiled' for TIMES iterations.
When ENSURE-EQUAL is non-nil, the results of FORMS are compared,
and an error is raised if they aren't `equal'. If the results are
sequences, the difference between them is shown with
`seq-difference'.
When RAW is non-nil, the raw results from
`benchmark-run-compiled' are returned instead of an Org table
list.
If the first element of a form is a string, it's used as the
form's description in the bench-multi-results; otherwise, forms
are numbered from 0.
Before each form is run, `garbage-collect' is called."
;; MAYBE: Since `bench-multi-lexical' byte-compiles the file, I'm not sure if
;; `benchmark-run-compiled' is necessary over `benchmark-run', or if it matters.
(declare (indent defun))
(let*((keys (gensym "keys"))
(result-times (gensym "result-times"))
(header '(("Form" "x fastest" "Total runtime" "# of GCs" "Total GC runtime")
hline))
;; Copy forms so that a subsequent call of the macro will get the original forms.
(forms (cl-copy-list forms))
(descriptions (cl-loop for form in forms
for i from 0
collect (if (stringp (car form))
(prog1 (car form)
(setf (nth i forms) (cadr (nth i forms))))
i))))
`(unwind-protect
(progn
(defvar bench-multi-results nil)
(let* ((bench-multi-results (make-hash-table))
(,result-times (sort (list ,@(cl-loop for form in forms
for i from 0
for description = (nth i descriptions)
collect `(progn
(garbage-collect)
(cons ,description
(benchmark-run-compiled ,times
,(if ensure-equal
`(puthash ,description ,form bench-multi-results)
form))))))
(lambda (a b)
(< (second a) (second b))))))
,(when ensure-equal
`(cl-loop with ,keys = (hash-table-keys bench-multi-results)
for i from 0 to (- (length ,keys) 2)
unless (equal (gethash (nth i ,keys) bench-multi-results)
(gethash (nth (1+ i) ,keys) bench-multi-results))
do (if (sequencep (gethash (car (hash-table-keys bench-multi-results)) bench-multi-results))
(let* ((k1) (k2)
;; If the difference in one order is nil, try in other order.
(difference (or (setq k1 (nth i ,keys)
k2 (nth (1+ i) ,keys)
difference (seq-difference (gethash k1 bench-multi-results)
(gethash k2 bench-multi-results)))
(setq k1 (nth (1+ i) ,keys)
k2 (nth i ,keys)
difference (seq-difference (gethash k1 bench-multi-results)
(gethash k2 bench-multi-results))))))
(user-error "Forms' bench-multi-results not equal: difference (%s - %s): %S"
k1 k2 difference))
;; Not a sequence
(user-error "Forms' bench-multi-results not equal: %s:%S %s:%S"
(nth i ,keys) (nth (1+ i) ,keys)
(gethash (nth i ,keys) bench-multi-results)
(gethash (nth (1+ i) ,keys) bench-multi-results)))))
;; Add factors to times and return table
(if ,raw
,result-times
(append ',header
(bench-multi-process-results ,result-times)))))
(unintern 'bench-multi-results nil))))
(defun bench-multi-process-results (results)
"Return sorted RESULTS with factors added."
(setq results (sort results (-on #'< #'second)))
(cl-loop with length = (length results)
for i from 0 below length
for description = (car (nth i results))
for factor = (pcase i
(0 "fastest")
(_ (format "%.2f" (/ (second (nth i results))
(second (nth 0 results))))))
collect (append (list description factor)
(list (format "%.6f" (second (nth i results)))
(third (nth i results))
(if (> (fourth (nth i results)) 0)
(format "%.6f" (fourth (nth i results)))
0)))))Used like:
(bench-multi
:forms (("org-map-entries" (sort (org-map-entries (lambda ()
(nth 4 (org-heading-components)))
"/+MAYBE" 'agenda)
#'string<))
("regexp" (sort (-flatten
(-non-nil
(mapcar (lambda (file)
(let ((case-fold-search t))
(with-current-buffer (find-buffer-visiting file)
(org-with-wide-buffer
(goto-char (point-min))
(cl-loop with regexp = (format org-heading-keyword-regexp-format "MAYBE")
while (re-search-forward regexp nil t)
collect (nth 4 (org-heading-components)))))))
(org-agenda-files))))
#'string<))))#+RESULTS[3316dc4375a3b162e32790bb7e72d715d7f756fb]:
| Form | x fastest | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| regexp | fastest | 0.022259 | 0 | 0 |
| org-map-entries | 168.03 | 3.740340 | 0 | 0 |
It can also help catch bugs by ensuring that each form returns the same results. For example, the benchmark above contains a subtle bug: because case-fold-search in the regexp form is non-nil, the regexp is compared case-insensitively, so it matches Org headings which start with Maybe rather than only ones which start with MAYBE. Using the :ensure-equal t argument to bench-multi compares the results and raises an error showing the difference between the two sequences the forms evaluate to:
(bench-multi :ensure-equal t
:forms (("org-map-entries" (sort (org-map-entries (lambda ()
(nth 4 (org-heading-components)))
"/+MAYBE" 'agenda)
#'string<))
("regexp" (sort (-flatten
(-non-nil
(mapcar (lambda (file)
(let ((case-fold-search t))
(with-current-buffer (find-buffer-visiting file)
(org-with-wide-buffer
(goto-char (point-min))
(cl-loop with regexp = (format org-heading-keyword-regexp-format "MAYBE")
while (re-search-forward regexp nil t)
collect (nth 4 (org-heading-components)))))))
(org-agenda-files))))
#'string<))))user-error: Forms’ results not equal: difference (regexp - org-map-entries): ("Maybe this is not the case?")
Fixing the error, by setting case-fold-search to nil, not only makes the forms give the same result but, in this case, doubles the performance of the faster form:
(bench-multi :ensure-equal t
:forms (("org-map-entries" (sort (org-map-entries (lambda ()
(nth 4 (org-heading-components)))
"/+MAYBE" 'agenda)
#'string<))
("regexp" (sort (-flatten
(-non-nil
(mapcar (lambda (file)
(let ((case-fold-search nil))
(with-current-buffer (find-buffer-visiting file)
(org-with-wide-buffer
(goto-char (point-min))
(cl-loop with regexp = (format org-heading-keyword-regexp-format "MAYBE")
while (re-search-forward regexp nil t)
collect (nth 4 (org-heading-components)))))))
(org-agenda-files))))
#'string<))))#+RESULTS[773b94ff27f73dcfcb694429054710a581b7bec5]:
| Form | x fastest | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| regexp | fastest | 0.011578 | 0 | 0 |
| org-map-entries | 313.65 | 3.631561 | 0 | 0 |
So this macro showed which code is faster and helped catch a subtle bug.
To evaluate forms with lexical binding enabled, use this macro:
;;;###autoload
(cl-defmacro bench-multi-lexical (&key (times 1) forms ensure-equal raw)
"Return Org table as a list with benchmark results for FORMS.
Runs FORMS from a byte-compiled temp file with `lexical-binding'
enabled, using `bench-multi', which see.
Afterward, the temp file is deleted and the function used to run
the benchmark is uninterned."
(declare (indent defun))
`(let* ((temp-file (concat (make-temp-file "bench-multi-lexical-") ".el"))
(fn (gensym "bench-multi-lexical-run-")))
(with-temp-file temp-file
(insert ";; -*- lexical-binding: t; -*-" "\n\n"
"(defvar bench-multi-results)" "\n\n"
(format "(defun %s () (bench-multi :times %d :ensure-equal %s :raw %s :forms %S))"
fn ,times ,ensure-equal ,raw ',forms)))
(unwind-protect
(if (byte-compile-file temp-file 'load)
(funcall (intern (symbol-name fn)))
(user-error "Error byte-compiling and loading temp file"))
(delete-file temp-file)
(unintern (symbol-name fn) nil))))Used just like bench-multi:
(bench-multi-lexical :ensure-equal t
:forms (("org-map-entries" (sort (org-map-entries (lambda ()
(nth 4 (org-heading-components)))
"/+MAYBE" 'agenda)
#'string<))
("regexp" (sort (-flatten
(-non-nil
(mapcar (lambda (file)
(let ((case-fold-search nil))
(with-current-buffer (find-buffer-visiting file)
(org-with-wide-buffer
(goto-char (point-min))
(cl-loop with regexp = (format org-heading-keyword-regexp-format "MAYBE")
while (re-search-forward regexp nil t)
collect (nth 4 (org-heading-components)))))))
(org-agenda-files))))
#'string<))))#+RESULTS[a8ffc10fa4e21eb632122657312040f139b33204]:
| Form | x fastest | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| regexp | fastest | 0.011641 | 0 | 0 |
| org-map-entries | 312.46 | 3.637256 | 0 | 0 |
This macro compares dynamic and lexical binding.
;;;###autoload
(cl-defmacro bench-dynamic-vs-lexical-binding (&key (times 1) forms ensure-equal)
"Benchmark FORMS with both dynamic and lexical binding.
Calls `bench-multi' and `bench-multi-lexical', which see."
(declare (indent defun))
`(let ((dynamic (bench-multi :times ,times :ensure-equal ,ensure-equal :raw t
:forms ,forms))
(lexical (bench-multi-lexical :times ,times :ensure-equal ,ensure-equal :raw t
:forms ,forms))
(header '("Form" "x fastest" "Total runtime" "# of GCs" "Total GC runtime")))
(cl-loop for result in-ref dynamic
do (setf (car result) (format "Dynamic: %s" (car result))))
(cl-loop for result in-ref lexical
do (setf (car result) (format "Lexical: %s" (car result))))
(append (list header)
(list 'hline)
(bench-multi-process-results (append dynamic lexical)))))Example:
(bench-dynamic-vs-lexical-binding :times 1000 :ensure-equal t
:forms (("buffer-local-value" (--filter (equal 'magit-status-mode (buffer-local-value 'major-mode it))
(buffer-list)))
("with-current-buffer" (--filter (equal 'magit-status-mode (with-current-buffer it
major-mode))
(buffer-list)))))#+RESULTS[73cc92a5949dd2d48f029cab9557eb6132bdf1cf]:
| Form | x fastest | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| Lexical: buffer-local-value | fastest | 0.039616 | 0 | 0 |
| Dynamic: buffer-local-value | 1.18 | 0.046844 | 0 | 0 |
| Dynamic: with-current-buffer | 82.07 | 3.251161 | 0 | 0 |
| Lexical: with-current-buffer | 82.30 | 3.260561 | 0 | 0 |
The buffer-local-value form improved by about 24% when using lexical binding, but the with-current-buffer form performs the same regardless of using lexical binding.
This macro benchmarks multiple forms in multiple environments, which is helpful for testing code that behaves differently depending on global variables.
;;;###autoload
(cl-defmacro bench-multi-lets (&key (times 1) lets forms ensure-equal)
"Benchmark FORMS in each of lexical environments defined in LETS.
LETS is a list of (\"NAME\" BINDING-FORM) forms.
FORMS is a list of (\"NAME\" FORM) forms.
Calls `bench-multi-lexical', which see."
(declare (indent defun))
(let ((benchmarks (cl-loop for (let-name let) in lets
collect (list 'list let-name
`(let ,let
(bench-multi-lexical :times ,times :ensure-equal ,ensure-equal :raw t
:forms ,forms))))))
`(let* ((results (list ,@benchmarks))
(header '("Form" "x fastest" "Total runtime" "# of GCs" "Total GC runtime"))
(results (cl-loop for (let-name let) in results
append (cl-loop for result in-ref let
do (setf (car result) (format "%s: %s" let-name (car result)))
collect result))))
(append (list header)
(list 'hline)
(bench-multi-process-results results)))))Used like:
(bench-multi-lets :times 100000 :ensure-equal t
:lets (("1" ((var "1")))
("12345" ((var "12345")))
("1234567890" ((var "1234567890"))))
:forms (("concat" (concat "VAR: " var))
("format" (format "VAR: %s" var))))#+RESULTS[1e38aeddf90e38a2d2e1cf00aa77f13e7da51cb3]:
| Form | x fastest | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| 1: concat | fastest | 0.010552 | 0 | 0 |
| 12345: concat | 1.02 | 0.010812 | 0 | 0 |
| 1234567890: concat | 1.05 | 0.011071 | 0 | 0 |
| 1: format | 1.51 | 0.015928 | 0 | 0 |
| 12345: format | 1.97 | 0.020803 | 0 | 0 |
| 1234567890: format | 2.42 | 0.025500 | 0 | 0 |
Call this macro from an Org source block and you’ll get a results block showing which 20 functions were called the most times, how long they took to run, etc. prefixes should be a list of symbols matching the prefixes of the functions you want to instrument.
;;;###autoload
(defmacro elp-profile (times prefixes &rest body)
(declare (indent defun))
`(let (output)
(dolist (prefix ,prefixes)
(elp-instrument-package (symbol-name prefix)))
(dotimes (x ,times)
,@body)
(elp-results)
(elp-restore-all)
(point-min)
(forward-line 20)
(delete-region (point) (point-max))
(setq output (buffer-substring-no-properties (point-min) (point-max)))
(kill-buffer)
(delete-window)
(let ((rows (s-lines output)))
(append (list (list "Function" "Times called" "Total time" "Average time")
'hline)
(cl-loop for row in rows
collect (s-split (rx (1+ space)) row 'omit-nulls))))));; Use like this:
(elp-profile 10 '(map search goto-char car append)
(goto-char (point-min))
(search-forward "something"))This gives a table like:
| Function | Times called | Total time | Average time |
|---|---|---|---|
| mapcar | 30 | 0.0036004130 | 0.0001200137 |
| search-forward | 10 | 2.089…e-05 | 2.089…e-06 |
| goto-char | 10 | 6.926e-06 | 6.926e-07 |
| car | 13 | 3.956…e-06 | 3.043…e-07 |
| append | 1 | 5.96e-07 | 5.96e-07 |
| mapatoms | 1 | 0 | 0.0 |
This package for GNU Emacs allows latency tracing to be performed on Emacs Lisp code and the results output to files using the Chromium Catapult Trace Event Format. These trace files can then be loaded into trace analysis utilities in order to generate flame graphs and other useful visualisations and analyses.
:archive.today: http://archive.today/xPWJPEmacs Refactor (EMR) is a framework for providing language-specific refactoring in Emacs. It includes refactoring commands for a variety of languages, including elisp itself!
lex is a regular expression matching engine with syntax similar to rx. It appears to be more implemented in elisp than standard Emacs regexp tools, so it may be slower, but its additional capabilities may be useful.
Format of regexps is the same as used for `rx’ and `sregex’. Additions:
(ere RE)specify regexps using the ERE syntax.(inter REs...)(aka&) make a regexp that only matches if all its branches match. E.g.(inter (ere ".*a.*") (ere ".*b.*"))match any string that contain both anaand ab, in any order.(case-fold REs...)and(case-sensitive REs...)make a regexp that is case sensitive or not, regardless of case-fold-search.
ample-regexps complements the built-in rx macro by flexibly defining regular expressions with reusable parts. In the following example, the define-arx macro defines three things:
- A macro
url-rx, which expands to a regular expression string at compile time - A function
url-rx-to-string, which can be used at runtime - A variable
url-rx-constituents, containing form definitions to use
(define-arx url-rx
'((http (seq bos (group "http") "://") )
(https (seq bos (group "https") "://") )
(https? (seq bos (group "http" (optional "s")) "://") )
(protocol (seq bos (group (1+ (not (any ":")))) "://"))
(host (group (1+ (not (any "/")))))
(path (group "/" (1+ (not (any "?")))))
(query (seq "?" (group (1+ (not (any "#"))))))
(fragment (seq "#" (group (1+ anything))))))The url-rx macro can then be used to test and select parts of URLs:
;; Accept HTTP or HTTPS
(let ((url "http://server/path?query#fragment"))
(when (string-match (url-rx https? host path (optional query) (optional fragment)) url)
(list (match-string 0 url)
(match-string 1 url)
(match-string 2 url)
(match-string 3 url)
(match-string 4 url)
(match-string 5 url)))) ;=> ("http://server/path?query#fragment" "http" "server" "/path" "query" "fragment")
;; Only accept HTTPS, not plain HTTP
(let ((url "http://server/path?query#fragment"))
(when (string-match (url-rx https host path (optional query) (optional fragment)) url)
(list (match-string 0 url)))) ;=> nil
;; Accept any protocol, not just HTTP
(let ((url "ftp://server/path"))
(when (string-match (url-rx protocol host path (optional query) (optional fragment)) url)
(list (match-string 0 url)
(match-string 1 url)
(match-string 2 url)
(match-string 3 url)
(match-string 4 url)
(match-string 5 url)))) ;=> ("ftp://server/path" "ftp" "server" "/path" nil nil)This example shows the use of a function to expand a list of strings into a sequence:
(define-arx cond-assignment-rx
'((alpha_ (regexp "[[:alpha:]_]"))
(alnum_ (regexp "[[:alnum:]_]"))
(ws (* blank))
(sym (:func (lambda (_form &rest args)
`(seq symbol-start (or ,@args) symbol-end))))
(cond-keyword (sym "if" "elif" "while"))
(id (sym (+ alpha_) (* alnum_))))) ;; -> cond-assignment-rx
(cond-assignment-rx cond-keyword ws id ":" id ws "=" ws id) ;; -> "\\_<\\(?:elif\\|if\\|while\\)\\_>[[:blank:]]*\\_<\\(?:[[:alpha:]_]+\\|[[:alnum:]_]*\\)\\_>:\\_<\\(?:[[:alpha:]_]+\\|[[:alnum:]_]*\\)\\_>[[:blank:]]*=[[:blank:]]*\\_<\\(?:[[:alpha:]_]+\\|[[:alnum:]_]*\\)\\_>"Chris Wellons explains how to build strings in several steps. This is achieved thanks to the creation of a temporary buffer that is passed to helper methods using the “current” buffer mechanism. A nice and simple design pattern for Emacs.
The format$ macro (currently hosted here) allows for easy string interpolation, including optional % sequences as used by format. For example, this:
(format$ "Amount: ${amount% .02f} $name %s" date)Expands to:
(format "Amount: % .02f %s %s" amount name date)Since this happens at macro expansion time rather than at runtime, there is no performance penalty, in contrast to using s-lex-format.
I was very inspired by Damien Cassou’s great presentation during EmacsConf 2019 to write this post and I encourage you to check it out if you haven’t already. In short, when writing packages for Emacs, it is best practice to run several quality tools on them, like syntax and documentation checkers, or even ERT Tests. But once these packages are public and pull requests start coming in, it is a huge time saver to have these same tools ran automatically and provide feedback to contributors. That’s right, we’re talking about Continuous Integration for Emacs packages.
Frameworks for writing, organizing, and running tests.
Buttercup is a behavior-driven development framework for testing Emacs Lisp code. It allows to group related tests so they can share common set-up and tear-down code, and allows the programmer to “spy” on functions to ensure they are called with the right arguments during testing.
The framework is heavily inspired by Jasmine.
There are plenty of unit/regression testing tools for Emacs, and even some for functional testing. What Emacs is missing though is a really good testing framework for integration testing. This is where Ecukes comes in.
Cucumber is a great integration testing tool, used mostly for testing web applications. Ecukes is Cucumber for Emacs. No, it’s not a major mode to edit feature files. It is a package that makes it possible to write Cucumber like tests for your Emacs packages.
This is the standard, built-in Emacs testing library, used by core code and third-party packages alike.
Libraries that help with writing tests.
Assess provides additional support for testing Emacs packages.
It provides:
- a set of predicates for comparing strings, buffers and file contents.
- explainer functions for all predicates giving useful output
- macros for creating many temporary buffers at once, and for restoring the buffer list.
- methods for testing indentation, by comparision or “roundtripping”.
- methods for testing fontification.
Assess aims to be a stateless as possible, leaving Emacs unchanged whether the tests succeed or fail, with respect to buffers, open files and so on; this helps to keep tests independent from each other.
expectations allows more concise definitions of ERT tests. For example:
;; With ERT:
(ert-deftest erte-test-00001 ()
(should (equal 10 (+ 4 6))))
;; With Expectations:
(expect 10 (+ 4 6))
;; Or:
(expectations
(desc "success")
(expect 10 (+ 4 6))
(expect 5 (length "abcde"))
(desc "fail")
(expect 11 (+ 4 6))
(expect 6 (length "abcde")))propcheck brings property based testing to Elisp. It’s similar to the excellent Hypothesis library for Python.
This package provides an Emacs Lisp macro,
with-simulated-input, which evaluates one or more forms while simulating a sequence of input events for those forms to read. The result is the same as if you had evaluated the forms and then manually typed in the same input. This macro is useful for non-interactive testing of normally interactive commands and functions, such ascompleting-read.Some interactive functions rely on idle timers to do their work, so you might need a way to simulate idleness. For that, there is the
wsi-simulate-idle-timefunction. You can insert calls to this function in between input strings.
XTest is a simple set of extensions for ERT. XTest speeds up the creation of tests that follow the “one assertion per test” rule of thumb. It also simplifies testing functions that manipulate buffers. XTest aims to do a few things well, instead of being a monolithic library that attempts to solve every conceivable testing need. XTest is designed to be paired with vanilla ERT and other ERT libraries, where the user mixes and matches depending on their needs.
When testing error messages, the message string in the test suite might not match the value captured by the test output, because Emacs may run substitute-quotes on the message. This may result in various quotation marks being changed. It can even be the case that the difference only manifests on other systems (e.g. the tests may pass on the developer’s system but fail on a remote CI system due to different locale settings).
To work around this, pass a format string to error, like (error "%s" "Foo doesn't bar"), which prevents Emacs from changing the quotes. (For more information, see this issue.)
- Libraries
- bui: Buffer interface library
- lister: Yet another list printer
- calfw: Calendar framework
- ctable: Table Component
- Emacs’s Widget for Object Collections (ewoc)
- hydra
- navigel
- tabulated-list-mode
- Transient
- tui: An experimental text-based UI framework modeled after React
- widget
- widget-mvc: Web-like MVC framework
BUI (Buffer User Interface) is an Emacs library that can be used to make user interfaces to display some kind of entries (like packages, buffers, functions, etc.).
The intention of BUI is to be a high-level library which is convenient to be used both by:
- package makers, as there is no need to bother about implementing routine details and usual features (like buffer history, filtering displayed entries, etc.);
- users, as it provides familiar and intuitive interfaces with usual keys (for moving by lines, marking, sorting, switching between buttons); and what is also important, the defined interfaces are highly configurable through various generated variables. A summary of available key bindings can be displayed by pressing h.
Usage
BUI provides means to display entries in 2 types of buffers:
list: it is based ontabulated-list-mode, thus it looks similar to a list of Emacs packages (M-x list-packages);info: it can be used to display more verbose info, like various buttons, text and other stuff related to the displayed entry (or entries).In short, you define how a
list/infointerface looks like (usingbui-define-interfacemacro), and then you can make some user commands that will display entries (usingbui-get-display-entriesand similar functions).
Lister is a library for creating interactive “lists” of any kind. In contrast to similar packages like hierarchy.el or tablist.el, it aims at not simply mapping a data structure to a navigatable list. Rather, it treats the list like emacs treats buffers: It is an empty space to which you can successively add stuff. So in Emacs lingo, lister should be rather called listed - it is a library for editing lists, instead of displaying them.
This program displays a calendar view in the Emacs buffer.
It is also usable as a library to display items on a calendar.
ctable.el is a table component for Emacs Lisp. Emacs Lisp programs can display a nice table view from an abstract data model. The many emacs programs have the code for displaying table views, such as dired, list-process, buffer-list and so on. So, ctable.el would provide functions and a table framework for the table views.
The Ewoc package constructs buffer text that represents a structure of Lisp objects, and updates the text to follow changes in that structure. This is like the “view” component in the “model–view–controller” design paradigm. Ewoc means “Emacs’s Widget for Object Collections”.
An ewoc is a structure that organizes information required to construct buffer text that represents certain Lisp data. The buffer text of the ewoc has three parts, in order: first, fixed header text; next, textual descriptions of a series of data elements (Lisp objects that you specify); and last, fixed footer text.
This is a package for GNU Emacs that can be used to tie related commands into a family of short bindings with a common prefix - a Hydra.
The navigel package is a library that makes it simpler for Emacs Lisp developers to define user-interfaces based on tablists (also known as tabulated-lists). Overriding a few (CL) methods and calling
navigel-openis all that’s required to get a nice UI to navigate your domain objects (files, music library, database, etc.).
Tabulated List mode is a major mode for displaying tabulated data, i.e., data consisting of entries, each entry occupying one row of text with its contents divided into columns. Tabulated List mode provides facilities for pretty-printing rows and columns, and sorting the rows according to the values in each column.
The library that powers Magit’s command/option UI.
Taking inspiration from prefix keys and prefix arguments, Transient implements a similar abstraction involving a prefix command, infix arguments and suffix commands.
This is an experiment in building purely text-based user interfaces (TUI’s). The ultimate goal is to explore new paradigms for user interface design and development using Emacs. To this end, tui.el implements an API based on the popular React JavaScript framework in order to reduce the demands involved with designing and building complex text-based UI’s. This is all currently experimental! Expect things to change as I get feedback about what works, what does not!
Most graphical user interface toolkits provide a number of standard user interface controls (sometimes known as “widgets” or “gadgets”). Emacs doesn’t really support anything like this, except for an incredibly powerful text “widget.” On the other hand, Emacs does provide the necessary primitives to implement many other widgets within a text buffer. The
widgetpackage simplifies this task.
This is a GUI framework for Emacs Lisp. It is designed for programmers who are familiar with conventional Web MVC frameworks.
One of the “killer apps” for Emacs–and for git!
These libraries can all be used for HTML.
Probably the most featureful, usable library at the moment.
This library provides to formats for xml code generation. The primary form is esxml. esxml is the form that is returned by such functions as libxml-parse-xml-region and is used internally by emacs in many xml related libraries.
It also provides esxml-query:
;; Traditionally people pick one of the following options when faced
;; with the task of extracting data from XML in Emacs Lisp:
;;
;; - Using regular expressions on the unparsed document
;; - Manual tree traversal with `assoc', `car' and `cdr'
;;
;; Browsers faced a similar problem until jQuery happened, shortly
;; afterwards they started providing the `node.querySelector' and
;; `node.querySelectorAll' API for retrieving one or all nodes
;; matching a given CSS selector. This code implements the same API
;; with the `esxml-query' and `esxml-query-all' functions. The
;; following table summarizes the currently supported modifiers and
;; combinators:
;;
;; | Name | Supported? | Syntax |
;; |------------------------------------+------------+-------------|
;; | Namespaces | No | foo|bar |
;; | Commas | Yes | foo, bar |
;; | Descendant combinator | Yes | foo bar |
;; | Child combinator | Yes | foo>bar |
;; | Adjacent sibling combinator | No | foo+bar |
;; | General sibling combinator | No | foo~bar |
;; | Universal selector | Yes | * |
;; | Type selector | Yes | tag |
;; | ID selector | Yes | #foo |
;; | Class selector | Yes | .foo |
;; | Attribute selector | Yes | [foo] |
;; | Exact match attribute selector | Yes | [foo=bar] |
;; | Prefix match attribute selector | Yes | [foo^=bar] |
;; | Suffix match attribute selector | Yes | [foo$=bar] |
;; | Substring match attribute selector | Yes | [foo*=bar] |
;; | Include match attribute selector | Yes | [foo~=bar] |
;; | Dash match attribute selector | Yes | [foo|=bar] |
;; | Attribute selector modifiers | No | [foo=bar i] |
;; | Pseudo elements | No | ::foo |
;; | Pseudo classes | No | :foo | Example:
(defun org-books--amazon (url)
"Return plist of data for book at Amazon URL."
(cl-flet ((field (target-field list)
(cl-loop for li in list
for (field value) = (ignore-errors
(-let (((_ _ (_ _ field) value) li))
(list field value)))
when (equal field target-field)
return (s-trim value))))
(let* ((html (org-web-tools--get-url url))
(tree (with-temp-buffer
(insert html)
(libxml-parse-html-region (point-min) (point-max))))
(author (esxml-query "span.author a.contributorNameID *" tree))
(title (esxml-query "div#booksTitle h1#title > span *" tree))
(details (esxml-query-all "table#productDetailsTable ul li" tree))
(date (if-let ((printed (third (esxml-query-all "div#booksTitle h1#title span *" tree))))
;; Printed book
(s-replace "– " "" printed)
;; Kindle book
(field "Publication Date:" details)))
(asin (field "ASIN:" details))
(publisher (-some->> (field "Publisher:" details)
(replace-regexp-in-string (rx " (" (1+ anything) ")") "")))
(isbn-10 (field "ISBN-10:" details))
(isbn-13 (field "ISBN-13:" details)))
(list :author author :title title :publisher publisher :date date
:asin asin :isbn-10 isbn-10 :isbn-13 isbn-13))))It’s like jQuery, but way less useful.
Example:
<html style="height: 100vh">
<head class="kek"><title class="kek" data-bar="foo">Complex HTML Page</title></head>
<body class="kek bur" style="height: 100%">
<h1 id="bar" class="kek wow">Wow this is an example</h1>
<input id="quux" class="kek foo"/>
<iframe id="baz" sandbox="allow-same-origin allow-scripts allow-popups allow-forms"
width="100%" height="100%" src="example.org">
</iframe>
</body>
</html>(let ((html (elq-read-file "~/kek.html")))
(elq-el (car (elq-$ ".kek#quux" html))) ; => "input"
(mapcar 'elq-el (elq-$ ".kek" html)) ; => ("input" "h1" "body" "title" "head")
(mapcar (lambda (el) (elq-el (elq-parent el)))
(elq-$ ".kek" html)) ; => ("body" "body" "html" "head" "html")
(mapcar (lambda (el) (mapcar 'elq-el (elq-siblings el)))
(elq-$ ".kek" html)) ; => (("h1" "input" "iframe") ("h1" "input" "iframe") ("head" "body") ("title") ("head" "body"))
(elq-$ ".kek" html) ; => Hope you didn't like your messages buffer
(elq-write html nil)) ; => "<html style=\"height: 100vh\"> ... </html>"Provides lisp-based (rather than string-based) selectors. This library is primarily aimed at internal elfeed use rather than general use, however it may be useful to others. The author is considering publishing it separately.
;; Grab the top-level paragraph content from XHTML.
(xml-query-all '(html body p *) xhtml)
;; Extract all the links from an Atom feed.
(xml-query-all '(feed entry link [rel "alternate"] :href) xml)This provides a limited set of lisp-based selectors (rather than string-based selectors).
Example:
(require 'enlive)
(enlive-text
(enlive-query (enlive-fetch "http://gnu.org/") [title])) ; => "The GNU Operating System and the Free Software Movement"Mostly undocumented, providing three main functions:
;; Utility functions for xml parse trees.
;; - `xml+-query-all' and `xml+-query-first' are query functions that search
;; descendants in node lists. They don't work with namespace-aware parsing yet
;;
;; - `xml+-node-text' gets node textGenerate XML using sexps with the function xmlgen:
(xmlgen '(html
(head
(title "hello")
(meta :something "hi"))
(body
(h1 "woohhooo")
(p "text")
(p "more text"))))produces this:
<html>
<head>
<title>hello</title>
<meta something="hi" />
</head>
<body>
<h1>woohhooo</h1>
<p>text</p>
<p>more text</p>
</body>
</html>This is the main community aggregator. You can find just about everyone’s Emacs-related blog posts here.
Sacha Chua’s /Emacs News/
This is Sacha’s weekly Emacs news digest. Don’t miss it!
One of the top Emacs blogs, frequently updated, and often highlights other interesting blog entries in the community.
Oleh Krehel’s /(or emacs/
The Emacs community is so full of brilliant, generous people that I can’t keep track of them all! I will surely overlook many, and I will add them in no particular order, but merely as I come across them again and again.
- Anders Lindgren
- Artur Malabarba
- Chris Wellons
- Damien Cassou
- Henrik Lissner
- John Wiegley
- Jonas Bernoulli
- Jorgen Schäfer
- Magnar Sveen
- Matus Goljer
- Oleh Krehel
- Phil Lord
- Roland Walker
- Sacha Chua
- Wilfred Hughes
Anders, aka Lindydancer, has written numerous packages to help with developing highlighting and font-lock packages, as well as some other useful tools.
Another prolific Emacs contributor, package developer, and blogger.
Chris is the author of packages like Elfeed, EmacSQL, and aio. He also writes about Emacs at his blog, null program.
- State “TODO” from [2020-01-03 Fri 06:27]
Author and maintainer of Doom Emacs, one of the most popular configurations.
John is the current Emacs maintainer.
Jonas is a prolific Emacs package developer and maintainer. You could spend hours on his GitHub repo.
Oleh is a prolific package author, having contributed many very high-quality packages. He also writes at his blog.
Roland has published a wide variety of useful Emacs packages.
Sacha could easily be nominated the official Emacs ambassador, were there to be one. Her contributions to the Emacs and Org-mode communities are innumerable. One of her greatest recent contributions is her weekly Emacs news posts that serve as a digest of everything that happened in the Emacs world over the past week.
Wilfred has published several useful packages, and he’s also leading the Rust Emacs port.
Yes, please! Send pull requests and file issues on the GitHub repo. This is intended to be a community project.
- Catalog and tag appropriately
- New entries in the outline should have the appropriate tags and should follow the existing hierarchy. For example, articles should be tagged
articles, and generally filed under anArticlesheading using tag inheritance to apply the tag. - “Loosely” or “usefully” opinionated
- Rather than being a place to dump links for users to sort out, we should do that ourselves. Links should have summaries and examples. Where there are multiple links to similar projects, we should compare them and guide users to what we think is generally the best solution, or the best solution for each use case.
- Archive reference material
- Much of the shared wisdom in the Emacs community is written in a variety of blogs by users and developers, as well as posts on Reddit, StackOverflow, etc. These tend to hang around for a long time, but being the Internet, this is never guaranteed. When linking to an article or other reference material, we should store a link to an archived version using this code.
- org-make-toc
- This package updates the table of contents. It’s automatically used by this document through file-local variables, which you should be prompted to allow when opening the file.
These resources should be added to the appropriate sections above. Since it takes some work to catalog and organize them, they are dumped here for future reference. Pull requests for these are welcome!
See Optimize by minad · Pull Request #30 · tarsius/minions · GitHub.
Add el-search
Useful for searching Elisp code, doing query/replace on it in a Lisp-aware way, etc.
[2020-11-03 Tue 15:27] It’s very surprising that stream seems faster than a plain cl-loop. I wonder if I’m doing something wrong…
Also see:
(bench-multi-lexical :times 100 :ensure-equal t
:forms (("cl-loop"
(let* ((buffer (find-file-noselect "~/org/main.org"))
(regexp (rx bow "Emacs" eow)))
(with-current-buffer buffer
(goto-char (point-min))
(length (cl-loop while (re-search-forward regexp nil t)
collect (match-string-no-properties 0))))))
("stream-regexp/seq-do/push"
(let* ((buffer (find-file-noselect "~/org/main.org"))
(regexp (rx bow "Emacs" eow))
(stream (stream-regexp buffer regexp))
result)
(with-current-buffer buffer
(goto-char (point-min))
(seq-do (lambda (_match)
(push (match-string-no-properties 0) result))
stream)
(length result))))
("stream-regexp/cl-loop"
(let* ((buffer (find-file-noselect "~/org/main.org"))
(regexp (rx bow "Emacs" eow))
(stream (stream-regexp buffer regexp)))
(with-current-buffer buffer
(goto-char (point-min))
(length (cl-loop while (stream-pop stream)
collect (match-string-no-properties 0))))))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| stream-regexp/cl-loop | 1.03 | 1.305895 | 1 | 0.193277 |
| stream-regexp/seq-do/push | 1.42 | 1.350986 | 1 | 0.199524 |
| cl-loop | slowest | 1.925070 | 0 | 0 |
[2020-11-03 Tue 16:57] Other stream-related tests (these methods are bespoke):
The benchmark macros need to be extended to allow definitions that aren’t part of the benchmarked code.
(cl-defmethod stream-lines ((buffer buffer) &optional pos no-properties)
"Return a stream of the lines of the buffer BUFFER.
BUFFER may be a buffer or a string (buffer name).
The sequence starts at POS if non-nil, `point-min' otherwise."
;; Copied from the buffer method.
(let ((fn (if no-properties
#'buffer-substring-no-properties
#'buffer-substring)))
(with-current-buffer buffer
(unless pos (setq pos (point-min)))
(if (>= pos (point-max))
(stream-empty))
(stream-cons
(with-current-buffer buffer
(save-excursion
(save-restriction
(widen)
(goto-char pos)
(prog1 (funcall fn (point-at-bol) (point-at-eol))
(setf pos (progn
(forward-line 1)
(point)))))))
(stream-lines buffer pos no-properties)))))
(bench-multi-lexical :times 100 :ensure-equal t
:forms (("stream-lines/seq-take/seq-into"
(let* ((buffer (find-file-noselect "~/org/main.org"))
(stream (stream-lines buffer nil 'no-properties)))
(seq-into (seq-take stream 10) 'list)))
("cl-loop"
(let* ((buffer (find-file-noselect "~/org/main.org"))
(no-properties t))
(with-current-buffer buffer
(save-excursion
(save-restriction
(widen)
(goto-char (point-min))
(cl-loop for fn = (if no-properties
#'buffer-substring-no-properties
#'buffer-substring)
collect (funcall fn (point-at-bol) (point-at-eol))
do (forward-line 1)
until (eobp)))))))))The benchmark macros need to be extended to allow definitions that aren’t part of the benchmarked code. I’m not sure how I even got those results because it’s not working now…
(cl-defmethod stream-lines ((string string) &optional pos no-properties)
"Return a stream of the lines of the string STRING.
The sequence starts at POS if non-nil, 0 otherwise."
;; Copied from the buffer method.
(unless pos (setq pos 0))
(let ((fn (if no-properties
#'buffer-substring-no-properties
#'buffer-substring))
(eol (when (string-match "\n" string pos)
(match-beginning 0))))
(stream-cons
(seq-subseq string pos eol)
(if (not eol)
(stream-empty)
(stream-lines string (1+ eol) no-properties)))))
(bench-multi-lexical :times 100 :ensure-equal t
:forms (("stream-lines/seq-into"
(let* ((string "abcd
efgh
hijk
zz"))
(seq-into (stream-lines string nil 'no-properties) 'list)))
("s-lines"
(let* ((string "abcd
efgh
hijk
zz"))
(s-lines string)))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| s-lines | 10.47 | 0.000513 | 0 | 0 |
| stream/seq-into | slowest | 0.005370 | 0 | 0 |
- State “TODO” from [2021-10-01 Fri 11:22]
Emacs, a programmer’s text editor with roots in the 1970s, is a great tool for animation. In Fall, 2010 I taught a digital art class at NYU’s interdisciplinary Steinhardt art school. Clearly, the thing to do was to teach how to make animations in Emacs by programming it in Lisp.
These exercises are meant for non-programmers to get a glimpse of what a program and a language can do, by creating “physical” objects, in this case punctuation marks on the screen. ASCII art is the future, yes? At the very least, ASCII art in the ’70s was to computer science what post-minimalism was to the contemporary art of the period. Think of a pile of ampersands and exclamation marks as earth art.
AddGitHub - doublep/datetime: Library for parsing, formatting, matching and recoding timestamps and date-time format strings.
Not to be confused with the datetime-format library.
e.g. https://www.reddit.com/r/emacs/comments/idz35e/emacs_27_can_take_svg_screenshots_of_itself/
e.g. saving files to disk.
- State “TODO” from [2021-09-06 Mon 04:06]
Especially easy-mmode-defmap.
Read and write files in Emacs Lisp (5 min read)
A Future For Concurrency In Emacs Lisp (6 min read)
I wished GNU Emacs had… (2 min read)
Reproduce bugs in emacs -Q (4 min read)
Why package.el? (1 min read)
My Emacs Configuration with use-package (8 min read)
Emacs script pitfalls (13 min read)
Autoloads in Emacs Lisp (5 min read)
Advanced syntactic fontification (11 min read)
Calling Python from Haskell (12 min read)
Search-based fontification with keywords (18 min read)
Syntactic fontification in Emacs (10 min read)
GitHub - nicferrier/emacs-noflet: noflet - nic’s overriding flet, for fleting functions for the purpose of decorating them
A variety of packages published, e.g. at http://www.dr-qubit.org/emacs_data-structures.html
He has a lot of interesting libraries on his repo, and some of them are extensively documented. An aspiring Emacs Lisp developer could learn a lot from his code.
- State “DONE” from “UNDERWAY” [2020-11-09 Mon 00:53]
- State “UNDERWAY” from “TODO” [2020-11-08 Sun 18:29]
- http://github.com/skeeto
- Elfeed
- emacs-aio: async/await for Emacs Lisp
- Other Emacs packages
e.g.:
- Commonly used minor modes
highlight-funcallshighlight-quotedoutline-minor-mode
Mention @milkypostman, @purcell, @syohex, etc. Mention sandbox.
Add Modern Emacs site
For my own notes here are all the resources on dynamic modules I know of:
Here are the official Emacs header and example: emacs-module.h: http://git.savannah.gnu.org/cgit/emacs.git/tree/src/emacs-module.h?id=e18ee60b02d08b2f075903005798d3d6064dc013 mod_test.c: http://git.savannah.gnu.org/cgit/emacs.git/tree/modules/mod-test/mod-test.c?id=e18ee60b02d08b2f075903005798d3d6064dc013
This simple example in C http://diobla.info/blog-archive/modules-tut.html
- joymacs
- http://nullprogram.com/blog/2016/11/05/
- mruby
- https://github.com/syohex/emacs-mruby-test
- https://github.com/tromey/emacs-ffi
- an actual ffi for emacs
- elfuse
- https://github.com/vkazanov/elfuse a file system in Emacs
- asynchronous events
- http://nullprogram.com/blog/2017/02/14/ related to elfuse
- emacs-sqlite3
- sqlite3 binding of Emacs Lisp
- emacs-parson
- JSON parser with dynamic module feature with parson
- libyaml
- libyaml
- emacs-perl
- Embed Perl into Emacs
- https://github.com/syohex/emacs-eject
- eject a cd
- emacs-capstone
- elisp bindings for the capstone disassembler
- emacs-csound
- EmacsLisp link to Csound’s API via Emacs Modules
- emacs-cmigemo
- Emacs dynamic module for cmigemo
- emacs-cipher
- OpenSSL cipher binding of Emacs Lisp
- emacs-lua
- Lua engine from Emacs Lisp
- emacs-ztd
- libzstd binding of Emacs Lisp
- mem-cached
- libmemcached
- https://coldnew.github.io/2d16cc25/
- in Chinese, but with code
A collection of module resources: https://github.com/emacs-pe/emacs-modules
- Nim https://github.com/yuutayamada/nim-emacs-module
- OCaml https://github.com/janestreet/ecaml
- Rust https://github.com/lunaryorn/emacs-module.rs https://github.com/jjpe/emacs_module_bindings
- golang
- https://github.com/sigma/go-emacs writing modules in go
This may not be a dynamic module but claims an ffi haskell https://github.com/knupfer/haskell-emacs
Describe things like exporting an Org readme to an Info manual, e.g. like Magit, org-super-agenda, etc.
- State “TODO” from [2017-09-06 Wed 00:21]
- State “TODO” from [2017-12-16 Sat 20:16]
[2017-07-29 Sat 00:33] Not only should you test installing and using your package in the sandbox, but you should also test then exiting the sandbox Emacs, running it again with the package already installed, and loading it. This is because, when the sandbox installs the package, the byte-compilation seems to load some things that won’t be loaded the same way when only loading the byte-compiled file (especially if you have any eval-when-compile lines, or unusual macros or things that modify the environment when loaded).
See melpa/melpa#6191 (comment)
(defun key-quiz--shuffle-list (list)
"Shuffles LIST randomly, modying it in-place."
(dolist (i (reverse (number-sequence 1 (1- (length list)))))
(let ((j (random (1+ i)))
(tmp (elt list i)))
(setf (elt list i) (elt list j))
(setf (elt list j) tmp)))
list)
(defun key-quiz--shuffle-list-nreverse (list)
"Shuffles LIST randomly, modying it in-place."
(dolist (i (nreverse (number-sequence 1 (1- (length list)))))
(let ((j (random (1+ i)))
(tmp (elt list i)))
(setf (elt list i) (elt list j))
(setf (elt list j) tmp)))
list)
(defun elfeed--shuffle (seq)
"Destructively shuffle SEQ."
(let ((n (length seq)))
(prog1 seq ; don't use dotimes result (bug#16206)
(dotimes (i n)
(cl-rotatef (elt seq i) (elt seq (+ i (random (- n i)))))))))
(defun faster-seq-sort-by (function pred sequence)
"Sort SEQUENCE using PRED as a comparison function.
Elements of SEQUENCE are transformed by FUNCTION before being
sorted. FUNCTION must be a function of one argument."
;; This version is modified to avoid calling "random" twice every time the predicate is called.
(seq-map 'cdr
(sort (seq-map (lambda (x) (cons (funcall function x) x)) sequence)
(lambda (a b)
(funcall pred (car a) (car b))))))
(defun seq-sort-by--shuffle (seq)
(seq-sort-by (lambda (_) (random)) #'<= seq))
(defun faster-seq-sort-by--shuffle (seq)
(faster-seq-sort-by (lambda (_) (random)) #'<= seq))(let ((big-list (seq-into (seq-take obarray 5000) 'list)))
(bench-multi-lexical :times 100
:forms (("key-quiz--shuffle-list" (key-quiz--shuffle-list big-list))
("key-quiz--shuffle-list-nreverse" (key-quiz--shuffle-list-nreverse big-list))
("elfeed--shuffle" (elfeed--shuffle big-list))
("seq-sort-by--shuffle" (seq-sort-by--shuffle big-list))
("faster-seq-sort-by--shuffle" (faster-seq-sort-by--shuffle big-list)))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| faster-seq-sort-by–shuffle | 1.38 | 1.725037 | 0 | 0 |
| seq-sort-by–shuffle | 15.01 | 2.378234 | 0 | 0 |
| key-quiz–shuffle-list-nreverse | 1.03 | 35.703316 | 27 | 17.892723 |
| key-quiz–shuffle-list | 1.24 | 36.630320 | 28 | 18.768216 |
| elfeed–shuffle | slowest | 45.439405 | 32 | 21.130538 |
(let ((big-list (seq-into (seq-take obarray 5000) 'vector)))
(bench-multi-lexical :times 100
:forms (("key-quiz--shuffle-list" (key-quiz--shuffle-list big-list))
("key-quiz--shuffle-list-nreverse" (key-quiz--shuffle-list-nreverse big-list))
("elfeed--shuffle" (elfeed--shuffle big-list))
("seq-sort-by--shuffle" (seq-sort-by--shuffle big-list))
("faster-seq-sort-by--shuffle" (faster-seq-sort-by--shuffle big-list)))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| faster-seq-sort-by–shuffle | 1.39 | 1.718990 | 0 | 0 |
| seq-sort-by–shuffle | 10.42 | 2.390860 | 0 | 0 |
| key-quiz–shuffle-list-nreverse | 1.02 | 24.918774 | 27 | 17.971779 |
| key-quiz–shuffle-list | 1.10 | 25.452665 | 28 | 18.487015 |
| elfeed–shuffle | slowest | 27.991305 | 32 | 21.215224 |
- State “TODO” from [2019-10-05 Sat 12:20]
(bench-multi-lexical :times 1000 :ensure-equal t
:forms (("pcase-let* backquoted pattern"
(pcase-let* ((`(,name ,argument) (list 'NAME 'ARGUMENT)))
(list name argument)))
("seq-let"
(seq-let (name argument) (list 'NAME 'ARGUMENT)
(list name argument)))))| Form | x faster than next | Total runtime | # of GCs | Total GC runtime |
|---|---|---|---|---|
| pcase-let* backquoted pattern | 2.73 | 0.000188 | 0 | 0 |
| seq-let | slowest | 0.000515 | 0 | 0 |
- State “MAYBE” from [2020-01-19 Sun 15:48]
He archived the project, so it probably shouldn’t be used, but it may have interesting historical significance for developing similar tools.