blob: 194fbd96e321089801b4bb638210a159f14e3a64 [file] [log] [blame]
Guido van Rossumf10aa982007-08-17 18:30:38 +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.
Christian Heimesd8654cf2007-12-02 15:22:16 +000018
19 argument
20 A value passed to a function or method, assigned to a name local to
21 the body. A function or method may have both positional arguments and
22 keyword arguments in its definition. Positional and keyword arguments
23 may be variable-length: ``*`` accepts or passes (if in the function
24 definition or call) several positional arguments in a list, while ``**``
25 does the same for keyword arguments in a dictionary.
26
27 Any expression may be used within the argument list, and the evaluated
28 value is passed to the local variable.
Guido van Rossumf10aa982007-08-17 18:30:38 +000029
30 BDFL
31 Benevolent Dictator For Life, a.k.a. `Guido van Rossum
32 <http://www.python.org/~guido/>`_, Python's creator.
33
Georg Brandl9afde1c2007-11-01 20:32:30 +000034 bytecode
35 Python source code is compiled into bytecode, the internal representation
36 of a Python program in the interpreter. The bytecode is also cached in
37 ``.pyc`` and ``.pyo`` files so that executing the same file is faster the
38 second time (recompilation from source to bytecode can be avoided). This
39 "intermediate language" is said to run on a "virtual machine" that calls
40 the subroutines corresponding to each bytecode.
Guido van Rossumf10aa982007-08-17 18:30:38 +000041
42 classic class
Georg Brandl85eb8c12007-08-31 16:33:38 +000043 One of the two flavors of classes in earlier Python versions. Since
44 Python 3.0, there are no classic classes anymore.
Guido van Rossumf10aa982007-08-17 18:30:38 +000045
Guido van Rossumf10aa982007-08-17 18:30:38 +000046 complex number
47 An extension of the familiar real number system in which all numbers are
48 expressed as a sum of a real part and an imaginary part. Imaginary
49 numbers are real multiples of the imaginary unit (the square root of
50 ``-1``), often written ``i`` in mathematics or ``j`` in
51 engineering. Python has builtin support for complex numbers, which are
52 written with this latter notation; the imaginary part is written with a
53 ``j`` suffix, e.g., ``3+1j``. To get access to complex equivalents of the
54 :mod:`math` module, use :mod:`cmath`. Use of complex numbers is a fairly
55 advanced mathematical feature. If you're not aware of a need for them,
56 it's almost certain you can safely ignore them.
57
Christian Heimes895627f2007-12-08 17:28:33 +000058 context manager
Christian Heimes3279b5d2007-12-09 15:58:13 +000059 An objects that controls the environment seen in a :keyword:`with`
Christian Heimes895627f2007-12-08 17:28:33 +000060 statement by defining :meth:`__enter__` and :meth:`__exit__` methods.
61 See :pep:`343`.
62
Christian Heimesd8654cf2007-12-02 15:22:16 +000063 decorator
64 A function returning another function, usually applied as a function
65 transformation using the ``@wrapper`` syntax. Common examples for
66 decorators are :func:`classmethod` and :func:`staticmethod`.
67
68 The decorator syntax is merely syntactic sugar, the following two
69 function definitions are semantically equivalent::
70
71 def f(...):
72 ...
73 f = staticmethod(f)
74
75 @staticmethod
76 def f(...):
77 ...
78
Georg Brandla09ca382007-12-02 18:20:12 +000079 The same concept exists for classes, but is less commonly used there.
80
Guido van Rossumf10aa982007-08-17 18:30:38 +000081 descriptor
Georg Brandl85eb8c12007-08-31 16:33:38 +000082 An object that defines the methods :meth:`__get__`, :meth:`__set__`, or
83 :meth:`__delete__`. When a class attribute is a descriptor, its special
Georg Brandl9afde1c2007-11-01 20:32:30 +000084 binding behavior is triggered upon attribute lookup. Normally, using
85 *a.b* to get, set or delete an attribute looks up the object named *b* in
86 the class dictionary for *a*, but if *b* is a descriptor, the respective
87 descriptor method gets called. Understanding descriptors is a key to a
88 deep understanding of Python because they are the basis for many features
89 including functions, methods, properties, class methods, static methods,
90 and reference to super classes.
91
92 For more information about descriptors' methods, see :ref:`descriptors`.
Guido van Rossumf10aa982007-08-17 18:30:38 +000093
94 dictionary
95 An associative array, where arbitrary keys are mapped to values. The use
96 of :class:`dict` much resembles that for :class:`list`, but the keys can
97 be any object with a :meth:`__hash__` function, not just integers starting
98 from zero. Called a hash in Perl.
99
100 duck-typing
101 Pythonic programming style that determines an object's type by inspection
102 of its method or attribute signature rather than by explicit relationship
103 to some type object ("If it looks like a duck and quacks like a duck, it
104 must be a duck.") By emphasizing interfaces rather than specific types,
105 well-designed code improves its flexibility by allowing polymorphic
106 substitution. Duck-typing avoids tests using :func:`type` or
107 :func:`isinstance`. Instead, it typically employs :func:`hasattr` tests or
108 :term:`EAFP` programming.
109
110 EAFP
111 Easier to ask for forgiveness than permission. This common Python coding
112 style assumes the existence of valid keys or attributes and catches
113 exceptions if the assumption proves false. This clean and fast style is
114 characterized by the presence of many :keyword:`try` and :keyword:`except`
115 statements. The technique contrasts with the :term:`LBYL` style that is
116 common in many other languages such as C.
117
Christian Heimesd8654cf2007-12-02 15:22:16 +0000118 expression
119 A piece of syntax which can be evaluated to some value. In other words,
120 an expression is an accumulation of expression elements like literals, names,
121 attribute access, operators or function calls that all return a value.
122 In contrast to other languages, not all language constructs are expressions,
123 but there are also :term:`statement`\s that cannot be used as expressions,
Georg Brandla09ca382007-12-02 18:20:12 +0000124 such as :keyword:`while` or :keyword:`if`. Assignments are also not
Christian Heimesd8654cf2007-12-02 15:22:16 +0000125 expressions.
126
Guido van Rossumf10aa982007-08-17 18:30:38 +0000127 extension module
128 A module written in C, using Python's C API to interact with the core and
129 with user code.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000130
131 function
132 A series of statements which returns some value to a caller. It can also
133 be passed zero or more arguments which may be used in the execution of
134 the body. See also :term:`argument` and :term:`method`.
135
Guido van Rossumf10aa982007-08-17 18:30:38 +0000136 __future__
137 A pseudo module which programmers can use to enable new language features
138 which are not compatible with the current interpreter. For example, the
139 expression ``11/4`` currently evaluates to ``2``. If the module in which
140 it is executed had enabled *true division* by executing::
141
142 from __future__ import division
143
144 the expression ``11/4`` would evaluate to ``2.75``. By importing the
145 :mod:`__future__` module and evaluating its variables, you can see when a
146 new feature was first added to the language and when it will become the
147 default::
148
149 >>> import __future__
150 >>> __future__.division
151 _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)
152
153 garbage collection
154 The process of freeing memory when it is not used anymore. Python
155 performs garbage collection via reference counting and a cyclic garbage
156 collector that is able to detect and break reference cycles.
157
158 generator
159 A function that returns an iterator. It looks like a normal function
160 except that values are returned to the caller using a :keyword:`yield`
161 statement instead of a :keyword:`return` statement. Generator functions
162 often contain one or more :keyword:`for` or :keyword:`while` loops that
163 :keyword:`yield` elements back to the caller. The function execution is
164 stopped at the :keyword:`yield` keyword (returning the result) and is
165 resumed there when the next element is requested by calling the
166 :meth:`next` method of the returned iterator.
167
168 .. index:: single: generator expression
169
170 generator expression
171 An expression that returns a generator. It looks like a normal expression
172 followed by a :keyword:`for` expression defining a loop variable, range,
173 and an optional :keyword:`if` expression. The combined expression
174 generates values for an enclosing function::
175
176 >>> sum(i*i for i in range(10)) # sum of squares 0, 1, 4, ... 81
177 285
178
179 GIL
180 See :term:`global interpreter lock`.
181
182 global interpreter lock
183 The lock used by Python threads to assure that only one thread can be run
184 at a time. This simplifies Python by assuring that no two processes can
185 access the same memory at the same time. Locking the entire interpreter
186 makes it easier for the interpreter to be multi-threaded, at the expense
187 of some parallelism on multi-processor machines. Efforts have been made
188 in the past to create a "free-threaded" interpreter (one which locks
189 shared data at a much finer granularity), but performance suffered in the
190 common single-processor case.
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000191
192 hashable
193 An object is *hashable* if it has a hash value that never changes during
194 its lifetime (it needs a :meth:`__hash__` method), and can be compared to
195 other objects (it needs an :meth:`__eq__` or :meth:`__cmp__` method).
196 Hashable objects that compare equal must have the same hash value.
197
198 Hashability makes an object usable as a dictionary key and a set member,
199 because these data structures use the hash value internally.
200
201 All of Python's immutable built-in objects are hashable, while all mutable
202 containers (such as lists or dictionaries) are not. Objects that are
203 instances of user-defined classes are hashable by default; they all
204 compare unequal, and their hash value is their :func:`id`.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000205
206 IDLE
207 An Integrated Development Environment for Python. IDLE is a basic editor
208 and interpreter environment that ships with the standard distribution of
209 Python. Good for beginners, it also serves as clear example code for
210 those wanting to implement a moderately sophisticated, multi-platform GUI
211 application.
212
213 immutable
214 An object with fixed value. Immutable objects are numbers, strings or
215 tuples (and more). Such an object cannot be altered. A new object has to
216 be created if a different value has to be stored. They play an important
217 role in places where a constant hash value is needed, for example as a key
218 in a dictionary.
219
220 integer division
221 Mathematical division discarding any remainder. For example, the
222 expression ``11/4`` currently evaluates to ``2`` in contrast to the
Neil Schemenauer16c70752007-09-21 20:19:23 +0000223 ``2.75`` returned by float division. Also called *floor division*. When
224 dividing two integers the outcome will always be another integer (having
225 the floor function applied to it). However, if the operands types are
226 different, one of them will be converted to the other's type. For
227 example, an integer divided by a float will result in a float value,
228 possibly with a decimal fraction. Integer division can be forced by using
229 the ``//`` operator instead of the ``/`` operator. See also
230 :term:`__future__`.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000231
232 interactive
233 Python has an interactive interpreter which means that you can try out
234 things and immediately see their results. Just launch ``python`` with no
235 arguments (possibly by selecting it from your computer's main menu). It is
236 a very powerful way to test out new ideas or inspect modules and packages
237 (remember ``help(x)``).
238
239 interpreted
240 Python is an interpreted language, as opposed to a compiled one. This
241 means that the source files can be run directly without first creating an
242 executable which is then run. Interpreted languages typically have a
243 shorter development/debug cycle than compiled ones, though their programs
244 generally also run more slowly. See also :term:`interactive`.
245
246 iterable
247 A container object capable of returning its members one at a
248 time. Examples of iterables include all sequence types (such as
249 :class:`list`, :class:`str`, and :class:`tuple`) and some non-sequence
250 types like :class:`dict` and :class:`file` and objects of any classes you
251 define with an :meth:`__iter__` or :meth:`__getitem__` method. Iterables
252 can be used in a :keyword:`for` loop and in many other places where a
253 sequence is needed (:func:`zip`, :func:`map`, ...). When an iterable
254 object is passed as an argument to the builtin function :func:`iter`, it
255 returns an iterator for the object. This iterator is good for one pass
256 over the set of values. When using iterables, it is usually not necessary
257 to call :func:`iter` or deal with iterator objects yourself. The ``for``
258 statement does that automatically for you, creating a temporary unnamed
259 variable to hold the iterator for the duration of the loop. See also
260 :term:`iterator`, :term:`sequence`, and :term:`generator`.
261
262 iterator
263 An object representing a stream of data. Repeated calls to the iterator's
264 :meth:`next` method return successive items in the stream. When no more
265 data is available a :exc:`StopIteration` exception is raised instead. At
266 this point, the iterator object is exhausted and any further calls to its
267 :meth:`next` method just raise :exc:`StopIteration` again. Iterators are
268 required to have an :meth:`__iter__` method that returns the iterator
269 object itself so every iterator is also iterable and may be used in most
270 places where other iterables are accepted. One notable exception is code
271 that attempts multiple iteration passes. A container object (such as a
272 :class:`list`) produces a fresh new iterator each time you pass it to the
273 :func:`iter` function or use it in a :keyword:`for` loop. Attempting this
274 with an iterator will just return the same exhausted iterator object used
275 in the previous iteration pass, making it appear like an empty container.
276
Georg Brandl9afde1c2007-11-01 20:32:30 +0000277 More information can be found in :ref:`typeiter`.
278
Christian Heimesd8654cf2007-12-02 15:22:16 +0000279 keyword argument
280 Arguments which are preceded with a ``variable_name=`` in the call.
281 The variable name designates the local name in the function to which the
282 value is assigned. ``**`` is used to accept or pass a dictionary of
283 keyword arguments. See :term:`argument`.
284
285 lambda
286 An anonymous inline function consisting of a single :term:`expression`
287 which is evaluated when the function is called. The syntax to create
288 a lambda function is ``lambda [arguments]: expression``
289
Guido van Rossumf10aa982007-08-17 18:30:38 +0000290 LBYL
291 Look before you leap. This coding style explicitly tests for
292 pre-conditions before making calls or lookups. This style contrasts with
293 the :term:`EAFP` approach and is characterized by the presence of many
294 :keyword:`if` statements.
295
296 list comprehension
297 A compact way to process all or a subset of elements in a sequence and
298 return a list with the results. ``result = ["0x%02x" % x for x in
299 range(256) if x % 2 == 0]`` generates a list of strings containing hex
300 numbers (0x..) that are even and in the range from 0 to 255. The
301 :keyword:`if` clause is optional. If omitted, all elements in
302 ``range(256)`` are processed.
303
304 mapping
305 A container object (such as :class:`dict`) that supports arbitrary key
306 lookups using the special method :meth:`__getitem__`.
307
308 metaclass
309 The class of a class. Class definitions create a class name, a class
310 dictionary, and a list of base classes. The metaclass is responsible for
311 taking those three arguments and creating the class. Most object oriented
312 programming languages provide a default implementation. What makes Python
313 special is that it is possible to create custom metaclasses. Most users
314 never need this tool, but when the need arises, metaclasses can provide
315 powerful, elegant solutions. They have been used for logging attribute
316 access, adding thread-safety, tracking object creation, implementing
317 singletons, and many other tasks.
Georg Brandl9afde1c2007-11-01 20:32:30 +0000318
319 More information can be found in :ref:`metaclasses`.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000320
321 method
322 A function that is defined inside a class body. If called as an attribute
323 of an instance of that class, the method will get the instance object as
324 its first :term:`argument` (which is usually called ``self``).
325 See :term:`function` and :term:`nested scope`.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000326
327 mutable
328 Mutable objects can change their value but keep their :func:`id`. See
329 also :term:`immutable`.
Christian Heimes25bb7832008-01-11 16:17:00 +0000330
331 named tuple
332 A tuple subclass whose elements also are accessible as attributes via
333 fixed names (the class name and field names are indicated in the
334 individual documentation of a named tuple type, like ``TestResults(failed,
335 attempted)``). Named tuple classes are created by
336 :func:`collections.namedtuple`.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000337
338 namespace
339 The place where a variable is stored. Namespaces are implemented as
340 dictionaries. There are the local, global and builtin namespaces as well
341 as nested namespaces in objects (in methods). Namespaces support
342 modularity by preventing naming conflicts. For instance, the functions
Georg Brandl1a3284e2007-12-02 09:40:06 +0000343 :func:`builtins.open` and :func:`os.open` are distinguished by their
Guido van Rossumf10aa982007-08-17 18:30:38 +0000344 namespaces. Namespaces also aid readability and maintainability by making
345 it clear which module implements a function. For instance, writing
346 :func:`random.seed` or :func:`itertools.izip` makes it clear that those
347 functions are implemented by the :mod:`random` and :mod:`itertools`
348 modules respectively.
349
350 nested scope
351 The ability to refer to a variable in an enclosing definition. For
352 instance, a function defined inside another function can refer to
353 variables in the outer function. Note that nested scopes work only for
354 reference and not for assignment which will always write to the innermost
355 scope. In contrast, local variables both read and write in the innermost
356 scope. Likewise, global variables read and write to the global namespace.
357
358 new-style class
Georg Brandl85eb8c12007-08-31 16:33:38 +0000359 Old name for the flavor of classes now used for all class objects. In
360 earlier Python versions, only new-style classes could use Python's newer,
361 versatile features like :attr:`__slots__`, descriptors, properties,
362 :meth:`__getattribute__`, class methods, and static methods.
Georg Brandl9afde1c2007-11-01 20:32:30 +0000363
364 More information can be found in :ref:`newstyle`.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000365
Christian Heimesd8654cf2007-12-02 15:22:16 +0000366 positional argument
367 The arguments assigned to local names inside a function or method,
368 determined by the order in which they were given in the call. ``*`` is
369 used to either accept multiple positional arguments (when in the
370 definition), or pass several arguments as a list to a function. See
371 :term:`argument`.
372
Guido van Rossumf10aa982007-08-17 18:30:38 +0000373 Python 3000
Georg Brandla09ca382007-12-02 18:20:12 +0000374 Nickname for the Python 3.x release line (coined long ago when the
Guido van Rossumf10aa982007-08-17 18:30:38 +0000375 release of version 3 was something in the distant future.)
376
Christian Heimesd8654cf2007-12-02 15:22:16 +0000377 Pythonic
378 An idea or piece of code which closely follows the most common idioms of
379 the Python language, rather than implementing code using concepts common
380 in other languages. For example, a common idiom in Python is the :keyword:`for`
381 loop structure; other languages don't have this easy keyword, so people
382 use a numerical counter instead::
383
384 for i in range(len(food)):
Georg Brandla09ca382007-12-02 18:20:12 +0000385 print(food[i])
Christian Heimesd8654cf2007-12-02 15:22:16 +0000386
387 As opposed to the cleaner, Pythonic method::
388
389 for piece in food:
Georg Brandla09ca382007-12-02 18:20:12 +0000390 print(piece)
Christian Heimesd8654cf2007-12-02 15:22:16 +0000391
Guido van Rossumf10aa982007-08-17 18:30:38 +0000392 reference count
393 The number of places where a certain object is referenced to. When the
394 reference count drops to zero, an object is deallocated. While reference
395 counting is invisible on the Python code level, it is used on the
396 implementation level to keep track of allocated memory.
397
398 __slots__
Georg Brandl85eb8c12007-08-31 16:33:38 +0000399 A declaration inside a class that saves memory by pre-declaring space for
400 instance attributes and eliminating instance dictionaries. Though
401 popular, the technique is somewhat tricky to get right and is best
402 reserved for rare cases where there are large numbers of instances in a
403 memory-critical application.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000404
405 sequence
406 An :term:`iterable` which supports efficient element access using integer
407 indices via the :meth:`__getitem__` and :meth:`__len__` special methods.
408 Some built-in sequence types are :class:`list`, :class:`str`,
409 :class:`tuple`, and :class:`unicode`. Note that :class:`dict` also
410 supports :meth:`__getitem__` and :meth:`__len__`, but is considered a
411 mapping rather than a sequence because the lookups use arbitrary
412 :term:`immutable` keys rather than integers.
413
Christian Heimesd8654cf2007-12-02 15:22:16 +0000414 slice
Georg Brandlc6fe37b2007-12-03 21:07:25 +0000415 An object usually containing a portion of a :term:`sequence`. A slice is
Christian Heimesd8654cf2007-12-02 15:22:16 +0000416 created using the subscript notation, ``[]`` with colons between numbers
417 when several are given, such as in ``variable_name[1:3:5]``. The bracket
Georg Brandla09ca382007-12-02 18:20:12 +0000418 (subscript) notation uses :class:`slice` objects internally.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000419
420 statement
421 A statement is part of a suite (a "block" of code). A statement is either
422 an :term:`expression` or a one of several constructs with a keyword, such
Georg Brandla09ca382007-12-02 18:20:12 +0000423 as :keyword:`if`, :keyword:`while` or :keyword:`for`.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000424
Guido van Rossumf10aa982007-08-17 18:30:38 +0000425 type
426 The type of a Python object determines what kind of object it is; every
427 object has a type. An object's type is accessible as its
428 :attr:`__class__` attribute or can be retrieved with ``type(obj)``.
429
430 Zen of Python
431 Listing of Python design principles and philosophies that are helpful in
432 understanding and using the language. The listing can be found by typing
433 "``import this``" at the interactive prompt.