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

[Richard M . Stallman]

Index: emacs/lispref/elisp.texi
diff -c emacs/lispref/elisp.texi:1.58 emacs/lispref/elisp.texi:1.59
*** emacs/lispref/elisp.texi:1.58       Tue Jun 14 23:35:05 2005
--- emacs/lispref/elisp.texi    Sat Jun 18 13:47:15 2005
***************
*** 6,12 ****
  
  @c Version of the manual and of Emacs.
  @c Please remember to update the edition number in README as well.
! @set VERSION  2.9
  @set EMACSVER 22.0.50
  
  @dircategory Emacs
--- 6,12 ----
  
  @c Version of the manual and of Emacs.
  @c Please remember to update the edition number in README as well.
! @set VERSION  2.7
  @set EMACSVER 22.0.50
  
  @dircategory Emacs
***************
*** 34,41 ****
  59 Temple Place, Suite 330
  Boston, MA  02111-1307  USA
  
! Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2005,@*
!               2000, 2002 Free Software Foundation, Inc.
  
  Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.1 or
--- 34,41 ----
  59 Temple Place, Suite 330
  Boston, MA  02111-1307  USA
  
! Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998, 1999, @*
!               2000, 2002, 2003, 2004, 2005, Free Software Foundation, Inc.
  
  Permission is granted to copy, distribute and/or modify this document
  under the terms of the GNU Free Documentation License, Version 1.1 or
***************
*** 60,66 ****
  @page
  @vskip 0pt plus 1filll
  Copyright @copyright{} 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998,@*
! 1999, 2000, 2002 Free Software Foundation, Inc.
  
  @sp 2
  Edition @value{VERSION} @*
--- 60,66 ----
  @page
  @vskip 0pt plus 1filll
  Copyright @copyright{} 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998,@*
! 1999, 2000, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
  
  @sp 2
  Edition @value{VERSION} @*
***************
*** 288,293 ****
--- 288,294 ----
  * Modifying Lists::         Storing new pieces into an existing list.
  * Sets And Lists::          A list can represent a finite mathematical set.
  * Association Lists::       A list can represent a finite relation or mapping.
+ * Rings::                   Managing a fixed-size ring of objects.
  
  Modifying Existing List Structure
  
***************
*** 983,988 ****
--- 984,990 ----
  * Datagrams::               UDP network connections.
  * Low-Level Network::       Lower-level but more general function
                                to create connections and servers.
+ * Byte Packing::             Using bindat to pack and unpack binary data.
  
  Receiving Output from Processes