comparison man/lispref/hash-tables.texi @ 5791:9fae6227ede5

Silence texinfo 5.2 warnings, primarily by adding next, prev, and up pointers to all nodes. See xemacs-patches message with ID <5315f7bf.sHpFD7lXYR05GH6E%james@xemacs.org>.
author Jerry James <james@xemacs.org>
date Thu, 27 Mar 2014 08:59:03 -0600
parents 71ee43b8a74d
children
comparison
equal deleted inserted replaced
5790:dcf9067f26bb 5791:9fae6227ede5
1 @c -*-texinfo-*- 1 @c -*-texinfo-*-
2 @c This is part of the XEmacs Lisp Reference Manual. 2 @c This is part of the XEmacs Lisp Reference Manual.
3 @c Copyright (C) 1996 Ben Wing. 3 @c Copyright (C) 1996 Ben Wing.
4 @c See the file lispref.texi for copying conditions. 4 @c See the file lispref.texi for copying conditions.
5 @setfilename ../../info/hash-tables.info 5 @setfilename ../../info/hash-tables.info
6 @node Hash Tables, Range Tables, Display, top 6 @node Hash Tables, Range Tables, Display, Top
7 @chapter Hash Tables 7 @chapter Hash Tables
8 @cindex hash table 8 @cindex hash table
9 9
10 @defun hash-table-p object 10 @defun hash-table-p object
11 This function returns @code{t} if @var{object} is a hash table, else @code{nil}. 11 This function returns @code{t} if @var{object} is a hash table, else @code{nil}.
18 * Working With Hash Tables:: Hash table functions. 18 * Working With Hash Tables:: Hash table functions.
19 * Weak Hash Tables:: Hash tables with special garbage-collection 19 * Weak Hash Tables:: Hash tables with special garbage-collection
20 behavior. 20 behavior.
21 @end menu 21 @end menu
22 22
23 @node Introduction to Hash Tables 23 @node Introduction to Hash Tables, Working With Hash Tables, Hash Tables, Hash Tables
24 @section Introduction to Hash Tables 24 @section Introduction to Hash Tables
25 25
26 A @dfn{hash table} is a data structure that provides mappings from 26 A @dfn{hash table} is a data structure that provides mappings from
27 arbitrary Lisp objects called @dfn{keys} to other arbitrary Lisp objects 27 arbitrary Lisp objects called @dfn{keys} to other arbitrary Lisp objects
28 called @dfn{values}. A key/value pair is sometimes called an 28 called @dfn{values}. A key/value pair is sometimes called an
161 @defun hash-table-weakness hash-table 161 @defun hash-table-weakness hash-table
162 This function returns the weakness of @var{hash-table}. 162 This function returns the weakness of @var{hash-table}.
163 This can be one of @code{nil}, @code{t}, @code{key} or @code{value}. 163 This can be one of @code{nil}, @code{t}, @code{key} or @code{value}.
164 @end defun 164 @end defun
165 165
166 @node Working With Hash Tables 166 @node Working With Hash Tables, Weak Hash Tables, Introduction to Hash Tables, Hash Tables
167 @section Working With Hash Tables 167 @section Working With Hash Tables
168 168
169 @defun puthash key value hash-table 169 @defun puthash key value hash-table
170 This function hashes @var{key} to @var{value} in @var{hash-table}. 170 This function hashes @var{key} to @var{value} in @var{hash-table}.
171 @end defun 171 @end defun
211 211
212 Returns t on success, an incompatibility with GNU Emacs, which returns 212 Returns t on success, an incompatibility with GNU Emacs, which returns
213 a list comprising @var{test-function} and @var{hash-function}. 213 a list comprising @var{test-function} and @var{hash-function}.
214 @end defun 214 @end defun
215 215
216 @node Weak Hash Tables 216 @node Weak Hash Tables, , Working With Hash Tables, Hash Tables
217 @section Weak Hash Tables 217 @section Weak Hash Tables
218 @cindex hash table, weak 218 @cindex hash table, weak
219 @cindex weak hash table 219 @cindex weak hash table
220 220
221 A @dfn{weak hash table} is a special variety of hash table whose 221 A @dfn{weak hash table} is a special variety of hash table whose