Merge branch 'emacs-25-merge'

[gnu-emacs] / lisp / emacs-lisp / avl-tree.el

diff --git a/lisp/emacs-lisp/avl-tree.el b/lisp/emacs-lisp/avl-tree.el
index e3d83eb127f260ea78dccb22a600d532742ced24..9dcebb2bf42be6f335eb3bb0b25256479898f030 100644 (file)
--- a/lisp/emacs-lisp/avl-tree.el
+++ b/lisp/emacs-lisp/avl-tree.el
@@ -561,7 +561,7 @@ Note that if you don't care about the order in which FUNCTION is
 applied, just that the resulting list is in the correct order,
 then
 
 applied, just that the resulting list is in the correct order,
 then
 

-  (avl-tree-mapf function 'cons tree (not reverse))
+  (avl-tree-mapf function \\='cons tree (not reverse))

 
 is more efficient."
   (nreverse (avl-tree-mapf fun 'cons tree reverse)))
 
 is more efficient."
   (nreverse (avl-tree-mapf fun 'cons tree reverse)))


@@ -615,7 +615,7 @@ is more efficient."
 of all elements of TREE.
 
 If REVERSE is non-nil, the stack is sorted in reverse order.
 of all elements of TREE.
 
 If REVERSE is non-nil, the stack is sorted in reverse order.

-\(See also `avl-tree-stack-pop'\).
+\(See also `avl-tree-stack-pop').

 
 Note that any modification to TREE *immediately* invalidates all
 avl-tree-stacks created before the modification (in particular,
 
 Note that any modification to TREE *immediately* invalidates all
 avl-tree-stacks created before the modification (in particular,