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