| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 1 | .. _glossary: | 
 | 2 |  | 
 | 3 | ******** | 
 | 4 | Glossary | 
 | 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. | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 18 |  | 
| Georg Brandl | 5a42ca6 | 2008-05-20 07:20:12 +0000 | [diff] [blame] | 19 |    2to3 | 
 | 20 |       A tool that tries to convert Python 2.x code to Python 3.x code by | 
 | 21 |       handling most of the incompatibilites that can be detected by parsing the | 
 | 22 |       source and traversing the parse tree. | 
 | 23 |  | 
 | 24 |       2to3 is available in the standard library as :mod:`lib2to3`; a standalone | 
| Benjamin Peterson | 4020221 | 2008-07-24 02:45:37 +0000 | [diff] [blame] | 25 |       entry point is provided as :file:`Tools/scripts/2to3`.  See | 
 | 26 |       :ref:`2to3-reference`. | 
| Georg Brandl | 5a42ca6 | 2008-05-20 07:20:12 +0000 | [diff] [blame] | 27 |  | 
| Benjamin Peterson | 9385b9d | 2008-07-03 12:57:35 +0000 | [diff] [blame] | 28 |    abstract base class | 
| Benjamin Peterson | aac51b8 | 2008-07-01 23:33:06 +0000 | [diff] [blame] | 29 |       Abstract Base Classes (abbreviated ABCs) complement :term:`duck-typing` by | 
 | 30 |       providing a way to define interfaces when other techniques like :func:`hasattr` | 
 | 31 |       would be clumsy. Python comes with many builtin ABCs for data structures | 
 | 32 |       (in the :mod:`collections` module), numbers (in the :mod:`numbers` | 
 | 33 |       module), and streams (in the :mod:`io` module). You can create your own | 
 | 34 |       ABC with the :mod:`abc` module. | 
 | 35 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 36 |    argument | 
 | 37 |       A value passed to a function or method, assigned to a name local to | 
 | 38 |       the body.  A function or method may have both positional arguments and | 
 | 39 |       keyword arguments in its definition.  Positional and keyword arguments | 
 | 40 |       may be variable-length: ``*`` accepts or passes (if in the function | 
 | 41 |       definition or call) several positional arguments in a list, while ``**`` | 
 | 42 |       does the same for keyword arguments in a dictionary. | 
 | 43 |  | 
 | 44 |       Any expression may be used within the argument list, and the evaluated | 
 | 45 |       value is passed to the local variable. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 46 |      | 
 | 47 |    BDFL | 
 | 48 |       Benevolent Dictator For Life, a.k.a. `Guido van Rossum | 
 | 49 |       <http://www.python.org/~guido/>`_, Python's creator. | 
 | 50 |      | 
