aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorEli Zaretskii2024-02-02 15:27:25 +0200
committerEli Zaretskii2024-02-02 15:27:25 +0200
commitdcce1e07fe750df060ab3a7c6782dc5145710fa3 (patch)
tree9350671fd51288de58d68f8292f0838177d46e43
parent4b79c80c999fe95654b7db196b12e0844473f6da (diff)
downloademacs-dcce1e07fe750df060ab3a7c6782dc5145710fa3.tar.gz
emacs-dcce1e07fe750df060ab3a7c6782dc5145710fa3.zip
; Fix last change
* doc/lispref/sequences.texi (Sequence Functions): Improve indexing of last change
-rw-r--r--doc/lispref/sequences.texi2
1 files changed, 2 insertions, 0 deletions
diff --git a/doc/lispref/sequences.texi b/doc/lispref/sequences.texi
index 654019dfc31..896dac35c8e 100644
--- a/doc/lispref/sequences.texi
+++ b/doc/lispref/sequences.texi
@@ -446,6 +446,8 @@ element into a function of its own, you can use the following sorting
446function, which guarantees that the key will be computed for each list 446function, which guarantees that the key will be computed for each list
447element exactly once. 447element exactly once.
448 448
449@cindex decorate-sort-undecorate
450@cindex Schwartzian transform
449@defun sort-on sequence predicate accessor 451@defun sort-on sequence predicate accessor
450This function stably sorts the list @var{sequence}, comparing the sort 452This function stably sorts the list @var{sequence}, comparing the sort
451keys of the elements using @var{predicate}. The comparison function 453keys of the elements using @var{predicate}. The comparison function