# HG changeset patch
# User Stefan Monnier <monnier@iro.umontreal.ca>
# Date 1007077441 0
# Node ID 3317b62de6477899671816ecf8bfc0ffdff9e7b3
# Parent  c9c839b993b9aa98c0e23b4a0e3e4c12322b54df
(Info-goto-index): One register one step in the history.
(Info-index): Don't protect the history around the call to Info-goto-index.

diff -r c9c839b993b9 -r 3317b62de647 lisp/info.el
--- a/lisp/info.el	Thu Nov 29 23:20:49 2001 +0000
+++ b/lisp/info.el	Thu Nov 29 23:44:01 2001 +0000
@@ -1831,7 +1831,9 @@
   (or (re-search-forward "\n\\* \\(.*\\<Index\\>\\)" nil t)
       (error "No index"))
   (goto-char (match-beginning 1))
-  (Info-goto-node (Info-extract-menu-node-name)))
+  ;; Protect Info-history so that the current node (Top) is not added to it.
+  (let ((Info-history nil))
+    (Info-goto-node (Info-extract-menu-node-name))))
 
 (defun Info-index (topic)
   "Look up a string TOPIC in the index for this file.
@@ -1857,16 +1859,14 @@
 			 (regexp-quote topic)))
 	node
 	(case-fold-search t))
-    ;; Here, and subsequently in this function,
-    ;; we bind Info-history to nil for internal node-switches
-    ;; so that we don't put junk in the history.
-    ;; In the first Info-goto-node call, above, we do update the history
-    ;; because that is what the user's previous node choice into it.
-    (let ((Info-history nil))
-      (Info-goto-index))
+    (Info-goto-index)
     (or (equal topic "")
 	(let ((matches nil)
 	      (exact nil)
+	      ;; We bind Info-history to nil for internal node-switches so
+	      ;; that we don't put junk in the history.  In the first
+	      ;; Info-goto-index call, above, we do update the history
+	      ;; because that is what the user's previous node choice into it.
 	      (Info-history nil)
 	      found)
 	  (while