diff options
| author | Gerd Moellmann | 1999-11-02 12:38:00 +0000 |
|---|---|---|
| committer | Gerd Moellmann | 1999-11-02 12:38:00 +0000 |
| commit | 00510a6b35e1e0ef3bf575789ff1e220b9d195d8 (patch) | |
| tree | 1cb11a850fde28fadd645597c65b873935cedc90 | |
| parent | 1b335865a40d3227b33d15aeeb67366561b8dc23 (diff) | |
| download | emacs-00510a6b35e1e0ef3bf575789ff1e220b9d195d8.tar.gz emacs-00510a6b35e1e0ef3bf575789ff1e220b9d195d8.zip | |
Patch from rms.
| -rw-r--r-- | lispref/hash.texi | 7 |
1 files changed, 6 insertions, 1 deletions
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: | |||
| 34 | @result{} #<hash-table 'eql nil 0/65 0x83af980> | 34 | @result{} #<hash-table 'eql nil 0/65 0x83af980> |
| 35 | @end example | 35 | @end example |
| 36 | 36 | ||
| 37 | @noindent | ||
| 38 | (The term ``hash notation'' refers to the initial @samp{#} | ||
| 39 | character---@pxref{Printed Representation}---and has nothing to do with | ||
| 40 | the term ``hash table.'') | ||
| 41 | |||
| 37 | Obarrays are also a kind of hash table, but they are a different type | 42 | Obarrays are also a kind of hash table, but they are a different type |
| 38 | of object and are used only for recording interned symbols | 43 | of object and are used only for recording interned symbols |
| 39 | (@pxref{Creating Symbols}). | 44 | (@pxref{Creating Symbols}). |
| @@ -108,7 +113,7 @@ This specifies a hint for how many associations you plan to store in the | |||
| 108 | hash table. If you know the approximate number, you can make things a | 113 | hash table. If you know the approximate number, you can make things a |
| 109 | little more efficient by specifying it this way. If you specify too | 114 | little more efficient by specifying it this way. If you specify too |
| 110 | small a size, the hash table will grow automatically when necessary, but | 115 | small a size, the hash table will grow automatically when necessary, but |
| 111 | doing that takes some extra time, | 116 | doing that takes some extra time. |
| 112 | 117 | ||
| 113 | The default size is 65. | 118 | The default size is 65. |
| 114 | 119 | ||