From 00510a6b35e1e0ef3bf575789ff1e220b9d195d8 Mon Sep 17 00:00:00 2001 From: Gerd Moellmann Date: Tue, 2 Nov 1999 12:38:00 +0000 Subject: [PATCH] Patch from rms. --- lispref/hash.texi | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/lispref/hash.texi b/lispref/hash.texi index 6a46b01a8b2..e497123b6c0 100644 --- 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{} # @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. -- 2.39.5