Document the address-hashing facilities for hash tables. Change the

documentation of the PROMPT-FOR-COMMAND- procedures to indicate that
they print the REP level number.

diff --git a/v7/doc/ref-manual/scheme.texinfo b/v7/doc/ref-manual/scheme.texinfo
index 227502dbb2d2c064a46881ec738fffcb5669c3c4..0806299af56f838fc18143e5d7f3e46727801343 100644 (file)
--- a/v7/doc/ref-manual/scheme.texinfo
+++ b/v7/doc/ref-manual/scheme.texinfo
@@ -2,7 +2,7 @@
 @iftex
 @finalout
 @end iftex
-@comment $Id: scheme.texinfo,v 1.28 1993/10/19 08:03:11 cph Exp $
+@comment $Id: scheme.texinfo,v 1.29 1993/10/19 08:06:33 cph Exp $
 @comment %**start of header (This is for running Texinfo on a region.)
 @setfilename scheme
 @settitle MIT Scheme Reference
@@ -106,7 +106,7 @@ literature without prior written consent from MIT in each case.
 
 @titlepage
 @title{MIT Scheme Reference Manual}
-@subtitle Edition 1.28 alpha
+@subtitle Edition 1.29 alpha
 @subtitle for Scheme Release 7.2
 @subtitle 19 October 1993
 @author by Chris Hanson
@@ -9258,13 +9258,13 @@ causes the associations to be rehashed.
 
 The procedures described in this section may be used to make very
 efficient key-hashing procedures for arbitrary objects.  All of these
-procedures are based on @dfn{address hashing}, uses the address of an
-object as its hash number.  The great advantage of address hashing is
+procedures are based on @dfn{address hashing}, which uses the address of
+an object as its hash number.  The great advantage of address hashing is
 that converting an arbitrary object to a hash number is extremely fast
 and takes the same amount of time for any object.
 
-The disadvantage of address hashing is that the address of an object is
-usually changed by the garbage collector.  The hash-table implementation
+The disadvantage of address hashing is that the garbage collector
+changes the addresses of most objects.  The hash-table implementation
 compensates for this disadvantage by noticing garbage collections and
 rehashing tables that use address hashing.  Thus, in order to use these
 procedures for key hashing, it is necessary to tell the hash-table