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