source: vendor/python/2.5/Doc/tut/glossary.tex

Last change on this file was 3225, checked in by bird, 18 years ago

Python 2.5

File size: 15.6 KB
Line 
1\chapter{Glossary\label{glossary}}
2
3%%% keep the entries sorted and include at least one \index{} item for each
4%%% cross-references are marked with \emph{entry}
5
6\begin{description}
7
8
9\index{>>>}
10\item[\code{>>>}]
11The typical Python prompt of the interactive shell. Often seen for
12code examples that can be tried right away in the interpreter.
13
14\index{...}
15\item[\code{.\code{.}.}]
16The typical Python prompt of the interactive shell when entering code
17for an indented code block.
18
19\index{BDFL}
20\item[BDFL]
21Benevolent Dictator For Life, a.k.a. \ulink{Guido van
22Rossum}{http://www.python.org/\textasciitilde{}guido/}, Python's creator.
23
24\index{byte code}
25\item[byte code]
26The internal representation of a Python program in the interpreter.
27The byte code is also cached in \code{.pyc} and \code{.pyo}
28files so that executing the same file is faster the second time
29(recompilation from source to byte code can be avoided). This
30``intermediate language'' is said to run on a ``virtual
31machine'' that calls the subroutines corresponding to each bytecode.
32
33\index{classic class}
34\item[classic class]
35Any class which does not inherit from \class{object}. See
36\emph{new-style class}.
37
38\index{coercion}
39\item[coercion]
40The implicit conversion of an instance of one type to another during an
41operation which involves two arguments of the same type. For example,
42{}\code{int(3.15)} converts the floating point number to the integer
43{}\code{3}, but in {}\code{3+4.5}, each argument is of a different type (one
44int, one float), and both must be converted to the same type before they can
45be added or it will raise a {}\code{TypeError}. Coercion between two
46operands can be performed with the {}\code{coerce} builtin function; thus,
47{}\code{3+4.5} is equivalent to calling {}\code{operator.add(*coerce(3,
484.5))} and results in {}\code{operator.add(3.0, 4.5)}. Without coercion,
49all arguments of even compatible types would have to be normalized to the
50same value by the programmer, e.g., {}\code{float(3)+4.5} rather than just
51{}\code{3+4.5}.
52
53\index{complex number}
54\item[complex number]
55An extension of the familiar real number system in which all numbers are
56expressed as a sum of a real part and an imaginary part. Imaginary numbers
57are real multiples of the imaginary unit (the square root of {}\code{-1}),
58often written {}\code{i} in mathematics or {}\code{j} in engineering.
59Python has builtin support for complex numbers, which are written with this
60latter notation; the imaginary part is written with a {}\code{j} suffix,
61e.g., {}\code{3+1j}. To get access to complex equivalents of the
62{}\module{math} module, use {}\module{cmath}. Use of complex numbers is a
63fairly advanced mathematical feature. If you're not aware of a need for them,
64it's almost certain you can safely ignore them.
65
66\index{descriptor}
67\item[descriptor]
68Any \emph{new-style} object that defines the methods
69{}\method{__get__()}, \method{__set__()}, or \method{__delete__()}.
70When a class attribute is a descriptor, its special binding behavior
71is triggered upon attribute lookup. Normally, writing \var{a.b} looks
72up the object \var{b} in the class dictionary for \var{a}, but if
73{}\var{b} is a descriptor, the defined method gets called.
74Understanding descriptors is a key to a deep understanding of Python
75because they are the basis for many features including functions,
76methods, properties, class methods, static methods, and reference to
77super classes.
78
79\index{dictionary}
80\item[dictionary]
81An associative array, where arbitrary keys are mapped to values. The
82use of \class{dict} much resembles that for \class{list}, but the keys
83can be any object with a \method{__hash__()} function, not just
84integers starting from zero. Called a hash in Perl.
85
86\index{duck-typing}
87\item[duck-typing]
88Pythonic programming style that determines an object's type by inspection
89of its method or attribute signature rather than by explicit relationship
90to some type object ("If it looks like a duck and quacks like a duck, it
91must be a duck.") By emphasizing interfaces rather than specific types,
92well-designed code improves its flexibility by allowing polymorphic
93substitution. Duck-typing avoids tests using \function{type()} or
94\function{isinstance()}. Instead, it typically employs
95\function{hasattr()} tests or {}\emph{EAFP} programming.
96
97\index{EAFP}
98\item[EAFP]
99Easier to ask for forgiveness than permission. This common Python
100coding style assumes the existence of valid keys or attributes and
101catches exceptions if the assumption proves false. This clean and
102fast style is characterized by the presence of many \keyword{try} and
103{}\keyword{except} statements. The technique contrasts with the
104{}\emph{LBYL} style that is common in many other languages such as C.
105
106\index{__future__}
107\item[__future__]
108A pseudo module which programmers can use to enable new language
109features which are not compatible with the current interpreter. For
110example, the expression \code{11/4} currently evaluates to \code{2}.
111If the module in which it is executed had enabled \emph{true division}
112by executing:
113
114\begin{verbatim}
115from __future__ import division
116\end{verbatim}
117
118the expression \code{11/4} would evaluate to \code{2.75}. By
119importing the \ulink{\module{__future__}}{../lib/module-future.html}
120module and evaluating its variables, you can see when a new feature
121was first added to the language and when it will become the default:
122
123\begin{verbatim}
124>>> import __future__
125>>> __future__.division
126_Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)
127\end{verbatim}
128
129\index{generator}
130\item[generator]
131A function that returns an iterator. It looks like a normal function except
132that values are returned to the caller using a \keyword{yield} statement
133instead of a {}\keyword{return} statement. Generator functions often
134contain one or more {}\keyword{for} or \keyword{while} loops that
135\keyword{yield} elements back to the caller. The function execution is
136stopped at the {}\keyword{yield} keyword (returning the result) and is
137resumed there when the next element is requested by calling the
138\method{next()} method of the returned iterator.
139
140\index{generator expression}
141\item[generator expression]
142An expression that returns a generator. It looks like a normal expression
143followed by a \keyword{for} expression defining a loop variable, range, and
144an optional \keyword{if} expression. The combined expression generates
145values for an enclosing function:
146
147\begin{verbatim}
148>>> sum(i*i for i in range(10)) # sum of squares 0, 1, 4, ... 81
149285
150\end{verbatim}
151
152\index{GIL}
153\item[GIL]
154See \emph{global interpreter lock}.
155
156\index{global interpreter lock}
157\item[global interpreter lock]
158The lock used by Python threads to assure that only one thread can be
159run at a time. This simplifies Python by assuring that no two
160processes can access the same memory at the same time. Locking the
161entire interpreter makes it easier for the interpreter to be
162multi-threaded, at the expense of some parallelism on multi-processor
163machines. Efforts have been made in the past to create a
164``free-threaded'' interpreter (one which locks shared data at a much
165finer granularity), but performance suffered in the common
166single-processor case.
167
168\index{IDLE}
169\item[IDLE]
170An Integrated Development Environment for Python. IDLE is a
171basic editor and interpreter environment that ships with the standard
172distribution of Python. Good for beginners, it also serves as clear
173example code for those wanting to implement a moderately
174sophisticated, multi-platform GUI application.
175
176\index{immutable}
177\item[immutable]
178An object with fixed value. Immutable objects are numbers, strings or
179tuples (and more). Such an object cannot be altered. A new object
180has to be created if a different value has to be stored. They play an
181important role in places where a constant hash value is needed, for
182example as a key in a dictionary.
183
184\index{integer division}
185\item[integer division]
186Mathematical division discarding any remainder. For example, the
187expression \code{11/4} currently evaluates to \code{2} in contrast
188to the \code{2.75} returned by float division. Also called
189{}\emph{floor division}. When dividing two integers the outcome will
190always be another integer (having the floor function applied to it).
191However, if one of the operands is another numeric type (such as a
192{}\class{float}), the result will be coerced (see \emph{coercion}) to
193a common type. For example, an integer divided by a float will result
194in a float value, possibly with a decimal fraction. Integer division
195can be forced by using the \code{//} operator instead of the \code{/}
196operator. See also \emph{__future__}.
197
198\index{interactive}
199\item[interactive]
200Python has an interactive interpreter which means that you can try out
201things and immediately see their results. Just launch \code{python} with no
202arguments (possibly by selecting it from your computer's main menu).
203It is a very powerful way to test out new ideas or inspect modules and
204packages (remember \code{help(x)}).
205
206\index{interpreted}
207\item[interpreted]
208Python is an interpreted language, as opposed to a compiled one. This means
209that the source files can be run directly without first creating an
210executable which is then run. Interpreted languages typically have a
211shorter development/debug cycle than compiled ones, though their programs
212generally also run more slowly. See also {}\emph{interactive}.
213
214\index{iterable}
215\item[iterable]
216A container object capable of returning its members one at a time.
217Examples of iterables include all sequence types (such as \class{list},
218{}\class{str}, and \class{tuple}) and some non-sequence types like
219{}\class{dict} and \class{file} and objects of any classes you define
220with an \method{__iter__()} or \method{__getitem__()} method. Iterables
221can be used in a \keyword{for} loop and in many other places where a
222sequence is needed (\function{zip()}, \function{map()}, ...). When an
223iterable object is passed as an argument to the builtin function
224{}\function{iter()}, it returns an iterator for the object. This
225iterator is good for one pass over the set of values. When using
226iterables, it is usually not necessary to call \function{iter()} or
227deal with iterator objects yourself. The \code{for} statement does
228that automatically for you, creating a temporary unnamed variable to
229hold the iterator for the duration of the loop. See also
230{}\emph{iterator}, \emph{sequence}, and \emph{generator}.
231
232\index{iterator}
233\item[iterator]
234An object representing a stream of data. Repeated calls to the
235iterator's \method{next()} method return successive items in the
236stream. When no more data is available a \exception{StopIteration}
237exception is raised instead. At this point, the iterator object is
238exhausted and any further calls to its \method{next()} method just
239raise \exception{StopIteration} again. Iterators are required to have
240an \method{__iter__()} method that returns the iterator object
241itself so every iterator is also iterable and may be used in most
242places where other iterables are accepted. One notable exception is
243code that attempts multiple iteration passes. A container object
244(such as a \class{list}) produces a fresh new iterator each time you
245pass it to the \function{iter()} function or use it in a
246{}\keyword{for} loop. Attempting this with an iterator will just
247return the same exhausted iterator object used in the previous iteration
248pass, making it appear like an empty container.
249
250\index{LBYL}
251\item[LBYL]
252Look before you leap. This coding style explicitly tests for
253pre-conditions before making calls or lookups. This style contrasts
254with the \emph{EAFP} approach and is characterized by the presence of
255many \keyword{if} statements.
256
257\index{list comprehension}
258\item[list comprehension]
259A compact way to process all or a subset of elements in a sequence and
260return a list with the results. \code{result = ["0x\%02x"
261\% x for x in range(256) if x \% 2 == 0]} generates a list of strings
262containing hex numbers (0x..) that are even and in the range from 0 to 255.
263The \keyword{if} clause is optional. If omitted, all elements in
264{}\code{range(256)} are processed.
265
266\index{mapping}
267\item[mapping]
268A container object (such as \class{dict}) that supports arbitrary key
269lookups using the special method \method{__getitem__()}.
270
271\index{metaclass}
272\item[metaclass]
273The class of a class. Class definitions create a class name, a class
274dictionary, and a list of base classes. The metaclass is responsible
275for taking those three arguments and creating the class. Most object
276oriented programming languages provide a default implementation. What
277makes Python special is that it is possible to create custom
278metaclasses. Most users never need this tool, but when the need
279arises, metaclasses can provide powerful, elegant solutions. They
280have been used for logging attribute access, adding thread-safety,
281tracking object creation, implementing singletons, and many other
282tasks.
283
284\index{mutable}
285\item[mutable]
286Mutable objects can change their value but keep their \function{id()}.
287See also \emph{immutable}.
288
289\index{namespace}
290\item[namespace]
291The place where a variable is stored. Namespaces are implemented as
292dictionaries. There are the local, global and builtin namespaces
293as well as nested namespaces in objects (in methods). Namespaces support
294modularity by preventing naming conflicts. For instance, the
295functions \function{__builtin__.open()} and \function{os.open()} are
296distinguished by their namespaces. Namespaces also aid readability
297and maintainability by making it clear which module implements a
298function. For instance, writing \function{random.seed()} or
299{}\function{itertools.izip()} makes it clear that those functions are
300implemented by the \ulink{\module{random}}{../lib/module-random.html}
301and \ulink{\module{itertools}}{../lib/module-itertools.html} modules
302respectively.
303
304\index{nested scope}
305\item[nested scope]
306The ability to refer to a variable in an enclosing definition. For
307instance, a function defined inside another function can refer to
308variables in the outer function. Note that nested scopes work only
309for reference and not for assignment which will always write to the
310innermost scope. In contrast, local variables both read and write in
311the innermost scope. Likewise, global variables read and write to the
312global namespace.
313
314\index{new-style class}
315\item[new-style class]
316Any class that inherits from \class{object}. This includes all
317built-in types like \class{list} and \class{dict}. Only new-style
318classes can use Python's newer, versatile features like
319{}\method{__slots__}, descriptors, properties,
320\method{__getattribute__()}, class methods, and static methods.
321
322\index{Python3000}
323\item[Python3000]
324A mythical python release, not required to be backward compatible, with
325telepathic interface.
326
327\index{__slots__}
328\item[__slots__]
329A declaration inside a \emph{new-style class} that saves memory by
330pre-declaring space for instance attributes and eliminating instance
331dictionaries. Though popular, the technique is somewhat tricky to get
332right and is best reserved for rare cases where there are large
333numbers of instances in a memory-critical application.
334
335\index{sequence}
336\item[sequence]
337An \emph{iterable} which supports efficient element access using
338integer indices via the \method{__getitem__()} and
339{}\method{__len__()} special methods. Some built-in sequence types
340are \class{list}, \class{str}, \class{tuple}, and \class{unicode}.
341Note that \class{dict} also supports \method{__getitem__()} and
342{}\method{__len__()}, but is considered a mapping rather than a
343sequence because the lookups use arbitrary \emph{immutable} keys
344rather than integers.
345
346\index{Zen of Python}
347\item[Zen of Python]
348Listing of Python design principles and philosophies that are helpful
349in understanding and using the language. The listing can be found by
350typing ``\code{import this}'' at the interactive prompt.
351
352\end{description}
Note: See TracBrowser for help on using the repository browser.