master dcce1e07fe7 2/2: ; Fix last change

[Eli Zaretskii]

branch: master
commit dcce1e07fe750df060ab3a7c6782dc5145710fa3
Author: Eli Zaretskii <eliz@gnu.org>
Commit: Eli Zaretskii <eliz@gnu.org>

    ; Fix last change
    
    * doc/lispref/sequences.texi (Sequence Functions): Improve
    indexing of last change
---
 doc/lispref/sequences.texi | 2 ++
 1 file changed, 2 insertions(+)

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
 function, which guarantees that the key will be computed for each list
 element exactly once.
 
+@cindex decorate-sort-undecorate
+@cindex Schwartzian transform
 @defun sort-on sequence predicate accessor
 This function stably sorts the list @var{sequence}, comparing the sort
 keys of the elements using @var{predicate}.  The comparison function