Mercurial > hg > xemacs-beta
annotate man/lispref/objects.texi @ 4792:95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
lisp/ChangeLog addition:
2009-11-08 Aidan Kehoe <kehoea@parhasard.net>
* cl-extra.el (cl-string-vector-equalp)
(cl-bit-vector-vector-equalp, cl-vector-array-equalp)
(cl-hash-table-contents-equalp): New functions, to implement
equalp treating arrays with identical contents as equivalent, as
specified by Common Lisp.
(equalp): Revise this function to implement array equivalence,
and the hash-table equalp behaviour specified by CL.
* cl-macs.el (equalp): Add a compiler macro for this function,
used when one of the arguments is constant, and as such, its type
is known at compile time.
man/ChangeLog addition:
2009-11-08 Aidan Kehoe <kehoea@parhasard.net>
* lispref/objects.texi (Equality Predicates):
Document #'equalp here, as well as #'equal and #'eq.
tests/ChangeLog addition:
2009-12-31 Aidan Kehoe <kehoea@parhasard.net>
* automated/lisp-tests.el:
Test much of the functionality of equalp; add a pointer to Paul
Dietz' ANSI test suite for this function, converted to Emacs
Lisp. Not including the tests themselves in XEmacs because who
owns the copyright on the files is unclear and the GCL people
didn't respond to my queries.
| author | Aidan Kehoe <kehoea@parhasard.net> |
|---|---|
| date | Thu, 31 Dec 2009 15:09:41 +0000 |
| parents | f9104f0e9b91 |
| children | e6dec75ded0e |
| rev | line source |
|---|---|
| 428 | 1 @c -*-texinfo-*- |
| 2 @c This is part of the XEmacs Lisp Reference Manual. | |
| 3 @c Copyright (C) 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc. | |
| 4 @c See the file lispref.texi for copying conditions. | |
| 5 @setfilename ../../info/objects.info | |
| 693 | 6 @node Lisp Data Types, Numbers, Packaging, Top |
| 428 | 7 @chapter Lisp Data Types |
| 8 @cindex object | |
| 9 @cindex Lisp object | |
| 10 @cindex type | |
| 11 @cindex data type | |
| 12 | |
| 13 A Lisp @dfn{object} is a piece of data used and manipulated by Lisp | |
| 14 programs. For our purposes, a @dfn{type} or @dfn{data type} is a set of | |
| 15 possible objects. | |
| 16 | |
| 17 Every object belongs to at least one type. Objects of the same type | |
| 18 have similar structures and may usually be used in the same contexts. | |
| 19 Types can overlap, and objects can belong to two or more types. | |
| 20 Consequently, we can ask whether an object belongs to a particular type, | |
| 21 but not for ``the'' type of an object. | |
| 22 | |
| 23 @cindex primitive type | |
| 24 A few fundamental object types are built into XEmacs. These, from | |
| 25 which all other types are constructed, are called @dfn{primitive types}. | |
| 26 Each object belongs to one and only one primitive type. These types | |
| 27 include @dfn{integer}, @dfn{character} (starting with XEmacs 20.0), | |
| 28 @dfn{float}, @dfn{cons}, @dfn{symbol}, @dfn{string}, @dfn{vector}, | |
| 29 @dfn{bit-vector}, @dfn{subr}, @dfn{compiled-function}, @dfn{hash-table}, | |
| 30 @dfn{range-table}, @dfn{char-table}, @dfn{weak-list}, and several | |
| 31 special types, such as @dfn{buffer}, that are related to editing. | |
| 32 (@xref{Editing Types}.) | |
| 33 | |
| 34 Each primitive type has a corresponding Lisp function that checks | |
| 35 whether an object is a member of that type. | |
| 36 | |
| 37 Note that Lisp is unlike many other languages in that Lisp objects are | |
| 38 @dfn{self-typing}: the primitive type of the object is implicit in the | |
| 39 object itself. For example, if an object is a vector, nothing can treat | |
| 40 it as a number; Lisp knows it is a vector, not a number. | |
| 41 | |
| 42 In most languages, the programmer must declare the data type of each | |
| 43 variable, and the type is known by the compiler but not represented in | |
| 44 the data. Such type declarations do not exist in XEmacs Lisp. A Lisp | |
| 45 variable can have any type of value, and it remembers whatever value | |
| 46 you store in it, type and all. | |
| 47 | |
| 48 This chapter describes the purpose, printed representation, and read | |
| 49 syntax of each of the standard types in Emacs Lisp. Details on how | |
| 50 to use these types can be found in later chapters. | |
| 51 | |
| 52 @menu | |
| 53 * Printed Representation:: How Lisp objects are represented as text. | |
| 54 * Comments:: Comments and their formatting conventions. | |
| 55 * Primitive Types:: List of all primitive types in XEmacs. | |
| 56 * Programming Types:: Types found in all Lisp systems. | |
| 57 * Editing Types:: Types specific to XEmacs. | |
| 58 * Window-System Types:: Types specific to windowing systems. | |
| 59 * Type Predicates:: Tests related to types. | |
| 60 * Equality Predicates:: Tests of equality between any two objects. | |
| 61 @end menu | |
| 62 | |
| 63 @node Printed Representation | |
| 64 @section Printed Representation and Read Syntax | |
| 65 @cindex printed representation | |
| 66 @cindex read syntax | |
| 67 | |
| 68 The @dfn{printed representation} of an object is the format of the | |
| 69 output generated by the Lisp printer (the function @code{prin1}) for | |
| 70 that object. The @dfn{read syntax} of an object is the format of the | |
| 71 input accepted by the Lisp reader (the function @code{read}) for that | |
| 72 object. Most objects have more than one possible read syntax. Some | |
| 73 types of object have no read syntax; except for these cases, the printed | |
| 74 representation of an object is also a read syntax for it. | |
| 75 | |
| 76 In other languages, an expression is text; it has no other form. In | |
| 77 Lisp, an expression is primarily a Lisp object and only secondarily the | |
| 78 text that is the object's read syntax. Often there is no need to | |
| 79 emphasize this distinction, but you must keep it in the back of your | |
| 80 mind, or you will occasionally be very confused. | |
| 81 | |
| 82 @cindex hash notation | |
| 83 Every type has a printed representation. Some types have no read | |
| 84 syntax, since it may not make sense to enter objects of these types | |
| 85 directly in a Lisp program. For example, the buffer type does not have | |
| 86 a read syntax. Objects of these types are printed in @dfn{hash | |
| 87 notation}: the characters @samp{#<} followed by a descriptive string | |
| 88 (typically the type name followed by the name of the object), and closed | |
| 89 with a matching @samp{>}. Hash notation cannot be read at all, so the | |
| 90 Lisp reader signals the error @code{invalid-read-syntax} whenever it | |
| 91 encounters @samp{#<}. | |
| 92 @kindex invalid-read-syntax | |
| 93 | |
| 94 @example | |
| 95 (current-buffer) | |
| 96 @result{} #<buffer "objects.texi"> | |
| 97 @end example | |
| 98 | |
| 99 When you evaluate an expression interactively, the Lisp interpreter | |
| 100 first reads the textual representation of it, producing a Lisp object, | |
| 101 and then evaluates that object (@pxref{Evaluation}). However, | |
| 102 evaluation and reading are separate activities. Reading returns the | |
| 103 Lisp object represented by the text that is read; the object may or may | |
| 104 not be evaluated later. @xref{Input Functions}, for a description of | |
| 105 @code{read}, the basic function for reading objects. | |
| 106 | |
| 107 @node Comments | |
| 108 @section Comments | |
| 109 @cindex comments | |
| 110 @cindex @samp{;} in comment | |
| 111 | |
| 112 A @dfn{comment} is text that is written in a program only for the sake | |
| 113 of humans that read the program, and that has no effect on the meaning | |
| 114 of the program. In Lisp, a semicolon (@samp{;}) starts a comment if it | |
| 115 is not within a string or character constant. The comment continues to | |
| 116 the end of line. The Lisp reader discards comments; they do not become | |
| 117 part of the Lisp objects which represent the program within the Lisp | |
| 118 system. | |
| 119 | |
| 120 The @samp{#@@@var{count}} construct, which skips the next @var{count} | |
| 121 characters, is useful for program-generated comments containing binary | |
| 122 data. The XEmacs Lisp byte compiler uses this in its output files | |
| 123 (@pxref{Byte Compilation}). It isn't meant for source files, however. | |
| 124 | |
| 125 @xref{Comment Tips}, for conventions for formatting comments. | |
| 126 | |
| 127 @node Primitive Types | |
| 128 @section Primitive Types | |
| 129 @cindex primitive types | |
| 130 | |
| 131 For reference, here is a list of all the primitive types that may | |
| 132 exist in XEmacs. Note that some of these types may not exist | |
| 133 in some XEmacs executables; that depends on the options that | |
| 134 XEmacs was configured with. | |
| 135 | |
| 136 @itemize @bullet | |
| 137 @item | |
| 138 bit-vector | |
| 139 @item | |
| 140 buffer | |
| 141 @item | |
| 142 char-table | |
| 143 @item | |
| 144 character | |
| 145 @item | |
| 146 charset | |
| 147 @item | |
| 148 coding-system | |
| 149 @item | |
| 150 cons | |
| 151 @item | |
| 152 color-instance | |
| 153 @item | |
| 154 compiled-function | |
| 155 @item | |
| 156 console | |
| 157 @item | |
| 158 database | |
| 159 @item | |
| 160 device | |
| 161 @item | |
| 162 event | |
| 163 @item | |
| 164 extent | |
| 165 @item | |
| 166 face | |
| 167 @item | |
| 168 float | |
| 169 @item | |
| 170 font-instance | |
| 171 @item | |
| 172 frame | |
| 173 @item | |
| 174 glyph | |
| 175 @item | |
| 176 hash-table | |
| 177 @item | |
| 178 image-instance | |
| 179 @item | |
| 180 integer | |
| 181 @item | |
| 182 keymap | |
| 183 @item | |
| 184 marker | |
| 185 @item | |
| 186 process | |
| 187 @item | |
| 188 range-table | |
| 189 @item | |
| 190 specifier | |
| 191 @item | |
| 192 string | |
| 193 @item | |
| 194 subr | |
| 195 @item | |
| 196 subwindow | |
| 197 @item | |
| 198 symbol | |
| 199 @item | |
| 200 toolbar-button | |
| 201 @item | |
| 202 tooltalk-message | |
| 203 @item | |
| 204 tooltalk-pattern | |
| 205 @item | |
| 206 vector | |
| 207 @item | |
| 208 weak-list | |
| 209 @item | |
| 210 window | |
| 211 @item | |
| 212 window-configuration | |
| 213 @item | |
| 214 x-resource | |
| 215 @end itemize | |
| 216 | |
| 217 In addition, the following special types are created internally | |
| 218 but will never be seen by Lisp code. You may encounter them, | |
| 219 however, if you are debugging XEmacs. The printed representation | |
| 220 of these objects begins @samp{#<INTERNAL EMACS BUG}, which indicates | |
| 221 to the Lisp programmer that he has found an internal bug in XEmacs | |
| 222 if he ever encounters any of these objects. | |
| 223 | |
| 224 @itemize @bullet | |
| 225 @item | |
| 226 char-table-entry | |
| 227 @item | |
| 228 command-builder | |
| 229 @item | |
| 230 extent-auxiliary | |
| 231 @item | |
| 232 extent-info | |
| 233 @item | |
| 234 lcrecord-list | |
| 235 @item | |
| 236 lstream | |
| 237 @item | |
| 238 opaque | |
| 239 @item | |
| 240 opaque-list | |
| 241 @item | |
| 242 popup-data | |
| 243 @item | |
| 244 symbol-value-buffer-local | |
| 245 @item | |
| 246 symbol-value-forward | |
| 247 @item | |
| 248 symbol-value-lisp-magic | |
| 249 @item | |
| 250 symbol-value-varalias | |
| 251 @item | |
| 252 toolbar-data | |
| 253 @end itemize | |
| 254 | |
| 255 @node Programming Types | |
| 256 @section Programming Types | |
| 257 @cindex programming types | |
| 258 | |
| 259 There are two general categories of types in XEmacs Lisp: those having | |
| 260 to do with Lisp programming, and those having to do with editing. The | |
| 261 former exist in many Lisp implementations, in one form or another. The | |
| 262 latter are unique to XEmacs Lisp. | |
| 263 | |
| 264 @menu | |
| 265 * Integer Type:: Numbers without fractional parts. | |
| 266 * Floating Point Type:: Numbers with fractional parts and with a large range. | |
| 267 * Character Type:: The representation of letters, numbers and | |
| 268 control characters. | |
| 269 * Symbol Type:: A multi-use object that refers to a function, | |
| 270 variable, or property list, and has a unique identity. | |
| 271 * Sequence Type:: Both lists and arrays are classified as sequences. | |
| 272 * Cons Cell Type:: Cons cells, and lists (which are made from cons cells). | |
| 273 * Array Type:: Arrays include strings and vectors. | |
| 274 * String Type:: An (efficient) array of characters. | |
| 275 * Vector Type:: One-dimensional arrays. | |
| 276 * Bit Vector Type:: An (efficient) array of bits. | |
| 277 * Function Type:: A piece of executable code you can call from elsewhere. | |
| 278 * Macro Type:: A method of expanding an expression into another | |
| 279 expression, more fundamental but less pretty. | |
| 280 * Primitive Function Type:: A function written in C, callable from Lisp. | |
| 281 * Compiled-Function Type:: A function written in Lisp, then compiled. | |
| 282 * Autoload Type:: A type used for automatically loading seldom-used | |
| 283 functions. | |
| 284 * Char Table Type:: A mapping from characters to Lisp objects. | |
| 285 * Hash Table Type:: A fast mapping between Lisp objects. | |
| 286 * Range Table Type:: A mapping from ranges of integers to Lisp objects. | |
| 287 * Weak List Type:: A list with special garbage-collection properties. | |
| 288 @end menu | |
| 289 | |
| 290 @node Integer Type | |
| 291 @subsection Integer Type | |
| 292 | |
| 293 The range of values for integers in XEmacs Lisp is @minus{}134217728 to | |
| 294 134217727 (28 bits; i.e., | |
| 295 @ifinfo | |
| 296 -2**27 | |
| 297 @end ifinfo | |
| 298 @tex | |
| 299 $-2^{27}$ | |
| 300 @end tex | |
| 301 to | |
| 302 @ifinfo | |
| 303 2**27 - 1) | |
| 304 @end ifinfo | |
| 305 @tex | |
| 306 $2^{28}-1$) | |
| 307 @end tex | |
| 308 on most machines. (Some machines, in particular 64-bit machines such as | |
| 309 the DEC Alpha, may provide a wider range.) It is important to note that | |
| 310 the XEmacs Lisp arithmetic functions do not check for overflow. Thus | |
| 311 @code{(1+ 134217727)} is @minus{}134217728 on most machines. (However, | |
| 312 you @emph{will} get an error if you attempt to read an out-of-range | |
| 313 number using the Lisp reader.) | |
| 314 | |
| 315 The read syntax for integers is a sequence of (base ten) digits with | |
| 316 an optional sign at the beginning. (The printed representation produced | |
| 317 by the Lisp interpreter never has a leading @samp{+}.) | |
| 318 | |
| 319 @example | |
| 320 @group | |
| 321 -1 ; @r{The integer -1.} | |
| 322 1 ; @r{The integer 1.} | |
| 323 +1 ; @r{Also the integer 1.} | |
| 324 268435457 ; @r{Causes an error on a 28-bit implementation.} | |
| 325 @end group | |
| 326 @end example | |
| 327 | |
| 328 @xref{Numbers}, for more information. | |
| 329 | |
| 330 @node Floating Point Type | |
| 331 @subsection Floating Point Type | |
| 332 | |
| 333 XEmacs supports floating point numbers. The precise range of floating | |
| 334 point numbers is machine-specific. | |
| 335 | |
| 336 The printed representation for floating point numbers requires either | |
| 337 a decimal point (with at least one digit following), an exponent, or | |
| 338 both. For example, @samp{1500.0}, @samp{15e2}, @samp{15.0e2}, | |
| 339 @samp{1.5e3}, and @samp{.15e4} are five ways of writing a floating point | |
| 340 number whose value is 1500. They are all equivalent. | |
| 341 | |
| 342 @xref{Numbers}, for more information. | |
| 343 | |
| 344 @node Character Type | |
| 345 @subsection Character Type | |
| 346 @cindex @sc{ascii} character codes | |
| 347 @cindex char-int confoundance disease | |
| 348 | |
| 349 In XEmacs version 19, and in all versions of FSF GNU Emacs, a | |
| 350 @dfn{character} in XEmacs Lisp is nothing more than an integer. | |
| 351 This is yet another holdover from XEmacs Lisp's derivation from | |
| 352 vintage-1980 Lisps; modern versions of Lisp consider this equivalence | |
| 353 a bad idea, and have separate character types. In XEmacs version 20, | |
| 354 the modern convention is followed, and characters are their own | |
| 355 primitive types. (This change was necessary in order for @sc{mule}, | |
| 356 i.e. Asian-language, support to be correctly implemented.) | |
| 357 | |
| 358 Even in XEmacs version 20, remnants of the equivalence between | |
| 359 characters and integers still exist; this is termed the @dfn{char-int | |
| 360 confoundance disease}. In particular, many functions such as @code{eq}, | |
| 361 @code{equal}, and @code{memq} have equivalent functions (@code{old-eq}, | |
| 362 @code{old-equal}, @code{old-memq}, etc.) that pretend like characters | |
| 363 are integers are the same. Byte code compiled under any version 19 | |
| 364 Emacs will have all such functions mapped to their @code{old-} equivalents | |
| 365 when the byte code is read into XEmacs 20. This is to preserve | |
| 440 | 366 compatibility---Emacs 19 converts all constant characters to the equivalent |
| 428 | 367 integer during byte-compilation, and thus there is no other way to preserve |
| 368 byte-code compatibility even if the code has specifically been written | |
| 369 with the distinction between characters and integers in mind. | |
| 370 | |
| 371 Every character has an equivalent integer, called the @dfn{character | |
| 372 code}. For example, the character @kbd{A} is represented as the | |
| 373 @w{integer 65}, following the standard @sc{ascii} representation of | |
| 374 characters. If XEmacs was not compiled with @sc{mule} support, the | |
| 440 | 375 range of this integer will always be 0 to 255---eight bits, or one |
| 428 | 376 byte. (Integers outside this range are accepted but silently truncated; |
| 377 however, you should most decidedly @emph{not} rely on this, because it | |
| 378 will not work under XEmacs with @sc{mule} support.) When @sc{mule} | |
| 379 support is present, the range of character codes is much | |
| 380 larger. (Currently, 19 bits are used.) | |
| 381 | |
| 382 FSF GNU Emacs uses kludgy character codes above 255 to represent | |
| 383 keyboard input of @sc{ascii} characters in combination with certain | |
| 384 modifiers. XEmacs does not use this (a more general mechanism is | |
| 385 used that does not distinguish between @sc{ascii} keys and other | |
| 386 keys), so you will never find character codes above 255 in a | |
| 387 non-@sc{mule} XEmacs. | |
| 388 | |
| 389 Individual characters are not often used in programs. It is far more | |
| 390 common to work with @emph{strings}, which are sequences composed of | |
| 391 characters. @xref{String Type}. | |
| 392 | |
| 393 @cindex read syntax for characters | |
| 394 @cindex printed representation for characters | |
| 395 @cindex syntax for characters | |
| 396 | |
| 397 The read syntax for characters begins with a question mark, followed | |
| 398 by the character (if it's printable) or some symbolic representation of | |
| 399 it. In XEmacs 20, where characters are their own type, this is also the | |
| 400 print representation. In XEmacs 19, however, where characters are | |
| 401 really integers, the printed representation of a character is a decimal | |
| 402 number. This is also a possible read syntax for a character, but | |
| 403 writing characters that way in Lisp programs is a very bad idea. You | |
| 404 should @emph{always} use the special read syntax formats that XEmacs Lisp | |
| 405 provides for characters. | |
| 406 | |
| 407 The usual read syntax for alphanumeric characters is a question mark | |
| 408 followed by the character; thus, @samp{?A} for the character | |
| 409 @kbd{A}, @samp{?B} for the character @kbd{B}, and @samp{?a} for the | |
| 410 character @kbd{a}. | |
| 411 | |
| 412 For example: | |
| 413 | |
| 414 @example | |
| 415 ;; @r{Under XEmacs 20:} | |
| 416 ?Q @result{} ?Q ?q @result{} ?q | |
| 417 (char-int ?Q) @result{} 81 | |
| 418 ;; @r{Under XEmacs 19:} | |
| 419 ?Q @result{} 81 ?q @result{} 113 | |
| 420 @end example | |
| 421 | |
| 422 You can use the same syntax for punctuation characters, but it is | |
| 423 often a good idea to add a @samp{\} so that the Emacs commands for | |
| 424 editing Lisp code don't get confused. For example, @samp{?\ } is the | |
| 425 way to write the space character. If the character is @samp{\}, you | |
| 426 @emph{must} use a second @samp{\} to quote it: @samp{?\\}. XEmacs 20 | |
| 427 always prints punctuation characters with a @samp{\} in front of them, | |
| 428 to avoid confusion. | |
| 429 | |
| 430 @cindex whitespace | |
| 431 @cindex bell character | |
| 432 @cindex @samp{\a} | |
| 433 @cindex backspace | |
| 434 @cindex @samp{\b} | |
| 435 @cindex tab | |
| 436 @cindex @samp{\t} | |
| 437 @cindex vertical tab | |
| 438 @cindex @samp{\v} | |
| 439 @cindex formfeed | |
| 440 @cindex @samp{\f} | |
| 441 @cindex newline | |
| 442 @cindex @samp{\n} | |
| 443 @cindex return | |
| 444 @cindex @samp{\r} | |
| 445 @cindex escape | |
| 446 @cindex @samp{\e} | |
| 447 You can express the characters Control-g, backspace, tab, newline, | |
| 448 vertical tab, formfeed, return, and escape as @samp{?\a}, @samp{?\b}, | |
| 449 @samp{?\t}, @samp{?\n}, @samp{?\v}, @samp{?\f}, @samp{?\r}, @samp{?\e}, | |
| 450 respectively. Their character codes are 7, 8, 9, 10, 11, 12, 13, and 27 | |
| 451 in decimal. Thus, | |
| 452 | |
| 453 @example | |
| 454 ;; @r{Under XEmacs 20:} | |
| 455 ?\a @result{} ?\^G ; @r{@kbd{C-g}} | |
| 456 (char-int ?\a) @result{} 7 | |
| 457 ?\b @result{} ?\^H ; @r{backspace, @key{BS}, @kbd{C-h}} | |
| 458 (char-int ?\b) @result{} 8 | |
| 459 ?\t @result{} ?\t ; @r{tab, @key{TAB}, @kbd{C-i}} | |
| 460 (char-int ?\t) @result{} 9 | |
| 461 ?\n @result{} ?\n ; @r{newline, @key{LFD}, @kbd{C-j}} | |
| 462 ?\v @result{} ?\^K ; @r{vertical tab, @kbd{C-k}} | |
| 463 ?\f @result{} ?\^L ; @r{formfeed character, @kbd{C-l}} | |
| 464 ?\r @result{} ?\r ; @r{carriage return, @key{RET}, @kbd{C-m}} | |
| 465 ?\e @result{} ?\^[ ; @r{escape character, @key{ESC}, @kbd{C-[}} | |
| 466 ?\\ @result{} ?\\ ; @r{backslash character, @kbd{\}} | |
| 467 ;; @r{Under XEmacs 19:} | |
| 468 ?\a @result{} 7 ; @r{@kbd{C-g}} | |
| 469 ?\b @result{} 8 ; @r{backspace, @key{BS}, @kbd{C-h}} | |
| 470 ?\t @result{} 9 ; @r{tab, @key{TAB}, @kbd{C-i}} | |
| 471 ?\n @result{} 10 ; @r{newline, @key{LFD}, @kbd{C-j}} | |
| 472 ?\v @result{} 11 ; @r{vertical tab, @kbd{C-k}} | |
| 473 ?\f @result{} 12 ; @r{formfeed character, @kbd{C-l}} | |
| 474 ?\r @result{} 13 ; @r{carriage return, @key{RET}, @kbd{C-m}} | |
| 475 ?\e @result{} 27 ; @r{escape character, @key{ESC}, @kbd{C-[}} | |
| 476 ?\\ @result{} 92 ; @r{backslash character, @kbd{\}} | |
| 477 @end example | |
| 478 | |
| 479 @cindex escape sequence | |
| 480 These sequences which start with backslash are also known as | |
| 481 @dfn{escape sequences}, because backslash plays the role of an escape | |
| 482 character; this usage has nothing to do with the character @key{ESC}. | |
| 483 | |
| 484 @cindex control characters | |
| 485 Control characters may be represented using yet another read syntax. | |
| 486 This consists of a question mark followed by a backslash, caret, and the | |
| 487 corresponding non-control character, in either upper or lower case. For | |
| 488 example, both @samp{?\^I} and @samp{?\^i} are valid read syntax for the | |
| 489 character @kbd{C-i}, the character whose value is 9. | |
| 490 | |
| 491 Instead of the @samp{^}, you can use @samp{C-}; thus, @samp{?\C-i} is | |
| 492 equivalent to @samp{?\^I} and to @samp{?\^i}: | |
| 493 | |
| 494 @example | |
| 495 ;; @r{Under XEmacs 20:} | |
| 496 ?\^I @result{} ?\t ?\C-I @result{} ?\t | |
| 497 (char-int ?\^I) @result{} 9 | |
| 498 ;; @r{Under XEmacs 19:} | |
| 499 ?\^I @result{} 9 ?\C-I @result{} 9 | |
| 500 @end example | |
| 501 | |
| 502 There is also a character read syntax beginning with @samp{\M-}. This | |
| 503 sets the high bit of the character code (same as adding 128 to the | |
| 504 character code). For example, @samp{?\M-A} stands for the character | |
| 505 with character code 193, or 128 plus 65. You should @emph{not} use this | |
| 506 syntax in your programs. It is a holdover of yet another confoundance | |
| 507 disease from earlier Emacsen. (This was used to represent keyboard input | |
| 508 with the @key{META} key set, thus the @samp{M}; however, it conflicts | |
| 509 with the legitimate @sc{iso}-8859-1 interpretation of the character code. | |
| 510 For example, character code 193 is a lowercase @samp{a} with an acute | |
| 511 accent, in @sc{iso}-8859-1.) | |
| 512 | |
| 3367 | 513 @cindex unicode character escape |
| 514 From version 21.5.25 onwards, XEmacs provides a syntax for specifying | |
| 515 characters by their Unicode code points. @samp{?\uABCD} will give you | |
| 516 an XEmacs character that maps to the code point @samp{U+ABCD} in | |
| 517 Unicode-based representations (UTF-8 text files, Unicode-oriented fonts, | |
| 518 etc.) Just as in the C# language, there is a slightly different syntax | |
| 519 for specifying characters with code points above @samp{#xFFFF}; | |
| 520 @samp{\U00ABCDEF} will give you an XEmacs character that maps to the | |
| 521 code point @samp{U+ABCDEF} in Unicode-based representations, if such an | |
| 522 XEmacs character exists. | |
| 523 | |
| 524 Unlike in C#, while this syntax is available for character literals, | |
| 525 and (see later) in strings, it is not available elsewhere in your Lisp | |
| 526 source code. | |
| 527 | |
| 428 | 528 @ignore @c None of this crap applies to XEmacs. |
| 529 For use in strings and buffers, you are limited to the control | |
| 530 characters that exist in @sc{ascii}, but for keyboard input purposes, | |
| 531 you can turn any character into a control character with @samp{C-}. The | |
| 532 character codes for these non-@sc{ascii} control characters include the | |
| 533 @iftex | |
| 534 $2^{26}$ | |
| 535 @end iftex | |
| 536 @ifinfo | |
| 537 2**26 | |
| 538 @end ifinfo | |
| 539 bit as well as the code for the corresponding non-control | |
| 540 character. Ordinary terminals have no way of generating non-@sc{ASCII} | |
| 541 control characters, but you can generate them straightforwardly using an | |
| 542 X terminal. | |
| 543 | |
| 544 For historical reasons, Emacs treats the @key{DEL} character as | |
| 545 the control equivalent of @kbd{?}: | |
| 546 | |
| 547 @example | |
| 548 ?\^? @result{} 127 ?\C-? @result{} 127 | |
| 549 @end example | |
| 550 | |
| 551 @noindent | |
| 552 As a result, it is currently not possible to represent the character | |
| 553 @kbd{Control-?}, which is a meaningful input character under X. It is | |
| 554 not easy to change this as various Lisp files refer to @key{DEL} in this | |
| 555 way. | |
| 556 | |
| 557 For representing control characters to be found in files or strings, | |
| 558 we recommend the @samp{^} syntax; for control characters in keyboard | |
| 559 input, we prefer the @samp{C-} syntax. This does not affect the meaning | |
| 560 of the program, but may guide the understanding of people who read it. | |
| 561 | |
| 562 @cindex meta characters | |
| 563 A @dfn{meta character} is a character typed with the @key{META} | |
| 564 modifier key. The integer that represents such a character has the | |
| 565 @iftex | |
| 566 $2^{27}$ | |
| 567 @end iftex | |
| 568 @ifinfo | |
| 569 2**27 | |
| 570 @end ifinfo | |
| 571 bit set (which on most machines makes it a negative number). We | |
| 572 use high bits for this and other modifiers to make possible a wide range | |
| 573 of basic character codes. | |
| 574 | |
| 575 In a string, the | |
| 576 @iftex | |
| 577 $2^{7}$ | |
| 578 @end iftex | |
| 579 @ifinfo | |
| 580 2**7 | |
| 581 @end ifinfo | |
| 582 bit indicates a meta character, so the meta | |
| 583 characters that can fit in a string have codes in the range from 128 to | |
| 584 255, and are the meta versions of the ordinary @sc{ASCII} characters. | |
| 585 (In Emacs versions 18 and older, this convention was used for characters | |
| 586 outside of strings as well.) | |
| 587 | |
| 588 The read syntax for meta characters uses @samp{\M-}. For example, | |
| 589 @samp{?\M-A} stands for @kbd{M-A}. You can use @samp{\M-} together with | |
| 590 octal character codes (see below), with @samp{\C-}, or with any other | |
| 591 syntax for a character. Thus, you can write @kbd{M-A} as @samp{?\M-A}, | |
| 592 or as @samp{?\M-\101}. Likewise, you can write @kbd{C-M-b} as | |
| 593 @samp{?\M-\C-b}, @samp{?\C-\M-b}, or @samp{?\M-\002}. | |
| 594 | |
| 595 The case of an ordinary letter is indicated by its character code as | |
| 596 part of @sc{ASCII}, but @sc{ASCII} has no way to represent whether a | |
| 597 control character is upper case or lower case. Emacs uses the | |
| 598 @iftex | |
| 599 $2^{25}$ | |
| 600 @end iftex | |
| 601 @ifinfo | |
| 602 2**25 | |
| 603 @end ifinfo | |
| 604 bit to indicate that the shift key was used for typing a control | |
| 605 character. This distinction is possible only when you use X terminals | |
| 606 or other special terminals; ordinary terminals do not indicate the | |
| 607 distinction to the computer in any way. | |
| 608 | |
| 609 @cindex hyper characters | |
| 610 @cindex super characters | |
| 611 @cindex alt characters | |
| 612 The X Window System defines three other modifier bits that can be set | |
| 613 in a character: @dfn{hyper}, @dfn{super} and @dfn{alt}. The syntaxes | |
| 614 for these bits are @samp{\H-}, @samp{\s-} and @samp{\A-}. Thus, | |
| 615 @samp{?\H-\M-\A-x} represents @kbd{Alt-Hyper-Meta-x}. | |
| 616 @iftex | |
| 617 Numerically, the | |
| 618 bit values are $2^{22}$ for alt, $2^{23}$ for super and $2^{24}$ for hyper. | |
| 619 @end iftex | |
| 620 @ifinfo | |
| 621 Numerically, the | |
| 622 bit values are 2**22 for alt, 2**23 for super and 2**24 for hyper. | |
| 623 @end ifinfo | |
| 624 @end ignore | |
| 625 | |
| 626 @cindex @samp{?} in character constant | |
| 627 @cindex question mark in character constant | |
| 628 @cindex @samp{\} in character constant | |
| 629 @cindex backslash in character constant | |
| 630 @cindex octal character code | |
| 1549 | 631 @cindex hexadecimal character code |
| 3367 | 632 |
| 1549 | 633 Finally, there are two read syntaxes involving character codes. |
| 634 It is not possible to represent multibyte or wide characters in this | |
| 635 way; the permissible range of codes is from 0 to 255 (@emph{i.e.}, | |
| 636 @samp{0377} octal or @samp{0xFF} hexadecimal). If you wish to convert | |
| 637 code points to other characters, you must use the @samp{make-char} or | |
| 638 @samp{unicode-to-char} primitives in Mule. (Non-Mule XEmacsen cannot | |
| 639 represent codes out of that range at all, although you can set the font | |
| 640 to a registry other than ISO 8859/1 to get the appearance of a greater | |
| 641 range of characters.) Although these syntaxes can represent any | |
| 642 @sc{ascii} or Latin-1 character, they are preferred only when the | |
| 643 precise integral value is more important than the @sc{ascii} | |
| 644 representation. | |
| 645 | |
| 646 The first consists of a question mark | |
| 428 | 647 followed by a backslash and the character code in octal (up to three |
| 648 octal digits); thus, @samp{?\101} for the character @kbd{A}, | |
| 649 @samp{?\001} for the character @kbd{C-a}, and @code{?\002} for the | |
|
4486
f9104f0e9b91
Document the error on over-long hex character constants.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4472
diff
changeset
|
650 character @kbd{C-b}. The reader will finalize the character and start |
|
f9104f0e9b91
Document the error on over-long hex character constants.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4472
diff
changeset
|
651 reading the next token when a non-octal-digit is encountered or three |
|
f9104f0e9b91
Document the error on over-long hex character constants.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4472
diff
changeset
|
652 octal digits are read. |
| 1549 | 653 |
| 654 The second consists of a question mark followed by a backslash, the | |
| 655 character @samp{x}, and the character code in hexadecimal (up to two | |
| 656 hexadecimal digits); thus, @samp{?\x41} for the character @kbd{A}, | |
| 657 @samp{?\x1} for the character @kbd{C-a}, and @code{?\x2} for the | |
|
4486
f9104f0e9b91
Document the error on over-long hex character constants.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4472
diff
changeset
|
658 character @kbd{C-b}. If more than two hexadecimal codes are given, the |
|
f9104f0e9b91
Document the error on over-long hex character constants.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4472
diff
changeset
|
659 reader signals an error. |
| 428 | 660 |
| 661 @example | |
| 662 @group | |
| 663 ;; @r{Under XEmacs 20:} | |
| 664 ?\012 @result{} ?\n ?\n @result{} ?\n ?\C-j @result{} ?\n | |
| 1549 | 665 ?\101 @result{} ?A ?A @result{} ?A ?\x0A @result{} ?\n |
| 666 ?\x41 @result{} ?A '(?\xAZ) @result{} '(?\n Z) '(?\0123) @result{} (?\n 3) | |
| 428 | 667 @end group |
| 668 @group | |
| 669 ;; @r{Under XEmacs 19:} | |
| 670 ?\012 @result{} 10 ?\n @result{} 10 ?\C-j @result{} 10 | |
| 671 ?\101 @result{} 65 ?A @result{} 65 | |
| 1549 | 672 ;; ?\x41 @r{is a syntax error.} |
| 428 | 673 @end group |
| 674 @end example | |
| 675 | |
| 676 A backslash is allowed, and harmless, preceding any character without | |
| 677 a special escape meaning; thus, @samp{?\+} is equivalent to @samp{?+}. | |
| 678 There is no reason to add a backslash before most characters. However, | |
| 679 you should add a backslash before any of the characters | |
| 680 @samp{()\|;'`"#.,} to avoid confusing the Emacs commands for editing | |
| 681 Lisp code. Also add a backslash before whitespace characters such as | |
| 682 space, tab, newline and formfeed. However, it is cleaner to use one of | |
| 683 the easily readable escape sequences, such as @samp{\t}, instead of an | |
| 684 actual whitespace character such as a tab. | |
| 685 | |
| 686 @node Symbol Type | |
| 687 @subsection Symbol Type | |
| 688 | |
| 689 A @dfn{symbol} in XEmacs Lisp is an object with a name. The symbol | |
| 690 name serves as the printed representation of the symbol. In ordinary | |
| 691 use, the name is unique---no two symbols have the same name. | |
| 692 | |
| 693 A symbol can serve as a variable, as a function name, or to hold a | |
| 694 property list. Or it may serve only to be distinct from all other Lisp | |
| 695 objects, so that its presence in a data structure may be recognized | |
| 696 reliably. In a given context, usually only one of these uses is | |
| 697 intended. But you can use one symbol in all of these ways, | |
| 698 independently. | |
| 699 | |
| 700 @cindex @samp{\} in symbols | |
| 701 @cindex backslash in symbols | |
| 702 A symbol name can contain any characters whatever. Most symbol names | |
| 703 are written with letters, digits, and the punctuation characters | |
| 704 @samp{-+=*/}. Such names require no special punctuation; the characters | |
| 705 of the name suffice as long as the name does not look like a number. | |
| 706 (If it does, write a @samp{\} at the beginning of the name to force | |
| 707 interpretation as a symbol.) The characters @samp{_~!@@$%^&:<>@{@}} are | |
| 708 less often used but also require no special punctuation. Any other | |
| 709 characters may be included in a symbol's name by escaping them with a | |
| 710 backslash. In contrast to its use in strings, however, a backslash in | |
| 711 the name of a symbol simply quotes the single character that follows the | |
| 712 backslash. For example, in a string, @samp{\t} represents a tab | |
| 713 character; in the name of a symbol, however, @samp{\t} merely quotes the | |
| 714 letter @kbd{t}. To have a symbol with a tab character in its name, you | |
| 715 must actually use a tab (preceded with a backslash). But it's rare to | |
| 716 do such a thing. | |
| 717 | |
| 718 @cindex CL note---case of letters | |
| 719 @quotation | |
| 720 @b{Common Lisp note:} In Common Lisp, lower case letters are always | |
| 721 ``folded'' to upper case, unless they are explicitly escaped. In Emacs | |
| 722 Lisp, upper case and lower case letters are distinct. | |
| 723 @end quotation | |
| 724 | |
| 725 Here are several examples of symbol names. Note that the @samp{+} in | |
| 726 the fifth example is escaped to prevent it from being read as a number. | |
| 727 This is not necessary in the sixth example because the rest of the name | |
| 728 makes it invalid as a number. | |
| 729 | |
| 730 @example | |
| 731 @group | |
| 732 foo ; @r{A symbol named @samp{foo}.} | |
| 733 FOO ; @r{A symbol named @samp{FOO}, different from @samp{foo}.} | |
| 734 char-to-string ; @r{A symbol named @samp{char-to-string}.} | |
| 735 @end group | |
| 736 @group | |
| 737 1+ ; @r{A symbol named @samp{1+}} | |
| 738 ; @r{(not @samp{+1}, which is an integer).} | |
| 739 @end group | |
| 740 @group | |
| 741 \+1 ; @r{A symbol named @samp{+1}} | |
| 742 ; @r{(not a very readable name).} | |
| 743 @end group | |
| 744 @group | |
| 745 \(*\ 1\ 2\) ; @r{A symbol named @samp{(* 1 2)} (a worse name).} | |
| 746 @c the @'s in this next line use up three characters, hence the | |
| 747 @c apparent misalignment of the comment. | |
| 748 +-*/_~!@@$%^&=:<>@{@} ; @r{A symbol named @samp{+-*/_~!@@$%^&=:<>@{@}}.} | |
| 749 ; @r{These characters need not be escaped.} | |
| 750 @end group | |
| 751 @end example | |
| 752 | |
| 753 @node Sequence Type | |
| 754 @subsection Sequence Types | |
| 755 | |
| 756 A @dfn{sequence} is a Lisp object that represents an ordered set of | |
| 757 elements. There are two kinds of sequence in XEmacs Lisp, lists and | |
| 758 arrays. Thus, an object of type list or of type array is also | |
| 759 considered a sequence. | |
| 760 | |
| 761 Arrays are further subdivided into strings, vectors, and bit vectors. | |
| 762 Vectors can hold elements of any type, but string elements must be | |
| 763 characters, and bit vector elements must be either 0 or 1. However, the | |
| 764 characters in a string can have extents (@pxref{Extents}) and text | |
| 765 properties (@pxref{Text Properties}) like characters in a buffer; | |
| 766 vectors do not support extents or text properties even when their | |
| 767 elements happen to be characters. | |
| 768 | |
| 769 Lists, strings, vectors, and bit vectors are different, but they have | |
| 770 important similarities. For example, all have a length @var{l}, and all | |
| 771 have elements which can be indexed from zero to @var{l} minus one. | |
| 772 Also, several functions, called sequence functions, accept any kind of | |
| 773 sequence. For example, the function @code{elt} can be used to extract | |
| 774 an element of a sequence, given its index. @xref{Sequences Arrays | |
| 775 Vectors}. | |
| 776 | |
| 777 It is impossible to read the same sequence twice, since sequences are | |
| 778 always created anew upon reading. If you read the read syntax for a | |
| 779 sequence twice, you get two sequences with equal contents. There is one | |
| 780 exception: the empty list @code{()} always stands for the same object, | |
| 781 @code{nil}. | |
| 782 | |
| 783 @node Cons Cell Type | |
| 784 @subsection Cons Cell and List Types | |
| 785 @cindex address field of register | |
| 786 @cindex decrement field of register | |
| 787 | |
| 788 A @dfn{cons cell} is an object comprising two pointers named the | |
| 789 @sc{car} and the @sc{cdr}. Each of them can point to any Lisp object. | |
| 790 | |
| 791 A @dfn{list} is a series of cons cells, linked together so that the | |
| 792 @sc{cdr} of each cons cell points either to another cons cell or to the | |
| 793 empty list. @xref{Lists}, for functions that work on lists. Because | |
| 794 most cons cells are used as part of lists, the phrase @dfn{list | |
| 795 structure} has come to refer to any structure made out of cons cells. | |
| 796 | |
| 797 The names @sc{car} and @sc{cdr} have only historical meaning now. The | |
| 798 original Lisp implementation ran on an @w{IBM 704} computer which | |
| 799 divided words into two parts, called the ``address'' part and the | |
| 800 ``decrement''; @sc{car} was an instruction to extract the contents of | |
| 801 the address part of a register, and @sc{cdr} an instruction to extract | |
| 802 the contents of the decrement. By contrast, ``cons cells'' are named | |
| 803 for the function @code{cons} that creates them, which in turn is named | |
| 804 for its purpose, the construction of cells. | |
| 805 | |
| 806 @cindex atom | |
| 807 Because cons cells are so central to Lisp, we also have a word for | |
| 808 ``an object which is not a cons cell''. These objects are called | |
| 809 @dfn{atoms}. | |
| 810 | |
| 811 @cindex parenthesis | |
| 812 The read syntax and printed representation for lists are identical, and | |
| 813 consist of a left parenthesis, an arbitrary number of elements, and a | |
| 814 right parenthesis. | |
| 815 | |
| 816 Upon reading, each object inside the parentheses becomes an element | |
| 817 of the list. That is, a cons cell is made for each element. The | |
| 818 @sc{car} of the cons cell points to the element, and its @sc{cdr} points | |
| 819 to the next cons cell of the list, which holds the next element in the | |
| 820 list. The @sc{cdr} of the last cons cell is set to point to @code{nil}. | |
| 821 | |
| 822 @cindex box diagrams, for lists | |
| 823 @cindex diagrams, boxed, for lists | |
| 824 A list can be illustrated by a diagram in which the cons cells are | |
| 825 shown as pairs of boxes. (The Lisp reader cannot read such an | |
| 826 illustration; unlike the textual notation, which can be understood by | |
| 827 both humans and computers, the box illustrations can be understood only | |
| 828 by humans.) The following represents the three-element list @code{(rose | |
| 829 violet buttercup)}: | |
| 830 | |
| 831 @example | |
| 832 @group | |
| 833 ___ ___ ___ ___ ___ ___ | |
| 834 |___|___|--> |___|___|--> |___|___|--> nil | |
| 835 | | | | |
| 836 | | | | |
| 837 --> rose --> violet --> buttercup | |
| 838 @end group | |
| 839 @end example | |
| 840 | |
| 841 In this diagram, each box represents a slot that can refer to any Lisp | |
| 842 object. Each pair of boxes represents a cons cell. Each arrow is a | |
| 843 reference to a Lisp object, either an atom or another cons cell. | |
| 844 | |
| 845 In this example, the first box, the @sc{car} of the first cons cell, | |
| 846 refers to or ``contains'' @code{rose} (a symbol). The second box, the | |
| 847 @sc{cdr} of the first cons cell, refers to the next pair of boxes, the | |
| 848 second cons cell. The @sc{car} of the second cons cell refers to | |
| 849 @code{violet} and the @sc{cdr} refers to the third cons cell. The | |
| 850 @sc{cdr} of the third (and last) cons cell refers to @code{nil}. | |
| 851 | |
| 852 Here is another diagram of the same list, @code{(rose violet | |
| 853 buttercup)}, sketched in a different manner: | |
| 854 | |
| 855 @smallexample | |
| 856 @group | |
| 857 --------------- ---------------- ------------------- | |
| 858 | car | cdr | | car | cdr | | car | cdr | | |
| 859 | rose | o-------->| violet | o-------->| buttercup | nil | | |
| 860 | | | | | | | | | | |
| 861 --------------- ---------------- ------------------- | |
| 862 @end group | |
| 863 @end smallexample | |
| 864 | |
| 865 @cindex @samp{(@dots{})} in lists | |
| 866 @cindex @code{nil} in lists | |
| 867 @cindex empty list | |
| 868 A list with no elements in it is the @dfn{empty list}; it is identical | |
| 869 to the symbol @code{nil}. In other words, @code{nil} is both a symbol | |
| 870 and a list. | |
| 871 | |
| 872 Here are examples of lists written in Lisp syntax: | |
| 873 | |
| 874 @example | |
| 875 (A 2 "A") ; @r{A list of three elements.} | |
| 876 () ; @r{A list of no elements (the empty list).} | |
| 877 nil ; @r{A list of no elements (the empty list).} | |
| 878 ("A ()") ; @r{A list of one element: the string @code{"A ()"}.} | |
| 879 (A ()) ; @r{A list of two elements: @code{A} and the empty list.} | |
| 880 (A nil) ; @r{Equivalent to the previous.} | |
| 881 ((A B C)) ; @r{A list of one element} | |
| 882 ; @r{(which is a list of three elements).} | |
| 883 @end example | |
| 884 | |
| 885 Here is the list @code{(A ())}, or equivalently @code{(A nil)}, | |
| 886 depicted with boxes and arrows: | |
| 887 | |
| 888 @example | |
| 889 @group | |
| 890 ___ ___ ___ ___ | |
| 891 |___|___|--> |___|___|--> nil | |
| 892 | | | |
| 893 | | | |
| 894 --> A --> nil | |
| 895 @end group | |
| 896 @end example | |
| 897 | |
| 898 @menu | |
| 899 * Dotted Pair Notation:: An alternative syntax for lists. | |
| 900 * Association List Type:: A specially constructed list. | |
| 901 @end menu | |
| 902 | |
| 903 @node Dotted Pair Notation | |
| 904 @subsubsection Dotted Pair Notation | |
| 905 @cindex dotted pair notation | |
| 906 @cindex @samp{.} in lists | |
| 907 | |
| 908 @dfn{Dotted pair notation} is an alternative syntax for cons cells | |
| 909 that represents the @sc{car} and @sc{cdr} explicitly. In this syntax, | |
| 910 @code{(@var{a} .@: @var{b})} stands for a cons cell whose @sc{car} is | |
| 911 the object @var{a}, and whose @sc{cdr} is the object @var{b}. Dotted | |
| 912 pair notation is therefore more general than list syntax. In the dotted | |
| 913 pair notation, the list @samp{(1 2 3)} is written as @samp{(1 . (2 . (3 | |
| 914 . nil)))}. For @code{nil}-terminated lists, the two notations produce | |
| 915 the same result, but list notation is usually clearer and more | |
| 916 convenient when it is applicable. When printing a list, the dotted pair | |
| 917 notation is only used if the @sc{cdr} of a cell is not a list. | |
| 918 | |
| 919 Here's how box notation can illustrate dotted pairs. This example | |
| 920 shows the pair @code{(rose . violet)}: | |
| 921 | |
| 922 @example | |
| 923 @group | |
| 924 ___ ___ | |
| 925 |___|___|--> violet | |
| 926 | | |
| 927 | | |
| 928 --> rose | |
| 929 @end group | |
| 930 @end example | |
| 931 | |
| 932 Dotted pair notation can be combined with list notation to represent a | |
| 933 chain of cons cells with a non-@code{nil} final @sc{cdr}. For example, | |
| 934 @code{(rose violet . buttercup)} is equivalent to @code{(rose . (violet | |
| 935 . buttercup))}. The object looks like this: | |
| 936 | |
| 937 @example | |
| 938 @group | |
| 939 ___ ___ ___ ___ | |
| 940 |___|___|--> |___|___|--> buttercup | |
| 941 | | | |
| 942 | | | |
| 943 --> rose --> violet | |
| 944 @end group | |
| 945 @end example | |
| 946 | |
| 947 These diagrams make it evident why @w{@code{(rose .@: violet .@: | |
| 948 buttercup)}} is invalid syntax; it would require a cons cell that has | |
| 949 three parts rather than two. | |
| 950 | |
| 951 The list @code{(rose violet)} is equivalent to @code{(rose . (violet))} | |
| 952 and looks like this: | |
| 953 | |
| 954 @example | |
| 955 @group | |
| 956 ___ ___ ___ ___ | |
| 957 |___|___|--> |___|___|--> nil | |
| 958 | | | |
| 959 | | | |
| 960 --> rose --> violet | |
| 961 @end group | |
| 962 @end example | |
| 963 | |
| 964 Similarly, the three-element list @code{(rose violet buttercup)} | |
| 965 is equivalent to @code{(rose . (violet . (buttercup)))}. | |
| 966 @ifinfo | |
| 967 It looks like this: | |
| 968 | |
| 969 @example | |
| 970 @group | |
| 971 ___ ___ ___ ___ ___ ___ | |
| 972 |___|___|--> |___|___|--> |___|___|--> nil | |
| 973 | | | | |
| 974 | | | | |
| 975 --> rose --> violet --> buttercup | |
| 976 @end group | |
| 977 @end example | |
| 978 @end ifinfo | |
| 979 | |
| 980 @node Association List Type | |
| 981 @subsubsection Association List Type | |
| 982 | |
| 983 An @dfn{association list} or @dfn{alist} is a specially-constructed | |
| 984 list whose elements are cons cells. In each element, the @sc{car} is | |
| 985 considered a @dfn{key}, and the @sc{cdr} is considered an | |
| 986 @dfn{associated value}. (In some cases, the associated value is stored | |
| 987 in the @sc{car} of the @sc{cdr}.) Association lists are often used as | |
| 988 stacks, since it is easy to add or remove associations at the front of | |
| 989 the list. | |
| 990 | |
| 991 For example, | |
| 992 | |
| 993 @example | |
| 994 (setq alist-of-colors | |
| 995 '((rose . red) (lily . white) (buttercup . yellow))) | |
| 996 @end example | |
| 997 | |
| 998 @noindent | |
| 999 sets the variable @code{alist-of-colors} to an alist of three elements. In the | |
| 1000 first element, @code{rose} is the key and @code{red} is the value. | |
| 1001 | |
| 1002 @xref{Association Lists}, for a further explanation of alists and for | |
| 1003 functions that work on alists. | |
| 1004 | |
| 1005 @node Array Type | |
| 1006 @subsection Array Type | |
| 1007 | |
| 1008 An @dfn{array} is composed of an arbitrary number of slots for | |
| 1009 referring to other Lisp objects, arranged in a contiguous block of | |
| 1010 memory. Accessing any element of an array takes the same amount of | |
| 1011 time. In contrast, accessing an element of a list requires time | |
| 1012 proportional to the position of the element in the list. (Elements at | |
| 1013 the end of a list take longer to access than elements at the beginning | |
| 1014 of a list.) | |
| 1015 | |
| 1016 XEmacs defines three types of array, strings, vectors, and bit | |
| 1017 vectors. A string is an array of characters, a vector is an array of | |
| 1018 arbitrary objects, and a bit vector is an array of 1's and 0's. All are | |
| 1019 one-dimensional. (Most other programming languages support | |
| 1020 multidimensional arrays, but they are not essential; you can get the | |
| 1021 same effect with an array of arrays.) Each type of array has its own | |
| 1022 read syntax; see @ref{String Type}, @ref{Vector Type}, and @ref{Bit | |
| 1023 Vector Type}. | |
| 1024 | |
| 1025 An array may have any length up to the largest integer; but once | |
| 1026 created, it has a fixed size. The first element of an array has index | |
| 1027 zero, the second element has index 1, and so on. This is called | |
| 1028 @dfn{zero-origin} indexing. For example, an array of four elements has | |
| 1029 indices 0, 1, 2, @w{and 3}. | |
| 1030 | |
| 1031 The array type is contained in the sequence type and contains the | |
| 1032 string type, the vector type, and the bit vector type. | |
| 1033 | |
| 1034 @node String Type | |
| 1035 @subsection String Type | |
| 1036 | |
| 1037 A @dfn{string} is an array of characters. Strings are used for many | |
| 1038 purposes in XEmacs, as can be expected in a text editor; for example, as | |
| 1039 the names of Lisp symbols, as messages for the user, and to represent | |
| 1040 text extracted from buffers. Strings in Lisp are constants: evaluation | |
| 1041 of a string returns the same string. | |
| 1042 | |
| 1043 @cindex @samp{"} in strings | |
| 1044 @cindex double-quote in strings | |
| 1045 @cindex @samp{\} in strings | |
| 1046 @cindex backslash in strings | |
| 1047 The read syntax for strings is a double-quote, an arbitrary number of | |
| 1048 characters, and another double-quote, @code{"like this"}. The Lisp | |
| 1049 reader accepts the same formats for reading the characters of a string | |
| 1050 as it does for reading single characters (without the question mark that | |
| 1051 begins a character literal). You can enter a nonprinting character such | |
| 1052 as tab or @kbd{C-a} using the convenient escape sequences, like this: | |
| 1053 @code{"\t, \C-a"}. You can include a double-quote in a string by | |
| 1054 preceding it with a backslash; thus, @code{"\""} is a string containing | |
| 1055 just a single double-quote character. (@xref{Character Type}, for a | |
| 1056 description of the read syntax for characters.) | |
| 1057 | |
| 1058 @ignore @c More ill-conceived FSF Emacs crap. | |
| 1059 If you use the @samp{\M-} syntax to indicate a meta character in a | |
| 1060 string constant, this sets the | |
| 1061 @iftex | |
| 1062 $2^{7}$ | |
| 1063 @end iftex | |
| 1064 @ifinfo | |
| 1065 2**7 | |
| 1066 @end ifinfo | |
| 1067 bit of the character in the string. | |
| 1068 This is not the same representation that the meta modifier has in a | |
| 1069 character on its own (not inside a string). @xref{Character Type}. | |
| 1070 | |
| 1071 Strings cannot hold characters that have the hyper, super, or alt | |
| 1072 modifiers; they can hold @sc{ASCII} control characters, but no others. | |
| 1073 They do not distinguish case in @sc{ASCII} control characters. | |
| 1074 @end ignore | |
| 1075 | |
| 1076 The printed representation of a string consists of a double-quote, the | |
| 1077 characters it contains, and another double-quote. However, you must | |
| 1078 escape any backslash or double-quote characters in the string with a | |
| 1079 backslash, like this: @code{"this \" is an embedded quote"}. | |
| 1080 | |
| 3543 | 1081 An alternative syntax allows insertion of raw backslashes into a |
| 1082 string, like this: @code{#r"this \ is an embedded backslash"}. In such | |
| 1083 a string, each character following a backslash is included literally in | |
| 1084 the string, and all backslashes are left in the string. This means that | |
| 1085 @code{#r"\""} is a valid string literal with two characters, a backslash and a | |
| 4265 | 1086 double-quote. It also means that a string with this syntax cannot end |
| 1087 in a single backslash. As with Python, from where this syntax was | |
| 3543 | 1088 taken, you can specify @code{u} or @code{U} after the @code{#r} to |
| 4265 | 1089 specify that interpretation of Unicode escapes should be |
| 1090 done---@pxref{Character Type}---and if you use @code{#ru} for your raw | |
| 1091 strings, the restriction on the trailing backslash can be worked around | |
| 1092 like so: @code{#ru"Backslash: \u005C"}. | |
| 3543 | 1093 |
| 428 | 1094 The newline character is not special in the read syntax for strings; |
| 1095 if you write a new line between the double-quotes, it becomes a | |
| 1096 character in the string. But an escaped newline---one that is preceded | |
| 1097 by @samp{\}---does not become part of the string; i.e., the Lisp reader | |
| 1098 ignores an escaped newline while reading a string. | |
| 1099 @cindex newline in strings | |
| 1100 | |
| 1101 @example | |
| 1102 "It is useful to include newlines | |
| 1103 in documentation strings, | |
| 1104 but the newline is \ | |
| 1105 ignored if escaped." | |
| 1106 @result{} "It is useful to include newlines | |
| 1107 in documentation strings, | |
| 1108 but the newline is ignored if escaped." | |
| 1109 @end example | |
| 1110 | |
| 1111 A string can hold extents and properties of the text it contains, in | |
| 1112 addition to the characters themselves. This enables programs that copy | |
| 1113 text between strings and buffers to preserve the extents and properties | |
| 1114 with no special effort. @xref{Extents}, @xref{Text Properties}. | |
| 1115 | |
| 1116 Note that FSF GNU Emacs has a special read and print syntax for | |
| 1117 strings with text properties, but XEmacs does not currently implement | |
| 1118 this. It was judged better not to include this in XEmacs because it | |
| 1119 entails that @code{equal} return @code{nil} when passed a string with | |
| 1120 text properties and the equivalent string without text properties, which | |
| 1121 is often counter-intuitive. | |
| 1122 | |
| 1123 @ignore @c Not in XEmacs | |
| 1124 Strings with text | |
| 1125 properties have a special read and print syntax: | |
| 1126 | |
| 1127 @example | |
| 1128 #("@var{characters}" @var{property-data}...) | |
| 1129 @end example | |
| 1130 | |
| 1131 @noindent | |
| 1132 where @var{property-data} consists of zero or more elements, in groups | |
| 1133 of three as follows: | |
| 1134 | |
| 1135 @example | |
| 444 | 1136 @var{start} @var{end} @var{plist} |
| 428 | 1137 @end example |
| 1138 | |
| 1139 @noindent | |
| 444 | 1140 The elements @var{start} and @var{end} are integers, and together specify |
| 428 | 1141 a range of indices in the string; @var{plist} is the property list for |
| 1142 that range. | |
| 1143 @end ignore | |
| 1144 | |
| 1145 @xref{Strings and Characters}, for functions that work on strings. | |
| 1146 | |
| 1147 @node Vector Type | |
| 1148 @subsection Vector Type | |
| 1149 | |
| 1150 A @dfn{vector} is a one-dimensional array of elements of any type. It | |
| 1151 takes a constant amount of time to access any element of a vector. (In | |
| 1152 a list, the access time of an element is proportional to the distance of | |
| 1153 the element from the beginning of the list.) | |
| 1154 | |
| 1155 The printed representation of a vector consists of a left square | |
| 1156 bracket, the elements, and a right square bracket. This is also the | |
| 1157 read syntax. Like numbers and strings, vectors are considered constants | |
| 1158 for evaluation. | |
| 1159 | |
| 1160 @example | |
| 1161 [1 "two" (three)] ; @r{A vector of three elements.} | |
| 1162 @result{} [1 "two" (three)] | |
| 1163 @end example | |
| 1164 | |
| 1165 @xref{Vectors}, for functions that work with vectors. | |
| 1166 | |
| 1167 @node Bit Vector Type | |
| 1168 @subsection Bit Vector Type | |
| 1169 | |
| 1170 A @dfn{bit vector} is a one-dimensional array of 1's and 0's. It | |
| 1171 takes a constant amount of time to access any element of a bit vector, | |
| 1172 as for vectors. Bit vectors have an extremely compact internal | |
| 1173 representation (one machine bit per element), which makes them ideal | |
| 1174 for keeping track of unordered sets, large collections of boolean values, | |
| 1175 etc. | |
| 1176 | |
| 1177 The printed representation of a bit vector consists of @samp{#*} | |
| 1178 followed by the bits in the vector. This is also the read syntax. Like | |
| 1179 numbers, strings, and vectors, bit vectors are considered constants for | |
| 1180 evaluation. | |
| 1181 | |
| 1182 @example | |
| 1183 #*00101000 ; @r{A bit vector of eight elements.} | |
| 1184 @result{} #*00101000 | |
| 1185 @end example | |
| 1186 | |
| 1187 @xref{Bit Vectors}, for functions that work with bit vectors. | |
| 1188 | |
| 1189 @node Function Type | |
| 1190 @subsection Function Type | |
| 1191 | |
| 1192 Just as functions in other programming languages are executable, | |
| 1193 @dfn{Lisp function} objects are pieces of executable code. However, | |
| 1194 functions in Lisp are primarily Lisp objects, and only secondarily the | |
| 1195 text which represents them. These Lisp objects are lambda expressions: | |
| 1196 lists whose first element is the symbol @code{lambda} (@pxref{Lambda | |
| 1197 Expressions}). | |
| 1198 | |
| 1199 In most programming languages, it is impossible to have a function | |
| 1200 without a name. In Lisp, a function has no intrinsic name. A lambda | |
| 1201 expression is also called an @dfn{anonymous function} (@pxref{Anonymous | |
| 1202 Functions}). A named function in Lisp is actually a symbol with a valid | |
| 1203 function in its function cell (@pxref{Defining Functions}). | |
| 1204 | |
| 1205 Most of the time, functions are called when their names are written in | |
| 1206 Lisp expressions in Lisp programs. However, you can construct or obtain | |
| 1207 a function object at run time and then call it with the primitive | |
| 1208 functions @code{funcall} and @code{apply}. @xref{Calling Functions}. | |
| 1209 | |
| 1210 @node Macro Type | |
| 1211 @subsection Macro Type | |
| 1212 | |
| 1213 A @dfn{Lisp macro} is a user-defined construct that extends the Lisp | |
| 1214 language. It is represented as an object much like a function, but with | |
| 1215 different parameter-passing semantics. A Lisp macro has the form of a | |
| 1216 list whose first element is the symbol @code{macro} and whose @sc{cdr} | |
| 1217 is a Lisp function object, including the @code{lambda} symbol. | |
| 1218 | |
| 1219 Lisp macro objects are usually defined with the built-in | |
| 1220 @code{defmacro} function, but any list that begins with @code{macro} is | |
| 1221 a macro as far as XEmacs is concerned. @xref{Macros}, for an explanation | |
| 1222 of how to write a macro. | |
| 1223 | |
| 1224 @node Primitive Function Type | |
| 1225 @subsection Primitive Function Type | |
| 1226 @cindex special forms | |
| 1227 | |
| 1228 A @dfn{primitive function} is a function callable from Lisp but | |
| 1229 written in the C programming language. Primitive functions are also | |
| 1230 called @dfn{subrs} or @dfn{built-in functions}. (The word ``subr'' is | |
| 1231 derived from ``subroutine''.) Most primitive functions evaluate all | |
| 1232 their arguments when they are called. A primitive function that does | |
| 1233 not evaluate all its arguments is called a @dfn{special form} | |
| 1234 (@pxref{Special Forms}).@refill | |
| 1235 | |
| 1236 It does not matter to the caller of a function whether the function is | |
| 1237 primitive. However, this does matter if you try to substitute a | |
| 1238 function written in Lisp for a primitive of the same name. The reason | |
| 1239 is that the primitive function may be called directly from C code. | |
| 1240 Calls to the redefined function from Lisp will use the new definition, | |
| 1241 but calls from C code may still use the built-in definition. | |
| 1242 | |
| 1243 The term @dfn{function} refers to all Emacs functions, whether written | |
| 1244 in Lisp or C. @xref{Function Type}, for information about the | |
| 1245 functions written in Lisp. | |
| 1246 | |
| 1247 Primitive functions have no read syntax and print in hash notation | |
| 1248 with the name of the subroutine. | |
| 1249 | |
| 1250 @example | |
| 1251 @group | |
| 1252 (symbol-function 'car) ; @r{Access the function cell} | |
| 1253 ; @r{of the symbol.} | |
| 1254 @result{} #<subr car> | |
| 1255 (subrp (symbol-function 'car)) ; @r{Is this a primitive function?} | |
| 1256 @result{} t ; @r{Yes.} | |
| 1257 @end group | |
| 1258 @end example | |
| 1259 | |
| 1260 @node Compiled-Function Type | |
| 1261 @subsection Compiled-Function Type | |
| 1262 | |
| 1263 The byte compiler produces @dfn{compiled-function objects}. The | |
| 1264 evaluator handles this data type specially when it appears as a function | |
| 1265 to be called. @xref{Byte Compilation}, for information about the byte | |
| 1266 compiler. | |
| 1267 | |
| 1268 The printed representation for a compiled-function object is normally | |
| 1269 @samp{#<compiled-function...>}. If @code{print-readably} is true, | |
| 1270 however, it is @samp{#[...]}. | |
| 1271 | |
| 1272 @node Autoload Type | |
| 1273 @subsection Autoload Type | |
| 1274 | |
| 1275 An @dfn{autoload object} is a list whose first element is the symbol | |
| 1276 @code{autoload}. It is stored as the function definition of a symbol as | |
| 1277 a placeholder for the real definition; it says that the real definition | |
| 1278 is found in a file of Lisp code that should be loaded when necessary. | |
| 1279 The autoload object contains the name of the file, plus some other | |
| 1280 information about the real definition. | |
| 1281 | |
| 1282 After the file has been loaded, the symbol should have a new function | |
| 1283 definition that is not an autoload object. The new definition is then | |
| 1284 called as if it had been there to begin with. From the user's point of | |
| 1285 view, the function call works as expected, using the function definition | |
| 1286 in the loaded file. | |
| 1287 | |
| 1288 An autoload object is usually created with the function | |
| 1289 @code{autoload}, which stores the object in the function cell of a | |
| 1290 symbol. @xref{Autoload}, for more details. | |
| 1291 | |
| 1292 @node Char Table Type | |
| 1293 @subsection Char Table Type | |
| 1294 @cindex char table type | |
| 1295 | |
| 1296 (not yet documented) | |
| 1297 | |
| 1298 @node Hash Table Type | |
| 1299 @subsection Hash Table Type | |
| 1300 @cindex hash table type | |
| 1301 | |
| 1302 A @dfn{hash table} is a table providing an arbitrary mapping from | |
| 1303 one Lisp object to another, using an internal indexing method | |
| 1304 called @dfn{hashing}. Hash tables are very fast (much more efficient | |
| 1305 that using an association list, when there are a large number of | |
| 1306 elements in the table). | |
| 1307 | |
| 1308 Hash tables have a special read syntax beginning with | |
| 1309 @samp{#s(hash-table} (this is an example of @dfn{structure} read | |
| 1310 syntax. This notation is also used for printing when | |
| 1311 @code{print-readably} is @code{t}. | |
| 1312 | |
| 1313 Otherwise they print in hash notation (The ``hash'' in ``hash notation'' | |
| 1314 has nothing to do with the ``hash'' in ``hash table''), giving the | |
| 1315 number of elements, total space allocated for elements, and a unique | |
| 1316 number assigned at the time the hash table was created. (Hash tables | |
| 1317 automatically resize as necessary so there is no danger of running out | |
| 1318 of space for elements.) | |
| 1319 | |
| 1320 @example | |
| 1321 @group | |
| 1322 (make-hash-table :size 50) | |
| 1323 @result{} #<hash-table 0/107 0x313a> | |
| 1324 @end group | |
| 1325 @end example | |
| 1326 | |
| 1327 @xref{Hash Tables}, for information on how to create and work with hash | |
| 1328 tables. | |
| 1329 | |
| 1330 @node Range Table Type | |
| 1331 @subsection Range Table Type | |
| 1332 @cindex range table type | |
| 1333 | |
| 1334 A @dfn{range table} is a table that maps from ranges of integers to | |
| 1335 arbitrary Lisp objects. Range tables automatically combine overlapping | |
| 1336 ranges that map to the same Lisp object, and operations are provided | |
| 1337 for mapping over all of the ranges in a range table. | |
| 1338 | |
| 1339 Range tables have a special read syntax beginning with | |
| 1340 @samp{#s(range-table} (this is an example of @dfn{structure} read syntax, | |
| 1341 which is also used for char tables and faces). | |
| 1342 | |
| 1343 @example | |
| 1344 @group | |
| 1345 (setq x (make-range-table)) | |
| 1346 (put-range-table 20 50 'foo x) | |
| 1347 (put-range-table 100 200 "bar" x) | |
| 1348 x | |
| 1349 @result{} #s(range-table data ((20 50) foo (100 200) "bar")) | |
| 1350 @end group | |
| 1351 @end example | |
| 1352 | |
| 1353 @xref{Range Tables}, for information on how to create and work with range | |
| 1354 tables. | |
| 1355 | |
| 1356 @node Weak List Type | |
| 1357 @subsection Weak List Type | |
| 1358 @cindex weak list type | |
| 1359 | |
| 1360 (not yet documented) | |
| 1361 | |
| 1362 @node Editing Types | |
| 1363 @section Editing Types | |
| 1364 @cindex editing types | |
| 1365 | |
| 1366 The types in the previous section are common to many Lisp dialects. | |
| 1367 XEmacs Lisp provides several additional data types for purposes connected | |
| 1368 with editing. | |
| 1369 | |
| 1370 @menu | |
| 1371 * Buffer Type:: The basic object of editing. | |
| 1372 * Marker Type:: A position in a buffer. | |
| 1373 * Extent Type:: A range in a buffer or string, maybe with properties. | |
| 1374 * Window Type:: Buffers are displayed in windows. | |
| 1375 * Frame Type:: Windows subdivide frames. | |
| 1376 * Device Type:: Devices group all frames on a display. | |
| 1377 * Console Type:: Consoles group all devices with the same keyboard. | |
| 1378 * Window Configuration Type:: Recording the way a frame is subdivided. | |
| 1379 * Event Type:: An interesting occurrence in the system. | |
| 1380 * Process Type:: A process running on the underlying OS. | |
| 1381 * Stream Type:: Receive or send characters. | |
| 1382 * Keymap Type:: What function a keystroke invokes. | |
| 1383 * Syntax Table Type:: What a character means. | |
| 1384 * Display Table Type:: How display tables are represented. | |
| 1385 * Database Type:: A connection to an external DBM or DB database. | |
| 1386 * Charset Type:: A character set (e.g. all Kanji characters), | |
| 1387 under XEmacs/MULE. | |
| 1388 * Coding System Type:: An object encapsulating a way of converting between | |
| 1389 different textual encodings, under XEmacs/MULE. | |
| 1390 * ToolTalk Message Type:: A message, in the ToolTalk IPC protocol. | |
| 1391 * ToolTalk Pattern Type:: A pattern, in the ToolTalk IPC protocol. | |
| 1392 @end menu | |
| 1393 | |
| 1394 @node Buffer Type | |
| 1395 @subsection Buffer Type | |
| 1396 | |
| 1397 A @dfn{buffer} is an object that holds text that can be edited | |
| 1398 (@pxref{Buffers}). Most buffers hold the contents of a disk file | |
| 1399 (@pxref{Files}) so they can be edited, but some are used for other | |
| 1400 purposes. Most buffers are also meant to be seen by the user, and | |
| 1401 therefore displayed, at some time, in a window (@pxref{Windows}). But a | |
| 1402 buffer need not be displayed in any window. | |
| 1403 | |
| 1404 The contents of a buffer are much like a string, but buffers are not | |
| 1405 used like strings in XEmacs Lisp, and the available operations are | |
| 1406 different. For example, insertion of text into a buffer is very | |
| 1407 efficient, whereas ``inserting'' text into a string requires | |
| 1408 concatenating substrings, and the result is an entirely new string | |
| 1409 object. | |
| 1410 | |
| 1411 Each buffer has a designated position called @dfn{point} | |
| 1412 (@pxref{Positions}). At any time, one buffer is the @dfn{current | |
| 1413 buffer}. Most editing commands act on the contents of the current | |
| 1414 buffer in the neighborhood of point. Many of the standard Emacs | |
| 1415 functions manipulate or test the characters in the current buffer; a | |
| 1416 whole chapter in this manual is devoted to describing these functions | |
| 1417 (@pxref{Text}). | |
| 1418 | |
| 1419 Several other data structures are associated with each buffer: | |
| 1420 | |
| 1421 @itemize @bullet | |
| 1422 @item | |
| 1423 a local syntax table (@pxref{Syntax Tables}); | |
| 1424 | |
| 1425 @item | |
| 1426 a local keymap (@pxref{Keymaps}); | |
| 1427 | |
| 1428 @item | |
| 1429 a local variable binding list (@pxref{Buffer-Local Variables}); | |
| 1430 | |
| 1431 @item | |
| 1432 a list of extents (@pxref{Extents}); | |
| 1433 | |
| 1434 @item | |
| 1435 and various other related properties. | |
| 1436 @end itemize | |
| 1437 | |
| 1438 @noindent | |
| 1439 The local keymap and variable list contain entries that individually | |
| 1440 override global bindings or values. These are used to customize the | |
| 1441 behavior of programs in different buffers, without actually changing the | |
| 1442 programs. | |
| 1443 | |
| 1444 A buffer may be @dfn{indirect}, which means it shares the text | |
| 1445 of another buffer. @xref{Indirect Buffers}. | |
| 1446 | |
| 1447 Buffers have no read syntax. They print in hash notation, showing the | |
| 1448 buffer name. | |
| 1449 | |
| 1450 @example | |
| 1451 @group | |
| 1452 (current-buffer) | |
| 1453 @result{} #<buffer "objects.texi"> | |
| 1454 @end group | |
| 1455 @end example | |
| 1456 | |
| 1457 @node Marker Type | |
| 1458 @subsection Marker Type | |
| 1459 | |
| 1460 A @dfn{marker} denotes a position in a specific buffer. Markers | |
| 1461 therefore have two components: one for the buffer, and one for the | |
| 1462 position. Changes in the buffer's text automatically relocate the | |
| 1463 position value as necessary to ensure that the marker always points | |
| 1464 between the same two characters in the buffer. | |
| 1465 | |
| 1466 Markers have no read syntax. They print in hash notation, giving the | |
| 1467 current character position and the name of the buffer. | |
| 1468 | |
| 1469 @example | |
| 1470 @group | |
| 1471 (point-marker) | |
| 1472 @result{} #<marker at 50661 in objects.texi> | |
| 1473 @end group | |
| 1474 @end example | |
| 1475 | |
| 1476 @xref{Markers}, for information on how to test, create, copy, and move | |
| 1477 markers. | |
| 1478 | |
| 1479 @node Extent Type | |
| 1480 @subsection Extent Type | |
| 1481 | |
| 1482 An @dfn{extent} specifies temporary alteration of the display | |
| 1483 appearance of a part of a buffer (or string). It contains markers | |
| 1484 delimiting a range of the buffer, plus a property list (a list whose | |
| 1485 elements are alternating property names and values). Extents are used | |
| 1486 to present parts of the buffer temporarily in a different display style. | |
| 1487 They have no read syntax, and print in hash notation, giving the buffer | |
| 1488 name and range of positions. | |
| 1489 | |
| 1490 Extents can exist over strings as well as buffers; the primary use | |
| 1491 of this is to preserve extent and text property information as text | |
| 1492 is copied from one buffer to another or between different parts of | |
| 1493 a buffer. | |
| 1494 | |
| 1495 Extents have no read syntax. They print in hash notation, giving the | |
| 1496 range of text they cover, the name of the buffer or string they are in, | |
| 1497 the address in core, and a summary of some of the properties attached to | |
| 1498 the extent. | |
| 1499 | |
| 1500 @example | |
| 1501 @group | |
| 1502 (extent-at (point)) | |
| 1503 @result{} #<extent [51742, 51748) font-lock text-prop 0x90121e0 in buffer objects.texi> | |
| 1504 @end group | |
| 1505 @end example | |
| 1506 | |
| 1507 @xref{Extents}, for how to create and use extents. | |
| 1508 | |
| 1509 Extents are used to implement text properties. @xref{Text Properties}. | |
| 1510 | |
| 1511 @node Window Type | |
| 1512 @subsection Window Type | |
| 1513 | |
| 1514 A @dfn{window} describes the portion of the frame that XEmacs uses to | |
| 1515 display a buffer. (In standard window-system usage, a @dfn{window} is | |
| 1516 what XEmacs calls a @dfn{frame}; XEmacs confusingly uses the term | |
| 1517 ``window'' to refer to what is called a @dfn{pane} in standard | |
| 1518 window-system usage.) Every window has one associated buffer, whose | |
| 1519 contents appear in the window. By contrast, a given buffer may appear | |
| 1520 in one window, no window, or several windows. | |
| 1521 | |
| 1522 Though many windows may exist simultaneously, at any time one window | |
| 1523 is designated the @dfn{selected window}. This is the window where the | |
| 1524 cursor is (usually) displayed when XEmacs is ready for a command. The | |
| 1525 selected window usually displays the current buffer, but this is not | |
| 1526 necessarily the case. | |
| 1527 | |
| 1528 Windows are grouped on the screen into frames; each window belongs to | |
| 1529 one and only one frame. @xref{Frame Type}. | |
| 1530 | |
| 1531 Windows have no read syntax. They print in hash notation, giving the | |
| 1532 name of the buffer being displayed and a unique number assigned at the | |
| 1533 time the window was created. (This number can be useful because the | |
| 1534 buffer displayed in any given window can change frequently.) | |
| 1535 | |
| 1536 @example | |
| 1537 @group | |
| 1538 (selected-window) | |
| 1539 @result{} #<window on "objects.texi" 0x266c> | |
| 1540 @end group | |
| 1541 @end example | |
| 1542 | |
| 1543 @xref{Windows}, for a description of the functions that work on windows. | |
| 1544 | |
| 1545 @node Frame Type | |
| 1546 @subsection Frame Type | |
| 1547 | |
| 1548 A @var{frame} is a rectangle on the screen (a @dfn{window} in standard | |
| 1549 window-system terminology) that contains one or more non-overlapping | |
| 1550 Emacs windows (@dfn{panes} in standard window-system terminology). A | |
| 1551 frame initially contains a single main window (plus perhaps a minibuffer | |
| 1552 window) which you can subdivide vertically or horizontally into smaller | |
| 1553 windows. | |
| 1554 | |
| 1555 Frames have no read syntax. They print in hash notation, giving the | |
| 1556 frame's type, name as used for resourcing, and a unique number assigned | |
| 1557 at the time the frame was created. | |
| 1558 | |
| 1559 @example | |
| 1560 @group | |
| 1561 (selected-frame) | |
| 1562 @result{} #<x-frame "emacs" 0x9db> | |
| 1563 @end group | |
| 1564 @end example | |
| 1565 | |
| 1566 @xref{Frames}, for a description of the functions that work on frames. | |
| 1567 | |
| 1568 @node Device Type | |
| 1569 @subsection Device Type | |
| 1570 | |
| 1571 A @dfn{device} represents a single display on which frames exist. | |
| 1572 Normally, there is only one device object, but there may be more | |
| 1573 than one if XEmacs is being run on a multi-headed display (e.g. an | |
| 1574 X server with attached color and mono screens) or if XEmacs is | |
| 1575 simultaneously driving frames attached to different consoles, e.g. | |
| 1576 an X display and a @sc{tty} connection. | |
| 1577 | |
| 1578 Devices do not have a read syntax. They print in hash notation, | |
| 1579 giving the device's type, connection name, and a unique number assigned | |
| 1580 at the time the device was created. | |
| 1581 | |
| 1582 @example | |
| 1583 @group | |
| 1584 (selected-device) | |
| 1585 @result{} #<x-device on ":0.0" 0x5b9> | |
| 1586 @end group | |
| 1587 @end example | |
| 1588 | |
| 1589 @xref{Consoles and Devices}, for a description of several functions | |
| 1590 related to devices. | |
| 1591 | |
| 1592 @node Console Type | |
| 1593 @subsection Console Type | |
| 1594 | |
| 1595 A @dfn{console} represents a single keyboard to which devices | |
| 1596 (i.e. displays on which frames exist) are connected. Normally, there is | |
| 1597 only one console object, but there may be more than one if XEmacs is | |
| 1598 simultaneously driving frames attached to different X servers and/or | |
| 1599 @sc{tty} connections. (XEmacs is capable of driving multiple X and | |
| 1600 @sc{tty} connections at the same time, and provides a robust mechanism | |
| 1601 for handling the differing display capabilities of such heterogeneous | |
| 1602 environments. A buffer with embedded glyphs and multiple fonts and | |
| 1603 colors, for example, will display reasonably if it simultaneously | |
| 1604 appears on a frame on a color X display, a frame on a mono X display, | |
| 1605 and a frame on a @sc{tty} connection.) | |
| 1606 | |
| 1607 Consoles do not have a read syntax. They print in hash notation, | |
| 1608 giving the console's type, connection name, and a unique number assigned | |
| 1609 at the time the console was created. | |
| 1610 | |
| 1611 @example | |
| 1612 @group | |
| 1613 (selected-console) | |
| 1614 @result{} #<x-console on "localhost:0" 0x5b7> | |
| 1615 @end group | |
| 1616 @end example | |
| 1617 | |
| 1618 @xref{Consoles and Devices}, for a description of several functions | |
| 1619 related to consoles. | |
| 1620 | |
| 1621 @node Window Configuration Type | |
| 1622 @subsection Window Configuration Type | |
| 1623 @cindex screen layout | |
| 1624 | |
| 1625 A @dfn{window configuration} stores information about the positions, | |
| 1626 sizes, and contents of the windows in a frame, so you can recreate the | |
| 1627 same arrangement of windows later. | |
| 1628 | |
| 1629 Window configurations do not have a read syntax. They print in hash | |
| 1630 notation, giving a unique number assigned at the time the window | |
| 1631 configuration was created. | |
| 1632 | |
| 1633 @example | |
| 1634 @group | |
| 1635 (current-window-configuration) | |
| 1636 @result{} #<window-configuration 0x2db4> | |
| 1637 @end group | |
| 1638 @end example | |
| 1639 | |
| 1640 @xref{Window Configurations}, for a description of several functions | |
| 1641 related to window configurations. | |
| 1642 | |
| 1643 @node Event Type | |
| 1644 @subsection Event Type | |
| 1645 | |
| 1646 (not yet documented) | |
| 1647 | |
| 1648 @node Process Type | |
| 1649 @subsection Process Type | |
| 1650 | |
| 1651 The word @dfn{process} usually means a running program. XEmacs itself | |
| 1652 runs in a process of this sort. However, in XEmacs Lisp, a process is a | |
| 1653 Lisp object that designates a subprocess created by the XEmacs process. | |
| 1654 Programs such as shells, GDB, ftp, and compilers, running in | |
| 1655 subprocesses of XEmacs, extend the capabilities of XEmacs. | |
| 1656 | |
| 1657 An Emacs subprocess takes textual input from Emacs and returns textual | |
| 1658 output to Emacs for further manipulation. Emacs can also send signals | |
| 1659 to the subprocess. | |
| 1660 | |
| 1661 Process objects have no read syntax. They print in hash notation, | |
| 1662 giving the name of the process, its associated process ID, and the | |
| 1663 current state of the process: | |
| 1664 | |
| 1665 @example | |
| 1666 @group | |
| 1667 (process-list) | |
| 1668 @result{} (#<process "shell" pid 2909 state:run>) | |
| 1669 @end group | |
| 1670 @end example | |
| 1671 | |
| 1672 @xref{Processes}, for information about functions that create, delete, | |
| 1673 return information about, send input or signals to, and receive output | |
| 1674 from processes. | |
| 1675 | |
| 1676 @node Stream Type | |
| 1677 @subsection Stream Type | |
| 1678 | |
| 1679 A @dfn{stream} is an object that can be used as a source or sink for | |
| 1680 characters---either to supply characters for input or to accept them as | |
| 1681 output. Many different types can be used this way: markers, buffers, | |
| 1682 strings, and functions. Most often, input streams (character sources) | |
| 1683 obtain characters from the keyboard, a buffer, or a file, and output | |
| 1684 streams (character sinks) send characters to a buffer, such as a | |
| 1685 @file{*Help*} buffer, or to the echo area. | |
| 1686 | |
| 1687 The object @code{nil}, in addition to its other meanings, may be used | |
| 1688 as a stream. It stands for the value of the variable | |
| 1689 @code{standard-input} or @code{standard-output}. Also, the object | |
| 1690 @code{t} as a stream specifies input using the minibuffer | |
| 1691 (@pxref{Minibuffers}) or output in the echo area (@pxref{The Echo | |
| 1692 Area}). | |
| 1693 | |
| 1694 Streams have no special printed representation or read syntax, and | |
| 1695 print as whatever primitive type they are. | |
| 1696 | |
| 1697 @xref{Read and Print}, for a description of functions | |
| 1698 related to streams, including parsing and printing functions. | |
| 1699 | |
| 1700 @node Keymap Type | |
| 1701 @subsection Keymap Type | |
| 1702 | |
| 1703 A @dfn{keymap} maps keys typed by the user to commands. This mapping | |
| 1704 controls how the user's command input is executed. | |
| 1705 | |
| 1706 NOTE: In XEmacs, a keymap is a separate primitive type. In FSF GNU | |
| 1707 Emacs, a keymap is actually a list whose @sc{car} is the symbol | |
| 1708 @code{keymap}. | |
| 1709 | |
| 1710 @xref{Keymaps}, for information about creating keymaps, handling prefix | |
| 1711 keys, local as well as global keymaps, and changing key bindings. | |
| 1712 | |
| 1713 @node Syntax Table Type | |
| 1714 @subsection Syntax Table Type | |
| 1715 | |
| 1716 Under XEmacs 20, a @dfn{syntax table} is a particular type of char | |
| 1717 table. Under XEmacs 19, a syntax table a vector of 256 integers. In | |
| 1718 both cases, each element defines how one character is interpreted when it | |
| 1719 appears in a buffer. For example, in C mode (@pxref{Major Modes}), the | |
| 1720 @samp{+} character is punctuation, but in Lisp mode it is a valid | |
| 1721 character in a symbol. These modes specify different interpretations by | |
| 1722 changing the syntax table entry for @samp{+}. | |
| 1723 | |
| 1724 Syntax tables are used only for scanning text in buffers, not for | |
| 1725 reading Lisp expressions. The table the Lisp interpreter uses to read | |
| 1726 expressions is built into the XEmacs source code and cannot be changed; | |
| 1727 thus, to change the list delimiters to be @samp{@{} and @samp{@}} | |
| 1728 instead of @samp{(} and @samp{)} would be impossible. | |
| 1729 | |
| 1730 @xref{Syntax Tables}, for details about syntax classes and how to make | |
| 1731 and modify syntax tables. | |
| 1732 | |
| 1733 @node Display Table Type | |
| 1734 @subsection Display Table Type | |
| 1735 | |
| 1736 A @dfn{display table} specifies how to display each character code. | |
| 1737 Each buffer and each window can have its own display table. A display | |
| 1738 table is actually a vector of length 256, although in XEmacs 20 this may | |
| 1739 change to be a particular type of char table. @xref{Display Tables}. | |
| 1740 | |
| 1741 @node Database Type | |
| 1742 @subsection Database Type | |
| 1743 @cindex database type | |
| 1744 | |
| 1745 (not yet documented) | |
| 1746 | |
| 1747 @node Charset Type | |
| 1748 @subsection Charset Type | |
| 1749 @cindex charset type | |
| 1750 | |
| 1751 (not yet documented) | |
| 1752 | |
| 1753 @node Coding System Type | |
| 1754 @subsection Coding System Type | |
| 1755 @cindex coding system type | |
| 1756 | |
| 1757 (not yet documented) | |
| 1758 | |
| 1759 @node ToolTalk Message Type | |
| 1760 @subsection ToolTalk Message Type | |
| 1761 | |
| 1762 (not yet documented) | |
| 1763 | |
| 1764 @node ToolTalk Pattern Type | |
| 1765 @subsection ToolTalk Pattern Type | |
| 1766 | |
| 1767 (not yet documented) | |
| 1768 | |
| 1769 @node Window-System Types | |
| 1770 @section Window-System Types | |
| 1771 @cindex window system types | |
| 1772 | |
| 1773 XEmacs also has some types that represent objects such as faces | |
| 1774 (collections of display characters), fonts, and pixmaps that are | |
| 1775 commonly found in windowing systems. | |
| 1776 | |
| 1777 @menu | |
| 1778 * Face Type:: A collection of display characteristics. | |
| 1779 * Glyph Type:: An image appearing in a buffer or elsewhere. | |
| 1780 * Specifier Type:: A way of controlling display characteristics on | |
| 1781 a per-buffer, -frame, -window, or -device level. | |
| 1782 * Font Instance Type:: The way a font appears on a particular device. | |
| 1783 * Color Instance Type:: The way a color appears on a particular device. | |
| 1784 * Image Instance Type:: The way an image appears on a particular device. | |
| 1785 * Toolbar Button Type:: An object representing a button in a toolbar. | |
| 1786 * Subwindow Type:: An externally-controlled window-system window | |
| 1787 appearing in a buffer. | |
| 1788 * X Resource Type:: A miscellaneous X resource, if Epoch support was | |
| 1789 compiled into XEmacs. | |
| 1790 @end menu | |
| 1791 | |
| 1792 @node Face Type | |
| 1793 @subsection Face Type | |
| 1794 @cindex face type | |
| 1795 | |
| 1796 (not yet documented) | |
| 1797 | |
| 1798 @node Glyph Type | |
| 1799 @subsection Glyph Type | |
| 1800 @cindex glyph type | |
| 1801 | |
| 1802 (not yet documented) | |
| 1803 | |
| 1804 @node Specifier Type | |
| 1805 @subsection Specifier Type | |
| 1806 @cindex specifier type | |
| 1807 | |
| 1808 (not yet documented) | |
| 1809 | |
| 1810 @node Font Instance Type | |
| 1811 @subsection Font Instance Type | |
| 1812 @cindex font instance type | |
| 1813 | |
| 1814 (not yet documented) | |
| 1815 | |
| 1816 @node Color Instance Type | |
| 1817 @subsection Color Instance Type | |
| 1818 @cindex color instance type | |
| 1819 | |
| 1820 (not yet documented) | |
| 1821 | |
| 1822 @node Image Instance Type | |
| 1823 @subsection Image Instance Type | |
| 1824 @cindex image instance type | |
| 1825 | |
| 1826 (not yet documented) | |
| 1827 | |
| 1828 @node Toolbar Button Type | |
| 1829 @subsection Toolbar Button Type | |
| 1830 @cindex toolbar button type | |
| 1831 | |
| 1832 (not yet documented) | |
| 1833 | |
| 1834 @node Subwindow Type | |
| 1835 @subsection Subwindow Type | |
| 1836 @cindex subwindow type | |
| 1837 | |
| 1838 (not yet documented) | |
| 1839 | |
| 1840 @node X Resource Type | |
| 1841 @subsection X Resource Type | |
| 1842 @cindex X resource type | |
| 1843 | |
| 1844 (not yet documented) | |
| 1845 | |
| 1846 @node Type Predicates | |
| 1847 @section Type Predicates | |
| 1848 @cindex predicates | |
| 1849 @cindex type checking | |
| 1850 @kindex wrong-type-argument | |
| 1851 | |
| 1852 The XEmacs Lisp interpreter itself does not perform type checking on | |
| 1853 the actual arguments passed to functions when they are called. It could | |
| 1854 not do so, since function arguments in Lisp do not have declared data | |
| 1855 types, as they do in other programming languages. It is therefore up to | |
| 1856 the individual function to test whether each actual argument belongs to | |
| 1857 a type that the function can use. | |
| 1858 | |
| 1859 All built-in functions do check the types of their actual arguments | |
| 1860 when appropriate, and signal a @code{wrong-type-argument} error if an | |
| 1861 argument is of the wrong type. For example, here is what happens if you | |
| 1862 pass an argument to @code{+} that it cannot handle: | |
| 1863 | |
| 1864 @example | |
| 1865 @group | |
| 1866 (+ 2 'a) | |
| 1867 @error{} Wrong type argument: integer-or-marker-p, a | |
| 1868 @end group | |
| 1869 @end example | |
| 1870 | |
| 1871 @cindex type predicates | |
| 1872 @cindex testing types | |
| 1873 If you want your program to handle different types differently, you | |
| 1874 must do explicit type checking. The most common way to check the type | |
| 1875 of an object is to call a @dfn{type predicate} function. Emacs has a | |
| 1876 type predicate for each type, as well as some predicates for | |
| 1877 combinations of types. | |
| 1878 | |
| 1879 A type predicate function takes one argument; it returns @code{t} if | |
| 1880 the argument belongs to the appropriate type, and @code{nil} otherwise. | |
| 1881 Following a general Lisp convention for predicate functions, most type | |
| 1882 predicates' names end with @samp{p}. | |
| 1883 | |
| 1884 Here is an example which uses the predicates @code{listp} to check for | |
| 1885 a list and @code{symbolp} to check for a symbol. | |
| 1886 | |
| 1887 @example | |
| 1888 (defun add-on (x) | |
| 1889 (cond ((symbolp x) | |
| 1890 ;; If X is a symbol, put it on LIST. | |
| 1891 (setq list (cons x list))) | |
| 1892 ((listp x) | |
| 1893 ;; If X is a list, add its elements to LIST. | |
| 1894 (setq list (append x list))) | |
| 1895 @need 3000 | |
| 1896 (t | |
| 1897 ;; We only handle symbols and lists. | |
| 1898 (error "Invalid argument %s in add-on" x)))) | |
| 1899 @end example | |
| 1900 | |
| 1901 Here is a table of predefined type predicates, in alphabetical order, | |
| 1902 with references to further information. | |
| 1903 | |
| 1904 @table @code | |
| 1905 @item annotationp | |
| 1906 @xref{Annotation Primitives, annotationp}. | |
| 1907 | |
| 1908 @item arrayp | |
| 1909 @xref{Array Functions, arrayp}. | |
| 1910 | |
| 1911 @item atom | |
| 1912 @xref{List-related Predicates, atom}. | |
| 1913 | |
| 1914 @item bit-vector-p | |
| 1915 @xref{Bit Vector Functions, bit-vector-p}. | |
| 1916 | |
| 1917 @item bitp | |
| 1918 @xref{Bit Vector Functions, bitp}. | |
| 1919 | |
| 1920 @item boolean-specifier-p | |
| 1921 @xref{Specifier Types, boolean-specifier-p}. | |
| 1922 | |
| 1923 @item buffer-glyph-p | |
| 1924 @xref{Glyph Types, buffer-glyph-p}. | |
| 1925 | |
| 1926 @item buffer-live-p | |
| 1927 @xref{Killing Buffers, buffer-live-p}. | |
| 1928 | |
| 1929 @item bufferp | |
| 1930 @xref{Buffer Basics, bufferp}. | |
| 1931 | |
| 1932 @item button-event-p | |
| 1933 @xref{Event Predicates, button-event-p}. | |
| 1934 | |
| 1935 @item button-press-event-p | |
| 1936 @xref{Event Predicates, button-press-event-p}. | |
| 1937 | |
| 1938 @item button-release-event-p | |
| 1939 @xref{Event Predicates, button-release-event-p}. | |
| 1940 | |
| 1941 @item case-table-p | |
| 1942 @xref{Case Tables, case-table-p}. | |
| 1943 | |
| 1944 @item char-int-p | |
| 1945 @xref{Character Codes, char-int-p}. | |
| 1946 | |
| 1947 @item char-or-char-int-p | |
| 1948 @xref{Character Codes, char-or-char-int-p}. | |
| 1949 | |
| 1950 @item char-or-string-p | |
| 1951 @xref{Predicates for Strings, char-or-string-p}. | |
| 1952 | |
| 1953 @item char-table-p | |
| 1954 @xref{Char Tables, char-table-p}. | |
| 1955 | |
| 1956 @item characterp | |
| 1957 @xref{Predicates for Characters, characterp}. | |
| 1958 | |
| 1959 @item color-instance-p | |
| 1960 @xref{Colors, color-instance-p}. | |
| 1961 | |
| 1962 @item color-pixmap-image-instance-p | |
| 1963 @xref{Image Instance Types, color-pixmap-image-instance-p}. | |
| 1964 | |
| 1965 @item color-specifier-p | |
| 1966 @xref{Specifier Types, color-specifier-p}. | |
| 1967 | |
| 1968 @item commandp | |
| 1969 @xref{Interactive Call, commandp}. | |
| 1970 | |
| 1971 @item compiled-function-p | |
| 1972 @xref{Compiled-Function Type, compiled-function-p}. | |
| 1973 | |
| 1974 @item console-live-p | |
| 1975 @xref{Connecting to a Console or Device, console-live-p}. | |
| 1976 | |
| 1977 @item consolep | |
| 1978 @xref{Consoles and Devices, consolep}. | |
| 1979 | |
| 1980 @item consp | |
| 1981 @xref{List-related Predicates, consp}. | |
| 1982 | |
| 1983 @item database-live-p | |
| 1984 @xref{Connecting to a Database, database-live-p}. | |
| 1985 | |
| 1986 @item databasep | |
| 1987 @xref{Databases, databasep}. | |
| 1988 | |
| 1989 @item device-live-p | |
| 1990 @xref{Connecting to a Console or Device, device-live-p}. | |
| 1991 | |
| 1992 @item device-or-frame-p | |
| 1993 @xref{Basic Device Functions, device-or-frame-p}. | |
| 1994 | |
| 1995 @item devicep | |
| 1996 @xref{Consoles and Devices, devicep}. | |
| 1997 | |
| 1998 @item eval-event-p | |
| 1999 @xref{Event Predicates, eval-event-p}. | |
| 2000 | |
| 2001 @item event-live-p | |
| 2002 @xref{Event Predicates, event-live-p}. | |
| 2003 | |
| 2004 @item eventp | |
| 2005 @xref{Events, eventp}. | |
| 2006 | |
| 2007 @item extent-live-p | |
| 2008 @xref{Creating and Modifying Extents, extent-live-p}. | |
| 2009 | |
| 2010 @item extentp | |
| 2011 @xref{Extents, extentp}. | |
| 2012 | |
| 2013 @item face-boolean-specifier-p | |
| 2014 @xref{Specifier Types, face-boolean-specifier-p}. | |
| 2015 | |
| 2016 @item facep | |
| 2017 @xref{Basic Face Functions, facep}. | |
| 2018 | |
| 2019 @item floatp | |
| 2020 @xref{Predicates on Numbers, floatp}. | |
| 2021 | |
| 2022 @item font-instance-p | |
| 2023 @xref{Fonts, font-instance-p}. | |
| 2024 | |
| 2025 @item font-specifier-p | |
| 2026 @xref{Specifier Types, font-specifier-p}. | |
| 2027 | |
| 2028 @item frame-live-p | |
| 2029 @xref{Deleting Frames, frame-live-p}. | |
| 2030 | |
| 2031 @item framep | |
| 2032 @xref{Frames, framep}. | |
| 2033 | |
| 2034 @item functionp | |
| 2035 (not yet documented) | |
| 2036 | |
| 2037 @item generic-specifier-p | |
| 2038 @xref{Specifier Types, generic-specifier-p}. | |
| 2039 | |
| 2040 @item glyphp | |
| 2041 @xref{Glyphs, glyphp}. | |
| 2042 | |
| 2043 @item hash-table-p | |
| 2044 @xref{Hash Tables, hash-table-p}. | |
| 2045 | |
| 2046 @item icon-glyph-p | |
| 2047 @xref{Glyph Types, icon-glyph-p}. | |
| 2048 | |
| 2049 @item image-instance-p | |
| 2050 @xref{Images, image-instance-p}. | |
| 2051 | |
| 2052 @item image-specifier-p | |
| 2053 @xref{Specifier Types, image-specifier-p}. | |
| 2054 | |
| 2055 @item integer-char-or-marker-p | |
| 2056 @xref{Predicates on Markers, integer-char-or-marker-p}. | |
| 2057 | |
| 2058 @item integer-or-char-p | |
| 2059 @xref{Predicates for Characters, integer-or-char-p}. | |
| 2060 | |
| 2061 @item integer-or-marker-p | |
| 2062 @xref{Predicates on Markers, integer-or-marker-p}. | |
| 2063 | |
| 2064 @item integer-specifier-p | |
| 2065 @xref{Specifier Types, integer-specifier-p}. | |
| 2066 | |
| 2067 @item integerp | |
| 2068 @xref{Predicates on Numbers, integerp}. | |
| 2069 | |
| 2070 @item itimerp | |
| 2071 (not yet documented) | |
| 2072 | |
| 2073 @item key-press-event-p | |
| 2074 @xref{Event Predicates, key-press-event-p}. | |
| 2075 | |
| 2076 @item keymapp | |
| 2077 @xref{Creating Keymaps, keymapp}. | |
| 2078 | |
| 2079 @item keywordp | |
| 2080 (not yet documented) | |
| 2081 | |
| 2082 @item listp | |
| 2083 @xref{List-related Predicates, listp}. | |
| 2084 | |
| 2085 @item markerp | |
| 2086 @xref{Predicates on Markers, markerp}. | |
| 2087 | |
| 2088 @item misc-user-event-p | |
| 2089 @xref{Event Predicates, misc-user-event-p}. | |
| 2090 | |
| 2091 @item mono-pixmap-image-instance-p | |
| 2092 @xref{Image Instance Types, mono-pixmap-image-instance-p}. | |
| 2093 | |
| 2094 @item motion-event-p | |
| 2095 @xref{Event Predicates, motion-event-p}. | |
| 2096 | |
| 2097 @item mouse-event-p | |
| 2098 @xref{Event Predicates, mouse-event-p}. | |
| 2099 | |
| 2100 @item natnum-specifier-p | |
| 2101 @xref{Specifier Types, natnum-specifier-p}. | |
| 2102 | |
| 2103 @item natnump | |
| 2104 @xref{Predicates on Numbers, natnump}. | |
| 2105 | |
| 2106 @item nlistp | |
| 2107 @xref{List-related Predicates, nlistp}. | |
| 2108 | |
| 2109 @item nothing-image-instance-p | |
| 2110 @xref{Image Instance Types, nothing-image-instance-p}. | |
| 2111 | |
| 2112 @item number-char-or-marker-p | |
| 2113 @xref{Predicates on Markers, number-char-or-marker-p}. | |
| 2114 | |
| 2115 @item number-or-marker-p | |
| 2116 @xref{Predicates on Markers, number-or-marker-p}. | |
| 2117 | |
| 2118 @item numberp | |
| 2119 @xref{Predicates on Numbers, numberp}. | |
| 2120 | |
| 2121 @item pointer-glyph-p | |
| 2122 @xref{Glyph Types, pointer-glyph-p}. | |
| 2123 | |
| 2124 @item pointer-image-instance-p | |
| 2125 @xref{Image Instance Types, pointer-image-instance-p}. | |
| 2126 | |
| 2127 @item process-event-p | |
| 2128 @xref{Event Predicates, process-event-p}. | |
| 2129 | |
| 2130 @item processp | |
| 2131 @xref{Processes, processp}. | |
| 2132 | |
| 2133 @item range-table-p | |
| 2134 @xref{Range Tables, range-table-p}. | |
| 2135 | |
| 2136 @item ringp | |
| 2137 (not yet documented) | |
| 2138 | |
| 2139 @item sequencep | |
| 2140 @xref{Sequence Functions, sequencep}. | |
| 2141 | |
| 2142 @item specifierp | |
| 2143 @xref{Specifiers, specifierp}. | |
| 2144 | |
| 2145 @item stringp | |
| 2146 @xref{Predicates for Strings, stringp}. | |
| 2147 | |
| 2148 @item subrp | |
| 2149 @xref{Function Cells, subrp}. | |
| 2150 | |
| 2151 @item subwindow-image-instance-p | |
| 2152 @xref{Image Instance Types, subwindow-image-instance-p}. | |
| 2153 | |
| 2154 @item subwindowp | |
| 2155 @xref{Subwindows, subwindowp}. | |
| 2156 | |
| 2157 @item symbolp | |
| 2158 @xref{Symbols, symbolp}. | |
| 2159 | |
| 2160 @item syntax-table-p | |
| 2161 @xref{Syntax Tables, syntax-table-p}. | |
| 2162 | |
| 2163 @item text-image-instance-p | |
| 2164 @xref{Image Instance Types, text-image-instance-p}. | |
| 2165 | |
| 2166 @item timeout-event-p | |
| 2167 @xref{Event Predicates, timeout-event-p}. | |
| 2168 | |
| 2169 @item toolbar-button-p | |
| 2170 @xref{Toolbar, toolbar-button-p}. | |
| 2171 | |
| 2172 @item toolbar-specifier-p | |
| 2173 @xref{Toolbar, toolbar-specifier-p}. | |
| 2174 | |
| 2175 @item user-variable-p | |
| 2176 @xref{Defining Variables, user-variable-p}. | |
| 2177 | |
| 2178 @item vectorp | |
| 2179 @xref{Vectors, vectorp}. | |
| 2180 | |
| 2181 @item weak-list-p | |
| 2182 @xref{Weak Lists, weak-list-p}. | |
| 2183 | |
| 2184 @ignore | |
| 2185 @item wholenump | |
| 2186 @xref{Predicates on Numbers, wholenump}. | |
| 2187 @end ignore | |
| 2188 | |
| 2189 @item window-configuration-p | |
| 2190 @xref{Window Configurations, window-configuration-p}. | |
| 2191 | |
| 2192 @item window-live-p | |
| 2193 @xref{Deleting Windows, window-live-p}. | |
| 2194 | |
| 2195 @item windowp | |
| 2196 @xref{Basic Windows, windowp}. | |
| 2197 @end table | |
| 2198 | |
| 2199 The most general way to check the type of an object is to call the | |
| 2200 function @code{type-of}. Recall that each object belongs to one and | |
| 2201 only one primitive type; @code{type-of} tells you which one (@pxref{Lisp | |
| 2202 Data Types}). But @code{type-of} knows nothing about non-primitive | |
| 2203 types. In most cases, it is more convenient to use type predicates than | |
| 2204 @code{type-of}. | |
| 2205 | |
| 2206 @defun type-of object | |
| 2207 This function returns a symbol naming the primitive type of | |
| 2208 @var{object}. The value is one of @code{bit-vector}, @code{buffer}, | |
| 2209 @code{char-table}, @code{character}, @code{charset}, | |
| 2210 @code{coding-system}, @code{cons}, @code{color-instance}, | |
| 2211 @code{compiled-function}, @code{console}, @code{database}, | |
| 2212 @code{device}, @code{event}, @code{extent}, @code{face}, @code{float}, | |
| 2213 @code{font-instance}, @code{frame}, @code{glyph}, @code{hash-table}, | |
| 2214 @code{image-instance}, @code{integer}, @code{keymap}, @code{marker}, | |
| 2215 @code{process}, @code{range-table}, @code{specifier}, @code{string}, | |
| 2216 @code{subr}, @code{subwindow}, @code{symbol}, @code{toolbar-button}, | |
| 2217 @code{tooltalk-message}, @code{tooltalk-pattern}, @code{vector}, | |
| 2218 @code{weak-list}, @code{window}, @code{window-configuration}, or | |
| 2219 @code{x-resource}. | |
| 2220 | |
| 2221 @example | |
| 2222 (type-of 1) | |
| 2223 @result{} integer | |
| 2224 (type-of 'nil) | |
| 2225 @result{} symbol | |
| 2226 (type-of '()) ; @r{@code{()} is @code{nil}.} | |
| 2227 @result{} symbol | |
| 2228 (type-of '(x)) | |
| 2229 @result{} cons | |
| 2230 @end example | |
| 2231 @end defun | |
| 2232 | |
| 2233 @node Equality Predicates | |
| 2234 @section Equality Predicates | |
| 2235 @cindex equality | |
| 2236 | |
| 2237 Here we describe two functions that test for equality between any two | |
| 2238 objects. Other functions test equality between objects of specific | |
| 2239 types, e.g., strings. For these predicates, see the appropriate chapter | |
| 2240 describing the data type. | |
| 2241 | |
| 2242 @defun eq object1 object2 | |
| 2243 This function returns @code{t} if @var{object1} and @var{object2} are | |
| 2244 the same object, @code{nil} otherwise. The ``same object'' means that a | |
| 2245 change in one will be reflected by the same change in the other. | |
| 2246 | |
| 2247 @code{eq} returns @code{t} if @var{object1} and @var{object2} are | |
|
4471
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2248 integers with the same value. It is preferable to use @code{=} or |
|
4472
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2249 @code{eql} in many contexts for numeric comparison, especially since |
|
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2250 bignums (integers with values that would have otherwise overflowed, only |
|
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2251 available on some builds) with the same value are not @code{eq}; |
|
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2252 @pxref{Comparison of Numbers}. @code{eq} also returns @code{t} if |
|
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2253 @var{object1} and @var{object2} are identical characters, though in this |
|
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2254 case you may prefer to use @code{char=}. |
|
4471
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2255 |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2256 Also, since symbol names are normally unique, if the arguments are |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2257 symbols with the same name, they are @code{eq}. For other types (e.g., |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2258 lists, vectors, strings), two arguments with the same contents or |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2259 elements are not necessarily @code{eq} to each other: they are @code{eq} |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2260 only if they are the same object. |
| 428 | 2261 |
| 2262 (The @code{make-symbol} function returns an uninterned symbol that is | |
| 2263 not interned in the standard @code{obarray}. When uninterned symbols | |
| 2264 are in use, symbol names are no longer unique. Distinct symbols with | |
| 2265 the same name are not @code{eq}. @xref{Creating Symbols}.) | |
| 2266 | |
| 2267 NOTE: Under XEmacs 19, characters are really just integers, and thus | |
|
4472
a99eb40f0b5b
Correct an omitted word, expand on bignum equality in the lispref.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4471
diff
changeset
|
2268 characters and integers with the same numeric code are @code{eq}. Under |
|
4471
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2269 XEmacs 20, it was necessary to preserve remnants of this in function |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2270 such as @code{old-eq} in order to maintain byte-code compatibility. |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2271 Byte code compiled under any Emacs 19 will automatically have calls to |
|
2d39535e1f9d
Say explicitly that eq is useful for chars; xref number comparison, lispref
Aidan Kehoe <kehoea@parhasard.net>
parents:
4265
diff
changeset
|
2272 @code{eq} mapped to @code{old-eq} when executed under XEmacs 20. |
| 428 | 2273 |
| 2274 @example | |
| 2275 @group | |
| 2276 (eq 'foo 'foo) | |
| 2277 @result{} t | |
| 2278 @end group | |
| 2279 | |
| 2280 @group | |
| 2281 (eq 456 456) | |
| 2282 @result{} t | |
| 2283 @end group | |
| 2284 | |
| 2285 @group | |
| 2286 (eq "asdf" "asdf") | |
| 2287 @result{} nil | |
| 2288 @end group | |
| 2289 | |
| 2290 @group | |
| 2291 (eq '(1 (2 (3))) '(1 (2 (3)))) | |
| 2292 @result{} nil | |
| 2293 @end group | |
| 2294 | |
| 2295 @group | |
| 2296 (setq foo '(1 (2 (3)))) | |
| 2297 @result{} (1 (2 (3))) | |
| 2298 (eq foo foo) | |
| 2299 @result{} t | |
| 2300 (eq foo '(1 (2 (3)))) | |
| 2301 @result{} nil | |
| 2302 @end group | |
| 2303 | |
| 2304 @group | |
| 2305 (eq [(1 2) 3] [(1 2) 3]) | |
| 2306 @result{} nil | |
| 2307 @end group | |
| 2308 | |
| 2309 @group | |
| 2310 (eq (point-marker) (point-marker)) | |
| 2311 @result{} nil | |
| 2312 @end group | |
| 2313 @end example | |
| 2314 | |
| 2315 @end defun | |
| 2316 | |
| 444 | 2317 @defun old-eq object1 object2 |
| 428 | 2318 This function exists under XEmacs 20 and is exactly like @code{eq} |
| 2319 except that it suffers from the char-int confoundance disease. | |
| 2320 In other words, it returns @code{t} if given a character and the | |
| 2321 equivalent integer, even though the objects are of different types! | |
| 2322 You should @emph{not} ever call this function explicitly in your | |
| 2323 code. However, be aware that all calls to @code{eq} in byte code | |
| 2324 compiled under version 19 map to @code{old-eq} in XEmacs 20. | |
| 2325 (Likewise for @code{old-equal}, @code{old-memq}, @code{old-member}, | |
| 2326 @code{old-assq} and @code{old-assoc}.) | |
| 2327 | |
| 2328 @example | |
| 2329 @group | |
| 2330 ;; @r{Remember, this does not apply under XEmacs 19.} | |
| 2331 ?A | |
| 2332 @result{} ?A | |
| 2333 (char-int ?A) | |
| 2334 @result{} 65 | |
| 2335 (old-eq ?A 65) | |
| 2336 @result{} t ; @r{Eek, we've been infected.} | |
| 2337 (eq ?A 65) | |
| 2338 @result{} nil ; @r{We are still healthy.} | |
| 2339 @end group | |
| 2340 @end example | |
| 2341 @end defun | |
| 2342 | |
| 2343 @defun equal object1 object2 | |
| 2344 This function returns @code{t} if @var{object1} and @var{object2} have | |
| 2345 equal components, @code{nil} otherwise. Whereas @code{eq} tests if its | |
| 2346 arguments are the same object, @code{equal} looks inside nonidentical | |
| 2347 arguments to see if their elements are the same. So, if two objects are | |
| 2348 @code{eq}, they are @code{equal}, but the converse is not always true. | |
| 2349 | |
| 2350 @example | |
| 2351 @group | |
| 2352 (equal 'foo 'foo) | |
| 2353 @result{} t | |
| 2354 @end group | |
| 2355 | |
| 2356 @group | |
| 2357 (equal 456 456) | |
| 2358 @result{} t | |
| 2359 @end group | |
| 2360 | |
| 2361 @group | |
| 2362 (equal "asdf" "asdf") | |
| 2363 @result{} t | |
| 2364 @end group | |
| 2365 @group | |
| 2366 (eq "asdf" "asdf") | |
| 2367 @result{} nil | |
| 2368 @end group | |
| 2369 | |
| 2370 @group | |
| 2371 (equal '(1 (2 (3))) '(1 (2 (3)))) | |
| 2372 @result{} t | |
| 2373 @end group | |
| 2374 @group | |
| 2375 (eq '(1 (2 (3))) '(1 (2 (3)))) | |
| 2376 @result{} nil | |
| 2377 @end group | |
| 2378 | |
| 2379 @group | |
| 2380 (equal [(1 2) 3] [(1 2) 3]) | |
| 2381 @result{} t | |
| 2382 @end group | |
| 2383 @group | |
| 2384 (eq [(1 2) 3] [(1 2) 3]) | |
| 2385 @result{} nil | |
| 2386 @end group | |
| 2387 | |
| 2388 @group | |
| 2389 (equal (point-marker) (point-marker)) | |
| 2390 @result{} t | |
| 2391 @end group | |
| 2392 | |
| 2393 @group | |
| 2394 (eq (point-marker) (point-marker)) | |
| 2395 @result{} nil | |
| 2396 @end group | |
| 2397 @end example | |
| 2398 | |
| 2399 Comparison of strings is case-sensitive. | |
| 2400 | |
| 2401 Note that in FSF GNU Emacs, comparison of strings takes into account | |
| 2402 their text properties, and you have to use @code{string-equal} if you | |
| 2403 want only the strings themselves compared. This difference does not | |
| 2404 exist in XEmacs; @code{equal} and @code{string-equal} always return | |
| 2405 the same value on the same strings. | |
| 2406 | |
| 2407 @ignore @c Not true in XEmacs | |
| 2408 Comparison of strings is case-sensitive and takes account of text | |
| 2409 properties as well as the characters in the strings. To compare | |
| 2410 two strings' characters without comparing their text properties, | |
| 2411 use @code{string=} (@pxref{Text Comparison}). | |
| 2412 @end ignore | |
| 2413 | |
| 2414 @example | |
| 2415 @group | |
| 2416 (equal "asdf" "ASDF") | |
| 2417 @result{} nil | |
| 2418 @end group | |
| 2419 @end example | |
| 2420 | |
| 2421 Two distinct buffers are never @code{equal}, even if their contents | |
| 2422 are the same. | |
| 2423 @end defun | |
| 2424 | |
| 2425 The test for equality is implemented recursively, and circular lists may | |
| 2426 therefore cause infinite recursion (leading to an error). | |
|
4792
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2427 |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2428 @defun equalp object1 object2 |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2429 This function is like @code{equal}, but compares characters and strings |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2430 case-insensitively; numbers are compared using @code{=}; arrays (that |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2431 is, strings, bit-vectors and vectors) are regarded as being |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2432 @code{equalp} if their contents are @code{equalp}; and |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2433 @code{hash-tables} are @code{equalp} if their values are @code{equalp} |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2434 and they would otherwise be @code{equal}. |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2435 |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2436 @code{equalp} is recursive with vectors, lists and hash-tables, but not |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2437 with other complex types. For types without a defined @code{equalp} |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2438 behavior, @code{equalp} behaves as @code{equal} does. |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2439 |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2440 @example |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2441 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2442 (equalp "asdf" "ASDF") |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2443 @result{} t |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2444 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2445 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2446 (equalp "asdf" [?a ?s ?D ?F]) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2447 @result{} t |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2448 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2449 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2450 (equalp "asdf" [?a ?s ?D ?F ?g]) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2451 @result{} nil |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2452 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2453 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2454 (equalp "" (bit-vector)) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2455 @result{} t |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2456 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2457 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2458 (equalp #s(hash-table) (make-hash-table)) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2459 @result{} t |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2460 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2461 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2462 (equalp #s(hash-table data (t "hi there")) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2463 (let ((ht (make-hash-table))) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2464 (puthash t "HI THERE" ht) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2465 ht)) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2466 @result{} t |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2467 @group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2468 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2469 (equalp #s(hash-table test eq data (1.0 "hi there")) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2470 (let ((ht (make-hash-table :test 'eql))) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2471 (puthash 1.0 "HI THERE" ht) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2472 ht)) |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2473 @result{} nil |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2474 @end group |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2475 @end example |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2476 @end defun |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2477 |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2478 @code{equalp} can also provoke an error if handed a circular structure, |
|
95b04754ea8c
Make #'equalp more compatible with CL; add a compiler macro, test & doc it.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4486
diff
changeset
|
2479 as with @code{equal}. |