| Georg Brandl | 63fa168 | 2007-10-21 10:24:20 +0000 | [diff] [blame] | 51 |    bytecode | 
 | 52 |       Python source code is compiled into bytecode, the internal representation | 
 | 53 |       of a Python program in the interpreter.  The bytecode is also cached in | 
 | 54 |       ``.pyc`` and ``.pyo`` files so that executing the same file is faster the | 
 | 55 |       second time (recompilation from source to bytecode can be avoided).  This | 
 | 56 |       "intermediate language" is said to run on a "virtual machine" that calls | 
 | 57 |       the subroutines corresponding to each bytecode. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 58 |      | 
 | 59 |    classic class | 
 | 60 |       Any class which does not inherit from :class:`object`.  See | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 61 |       :term:`new-style class`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 62 |      | 
 | 63 |    coercion | 
 | 64 |       The implicit conversion of an instance of one type to another during an | 
 | 65 |       operation which involves two arguments of the same type.  For example, | 
 | 66 |       ``int(3.15)`` converts the floating point number to the integer ``3``, but | 
 | 67 |       in ``3+4.5``, each argument is of a different type (one int, one float), | 
 | 68 |       and both must be converted to the same type before they can be added or it | 
 | 69 |       will raise a ``TypeError``.  Coercion between two operands can be | 
 | 70 |       performed with the ``coerce`` builtin function; thus, ``3+4.5`` is | 
 | 71 |       equivalent to calling ``operator.add(*coerce(3, 4.5))`` and results in | 
 | 72 |       ``operator.add(3.0, 4.5)``.  Without coercion, all arguments of even | 
 | 73 |       compatible types would have to be normalized to the same value by the | 
 | 74 |       programmer, e.g., ``float(3)+4.5`` rather than just ``3+4.5``. | 
 | 75 |      | 
 | 76 |    complex number | 
 | 77 |       An extension of the familiar real number system in which all numbers are | 
 | 78 |       expressed as a sum of a real part and an imaginary part.  Imaginary | 
 | 79 |       numbers are real multiples of the imaginary unit (the square root of | 
 | 80 |       ``-1``), often written ``i`` in mathematics or ``j`` in | 
 | 81 |       engineering. Python has builtin support for complex numbers, which are | 
 | 82 |       written with this latter notation; the imaginary part is written with a | 
 | 83 |       ``j`` suffix, e.g., ``3+1j``.  To get access to complex equivalents of the | 
 | 84 |       :mod:`math` module, use :mod:`cmath`.  Use of complex numbers is a fairly | 
 | 85 |       advanced mathematical feature.  If you're not aware of a need for them, | 
 | 86 |       it's almost certain you can safely ignore them. | 
 | 87 |      | 
| Skip Montanaro | ffe455c | 2007-12-08 15:23:31 +0000 | [diff] [blame] | 88 |    context manager | 
| Georg Brandl | e151ab4 | 2007-12-08 17:56:07 +0000 | [diff] [blame] | 89 |       An objects that controls the environment seen in a :keyword:`with` | 
| Skip Montanaro | ffe455c | 2007-12-08 15:23:31 +0000 | [diff] [blame] | 90 |       statement by defining :meth:`__enter__` and :meth:`__exit__` methods. | 
 | 91 |       See :pep:`343`. | 
 | 92 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 93 |    decorator | 
 | 94 |       A function returning another function, usually applied as a function | 
 | 95 |       transformation using the ``@wrapper`` syntax.  Common examples for | 
 | 96 |       decorators are :func:`classmethod` and :func:`staticmethod`. | 
 | 97 |  | 
 | 98 |       The decorator syntax is merely syntactic sugar, the following two | 
 | 99 |       function definitions are semantically equivalent:: | 
 | 100 |  | 
 | 101 |          def f(...): | 
 | 102 |              ... | 
 | 103 |          f = staticmethod(f) | 
 | 104 |  | 
 | 105 |          @staticmethod | 
 | 106 |          def f(...): | 
 | 107 |              ... | 
 | 108 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 109 |    descriptor | 
 | 110 |       Any *new-style* object that defines the methods :meth:`__get__`, | 
| Georg Brandl | 5e52db0 | 2007-10-21 10:45:46 +0000 | [diff] [blame] | 111 |       :meth:`__set__`, or :meth:`__delete__`.  When a class attribute is a | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 112 |       descriptor, its special binding behavior is triggered upon attribute | 
| Georg Brandl | 5e52db0 | 2007-10-21 10:45:46 +0000 | [diff] [blame] | 113 |       lookup.  Normally, using *a.b* to get, set or delete an attribute looks up | 
 | 114 |       the object named *b* in the class dictionary for *a*, but if *b* is a | 
 | 115 |       descriptor, the respective descriptor method gets called.  Understanding | 
 | 116 |       descriptors is a key to a deep understanding of Python because they are | 
 | 117 |       the basis for many features including functions, methods, properties, | 
 | 118 |       class methods, static methods, and reference to super classes. | 
 | 119 |  | 
 | 120 |       For more information about descriptors' methods, see :ref:`descriptors`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 121 |      | 
 | 122 |    dictionary | 
 | 123 |       An associative array, where arbitrary keys are mapped to values.  The use | 
 | 124 |       of :class:`dict` much resembles that for :class:`list`, but the keys can | 
 | 125 |       be any object with a :meth:`__hash__` function, not just integers starting | 
 | 126 |       from zero.  Called a hash in Perl. | 
