# HG changeset patch
# User Eli Zaretskii <eliz@gnu.org>
# Date 1175348692 0
# Node ID 8c3661f157640270fc64660e8908a05483c1be1e
# Parent  d330c192b901f5725abc35c7078043194808e9ab
Improve indexing.

diff -r d330c192b901 -r 8c3661f15764 lispref/display.texi
--- a/lispref/display.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/display.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -4621,6 +4621,7 @@
 @node Abstract Display
 @section Abstract Display
 @cindex ewoc
+@cindex abstract display
 @cindex display, abstract
 @cindex display, arbitrary objects
 @cindex model/view/controller
diff -r d330c192b901 -r 8c3661f15764 lispref/frames.texi
--- a/lispref/frames.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/frames.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -555,6 +555,7 @@
 
 @node Management Parameters
 @subsubsection Window Management Parameters
+@cindex window manager, and frame parameters
 
   These frame parameters, meaningful only on window system displays,
 interact with the window manager.
diff -r d330c192b901 -r 8c3661f15764 lispref/hash.texi
--- a/lispref/hash.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/hash.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -7,10 +7,11 @@
 @node Hash Tables, Symbols, Sequences Arrays Vectors, Top
 @chapter Hash Tables
 @cindex hash tables
+@cindex lookup tables
 
-  A hash table is a very fast kind of lookup table, somewhat like
-an alist in that it maps keys to corresponding values.  It differs
-from an alist in these ways:
+  A hash table is a very fast kind of lookup table, somewhat like an
+alist (@pxref{Association Lists}) in that it maps keys to
+corresponding values.  It differs from an alist in these ways:
 
 @itemize @bullet
 @item
diff -r d330c192b901 -r 8c3661f15764 lispref/locals.texi
--- a/lispref/locals.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/locals.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -9,6 +9,7 @@
 @c The title "Standard Buffer-Local Variables" is too long for
 @c smallbook. --rjc 30mar92
 @cindex buffer-local variables, general-purpose
+@cindex standard buffer-local variables
 
   The table below lists the general-purpose Emacs variables that
 automatically become buffer-local in each buffer.  Most become
diff -r d330c192b901 -r 8c3661f15764 lispref/maps.texi
--- a/lispref/maps.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/maps.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -6,6 +6,7 @@
 @setfilename ../info/maps
 @node Standard Keymaps, Standard Hooks, Standard Buffer-Local Variables, Top
 @appendix Standard Keymaps
+@cindex standard keymaps
 
 The following symbols are used as the names for various keymaps.
 Some of these exist when Emacs is first started, others are
diff -r d330c192b901 -r 8c3661f15764 lispref/numbers.texi
--- a/lispref/numbers.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/numbers.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -480,6 +480,7 @@
 
 @node Arithmetic Operations
 @section Arithmetic Operations
+@cindex arithmetic operations
 
   Emacs Lisp provides the traditional four arithmetic operations:
 addition, subtraction, multiplication, and division.  Remainder and modulus
@@ -1039,6 +1040,7 @@
 @section Standard Mathematical Functions
 @cindex transcendental functions
 @cindex mathematical functions
+@cindex floating-point functions
 
   These mathematical functions allow integers as well as floating point
 numbers as arguments.
diff -r d330c192b901 -r 8c3661f15764 lispref/positions.texi
--- a/lispref/positions.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/positions.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -642,6 +642,7 @@
 @cindex sexp motion
 @cindex Lisp expression motion
 @cindex list motion
+@cindex balanced-parenthesis expressions
 
   Here are several functions concerned with balanced-parenthesis
 expressions (also called @dfn{sexps} in connection with moving across
diff -r d330c192b901 -r 8c3661f15764 lispref/processes.texi
--- a/lispref/processes.texi	Sat Mar 31 13:31:11 2007 +0000
+++ b/lispref/processes.texi	Sat Mar 31 13:44:52 2007 +0000
@@ -2072,6 +2072,7 @@
 
 @node Byte Packing
 @section Packing and Unpacking Byte Arrays
+@cindex byte packing and unpacking
 
   This section describes how to pack and unpack arrays of bytes,
 usually for binary network protocols.  These functions convert byte arrays