aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorRichard M. Stallman1994-03-19 00:46:41 +0000
committerRichard M. Stallman1994-03-19 00:46:41 +0000
commit1621af1ec5b5367ce3c0f47bc71432ab56ee8351 (patch)
treeb3ad6bc5c00dd3ff65ac42f5d31368557ba92c02
parenteab699972747d1e503ccb69b6de7dfc2e44ff824 (diff)
downloademacs-1621af1ec5b5367ce3c0f47bc71432ab56ee8351.tar.gz
emacs-1621af1ec5b5367ce3c0f47bc71432ab56ee8351.zip
Initial revision
-rw-r--r--lispref/symbols.texi454
1 files changed, 454 insertions, 0 deletions
diff --git a/lispref/symbols.texi b/lispref/symbols.texi
new file mode 100644
index 00000000000..39f1bbcb80c
--- /dev/null
+++ b/lispref/symbols.texi
@@ -0,0 +1,454 @@
1@c -*-texinfo-*-
2@c This is part of the GNU Emacs Lisp Reference Manual.
3@c Copyright (C) 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc.
4@c See the file elisp.texi for copying conditions.
5@setfilename ../info/symbols
6@node Symbols, Evaluation, Sequences Arrays Vectors, Top
7@chapter Symbols
8@cindex symbol
9
10 A @dfn{symbol} is an object with a unique name. This chapter
11describes symbols, their components, their property lists, and how they
12are created and interned. Separate chapters describe the use of symbols
13as variables and as function names; see @ref{Variables}, and
14@ref{Functions}. For the precise read syntax for symbols, see
15@ref{Symbol Type}.
16
17 You can test whether an arbitrary Lisp object is a symbol
18with @code{symbolp}:
19
20@defun symbolp object
21This function returns @code{t} if @var{object} is a symbol, @code{nil}
22otherwise.
23@end defun
24
25@menu
26* Symbol Components:: Symbols have names, values, function definitions
27 and property lists.
28* Definitions:: A definition says how a symbol will be used.
29* Creating Symbols:: How symbols are kept unique.
30* Property Lists:: Each symbol has a property list
31 for recording miscellaneous information.
32@end menu
33
34@node Symbol Components, Definitions, Symbols, Symbols
35@section Symbol Components
36@cindex symbol components
37
38 Each symbol has four components (or ``cells''), each of which
39references another object:
40
41@table @asis
42@item Print name
43@cindex print name cell
44The @dfn{print name cell} holds a string which names the symbol for
45reading and printing. See @code{symbol-name} in @ref{Creating Symbols}.
46
47@item Value
48@cindex value cell
49The @dfn{value cell} holds the current value of the symbol as a
50variable. When a symbol is used as a form, the value of the form is the
51contents of the symbol's value cell. See @code{symbol-value} in
52@ref{Accessing Variables}.
53
54@item Function
55@cindex function cell
56The @dfn{function cell} holds the function definition of the symbol.
57When a symbol is used as a function, its function definition is used in
58its place. This cell is also used to make a symbol stand for a keymap
59or a keyboard macro, for editor command execution. Because each symbol
60has separate value and function cells, variables and function names do
61not conflict. See @code{symbol-function} in @ref{Function Cells}.
62
63@item Property list
64@cindex property list cell
65The @dfn{property list cell} holds the property list of the symbol. See
66@code{symbol-plist} in @ref{Property Lists}.
67@end table
68
69 The print name cell always holds a string, and cannot be changed. The
70other three cells can be set individually to any specified Lisp object.
71
72 The print name cell holds the string that is the name of the symbol.
73Since symbols are represented textually by their names, it is important
74not to have two symbols with the same name. The Lisp reader ensures
75this: every time it reads a symbol, it looks for an existing symbol with
76the specified name before it creates a new one. (In GNU Emacs Lisp,
77this lookup uses a hashing algorithm and an obarray; see @ref{Creating
78Symbols}.)
79
80 In normal usage, the function cell usually contains a function or
81macro, as that is what the Lisp interpreter expects to see there
82(@pxref{Evaluation}). Keyboard macros (@pxref{Keyboard Macros}),
83keymaps (@pxref{Keymaps}) and autoload objects (@pxref{Autoloading}) are
84also sometimes stored in the function cell of symbols. We often refer
85to ``the function @code{foo}'' when we really mean the function stored
86in the function cell of the symbol @code{foo}. We make the distinction
87only when necessary.
88
89 The property list cell normally should hold a correctly formatted
90property list (@pxref{Property Lists}), as a number of functions expect
91to see a property list there.
92
93 The function cell or the value cell may be @dfn{void}, which means
94that the cell does not reference any object. (This is not the same
95thing as holding the symbol @code{void}, nor the same as holding the
96symbol @code{nil}.) Examining a cell which is void results in an error,
97such as @samp{Symbol's value as variable is void}.
98
99 The four functions @code{symbol-name}, @code{symbol-value},
100@code{symbol-plist}, and @code{symbol-function} return the contents of
101the four cells of a symbol. Here as an example we show the contents of
102the four cells of the symbol @code{buffer-file-name}:
103
104@example
105(symbol-name 'buffer-file-name)
106 @result{} "buffer-file-name"
107(symbol-value 'buffer-file-name)
108 @result{} "/gnu/elisp/symbols.texi"
109(symbol-plist 'buffer-file-name)
110 @result{} (variable-documentation 29529)
111(symbol-function 'buffer-file-name)
112 @result{} #<subr buffer-file-name>
113@end example
114
115@noindent
116Because this symbol is the variable which holds the name of the file
117being visited in the current buffer, the value cell contents we see are
118the name of the source file of this chapter of the Emacs Lisp Manual.
119The property list cell contains the list @code{(variable-documentation
12029529)} which tells the documentation functions where to find the
121documentation string for the variable @code{buffer-file-name} in the
122@file{DOC} file. (29529 is the offset from the beginning of the
123@file{DOC} file to where that documentation string begins.) The
124function cell contains the function for returning the name of the file.
125@code{buffer-file-name} names a primitive function, which has no read
126syntax and prints in hash notation (@pxref{Primitive Function Type}). A
127symbol naming a function written in Lisp would have a lambda expression
128(or a byte-code object) in this cell.
129
130@node Definitions, Creating Symbols, Symbol Components, Symbols
131@section Defining Symbols
132@cindex definition of a symbol
133
134 A @dfn{definition} in Lisp is a special form that announces your
135intention to use a certain symbol in a particular way. In Emacs Lisp,
136you can define a symbol as a variable, or define it as a function (or
137macro), or both independently.
138
139 A definition construct typically specifies a value or meaning for the
140symbol for one kind of use, plus documentation for its meaning when used
141in this way. Thus, when you define a symbol as a variable, you can
142supply an initial value for the variable, plus documentation for the
143variable.
144
145 @code{defvar} and @code{defconst} are special forms that define a
146symbol as a global variable. They are documented in detail in
147@ref{Defining Variables}.
148
149 @code{defun} defines a symbol as a function, creating a lambda
150expression and storing it in the function cell of the symbol. This
151lambda expression thus becomes the function definition of the symbol.
152(The term ``function definition'', meaning the contents of the function
153cell, is derived from the idea that @code{defun} gives the symbol its
154definition as a function.) @xref{Functions}.
155
156 @code{defmacro} defines a symbol as a macro. It creates a macro
157object and stores it in the function cell of the symbol. Note that a
158given symbol can be a macro or a function, but not both at once, because
159both macro and function definitions are kept in the function cell, and
160that cell can hold only one Lisp object at any given time.
161@xref{Macros}.
162
163 In GNU Emacs Lisp, a definition is not required in order to use a
164symbol as a variable or function. Thus, you can make a symbol a global
165variable with @code{setq}, whether you define it first or not. The real
166purpose of definitions is to guide programmers and programming tools.
167They inform programmers who read the code that certain symbols are
168@emph{intended} to be used as variables, or as functions. In addition,
169utilities such as @file{etags} and @file{make-docfile} recognize
170definitions, and add appropriate information to tag tables and the
171@file{emacs/etc/DOC-@var{version}} file. @xref{Accessing Documentation}.
172
173@node Creating Symbols, Property Lists, Definitions, Symbols
174@section Creating and Interning Symbols
175@cindex reading symbols
176
177 To understand how symbols are created in GNU Emacs Lisp, you must know
178how Lisp reads them. Lisp must ensure that it finds the same symbol
179every time it reads the same set of characters. Failure to do so would
180cause complete confusion.
181
182@cindex symbol name hashing
183@cindex hashing
184@cindex obarray
185@cindex bucket (in obarray)
186 When the Lisp reader encounters a symbol, it reads all the characters
187of the name. Then it ``hashes'' those characters to find an index in a
188table called an @dfn{obarray}. Hashing is an efficient method of
189looking something up. For example, instead of searching a telephone
190book cover to cover when looking up Jan Jones, you start with the J's
191and go from there. That is a simple version of hashing. Each element
192of the obarray is a @dfn{bucket} which holds all the symbols with a
193given hash code; to look for a given name, it is sufficient to look
194through all the symbols in the bucket for that name's hash code.
195
196@cindex interning
197 If a symbol with the desired name is found, then it is used. If no
198such symbol is found, then a new symbol is created and added to the
199obarray bucket. Adding a symbol to an obarray is called @dfn{interning}
200it, and the symbol is then called an @dfn{interned symbol}.
201
202@cindex symbol equality
203@cindex uninterned symbol
204 If a symbol is not in the obarray, then there is no way for Lisp to
205find it when its name is read. Such a symbol is called an
206@dfn{uninterned symbol} relative to the obarray. An uninterned symbol
207has all the other characteristics of interned symbols; it has the same
208four cells and they work in the usual way.
209
210 In Emacs Lisp, an obarray is actually a vector. Each element of the
211vector is a bucket; its value is either an interned symbol whose name
212hashes to that bucket, or 0 if the bucket is empty. Each interned
213symbol has an internal link (invisible to the user) to the next symbol
214in the bucket. Because these links are invisible, there is no way to
215find all the symbols in an obarray except using @code{mapatoms} (below).
216The order of symbols in a bucket is not significant.
217
218 In an empty obarray, every element is 0, and you can create an obarray
219with @code{(make-vector @var{length} 0)}. @strong{This is the only
220valid way to create an obarray.} Prime numbers as lengths tend
221to result in good hashing; lengths one less than a power of two are also
222good.
223
224 @strong{Do not try to put symbols in an obarray yourself.} This does
225not work---only @code{intern} can enter a symbol in an obarray properly.
226@strong{Do not try to intern one symbol in two obarrays.} This would
227garble both obarrays, because a symbol has just one slot to hold the
228following symbol in the obarray bucket. The results would be
229unpredictable.
230
231 It is possible for two different symbols to have the same name in
232different obarrays; these symbols are not @code{eq} or @code{equal}.
233However, this normally happens only as part of the abbrev mechanism
234(@pxref{Abbrevs}).
235
236@cindex CL note---symbol in obarrays
237@quotation
238@b{Common Lisp note:} in Common Lisp, a single symbol may be interned in
239several obarrays.
240@end quotation
241
242 Most of the functions below take a name and sometimes an obarray as
243arguments. A @code{wrong-type-argument} error is signaled if the name
244is not a string, or if the obarray is not a vector.
245
246@defun symbol-name symbol
247This function returns the string that is @var{symbol}'s name. For example:
248
249@example
250@group
251(symbol-name 'foo)
252 @result{} "foo"
253@end group
254@end example
255
256Changing the string by substituting characters, etc, does change the
257name of the symbol, but fails to update the obarray, so don't do it!
258@end defun
259
260@defun make-symbol name
261This function returns a newly-allocated, uninterned symbol whose name is
262@var{name} (which must be a string). Its value and function definition
263are void, and its property list is @code{nil}. In the example below,
264the value of @code{sym} is not @code{eq} to @code{foo} because it is a
265distinct uninterned symbol whose name is also @samp{foo}.
266
267@example
268(setq sym (make-symbol "foo"))
269 @result{} foo
270(eq sym 'foo)
271 @result{} nil
272@end example
273@end defun
274
275@defun intern name &optional obarray
276This function returns the interned symbol whose name is @var{name}. If
277there is no such symbol in the obarray @var{obarray}, @code{intern}
278creates a new one, adds it to the obarray, and returns it. If
279@var{obarray} is omitted, the value of the global variable
280@code{obarray} is used.
281
282@example
283(setq sym (intern "foo"))
284 @result{} foo
285(eq sym 'foo)
286 @result{} t
287
288(setq sym1 (intern "foo" other-obarray))
289 @result{} foo
290(eq sym 'foo)
291 @result{} nil
292@end example
293@end defun
294
295@defun intern-soft name &optional obarray
296This function returns the symbol in @var{obarray} whose name is
297@var{name}, or @code{nil} if @var{obarray} has no symbol with that name.
298Therefore, you can use @code{intern-soft} to test whether a symbol with
299a given name is already interned. If @var{obarray} is omitted, the
300value of the global variable @code{obarray} is used.
301
302@smallexample
303(intern-soft "frazzle") ; @r{No such symbol exists.}
304 @result{} nil
305(make-symbol "frazzle") ; @r{Create an uninterned one.}
306 @result{} frazzle
307(intern-soft "frazzle") ; @r{That one cannot be found.}
308 @result{} nil
309(setq sym (intern "frazzle")) ; @r{Create an interned one.}
310 @result{} frazzle
311(intern-soft "frazzle") ; @r{That one can be found!}
312 @result{} frazzle
313@group
314(eq sym 'frazzle) ; @r{And it is the same one.}
315 @result{} t
316@end group
317@end smallexample
318@end defun
319
320@defvar obarray
321This variable is the standard obarray for use by @code{intern} and
322@code{read}.
323@end defvar
324
325@defun mapatoms function &optional obarray
326This function call @var{function} for each symbol in the obarray
327@var{obarray}. It returns @code{nil}. If @var{obarray} is omitted, it
328defaults to the value of @code{obarray}, the standard obarray for
329ordinary symbols.
330
331@smallexample
332(setq count 0)
333 @result{} 0
334(defun count-syms (s)
335 (setq count (1+ count)))
336 @result{} count-syms
337(mapatoms 'count-syms)
338 @result{} nil
339count
340 @result{} 1871
341@end smallexample
342
343See @code{documentation} in @ref{Accessing Documentation}, for another
344example using @code{mapatoms}.
345@end defun
346
347@node Property Lists,, Creating Symbols, Symbols
348@section Property Lists
349@cindex property list
350@cindex plist
351
352 A @dfn{property list} (@dfn{plist} for short) is a list of paired
353elements stored in the property list cell of a symbol. Each of the
354pairs associates a property name (usually a symbol) with a property or
355value. Property lists are generally used to record information about a
356symbol, such as how to compile it, the name of the file where it was
357defined, or perhaps even the grammatical class of the symbol
358(representing a word) in a language understanding system.
359
360 Character positions in a string or buffer can also have property lists.
361@xref{Text Properties}.
362
363 The property names and values in a property list can be any Lisp
364objects, but the names are usually symbols. They are compared using
365@code{eq}. Here is an example of a property list, found on the symbol
366@code{progn} when the compiler is loaded:
367
368@example
369(lisp-indent-function 0 byte-compile byte-compile-progn)
370@end example
371
372@noindent
373Here @code{lisp-indent-function} and @code{byte-compile} are property
374names, and the other two elements are the corresponding values.
375
376@cindex property lists vs association lists
377 Association lists (@pxref{Association Lists}) are very similar to
378property lists. In contrast to association lists, the order of the
379pairs in the property list is not significant since the property names
380must be distinct.
381
382 Property lists are better than association lists for attaching
383information to various Lisp function names or variables. If all the
384associations are recorded in one association list, the program will need
385to search that entire list each time a function or variable is to be
386operated on. By contrast, if the information is recorded in the
387property lists of the function names or variables themselves, each
388search will scan only the length of one property list, which is usually
389short. This is why the documentation for a variable is recorded in a
390property named @code{variable-documentation}. The byte compiler
391likewise uses properties to record those functions needing special
392treatment.
393
394 However, association lists have their own advantages. Depending on
395your application, it may be faster to add an association to the front of
396an association list than to update a property. All properties for a
397symbol are stored in the same property list, so there is a possibility
398of a conflict between different uses of a property name. (For this
399reason, it is a good idea to choose property names that are probably
400unique, such as by including the name of the library in the property
401name.) An association list may be used like a stack where associations
402are pushed on the front of the list and later discarded; this is not
403possible with a property list.
404
405@defun symbol-plist symbol
406This function returns the property list of @var{symbol}.
407@end defun
408
409@defun setplist symbol plist
410 This function sets @var{symbol}'s property list to @var{plist}.
411Normally, @var{plist} should be a well-formed property list, but this is
412not enforced.
413
414@smallexample
415(setplist 'foo '(a 1 b (2 3) c nil))
416 @result{} (a 1 b (2 3) c nil)
417(symbol-plist 'foo)
418 @result{} (a 1 b (2 3) c nil)
419@end smallexample
420
421For symbols in special obarrays, which are not used for ordinary
422purposes, it may make sense to use the property list cell in a
423nonstandard fashion; in fact, the abbrev mechanism does so
424(@pxref{Abbrevs}).
425@end defun
426
427@defun get symbol property
428This function finds the value of the property named @var{property} in
429@var{symbol}'s property list. If there is no such property, @code{nil}
430is returned. Thus, there is no distinction between a value of
431@code{nil} and the absence of the property.
432
433The name @var{property} is compared with the existing property names
434using @code{eq}, so any object is a legitimate property.
435
436See @code{put} for an example.
437@end defun
438
439@defun put symbol property value
440This function puts @var{value} onto @var{symbol}'s property list under
441the property name @var{property}, replacing any previous property value.
442The @code{put} function returns @var{value}.
443
444@smallexample
445(put 'fly 'verb 'transitive)
446 @result{}'transitive
447(put 'fly 'noun '(a buzzing little bug))
448 @result{} (a buzzing little bug)
449(get 'fly 'verb)
450 @result{} transitive
451(symbol-plist 'fly)
452 @result{} (verb transitive noun (a buzzing little bug))
453@end smallexample
454@end defun