7 .. if you add new entries, keep the alphabetical sorting!
12 The default Python prompt of the interactive shell. Often seen for code
13 examples which can be executed interactively in the interpreter.
16 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).
21 A tool that tries to convert Python 2.x code to Python 3.x code by
22 handling most of the incompatibilites which can be detected by parsing the
23 source and traversing the parse tree.
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`.
30 Abstract Base Classes (abbreviated ABCs) complement :term:`duck-typing` by
31 providing a way to define interfaces when other techniques like :func:`hasattr`
32 would be clumsy. Python comes with many builtin ABCs for data structures
33 (in the :mod:`collections` module), numbers (in the :mod:`numbers`
34 module), and streams (in the :mod:`io` module). You can create your own
35 ABC with the :mod:`abc` module.
38 A value passed to a function or method, assigned to a named local
39 variable in the function body. A function or method may have both
40 positional arguments and keyword arguments in its definition.
41 Positional and keyword arguments may be variable-length: ``*`` accepts
42 or passes (if in the function definition or call) several positional
43 arguments in a list, while ``**`` does the same for keyword arguments
46 Any expression may be used within the argument list, and the evaluated
47 value is passed to the local variable.
50 A value associated with an object which is referenced by name using
51 dotted expressions. For example, if an object *o* has an attribute
52 *a* it would be referenced as *o.a*.
55 Benevolent Dictator For Life, a.k.a. `Guido van Rossum
56 <http://www.python.org/~guido/>`_, Python's creator.
59 Python source code is compiled into bytecode, the internal representation
60 of a Python program in the interpreter. The bytecode is also cached in
61 ``.pyc`` and ``.pyo`` files so that executing the same file is faster the
62 second time (recompilation from source to bytecode can be avoided). This
63 "intermediate language" is said to run on a :term:`virtual machine`
64 that executes the machine code corresponding to each bytecode.
67 A template for creating user-defined objects. Class definitions
68 normally contain method definitions which operate on instances of the
72 Any class which does not inherit from :class:`object`. See
73 :term:`new-style class`. Classic classes will be removed in Python 3.0.
76 The implicit conversion of an instance of one type to another during an
77 operation which involves two arguments of the same type. For example,
78 ``int(3.15)`` converts the floating point number to the integer ``3``, but
79 in ``3+4.5``, each argument is of a different type (one int, one float),
80 and both must be converted to the same type before they can be added or it
81 will raise a ``TypeError``. Coercion between two operands can be
82 performed with the ``coerce`` builtin function; thus, ``3+4.5`` is
83 equivalent to calling ``operator.add(*coerce(3, 4.5))`` and results in
84 ``operator.add(3.0, 4.5)``. Without coercion, all arguments of even
85 compatible types would have to be normalized to the same value by the
86 programmer, e.g., ``float(3)+4.5`` rather than just ``3+4.5``.
89 An extension of the familiar real number system in which all numbers are
90 expressed as a sum of a real part and an imaginary part. Imaginary
91 numbers are real multiples of the imaginary unit (the square root of
92 ``-1``), often written ``i`` in mathematics or ``j`` in
93 engineering. Python has builtin support for complex numbers, which are
94 written with this latter notation; the imaginary part is written with a
95 ``j`` suffix, e.g., ``3+1j``. To get access to complex equivalents of the
96 :mod:`math` module, use :mod:`cmath`. Use of complex numbers is a fairly
97 advanced mathematical feature. If you're not aware of a need for them,
98 it's almost certain you can safely ignore them.
101 An object which controls the environment seen in a :keyword:`with`
102 statement by defining :meth:`__enter__` and :meth:`__exit__` methods.
106 The canonical implementation of the Python programming language. The
107 term "CPython" is used in contexts when necessary to distinguish this
108 implementation from others such as Jython or IronPython.
111 A function returning another function, usually applied as a function
112 transformation using the ``@wrapper`` syntax. Common examples for
113 decorators are :func:`classmethod` and :func:`staticmethod`.
115 The decorator syntax is merely syntactic sugar, the following two
116 function definitions are semantically equivalent::
126 See :ref:`the documentation for function definition <function>` for more
130 Any *new-style* object which defines the methods :meth:`__get__`,
131 :meth:`__set__`, or :meth:`__delete__`. When a class attribute is a
132 descriptor, its special binding behavior is triggered upon attribute
133 lookup. Normally, using *a.b* to get, set or delete an attribute looks up
134 the object named *b* in the class dictionary for *a*, but if *b* is a
135 descriptor, the respective descriptor method gets called. Understanding
136 descriptors is a key to a deep understanding of Python because they are
137 the basis for many features including functions, methods, properties,
138 class methods, static methods, and reference to super classes.
140 For more information about descriptors' methods, see :ref:`descriptors`.
143 An associative array, where arbitrary keys are mapped to values. The use
144 of :class:`dict` closely resembles that for :class:`list`, but the keys can
145 be any object with a :meth:`__hash__` function, not just integers.
146 Called a hash in Perl.
149 A string literal which appears as the first expression in a class,
150 function or module. While ignored when the suite is executed, it is
151 recognized by the compiler and put into the :attr:`__doc__` attribute
152 of the enclosing class, function or module. Since it is available via
153 introspection, it is the canonical place for documentation of the
157 A pythonic programming style which determines an object's type by inspection
158 of its method or attribute signature rather than by explicit relationship
159 to some type object ("If it looks like a duck and quacks like a duck, it
160 must be a duck.") By emphasizing interfaces rather than specific types,
161 well-designed code improves its flexibility by allowing polymorphic
162 substitution. Duck-typing avoids tests using :func:`type` or
163 :func:`isinstance`. (Note, however, that duck-typing can be complemented
164 with abstract base classes.) Instead, it typically employs :func:`hasattr`
165 tests or :term:`EAFP` programming.
168 Easier to ask for forgiveness than permission. This common Python coding
169 style assumes the existence of valid keys or attributes and catches
170 exceptions if the assumption proves false. This clean and fast style is
171 characterized by the presence of many :keyword:`try` and :keyword:`except`
172 statements. The technique contrasts with the :term:`LBYL` style
173 common to many other languages such as C.
176 A piece of syntax which can be evaluated to some value. In other words,
177 an expression is an accumulation of expression elements like literals, names,
178 attribute access, operators or function calls which all return a value.
179 In contrast to many other languages, not all language constructs are expressions.
180 There are also :term:`statement`\s which cannot be used as expressions,
181 such as :keyword:`print` or :keyword:`if`. Assignments are also statements,
185 A module written in C or C++, using Python's C API to interact with the core and
189 A series of statements which returns some value to a caller. It can also
190 be passed zero or more arguments which may be used in the execution of
191 the body. See also :term:`argument` and :term:`method`.
194 A pseudo module which programmers can use to enable new language features
195 which are not compatible with the current interpreter. For example, the
196 expression ``11/4`` currently evaluates to ``2``. If the module in which
197 it is executed had enabled *true division* by executing::
199 from __future__ import division
201 the expression ``11/4`` would evaluate to ``2.75``. By importing the
202 :mod:`__future__` module and evaluating its variables, you can see when a
203 new feature was first added to the language and when it will become the
206 >>> import __future__
207 >>> __future__.division
208 _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)
211 The process of freeing memory when it is not used anymore. Python
212 performs garbage collection via reference counting and a cyclic garbage
213 collector that is able to detect and break reference cycles.
216 A function which returns an iterator. It looks like a normal function
217 except that values are returned to the caller using a :keyword:`yield`
218 statement instead of a :keyword:`return` statement. Generator functions
219 often contain one or more :keyword:`for` or :keyword:`while` loops which
220 :keyword:`yield` elements back to the caller. The function execution is
221 stopped at the :keyword:`yield` keyword (returning the result) and is
222 resumed there when the next element is requested by calling the
223 :meth:`next` method of the returned iterator.
225 .. index:: single: generator expression
228 An expression that returns a generator. It looks like a normal expression
229 followed by a :keyword:`for` expression defining a loop variable, range,
230 and an optional :keyword:`if` expression. The combined expression
231 generates values for an enclosing function::
233 >>> sum(i*i for i in range(10)) # sum of squares 0, 1, 4, ... 81
237 See :term:`global interpreter lock`.
239 global interpreter lock
240 The lock used by Python threads to assure that only one thread
241 executes in the :term:`CPython` :term:`virtual machine` at a time.
242 This simplifies the CPython implementation by assuring that no two
243 processes can access the same memory at the same time. Locking the
244 entire interpreter makes it easier for the interpreter to be
245 multi-threaded, at the expense of much of the parallelism afforded by
246 multi-processor machines. Efforts have been made in the past to
247 create a "free-threaded" interpreter (one which locks shared data at a
248 much finer granularity), but so far none have been successful because
249 performance suffered in the common single-processor case.
252 An object is *hashable* if it has a hash value which never changes during
253 its lifetime (it needs a :meth:`__hash__` method), and can be compared to
254 other objects (it needs an :meth:`__eq__` or :meth:`__cmp__` method).
255 Hashable objects which compare equal must have the same hash value.
257 Hashability makes an object usable as a dictionary key and a set member,
258 because these data structures use the hash value internally.
260 All of Python's immutable built-in objects are hashable, while no mutable
261 containers (such as lists or dictionaries) are. Objects which are
262 instances of user-defined classes are hashable by default; they all
263 compare unequal, and their hash value is their :func:`id`.
266 An Integrated Development Environment for Python. IDLE is a basic editor
267 and interpreter environment which ships with the standard distribution of
268 Python. Good for beginners, it also serves as clear example code for
269 those wanting to implement a moderately sophisticated, multi-platform GUI
273 An object with a fixed value. Immutable objects include numbers, strings and
274 tuples. Such an object cannot be altered. A new object has to
275 be created if a different value has to be stored. They play an important
276 role in places where a constant hash value is needed, for example as a key
280 Mathematical division discarding any remainder. For example, the
281 expression ``11/4`` currently evaluates to ``2`` in contrast to the
282 ``2.75`` returned by float division. Also called *floor division*.
283 When dividing two integers the outcome will always be another integer
284 (having the floor function applied to it). However, if one of the operands
285 is another numeric type (such as a :class:`float`), the result will be
286 coerced (see :term:`coercion`) to a common type. For example, an integer
287 divided by a float will result in a float value, possibly with a decimal
288 fraction. Integer division can be forced by using the ``//`` operator
289 instead of the ``/`` operator. See also :term:`__future__`.
292 Python has an interactive interpreter which means you can enter
293 statements and expressions at the interpreter prompt, immediately
294 execute them and see their results. Just launch ``python`` with no
295 arguments (possibly by selecting it from your computer's main
296 menu). It is a very powerful way to test out new ideas or inspect
297 modules and packages (remember ``help(x)``).
300 Python is an interpreted language, as opposed to a compiled one,
301 though the distinction can be blurry because of the presence of the
302 bytecode compiler. This means that source files can be run directly
303 without explicitly creating an executable which is then run.
304 Interpreted languages typically have a shorter development/debug cycle
305 than compiled ones, though their programs generally also run more
306 slowly. See also :term:`interactive`.
309 A container object capable of returning its members one at a
310 time. Examples of iterables include all sequence types (such as
311 :class:`list`, :class:`str`, and :class:`tuple`) and some non-sequence
312 types like :class:`dict` and :class:`file` and objects of any classes you
313 define with an :meth:`__iter__` or :meth:`__getitem__` method. Iterables
314 can be used in a :keyword:`for` loop and in many other places where a
315 sequence is needed (:func:`zip`, :func:`map`, ...). When an iterable
316 object is passed as an argument to the builtin function :func:`iter`, it
317 returns an iterator for the object. This iterator is good for one pass
318 over the set of values. When using iterables, it is usually not necessary
319 to call :func:`iter` or deal with iterator objects yourself. The ``for``
320 statement does that automatically for you, creating a temporary unnamed
321 variable to hold the iterator for the duration of the loop. See also
322 :term:`iterator`, :term:`sequence`, and :term:`generator`.
325 An object representing a stream of data. Repeated calls to the iterator's
326 :meth:`next` method return successive items in the stream. When no more
327 data are available a :exc:`StopIteration` exception is raised instead. At
328 this point, the iterator object is exhausted and any further calls to its
329 :meth:`next` method just raise :exc:`StopIteration` again. Iterators are
330 required to have an :meth:`__iter__` method that returns the iterator
331 object itself so every iterator is also iterable and may be used in most
332 places where other iterables are accepted. One notable exception is code
333 which attempts multiple iteration passes. A container object (such as a
334 :class:`list`) produces a fresh new iterator each time you pass it to the
335 :func:`iter` function or use it in a :keyword:`for` loop. Attempting this
336 with an iterator will just return the same exhausted iterator object used
337 in the previous iteration pass, making it appear like an empty container.
339 More information can be found in :ref:`typeiter`.
342 Arguments which are preceded with a ``variable_name=`` in the call.
343 The variable name designates the local name in the function to which the
344 value is assigned. ``**`` is used to accept or pass a dictionary of
345 keyword arguments. See :term:`argument`.
348 An anonymous inline function consisting of a single :term:`expression`
349 which is evaluated when the function is called. The syntax to create
350 a lambda function is ``lambda [arguments]: expression``
353 Look before you leap. This coding style explicitly tests for
354 pre-conditions before making calls or lookups. This style contrasts with
355 the :term:`EAFP` approach and is characterized by the presence of many
356 :keyword:`if` statements.
359 A built-in Python :term:`sequence`. Despite its name it is more akin
360 to an array in other languages than to a linked list since access to
364 A compact way to process all or part of the elements in a sequence and
365 return a list with the results. ``result = ["0x%02x" % x for x in
366 range(256) if x % 2 == 0]`` generates a list of strings containing
367 even hex numbers (0x..) in the range from 0 to 255. The :keyword:`if`
368 clause is optional. If omitted, all elements in ``range(256)`` are
372 A container object (such as :class:`dict`) which supports arbitrary key
373 lookups using the special method :meth:`__getitem__`.
376 The class of a class. Class definitions create a class name, a class
377 dictionary, and a list of base classes. The metaclass is responsible for
378 taking those three arguments and creating the class. Most object oriented
379 programming languages provide a default implementation. What makes Python
380 special is that it is possible to create custom metaclasses. Most users
381 never need this tool, but when the need arises, metaclasses can provide
382 powerful, elegant solutions. They have been used for logging attribute
383 access, adding thread-safety, tracking object creation, implementing
384 singletons, and many other tasks.
386 More information can be found in :ref:`metaclasses`.
389 A function which is defined inside a class body. If called as an attribute
390 of an instance of that class, the method will get the instance object as
391 its first :term:`argument` (which is usually called ``self``).
392 See :term:`function` and :term:`nested scope`.
395 Mutable objects can change their value but keep their :func:`id`. See
396 also :term:`immutable`.
399 Any tuple subclass whose indexable elements are also accessible using
400 named attributes (for example, :func:`time.localtime` returns a
401 tuple-like object where the *year* is accessible either with an
402 index such as ``t[0]`` or with a named attribute like ``t.tm_year``).
404 A named tuple can be a built-in type such as :class:`time.struct_time`,
405 or it can be created with a regular class definition. A full featured
406 named tuple can also be created with the factory function
407 :func:`collections.namedtuple`. The latter approach automatically
408 provides extra features such as a self-documenting representation like
409 ``Employee(name='jones', title='programmer')``.
412 The place where a variable is stored. Namespaces are implemented as
413 dictionaries. There are the local, global and builtin namespaces as well
414 as nested namespaces in objects (in methods). Namespaces support
415 modularity by preventing naming conflicts. For instance, the functions
416 :func:`__builtin__.open` and :func:`os.open` are distinguished by their
417 namespaces. Namespaces also aid readability and maintainability by making
418 it clear which module implements a function. For instance, writing
419 :func:`random.seed` or :func:`itertools.izip` makes it clear that those
420 functions are implemented by the :mod:`random` and :mod:`itertools`
421 modules, respectively.
424 The ability to refer to a variable in an enclosing definition. For
425 instance, a function defined inside another function can refer to
426 variables in the outer function. Note that nested scopes work only for
427 reference and not for assignment which will always write to the innermost
428 scope. In contrast, local variables both read and write in the innermost
429 scope. Likewise, global variables read and write to the global namespace.
432 Any class which inherits from :class:`object`. This includes all built-in
433 types like :class:`list` and :class:`dict`. Only new-style classes can
434 use Python's newer, versatile features like :attr:`__slots__`,
435 descriptors, properties, and :meth:`__getattribute__`.
437 More information can be found in :ref:`newstyle`.
440 Any data with state (attributes or value) and defined behavior
441 (methods). Also the ultimate base class of any :term:`new-style
445 The arguments assigned to local names inside a function or method,
446 determined by the order in which they were given in the call. ``*`` is
447 used to either accept multiple positional arguments (when in the
448 definition), or pass several arguments as a list to a function. See
452 Nickname for the next major Python version, 3.0 (coined long ago
453 when the release of version 3 was something in the distant future.) This
454 is also abbreviated "Py3k".
457 An idea or piece of code which closely follows the most common idioms
458 of the Python language, rather than implementing code using concepts
459 common to other languages. For example, a common idiom in Python is
460 to loop over all elements of an iterable using a :keyword:`for`
461 statement. Many other languages don't have this type of construct, so
462 people unfamiliar with Python sometimes use a numerical counter instead::
464 for i in range(len(food)):
467 As opposed to the cleaner, Pythonic method::
473 The number of references to an object. When the reference count of an
474 object drops to zero, it is deallocated. Reference counting is
475 generally not visible to Python code, but it is a key element of the
476 :term:`CPython` implementation. The :mod:`sys` module defines a
477 :func:`getrefcount` function that programmers can call to return the
478 reference count for a particular object.
481 A declaration inside a :term:`new-style class` that saves memory by
482 pre-declaring space for instance attributes and eliminating instance
483 dictionaries. Though popular, the technique is somewhat tricky to get
484 right and is best reserved for rare cases where there are large numbers of
485 instances in a memory-critical application.
488 An :term:`iterable` which supports efficient element access using integer
489 indices via the :meth:`__getitem__` special method and defines a
490 :meth:`len` method that returns the length of the sequence.
491 Some built-in sequence types are :class:`list`, :class:`str`,
492 :class:`tuple`, and :class:`unicode`. Note that :class:`dict` also
493 supports :meth:`__getitem__` and :meth:`__len__`, but is considered a
494 mapping rather than a sequence because the lookups use arbitrary
495 :term:`immutable` keys rather than integers.
498 An object usually containing a portion of a :term:`sequence`. A slice is
499 created using the subscript notation, ``[]`` with colons between numbers
500 when several are given, such as in ``variable_name[1:3:5]``. The bracket
501 (subscript) notation uses :class:`slice` objects internally (or in older
502 versions, :meth:`__getslice__` and :meth:`__setslice__`).
505 A method that is called implicitly by Python to execute a certain
506 operation on a type, such as addition. Such methods have names starting
507 and ending with double underscores. Special methods are documented in
511 A statement is part of a suite (a "block" of code). A statement is either
512 an :term:`expression` or a one of several constructs with a keyword, such
513 as :keyword:`if`, :keyword:`while` or :keyword:`print`.
516 A string which is bound by three instances of either a quotation mark
517 (") or an apostrophe ('). While they don't provide any functionality
518 not available with single-quoted strings, they are useful for a number
519 of reasons. They allow you to include unescaped single and double
520 quotes within a string and they can span multiple lines without the
521 use of the continuation character, making them especially useful when
525 The type of a Python object determines what kind of object it is; every
526 object has a type. An object's type is accessible as its
527 :attr:`__class__` attribute or can be retrieved with ``type(obj)``.
530 A computer defined entirely in software. Python's virtual machine
531 executes the :term:`bytecode` emitted by the bytecode compiler.
534 Listing of Python design principles and philosophies that are helpful in
535 understanding and using the language. The listing can be found by typing
536 "``import this``" at the interactive prompt.