[Emacs-diffs] Changes to emacs/lispref/hash.texi

[Richard M . Stallman]

Index: emacs/lispref/hash.texi
diff -c emacs/lispref/hash.texi:1.16 emacs/lispref/hash.texi:1.17
*** emacs/lispref/hash.texi:1.16        Wed Jun 23 16:35:29 2004
--- emacs/lispref/hash.texi     Mon Feb 14 10:13:16 2005
***************
*** 46,55 ****
  (@pxref{Creating Symbols}).
  
  @menu
! * Creating Hash::
! * Hash Access::
! * Defining Hash::
! * Other Hash::
  @end menu
  
  @node Creating Hash
--- 46,55 ----
  (@pxref{Creating Symbols}).
  
  @menu
! * Creating Hash::       Functions to create hash tables.
! * Hash Access::         Reading and writing the hash table contents.
! * Defining Hash::       Defining new comparison methods
! * Other Hash::          Miscellaneous.
  @end menu
  
  @node Creating Hash
***************
*** 146,156 ****
  The default value is 1.5.
  
  @item :rehash-threshold @var{threshold}
! This specifies the criterion for when the hash table is ``full.''  The
! value, @var{threshold}, should be a positive floating point number, no
! greater than 1.  The hash table is ``full'' whenever the actual number of
! entries exceeds this fraction of the nominal size.  The default for
! @var{threshold} is 0.8.
  @end table
  @end defun
  
--- 146,156 ----
  The default value is 1.5.
  
  @item :rehash-threshold @var{threshold}
! This specifies the criterion for when the hash table is ``full'' (so
! it should be made larger).  The value, @var{threshold}, should be a
! positive floating point number, no greater than 1.  The hash table is
! ``full'' whenever the actual number of entries exceeds this fraction
! of the nominal size.  The default for @var{threshold} is 0.8.
  @end table
  @end defun
  
***************
*** 167,173 ****
  @section Hash Table Access
  
    This section describes the functions for accessing and storing
! associations in a hash table.
  
  @tindex gethash
  @defun gethash key table &optional default
--- 167,175 ----
  @section Hash Table Access
  
    This section describes the functions for accessing and storing
! associations in a hash table.  In general, any Lisp object can be used
! as a hash key, unless the comparison method imposes limits.  Any Lisp
! object can also be used as the value.
  
  @tindex gethash
  @defun gethash key table &optional default
***************
*** 210,216 ****
  This function calls @var{function} once for each of the associations in
  @var{table}.  The function @var{function} should accept two
  arguments---a @var{key} listed in @var{table}, and its associated
! @var{value}.
  @end defun
  
  @node Defining Hash
--- 212,218 ----
  This function calls @var{function} once for each of the associations in
  @var{table}.  The function @var{function} should accept two
  arguments---a @var{key} listed in @var{table}, and its associated
! @var{value}.  @code{maphash} returns @code{nil}.
  @end defun
  
  @node Defining Hash