| Georg Brandl | e64f738 | 2008-07-20 11:50:29 +0000 | [diff] [blame] | 127 |  | 
 | 128 |    docstring | 
 | 129 |       A docstring ("documentation string") is a string literal that appears as | 
 | 130 |       the first thing in a class or function suite.  While ignored when the | 
 | 131 |       suite is executed, it is recognized by the compiler and put into the | 
 | 132 |       :attr:`__doc__` attribute of the class or function.  Since it is available | 
 | 133 |       via introspection, it is the canonical place for documentation of the | 
 | 134 |       object. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 135 |      | 
| Benjamin Peterson | aac51b8 | 2008-07-01 23:33:06 +0000 | [diff] [blame] | 136 |    duck-typing  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 137 |       Pythonic programming style that determines an object's type by inspection | 
 | 138 |       of its method or attribute signature rather than by explicit relationship | 
 | 139 |       to some type object ("If it looks like a duck and quacks like a duck, it | 
 | 140 |       must be a duck.")  By emphasizing interfaces rather than specific types, | 
 | 141 |       well-designed code improves its flexibility by allowing polymorphic | 
 | 142 |       substitution.  Duck-typing avoids tests using :func:`type` or | 
| Benjamin Peterson | aac51b8 | 2008-07-01 23:33:06 +0000 | [diff] [blame] | 143 |       :func:`isinstance`. (Note, however, that duck-typing can be complemented | 
 | 144 |       with abstract base classes.) Instead, it typically employs :func:`hasattr` | 
 | 145 |       tests or :term:`EAFP` programming. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 146 |      | 
 | 147 |    EAFP | 
 | 148 |       Easier to ask for forgiveness than permission.  This common Python coding | 
 | 149 |       style assumes the existence of valid keys or attributes and catches | 
 | 150 |       exceptions if the assumption proves false.  This clean and fast style is | 
 | 151 |       characterized by the presence of many :keyword:`try` and :keyword:`except` | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 152 |       statements.  The technique contrasts with the :term:`LBYL` style that is | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 153 |       common in many other languages such as C. | 
 | 154 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 155 |    expression | 
 | 156 |       A piece of syntax which can be evaluated to some value.  In other words, | 
 | 157 |       an expression is an accumulation of expression elements like literals, names, | 
 | 158 |       attribute access, operators or function calls that all return a value. | 
 | 159 |       In contrast to other languages, not all language constructs are expressions, | 
 | 160 |       but there are also :term:`statement`\s that cannot be used as expressions, | 
 | 161 |       such as :keyword:`print` or :keyword:`if`.  Assignments are also not | 
 | 162 |       expressions. | 
 | 163 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 164 |    extension module | 
 | 165 |       A module written in C, using Python's C API to interact with the core and | 
 | 166 |       with user code. | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 167 |  | 
 | 168 |    function | 
 | 169 |       A series of statements which returns some value to a caller. It can also | 
 | 170 |       be passed zero or more arguments which may be used in the execution of | 
 | 171 |       the body. See also :term:`argument` and :term:`method`. | 
 | 172 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 173 |    __future__ | 
 | 174 |       A pseudo module which programmers can use to enable new language features | 
 | 175 |       which are not compatible with the current interpreter.  For example, the | 
 | 176 |       expression ``11/4`` currently evaluates to ``2``. If the module in which | 
 | 177 |       it is executed had enabled *true division* by executing:: | 
 | 178 |      | 
 | 179 |          from __future__ import division | 
 | 180 |      | 
 | 181 |       the expression ``11/4`` would evaluate to ``2.75``.  By importing the | 
 | 182 |       :mod:`__future__` module and evaluating its variables, you can see when a | 
 | 183 |       new feature was first added to the language and when it will become the | 
 | 184 |       default:: | 
 | 185 |      | 
 | 186 |          >>> import __future__ | 
 | 187 |          >>> __future__.division | 
 | 188 |          _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192) | 
 | 189 |  | 
 | 190 |    garbage collection | 
 | 191 |       The process of freeing memory when it is not used anymore.  Python | 
 | 192 |       performs garbage collection via reference counting and a cyclic garbage | 
 | 193 |       collector that is able to detect and break reference cycles. | 
 | 194 |      | 
 | 195 |    generator | 
 | 196 |       A function that returns an iterator.  It looks like a normal function | 
 | 197 |       except that values are returned to the caller using a :keyword:`yield` | 
 | 198 |       statement instead of a :keyword:`return` statement.  Generator functions | 
 | 199 |       often contain one or more :keyword:`for` or :keyword:`while` loops that | 
 | 200 |       :keyword:`yield` elements back to the caller.  The function execution is | 
 | 201 |       stopped at the :keyword:`yield` keyword (returning the result) and is | 
 | 202 |       resumed there when the next element is requested by calling the | 
 | 203 |       :meth:`next` method of the returned iterator. | 
 | 204 |      | 
 | 205 |       .. index:: single: generator expression | 
 | 206 |      | 
 | 207 |    generator expression | 
 | 208 |       An expression that returns a generator.  It looks like a normal expression | 
 | 209 |       followed by a :keyword:`for` expression defining a loop variable, range, | 
 | 210 |       and an optional :keyword:`if` expression.  The combined expression | 
 | 211 |       generates values for an enclosing function:: | 
 | 212 |      | 
 | 213 |          >>> sum(i*i for i in range(10))         # sum of squares 0, 1, 4, ... 81 | 
 | 214 |          285 | 
 | 215 |      | 
 | 216 |    GIL | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 217 |       See :term:`global interpreter lock`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 218 |      | 
 | 219 |    global interpreter lock | 
 | 220 |       The lock used by Python threads to assure that only one thread can be run | 
 | 221 |       at a time.  This simplifies Python by assuring that no two processes can | 
 | 222 |       access the same memory at the same time.  Locking the entire interpreter | 
 | 223 |       makes it easier for the interpreter to be multi-threaded, at the expense | 
 | 224 |       of some parallelism on multi-processor machines.  Efforts have been made | 
 | 225 |       in the past to create a "free-threaded" interpreter (one which locks | 
 | 226 |       shared data at a much finer granularity), but performance suffered in the | 
 | 227 |       common single-processor case. | 
