blob: fa34f2995a0e4436a3609cf9ccc34c0b03d64abd [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 ``>>>``
Benjamin Peterson5478b472008-09-17 22:25:09 +000012 The default Python prompt of the interactive shell. Often seen for code
13 examples which can be executed interactively in the interpreter.
Georg Brandl48310cd2009-01-03 21:18:54 +000014
Guido van Rossumf10aa982007-08-17 18:30:38 +000015 ``...``
Benjamin Peterson5478b472008-09-17 22:25:09 +000016 The default Python prompt of the interactive shell when entering code for
17 an indented code block or within a pair of matching left and right
18 delimiters (parentheses, square brackets or curly braces).
Christian Heimesd8654cf2007-12-02 15:22:16 +000019
Benjamin Petersond6313712008-07-31 16:23:04 +000020 2to3
21 A tool that tries to convert Python 2.x code to Python 3.x code by
Georg Brandl6faee4e2010-09-21 14:48:28 +000022 handling most of the incompatibilities which can be detected by parsing the
Benjamin Petersond6313712008-07-31 16:23:04 +000023 source and traversing the parse tree.
24
25 2to3 is available in the standard library as :mod:`lib2to3`; a standalone
26 entry point is provided as :file:`Tools/scripts/2to3`. See
27 :ref:`2to3-reference`.
28
Georg Brandl86b2fb92008-07-16 03:43:04 +000029 abstract base class
Éric Araujofa088db2011-06-04 18:42:38 +020030 Abstract base classes complement :term:`duck-typing` by
Georg Brandl22b34312009-07-26 14:54:51 +000031 providing a way to define interfaces when other techniques like
Éric Araujofa088db2011-06-04 18:42:38 +020032 :func:`hasattr` would be clumsy or subtly wrong (for example with
33 :ref:`magic methods <special-lookup>`). Python comes with many built-in ABCs for
Georg Brandl22b34312009-07-26 14:54:51 +000034 data structures (in the :mod:`collections` module), numbers (in the
Éric Araujofa088db2011-06-04 18:42:38 +020035 :mod:`numbers` module), streams (in the :mod:`io` module), import finders
36 and loaders (in the :mod:`importlib.abc` module). You can create your own
37 ABCs with the :mod:`abc` module.
Benjamin Peterson41181742008-07-02 20:22:54 +000038
Christian Heimesd8654cf2007-12-02 15:22:16 +000039 argument
Benjamin Peterson5478b472008-09-17 22:25:09 +000040 A value passed to a function or method, assigned to a named local
41 variable in the function body. A function or method may have both
42 positional arguments and keyword arguments in its definition.
43 Positional and keyword arguments may be variable-length: ``*`` accepts
44 or passes (if in the function definition or call) several positional
45 arguments in a list, while ``**`` does the same for keyword arguments
46 in a dictionary.
Christian Heimesd8654cf2007-12-02 15:22:16 +000047
48 Any expression may be used within the argument list, and the evaluated
49 value is passed to the local variable.
Benjamin Peterson5478b472008-09-17 22:25:09 +000050
51 attribute
52 A value associated with an object which is referenced by name using
53 dotted expressions. For example, if an object *o* has an attribute
54 *a* it would be referenced as *o.a*.
Georg Brandl48310cd2009-01-03 21:18:54 +000055
Guido van Rossumf10aa982007-08-17 18:30:38 +000056 BDFL
57 Benevolent Dictator For Life, a.k.a. `Guido van Rossum
58 <http://www.python.org/~guido/>`_, Python's creator.
Georg Brandl48310cd2009-01-03 21:18:54 +000059
Georg Brandl9afde1c2007-11-01 20:32:30 +000060 bytecode
61 Python source code is compiled into bytecode, the internal representation
Brett Cannon8315fd12010-07-02 22:03:00 +000062 of a Python program in the CPython interpreter. The bytecode is also
63 cached in ``.pyc`` and ``.pyo`` files so that executing the same file is
64 faster the second time (recompilation from source to bytecode can be
65 avoided). This "intermediate language" is said to run on a
66 :term:`virtual machine` that executes the machine code corresponding to
67 each bytecode. Do note that bytecodes are not expected to work between
68 different Python virtual machines, nor to be stable between Python
69 releases.
Benjamin Peterson5478b472008-09-17 22:25:09 +000070
Georg Brandl2cb72d32010-07-03 10:26:54 +000071 A list of bytecode instructions can be found in the documentation for
72 :ref:`the dis module <bytecodes>`.
73
Benjamin Peterson5478b472008-09-17 22:25:09 +000074 class
75 A template for creating user-defined objects. Class definitions
76 normally contain method definitions which operate on instances of the
77 class.
Georg Brandl48310cd2009-01-03 21:18:54 +000078
Benjamin Peterson5478b472008-09-17 22:25:09 +000079 coercion
80 The implicit conversion of an instance of one type to another during an
81 operation which involves two arguments of the same type. For example,
82 ``int(3.15)`` converts the floating point number to the integer ``3``, but
83 in ``3+4.5``, each argument is of a different type (one int, one float),
84 and both must be converted to the same type before they can be added or it
Benjamin Peterson2d718222008-11-21 00:25:02 +000085 will raise a ``TypeError``. Without coercion, all arguments of even
Benjamin Peterson5478b472008-09-17 22:25:09 +000086 compatible types would have to be normalized to the same value by the
87 programmer, e.g., ``float(3)+4.5`` rather than just ``3+4.5``.
Georg Brandl48310cd2009-01-03 21:18:54 +000088
Guido van Rossumf10aa982007-08-17 18:30:38 +000089 complex number
90 An extension of the familiar real number system in which all numbers are
91 expressed as a sum of a real part and an imaginary part. Imaginary
92 numbers are real multiples of the imaginary unit (the square root of
93 ``-1``), often written ``i`` in mathematics or ``j`` in
Georg Brandl22b34312009-07-26 14:54:51 +000094 engineering. Python has built-in support for complex numbers, which are
Guido van Rossumf10aa982007-08-17 18:30:38 +000095 written with this latter notation; the imaginary part is written with a
96 ``j`` suffix, e.g., ``3+1j``. To get access to complex equivalents of the
97 :mod:`math` module, use :mod:`cmath`. Use of complex numbers is a fairly
98 advanced mathematical feature. If you're not aware of a need for them,
99 it's almost certain you can safely ignore them.
Georg Brandl48310cd2009-01-03 21:18:54 +0000100
Christian Heimes895627f2007-12-08 17:28:33 +0000101 context manager
Benjamin Peterson5478b472008-09-17 22:25:09 +0000102 An object which controls the environment seen in a :keyword:`with`
Christian Heimes895627f2007-12-08 17:28:33 +0000103 statement by defining :meth:`__enter__` and :meth:`__exit__` methods.
104 See :pep:`343`.
105
Benjamin Peterson5478b472008-09-17 22:25:09 +0000106 CPython
Antoine Pitrou00342812011-01-06 16:31:28 +0000107 The canonical implementation of the Python programming language, as
108 distributed on `python.org <http://python.org>`_. The term "CPython"
109 is used when necessary to distinguish this implementation from others
110 such as Jython or IronPython.
Benjamin Peterson5478b472008-09-17 22:25:09 +0000111
Christian Heimesd8654cf2007-12-02 15:22:16 +0000112 decorator
113 A function returning another function, usually applied as a function
114 transformation using the ``@wrapper`` syntax. Common examples for
115 decorators are :func:`classmethod` and :func:`staticmethod`.
116
117 The decorator syntax is merely syntactic sugar, the following two
118 function definitions are semantically equivalent::
119
120 def f(...):
121 ...
122 f = staticmethod(f)
123
124 @staticmethod
125 def f(...):
126 ...
127
Georg Brandlaf265f42008-12-07 15:06:20 +0000128 The same concept exists for classes, but is less commonly used there. See
129 the documentation for :ref:`function definitions <function>` and
130 :ref:`class definitions <class>` for more about decorators.
Georg Brandla09ca382007-12-02 18:20:12 +0000131
Guido van Rossumf10aa982007-08-17 18:30:38 +0000132 descriptor
Benjamin Peterson5478b472008-09-17 22:25:09 +0000133 Any object which defines the methods :meth:`__get__`, :meth:`__set__`, or
Georg Brandl85eb8c12007-08-31 16:33:38 +0000134 :meth:`__delete__`. When a class attribute is a descriptor, its special
Georg Brandl9afde1c2007-11-01 20:32:30 +0000135 binding behavior is triggered upon attribute lookup. Normally, using
136 *a.b* to get, set or delete an attribute looks up the object named *b* in
137 the class dictionary for *a*, but if *b* is a descriptor, the respective
138 descriptor method gets called. Understanding descriptors is a key to a
139 deep understanding of Python because they are the basis for many features
140 including functions, methods, properties, class methods, static methods,
141 and reference to super classes.
142
143 For more information about descriptors' methods, see :ref:`descriptors`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000144
Guido van Rossumf10aa982007-08-17 18:30:38 +0000145 dictionary
Raymond Hettingerf37ca3c2010-09-01 22:11:53 +0000146 An associative array, where arbitrary keys are mapped to values. The keys
147 can be any object with :meth:`__hash__` function and :meth:`__eq__`
148 methods. Called a hash in Perl.
Georg Brandl3dbca812008-07-23 16:10:53 +0000149
150 docstring
Benjamin Peterson5478b472008-09-17 22:25:09 +0000151 A string literal which appears as the first expression in a class,
152 function or module. While ignored when the suite is executed, it is
153 recognized by the compiler and put into the :attr:`__doc__` attribute
154 of the enclosing class, function or module. Since it is available via
155 introspection, it is the canonical place for documentation of the
Georg Brandl3dbca812008-07-23 16:10:53 +0000156 object.
Georg Brandl48310cd2009-01-03 21:18:54 +0000157
158 duck-typing
Georg Brandl73b1c7b2010-07-10 10:39:57 +0000159 A programming style which does not look at an object's type to determine
160 if it has the right interface; instead, the method or attribute is simply
161 called or used ("If it looks like a duck and quacks like a duck, it
Guido van Rossumf10aa982007-08-17 18:30:38 +0000162 must be a duck.") By emphasizing interfaces rather than specific types,
163 well-designed code improves its flexibility by allowing polymorphic
164 substitution. Duck-typing avoids tests using :func:`type` or
Georg Brandl8a1c2542010-07-11 08:36:20 +0000165 :func:`isinstance`. (Note, however, that duck-typing can be complemented
166 with :term:`abstract base class`\ es.) Instead, it typically employs
167 :func:`hasattr` tests or :term:`EAFP` programming.
Georg Brandl48310cd2009-01-03 21:18:54 +0000168
Guido van Rossumf10aa982007-08-17 18:30:38 +0000169 EAFP
170 Easier to ask for forgiveness than permission. This common Python coding
171 style assumes the existence of valid keys or attributes and catches
172 exceptions if the assumption proves false. This clean and fast style is
173 characterized by the presence of many :keyword:`try` and :keyword:`except`
Georg Brandl48310cd2009-01-03 21:18:54 +0000174 statements. The technique contrasts with the :term:`LBYL` style
Benjamin Peterson5478b472008-09-17 22:25:09 +0000175 common to many other languages such as C.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000176
Christian Heimesd8654cf2007-12-02 15:22:16 +0000177 expression
178 A piece of syntax which can be evaluated to some value. In other words,
Benjamin Peterson5478b472008-09-17 22:25:09 +0000179 an expression is an accumulation of expression elements like literals,
180 names, attribute access, operators or function calls which all return a
181 value. In contrast to many other languages, not all language constructs
182 are expressions. There are also :term:`statement`\s which cannot be used
183 as expressions, such as :keyword:`if`. Assignments are also statements,
184 not expressions.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000185
Guido van Rossumf10aa982007-08-17 18:30:38 +0000186 extension module
Georg Brandl9d9848e2010-12-28 11:48:53 +0000187 A module written in C or C++, using Python's C API to interact with the
188 core and with user code.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000189
Antoine Pitrou0b65b0f2010-09-15 09:58:26 +0000190 file object
191 An object exposing a file-oriented API (with methods such as
Georg Brandl9d9848e2010-12-28 11:48:53 +0000192 :meth:`read()` or :meth:`write()`) to an underlying resource. Depending
193 on the way it was created, a file object can mediate access to a real
194 on-disk file or to another other type of storage or communication device
195 (for example standard input/output, in-memory buffers, sockets, pipes,
196 etc.). File objects are also called :dfn:`file-like objects` or
197 :dfn:`streams`.
Antoine Pitrou0b65b0f2010-09-15 09:58:26 +0000198
Georg Brandl9d9848e2010-12-28 11:48:53 +0000199 There are actually three categories of file objects: raw binary files,
200 buffered binary files and text files. Their interfaces are defined in the
201 :mod:`io` module. The canonical way to create a file object is by using
202 the :func:`open` function.
Antoine Pitrou0b65b0f2010-09-15 09:58:26 +0000203
204 file-like object
205 A synonym for :term:`file object`.
206
Brett Cannon51d4aab2009-01-25 04:21:39 +0000207 finder
208 An object that tries to find the :term:`loader` for a module. It must
209 implement a method named :meth:`find_module`. See :pep:`302` for
Brett Cannone43b0602009-03-21 03:11:16 +0000210 details and :class:`importlib.abc.Finder` for an
211 :term:`abstract base class`.
Brett Cannon51d4aab2009-01-25 04:21:39 +0000212
Benjamin Peterson2d718222008-11-21 00:25:02 +0000213 floor division
Raymond Hettingerf37ca3c2010-09-01 22:11:53 +0000214 Mathematical division that rounds down to nearest integer. The floor
215 division operator is ``//``. For example, the expression ``11 // 4``
216 evaluates to ``2`` in contrast to the ``2.75`` returned by float true
217 division. Note that ``(-11) // 4`` is ``-3`` because that is ``-2.75``
218 rounded *downward*. See :pep:`238`.
Benjamin Peterson2d718222008-11-21 00:25:02 +0000219
Christian Heimesd8654cf2007-12-02 15:22:16 +0000220 function
221 A series of statements which returns some value to a caller. It can also
222 be passed zero or more arguments which may be used in the execution of
223 the body. See also :term:`argument` and :term:`method`.
224
Guido van Rossumf10aa982007-08-17 18:30:38 +0000225 __future__
Raymond Hettingerf37ca3c2010-09-01 22:11:53 +0000226 A pseudo-module which programmers can use to enable new language features
Benjamin Peterson2d718222008-11-21 00:25:02 +0000227 which are not compatible with the current interpreter.
228
229 By importing the :mod:`__future__` module and evaluating its variables,
230 you can see when a new feature was first added to the language and when it
231 becomes the default::
Georg Brandl48310cd2009-01-03 21:18:54 +0000232
Guido van Rossumf10aa982007-08-17 18:30:38 +0000233 >>> import __future__
234 >>> __future__.division
235 _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)
236
237 garbage collection
238 The process of freeing memory when it is not used anymore. Python
239 performs garbage collection via reference counting and a cyclic garbage
240 collector that is able to detect and break reference cycles.
Georg Brandl48310cd2009-01-03 21:18:54 +0000241
Benjamin Peterson08bf91c2010-04-11 16:12:57 +0000242 .. index:: single: generator
243
Guido van Rossumf10aa982007-08-17 18:30:38 +0000244 generator
Benjamin Peterson5478b472008-09-17 22:25:09 +0000245 A function which returns an iterator. It looks like a normal function
Raymond Hettingerf37ca3c2010-09-01 22:11:53 +0000246 except that it contains :keyword:`yield` statements for producing a series
247 a values usable in a for-loop or that can be retrieved one at a time with
248 the :func:`next` function. Each :keyword:`yield` temporarily suspends
249 processing, remembering the location execution state (including local
250 variables and pending try-statements). When the generator resumes, it
251 picks-up where it left-off (in contrast to functions which start fresh on
Éric Araujoe0854f92011-05-27 04:36:52 +0200252 every invocation).
Georg Brandl48310cd2009-01-03 21:18:54 +0000253
Guido van Rossumf10aa982007-08-17 18:30:38 +0000254 .. index:: single: generator expression
Georg Brandl48310cd2009-01-03 21:18:54 +0000255
Guido van Rossumf10aa982007-08-17 18:30:38 +0000256 generator expression
Benjamin Peterson08bf91c2010-04-11 16:12:57 +0000257 An expression that returns an iterator. It looks like a normal expression
Guido van Rossumf10aa982007-08-17 18:30:38 +0000258 followed by a :keyword:`for` expression defining a loop variable, range,
259 and an optional :keyword:`if` expression. The combined expression
260 generates values for an enclosing function::
Georg Brandl48310cd2009-01-03 21:18:54 +0000261
Guido van Rossumf10aa982007-08-17 18:30:38 +0000262 >>> sum(i*i for i in range(10)) # sum of squares 0, 1, 4, ... 81
263 285
Georg Brandl48310cd2009-01-03 21:18:54 +0000264
Guido van Rossumf10aa982007-08-17 18:30:38 +0000265 GIL
266 See :term:`global interpreter lock`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000267
Guido van Rossumf10aa982007-08-17 18:30:38 +0000268 global interpreter lock
Antoine Pitrou00342812011-01-06 16:31:28 +0000269 The mechanism used by the :term:`CPython` interpreter to assure that
270 only one thread executes Python :term:`bytecode` at a time.
271 This simplifies the CPython implementation by making the object model
272 (including critical built-in types such as :class:`dict`) implicitly
273 safe against concurrent access. Locking the entire interpreter
274 makes it easier for the interpreter to be multi-threaded, at the
275 expense of much of the parallelism afforded by multi-processor
276 machines.
277
278 However, some extension modules, either standard or third-party,
279 are designed so as to release the GIL when doing computationally-intensive
280 tasks such as compression or hashing. Also, the GIL is always released
281 when doing I/O.
282
283 Past efforts to create a "free-threaded" interpreter (one which locks
284 shared data at a much finer granularity) have not been successful
285 because performance suffered in the common single-processor case. It
286 is believed that overcoming this performance issue would make the
287 implementation much more complicated and therefore costlier to maintain.
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000288
289 hashable
Benjamin Peterson5478b472008-09-17 22:25:09 +0000290 An object is *hashable* if it has a hash value which never changes during
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000291 its lifetime (it needs a :meth:`__hash__` method), and can be compared to
Georg Brandl05f5ab72008-09-24 09:11:47 +0000292 other objects (it needs an :meth:`__eq__` method). Hashable objects which
293 compare equal must have the same hash value.
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000294
295 Hashability makes an object usable as a dictionary key and a set member,
296 because these data structures use the hash value internally.
297
Benjamin Peterson5478b472008-09-17 22:25:09 +0000298 All of Python's immutable built-in objects are hashable, while no mutable
299 containers (such as lists or dictionaries) are. Objects which are
Guido van Rossum2cc30da2007-11-02 23:46:40 +0000300 instances of user-defined classes are hashable by default; they all
301 compare unequal, and their hash value is their :func:`id`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000302
Guido van Rossumf10aa982007-08-17 18:30:38 +0000303 IDLE
304 An Integrated Development Environment for Python. IDLE is a basic editor
Benjamin Peterson5478b472008-09-17 22:25:09 +0000305 and interpreter environment which ships with the standard distribution of
Raymond Hettingerf37ca3c2010-09-01 22:11:53 +0000306 Python.
Georg Brandl48310cd2009-01-03 21:18:54 +0000307
Guido van Rossumf10aa982007-08-17 18:30:38 +0000308 immutable
Benjamin Peterson5478b472008-09-17 22:25:09 +0000309 An object with a fixed value. Immutable objects include numbers, strings and
310 tuples. Such an object cannot be altered. A new object has to
Guido van Rossumf10aa982007-08-17 18:30:38 +0000311 be created if a different value has to be stored. They play an important
312 role in places where a constant hash value is needed, for example as a key
313 in a dictionary.
Benjamin Peterson2d718222008-11-21 00:25:02 +0000314
Brett Cannon51d4aab2009-01-25 04:21:39 +0000315 importer
316 An object that both finds and loads a module; both a
317 :term:`finder` and :term:`loader` object.
318
Guido van Rossumf10aa982007-08-17 18:30:38 +0000319 interactive
Benjamin Peterson5478b472008-09-17 22:25:09 +0000320 Python has an interactive interpreter which means you can enter
321 statements and expressions at the interpreter prompt, immediately
322 execute them and see their results. Just launch ``python`` with no
323 arguments (possibly by selecting it from your computer's main
324 menu). It is a very powerful way to test out new ideas or inspect
325 modules and packages (remember ``help(x)``).
Georg Brandl48310cd2009-01-03 21:18:54 +0000326
Guido van Rossumf10aa982007-08-17 18:30:38 +0000327 interpreted
Benjamin Peterson5478b472008-09-17 22:25:09 +0000328 Python is an interpreted language, as opposed to a compiled one,
329 though the distinction can be blurry because of the presence of the
330 bytecode compiler. This means that source files can be run directly
331 without explicitly creating an executable which is then run.
332 Interpreted languages typically have a shorter development/debug cycle
333 than compiled ones, though their programs generally also run more
334 slowly. See also :term:`interactive`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000335
Guido van Rossumf10aa982007-08-17 18:30:38 +0000336 iterable
Raymond Hettingerb6b76c22010-11-14 05:27:15 +0000337 An object capable of returning its members one at a
Guido van Rossumf10aa982007-08-17 18:30:38 +0000338 time. Examples of iterables include all sequence types (such as
339 :class:`list`, :class:`str`, and :class:`tuple`) and some non-sequence
340 types like :class:`dict` and :class:`file` and objects of any classes you
341 define with an :meth:`__iter__` or :meth:`__getitem__` method. Iterables
342 can be used in a :keyword:`for` loop and in many other places where a
343 sequence is needed (:func:`zip`, :func:`map`, ...). When an iterable
Georg Brandl22b34312009-07-26 14:54:51 +0000344 object is passed as an argument to the built-in function :func:`iter`, it
Guido van Rossumf10aa982007-08-17 18:30:38 +0000345 returns an iterator for the object. This iterator is good for one pass
346 over the set of values. When using iterables, it is usually not necessary
347 to call :func:`iter` or deal with iterator objects yourself. The ``for``
348 statement does that automatically for you, creating a temporary unnamed
349 variable to hold the iterator for the duration of the loop. See also
350 :term:`iterator`, :term:`sequence`, and :term:`generator`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000351
Guido van Rossumf10aa982007-08-17 18:30:38 +0000352 iterator
353 An object representing a stream of data. Repeated calls to the iterator's
Georg Brandlb30f3302011-01-06 09:23:56 +0000354 :meth:`__next__` method (or passing it to the built-in function
355 :func:`next`) return successive items in the stream. When no more data
356 are available a :exc:`StopIteration` exception is raised instead. At this
Benjamin Petersone7c78b22008-07-03 20:28:26 +0000357 point, the iterator object is exhausted and any further calls to its
Georg Brandlb30f3302011-01-06 09:23:56 +0000358 :meth:`__next__` method just raise :exc:`StopIteration` again. Iterators
359 are required to have an :meth:`__iter__` method that returns the iterator
Guido van Rossumf10aa982007-08-17 18:30:38 +0000360 object itself so every iterator is also iterable and may be used in most
361 places where other iterables are accepted. One notable exception is code
Benjamin Peterson5478b472008-09-17 22:25:09 +0000362 which attempts multiple iteration passes. A container object (such as a
Guido van Rossumf10aa982007-08-17 18:30:38 +0000363 :class:`list`) produces a fresh new iterator each time you pass it to the
364 :func:`iter` function or use it in a :keyword:`for` loop. Attempting this
365 with an iterator will just return the same exhausted iterator object used
366 in the previous iteration pass, making it appear like an empty container.
Georg Brandl48310cd2009-01-03 21:18:54 +0000367
Georg Brandl9afde1c2007-11-01 20:32:30 +0000368 More information can be found in :ref:`typeiter`.
369
Georg Brandlc275e152010-11-05 07:10:41 +0000370 key function
371 A key function or collation function is a callable that returns a value
372 used for sorting or ordering. For example, :func:`locale.strxfrm` is
373 used to produce a sort key that is aware of locale specific sort
374 conventions.
375
376 A number of tools in Python accept key functions to control how elements
377 are ordered or grouped. They include :func:`min`, :func:`max`,
378 :func:`sorted`, :meth:`list.sort`, :func:`heapq.nsmallest`,
379 :func:`heapq.nlargest`, and :func:`itertools.groupby`.
380
381 There are several ways to create a key function. For example. the
382 :meth:`str.lower` method can serve as a key function for case insensitive
383 sorts. Alternatively, an ad-hoc key function can be built from a
384 :keyword:`lambda` expression such as ``lambda r: (r[0], r[2])``. Also,
385 the :mod:`operator` module provides three key function constuctors:
386 :func:`~operator.attrgetter`, :func:`~operator.itemgetter`, and
387 :func:`~operator.methodcaller`. See the :ref:`Sorting HOW TO
388 <sortinghowto>` for examples of how to create and use key functions.
389
Christian Heimesd8654cf2007-12-02 15:22:16 +0000390 keyword argument
391 Arguments which are preceded with a ``variable_name=`` in the call.
392 The variable name designates the local name in the function to which the
393 value is assigned. ``**`` is used to accept or pass a dictionary of
394 keyword arguments. See :term:`argument`.
395
396 lambda
397 An anonymous inline function consisting of a single :term:`expression`
398 which is evaluated when the function is called. The syntax to create
399 a lambda function is ``lambda [arguments]: expression``
400
Guido van Rossumf10aa982007-08-17 18:30:38 +0000401 LBYL
402 Look before you leap. This coding style explicitly tests for
403 pre-conditions before making calls or lookups. This style contrasts with
404 the :term:`EAFP` approach and is characterized by the presence of many
405 :keyword:`if` statements.
Benjamin Peterson5478b472008-09-17 22:25:09 +0000406
Raymond Hettinger09f44142010-12-17 20:19:50 +0000407 In a multi-threaded environment, the LBYL approach can risk introducing a
408 race condition between "the looking" and "the leaping". For example, the
409 code, ``if key in mapping: return mapping[key]`` can fail if another
410 thread removes *key* from *mapping* after the test, but before the lookup.
411 This issue can be solved with locks or by using the EAFP approach.
412
Benjamin Peterson5478b472008-09-17 22:25:09 +0000413 list
414 A built-in Python :term:`sequence`. Despite its name it is more akin
415 to an array in other languages than to a linked list since access to
416 elements are O(1).
Georg Brandl48310cd2009-01-03 21:18:54 +0000417
Guido van Rossumf10aa982007-08-17 18:30:38 +0000418 list comprehension
Benjamin Peterson5478b472008-09-17 22:25:09 +0000419 A compact way to process all or part of the elements in a sequence and
Georg Brandlede6c2a2010-01-05 10:22:04 +0000420 return a list with the results. ``result = ['{:#04x}'.format(x) for x in
Benjamin Peterson5478b472008-09-17 22:25:09 +0000421 range(256) if x % 2 == 0]`` generates a list of strings containing
422 even hex numbers (0x..) in the range from 0 to 255. The :keyword:`if`
423 clause is optional. If omitted, all elements in ``range(256)`` are
424 processed.
Georg Brandl48310cd2009-01-03 21:18:54 +0000425
Brett Cannon51d4aab2009-01-25 04:21:39 +0000426 loader
427 An object that loads a module. It must define a method named
428 :meth:`load_module`. A loader is typically returned by a
Brett Cannone43b0602009-03-21 03:11:16 +0000429 :term:`finder`. See :pep:`302` for details and
430 :class:`importlib.abc.Loader` for an :term:`abstract base class`.
Brett Cannon51d4aab2009-01-25 04:21:39 +0000431
Guido van Rossumf10aa982007-08-17 18:30:38 +0000432 mapping
Raymond Hettingere3ee66f2011-01-08 23:44:37 +0000433 A container object that supports arbitrary key lookups and implements the
434 methods specified in the :class:`Mapping` or :class:`MutableMapping`
Éric Araujofa088db2011-06-04 18:42:38 +0200435 :ref:`abstract base classes <collections-abstract-base-classes>`. Examples
436 include :class:`dict`, :class:`collections.defaultdict`,
Raymond Hettingere3ee66f2011-01-08 23:44:37 +0000437 :class:`collections.OrderedDict` and :class:`collections.Counter`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000438
Guido van Rossumf10aa982007-08-17 18:30:38 +0000439 metaclass
440 The class of a class. Class definitions create a class name, a class
441 dictionary, and a list of base classes. The metaclass is responsible for
442 taking those three arguments and creating the class. Most object oriented
443 programming languages provide a default implementation. What makes Python
444 special is that it is possible to create custom metaclasses. Most users
445 never need this tool, but when the need arises, metaclasses can provide
446 powerful, elegant solutions. They have been used for logging attribute
447 access, adding thread-safety, tracking object creation, implementing
448 singletons, and many other tasks.
Georg Brandl9afde1c2007-11-01 20:32:30 +0000449
450 More information can be found in :ref:`metaclasses`.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000451
452 method
Benjamin Peterson5478b472008-09-17 22:25:09 +0000453 A function which is defined inside a class body. If called as an attribute
Christian Heimesd8654cf2007-12-02 15:22:16 +0000454 of an instance of that class, the method will get the instance object as
455 its first :term:`argument` (which is usually called ``self``).
456 See :term:`function` and :term:`nested scope`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000457
Michael Foord95fc51d2010-11-20 15:07:30 +0000458 method resolution order
459 Method Resolution Order is the order in which base classes are searched
460 for a member during lookup. See `The Python 2.3 Method Resolution Order
461 <http://www.python.org/download/releases/2.3/mro/>`_.
462
463 MRO
464 See :term:`method resolution order`.
465
Guido van Rossumf10aa982007-08-17 18:30:38 +0000466 mutable
467 Mutable objects can change their value but keep their :func:`id`. See
468 also :term:`immutable`.
Christian Heimes25bb7832008-01-11 16:17:00 +0000469
470 named tuple
Raymond Hettingerd04fa312009-02-04 19:45:13 +0000471 Any tuple-like class whose indexable elements are also accessible using
Christian Heimesd32ed6f2008-01-14 18:49:24 +0000472 named attributes (for example, :func:`time.localtime` returns a
473 tuple-like object where the *year* is accessible either with an
474 index such as ``t[0]`` or with a named attribute like ``t.tm_year``).
475
476 A named tuple can be a built-in type such as :class:`time.struct_time`,
477 or it can be created with a regular class definition. A full featured
478 named tuple can also be created with the factory function
479 :func:`collections.namedtuple`. The latter approach automatically
480 provides extra features such as a self-documenting representation like
481 ``Employee(name='jones', title='programmer')``.
Georg Brandl48310cd2009-01-03 21:18:54 +0000482
Guido van Rossumf10aa982007-08-17 18:30:38 +0000483 namespace
484 The place where a variable is stored. Namespaces are implemented as
Georg Brandl22b34312009-07-26 14:54:51 +0000485 dictionaries. There are the local, global and built-in namespaces as well
Guido van Rossumf10aa982007-08-17 18:30:38 +0000486 as nested namespaces in objects (in methods). Namespaces support
487 modularity by preventing naming conflicts. For instance, the functions
Georg Brandl1a3284e2007-12-02 09:40:06 +0000488 :func:`builtins.open` and :func:`os.open` are distinguished by their
Guido van Rossumf10aa982007-08-17 18:30:38 +0000489 namespaces. Namespaces also aid readability and maintainability by making
490 it clear which module implements a function. For instance, writing
491 :func:`random.seed` or :func:`itertools.izip` makes it clear that those
492 functions are implemented by the :mod:`random` and :mod:`itertools`
Benjamin Peterson5478b472008-09-17 22:25:09 +0000493 modules, respectively.
Georg Brandl48310cd2009-01-03 21:18:54 +0000494
Guido van Rossumf10aa982007-08-17 18:30:38 +0000495 nested scope
496 The ability to refer to a variable in an enclosing definition. For
497 instance, a function defined inside another function can refer to
Benjamin Peterson927ccd22010-06-29 18:36:39 +0000498 variables in the outer function. Note that nested scopes by default work
499 only for reference and not for assignment. Local variables both read and
500 write in the innermost scope. Likewise, global variables read and write
501 to the global namespace. The :keyword:`nonlocal` allows writing to outer
502 scopes.
Georg Brandl48310cd2009-01-03 21:18:54 +0000503
Guido van Rossumf10aa982007-08-17 18:30:38 +0000504 new-style class
Georg Brandl85eb8c12007-08-31 16:33:38 +0000505 Old name for the flavor of classes now used for all class objects. In
506 earlier Python versions, only new-style classes could use Python's newer,
507 versatile features like :attr:`__slots__`, descriptors, properties,
508 :meth:`__getattribute__`, class methods, and static methods.
Georg Brandl9afde1c2007-11-01 20:32:30 +0000509
Benjamin Peterson5478b472008-09-17 22:25:09 +0000510 object
511 Any data with state (attributes or value) and defined behavior
512 (methods). Also the ultimate base class of any :term:`new-style
513 class`.
Georg Brandl48310cd2009-01-03 21:18:54 +0000514
Christian Heimesd8654cf2007-12-02 15:22:16 +0000515 positional argument
516 The arguments assigned to local names inside a function or method,
517 determined by the order in which they were given in the call. ``*`` is
518 used to either accept multiple positional arguments (when in the
519 definition), or pass several arguments as a list to a function. See
520 :term:`argument`.
521
Guido van Rossumf10aa982007-08-17 18:30:38 +0000522 Python 3000
Benjamin Peterson1e2f0502008-05-26 12:52:02 +0000523 Nickname for the Python 3.x release line (coined long ago when the release
524 of version 3 was something in the distant future.) This is also
525 abbreviated "Py3k".
Guido van Rossumf10aa982007-08-17 18:30:38 +0000526
Christian Heimesd8654cf2007-12-02 15:22:16 +0000527 Pythonic
Benjamin Peterson5478b472008-09-17 22:25:09 +0000528 An idea or piece of code which closely follows the most common idioms
529 of the Python language, rather than implementing code using concepts
530 common to other languages. For example, a common idiom in Python is
531 to loop over all elements of an iterable using a :keyword:`for`
532 statement. Many other languages don't have this type of construct, so
533 people unfamiliar with Python sometimes use a numerical counter instead::
Georg Brandl48310cd2009-01-03 21:18:54 +0000534
Christian Heimesd8654cf2007-12-02 15:22:16 +0000535 for i in range(len(food)):
Georg Brandla09ca382007-12-02 18:20:12 +0000536 print(food[i])
Christian Heimesd8654cf2007-12-02 15:22:16 +0000537
538 As opposed to the cleaner, Pythonic method::
539
540 for piece in food:
Georg Brandla09ca382007-12-02 18:20:12 +0000541 print(piece)
Christian Heimesd8654cf2007-12-02 15:22:16 +0000542
Guido van Rossumf10aa982007-08-17 18:30:38 +0000543 reference count
Benjamin Peterson5478b472008-09-17 22:25:09 +0000544 The number of references to an object. When the reference count of an
545 object drops to zero, it is deallocated. Reference counting is
546 generally not visible to Python code, but it is a key element of the
547 :term:`CPython` implementation. The :mod:`sys` module defines a
Georg Brandlede6c2a2010-01-05 10:22:04 +0000548 :func:`~sys.getrefcount` function that programmers can call to return the
Benjamin Peterson5478b472008-09-17 22:25:09 +0000549 reference count for a particular object.
550
Guido van Rossumf10aa982007-08-17 18:30:38 +0000551 __slots__
Georg Brandl85eb8c12007-08-31 16:33:38 +0000552 A declaration inside a class that saves memory by pre-declaring space for
553 instance attributes and eliminating instance dictionaries. Though
554 popular, the technique is somewhat tricky to get right and is best
555 reserved for rare cases where there are large numbers of instances in a
556 memory-critical application.
Georg Brandl48310cd2009-01-03 21:18:54 +0000557
Guido van Rossumf10aa982007-08-17 18:30:38 +0000558 sequence
559 An :term:`iterable` which supports efficient element access using integer
Benjamin Peterson5478b472008-09-17 22:25:09 +0000560 indices via the :meth:`__getitem__` special method and defines a
561 :meth:`len` method that returns the length of the sequence.
Guido van Rossumf10aa982007-08-17 18:30:38 +0000562 Some built-in sequence types are :class:`list`, :class:`str`,
Georg Brandl2ae8ac22009-02-05 10:40:48 +0000563 :class:`tuple`, and :class:`bytes`. Note that :class:`dict` also
Guido van Rossumf10aa982007-08-17 18:30:38 +0000564 supports :meth:`__getitem__` and :meth:`__len__`, but is considered a
565 mapping rather than a sequence because the lookups use arbitrary
566 :term:`immutable` keys rather than integers.
567
Christian Heimesd8654cf2007-12-02 15:22:16 +0000568 slice
Georg Brandlc6fe37b2007-12-03 21:07:25 +0000569 An object usually containing a portion of a :term:`sequence`. A slice is
Christian Heimesd8654cf2007-12-02 15:22:16 +0000570 created using the subscript notation, ``[]`` with colons between numbers
571 when several are given, such as in ``variable_name[1:3:5]``. The bracket
Georg Brandla09ca382007-12-02 18:20:12 +0000572 (subscript) notation uses :class:`slice` objects internally.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000573
Georg Brandlaf265f42008-12-07 15:06:20 +0000574 special method
575 A method that is called implicitly by Python to execute a certain
576 operation on a type, such as addition. Such methods have names starting
577 and ending with double underscores. Special methods are documented in
578 :ref:`specialnames`.
579
Christian Heimesd8654cf2007-12-02 15:22:16 +0000580 statement
581 A statement is part of a suite (a "block" of code). A statement is either
582 an :term:`expression` or a one of several constructs with a keyword, such
Georg Brandla09ca382007-12-02 18:20:12 +0000583 as :keyword:`if`, :keyword:`while` or :keyword:`for`.
Christian Heimesd8654cf2007-12-02 15:22:16 +0000584
Benjamin Peterson5478b472008-09-17 22:25:09 +0000585 triple-quoted string
586 A string which is bound by three instances of either a quotation mark
587 (") or an apostrophe ('). While they don't provide any functionality
588 not available with single-quoted strings, they are useful for a number
589 of reasons. They allow you to include unescaped single and double
590 quotes within a string and they can span multiple lines without the
591 use of the continuation character, making them especially useful when
592 writing docstrings.
593
Guido van Rossumf10aa982007-08-17 18:30:38 +0000594 type
595 The type of a Python object determines what kind of object it is; every
596 object has a type. An object's type is accessible as its
597 :attr:`__class__` attribute or can be retrieved with ``type(obj)``.
Benjamin Peterson5478b472008-09-17 22:25:09 +0000598
Benjamin Peterson656aa282008-11-21 23:22:00 +0000599 view
Ezio Melotti619de8f2009-06-25 18:39:31 +0000600 The objects returned from :meth:`dict.keys`, :meth:`dict.values`, and
Benjamin Peterson656aa282008-11-21 23:22:00 +0000601 :meth:`dict.items` are called dictionary views. They are lazy sequences
602 that will see changes in the underlying dictionary. To force the
603 dictionary view to become a full list use ``list(dictview)``. See
604 :ref:`dict-views`.
605
Benjamin Peterson5478b472008-09-17 22:25:09 +0000606 virtual machine
607 A computer defined entirely in software. Python's virtual machine
608 executes the :term:`bytecode` emitted by the bytecode compiler.
Georg Brandl48310cd2009-01-03 21:18:54 +0000609
Guido van Rossumf10aa982007-08-17 18:30:38 +0000610 Zen of Python
611 Listing of Python design principles and philosophies that are helpful in
612 understanding and using the language. The listing can be found by typing
613 "``import this``" at the interactive prompt.