[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Emacs-diffs] Changes to emacs/lispref/objects.texi
From: |
Richard M . Stallman |
Subject: |
[Emacs-diffs] Changes to emacs/lispref/objects.texi |
Date: |
Thu, 15 Sep 2005 09:11:24 -0400 |
Index: emacs/lispref/objects.texi
diff -c emacs/lispref/objects.texi:1.48 emacs/lispref/objects.texi:1.49
*** emacs/lispref/objects.texi:1.48 Wed Aug 10 14:29:00 2005
--- emacs/lispref/objects.texi Thu Sep 15 13:11:24 2005
***************
*** 78,87 ****
In most cases, an object's printed representation is also a read
syntax for the object. However, some types have no read syntax, since
it does not make sense to enter objects of these types as constants in
! a Lisp program. These objects are printed in @dfn{hash notation}: the
! characters @samp{#<} followed by a descriptive string (typically the
! type name followed by the name of the object), and closed with a
! matching @samp{>}. For example:
@example
(current-buffer)
--- 78,87 ----
In most cases, an object's printed representation is also a read
syntax for the object. However, some types have no read syntax, since
it does not make sense to enter objects of these types as constants in
! a Lisp program. These objects are printed in @dfn{hash notation},
! which consists of the characters @samp{#<}, a descriptive string
! (typically the type name followed by the name of the object), and a
! closing @samp{>}. For example:
@example
(current-buffer)
***************
*** 621,626 ****
--- 621,627 ----
@dfn{atoms}.
@cindex parenthesis
+ @cindex @samp{(@dots{})} in lists
The read syntax and printed representation for lists are identical, and
consist of a left parenthesis, an arbitrary number of elements, and a
right parenthesis. Here are examples of lists:
***************
*** 706,712 ****
@end group
@end smallexample
- @cindex @samp{(@dots{})} in lists
@cindex @code{nil} in lists
@cindex empty list
A list with no elements in it is the @dfn{empty list}; it is identical
--- 707,712 ----
***************
*** 749,755 ****
@end group
@end example
! The same list represented in the first box notation looks like this:
@example
@group
--- 749,755 ----
@end group
@end example
! The same list represented in the second box notation looks like this:
@example
@group
***************
*** 776,782 ****
@dfn{Dotted pair notation} is a general syntax for cons cells that
represents the @sc{car} and @sc{cdr} explicitly. In this syntax,
@code{(@var{a} .@: @var{b})} stands for a cons cell whose @sc{car} is
! the object @var{a}, and whose @sc{cdr} is the object @var{b}. Dotted
pair notation is more general than list syntax because the @sc{cdr}
does not have to be a list. However, it is more cumbersome in cases
where list syntax would work. In dotted pair notation, the list
--- 776,782 ----
@dfn{Dotted pair notation} is a general syntax for cons cells that
represents the @sc{car} and @sc{cdr} explicitly. In this syntax,
@code{(@var{a} .@: @var{b})} stands for a cons cell whose @sc{car} is
! the object @var{a} and whose @sc{cdr} is the object @var{b}. Dotted
pair notation is more general than list syntax because the @sc{cdr}
does not have to be a list. However, it is more cumbersome in cases
where list syntax would work. In dotted pair notation, the list
***************
*** 913,921 ****
type of array has its own read syntax; see the following sections for
details.
! The array type is contained in the sequence type and
! contains the string type, the vector type, the bool-vector type, and the
! char-table type.
@node String Type
@subsection String Type
--- 913,921 ----
type of array has its own read syntax; see the following sections for
details.
! The array type is a subset of the sequence type, and contains the
! string type, the vector type, the bool-vector type, and the char-table
! type.
@node String Type
@subsection String Type
***************
*** 1166,1173 ****
A hash table is a very fast kind of lookup table, somewhat like an
alist in that it maps keys to corresponding values, but much faster.
! Hash tables have no read syntax, and
! print using hash notation. @xref{Hash Tables}.
@example
(make-hash-table)
--- 1166,1173 ----
A hash table is a very fast kind of lookup table, somewhat like an
alist in that it maps keys to corresponding values, but much faster.
! Hash tables have no read syntax, and print using hash notation.
! @xref{Hash Tables}, for functions that operate on hash tables.
@example
(make-hash-table)
***************
*** 1607,1613 ****
@node Type Predicates
@section Type Predicates
- @cindex predicates
@cindex type checking
@kindex wrong-type-argument
--- 1607,1612 ----
***************
*** 1942,1947 ****
--- 1941,1947 ----
@end group
@end example
+ @cindex equality of strings
Comparison of strings is case-sensitive, but does not take account of
text properties---it compares only the characters in the strings. For
technical reasons, a unibyte string and a multibyte string are
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Emacs-diffs] Changes to emacs/lispref/objects.texi,
Richard M . Stallman <=