| Georg Brandl | 7c3e79f | 2007-11-02 20:06:17 +0000 | [diff] [blame] | 228 |  | 
 | 229 |    hashable | 
 | 230 |       An object is *hashable* if it has a hash value that never changes during | 
 | 231 |       its lifetime (it needs a :meth:`__hash__` method), and can be compared to | 
 | 232 |       other objects (it needs an :meth:`__eq__` or :meth:`__cmp__` method). | 
 | 233 |       Hashable objects that compare equal must have the same hash value. | 
 | 234 |  | 
 | 235 |       Hashability makes an object usable as a dictionary key and a set member, | 
 | 236 |       because these data structures use the hash value internally. | 
 | 237 |  | 
 | 238 |       All of Python's immutable built-in objects are hashable, while all mutable | 
 | 239 |       containers (such as lists or dictionaries) are not.  Objects that are | 
 | 240 |       instances of user-defined classes are hashable by default; they all | 
 | 241 |       compare unequal, and their hash value is their :func:`id`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 242 |      | 
 | 243 |    IDLE | 
 | 244 |       An Integrated Development Environment for Python.  IDLE is a basic editor | 
 | 245 |       and interpreter environment that ships with the standard distribution of | 
 | 246 |       Python.  Good for beginners, it also serves as clear example code for | 
 | 247 |       those wanting to implement a moderately sophisticated, multi-platform GUI | 
 | 248 |       application. | 
 | 249 |      | 
 | 250 |    immutable | 
 | 251 |       An object with fixed value.  Immutable objects are numbers, strings or | 
 | 252 |       tuples (and more).  Such an object cannot be altered.  A new object has to | 
 | 253 |       be created if a different value has to be stored.  They play an important | 
 | 254 |       role in places where a constant hash value is needed, for example as a key | 
 | 255 |       in a dictionary. | 
 | 256 |      | 
 | 257 |    integer division | 
 | 258 |       Mathematical division discarding any remainder.  For example, the | 
 | 259 |       expression ``11/4`` currently evaluates to ``2`` in contrast to the | 
 | 260 |       ``2.75`` returned by float division.  Also called *floor division*. | 
 | 261 |       When dividing two integers the outcome will always be another integer | 
 | 262 |       (having the floor function applied to it). However, if one of the operands | 
 | 263 |       is another numeric type (such as a :class:`float`), the result will be | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 264 |       coerced (see :term:`coercion`) to a common type.  For example, an integer | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 265 |       divided by a float will result in a float value, possibly with a decimal | 
 | 266 |       fraction.  Integer division can be forced by using the ``//`` operator | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 267 |       instead of the ``/`` operator.  See also :term:`__future__`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 268 |      | 
 | 269 |    interactive | 
 | 270 |       Python has an interactive interpreter which means that you can try out | 
 | 271 |       things and immediately see their results.  Just launch ``python`` with no | 
 | 272 |       arguments (possibly by selecting it from your computer's main menu). It is | 
 | 273 |       a very powerful way to test out new ideas or inspect modules and packages | 
 | 274 |       (remember ``help(x)``). | 
 | 275 |      | 
 | 276 |    interpreted | 
 | 277 |       Python is an interpreted language, as opposed to a compiled one.  This | 
 | 278 |       means that the source files can be run directly without first creating an | 
 | 279 |       executable which is then run.  Interpreted languages typically have a | 
 | 280 |       shorter development/debug cycle than compiled ones, though their programs | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 281 |       generally also run more slowly.  See also :term:`interactive`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 282 |      | 
 | 283 |    iterable | 
 | 284 |       A container object capable of returning its members one at a | 
 | 285 |       time. Examples of iterables include all sequence types (such as | 
 | 286 |       :class:`list`, :class:`str`, and :class:`tuple`) and some non-sequence | 
 | 287 |       types like :class:`dict` and :class:`file` and objects of any classes you | 
 | 288 |       define with an :meth:`__iter__` or :meth:`__getitem__` method.  Iterables | 
 | 289 |       can be used in a :keyword:`for` loop and in many other places where a | 
 | 290 |       sequence is needed (:func:`zip`, :func:`map`, ...).  When an iterable | 
 | 291 |       object is passed as an argument to the builtin function :func:`iter`, it | 
 | 292 |       returns an iterator for the object.  This iterator is good for one pass | 
 | 293 |       over the set of values.  When using iterables, it is usually not necessary | 
 | 294 |       to call :func:`iter` or deal with iterator objects yourself.  The ``for`` | 
 | 295 |       statement does that automatically for you, creating a temporary unnamed | 
 | 296 |       variable to hold the iterator for the duration of the loop.  See also | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 297 |       :term:`iterator`, :term:`sequence`, and :term:`generator`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 298 |      | 
 | 299 |    iterator | 
 | 300 |       An object representing a stream of data.  Repeated calls to the iterator's | 
 | 301 |       :meth:`next` method return successive items in the stream.  When no more | 
 | 302 |       data is available a :exc:`StopIteration` exception is raised instead.  At | 
 | 303 |       this point, the iterator object is exhausted and any further calls to its | 
 | 304 |       :meth:`next` method just raise :exc:`StopIteration` again.  Iterators are | 
 | 305 |       required to have an :meth:`__iter__` method that returns the iterator | 
 | 306 |       object itself so every iterator is also iterable and may be used in most | 
 | 307 |       places where other iterables are accepted.  One notable exception is code | 
 | 308 |       that attempts multiple iteration passes.  A container object (such as a | 
 | 309 |       :class:`list`) produces a fresh new iterator each time you pass it to the | 
 | 310 |       :func:`iter` function or use it in a :keyword:`for` loop.  Attempting this | 
 | 311 |       with an iterator will just return the same exhausted iterator object used | 
 | 312 |       in the previous iteration pass, making it appear like an empty container. | 
 | 313 |      | 
| Georg Brandl | e7a0990 | 2007-10-21 12:10:28 +0000 | [diff] [blame] | 314 |       More information can be found in :ref:`typeiter`. | 
 | 315 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 316 |    keyword argument | 
 | 317 |       Arguments which are preceded with a ``variable_name=`` in the call. | 
 | 318 |       The variable name designates the local name in the function to which the | 
 | 319 |       value is assigned.  ``**`` is used to accept or pass a dictionary of | 
 | 320 |       keyword arguments.  See :term:`argument`. | 
 | 321 |  | 
 | 322 |    lambda | 
 | 323 |       An anonymous inline function consisting of a single :term:`expression` | 
 | 324 |       which is evaluated when the function is called.  The syntax to create | 
 | 325 |       a lambda function is ``lambda [arguments]: expression`` | 
 | 326 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 327 |    LBYL | 
 | 328 |       Look before you leap.  This coding style explicitly tests for | 
 | 329 |       pre-conditions before making calls or lookups.  This style contrasts with | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 330 |       the :term:`EAFP` approach and is characterized by the presence of many | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 331 |       :keyword:`if` statements. | 
 | 332 |      | 
 | 333 |    list comprehension | 
 | 334 |       A compact way to process all or a subset of elements in a sequence and | 
 | 335 |       return a list with the results.  ``result = ["0x%02x" % x for x in | 
 | 336 |       range(256) if x % 2 == 0]`` generates a list of strings containing hex | 
 | 337 |       numbers (0x..) that are even and in the range from 0 to 255. The | 
 | 338 |       :keyword:`if` clause is optional.  If omitted, all elements in | 
 | 339 |       ``range(256)`` are processed. | 
 | 340 |      | 
 | 341 |    mapping | 
 | 342 |       A container object (such as :class:`dict`) that supports arbitrary key | 
 | 343 |       lookups using the special method :meth:`__getitem__`. | 
 | 344 |      | 
 | 345 |    metaclass | 
 | 346 |       The class of a class.  Class definitions create a class name, a class | 
 | 347 |       dictionary, and a list of base classes.  The metaclass is responsible for | 
 | 348 |       taking those three arguments and creating the class.  Most object oriented | 
 | 349 |       programming languages provide a default implementation.  What makes Python | 
 | 350 |       special is that it is possible to create custom metaclasses.  Most users | 
 | 351 |       never need this tool, but when the need arises, metaclasses can provide | 
 | 352 |       powerful, elegant solutions.  They have been used for logging attribute | 
 | 353 |       access, adding thread-safety, tracking object creation, implementing | 
 | 354 |       singletons, and many other tasks. | 
| Georg Brandl | a739503 | 2007-10-21 12:15:05 +0000 | [diff] [blame] | 355 |  | 
 | 356 |       More information can be found in :ref:`metaclasses`. | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 357 |  | 
 | 358 |    method | 
 | 359 |       A function that is defined inside a class body.  If called as an attribute | 
 | 360 |       of an instance of that class, the method will get the instance object as | 
 | 361 |       its first :term:`argument` (which is usually called ``self``). | 
 | 362 |       See :term:`function` and :term:`nested scope`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 363 |      | 
 | 364 |    mutable | 
 | 365 |       Mutable objects can change their value but keep their :func:`id`.  See | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 366 |       also :term:`immutable`. | 
| Georg Brandl | e3c3db5 | 2008-01-11 09:55:53 +0000 | [diff] [blame] | 367 |  | 
 | 368 |    named tuple | 
| Raymond Hettinger | d4c2e86 | 2008-01-15 03:07:42 +0000 | [diff] [blame] | 369 |       Any tuple subclass whose indexable fields are also accessible with | 
| Raymond Hettinger | c20ed51 | 2008-01-13 06:15:15 +0000 | [diff] [blame] | 370 |       named attributes (for example, :func:`time.localtime` returns a | 
| Raymond Hettinger | 8bdd044 | 2008-01-13 06:18:07 +0000 | [diff] [blame] | 371 |       tuple-like object where the *year* is accessible either with an | 
| Raymond Hettinger | c20ed51 | 2008-01-13 06:15:15 +0000 | [diff] [blame] | 372 |       index such as ``t[0]`` or with a named attribute like ``t.tm_year``). | 
 | 373 |  | 
 | 374 |       A named tuple can be a built-in type such as :class:`time.struct_time`, | 
 | 375 |       or it can be created with a regular class definition.  A full featured | 
 | 376 |       named tuple can also be created with the factory function | 
 | 377 |       :func:`collections.namedtuple`.  The latter approach automatically | 
 | 378 |       provides extra features such as a self-documenting representation like | 
 | 379 |       ``Employee(name='jones', title='programmer')``. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 380 |      | 
 | 381 |    namespace | 
 | 382 |       The place where a variable is stored.  Namespaces are implemented as | 
 | 383 |       dictionaries.  There are the local, global and builtin namespaces as well | 
 | 384 |       as nested namespaces in objects (in methods).  Namespaces support | 
 | 385 |       modularity by preventing naming conflicts.  For instance, the functions | 
 | 386 |       :func:`__builtin__.open` and :func:`os.open` are distinguished by their | 
 | 387 |       namespaces.  Namespaces also aid readability and maintainability by making | 
 | 388 |       it clear which module implements a function.  For instance, writing | 
 | 389 |       :func:`random.seed` or :func:`itertools.izip` makes it clear that those | 
 | 390 |       functions are implemented by the :mod:`random` and :mod:`itertools` | 
 | 391 |       modules respectively. | 
 | 392 |      | 
 | 393 |    nested scope | 
 | 394 |       The ability to refer to a variable in an enclosing definition.  For | 
 | 395 |       instance, a function defined inside another function can refer to | 
 | 396 |       variables in the outer function.  Note that nested scopes work only for | 
 | 397 |       reference and not for assignment which will always write to the innermost | 
 | 398 |       scope.  In contrast, local variables both read and write in the innermost | 
 | 399 |       scope.  Likewise, global variables read and write to the global namespace. | 
 | 400 |      | 
 | 401 |    new-style class | 
 | 402 |       Any class that inherits from :class:`object`.  This includes all built-in | 
 | 403 |       types like :class:`list` and :class:`dict`.  Only new-style classes can | 
 | 404 |       use Python's newer, versatile features like :attr:`__slots__`, | 
 | 405 |       descriptors, properties, :meth:`__getattribute__`, class methods, and | 
 | 406 |       static methods. | 
| Georg Brandl | a739503 | 2007-10-21 12:15:05 +0000 | [diff] [blame] | 407 |  | 
 | 408 |       More information can be found in :ref:`newstyle`. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 409 |      | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 410 |    positional argument | 
 | 411 |       The arguments assigned to local names inside a function or method, | 
 | 412 |       determined by the order in which they were given in the call.  ``*`` is | 
 | 413 |       used to either accept multiple positional arguments (when in the | 
 | 414 |       definition), or pass several arguments as a list to a function.  See | 
 | 415 |       :term:`argument`. | 
 | 416 |  | 
| Benjamin Peterson | 518c44c | 2008-05-16 22:59:28 +0000 | [diff] [blame] | 417 |    Python 3000  | 
 | 418 |       Nickname for the next major Python version, 3.0 (coined long ago | 
 | 419 |       when the release of version 3 was something in the distant future.)  This | 
 | 420 |       is also abbreviated "Py3k". | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 421 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 422 |    Pythonic | 
 | 423 |       An idea or piece of code which closely follows the most common idioms of | 
 | 424 |       the Python language, rather than implementing code using concepts common | 
 | 425 |       in other languages.  For example, a common idiom in Python is the :keyword:`for` | 
 | 426 |       loop structure; other languages don't have this easy keyword, so people | 
 | 427 |       use a numerical counter instead:: | 
 | 428 |       | 
 | 429 |           for i in range(len(food)): | 
 | 430 |               print food[i] | 
 | 431 |  | 
 | 432 |       As opposed to the cleaner, Pythonic method:: | 
 | 433 |  | 
 | 434 |          for piece in food: | 
 | 435 |              print piece | 
 | 436 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 437 |    reference count | 
 | 438 |       The number of places where a certain object is referenced to.  When the | 
 | 439 |       reference count drops to zero, an object is deallocated.  While reference | 
 | 440 |       counting is invisible on the Python code level, it is used on the | 
 | 441 |       implementation level to keep track of allocated memory. | 
 | 442 |      | 
 | 443 |    __slots__ | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 444 |       A declaration inside a :term:`new-style class` that saves memory by | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 445 |       pre-declaring space for instance attributes and eliminating instance | 
 | 446 |       dictionaries.  Though popular, the technique is somewhat tricky to get | 
 | 447 |       right and is best reserved for rare cases where there are large numbers of | 
 | 448 |       instances in a memory-critical application. | 
 | 449 |      | 
 | 450 |    sequence | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 451 |       An :term:`iterable` which supports efficient element access using integer | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 452 |       indices via the :meth:`__getitem__` and :meth:`__len__` special methods. | 
 | 453 |       Some built-in sequence types are :class:`list`, :class:`str`, | 
 | 454 |       :class:`tuple`, and :class:`unicode`. Note that :class:`dict` also | 
 | 455 |       supports :meth:`__getitem__` and :meth:`__len__`, but is considered a | 
 | 456 |       mapping rather than a sequence because the lookups use arbitrary | 
| Georg Brandl | 6c82b6c | 2007-08-17 16:54:59 +0000 | [diff] [blame] | 457 |       :term:`immutable` keys rather than integers. | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 458 |  | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 459 |    slice | 
| Georg Brandl | 968a3e5 | 2007-12-02 18:17:50 +0000 | [diff] [blame] | 460 |       An object usually containing a portion of a :term:`sequence`.  A slice is | 
| Georg Brandl | 584265b | 2007-12-02 14:58:50 +0000 | [diff] [blame] | 461 |       created using the subscript notation, ``[]`` with colons between numbers | 
 | 462 |       when several are given, such as in ``variable_name[1:3:5]``.  The bracket | 
 | 463 |       (subscript) notation uses :class:`slice` objects internally (or in older | 
 | 464 |       versions, :meth:`__getslice__` and :meth:`__setslice__`). | 
 | 465 |  | 
 | 466 |    statement | 
 | 467 |       A statement is part of a suite (a "block" of code).  A statement is either | 
 | 468 |       an :term:`expression` or a one of several constructs with a keyword, such | 
 | 469 |       as :keyword:`if`, :keyword:`while` or :keyword:`print`. | 
 | 470 |  | 
| Georg Brandl | 437e6a3 | 2007-08-17 06:27:11 +0000 | [diff] [blame] | 471 |    type | 
 | 472 |       The type of a Python object determines what kind of object it is; every | 
 | 473 |       object has a type.  An object's type is accessible as its | 
 | 474 |       :attr:`__class__` attribute or can be retrieved with ``type(obj)``. | 
 | 475 |      | 
 | 476 |    Zen of Python | 
 | 477 |       Listing of Python design principles and philosophies that are helpful in | 
 | 478 |       understanding and using the language.  The listing can be found by typing | 
 | 479 |       "``import this``" at the interactive prompt. |