Patch from rms.

diff --git a/lispref/hash.texi b/lispref/hash.texi
index 6a46b01a8b24502200796e579f43b373956c87b1..e497123b6c0ff89cf6cb64eea8a55698c10c7348 100644 (file)
--- a/lispref/hash.texi
+++ b/lispref/hash.texi
@@ -34,6 +34,11 @@ Hash tables have no read syntax, and print in hash notation, like this:
      @result{} #<hash-table 'eql nil 0/65 0x83af980>
 @end example
 
+@noindent
+(The term ``hash notation'' refers to the initial @samp{#}
+character---@pxref{Printed Representation}---and has nothing to do with
+the term ``hash table.'')
+
   Obarrays are also a kind of hash table, but they are a different type
 of object and are used only for recording interned symbols
 (@pxref{Creating Symbols}).
@@ -108,7 +113,7 @@ This specifies a hint for how many associations you plan to store in the
 hash table.  If you know the approximate number, you can make things a
 little more efficient by specifying it this way.  If you specify too
 small a size, the hash table will grow automatically when necessary, but
-doing that takes some extra time,
+doing that takes some extra time.
 
 The default size is 65.