2 \usepackage[T1]{fontenc}
5 % Add a section on file I/O
6 % Write a chapter entitled ``Some Useful Modules''
8 % Should really move the Python startup file info to an appendix
10 \title{Python Tutorial
}
19 \chapter*
{Front Matter
\label{front
}}
27 Python is an easy to learn, powerful programming language. It has
28 efficient high-level data structures and a simple but effective
29 approach to object-oriented programming. Python's elegant syntax and
30 dynamic typing, together with its interpreted nature, make it an ideal
31 language for scripting and rapid application development in many areas
34 The Python interpreter and the extensive standard library are freely
35 available in source or binary form for all major platforms from the
36 Python Web site,
\url{http://www.python.org/
}, and can be freely
37 distributed. The same site also contains distributions of and
38 pointers to many free third party Python modules, programs and tools,
39 and additional documentation.
41 The Python interpreter is easily extended with new functions and data
42 types implemented in C or
\Cpp{} (or other languages callable from C).
43 Python is also suitable as an extension language for customizable
46 This tutorial introduces the reader informally to the basic concepts
47 and features of the Python language and system. It helps to have a
48 Python interpreter handy for hands-on experience, but all examples are
49 self-contained, so the tutorial can be read off-line as well.
51 For a description of standard objects and modules, see the
52 \citetitle[../lib/lib.html
]{Python Library Reference
} document. The
53 \citetitle[../ref/ref.html
]{Python Reference Manual
} gives a more
54 formal definition of the language. To write extensions in C or
55 \Cpp, read
\citetitle[../ext/ext.html
]{Extending and Embedding the
56 Python Interpreter
} and
\citetitle[../api/api.html
]{Python/C API
57 Reference
}. There are also several books covering Python in depth.
59 This tutorial does not attempt to be comprehensive and cover every
60 single feature, or even every commonly used feature. Instead, it
61 introduces many of Python's most noteworthy features, and will give
62 you a good idea of the language's flavor and style. After reading it,
63 you will be able to read and write Python modules and programs, and
64 you will be ready to learn more about the various Python library
65 modules described in the
\citetitle[../lib/lib.html
]{Python Library
73 \chapter{Whetting Your Appetite
\label{intro
}}
75 If you ever wrote a large shell script, you probably know this
76 feeling: you'd love to add yet another feature, but it's already so
77 slow, and so big, and so complicated; or the feature involves a system
78 call or other function that is only accessible from C
\ldots Usually
79 the problem at hand isn't serious enough to warrant rewriting the
80 script in C; perhaps the problem requires variable-length strings or
81 other data types (like sorted lists of file names) that are easy in
82 the shell but lots of work to implement in C, or perhaps you're not
83 sufficiently familiar with C.
85 Another situation: perhaps you have to work with several C libraries,
86 and the usual C write/compile/test/re-compile cycle is too slow. You
87 need to develop software more quickly. Possibly perhaps you've
88 written a program that could use an extension language, and you don't
89 want to design a language, write and debug an interpreter for it, then
90 tie it into your application.
92 In such cases, Python may be just the language for you. Python is
93 simple to use, but it is a real programming language, offering much
94 more structure and support for large programs than the shell has. On
95 the other hand, it also offers much more error checking than C, and,
96 being a
\emph{very-high-level language
}, it has high-level data types
97 built in, such as flexible arrays and dictionaries that would cost you
98 days to implement efficiently in C. Because of its more general data
99 types Python is applicable to a much larger problem domain than
100 \emph{Awk
} or even
\emph{Perl
}, yet many things are at least as easy
101 in Python as in those languages.
103 Python allows you to split up your program in modules that can be
104 reused in other Python programs. It comes with a large collection of
105 standard modules that you can use as the basis of your programs --- or
106 as examples to start learning to program in Python. There are also
107 built-in modules that provide things like file I/O, system calls,
108 sockets, and even interfaces to graphical user interface toolkits like Tk.
110 Python is an interpreted language, which can save you considerable time
111 during program development because no compilation and linking is
112 necessary. The interpreter can be used interactively, which makes it
113 easy to experiment with features of the language, to write throw-away
114 programs, or to test functions during bottom-up program development.
115 It is also a handy desk calculator.
117 Python allows writing very compact and readable programs. Programs
118 written in Python are typically much shorter than equivalent C or
119 \Cpp{} programs, for several reasons:
122 the high-level data types allow you to express complex operations in a
125 statement grouping is done by indentation instead of begin/end
128 no variable or argument declarations are necessary.
131 Python is
\emph{extensible
}: if you know how to program in C it is easy
132 to add a new built-in function or module to the interpreter, either to
133 perform critical operations at maximum speed, or to link Python
134 programs to libraries that may only be available in binary form (such
135 as a vendor-specific graphics library). Once you are really hooked,
136 you can link the Python interpreter into an application written in C
137 and use it as an extension or command language for that application.
139 By the way, the language is named after the BBC show ``Monty Python's
140 Flying Circus'' and has nothing to do with nasty reptiles. Making
141 references to Monty Python skits in documentation is not only allowed,
144 \section{Where From Here
\label{where
}}
146 Now that you are all excited about Python, you'll want to examine it
147 in some more detail. Since the best way to learn a language is
148 using it, you are invited here to do so.
150 In the next chapter, the mechanics of using the interpreter are
151 explained. This is rather mundane information, but essential for
152 trying out the examples shown later.
154 The rest of the tutorial introduces various features of the Python
155 language and system through examples, beginning with simple
156 expressions, statements and data types, through functions and modules,
157 and finally touching upon advanced concepts like exceptions
158 and user-defined classes.
160 \chapter{Using the Python Interpreter
\label{using
}}
162 \section{Invoking the Interpreter
\label{invoking
}}
164 The Python interpreter is usually installed as
165 \file{/usr/local/bin/python
} on those machines where it is available;
166 putting
\file{/usr/local/bin
} in your
\UNIX{} shell's search path
167 makes it possible to start it by typing the command
173 to the shell. Since the choice of the directory where the interpreter
174 lives is an installation option, other places are possible; check with
175 your local Python guru or system administrator. (E.g.,
176 \file{/usr/local/python
} is a popular alternative location.)
178 Typing an end-of-file character (
\kbd{Control-D
} on
\UNIX,
179 \kbd{Control-Z
} on DOS or Windows) at the primary prompt causes the
180 interpreter to exit with a zero exit status. If that doesn't work,
181 you can exit the interpreter by typing the following commands:
182 \samp{import sys; sys.exit()
}.
184 The interpreter's line-editing features usually aren't very
185 sophisticated. On
\UNIX, whoever installed the interpreter may have
186 enabled support for the GNU readline library, which adds more
187 elaborate interactive editing and history features. Perhaps the
188 quickest check to see whether command line editing is supported is
189 typing Control-P to the first Python prompt you get. If it beeps, you
190 have command line editing; see Appendix
\ref{interacting
} for an
191 introduction to the keys. If nothing appears to happen, or if
192 \code{\^P
} is echoed, command line editing isn't available; you'll
193 only be able to use backspace to remove characters from the current
196 The interpreter operates somewhat like the
\UNIX{} shell: when called
197 with standard input connected to a tty device, it reads and executes
198 commands interactively; when called with a file name argument or with
199 a file as standard input, it reads and executes a
\emph{script
} from
202 A third way of starting the interpreter is
203 \samp{\program{python
} \programopt{-c
} \var{command
} [arg
] ...
}, which
204 executes the statement(s) in
\var{command
}, analogous to the shell's
205 \programopt{-c
} option. Since Python statements often contain spaces
206 or other characters that are special to the shell, it is best to quote
207 \var{command
} in its entirety with double quotes.
209 Note that there is a difference between
\samp{python file
} and
210 \samp{python <file
}. In the latter case, input requests from the
211 program, such as calls to
\code{input()
} and
\code{raw_input()
}, are
212 satisfied from
\emph{file
}. Since this file has already been read
213 until the end by the parser before the program starts executing, the
214 program will encounter end-of-file immediately. In the former case
215 (which is usually what you want) they are satisfied from whatever file
216 or device is connected to standard input of the Python interpreter.
218 When a script file is used, it is sometimes useful to be able to run
219 the script and enter interactive mode afterwards. This can be done by
220 passing
\programopt{-i
} before the script. (This does not work if the
221 script is read from standard input, for the same reason as explained
222 in the previous paragraph.)
224 \subsection{Argument Passing
\label{argPassing
}}
226 When known to the interpreter, the script name and additional
227 arguments thereafter are passed to the script in the variable
228 \code{sys.argv
}, which is a list of strings. Its length is at least
229 one; when no script and no arguments are given,
\code{sys.argv
[0]} is
230 an empty string. When the script name is given as
\code{'-'
} (meaning
231 standard input),
\code{sys.argv
[0]} is set to
\code{'-'
}. When
232 \programopt{-c
} \var{command
} is used,
\code{sys.argv
[0]} is set to
233 \code{'-c'
}. Options found after
\programopt{-c
} \var{command
} are
234 not consumed by the Python interpreter's option processing but left in
235 \code{sys.argv
} for the command to handle.
237 \subsection{Interactive Mode
\label{interactive
}}
239 When commands are read from a tty, the interpreter is said to be in
240 \emph{interactive mode
}. In this mode it prompts for the next command
241 with the
\emph{primary prompt
}, usually three greater-than signs
242 (
\samp{>
\code{>
}>~
}); for continuation lines it prompts with the
243 \emph{secondary prompt
}, by default three dots (
\samp{...~
}).
244 The interpreter prints a welcome message stating its version number
245 and a copyright notice before printing the first prompt:
249 Python
1.5.2b2 (
#1, Feb
28 1999,
00:
02:
06)
[GCC
2.8.1] on sunos5
250 Copyright
1991-
1995 Stichting Mathematisch Centrum, Amsterdam
254 Continuation lines are needed when entering a multi-line construct.
255 As an example, take a look at this
\keyword{if
} statement:
258 >>> the_world_is_flat =
1
259 >>> if the_world_is_flat:
260 ... print "Be careful not to fall off!"
262 Be careful not to fall off!
266 \section{The Interpreter and Its Environment
\label{interp
}}
268 \subsection{Error Handling
\label{error
}}
270 When an error occurs, the interpreter prints an error
271 message and a stack trace. In interactive mode, it then returns to
272 the primary prompt; when input came from a file, it exits with a
273 nonzero exit status after printing
274 the stack trace. (Exceptions handled by an
\code{except
} clause in a
275 \code{try
} statement are not errors in this context.) Some errors are
276 unconditionally fatal and cause an exit with a nonzero exit; this
277 applies to internal inconsistencies and some cases of running out of
278 memory. All error messages are written to the standard error stream;
279 normal output from the executed commands is written to standard
282 Typing the interrupt character (usually Control-C or DEL) to the
283 primary or secondary prompt cancels the input and returns to the
284 primary prompt.
\footnote{
285 A problem with the GNU Readline package may prevent this.
287 Typing an interrupt while a command is executing raises the
288 \code{KeyboardInterrupt
} exception, which may be handled by a
289 \code{try
} statement.
291 \subsection{Executable Python Scripts
\label{scripts
}}
293 On BSD'ish
\UNIX{} systems, Python scripts can be made directly
294 executable, like shell scripts, by putting the line
297 #! /usr/bin/env python
300 (assuming that the interpreter is on the user's
\envvar{PATH
}) at the
301 beginning of the script and giving the file an executable mode. The
302 \samp{\#!
} must be the first two characters of the file. Note that
303 the hash, or pound, character,
\character{\#
}, is used to start a
306 \subsection{The Interactive Startup File
\label{startup
}}
308 % XXX This should probably be dumped in an appendix, since most people
309 % don't use Python interactively in non-trivial ways.
311 When you use Python interactively, it is frequently handy to have some
312 standard commands executed every time the interpreter is started. You
313 can do this by setting an environment variable named
314 \envvar{PYTHONSTARTUP
} to the name of a file containing your start-up
315 commands. This is similar to the
\file{.profile
} feature of the
318 This file is only read in interactive sessions, not when Python reads
319 commands from a script, and not when
\file{/dev/tty
} is given as the
320 explicit source of commands (which otherwise behaves like an
321 interactive session). It is executed in the same namespace where
322 interactive commands are executed, so that objects that it defines or
323 imports can be used without qualification in the interactive session.
324 You can also change the prompts
\code{sys.ps1
} and
\code{sys.ps2
} in
327 If you want to read an additional start-up file from the current
328 directory, you can program this in the global start-up file using code
329 like
\samp{if os.path.isfile('.pythonrc.py'):
330 execfile('.pythonrc.py')
}. If you want to use the startup file in a
331 script, you must do this explicitly in the script:
335 filename = os.environ.get('PYTHONSTARTUP')
336 if filename and os.path.isfile(filename):
341 \chapter{An Informal Introduction to Python
\label{informal
}}
343 In the following examples, input and output are distinguished by the
344 presence or absence of prompts (
\samp{>
\code{>
}>~
} and
\samp{...~
}): to repeat
345 the example, you must type everything after the prompt, when the
346 prompt appears; lines that do not begin with a prompt are output from
349 % I'd prefer to use different fonts to distinguish input
350 % from output, but the amount of LaTeX hacking that would require
351 % is currently beyond my ability.
353 Note that a secondary prompt on a line by itself in an example means
354 you must type a blank line; this is used to end a multi-line command.
356 Many of the examples in this manual, even those entered at the
357 interactive prompt, include comments. Comments in Python start with
358 the hash character,
\character{\#
}, and extend to the end of the
359 physical line. A comment may appear at the start of a line or
360 following whitespace or code, but not within a string literal. A hash
361 character within a string literal is just a hash character.
366 # this is the first comment
367 SPAM =
1 # and this is the second comment
368 # ... and now a third!
369 STRING = "# This is not a comment."
373 \section{Using Python as a Calculator
\label{calculator
}}
375 Let's try some simple Python commands. Start the interpreter and wait
376 for the primary prompt,
\samp{>
\code{>
}>~
}. (It shouldn't take long.)
378 \subsection{Numbers
\label{numbers
}}
380 The interpreter acts as a simple calculator: you can type an
381 expression at it and it will write the value. Expression syntax is
382 straightforward: the operators
\code{+
},
\code{-
},
\code{*
} and
383 \code{/
} work just like in most other languages (for example, Pascal
384 or C); parentheses can be used for grouping. For example:
389 >>> # This is a comment
392 >>>
2+
2 # and a comment on the same line as code
396 >>> # Integer division returns the floor:
403 Like in C, the equal sign (
\character{=
}) is used to assign a value to a
404 variable. The value of an assignment is not written:
413 A value can be assigned to several variables simultaneously:
416 >>> x = y = z =
0 # Zero x, y and z
425 There is full support for floating point; operators with mixed type
426 operands convert the integer operand to floating point:
435 Complex numbers are also supported; imaginary numbers are written with
436 a suffix of
\samp{j
} or
\samp{J
}. Complex numbers with a nonzero
437 real component are written as
\samp{(
\var{real
}+
\var{imag
}j)
}, or can
438 be created with the
\samp{complex(
\var{real
},
\var{imag
})
} function.
443 >>>
1j * complex(
0,
1)
453 Complex numbers are always represented as two floating point numbers,
454 the real and imaginary part. To extract these parts from a complex
455 number
\var{z
}, use
\code{\var{z
}.real
} and
\code{\var{z
}.imag
}.
465 The conversion functions to floating point and integer
466 (
\function{float()
},
\function{int()
} and
\function{long()
}) don't
467 work for complex numbers --- there is no one correct way to convert a
468 complex number to a real number. Use
\code{abs(
\var{z
})
} to get its
469 magnitude (as a float) or
\code{z.real
} to get its real part.
474 Traceback (most recent call last):
475 File "<stdin>", line
1, in ?
476 TypeError: can't convert complex to float; use e.g. abs(z)
481 >>> abs(a) # sqrt(a.real**
2 + a.imag**
2)
486 In interactive mode, the last printed expression is assigned to the
487 variable
\code{_
}. This means that when you are using Python as a
488 desk calculator, it is somewhat easier to continue calculations, for
503 This variable should be treated as read-only by the user. Don't
504 explicitly assign a value to it --- you would create an independent
505 local variable with the same name masking the built-in variable with
508 \subsection{Strings
\label{strings
}}
510 Besides numbers, Python can also manipulate strings, which can be
511 expressed in several ways. They can be enclosed in single quotes or
521 >>> '"Yes," he said.'
523 >>> "\"Yes,\" he said."
525 >>> '"Isn\'t," she said.'
526 '"Isn\'t," she said.'
529 String literals can span multiple lines in several ways. Continuation
530 lines can be used, with a backslash as the last character on the line
531 indicating that the next line is a logical continuation of the line:
534 hello = "This is a rather long string containing
\n\
535 several lines of text just as you would do in C.
\n\
536 Note that whitespace at the beginning of the line is\
542 Note that newlines would still need to be embedded in the string using
543 \code{\e n
}; the newline following the trailing backslash is
544 discarded. This example would print the following:
547 This is a rather long string containing
548 several lines of text just as you would do in C.
549 Note that whitespace at the beginning of the line is significant.
552 If we make the string literal a ``raw'' string, however, the
553 \code{\e n
} sequences are not converted to newlines, but the backslash
554 at the end of the line, and the newline character in the source, are
555 both included in the string as data. Thus, the example:
558 hello = r"This is a rather long string containing
\n\
559 several lines of text much as you would do in C."
567 This is a rather long string containing
\n\
568 several lines of text much as you would do in C.
571 Or, strings can be surrounded in a pair of matching triple-quotes:
572 \code{"""
} or
\code{'
\code{'
}'
}. End of lines do not need to be escaped
573 when using triple-quotes, but they will be included in the string.
577 Usage: thingy
[OPTIONS
]
578 -h Display this usage message
579 -H hostname Hostname to connect to
583 produces the following output:
586 Usage: thingy
[OPTIONS
]
587 -h Display this usage message
588 -H hostname Hostname to connect to
591 The interpreter prints the result of string operations in the same way
592 as they are typed for input: inside quotes, and with quotes and other
593 funny characters escaped by backslashes, to show the precise
594 value. The string is enclosed in double quotes if the string contains
595 a single quote and no double quotes, else it's enclosed in single
596 quotes. (The
\keyword{print
} statement, described later, can be used
597 to write strings without quotes or escapes.)
599 Strings can be concatenated (glued together) with the
600 \code{+
} operator, and repeated with
\code{*
}:
603 >>> word = 'Help' + 'A'
606 >>> '<' + word*
5 + '>'
607 '<HelpAHelpAHelpAHelpAHelpA>'
610 Two string literals next to each other are automatically concatenated;
611 the first line above could also have been written
\samp{word = 'Help'
612 'A'
}; this only works with two literals, not with arbitrary string
617 >>> 'str' 'ing' # <- This is ok
619 >>> string.strip('str') + 'ing' # <- This is ok
621 >>> string.strip('str') 'ing' # <- This is invalid
622 File "<stdin>", line
1, in ?
623 string.strip('str') 'ing'
625 SyntaxError: invalid syntax
628 Strings can be subscripted (indexed); like in C, the first character
629 of a string has subscript (index)
0. There is no separate character
630 type; a character is simply a string of size one. Like in Icon,
631 substrings can be specified with the
\emph{slice notation
}: two indices
632 separated by a colon.
643 Unlike a C string, Python strings cannot be changed. Assigning to an
644 indexed position in the string results in an error:
648 Traceback (most recent call last):
649 File "<stdin>", line
1, in ?
650 TypeError: object doesn't support item assignment
651 >>> word
[:
1] = 'Splat'
652 Traceback (most recent call last):
653 File "<stdin>", line
1, in ?
654 TypeError: object doesn't support slice assignment
657 However, creating a new string with the combined content is easy and
663 >>> 'Splat' + word
[4]
667 Slice indices have useful defaults; an omitted first index defaults to
668 zero, an omitted second index defaults to the size of the string being
672 >>> word
[:
2] # The first two characters
674 >>> word
[2:
] # All but the first two characters
678 Here's a useful invariant of slice operations:
679 \code{s
[:i
] + s
[i:
]} equals
\code{s
}.
682 >>> word
[:
2] + word
[2:
]
684 >>> word
[:
3] + word
[3:
]
688 Degenerate slice indices are handled gracefully: an index that is too
689 large is replaced by the string size, an upper bound smaller than the
690 lower bound returns an empty string.
701 Indices may be negative numbers, to start counting from the right.
705 >>> word
[-
1] # The last character
707 >>> word
[-
2] # The last-but-one character
709 >>> word
[-
2:
] # The last two characters
711 >>> word
[:-
2] # All but the last two characters
715 But note that -
0 is really the same as
0, so it does not count from
719 >>> word
[-
0] # (since -
0 equals
0)
723 Out-of-range negative slice indices are truncated, but don't try this
724 for single-element (non-slice) indices:
729 >>> word
[-
10] # error
730 Traceback (most recent call last):
731 File "<stdin>", line
1, in ?
732 IndexError: string index out of range
735 The best way to remember how slices work is to think of the indices as
736 pointing
\emph{between
} characters, with the left edge of the first
737 character numbered
0. Then the right edge of the last character of a
738 string of
\var{n
} characters has index
\var{n
}, for example:
741 +---+---+---+---+---+
742 | H | e | l | p | A |
743 +---+---+---+---+---+
748 The first row of numbers gives the position of the indices
0..
.5 in
749 the string; the second row gives the corresponding negative indices.
750 The slice from
\var{i
} to
\var{j
} consists of all characters between
751 the edges labeled
\var{i
} and
\var{j
}, respectively.
753 For non-negative indices, the length of a slice is the difference of
754 the indices, if both are within bounds. For example, the length of
755 \code{word
[1:
3]} is
2.
757 The built-in function
\function{len()
} returns the length of a string:
760 >>> s = 'supercalifragilisticexpialidocious'
766 \subsection{Unicode Strings
\label{unicodeStrings
}}
767 \sectionauthor{Marc-Andre Lemburg
}{mal@lemburg.com
}
769 Starting with Python
2.0 a new data type for storing text data is
770 available to the programmer: the Unicode object. It can be used to
771 store and manipulate Unicode data (see
\url{http://www.unicode.org/
})
772 and integrates well with the existing string objects providing
773 auto-conversions where necessary.
775 Unicode has the advantage of providing one ordinal for every character
776 in every script used in modern and ancient texts. Previously, there
777 were only
256 possible ordinals for script characters and texts were
778 typically bound to a code page which mapped the ordinals to script
779 characters. This lead to very much confusion especially with respect
780 to internationalization (usually written as
\samp{i18n
} ---
781 \character{i
} +
18 characters +
\character{n
}) of software. Unicode
782 solves these problems by defining one code page for all scripts.
784 Creating Unicode strings in Python is just as simple as creating
792 The small
\character{u
} in front of the quote indicates that an
793 Unicode string is supposed to be created. If you want to include
794 special characters in the string, you can do so by using the Python
795 \emph{Unicode-Escape
} encoding. The following example shows how:
798 >>> u'Hello
\u0020World !'
802 The escape sequence
\code{\e u0020
} indicates to insert the Unicode
803 character with the ordinal value
0x0020 (the space character) at the
806 Other characters are interpreted by using their respective ordinal
807 values directly as Unicode ordinals. If you have literal strings
808 in the standard Latin-
1 encoding that is used in many Western countries,
809 you will find it convenient that the lower
256 characters
810 of Unicode are the same as the
256 characters of Latin-
1.
812 For experts, there is also a raw mode just like the one for normal
813 strings. You have to prefix the opening quote with 'ur' to have
814 Python use the
\emph{Raw-Unicode-Escape
} encoding. It will only apply
815 the above
\code{\e uXXXX
} conversion if there is an uneven number of
816 backslashes in front of the small 'u'.
819 >>> ur'Hello
\u0020World !'
821 >>> ur'Hello\
\u0020World !'
822 u'Hello\\\
\u0020World !'
825 The raw mode is most useful when you have to enter lots of
826 backslashes, as can be necessary in regular expressions.
828 Apart from these standard encodings, Python provides a whole set of
829 other ways of creating Unicode strings on the basis of a known
832 The built-in function
\function{unicode()
}\bifuncindex{unicode
} provides
833 access to all registered Unicode codecs (COders and DECoders). Some of
834 the more well known encodings which these codecs can convert are
835 \emph{Latin-
1},
\emph{ASCII
},
\emph{UTF-
8}, and
\emph{UTF-
16}.
836 The latter two are variable-length encodings that store each Unicode
837 character in one or more bytes. The default encoding is
838 normally set to ASCII, which passes through characters in the range
839 0 to
127 and rejects any other characters with an error.
840 When a Unicode string is printed, written to a file, or converted
841 with
\function{str()
}, conversion takes place using this default encoding.
851 Traceback (most recent call last):
852 File "<stdin>", line
1, in ?
853 UnicodeError: ASCII encoding error: ordinal not in range(
128)
856 To convert a Unicode string into an
8-bit string using a specific
857 encoding, Unicode objects provide an
\function{encode()
} method
858 that takes one argument, the name of the encoding. Lowercase names
859 for encodings are preferred.
862 >>> u"äöü".encode('utf-
8')
863 '
\xc3\xa4\xc3\xb6\xc3\xbc'
866 If you have data in a specific encoding and want to produce a
867 corresponding Unicode string from it, you can use the
868 \function{unicode()
} function with the encoding name as the second
872 >>> unicode('
\xc3\xa4\xc3\xb6\xc3\xbc', 'utf-
8')
876 \subsection{Lists
\label{lists
}}
878 Python knows a number of
\emph{compound
} data types, used to group
879 together other values. The most versatile is the
\emph{list
}, which
880 can be written as a list of comma-separated values (items) between
881 square brackets. List items need not all have the same type.
884 >>> a =
['spam', 'eggs',
100,
1234]
886 ['spam', 'eggs',
100,
1234]
889 Like string indices, list indices start at
0, and lists can be sliced,
890 concatenated and so on:
901 >>> a
[:
2] +
['bacon',
2*
2]
902 ['spam', 'eggs', 'bacon',
4]
903 >>>
3*a
[:
3] +
['Boe!'
]
904 ['spam', 'eggs',
100, 'spam', 'eggs',
100, 'spam', 'eggs',
100, 'Boe!'
]
907 Unlike strings, which are
\emph{immutable
}, it is possible to change
908 individual elements of a list:
912 ['spam', 'eggs',
100,
1234]
915 ['spam', 'eggs',
123,
1234]
918 Assignment to slices is also possible, and this can even change the size
922 >>> # Replace some items:
931 ... a
[1:
1] =
['bletch', 'xyzzy'
]
933 [123, 'bletch', 'xyzzy',
1234]
934 >>> a
[:
0] = a # Insert (a copy of) itself at the beginning
936 [123, 'bletch', 'xyzzy',
1234,
123, 'bletch', 'xyzzy',
1234]
939 The built-in function
\function{len()
} also applies to lists:
946 It is possible to nest lists (create lists containing other lists),
958 >>> p
[1].append('xtra') # See section
5.1
960 [1,
[2,
3, 'xtra'
],
4]
965 Note that in the last example,
\code{p
[1]} and
\code{q
} really refer to
966 the same object! We'll come back to
\emph{object semantics
} later.
968 \section{First Steps Towards Programming
\label{firstSteps
}}
970 Of course, we can use Python for more complicated tasks than adding
971 two and two together. For instance, we can write an initial
972 sub-sequence of the
\emph{Fibonacci
} series as follows:
975 >>> # Fibonacci series:
976 ... # the sum of two elements defines the next
990 This example introduces several new features.
995 The first line contains a
\emph{multiple assignment
}: the variables
996 \code{a
} and
\code{b
} simultaneously get the new values
0 and
1. On the
997 last line this is used again, demonstrating that the expressions on
998 the right-hand side are all evaluated first before any of the
999 assignments take place. The right-hand side expressions are evaluated
1000 from the left to the right.
1003 The
\keyword{while
} loop executes as long as the condition (here:
1004 \code{b <
10}) remains true. In Python, like in C, any non-zero
1005 integer value is true; zero is false. The condition may also be a
1006 string or list value, in fact any sequence; anything with a non-zero
1007 length is true, empty sequences are false. The test used in the
1008 example is a simple comparison. The standard comparison operators are
1009 written the same as in C:
\code{<
} (less than),
\code{>
} (greater than),
1010 \code{==
} (equal to),
\code{<=
} (less than or equal to),
1011 \code{>=
} (greater than or equal to) and
\code{!=
} (not equal to).
1014 The
\emph{body
} of the loop is
\emph{indented
}: indentation is Python's
1015 way of grouping statements. Python does not (yet!) provide an
1016 intelligent input line editing facility, so you have to type a tab or
1017 space(s) for each indented line. In practice you will prepare more
1018 complicated input for Python with a text editor; most text editors have
1019 an auto-indent facility. When a compound statement is entered
1020 interactively, it must be followed by a blank line to indicate
1021 completion (since the parser cannot guess when you have typed the last
1022 line). Note that each line within a basic block must be indented by
1026 The
\keyword{print
} statement writes the value of the expression(s) it is
1027 given. It differs from just writing the expression you want to write
1028 (as we did earlier in the calculator examples) in the way it handles
1029 multiple expressions and strings. Strings are printed without quotes,
1030 and a space is inserted between items, so you can format things nicely,
1035 >>> print 'The value of i is', i
1036 The value of i is
65536
1039 A trailing comma avoids the newline after the output:
1047 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987
1050 Note that the interpreter inserts a newline before it prints the next
1051 prompt if the last line was not completed.
1056 \chapter{More Control Flow Tools
\label{moreControl
}}
1058 Besides the
\keyword{while
} statement just introduced, Python knows
1059 the usual control flow statements known from other languages, with
1062 \section{\keyword{if
} Statements
\label{if
}}
1064 Perhaps the most well-known statement type is the
1065 \keyword{if
} statement. For example:
1068 >>> x = int(raw_input("Please enter an integer: "))
1071 ... print 'Negative changed to zero'
1081 There can be zero or more
\keyword{elif
} parts, and the
1082 \keyword{else
} part is optional. The keyword `
\keyword{elif
}' is
1083 short for `else if', and is useful to avoid excessive indentation. An
1084 \keyword{if
} \ldots\
\keyword{elif
} \ldots\
\keyword{elif
} \ldots\ sequence
1085 % Weird spacings happen here if the wrapping of the source text
1086 % gets changed in the wrong way.
1087 is a substitute for the
\keyword{switch
} or
1088 \keyword{case
} statements found in other languages.
1091 \section{\keyword{for
} Statements
\label{for
}}
1093 The
\keyword{for
}\stindex{for
} statement in Python differs a bit from
1094 what you may be used to in C or Pascal. Rather than always
1095 iterating over an arithmetic progression of numbers (like in Pascal),
1096 or giving the user the ability to define both the iteration step and
1097 halting condition (as C), Python's
1098 \keyword{for
}\stindex{for
} statement iterates over the items of any
1099 sequence (a list or a string), in the order that they appear in
1100 the sequence. For example (no pun intended):
1101 % One suggestion was to give a real C example here, but that may only
1102 % serve to confuse non-C programmers.
1105 >>> # Measure some strings:
1106 ... a =
['cat', 'window', 'defenestrate'
]
1115 It is not safe to modify the sequence being iterated over in the loop
1116 (this can only happen for mutable sequence types, such as lists). If
1117 you need to modify the list you are iterating over (for example, to
1118 duplicate selected items) you must iterate over a copy. The slice
1119 notation makes this particularly convenient:
1122 >>> for x in a
[:
]: # make a slice copy of the entire list
1123 ... if len(x) >
6: a.insert(
0, x)
1126 ['defenestrate', 'cat', 'window', 'defenestrate'
]
1130 \section{The
\function{range()
} Function
\label{range
}}
1132 If you do need to iterate over a sequence of numbers, the built-in
1133 function
\function{range()
} comes in handy. It generates lists
1134 containing arithmetic progressions:
1138 [0,
1,
2,
3,
4,
5,
6,
7,
8,
9]
1141 The given end point is never part of the generated list;
1142 \code{range(
10)
} generates a list of
10 values, exactly the legal
1143 indices for items of a sequence of length
10. It is possible to let
1144 the range start at another number, or to specify a different increment
1145 (even negative; sometimes this is called the `step'):
1152 >>> range(-
10, -
100, -
30)
1156 To iterate over the indices of a sequence, combine
1157 \function{range()
} and
\function{len()
} as follows:
1160 >>> a =
['Mary', 'had', 'a', 'little', 'lamb'
]
1161 >>> for i in range(len(a)):
1172 \section{\keyword{break
} and
\keyword{continue
} Statements, and
1173 \keyword{else
} Clauses on Loops
1176 The
\keyword{break
} statement, like in C, breaks out of the smallest
1177 enclosing
\keyword{for
} or
\keyword{while
} loop.
1179 The
\keyword{continue
} statement, also borrowed from C, continues
1180 with the next iteration of the loop.
1182 Loop statements may have an
\code{else
} clause; it is executed when
1183 the loop terminates through exhaustion of the list (with
1184 \keyword{for
}) or when the condition becomes false (with
1185 \keyword{while
}), but not when the loop is terminated by a
1186 \keyword{break
} statement. This is exemplified by the following loop,
1187 which searches for prime numbers:
1190 >>> for n in range(
2,
10):
1191 ... for x in range(
2, n):
1193 ... print n, 'equals', x, '*', n/x
1196 ... # loop fell through without finding a factor
1197 ... print n, 'is a prime number'
1210 \section{\keyword{pass
} Statements
\label{pass
}}
1212 The
\keyword{pass
} statement does nothing.
1213 It can be used when a statement is required syntactically but the
1214 program requires no action.
1219 ... pass # Busy-wait for keyboard interrupt
1224 \section{Defining Functions
\label{functions
}}
1226 We can create a function that writes the Fibonacci series to an
1230 >>> def fib(n): # write Fibonacci series up to n
1231 ... """Print a Fibonacci series up to n."""
1237 >>> # Now call the function we just defined:
1239 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597
1242 The keyword
\keyword{def
} introduces a function
\emph{definition
}. It
1243 must be followed by the function name and the parenthesized list of
1244 formal parameters. The statements that form the body of the function
1245 start at the next line, and must be indented. The first statement of
1246 the function body can optionally be a string literal; this string
1247 literal is the function's
\index{documentation strings
}documentation
1248 string, or
\dfn{docstring
}.
\index{docstrings
}\index{strings, documentation
}
1250 There are tools which use docstrings to automatically produce online
1251 or printed documentation, or to let the user interactively browse
1252 through code; it's good practice to include docstrings in code that
1253 you write, so try to make a habit of it.
1255 The
\emph{execution
} of a function introduces a new symbol table used
1256 for the local variables of the function. More precisely, all variable
1257 assignments in a function store the value in the local symbol table;
1258 whereas variable references first look in the local symbol table, then
1259 in the global symbol table, and then in the table of built-in names.
1260 Thus, global variables cannot be directly assigned a value within a
1261 function (unless named in a
\keyword{global
} statement), although
1262 they may be referenced.
1264 The actual parameters (arguments) to a function call are introduced in
1265 the local symbol table of the called function when it is called; thus,
1266 arguments are passed using
\emph{call by value
} (where the
1267 \emph{value
} is always an object
\emph{reference
}, not the value of
1268 the object).
\footnote{
1269 Actually,
\emph{call by object reference
} would be a better
1270 description, since if a mutable object is passed, the caller
1271 will see any changes the callee makes to it (items
1272 inserted into a list).
1273 } When a function calls another function, a new local symbol table is
1274 created for that call.
1276 A function definition introduces the function name in the current
1277 symbol table. The value of the function name
1278 has a type that is recognized by the interpreter as a user-defined
1279 function. This value can be assigned to another name which can then
1280 also be used as a function. This serves as a general renaming
1285 <function object at
10042ed0>
1288 1 1 2 3 5 8 13 21 34 55 89
1291 You might object that
\code{fib
} is not a function but a procedure. In
1292 Python, like in C, procedures are just functions that don't return a
1293 value. In fact, technically speaking, procedures do return a value,
1294 albeit a rather boring one. This value is called
\code{None
} (it's a
1295 built-in name). Writing the value
\code{None
} is normally suppressed by
1296 the interpreter if it would be the only value written. You can see it
1297 if you really want to:
1304 It is simple to write a function that returns a list of the numbers of
1305 the Fibonacci series, instead of printing it:
1308 >>> def fib2(n): # return Fibonacci series up to n
1309 ... """Return a list containing the Fibonacci series up to n."""
1313 ... result.append(b) # see below
1317 >>> f100 = fib2(
100) # call it
1318 >>> f100 # write the result
1319 [1,
1,
2,
3,
5,
8,
13,
21,
34,
55,
89]
1322 This example, as usual, demonstrates some new Python features:
1327 The
\keyword{return
} statement returns with a value from a function.
1328 \keyword{return
} without an expression argument returns
\code{None
}.
1329 Falling off the end of a procedure also returns
\code{None
}.
1332 The statement
\code{result.append(b)
} calls a
\emph{method
} of the list
1333 object
\code{result
}. A method is a function that `belongs' to an
1334 object and is named
\code{obj.methodname
}, where
\code{obj
} is some
1335 object (this may be an expression), and
\code{methodname
} is the name
1336 of a method that is defined by the object's type. Different types
1337 define different methods. Methods of different types may have the
1338 same name without causing ambiguity. (It is possible to define your
1339 own object types and methods, using
\emph{classes
}, as discussed later
1341 The method
\method{append()
} shown in the example, is defined for
1342 list objects; it adds a new element at the end of the list. In this
1343 example it is equivalent to
\samp{result = result +
[b
]}, but more
1348 \section{More on Defining Functions
\label{defining
}}
1350 It is also possible to define functions with a variable number of
1351 arguments. There are three forms, which can be combined.
1353 \subsection{Default Argument Values
\label{defaultArgs
}}
1355 The most useful form is to specify a default value for one or more
1356 arguments. This creates a function that can be called with fewer
1357 arguments than it is defined
1360 def ask_ok(prompt, retries=
4, complaint='Yes or no, please!'):
1362 ok = raw_input(prompt)
1363 if ok in ('y', 'ye', 'yes'): return
1
1364 if ok in ('n', 'no', 'nop', 'nope'): return
0
1365 retries = retries -
1
1366 if retries <
0: raise IOError, 'refusenik user'
1370 This function can be called either like this:
1371 \code{ask_ok('Do you really want to quit?')
} or like this:
1372 \code{ask_ok('OK to overwrite the file?',
2)
}.
1374 The default values are evaluated at the point of function definition
1375 in the
\emph{defining
} scope, so that
1387 will print
\code{5}.
1389 \strong{Important warning:
} The default value is evaluated only once.
1390 This makes a difference when the default is a mutable object such as a
1391 list or dictionary. For example, the following function accumulates
1392 the arguments passed to it on subsequent calls:
1412 If you don't want the default to be shared between subsequent calls,
1413 you can write the function like this instead:
1423 \subsection{Keyword Arguments
\label{keywordArgs
}}
1425 Functions can also be called using
1426 keyword arguments of the form
\samp{\var{keyword
} =
\var{value
}}. For
1427 instance, the following function:
1430 def parrot(voltage, state='a stiff', action='voom', type='Norwegian Blue'):
1431 print "-- This parrot wouldn't", action,
1432 print "if you put", voltage, "Volts through it."
1433 print "-- Lovely plumage, the", type
1434 print "-- It's", state, "!"
1437 could be called in any of the following ways:
1441 parrot(action = 'VOOOOOM', voltage =
1000000)
1442 parrot('a thousand', state = 'pushing up the daisies')
1443 parrot('a million', 'bereft of life', 'jump')
1446 but the following calls would all be invalid:
1449 parrot() # required argument missing
1450 parrot(voltage=
5.0, 'dead') # non-keyword argument following keyword
1451 parrot(
110, voltage=
220) # duplicate value for argument
1452 parrot(actor='John Cleese') # unknown keyword
1455 In general, an argument list must have any positional arguments
1456 followed by any keyword arguments, where the keywords must be chosen
1457 from the formal parameter names. It's not important whether a formal
1458 parameter has a default value or not. No argument may receive a
1459 value more than once --- formal parameter names corresponding to
1460 positional arguments cannot be used as keywords in the same calls.
1461 Here's an example that fails due to this restriction:
1464 >>> def function(a):
1467 >>> function(
0, a=
0)
1468 Traceback (most recent call last):
1469 File "<stdin>", line
1, in ?
1470 TypeError: keyword parameter redefined
1473 When a final formal parameter of the form
\code{**
\var{name
}} is
1474 present, it receives a dictionary containing all keyword arguments
1475 whose keyword doesn't correspond to a formal parameter. This may be
1476 combined with a formal parameter of the form
1477 \code{*
\var{name
}} (described in the next subsection) which receives a
1478 tuple containing the positional arguments beyond the formal parameter
1479 list. (
\code{*
\var{name
}} must occur before
\code{**
\var{name
}}.)
1480 For example, if we define a function like this:
1483 def cheeseshop(kind, *arguments, **keywords):
1484 print "-- Do you have any", kind, '?'
1485 print "-- I'm sorry, we're all out of", kind
1486 for arg in arguments: print arg
1488 keys = keywords.keys()
1490 for kw in keys: print kw, ':', keywords
[kw
]
1493 It could be called like this:
1496 cheeseshop('Limburger', "It's very runny, sir.",
1497 "It's really very, VERY runny, sir.",
1498 client='John Cleese',
1499 shopkeeper='Michael Palin',
1500 sketch='Cheese Shop Sketch')
1503 and of course it would print:
1506 -- Do you have any Limburger ?
1507 -- I'm sorry, we're all out of Limburger
1508 It's very runny, sir.
1509 It's really very, VERY runny, sir.
1510 ----------------------------------------
1511 client : John Cleese
1512 shopkeeper : Michael Palin
1513 sketch : Cheese Shop Sketch
1516 Note that the
\method{sort()
} method of the list of keyword argument
1517 names is called before printing the contents of the
\code{keywords
}
1518 dictionary; if this is not done, the order in which the arguments are
1519 printed is undefined.
1522 \subsection{Arbitrary Argument Lists
\label{arbitraryArgs
}}
1524 Finally, the least frequently used option is to specify that a
1525 function can be called with an arbitrary number of arguments. These
1526 arguments will be wrapped up in a tuple. Before the variable number
1527 of arguments, zero or more normal arguments may occur.
1530 def fprintf(file, format, *args):
1531 file.write(format
% args)
1535 \subsection{Lambda Forms
\label{lambda
}}
1537 By popular demand, a few features commonly found in functional
1538 programming languages and Lisp have been added to Python. With the
1539 \keyword{lambda
} keyword, small anonymous functions can be created.
1540 Here's a function that returns the sum of its two arguments:
1541 \samp{lambda a, b: a+b
}. Lambda forms can be used wherever function
1542 objects are required. They are syntactically restricted to a single
1543 expression. Semantically, they are just syntactic sugar for a normal
1544 function definition. Like nested function definitions, lambda forms
1545 can reference variables from the containing scope:
1548 >>> def make_incrementor(n):
1549 ... return lambda x: x + n
1551 >>> f = make_incrementor(
42)
1559 \subsection{Documentation Strings
\label{docstrings
}}
1561 There are emerging conventions about the content and formatting of
1562 documentation strings.
1563 \index{docstrings
}\index{documentation strings
}
1564 \index{strings, documentation
}
1566 The first line should always be a short, concise summary of the
1567 object's purpose. For brevity, it should not explicitly state the
1568 object's name or type, since these are available by other means
1569 (except if the name happens to be a verb describing a function's
1570 operation). This line should begin with a capital letter and end with
1573 If there are more lines in the documentation string, the second line
1574 should be blank, visually separating the summary from the rest of the
1575 description. The following lines should be one or more paragraphs
1576 describing the object's calling conventions, its side effects, etc.
1578 The Python parser does not strip indentation from multi-line string
1579 literals in Python, so tools that process documentation have to strip
1580 indentation if desired. This is done using the following convention.
1581 The first non-blank line
\emph{after
} the first line of the string
1582 determines the amount of indentation for the entire documentation
1583 string. (We can't use the first line since it is generally adjacent
1584 to the string's opening quotes so its indentation is not apparent in
1585 the string literal.) Whitespace ``equivalent'' to this indentation is
1586 then stripped from the start of all lines of the string. Lines that
1587 are indented less should not occur, but if they occur all their
1588 leading whitespace should be stripped. Equivalence of whitespace
1589 should be tested after expansion of tabs (to
8 spaces, normally).
1591 Here is an example of a multi-line docstring:
1594 >>> def my_function():
1595 ... """Do nothing, but
document it.
1597 ... No, really, it doesn't do anything.
1601 >>> print my_function.__doc__
1602 Do nothing, but
document it.
1604 No, really, it doesn't do anything.
1610 \chapter{Data Structures
\label{structures
}}
1612 This chapter describes some things you've learned about already in
1613 more detail, and adds some new things as well.
1616 \section{More on Lists
\label{moreLists
}}
1618 The list data type has some more methods. Here are all of the methods
1621 \begin{methoddesc
}[list
]{append
}{x
}
1622 Add an item to the end of the list;
1623 equivalent to
\code{a
[len(a):
] =
[\var{x
}]}.
1626 \begin{methoddesc
}[list
]{extend
}{L
}
1627 Extend the list by appending all the items in the given list;
1628 equivalent to
\code{a
[len(a):
] =
\var{L
}}.
1631 \begin{methoddesc
}[list
]{insert
}{i, x
}
1632 Insert an item at a given position. The first argument is the index
1633 of the element before which to insert, so
\code{a.insert(
0,
\var{x
})
}
1634 inserts at the front of the list, and
\code{a.insert(len(a),
\var{x
})
}
1635 is equivalent to
\code{a.append(
\var{x
})
}.
1638 \begin{methoddesc
}[list
]{remove
}{x
}
1639 Remove the first item from the list whose value is
\var{x
}.
1640 It is an error if there is no such item.
1643 \begin{methoddesc
}[list
]{pop
}{\optional{i
}}
1644 Remove the item at the given position in the list, and return it. If
1645 no index is specified,
\code{a.pop()
} returns the last item in the
1646 list. The item is also removed from the list. (The square brackets
1647 around the
\var{i
} in the method signature denote that the parameter
1648 is optional, not that you should type square brackets at that
1649 position. You will see this notation frequently in the
1650 \citetitle[../lib/lib.html
]{Python Library Reference
}.)
1653 \begin{methoddesc
}[list
]{index
}{x
}
1654 Return the index in the list of the first item whose value is
\var{x
}.
1655 It is an error if there is no such item.
1658 \begin{methoddesc
}[list
]{count
}{x
}
1659 Return the number of times
\var{x
} appears in the list.
1662 \begin{methoddesc
}[list
]{sort
}{}
1663 Sort the items of the list, in place.
1666 \begin{methoddesc
}[list
]{reverse
}{}
1667 Reverse the elements of the list, in place.
1670 An example that uses most of the list methods:
1673 >>> a =
[66.6,
333,
333,
1,
1234.5]
1674 >>> print a.count(
333), a.count(
66.6), a.count('x')
1679 [66.6,
333, -
1,
333,
1,
1234.5,
333]
1684 [66.6, -
1,
333,
1,
1234.5,
333]
1687 [333,
1234.5,
1,
333, -
1,
66.6]
1690 [-
1,
1,
66.6,
333,
333,
1234.5]
1694 \subsection{Using Lists as Stacks
\label{lists-as-stacks
}}
1695 \sectionauthor{Ka-Ping Yee
}{ping@lfw.org
}
1697 The list methods make it very easy to use a list as a stack, where the
1698 last element added is the first element retrieved (``last-in,
1699 first-out''). To add an item to the top of the stack, use
1700 \method{append()
}. To retrieve an item from the top of the stack, use
1701 \method{pop()
} without an explicit index. For example:
1704 >>> stack =
[3,
4,
5]
1722 \subsection{Using Lists as Queues
\label{lists-as-queues
}}
1723 \sectionauthor{Ka-Ping Yee
}{ping@lfw.org
}
1725 You can also use a list conveniently as a queue, where the first
1726 element added is the first element retrieved (``first-in,
1727 first-out''). To add an item to the back of the queue, use
1728 \method{append()
}. To retrieve an item from the front of the queue,
1729 use
\method{pop()
} with
\code{0} as the index. For example:
1732 >>> queue =
["Eric", "John", "Michael"
]
1733 >>> queue.append("Terry") # Terry arrives
1734 >>> queue.append("Graham") # Graham arrives
1740 ['Michael', 'Terry', 'Graham'
]
1744 \subsection{Functional Programming Tools
\label{functional
}}
1746 There are three built-in functions that are very useful when used with
1747 lists:
\function{filter()
},
\function{map()
}, and
\function{reduce()
}.
1749 \samp{filter(
\var{function
},
\var{sequence
})
} returns a sequence (of
1750 the same type, if possible) consisting of those items from the
1751 sequence for which
\code{\var{function
}(
\var{item
})
} is true. For
1752 example, to compute some primes:
1755 >>> def f(x): return x
% 2 != 0 and x % 3 != 0
1757 >>> filter(f, range(
2,
25))
1758 [5,
7,
11,
13,
17,
19,
23]
1761 \samp{map(
\var{function
},
\var{sequence
})
} calls
1762 \code{\var{function
}(
\var{item
})
} for each of the sequence's items and
1763 returns a list of the return values. For example, to compute some
1767 >>> def cube(x): return x*x*x
1769 >>> map(cube, range(
1,
11))
1770 [1,
8,
27,
64,
125,
216,
343,
512,
729,
1000]
1773 More than one sequence may be passed; the function must then have as
1774 many arguments as there are sequences and is called with the
1775 corresponding item from each sequence (or
\code{None
} if some sequence
1776 is shorter than another). If
\code{None
} is passed for the function,
1777 a function returning its argument(s) is substituted.
1779 Combining these two special cases, we see that
1780 \samp{map(None,
\var{list1
},
\var{list2
})
} is a convenient way of
1781 turning a pair of lists into a list of pairs. For example:
1785 >>> def square(x): return x*x
1787 >>> map(None, seq, map(square, seq))
1788 [(
0,
0), (
1,
1), (
2,
4), (
3,
9), (
4,
16), (
5,
25), (
6,
36), (
7,
49)
]
1791 \samp{reduce(
\var{func
},
\var{sequence
})
} returns a single value
1792 constructed by calling the binary function
\var{func
} on the first two
1793 items of the sequence, then on the result and the next item, and so
1794 on. For example, to compute the sum of the numbers
1 through
10:
1797 >>> def add(x,y): return x+y
1799 >>> reduce(add, range(
1,
11))
1803 If there's only one item in the sequence, its value is returned; if
1804 the sequence is empty, an exception is raised.
1806 A third argument can be passed to indicate the starting value. In this
1807 case the starting value is returned for an empty sequence, and the
1808 function is first applied to the starting value and the first sequence
1809 item, then to the result and the next item, and so on. For example,
1813 ... def add(x,y): return x+y
1814 ... return reduce(add, seq,
0)
1816 >>> sum(range(
1,
11))
1823 \subsection{List Comprehensions
}
1825 List comprehensions provide a concise way to create lists without resorting
1826 to use of
\function{map()
},
\function{filter()
} and/or
\keyword{lambda
}.
1827 The resulting list definition tends often to be clearer than lists built
1828 using those constructs. Each list comprehension consists of an expression
1829 followed by a
\keyword{for
} clause, then zero or more
\keyword{for
} or
1830 \keyword{if
} clauses. The result will be a list resulting from evaluating
1831 the expression in the context of the
\keyword{for
} and
\keyword{if
} clauses
1832 which follow it. If the expression would evaluate to a tuple, it must be
1836 >>> freshfruit =
[' banana', ' loganberry ', 'passion fruit '
]
1837 >>>
[weapon.strip() for weapon in freshfruit
]
1838 ['banana', 'loganberry', 'passion fruit'
]
1840 >>>
[3*x for x in vec
]
1842 >>>
[3*x for x in vec if x >
3]
1844 >>>
[3*x for x in vec if x <
2]
1846 >>>
[[x,x**
2] for x in vec
]
1847 [[2,
4],
[4,
16],
[6,
36]]
1848 >>>
[x, x**
2 for x in vec
] # error - parens required for tuples
1849 File "<stdin>", line
1, in ?
1850 [x, x**
2 for x in vec
]
1852 SyntaxError: invalid syntax
1853 >>>
[(x, x**
2) for x in vec
]
1854 [(
2,
4), (
4,
16), (
6,
36)
]
1855 >>> vec1 =
[2,
4,
6]
1856 >>> vec2 =
[4,
3, -
9]
1857 >>>
[x*y for x in vec1 for y in vec2
]
1858 [8,
6, -
18,
16,
12, -
36,
24,
18, -
54]
1859 >>>
[x+y for x in vec1 for y in vec2
]
1860 [6,
5, -
7,
8,
7, -
5,
10,
9, -
3]
1861 >>>
[vec1
[i
]*vec2
[i
] for i in range(len(vec1))
]
1866 \section{The
\keyword{del
} statement
\label{del
}}
1868 There is a way to remove an item from a list given its index instead
1869 of its value: the
\keyword{del
} statement. This can also be used to
1870 remove slices from a list (which we did earlier by assignment of an
1871 empty list to the slice). For example:
1875 [-
1,
1,
66.6,
333,
333,
1234.5]
1878 [1,
66.6,
333,
333,
1234.5]
1884 \keyword{del
} can also be used to delete entire variables:
1890 Referencing the name
\code{a
} hereafter is an error (at least until
1891 another value is assigned to it). We'll find other uses for
1892 \keyword{del
} later.
1895 \section{Tuples and Sequences
\label{tuples
}}
1897 We saw that lists and strings have many common properties, such as
1898 indexing and slicing operations. They are two examples of
1899 \emph{sequence
} data types. Since Python is an evolving language,
1900 other sequence data types may be added. There is also another
1901 standard sequence data type: the
\emph{tuple
}.
1903 A tuple consists of a number of values separated by commas, for
1907 >>> t =
12345,
54321, 'hello!'
1911 (
12345,
54321, 'hello!')
1912 >>> # Tuples may be nested:
1913 ... u = t, (
1,
2,
3,
4,
5)
1915 ((
12345,
54321, 'hello!'), (
1,
2,
3,
4,
5))
1918 As you see, on output tuples are alway enclosed in parentheses, so
1919 that nested tuples are interpreted correctly; they may be input with
1920 or without surrounding parentheses, although often parentheses are
1921 necessary anyway (if the tuple is part of a larger expression).
1923 Tuples have many uses. For example: (x, y) coordinate pairs, employee
1924 records from a database, etc. Tuples, like strings, are immutable: it
1925 is not possible to assign to the individual items of a tuple (you can
1926 simulate much of the same effect with slicing and concatenation,
1927 though). It is also possible to create tuples which contain mutable
1928 objects, such as lists.
1930 A special problem is the construction of tuples containing
0 or
1
1931 items: the syntax has some extra quirks to accommodate these. Empty
1932 tuples are constructed by an empty pair of parentheses; a tuple with
1933 one item is constructed by following a value with a comma
1934 (it is not sufficient to enclose a single value in parentheses).
1935 Ugly, but effective. For example:
1939 >>> singleton = 'hello', # <-- note trailing comma
1948 The statement
\code{t =
12345,
54321, 'hello!'
} is an example of
1949 \emph{tuple packing
}: the values
\code{12345},
\code{54321} and
1950 \code{'hello!'
} are packed together in a tuple. The reverse operation
1957 This is called, appropriately enough,
\emph{sequence unpacking
}.
1958 Sequence unpacking requires that the list of variables on the left
1959 have the same number of elements as the length of the sequence. Note
1960 that multiple assignment is really just a combination of tuple packing
1961 and sequence unpacking!
1963 There is a small bit of asymmetry here: packing multiple values
1964 always creates a tuple, and unpacking works for any sequence.
1966 % XXX Add a bit on the difference between tuples and lists.
1969 \section{Dictionaries
\label{dictionaries
}}
1971 Another useful data type built into Python is the
\emph{dictionary
}.
1972 Dictionaries are sometimes found in other languages as ``associative
1973 memories'' or ``associative arrays''. Unlike sequences, which are
1974 indexed by a range of numbers, dictionaries are indexed by
\emph{keys
},
1975 which can be any immutable type; strings and numbers can always be
1976 keys. Tuples can be used as keys if they contain only strings,
1977 numbers, or tuples; if a tuple contains any mutable object either
1978 directly or indirectly, it cannot be used as a key. You can't use
1979 lists as keys, since lists can be modified in place using their
1980 \method{append()
} and
\method{extend()
} methods, as well as slice and
1981 indexed assignments.
1983 It is best to think of a dictionary as an unordered set of
1984 \emph{key: value
} pairs, with the requirement that the keys are unique
1985 (within one dictionary).
1986 A pair of braces creates an empty dictionary:
\code{\
{\
}}.
1987 Placing a comma-separated list of key:value pairs within the
1988 braces adds initial key:value pairs to the dictionary; this is also the
1989 way dictionaries are written on output.
1991 The main operations on a dictionary are storing a value with some key
1992 and extracting the value given the key. It is also possible to delete
1995 If you store using a key that is already in use, the old value
1996 associated with that key is forgotten. It is an error to extract a
1997 value using a non-existent key.
1999 The
\code{keys()
} method of a dictionary object returns a list of all
2000 the keys used in the dictionary, in random order (if you want it
2001 sorted, just apply the
\code{sort()
} method to the list of keys). To
2002 check whether a single key is in the dictionary, use the
2003 \code{has_key()
} method of the dictionary.
2005 Here is a small example using a dictionary:
2008 >>> tel =
{'jack':
4098, 'sape':
4139}
2009 >>> tel
['guido'
] =
4127
2011 {'sape':
4139, 'guido':
4127, 'jack':
4098}
2015 >>> tel
['irv'
] =
4127
2017 {'guido':
4127, 'irv':
4127, 'jack':
4098}
2019 ['guido', 'irv', 'jack'
]
2020 >>> tel.has_key('guido')
2024 The
\function{dict()
} contructor builds dictionaries directly from
2025 lists of key-value pairs stored as tuples. When the pairs form a
2026 pattern, list comprehensions can compactly specify the key-value list.
2029 >>> dict(
[('sape',
4139), ('guido',
4127), ('jack',
4098)
])
2030 {'sape':
4139, 'jack':
4098, 'guido':
4127}
2031 >>> dict(
[(x, x**
2) for x in vec
]) # use a list comprehension
2032 {2:
4,
4:
16,
6:
36}
2036 \section{Looping Techniques
\label{loopidioms
}}
2038 When looping through dictionaries, the key and corresponding value can
2039 be retrieved at the same time using the
\method{items()
} method.
2042 >>> knights =
{'gallahad': 'the pure', 'robin': 'the brave'
}
2043 >>> for k, v in knights.items():
2050 When looping through a sequence, the position index and corresponding
2051 value can be retrieved at the same time using the
2052 \function{enumerate()
} function.
2055 >>> for i, v in enumerate(
['tic', 'tac', 'toe'
]):
2063 To loop over two or more sequences at the same time, the entries
2064 can be paired with the
\function{zip()
} function.
2067 >>> questions =
['name', 'quest', 'favorite
color'
]
2068 >>> answers =
['lancelot', 'the holy grail', 'blue'
]
2069 >>> for q, a in zip(questions, answers):
2070 ... print 'What is your
%s? It is %s.' % (q, a)
2072 What is your name? It is lancelot.
2073 What is your quest? It is the holy grail.
2074 What is your favorite
color? It is blue.
2078 \section{More on Conditions
\label{conditions
}}
2080 The conditions used in
\code{while
} and
\code{if
} statements above can
2081 contain other operators besides comparisons.
2083 The comparison operators
\code{in
} and
\code{not in
} check whether a value
2084 occurs (does not occur) in a sequence. The operators
\code{is
} and
2085 \code{is not
} compare whether two objects are really the same object; this
2086 only matters for mutable objects like lists. All comparison operators
2087 have the same priority, which is lower than that of all numerical
2090 Comparisons can be chained. For example,
\code{a < b == c
} tests
2091 whether
\code{a
} is less than
\code{b
} and moreover
\code{b
} equals
2094 Comparisons may be combined by the Boolean operators
\code{and
} and
2095 \code{or
}, and the outcome of a comparison (or of any other Boolean
2096 expression) may be negated with
\code{not
}. These all have lower
2097 priorities than comparison operators again; between them,
\code{not
} has
2098 the highest priority, and
\code{or
} the lowest, so that
2099 \code{A and not B or C
} is equivalent to
\code{(A and (not B)) or C
}. Of
2100 course, parentheses can be used to express the desired composition.
2102 The Boolean operators
\code{and
} and
\code{or
} are so-called
2103 \emph{short-circuit
} operators: their arguments are evaluated from
2104 left to right, and evaluation stops as soon as the outcome is
2105 determined. For example, if
\code{A
} and
\code{C
} are true but
2106 \code{B
} is false,
\code{A and B and C
} does not evaluate the
2107 expression
\code{C
}. In general, the return value of a short-circuit
2108 operator, when used as a general value and not as a Boolean, is the
2109 last evaluated argument.
2111 It is possible to assign the result of a comparison or other Boolean
2112 expression to a variable. For example,
2115 >>> string1, string2, string3 = '', 'Trondheim', 'Hammer Dance'
2116 >>> non_null = string1 or string2 or string3
2121 Note that in Python, unlike C, assignment cannot occur inside expressions.
2122 C programmers may grumble about this, but it avoids a common class of
2123 problems encountered in C programs: typing
\code{=
} in an expression when
2124 \code{==
} was intended.
2127 \section{Comparing Sequences and Other Types
\label{comparing
}}
2129 Sequence objects may be compared to other objects with the same
2130 sequence type. The comparison uses
\emph{lexicographical
} ordering:
2131 first the first two items are compared, and if they differ this
2132 determines the outcome of the comparison; if they are equal, the next
2133 two items are compared, and so on, until either sequence is exhausted.
2134 If two items to be compared are themselves sequences of the same type,
2135 the lexicographical comparison is carried out recursively. If all
2136 items of two sequences compare equal, the sequences are considered
2137 equal. If one sequence is an initial sub-sequence of the other, the
2138 shorter sequence is the smaller (lesser) one. Lexicographical
2139 ordering for strings uses the
\ASCII{} ordering for individual
2140 characters. Some examples of comparisons between sequences with the
2144 (
1,
2,
3) < (
1,
2,
4)
2145 [1,
2,
3] <
[1,
2,
4]
2146 'ABC' < 'C' < 'Pascal' < 'Python'
2147 (
1,
2,
3,
4) < (
1,
2,
4)
2149 (
1,
2,
3) == (
1.0,
2.0,
3.0)
2150 (
1,
2, ('aa', 'ab')) < (
1,
2, ('abc', 'a'),
4)
2153 Note that comparing objects of different types is legal. The outcome
2154 is deterministic but arbitrary: the types are ordered by their name.
2155 Thus, a list is always smaller than a string, a string is always
2156 smaller than a tuple, etc. Mixed numeric types are compared according
2157 to their numeric value, so
0 equals
0.0, etc.
\footnote{
2158 The rules for comparing objects of different types should
2159 not be relied upon; they may change in a future version of
2164 \chapter{Modules
\label{modules
}}
2166 If you quit from the Python interpreter and enter it again, the
2167 definitions you have made (functions and variables) are lost.
2168 Therefore, if you want to write a somewhat longer program, you are
2169 better off using a text editor to prepare the input for the interpreter
2170 and running it with that file as input instead. This is known as creating a
2171 \emph{script
}. As your program gets longer, you may want to split it
2172 into several files for easier maintenance. You may also want to use a
2173 handy function that you've written in several programs without copying
2174 its definition into each program.
2176 To support this, Python has a way to put definitions in a file and use
2177 them in a script or in an interactive instance of the interpreter.
2178 Such a file is called a
\emph{module
}; definitions from a module can be
2179 \emph{imported
} into other modules or into the
\emph{main
} module (the
2180 collection of variables that you have access to in a script
2181 executed at the top level
2182 and in calculator mode).
2184 A module is a file containing Python definitions and statements. The
2185 file name is the module name with the suffix
\file{.py
} appended. Within
2186 a module, the module's name (as a string) is available as the value of
2187 the global variable
\code{__name__
}. For instance, use your favorite text
2188 editor to create a file called
\file{fibo.py
} in the current directory
2189 with the following contents:
2192 # Fibonacci numbers module
2194 def fib(n): # write Fibonacci series up to n
2200 def fib2(n): # return Fibonacci series up to n
2209 Now enter the Python interpreter and import this module with the
2216 This does not enter the names of the functions defined in
\code{fibo
}
2217 directly in the current symbol table; it only enters the module name
2219 Using the module name you can access the functions:
2223 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987
2225 [1,
1,
2,
3,
5,
8,
13,
21,
34,
55,
89]
2230 If you intend to use a function often you can assign it to a local name:
2235 1 1 2 3 5 8 13 21 34 55 89 144 233 377
2239 \section{More on Modules
\label{moreModules
}}
2241 A module can contain executable statements as well as function
2243 These statements are intended to initialize the module.
2244 They are executed only the
2245 \emph{first
} time the module is imported somewhere.
\footnote{
2246 In fact function definitions are also `statements' that are
2247 `executed'; the execution enters the function name in the
2248 module's global symbol table.
2251 Each module has its own private symbol table, which is used as the
2252 global symbol table by all functions defined in the module.
2253 Thus, the author of a module can use global variables in the module
2254 without worrying about accidental clashes with a user's global
2256 On the other hand, if you know what you are doing you can touch a
2257 module's global variables with the same notation used to refer to its
2259 \code{modname.itemname
}.
2261 Modules can import other modules. It is customary but not required to
2262 place all
\keyword{import
} statements at the beginning of a module (or
2263 script, for that matter). The imported module names are placed in the
2264 importing module's global symbol table.
2266 There is a variant of the
\keyword{import
} statement that imports
2267 names from a module directly into the importing module's symbol
2271 >>> from fibo import fib, fib2
2273 1 1 2 3 5 8 13 21 34 55 89 144 233 377
2276 This does not introduce the module name from which the imports are taken
2277 in the local symbol table (so in the example,
\code{fibo
} is not
2280 There is even a variant to import all names that a module defines:
2283 >>> from fibo import *
2285 1 1 2 3 5 8 13 21 34 55 89 144 233 377
2288 This imports all names except those beginning with an underscore
2292 \subsection{The Module Search Path
\label{searchPath
}}
2294 \indexiii{module
}{search
}{path
}
2295 When a module named
\module{spam
} is imported, the interpreter searches
2296 for a file named
\file{spam.py
} in the current directory,
2297 and then in the list of directories specified by
2298 the environment variable
\envvar{PYTHONPATH
}. This has the same syntax as
2299 the shell variable
\envvar{PATH
}, that is, a list of
2300 directory names. When
\envvar{PYTHONPATH
} is not set, or when the file
2301 is not found there, the search continues in an installation-dependent
2302 default path; on
\UNIX, this is usually
\file{.:/usr/local/lib/python
}.
2304 Actually, modules are searched in the list of directories given by the
2305 variable
\code{sys.path
} which is initialized from the directory
2306 containing the input script (or the current directory),
2307 \envvar{PYTHONPATH
} and the installation-dependent default. This allows
2308 Python programs that know what they're doing to modify or replace the
2309 module search path. Note that because the directory containing the
2310 script being run is on the search path, it is important that the
2311 script not have the same name as a standard module, or Python will
2312 attempt to load the script as a module when that module is imported.
2313 This will generally be an error. See section~
\ref{standardModules
},
2314 ``Standard Modules.'' for more information.
2317 \subsection{``Compiled'' Python files
}
2319 As an important speed-up of the start-up time for short programs that
2320 use a lot of standard modules, if a file called
\file{spam.pyc
} exists
2321 in the directory where
\file{spam.py
} is found, this is assumed to
2322 contain an already-``byte-compiled'' version of the module
\module{spam
}.
2323 The modification time of the version of
\file{spam.py
} used to create
2324 \file{spam.pyc
} is recorded in
\file{spam.pyc
}, and the
2325 \file{.pyc
} file is ignored if these don't match.
2327 Normally, you don't need to do anything to create the
2328 \file{spam.pyc
} file. Whenever
\file{spam.py
} is successfully
2329 compiled, an attempt is made to write the compiled version to
2330 \file{spam.pyc
}. It is not an error if this attempt fails; if for any
2331 reason the file is not written completely, the resulting
2332 \file{spam.pyc
} file will be recognized as invalid and thus ignored
2333 later. The contents of the
\file{spam.pyc
} file are platform
2334 independent, so a Python module directory can be shared by machines of
2335 different architectures.
2337 Some tips for experts:
2342 When the Python interpreter is invoked with the
\programopt{-O
} flag,
2343 optimized code is generated and stored in
\file{.pyo
} files.
2344 The optimizer currently doesn't help much; it only removes
2345 \keyword{assert
} statements and
\code{SET_LINENO
} instructions.
2346 When
\programopt{-O
} is used,
\emph{all
} bytecode is optimized;
2347 \code{.pyc
} files are ignored and
\code{.py
} files are compiled to
2351 Passing two
\programopt{-O
} flags to the Python interpreter
2352 (
\programopt{-OO
}) will cause the bytecode compiler to perform
2353 optimizations that could in some rare cases result in malfunctioning
2354 programs. Currently only
\code{__doc__
} strings are removed from the
2355 bytecode, resulting in more compact
\file{.pyo
} files. Since some
2356 programs may rely on having these available, you should only use this
2357 option if you know what you're doing.
2360 A program doesn't run any faster when it is read from a
\file{.pyc
} or
2361 \file{.pyo
} file than when it is read from a
\file{.py
} file; the only
2362 thing that's faster about
\file{.pyc
} or
\file{.pyo
} files is the
2363 speed with which they are loaded.
2366 When a script is run by giving its name on the command line, the
2367 bytecode for the script is never written to a
\file{.pyc
} or
2368 \file{.pyo
} file. Thus, the startup time of a script may be reduced
2369 by moving most of its code to a module and having a small bootstrap
2370 script that imports that module. It is also possible to name a
2371 \file{.pyc
} or
\file{.pyo
} file directly on the command line.
2374 It is possible to have a file called
\file{spam.pyc
} (or
2375 \file{spam.pyo
} when
\programopt{-O
} is used) without a file
2376 \file{spam.py
} for the same module. This can be used to distribute a
2377 library of Python code in a form that is moderately hard to reverse
2381 The module
\module{compileall
}\refstmodindex{compileall
} can create
2382 \file{.pyc
} files (or
\file{.pyo
} files when
\programopt{-O
} is used) for
2383 all modules in a directory.
2388 \section{Standard Modules
\label{standardModules
}}
2390 Python comes with a library of standard modules, described in a separate
2391 document, the
\citetitle[../lib/lib.html
]{Python Library Reference
}
2392 (``Library Reference'' hereafter). Some modules are built into the
2393 interpreter; these provide access to operations that are not part of
2394 the core of the language but are nevertheless built in, either for
2395 efficiency or to provide access to operating system primitives such as
2396 system calls. The set of such modules is a configuration option which
2397 also dependson the underlying platform For example,
2398 the
\module{amoeba
} module is only provided on systems that somehow
2399 support Amoeba primitives. One particular module deserves some
2400 attention:
\module{sys
}\refstmodindex{sys
}, which is built into every
2401 Python interpreter. The variables
\code{sys.ps1
} and
2402 \code{sys.ps2
} define the strings used as primary and secondary
2417 These two variables are only defined if the interpreter is in
2420 The variable
\code{sys.path
} is a list of strings that determine the
2421 interpreter's search path for modules. It is initialized to a default
2422 path taken from the environment variable
\envvar{PYTHONPATH
}, or from
2423 a built-in default if
\envvar{PYTHONPATH
} is not set. You can modify
2424 it using standard list operations:
2428 >>> sys.path.append('/ufs/guido/lib/python')
2431 \section{The
\function{dir()
} Function
\label{dir
}}
2433 The built-in function
\function{dir()
} is used to find out which names
2434 a module defines. It returns a sorted list of strings:
2437 >>> import fibo, sys
2439 ['__name__', 'fib', 'fib2'
]
2441 ['__displayhook__', '__doc__', '__excepthook__', '__name__', '__stderr__',
2442 '__stdin__', '__stdout__', '_getframe', 'argv', 'builtin_module_names',
2443 'byteorder', 'copyright', 'displayhook', 'exc_info', 'exc_type',
2444 'excepthook', 'exec_prefix', 'executable', 'exit', 'getdefaultencoding',
2445 'getdlopenflags', 'getrecursionlimit', 'getrefcount', 'hexversion',
2446 'maxint', 'maxunicode', 'modules', 'path', 'platform', 'prefix', 'ps1',
2447 'ps2', 'setcheckinterval', 'setdlopenflags', 'setprofile',
2448 'setrecursionlimit', 'settrace', 'stderr', 'stdin', 'stdout', 'version',
2449 'version_info', 'warnoptions'
]
2452 Without arguments,
\function{dir()
} lists the names you have defined
2456 >>> a =
[1,
2,
3,
4,
5]
2457 >>> import fibo, sys
2460 ['__name__', 'a', 'fib', 'fibo', 'sys'
]
2463 Note that it lists all types of names: variables, modules, functions, etc.
2465 \function{dir()
} does not list the names of built-in functions and
2466 variables. If you want a list of those, they are defined in the
2467 standard module
\module{__builtin__
}\refbimodindex{__builtin__
}:
2470 >>> import __builtin__
2471 >>> dir(__builtin__)
2472 ['ArithmeticError', 'AssertionError', 'AttributeError',
2473 'DeprecationWarning', 'EOFError', 'Ellipsis', 'EnvironmentError',
2474 'Exception', 'False', 'FloatingPointError', 'IOError', 'ImportError',
2475 'IndentationError', 'IndexError', 'KeyError', 'KeyboardInterrupt',
2476 'LookupError', 'MemoryError', 'NameError', 'None', 'NotImplemented',
2477 'NotImplementedError', 'OSError', 'OverflowError', 'OverflowWarning',
2478 'PendingDeprecationWarning', 'ReferenceError',
2479 'RuntimeError', 'RuntimeWarning', 'StandardError', 'StopIteration',
2480 'SyntaxError', 'SyntaxWarning', 'SystemError', 'SystemExit', 'TabError',
2481 'True', 'TypeError', 'UnboundLocalError', 'UnicodeError', 'UserWarning',
2482 'ValueError', 'Warning', 'ZeroDivisionError', '__debug__', '__doc__',
2483 '__import__', '__name__', 'abs', 'apply', 'bool', 'buffer',
2484 'callable', 'chr', 'classmethod', 'cmp', 'coerce', 'compile', 'complex',
2485 'copyright', 'credits', 'delattr', 'dict', 'dir', 'divmod',
2486 'enumerate', 'eval', 'execfile', 'exit', 'file', 'filter', 'float',
2487 'getattr', 'globals', 'hasattr', 'hash', 'help', 'hex', 'id',
2488 'input', 'int', 'intern', 'isinstance', 'issubclass', 'iter',
2489 'len', 'license', 'list', 'locals', 'long', 'map', 'max', 'min',
2490 'object', 'oct', 'open', 'ord', 'pow', 'property', 'quit',
2491 'range', 'raw_input', 'reduce', 'reload', 'repr', 'round',
2492 'setattr', 'slice', 'staticmethod', 'str', 'string', 'super',
2493 'tuple', 'type', 'unichr', 'unicode', 'vars', 'xrange', 'zip'
]
2497 \section{Packages
\label{packages
}}
2499 Packages are a way of structuring Python's module namespace
2500 by using ``dotted module names''. For example, the module name
2501 \module{A.B
} designates a submodule named
\samp{B
} in a package named
2502 \samp{A
}. Just like the use of modules saves the authors of different
2503 modules from having to worry about each other's global variable names,
2504 the use of dotted module names saves the authors of multi-module
2505 packages like NumPy or the Python Imaging Library from having to worry
2506 about each other's module names.
2508 Suppose you want to design a collection of modules (a ``package'') for
2509 the uniform handling of sound files and sound data. There are many
2510 different sound file formats (usually recognized by their extension,
2511 for example:
\file{.wav
},
\file{.aiff
},
\file{.au
}), so you may need
2512 to create and maintain a growing collection of modules for the
2513 conversion between the various file formats. There are also many
2514 different operations you might want to perform on sound data (such as
2515 mixing, adding echo, applying an equalizer function, creating an
2516 artificial stereo effect), so in addition you will be writing a
2517 never-ending stream of modules to perform these operations. Here's a
2518 possible structure for your package (expressed in terms of a
2519 hierarchical filesystem):
2522 Sound/ Top-level package
2523 __init__.py Initialize the sound package
2524 Formats/ Subpackage for file format conversions
2533 Effects/ Subpackage for sound effects
2539 Filters/ Subpackage for filters
2547 The
\file{__init__.py
} files are required to make Python treat the
2548 directories as containing packages; this is done to prevent
2549 directories with a common name, such as
\samp{string
}, from
2550 unintentionally hiding valid modules that occur later on the module
2551 search path. In the simplest case,
\file{__init__.py
} can just be an
2552 empty file, but it can also execute initialization code for the
2553 package or set the
\code{__all__
} variable, described later.
2555 Users of the package can import individual modules from the
2556 package, for example:
2559 import Sound.Effects.echo
2562 This loads the submodule
\module{Sound.Effects.echo
}. It must be referenced
2566 Sound.Effects.echo.echofilter(input, output, delay=
0.7, atten=
4)
2569 An alternative way of importing the submodule is:
2572 from Sound.Effects import echo
2575 This also loads the submodule
\module{echo
}, and makes it available without
2576 its package prefix, so it can be used as follows:
2579 echo.echofilter(input, output, delay=
0.7, atten=
4)
2582 Yet another variation is to import the desired function or variable directly:
2585 from Sound.Effects.echo import echofilter
2588 Again, this loads the submodule
\module{echo
}, but this makes its function
2589 \function{echofilter()
} directly available:
2592 echofilter(input, output, delay=
0.7, atten=
4)
2595 Note that when using
\code{from
\var{package
} import
\var{item
}}, the
2596 item can be either a submodule (or subpackage) of the package, or some
2597 other name defined in the package, like a function, class or
2598 variable. The
\code{import
} statement first tests whether the item is
2599 defined in the package; if not, it assumes it is a module and attempts
2600 to load it. If it fails to find it, an
2601 \exception{ImportError
} exception is raised.
2603 Contrarily, when using syntax like
\code{import
2604 \var{item.subitem.subsubitem
}}, each item except for the last must be
2605 a package; the last item can be a module or a package but can't be a
2606 class or function or variable defined in the previous item.
2608 \subsection{Importing * From a Package
\label{pkg-import-star
}}
2609 %The \code{__all__} Attribute
2611 Now what happens when the user writes
\code{from Sound.Effects import
2612 *
}? Ideally, one would hope that this somehow goes out to the
2613 filesystem, finds which submodules are present in the package, and
2614 imports them all. Unfortunately, this operation does not work very
2615 well on Mac and Windows platforms, where the filesystem does not
2616 always have accurate information about the case of a filename! On
2617 these platforms, there is no guaranteed way to know whether a file
2618 \file{ECHO.PY
} should be imported as a module
\module{echo
},
2619 \module{Echo
} or
\module{ECHO
}. (For example, Windows
95 has the
2620 annoying practice of showing all file names with a capitalized first
2621 letter.) The DOS
8+
3 filename restriction adds another interesting
2622 problem for long module names.
2624 The only solution is for the package author to provide an explicit
2625 index of the package. The import statement uses the following
2626 convention: if a package's
\file{__init__.py
} code defines a list
2627 named
\code{__all__
}, it is taken to be the list of module names that
2628 should be imported when
\code{from
\var{package
} import *
} is
2629 encountered. It is up to the package author to keep this list
2630 up-to-date when a new version of the package is released. Package
2631 authors may also decide not to support it, if they don't see a use for
2632 importing * from their package. For example, the file
2633 \file{Sounds/Effects/__init__.py
} could contain the following code:
2636 __all__ =
["echo", "surround", "reverse"
]
2639 This would mean that
\code{from Sound.Effects import *
} would
2640 import the three named submodules of the
\module{Sound
} package.
2642 If
\code{__all__
} is not defined, the statement
\code{from Sound.Effects
2643 import *
} does
\emph{not
} import all submodules from the package
2644 \module{Sound.Effects
} into the current namespace; it only ensures that the
2645 package
\module{Sound.Effects
} has been imported (possibly running its
2646 initialization code,
\file{__init__.py
}) and then imports whatever names are
2647 defined in the package. This includes any names defined (and
2648 submodules explicitly loaded) by
\file{__init__.py
}. It also includes any
2649 submodules of the package that were explicitly loaded by previous
2650 import statements. Consider this code:
2653 import Sound.Effects.echo
2654 import Sound.Effects.surround
2655 from Sound.Effects import *
2658 In this example, the echo and surround modules are imported in the
2659 current namespace because they are defined in the
2660 \module{Sound.Effects
} package when the
\code{from...import
} statement
2661 is executed. (This also works when
\code{__all__
} is defined.)
2663 Note that in general the practicing of importing * from a module or
2664 package is frowned upon, since it often causes poorly readable code.
2665 However, it is okay to use it to save typing in interactive sessions,
2666 and certain modules are designed to export only names that follow
2669 Remember, there is nothing wrong with using
\code{from Package
2670 import specific_submodule
}! In fact, this is the
2671 recommended notation unless the importing module needs to use
2672 submodules with the same name from different packages.
2675 \subsection{Intra-package References
}
2677 The submodules often need to refer to each other. For example, the
2678 \module{surround
} module might use the
\module{echo
} module. In fact, such references
2679 are so common that the
\code{import
} statement first looks in the
2680 containing package before looking in the standard module search path.
2681 Thus, the surround module can simply use
\code{import echo
} or
2682 \code{from echo import echofilter
}. If the imported module is not
2683 found in the current package (the package of which the current module
2684 is a submodule), the
\code{import
} statement looks for a top-level module
2685 with the given name.
2687 When packages are structured into subpackages (as with the
2688 \module{Sound
} package in the example), there's no shortcut to refer
2689 to submodules of sibling packages - the full name of the subpackage
2690 must be used. For example, if the module
2691 \module{Sound.Filters.vocoder
} needs to use the
\module{echo
} module
2692 in the
\module{Sound.Effects
} package, it can use
\code{from
2693 Sound.Effects import echo
}.
2695 %(One could design a notation to refer to parent packages, similar to
2696 %the use of ".." to refer to the parent directory in \UNIX{} and Windows
2697 %filesystems. In fact, the \module{ni} module, which was the
2698 %ancestor of this package system, supported this using \code{__} for
2699 %the package containing the current module,
2700 %\code{__.__} for the parent package, and so on. This feature was dropped
2701 %because of its awkwardness; since most packages will have a relative
2702 %shallow substructure, this is no big loss.)
2706 \chapter{Input and Output
\label{io
}}
2708 There are several ways to present the output of a program; data can be
2709 printed in a human-readable form, or written to a file for future use.
2710 This chapter will discuss some of the possibilities.
2713 \section{Fancier Output Formatting
\label{formatting
}}
2715 So far we've encountered two ways of writing values:
\emph{expression
2716 statements
} and the
\keyword{print
} statement. (A third way is using
2717 the
\method{write()
} method of file objects; the standard output file
2718 can be referenced as
\code{sys.stdout
}. See the Library Reference for
2719 more information on this.)
2721 Often you'll want more control over the formatting of your output than
2722 simply printing space-separated values. There are two ways to format
2723 your output; the first way is to do all the string handling yourself;
2724 using string slicing and concatenation operations you can create any
2725 lay-out you can imagine. The standard module
2726 \module{string
}\refstmodindex{string
} contains some useful operations
2727 for padding strings to a given column width; these will be discussed
2728 shortly. The second way is to use the
\code{\%
} operator with a
2729 string as the left argument. The
\code{\%
} operator interprets the
2730 left argument much like a
\cfunction{sprintf()
}-style format
2731 string to be applied to the right argument, and returns the string
2732 resulting from this formatting operation.
2734 One question remains, of course: how do you convert values to strings?
2735 Luckily, Python has ways to convert any value to a string: pass it to
2736 the
\function{repr()
} or
\function{str()
} functions, or just write
2737 the value between reverse quotes (
\code{``
}, equivalent to
2740 The
\function{str()
} function is meant to return representations of
2741 values which are fairly human-readable, while
\function{repr()
} is
2742 meant to generate representations which can be read by the interpreter
2743 (or will force a
\exception{SyntaxError
} if there is not equivalent
2744 syntax). For objects which don't have a particular representation for
2745 human consumption,
\function{str()
} will return the same value as
2746 \function{repr()
}. Many values, such as numbers or structures like
2747 lists and dictionaries, have the same representation using either
2748 function. Strings and floating point numbers, in particular, have two
2749 distinct representations.
2754 >>> s = 'Hello, world.'
2762 '
0.10000000000000001'
2765 >>> s = 'The value of x is ' + `x` + ', and y is ' + `y` + '...'
2767 The value of x is
32.5, and y is
40000...
2768 >>> # Reverse quotes work on other types besides numbers:
2773 >>> # Converting a string adds string quotes and backslashes:
2774 ... hello = 'hello, world
\n'
2775 >>> hellos = `hello`
2778 >>> # The argument of reverse quotes may be a tuple:
2779 ... `x, y, ('spam', 'eggs')`
2780 "(
32.5,
40000, ('spam', 'eggs'))"
2783 Here are two ways to write a table of squares and cubes:
2787 >>> for x in range(
1,
11):
2788 ... print string.rjust(`x`,
2), string.rjust(`x*x`,
3),
2789 ... # Note trailing comma on previous line
2790 ... print string.rjust(`x*x*x`,
4)
2802 >>> for x in range(
1,
11):
2803 ... print '
%2d %3d %4d' % (x, x*x, x*x*x)
2817 (Note that one space between each column was added by the way
2818 \keyword{print
} works: it always adds spaces between its arguments.)
2820 This example demonstrates the function
\function{string.rjust()
},
2821 which right-justifies a string in a field of a given width by padding
2822 it with spaces on the left. There are similar functions
2823 \function{string.ljust()
} and
\function{string.center()
}. These
2824 functions do not write anything, they just return a new string. If
2825 the input string is too long, they don't truncate it, but return it
2826 unchanged; this will mess up your column lay-out but that's usually
2827 better than the alternative, which would be lying about a value. (If
2828 you really want truncation you can always add a slice operation, as in
2829 \samp{string.ljust(x,~n)
[0:n
]}.)
2831 There is another function,
\function{string.zfill()
}, which pads a
2832 numeric string on the left with zeros. It understands about plus and
2837 >>> string.zfill('
12',
5)
2839 >>> string.zfill('-
3.14',
7)
2841 >>> string.zfill('
3.14159265359',
5)
2845 Using the
\code{\%
} operator looks like this:
2849 >>> print 'The value of PI is approximately
%5.3f.' % math.pi
2850 The value of PI is approximately
3.142.
2853 If there is more than one format in the string, you need to pass a
2854 tuple as right operand, as in this example:
2857 >>> table =
{'Sjoerd':
4127, 'Jack':
4098, 'Dcab':
7678}
2858 >>> for name, phone in table.items():
2859 ... print '
%-10s ==> %10d' % (name, phone)
2866 Most formats work exactly as in C and require that you pass the proper
2867 type; however, if you don't you get an exception, not a core dump.
2868 The
\code{\%s
} format is more relaxed: if the corresponding argument is
2869 not a string object, it is converted to string using the
2870 \function{str()
} built-in function. Using
\code{*
} to pass the width
2871 or precision in as a separate (integer) argument is supported. The
2872 C formats
\code{\%n
} and
\code{\%p
} are not supported.
2874 If you have a really long format string that you don't want to split
2875 up, it would be nice if you could reference the variables to be
2876 formatted by name instead of by position. This can be done by using
2877 form
\code{\%(name)format
}, as shown here:
2880 >>> table =
{'Sjoerd':
4127, 'Jack':
4098, 'Dcab':
8637678}
2881 >>> print 'Jack:
%(Jack)d; Sjoerd: %(Sjoerd)d; Dcab: %(Dcab)d' % table
2882 Jack:
4098; Sjoerd:
4127; Dcab:
8637678
2885 This is particularly useful in combination with the new built-in
2886 \function{vars()
} function, which returns a dictionary containing all
2889 \section{Reading and Writing Files
\label{files
}}
2892 \function{open()
}\bifuncindex{open
} returns a file
2893 object
\obindex{file
}, and is most commonly used with two arguments:
2894 \samp{open(
\var{filename
},
\var{mode
})
}.
2897 >>> f=open('/tmp/workfile', 'w')
2899 <open file '/tmp/workfile', mode 'w' at
80a0960>
2902 The first argument is a string containing the filename. The second
2903 argument is another string containing a few characters describing the
2904 way in which the file will be used.
\var{mode
} can be
\code{'r'
} when
2905 the file will only be read,
\code{'w'
} for only writing (an existing
2906 file with the same name will be erased), and
\code{'a'
} opens the file
2907 for appending; any data written to the file is automatically added to
2908 the end.
\code{'r+'
} opens the file for both reading and writing.
2909 The
\var{mode
} argument is optional;
\code{'r'
} will be assumed if
2912 On Windows and the Macintosh,
\code{'b'
} appended to the
2913 mode opens the file in binary mode, so there are also modes like
2914 \code{'rb'
},
\code{'wb'
}, and
\code{'r+b'
}. Windows makes a
2915 distinction between text and binary files; the end-of-line characters
2916 in text files are automatically altered slightly when data is read or
2917 written. This behind-the-scenes modification to file data is fine for
2918 \ASCII{} text files, but it'll corrupt binary data like that in JPEGs or
2919 \file{.EXE
} files. Be very careful to use binary mode when reading and
2920 writing such files. (Note that the precise semantics of text mode on
2921 the Macintosh depends on the underlying C library being used.)
2923 \subsection{Methods of File Objects
\label{fileMethods
}}
2925 The rest of the examples in this section will assume that a file
2926 object called
\code{f
} has already been created.
2928 To read a file's contents, call
\code{f.read(
\var{size
})
}, which reads
2929 some quantity of data and returns it as a string.
\var{size
} is an
2930 optional numeric argument. When
\var{size
} is omitted or negative,
2931 the entire contents of the file will be read and returned; it's your
2932 problem if the file is twice as large as your machine's memory.
2933 Otherwise, at most
\var{size
} bytes are read and returned. If the end
2934 of the file has been reached,
\code{f.read()
} will return an empty
2935 string (
\code {""
}).
2938 'This is the entire file.
\n'
2943 \code{f.readline()
} reads a single line from the file; a newline
2944 character (
\code{\e n
}) is left at the end of the string, and is only
2945 omitted on the last line of the file if the file doesn't end in a
2946 newline. This makes the return value unambiguous; if
2947 \code{f.readline()
} returns an empty string, the end of the file has
2948 been reached, while a blank line is represented by
\code{'
\e n'
}, a
2949 string containing only a single newline.
2953 'This is the first line of the file.
\n'
2955 'Second line of the file
\n'
2960 \code{f.readlines()
} returns a list containing all the lines of data
2961 in the file. If given an optional parameter
\var{sizehint
}, it reads
2962 that many bytes from the file and enough more to complete a line, and
2963 returns the lines from that. This is often used to allow efficient
2964 reading of a large file by lines, but without having to load the
2965 entire file in memory. Only complete lines will be returned.
2969 ['This is the first line of the file.
\n', 'Second line of the file
\n'
]
2972 \code{f.write(
\var{string
})
} writes the contents of
\var{string
} to
2973 the file, returning
\code{None
}.
2976 >>> f.write('This is a test
\n')
2979 \code{f.tell()
} returns an integer giving the file object's current
2980 position in the file, measured in bytes from the beginning of the
2981 file. To change the file object's position, use
2982 \samp{f.seek(
\var{offset
},
\var{from_what
})
}. The position is
2983 computed from adding
\var{offset
} to a reference point; the reference
2984 point is selected by the
\var{from_what
} argument. A
2985 \var{from_what
} value of
0 measures from the beginning of the file,
1
2986 uses the current file position, and
2 uses the end of the file as the
2987 reference point.
\var{from_what
} can be omitted and defaults to
0,
2988 using the beginning of the file as the reference point.
2991 >>> f=open('/tmp/workfile', 'r+')
2992 >>> f.write('
0123456789abcdef')
2993 >>> f.seek(
5) # Go to the
6th byte in the file
2996 >>> f.seek(-
3,
2) # Go to the
3rd byte before the end
3001 When you're done with a file, call
\code{f.close()
} to close it and
3002 free up any system resources taken up by the open file. After calling
3003 \code{f.close()
}, attempts to use the file object will automatically fail.
3008 Traceback (most recent call last):
3009 File "<stdin>", line
1, in ?
3010 ValueError: I/O operation on closed file
3013 File objects have some additional methods, such as
3014 \method{isatty()
} and
\method{truncate()
} which are less frequently
3015 used; consult the Library Reference for a complete guide to file
3018 \subsection{The
\module{pickle
} Module
\label{pickle
}}
3019 \refstmodindex{pickle
}
3021 Strings can easily be written to and read from a file. Numbers take a
3022 bit more effort, since the
\method{read()
} method only returns
3023 strings, which will have to be passed to a function like
3024 \function{string.atoi()
}, which takes a string like
\code{'
123'
} and
3025 returns its numeric value
123. However, when you want to save more
3026 complex data types like lists, dictionaries, or class instances,
3027 things get a lot more complicated.
3029 Rather than have users be constantly writing and debugging code to
3030 save complicated data types, Python provides a standard module called
3031 \module{pickle
}. This is an amazing module that can take almost
3032 any Python object (even some forms of Python code!), and convert it to
3033 a string representation; this process is called
\dfn{pickling
}.
3034 Reconstructing the object from the string representation is called
3035 \dfn{unpickling
}. Between pickling and unpickling, the string
3036 representing the object may have been stored in a file or data, or
3037 sent over a network connection to some distant machine.
3039 If you have an object
\code{x
}, and a file object
\code{f
} that's been
3040 opened for writing, the simplest way to pickle the object takes only
3047 To unpickle the object again, if
\code{f
} is a file object which has
3048 been opened for reading:
3054 (There are other variants of this, used when pickling many objects or
3055 when you don't want to write the pickled data to a file; consult the
3056 complete documentation for
\module{pickle
} in the Library Reference.)
3058 \module{pickle
} is the standard way to make Python objects which can
3059 be stored and reused by other programs or by a future invocation of
3060 the same program; the technical term for this is a
3061 \dfn{persistent
} object. Because
\module{pickle
} is so widely used,
3062 many authors who write Python extensions take care to ensure that new
3063 data types such as matrices can be properly pickled and unpickled.
3067 \chapter{Errors and Exceptions
\label{errors
}}
3069 Until now error messages haven't been more than mentioned, but if you
3070 have tried out the examples you have probably seen some. There are
3071 (at least) two distinguishable kinds of errors:
3072 \emph{syntax errors
} and
\emph{exceptions
}.
3074 \section{Syntax Errors
\label{syntaxErrors
}}
3076 Syntax errors, also known as parsing errors, are perhaps the most common
3077 kind of complaint you get while you are still learning Python:
3080 >>> while
1 print 'Hello world'
3081 File "<stdin>", line
1, in ?
3082 while
1 print 'Hello world'
3084 SyntaxError: invalid syntax
3087 The parser repeats the offending line and displays a little `arrow'
3088 pointing at the earliest point in the line where the error was
3089 detected. The error is caused by (or at least detected at) the token
3090 \emph{preceding
} the arrow: in the example, the error is detected at
3091 the keyword
\keyword{print
}, since a colon (
\character{:
}) is missing
3092 before it. File name and line number are printed so you know where to
3093 look in case the input came from a script.
3095 \section{Exceptions
\label{exceptions
}}
3097 Even if a statement or expression is syntactically correct, it may
3098 cause an error when an attempt is made to execute it.
3099 Errors detected during execution are called
\emph{exceptions
} and are
3100 not unconditionally fatal: you will soon learn how to handle them in
3101 Python programs. Most exceptions are not handled by programs,
3102 however, and result in error messages as shown here:
3106 Traceback (most recent call last):
3107 File "<stdin>", line
1, in ?
3108 ZeroDivisionError: integer division or modulo
3110 Traceback (most recent call last):
3111 File "<stdin>", line
1, in ?
3112 NameError: name 'spam' is not defined
3114 Traceback (most recent call last):
3115 File "<stdin>", line
1, in ?
3116 TypeError: illegal argument type for built-in operation
3119 The last line of the error message indicates what happened.
3120 Exceptions come in different types, and the type is printed as part of
3121 the message: the types in the example are
3122 \exception{ZeroDivisionError
},
\exception{NameError
} and
3123 \exception{TypeError
}.
3124 The string printed as the exception type is the name of the built-in
3125 name for the exception that occurred. This is true for all built-in
3126 exceptions, but need not be true for user-defined exceptions (although
3127 it is a useful convention).
3128 Standard exception names are built-in identifiers (not reserved
3131 The rest of the line is a detail whose interpretation depends on the
3132 exception type; its meaning is dependent on the exception type.
3134 The preceding part of the error message shows the context where the
3135 exception happened, in the form of a stack backtrace.
3136 In general it contains a stack backtrace listing source lines; however,
3137 it will not display lines read from standard input.
3139 The
\citetitle[../lib/module-exceptions.html
]{Python Library
3140 Reference
} lists the built-in exceptions and their meanings.
3143 \section{Handling Exceptions
\label{handling
}}
3145 It is possible to write programs that handle selected exceptions.
3146 Look at the following example, which asks the user for input until a
3147 valid integer has been entered, but allows the user to interrupt the
3148 program (using
\kbd{Control-C
} or whatever the operating system
3149 supports); note that a user-generated interruption is signalled by
3150 raising the
\exception{KeyboardInterrupt
} exception.
3155 ... x = int(raw_input("Please enter a number: "))
3157 ... except ValueError:
3158 ... print "Oops! That was no valid number. Try again..."
3162 The
\keyword{try
} statement works as follows.
3166 First, the
\emph{try clause
} (the statement(s) between the
3167 \keyword{try
} and
\keyword{except
} keywords) is executed.
3170 If no exception occurs, the
\emph{except\ clause
} is skipped and
3171 execution of the
\keyword{try
} statement is finished.
3174 If an exception occurs during execution of the try clause, the rest of
3175 the clause is skipped. Then if its type matches the exception named
3176 after the
\keyword{except
} keyword, the rest of the try clause is
3177 skipped, the except clause is executed, and then execution continues
3178 after the
\keyword{try
} statement.
3181 If an exception occurs which does not match the exception named in the
3182 except clause, it is passed on to outer
\keyword{try
} statements; if
3183 no handler is found, it is an
\emph{unhandled exception
} and execution
3184 stops with a message as shown above.
3188 A
\keyword{try
} statement may have more than one except clause, to
3189 specify handlers for different exceptions. At most one handler will
3190 be executed. Handlers only handle exceptions that occur in the
3191 corresponding try clause, not in other handlers of the same
3192 \keyword{try
} statement. An except clause may name multiple exceptions
3193 as a parenthesized list, for example:
3196 ... except (RuntimeError, TypeError, NameError):
3200 The last except clause may omit the exception name(s), to serve as a
3201 wildcard. Use this with extreme caution, since it is easy to mask a
3202 real programming error in this way! It can also be used to print an
3203 error message and then re-raise the exception (allowing a caller to
3204 handle the exception as well):
3210 f = open('myfile.txt')
3212 i = int(string.strip(s))
3213 except IOError, (errno, strerror):
3214 print "I/O error(
%s): %s" % (errno, strerror)
3216 print "Could not convert data to an integer."
3218 print "Unexpected error:", sys.exc_info()
[0]
3222 The
\keyword{try
} \ldots\
\keyword{except
} statement has an optional
3223 \emph{else clause
}, which, when present, must follow all except
3224 clauses. It is useful for code that must be executed if the try
3225 clause does not raise an exception. For example:
3228 for arg in sys.argv
[1:
]:
3232 print 'cannot open', arg
3234 print arg, 'has', len(f.readlines()), 'lines'
3238 The use of the
\keyword{else
} clause is better than adding additional
3239 code to the
\keyword{try
} clause because it avoids accidentally
3240 catching an exception that wasn't raised by the code being protected
3241 by the
\keyword{try
} \ldots\
\keyword{except
} statement.
3244 When an exception occurs, it may have an associated value, also known as
3245 the exception's
\emph{argument
}.
3246 The presence and type of the argument depend on the exception type.
3247 For exception types which have an argument, the except clause may
3248 specify a variable after the exception name (or list) to receive the
3249 argument's value, as follows:
3254 ... except NameError, x:
3255 ... print 'name', x, 'undefined'
3260 If an exception has an argument, it is printed as the last part
3261 (`detail') of the message for unhandled exceptions.
3263 Exception handlers don't just handle exceptions if they occur
3264 immediately in the try clause, but also if they occur inside functions
3265 that are called (even indirectly) in the try clause.
3269 >>> def this_fails():
3274 ... except ZeroDivisionError, detail:
3275 ... print 'Handling run-time error:', detail
3277 Handling run-time error: integer division or modulo
3281 \section{Raising Exceptions
\label{raising
}}
3283 The
\keyword{raise
} statement allows the programmer to force a
3284 specified exception to occur.
3288 >>> raise NameError, 'HiThere'
3289 Traceback (most recent call last):
3290 File "<stdin>", line
1, in ?
3294 The first argument to
\keyword{raise
} names the exception to be
3295 raised. The optional second argument specifies the exception's
3298 If you need to determine whether an exception was raised but don't
3299 intend to handle it, a simpler form of the
\keyword{raise
} statement
3300 allows you to re-raise the exception:
3304 ... raise NameError, 'HiThere'
3305 ... except NameError:
3306 ... print 'An exception flew by!'
3309 An exception flew by!
3310 Traceback (most recent call last):
3311 File "<stdin>", line
2, in ?
3316 \section{User-defined Exceptions
\label{userExceptions
}}
3318 Programs may name their own exceptions by creating a new exception
3319 class. Exceptions should typically be derived from the
3320 \exception{Exception
} class, either directly or indirectly. For
3324 >>> class MyError(Exception):
3325 ... def __init__(self, value):
3326 ... self.value = value
3327 ... def __str__(self):
3328 ... return `self.value`
3331 ... raise MyError(
2*
2)
3332 ... except MyError, e:
3333 ... print 'My exception occurred, value:', e.value
3335 My exception occurred, value:
4
3336 >>> raise MyError, 'oops!'
3337 Traceback (most recent call last):
3338 File "<stdin>", line
1, in ?
3339 __main__.MyError: 'oops!'
3342 Exception classes can be defined which do anything any other class can
3343 do, but are usually kept simple, often only offering a number of
3344 attributes that allow information about the error to be extracted by
3345 handlers for the exception. When creating a module which can raise
3346 several distinct errors, a common practice is to create a base class
3347 for exceptions defined by that module, and subclass that to create
3348 specific exception classes for different error conditions:
3351 class Error(Exception):
3352 """Base class for exceptions in this module."""
3355 class InputError(Error):
3356 """Exception raised for errors in the input.
3359 expression -- input expression in which the error occurred
3360 message -- explanation of the error
3363 def __init__(self, expression, message):
3364 self.expression = expression
3365 self.message = message
3367 class TransitionError(Error):
3368 """Raised when an operation attempts a state transition that's not
3372 previous -- state at beginning of transition
3373 next -- attempted new state
3374 message -- explanation of why the specific transition is not allowed
3377 def __init__(self, previous, next, message):
3378 self.previous = previous
3380 self.message = message
3383 Most exceptions are defined with names that end in ``Error,'' similar
3384 to the naming of the standard exceptions.
3386 Many standard modules define their own exceptions to
report errors
3387 that may occur in functions they define. More information on classes
3388 is presented in chapter
\ref{classes
}, ``Classes.''
3391 \section{Defining Clean-up Actions
\label{cleanup
}}
3393 The
\keyword{try
} statement has another optional clause which is
3394 intended to define clean-up actions that must be executed under all
3395 circumstances. For example:
3399 ... raise KeyboardInterrupt
3401 ... print 'Goodbye, world!'
3404 Traceback (most recent call last):
3405 File "<stdin>", line
2, in ?
3409 A
\emph{finally clause
} is executed whether or not an exception has
3410 occurred in the try clause. When an exception has occurred, it is
3411 re-raised after the finally clause is executed. The finally clause is
3412 also executed ``on the way out'' when the
\keyword{try
} statement is
3413 left via a
\keyword{break
} or
\keyword{return
} statement.
3415 The code in the finally clause is useful for releasing external
3416 resources (such as files or network connections), regardless of
3417 whether or not the use of the resource was successful.
3419 A
\keyword{try
} statement must either have one or more except clauses
3420 or one finally clause, but not both.
3423 \chapter{Classes
\label{classes
}}
3425 Python's class mechanism adds classes to the language with a minimum
3426 of new syntax and semantics. It is a mixture of the class mechanisms
3427 found in
\Cpp{} and Modula-
3. As is true for modules, classes in Python
3428 do not put an absolute barrier between definition and user, but rather
3429 rely on the politeness of the user not to ``break into the
3430 definition.'' The most important features of classes are retained
3431 with full power, however: the class inheritance mechanism allows
3432 multiple base classes, a derived class can override any methods of its
3433 base class or classes, a method can call the method of a base class with the
3434 same name. Objects can contain an arbitrary amount of private data.
3436 In
\Cpp{} terminology, all class members (including the data members) are
3437 \emph{public
}, and all member functions are
\emph{virtual
}. There are
3438 no special constructors or destructors. As in Modula-
3, there are no
3439 shorthands for referencing the object's members from its methods: the
3440 method function is declared with an explicit first argument
3441 representing the object, which is provided implicitly by the call. As
3442 in Smalltalk, classes themselves are objects, albeit in the wider
3443 sense of the word: in Python, all data types are objects. This
3444 provides semantics for importing and renaming. But, just like in
3445 \Cpp{} or Modula-
3, built-in types cannot be used as base classes for
3446 extension by the user. Also, like in
\Cpp{} but unlike in Modula-
3, most
3447 built-in operators with special syntax (arithmetic operators,
3448 subscripting etc.) can be redefined for class instances.
3450 \section{A Word About Terminology
\label{terminology
}}
3452 Lacking universally accepted terminology to talk about classes, I will
3453 make occasional use of Smalltalk and
\Cpp{} terms. (I would use Modula-
3
3454 terms, since its object-oriented semantics are closer to those of
3455 Python than
\Cpp, but I expect that few readers have heard of it.)
3457 I also have to warn you that there's a terminological pitfall for
3458 object-oriented readers: the word ``object'' in Python does not
3459 necessarily mean a class instance. Like
\Cpp{} and Modula-
3, and
3460 unlike Smalltalk, not all types in Python are classes: the basic
3461 built-in types like integers and lists are not, and even somewhat more
3462 exotic types like files aren't. However,
\emph{all
} Python types
3463 share a little bit of common semantics that is best described by using
3466 Objects have individuality, and multiple names (in multiple scopes)
3467 can be bound to the same object. This is known as aliasing in other
3468 languages. This is usually not appreciated on a first glance at
3469 Python, and can be safely ignored when dealing with immutable basic
3470 types (numbers, strings, tuples). However, aliasing has an
3471 (intended!) effect on the semantics of Python code involving mutable
3472 objects such as lists, dictionaries, and most types representing
3473 entities outside the program (files, windows, etc.). This is usually
3474 used to the benefit of the program, since aliases behave like pointers
3475 in some respects. For example, passing an object is cheap since only
3476 a pointer is passed by the implementation; and if a function modifies
3477 an object passed as an argument, the caller will see the change --- this
3478 obviates the need for two different argument passing mechanisms as in
3482 \section{Python Scopes and Name Spaces
\label{scopes
}}
3484 Before introducing classes, I first have to tell you something about
3485 Python's scope rules. Class definitions play some neat tricks with
3486 namespaces, and you need to know how scopes and namespaces work to
3487 fully understand what's going on. Incidentally, knowledge about this
3488 subject is useful for any advanced Python programmer.
3490 Let's begin with some definitions.
3492 A
\emph{namespace
} is a mapping from names to objects. Most
3493 namespaces are currently implemented as Python dictionaries, but
3494 that's normally not noticeable in any way (except for performance),
3495 and it may change in the future. Examples of namespaces are: the set
3496 of built-in names (functions such as
\function{abs()
}, and built-in
3497 exception names); the global names in a module; and the local names in
3498 a function invocation. In a sense the set of attributes of an object
3499 also form a namespace. The important thing to know about namespaces
3500 is that there is absolutely no relation between names in different
3501 namespaces; for instance, two different modules may both define a
3502 function ``maximize'' without confusion --- users of the modules must
3503 prefix it with the module name.
3505 By the way, I use the word
\emph{attribute
} for any name following a
3506 dot --- for example, in the expression
\code{z.real
},
\code{real
} is
3507 an attribute of the object
\code{z
}. Strictly speaking, references to
3508 names in modules are attribute references: in the expression
3509 \code{modname.funcname
},
\code{modname
} is a module object and
3510 \code{funcname
} is an attribute of it. In this case there happens to
3511 be a straightforward mapping between the module's attributes and the
3512 global names defined in the module: they share the same namespace!
3514 Except for one thing. Module objects have a secret read-only
3515 attribute called
\member{__dict__
} which returns the dictionary
3516 used to implement the module's namespace; the name
3517 \member{__dict__
} is an attribute but not a global name.
3518 Obviously, using this violates the abstraction of namespace
3519 implementation, and should be restricted to things like
3520 post-mortem debuggers.
3523 Attributes may be read-only or writable. In the latter case,
3524 assignment to attributes is possible. Module attributes are writable:
3525 you can write
\samp{modname.the_answer =
42}. Writable attributes may
3526 also be deleted with the
\keyword{del
} statement. For example,
3527 \samp{del modname.the_answer
} will remove the attribute
3528 \member{the_answer
} from the object named by
\code{modname
}.
3530 Name spaces are created at different moments and have different
3531 lifetimes. The namespace containing the built-in names is created
3532 when the Python interpreter starts up, and is never deleted. The
3533 global namespace for a module is created when the module definition
3534 is read in; normally, module namespaces also last until the
3535 interpreter quits. The statements executed by the top-level
3536 invocation of the interpreter, either read from a script file or
3537 interactively, are considered part of a module called
3538 \module{__main__
}, so they have their own global namespace. (The
3539 built-in names actually also live in a module; this is called
3540 \module{__builtin__
}.)
3542 The local namespace for a function is created when the function is
3543 called, and deleted when the function returns or raises an exception
3544 that is not handled within the function. (Actually, forgetting would
3545 be a better way to describe what actually happens.) Of course,
3546 recursive invocations each have their own local namespace.
3548 A
\emph{scope
} is a textual region of a Python program where a
3549 namespace is directly accessible. ``Directly accessible'' here means
3550 that an unqualified reference to a name attempts to find the name in
3553 Although scopes are determined statically, they are used dynamically.
3554 At any time during execution, exactly three nested scopes are in use
3555 (exactly three namespaces are directly accessible): the
3556 innermost scope, which is searched first, contains the local names,
3557 the middle scope, searched next, contains the current module's global
3558 names, and the outermost scope (searched last) is the namespace
3559 containing built-in names.
3561 Usually, the local scope references the local names of the (textually)
3562 current function. Outside of functions, the local scope references
3563 the same namespace as the global scope: the module's namespace.
3564 Class definitions place yet another namespace in the local scope.
3566 It is important to realize that scopes are determined textually: the
3567 global scope of a function defined in a module is that module's
3568 namespace, no matter from where or by what alias the function is
3569 called. On the other hand, the actual search for names is done
3570 dynamically, at run time --- however, the language definition is
3571 evolving towards static name resolution, at ``compile'' time, so don't
3572 rely on dynamic name resolution! (In fact, local variables are
3573 already determined statically.)
3575 A special quirk of Python is that assignments always go into the
3576 innermost scope. Assignments do not copy data --- they just
3577 bind names to objects. The same is true for deletions: the statement
3578 \samp{del x
} removes the binding of
\code{x
} from the namespace
3579 referenced by the local scope. In fact, all operations that introduce
3580 new names use the local scope: in particular, import statements and
3581 function definitions bind the module or function name in the local
3582 scope. (The
\keyword{global
} statement can be used to indicate that
3583 particular variables live in the global scope.)
3586 \section{A First Look at Classes
\label{firstClasses
}}
3588 Classes introduce a little bit of new syntax, three new object types,
3589 and some new semantics.
3592 \subsection{Class Definition Syntax
\label{classDefinition
}}
3594 The simplest form of class definition looks like this:
3605 Class definitions, like function definitions
3606 (
\keyword{def
} statements) must be executed before they have any
3607 effect. (You could conceivably place a class definition in a branch
3608 of an
\keyword{if
} statement, or inside a function.)
3610 In practice, the statements inside a class definition will usually be
3611 function definitions, but other statements are allowed, and sometimes
3612 useful --- we'll come back to this later. The function definitions
3613 inside a class normally have a peculiar form of argument list,
3614 dictated by the calling conventions for methods --- again, this is
3617 When a class definition is entered, a new namespace is created, and
3618 used as the local scope --- thus, all assignments to local variables
3619 go into this new namespace. In particular, function definitions bind
3620 the name of the new function here.
3622 When a class definition is left normally (via the end), a
\emph{class
3623 object
} is created. This is basically a wrapper around the contents
3624 of the namespace created by the class definition; we'll learn more
3625 about class objects in the next section. The original local scope
3626 (the one in effect just before the class definitions was entered) is
3627 reinstated, and the class object is bound here to the class name given
3628 in the class definition header (
\class{ClassName
} in the example).
3631 \subsection{Class Objects
\label{classObjects
}}
3633 Class objects support two kinds of operations: attribute references
3636 \emph{Attribute references
} use the standard syntax used for all
3637 attribute references in Python:
\code{obj.name
}. Valid attribute
3638 names are all the names that were in the class's namespace when the
3639 class object was created. So, if the class definition looked like
3644 "A simple example class"
3647 return 'hello world'
3650 then
\code{MyClass.i
} and
\code{MyClass.f
} are valid attribute
3651 references, returning an integer and a method object, respectively.
3652 Class attributes can also be assigned to, so you can change the value
3653 of
\code{MyClass.i
} by assignment.
\member{__doc__
} is also a valid
3654 attribute, returning the docstring belonging to the class:
\code{"A
3655 simple example class"
}).
3657 Class
\emph{instantiation
} uses function notation. Just pretend that
3658 the class object is a parameterless function that returns a new
3659 instance of the class. For example (assuming the above class):
3665 creates a new
\emph{instance
} of the class and assigns this object to
3666 the local variable
\code{x
}.
3668 The instantiation operation (``calling'' a class object) creates an
3669 empty object. Many classes like to create objects in a known initial
3670 state. Therefore a class may define a special method named
3671 \method{__init__()
}, like this:
3678 When a class defines an
\method{__init__()
} method, class
3679 instantiation automatically invokes
\method{__init__()
} for the
3680 newly-created class instance. So in this example, a new, initialized
3681 instance can be obtained by:
3687 Of course, the
\method{__init__()
} method may have arguments for
3688 greater flexibility. In that case, arguments given to the class
3689 instantiation operator are passed on to
\method{__init__()
}. For
3694 ... def __init__(self, realpart, imagpart):
3695 ... self.r = realpart
3696 ... self.i = imagpart
3698 >>> x = Complex(
3.0, -
4.5)
3704 \subsection{Instance Objects
\label{instanceObjects
}}
3706 Now what can we do with instance objects? The only operations
3707 understood by instance objects are attribute references. There are
3708 two kinds of valid attribute names.
3710 The first I'll call
\emph{data attributes
}. These correspond to
3711 ``instance variables'' in Smalltalk, and to ``data members'' in
3712 \Cpp. Data attributes need not be declared; like local variables,
3713 they spring into existence when they are first assigned to. For
3714 example, if
\code{x
} is the instance of
\class{MyClass
} created above,
3715 the following piece of code will print the value
\code{16}, without
3720 while x.counter <
10:
3721 x.counter = x.counter *
2
3726 The second kind of attribute references understood by instance objects
3727 are
\emph{methods
}. A method is a function that ``belongs to'' an
3728 object. (In Python, the term method is not unique to class instances:
3729 other object types can have methods as well. For example, list objects have
3730 methods called append, insert, remove, sort, and so on. However,
3731 below, we'll use the term method exclusively to mean methods of class
3732 instance objects, unless explicitly stated otherwise.)
3734 Valid method names of an instance object depend on its class. By
3735 definition, all attributes of a class that are (user-defined) function
3736 objects define corresponding methods of its instances. So in our
3737 example,
\code{x.f
} is a valid method reference, since
3738 \code{MyClass.f
} is a function, but
\code{x.i
} is not, since
3739 \code{MyClass.i
} is not. But
\code{x.f
} is not the same thing as
3740 \code{MyClass.f
} --- it is a
\obindex{method
}\emph{method object
}, not
3744 \subsection{Method Objects
\label{methodObjects
}}
3746 Usually, a method is called immediately:
3752 In our example, this will return the string
\code{'hello world'
}.
3753 However, it is not necessary to call a method right away:
3754 \code{x.f
} is a method object, and can be stored away and called at a
3755 later time. For example:
3763 will continue to print
\samp{hello world
} until the end of time.
3765 What exactly happens when a method is called? You may have noticed
3766 that
\code{x.f()
} was called without an argument above, even though
3767 the function definition for
\method{f
} specified an argument. What
3768 happened to the argument? Surely Python raises an exception when a
3769 function that requires an argument is called without any --- even if
3770 the argument isn't actually used...
3772 Actually, you may have guessed the answer: the special thing about
3773 methods is that the object is passed as the first argument of the
3774 function. In our example, the call
\code{x.f()
} is exactly equivalent
3775 to
\code{MyClass.f(x)
}. In general, calling a method with a list of
3776 \var{n
} arguments is equivalent to calling the corresponding function
3777 with an argument list that is created by inserting the method's object
3778 before the first argument.
3780 If you still don't understand how methods work, a look at the
3781 implementation can perhaps clarify matters. When an instance
3782 attribute is referenced that isn't a data attribute, its class is
3783 searched. If the name denotes a valid class attribute that is a
3784 function object, a method object is created by packing (pointers to)
3785 the instance object and the function object just found together in an
3786 abstract object: this is the method object. When the method object is
3787 called with an argument list, it is unpacked again, a new argument
3788 list is constructed from the instance object and the original argument
3789 list, and the function object is called with this new argument list.
3792 \section{Random Remarks
\label{remarks
}}
3794 [These should perhaps be placed more carefully...
]
3797 Data attributes override method attributes with the same name; to
3798 avoid accidental name conflicts, which may cause hard-to-find bugs in
3799 large programs, it is wise to use some kind of convention that
3800 minimizes the chance of conflicts. Possible conventions include
3801 capitalizing method names, prefixing data attribute names with a small
3802 unique string (perhaps just an underscore), or using verbs for methods
3803 and nouns for data attributes.
3806 Data attributes may be referenced by methods as well as by ordinary
3807 users (``clients'') of an object. In other words, classes are not
3808 usable to implement pure abstract data types. In fact, nothing in
3809 Python makes it possible to enforce data hiding --- it is all based
3810 upon convention. (On the other hand, the Python implementation,
3811 written in C, can completely hide implementation details and control
3812 access to an object if necessary; this can be used by extensions to
3813 Python written in C.)
3816 Clients should use data attributes with care --- clients may mess up
3817 invariants maintained by the methods by stamping on their data
3818 attributes. Note that clients may add data attributes of their own to
3819 an instance object without affecting the validity of the methods, as
3820 long as name conflicts are avoided --- again, a naming convention can
3821 save a lot of headaches here.
3824 There is no shorthand for referencing data attributes (or other
3825 methods!) from within methods. I find that this actually increases
3826 the readability of methods: there is no chance of confusing local
3827 variables and instance variables when glancing through a method.
3830 Conventionally, the first argument of methods is often called
3831 \code{self
}. This is nothing more than a convention: the name
3832 \code{self
} has absolutely no special meaning to Python. (Note,
3833 however, that by not following the convention your code may be less
3834 readable by other Python programmers, and it is also conceivable that
3835 a
\emph{class browser
} program be written which relies upon such a
3839 Any function object that is a class attribute defines a method for
3840 instances of that class. It is not necessary that the function
3841 definition is textually enclosed in the class definition: assigning a
3842 function object to a local variable in the class is also ok. For
3846 # Function defined outside the class
3853 return 'hello world'
3857 Now
\code{f
},
\code{g
} and
\code{h
} are all attributes of class
3858 \class{C
} that refer to function objects, and consequently they are all
3859 methods of instances of
\class{C
} ---
\code{h
} being exactly equivalent
3860 to
\code{g
}. Note that this practice usually only serves to confuse
3861 the reader of a program.
3864 Methods may call other methods by using method attributes of the
3865 \code{self
} argument:
3873 def addtwice(self, x):
3878 Methods may reference global names in the same way as ordinary
3879 functions. The global scope associated with a method is the module
3880 containing the class definition. (The class itself is never used as a
3881 global scope!) While one rarely encounters a good reason for using
3882 global data in a method, there are many legitimate uses of the global
3883 scope: for one thing, functions and modules imported into the global
3884 scope can be used by methods, as well as functions and classes defined
3885 in it. Usually, the class containing the method is itself defined in
3886 this global scope, and in the next section we'll find some good
3887 reasons why a method would want to reference its own class!
3890 \section{Inheritance
\label{inheritance
}}
3892 Of course, a language feature would not be worthy of the name ``class''
3893 without supporting inheritance. The syntax for a derived class
3894 definition looks as follows:
3897 class DerivedClassName(BaseClassName):
3905 The name
\class{BaseClassName
} must be defined in a scope containing
3906 the derived class definition. Instead of a base class name, an
3907 expression is also allowed. This is useful when the base class is
3908 defined in another module,
3911 class DerivedClassName(modname.BaseClassName):
3914 Execution of a derived class definition proceeds the same as for a
3915 base class. When the class object is constructed, the base class is
3916 remembered. This is used for resolving attribute references: if a
3917 requested attribute is not found in the class, it is searched in the
3918 base class. This rule is applied recursively if the base class itself
3919 is derived from some other class.
3921 There's nothing special about instantiation of derived classes:
3922 \code{DerivedClassName()
} creates a new instance of the class. Method
3923 references are resolved as follows: the corresponding class attribute
3924 is searched, descending down the chain of base classes if necessary,
3925 and the method reference is valid if this yields a function object.
3927 Derived classes may override methods of their base classes. Because
3928 methods have no special privileges when calling other methods of the
3929 same object, a method of a base class that calls another method
3930 defined in the same base class, may in fact end up calling a method of
3931 a derived class that overrides it. (For
\Cpp{} programmers: all methods
3932 in Python are effectively
\keyword{virtual
}.)
3934 An overriding method in a derived class may in fact want to extend
3935 rather than simply replace the base class method of the same name.
3936 There is a simple way to call the base class method directly: just
3937 call
\samp{BaseClassName.methodname(self, arguments)
}. This is
3938 occasionally useful to clients as well. (Note that this only works if
3939 the base class is defined or imported directly in the global scope.)
3942 \subsection{Multiple Inheritance
\label{multiple
}}
3944 Python supports a limited form of multiple inheritance as well. A
3945 class definition with multiple base classes looks as follows:
3948 class DerivedClassName(Base1, Base2, Base3):
3956 The only rule necessary to explain the semantics is the resolution
3957 rule used for class attribute references. This is depth-first,
3958 left-to-right. Thus, if an attribute is not found in
3959 \class{DerivedClassName
}, it is searched in
\class{Base1
}, then
3960 (recursively) in the base classes of
\class{Base1
}, and only if it is
3961 not found there, it is searched in
\class{Base2
}, and so on.
3963 (To some people breadth first --- searching
\class{Base2
} and
3964 \class{Base3
} before the base classes of
\class{Base1
} --- looks more
3965 natural. However, this would require you to know whether a particular
3966 attribute of
\class{Base1
} is actually defined in
\class{Base1
} or in
3967 one of its base classes before you can figure out the consequences of
3968 a name conflict with an attribute of
\class{Base2
}. The depth-first
3969 rule makes no differences between direct and inherited attributes of
3972 It is clear that indiscriminate use of multiple inheritance is a
3973 maintenance nightmare, given the reliance in Python on conventions to
3974 avoid accidental name conflicts. A well-known problem with multiple
3975 inheritance is a class derived from two classes that happen to have a
3976 common base class. While it is easy enough to figure out what happens
3977 in this case (the instance will have a single copy of ``instance
3978 variables'' or data attributes used by the common base class), it is
3979 not clear that these semantics are in any way useful.
3982 \section{Private Variables
\label{private
}}
3984 There is limited support for class-private
3985 identifiers. Any identifier of the form
\code{__spam
} (at least two
3986 leading underscores, at most one trailing underscore) is now textually
3987 replaced with
\code{_classname__spam
}, where
\code{classname
} is the
3988 current class name with leading underscore(s) stripped. This mangling
3989 is done without regard of the syntactic position of the identifier, so
3990 it can be used to define class-private instance and class variables,
3991 methods, as well as globals, and even to store instance variables
3992 private to this class on instances of
\emph{other
} classes. Truncation
3993 may occur when the mangled name would be longer than
255 characters.
3994 Outside classes, or when the class name consists of only underscores,
3997 Name mangling is intended to give classes an easy way to define
3998 ``private'' instance variables and methods, without having to worry
3999 about instance variables defined by derived classes, or mucking with
4000 instance variables by code outside the class. Note that the mangling
4001 rules are designed mostly to avoid accidents; it still is possible for
4002 a determined soul to access or modify a variable that is considered
4003 private. This can even be useful in special circumstances, such as in
4004 the debugger, and that's one reason why this loophole is not closed.
4005 (Buglet: derivation of a class with the same name as the base class
4006 makes use of private variables of the base class possible.)
4008 Notice that code passed to
\code{exec
},
\code{eval()
} or
4009 \code{evalfile()
} does not consider the classname of the invoking
4010 class to be the current class; this is similar to the effect of the
4011 \code{global
} statement, the effect of which is likewise restricted to
4012 code that is byte-compiled together. The same restriction applies to
4013 \code{getattr()
},
\code{setattr()
} and
\code{delattr()
}, as well as
4014 when referencing
\code{__dict__
} directly.
4016 Here's an example of a class that implements its own
4017 \method{__getattr__()
} and
\method{__setattr__()
} methods and stores
4018 all attributes in a private variable, in a way that works in all
4019 versions of Python, including those available before this feature was
4023 class VirtualAttributes:
4025 __vdict_name = locals().keys()
[0]
4028 self.__dict__
[self.__vdict_name
] =
{}
4030 def __getattr__(self, name):
4031 return self.__vdict
[name
]
4033 def __setattr__(self, name, value):
4034 self.__vdict
[name
] = value
4038 \section{Odds and Ends
\label{odds
}}
4040 Sometimes it is useful to have a data type similar to the Pascal
4041 ``record'' or C ``struct'', bundling together a couple of named data
4042 items. An empty class definition will do nicely:
4048 john = Employee() # Create an empty employee record
4050 # Fill the fields of the record
4051 john.name = 'John Doe'
4052 john.dept = 'computer lab'
4056 A piece of Python code that expects a particular abstract data type
4057 can often be passed a class that emulates the methods of that data
4058 type instead. For instance, if you have a function that formats some
4059 data from a file object, you can define a class with methods
4060 \method{read()
} and
\method{readline()
} that gets the data from a string
4061 buffer instead, and pass it as an argument.
% (Unfortunately, this
4062 %technique has its limitations: a class can't define operations that
4063 %are accessed by special syntax such as sequence subscripting or
4064 %arithmetic operators, and assigning such a ``pseudo-file'' to
4065 %\code{sys.stdin} will not cause the interpreter to read further input
4069 Instance method objects have attributes, too:
\code{m.im_self
} is the
4070 object of which the method is an instance, and
\code{m.im_func
} is the
4071 function object corresponding to the method.
4073 \subsection{Exceptions Can Be Classes
\label{exceptionClasses
}}
4075 User-defined exceptions are no longer limited to being string objects
4076 --- they can be identified by classes as well. Using this mechanism it
4077 is possible to create extensible hierarchies of exceptions.
4079 There are two new valid (semantic) forms for the raise statement:
4082 raise Class, instance
4087 In the first form,
\code{instance
} must be an instance of
4088 \class{Class
} or of a class derived from it. The second form is a
4092 raise instance.__class__, instance
4095 An except clause may list classes as well as string objects. A class
4096 in an except clause is compatible with an exception if it is the same
4097 class or a base class thereof (but not the other way around --- an
4098 except clause listing a derived class is not compatible with a base
4099 class). For example, the following code will print B, C, D in that
4121 Note that if the except clauses were reversed (with
4122 \samp{except B
} first), it would have printed B, B, B --- the first
4123 matching except clause is triggered.
4125 When an error message is printed for an unhandled exception which is a
4126 class, the class name is printed, then a colon and a space, and
4127 finally the instance converted to a string using the built-in function
4131 \chapter{What Now?
\label{whatNow
}}
4133 Reading this tutorial has probably reinforced your interest in using
4134 Python --- you should be eager to apply Python to solve your
4135 real-world problems. Now what should you do?
4137 You should read, or at least page through, the
4138 \citetitle[../lib/lib.html
]{Python Library Reference
},
4139 which gives complete (though terse) reference material about types,
4140 functions, and modules that can save you a lot of time when writing
4141 Python programs. The standard Python distribution includes a
4142 \emph{lot
} of code in both C and Python; there are modules to read
4143 \UNIX{} mailboxes, retrieve documents via HTTP, generate random
4144 numbers, parse command-line options, write CGI programs, compress
4145 data, and a lot more; skimming through the Library Reference will give
4146 you an idea of what's available.
4148 The major Python Web site is
\url{http://www.python.org/
}; it contains
4149 code, documentation, and pointers to Python-related pages around the
4150 Web. This Web site is mirrored in various places around the
4151 world, such as Europe, Japan, and Australia; a mirror may be faster
4152 than the main site, depending on your geographical location. A more
4153 informal site is
\url{http://starship.python.net/
}, which contains a
4154 bunch of Python-related personal home pages; many people have
4155 downloadable software there.
4157 For Python-related questions and problem reports, you can post to the
4158 newsgroup
\newsgroup{comp.lang.python
}, or send them to the mailing
4159 list at
\email{python-list@python.org
}. The newsgroup and mailing list
4160 are gatewayed, so messages posted to one will automatically be
4161 forwarded to the other. There are around
120 postings a day,
4162 % Postings figure based on average of last six months activity as
4163 % reported by www.egroups.com; Jan. 2000 - June 2000: 21272 msgs / 182
4164 % days = 116.9 msgs / day and steadily increasing.
4165 asking (and answering) questions, suggesting new features, and
4166 announcing new modules. Before posting, be sure to check the list of
4167 Frequently Asked Questions (also called the FAQ), at
4168 \url{http://www.python.org/doc/FAQ.html
}, or look for it in the
4169 \file{Misc/
} directory of the Python source distribution. Mailing
4170 list archives are available at
\url{http://www.python.org/pipermail/
}.
4171 The FAQ answers many of the questions that come up again and again,
4172 and may already contain the solution for your problem.
4177 \chapter{Interactive Input Editing and History Substitution
4178 \label{interacting
}}
4180 Some versions of the Python interpreter support editing of the current
4181 input line and history substitution, similar to facilities found in
4182 the Korn shell and the GNU Bash shell. This is implemented using the
4183 \emph{GNU Readline
} library, which supports Emacs-style and vi-style
4184 editing. This library has its own documentation which I won't
4185 duplicate here; however, the basics are easily explained. The
4186 interactive editing and history described here are optionally
4187 available in the
\UNIX{} and CygWin versions of the interpreter.
4189 This chapter does
\emph{not
} document the editing facilities of Mark
4190 Hammond's PythonWin package or the Tk-based environment, IDLE,
4191 distributed with Python. The command line history recall which
4192 operates within DOS boxes on NT and some other DOS and Windows flavors
4193 is yet another beast.
4195 \section{Line Editing
\label{lineEditing
}}
4197 If supported, input line editing is active whenever the interpreter
4198 prints a primary or secondary prompt. The current line can be edited
4199 using the conventional Emacs control characters. The most important
4200 of these are:
\kbd{C-A
} (Control-A) moves the cursor to the beginning
4201 of the line,
\kbd{C-E
} to the end,
\kbd{C-B
} moves it one position to
4202 the left,
\kbd{C-F
} to the right. Backspace erases the character to
4203 the left of the cursor,
\kbd{C-D
} the character to its right.
4204 \kbd{C-K
} kills (erases) the rest of the line to the right of the
4205 cursor,
\kbd{C-Y
} yanks back the last killed string.
4206 \kbd{C-underscore
} undoes the last change you made; it can be repeated
4207 for cumulative effect.
4209 \section{History Substitution
\label{history
}}
4211 History substitution works as follows. All non-empty input lines
4212 issued are saved in a history buffer, and when a new prompt is given
4213 you are positioned on a new line at the bottom of this buffer.
4214 \kbd{C-P
} moves one line up (back) in the history buffer,
4215 \kbd{C-N
} moves one down. Any line in the history buffer can be
4216 edited; an asterisk appears in front of the prompt to mark a line as
4217 modified. Pressing the
\kbd{Return
} key passes the current line to
4218 the interpreter.
\kbd{C-R
} starts an incremental reverse search;
4219 \kbd{C-S
} starts a forward search.
4221 \section{Key Bindings
\label{keyBindings
}}
4223 The key bindings and some other parameters of the Readline library can
4224 be customized by placing commands in an initialization file called
4225 \file{\~
{}/.inputrc
}. Key bindings have the form
4228 key-name: function-name
4234 "string": function-name
4237 and options can be set with
4240 set option-name value
4246 # I prefer vi-style editing:
4249 # Edit using a single line:
4250 set horizontal-scroll-mode On
4253 Meta-h: backward-kill-word
4254 "
\C-u": universal-argument
4255 "
\C-x
\C-r": re-read-init-file
4258 Note that the default binding for
\kbd{Tab
} in Python is to insert a
4259 \kbd{Tab
} character instead of Readline's default filename completion
4260 function. If you insist, you can override this by putting
4266 in your
\file{\~
{}/.inputrc
}. (Of course, this makes it harder to
4267 type indented continuation lines.)
4269 Automatic completion of variable and module names is optionally
4270 available. To enable it in the interpreter's interactive mode, add
4271 the following to your startup file:
\footnote{
4272 Python will execute the contents of a file identified by the
4273 \envvar{PYTHONSTARTUP
} environment variable when you start an
4274 interactive interpreter.
}
4275 \refstmodindex{rlcompleter
}\refbimodindex{readline
}
4278 import rlcompleter, readline
4279 readline.parse_and_bind('tab: complete')
4282 This binds the
\kbd{Tab
} key to the completion function, so hitting
4283 the
\kbd{Tab
} key twice suggests completions; it looks at Python
4284 statement names, the current local variables, and the available module
4285 names. For dotted expressions such as
\code{string.a
}, it will
4286 evaluate the the expression up to the final
\character{.
} and then
4287 suggest completions from the attributes of the resulting object. Note
4288 that this may execute application-defined code if an object with a
4289 \method{__getattr__()
} method is part of the expression.
4291 A more capable startup file might look like this example. Note that
4292 this deletes the names it creates once they are no longer needed; this
4293 is done since the startup file is executed in the same namespace as
4294 the interactive commands, and removing the names avoids creating side
4295 effects in the interactive environments. You may find it convenient
4296 to keep some of the imported modules, such as
\module{os
}, which turn
4297 out to be needed in most sessions with the interpreter.
4300 # Add auto-completion and a stored history file of commands to your Python
4301 # interactive interpreter. Requires Python
2.0+, readline. Autocomplete is
4302 # bound to the Esc key by default (you can change it - see readline docs).
4304 # Store the file in ~/.pystartup, and set an environment variable to point
4305 # to it, e.g. "export PYTHONSTARTUP=/max/home/itamar/.pystartup" in bash.
4307 # Note that PYTHONSTARTUP does *not* expand "~", so you have to put in the
4308 # full path to your home directory.
4315 historyPath = os.path.expanduser("~/.pyhistory")
4317 def save_history(historyPath=historyPath):
4319 readline.write_history_file(historyPath)
4321 if os.path.exists(historyPath):
4322 readline.read_history_file(historyPath)
4324 atexit.register(save_history)
4325 del os, atexit, readline, rlcompleter, save_history, historyPath
4329 \section{Commentary
\label{commentary
}}
4331 This facility is an enormous step forward compared to earlier versions
4332 of the interpreter; however, some wishes are left: It would be nice if
4333 the proper indentation were suggested on continuation lines (the
4334 parser knows if an indent token is required next). The completion
4335 mechanism might use the interpreter's symbol table. A command to
4336 check (or even suggest) matching parentheses, quotes, etc., would also
4340 \chapter{Floating Point Arithmetic: Issues and Limitations
4342 \sectionauthor{Tim Peters
}{tim.one@home.com
}
4344 Floating-point numbers are represented in computer hardware as
4345 base
2 (binary) fractions. For example, the decimal fraction
4351 has value
1/
10 +
2/
100 +
5/
1000, and in the same way the binary fraction
4357 has value
0/
2 +
0/
4 +
1/
8. These two fractions have identical values,
4358 the only real difference being that the first is written in base
10
4359 fractional notation, and the second in base
2.
4361 Unfortunately, most decimal fractions cannot be represented exactly as
4362 binary fractions. A consequence is that, in general, the decimal
4363 floating-point numbers you enter are only approximated by the binary
4364 floating-point numbers actually stored in the machine.
4366 The problem is easier to understand at first in base
10. Consider the
4367 fraction
1/
3. You can approximate that as a base
10 fraction:
4385 and so on. No matter how many digits you're willing to write down, the
4386 result will never be exactly
1/
3, but will be an increasingly better
4387 approximation to
1/
3.
4389 In the same way, no matter how many base
2 digits you're willing to
4390 use, the decimal value
0.1 cannot be represented exactly as a base
2
4391 fraction. In base
2,
1/
10 is the infinitely repeating fraction
4394 0.0001100110011001100110011001100110011001100110011...
4397 Stop at any finite number of bits, and you get an approximation. This
4398 is why you see things like:
4405 On most machines today, that is what you'll see if you enter
0.1 at
4406 a Python prompt. You may not, though, because the number of bits
4407 used by the hardware to store floating-point values can vary across
4408 machines, and Python only prints a decimal approximation to the true
4409 decimal value of the binary approximation stored by the machine. On
4410 most machines, if Python were to print the true decimal value of
4411 the binary approximation stored for
0.1, it would have to display
4415 0.1000000000000000055511151231257827021181583404541015625
4418 instead! The Python prompt (implicitly) uses the builtin
4419 \function{repr()
} function to obtain a string version of everything it
4420 displays. For floats,
\code{repr(
\var{float
})
} rounds the true
4421 decimal value to
17 significant digits, giving
4427 \code{repr(
\var{float
})
} produces
17 significant digits because it
4428 turns out that's enough (on most machines) so that
4429 \code{eval(repr(
\var{x
})) ==
\var{x
}} exactly for all finite floats
4430 \var{x
}, but rounding to
16 digits is not enough to make that true.
4432 Note that this is in the very nature of binary floating-point: this is
4433 not a bug in Python, it is not a bug in your code either, and you'll
4434 see the same kind of thing in all languages that support your
4435 hardware's floating-point arithmetic (although some languages may
4436 not
\emph{display
} the difference by default, or in all output modes).
4438 Python's builtin
\function{str()
} function produces only
12
4439 significant digits, and you may wish to use that instead. It's
4440 unusual for
\code{eval(str(
\var{x
}))
} to reproduce
\var{x
}, but the
4441 output may be more pleasant to look at:
4448 It's important to realize that this is, in a real sense, an illusion:
4449 the value in the machine is not exactly
1/
10, you're simply rounding
4450 the
\emph{display
} of the true machine value.
4452 Other surprises follow from this one. For example, after seeing
4459 you may be tempted to use the
\function{round()
} function to chop it
4460 back to the single digit you expect. But that makes no difference:
4467 The problem is that the binary floating-point value stored for "
0.1"
4468 was already the best possible binary approximation to
1/
10, so trying
4469 to round it again can't make it better: it was already as good as it
4472 Another consequence is that since
0.1 is not exactly
1/
10, adding
0.1
4473 to itself
10 times may not yield exactly
1.0, either:
4477 >>> for i in range(
10):
4484 Binary floating-point arithmetic holds many surprises like this. The
4485 problem with "
0.1" is explained in precise detail below, in the
4486 "Representation Error" section. See
4487 \citetitle[http://www.lahey.com/float.htm
]{The Perils of Floating
4488 Point
} for a more complete account of other common surprises.
4490 As that says near the end, ``there are no easy answers.'' Still,
4491 don't be unduly wary of floating-point! The errors in Python float
4492 operations are inherited from the floating-point hardware, and on most
4493 machines are on the order of no more than
1 part in
2**
53 per
4494 operation. That's more than adequate for most tasks, but you do need
4495 to keep in mind that it's not decimal arithmetic, and that every float
4496 operation can suffer a new rounding error.
4498 While pathological cases do exist, for most casual use of
4499 floating-point arithmetic you'll see the result you expect in the end
4500 if you simply round the display of your final results to the number of
4501 decimal digits you expect.
\function{str()
} usually suffices, and for
4502 finer control see the discussion of Pythons's
\code{\%
} format
4503 operator: the
\code{\%g
},
\code{\%f
} and
\code{\%e
} format codes
4504 supply flexible and easy ways to round float results for display.
4507 \section{Representation Error
4510 This section explains the ``
0.1'' example in detail, and shows how
4511 you can perform an exact analysis of cases like this yourself. Basic
4512 familiarity with binary floating-point representation is assumed.
4514 \dfn{Representation error
} refers to that some (most, actually)
4515 decimal fractions cannot be represented exactly as binary (base
2)
4516 fractions. This is the chief reason why Python (or Perl, C,
\Cpp,
4517 Java, Fortran, and many others) often won't display the exact decimal
4525 Why is that?
1/
10 is not exactly representable as a binary fraction.
4526 Almost all machines today (November
2000) use IEEE-
754 floating point
4527 arithmetic, and almost all platforms map Python floats to IEEE-
754
4528 "double precision".
754 doubles contain
53 bits of precision, so on
4529 input the computer strives to convert
0.1 to the closest fraction it can
4530 of the form
\var{J
}/
2**
\var{N
} where
\var{J
} is an integer containing
4531 exactly
53 bits. Rewriting
4534 1 /
10 ~= J / (
2**N)
4543 and recalling that
\var{J
} has exactly
53 bits (is
\code{>=
2**
52} but
4544 \code{<
2**
53}), the best value for
\var{N
} is
56:
4555 That is,
56 is the only value for
\var{N
} that leaves
\var{J
} with
4556 exactly
53 bits. The best possible value for
\var{J
} is then that
4560 >>> q, r = divmod(
2L**
56,
10)
4565 Since the remainder is more than half of
10, the best approximation is
4566 obtained by rounding up:
4573 Therefore the best possible approximation to
1/
10 in
754 double
4574 precision is that over
2**
56, or
4577 7205759403792794 /
72057594037927936
4580 Note that since we rounded up, this is actually a little bit larger than
4581 1/
10; if we had not rounded up, the quotient would have been a little
4582 bit smaller than
1/
10. But in no case can it be
\emph{exactly
} 1/
10!
4584 So the computer never ``sees''
1/
10: what it sees is the exact
4585 fraction given above, the best
754 double approximation it can get:
4592 If we multiply that fraction by
10**
30, we can see the (truncated)
4593 value of its
30 most significant decimal digits:
4596 >>>
7205759403792794L *
10L**
30 /
2L**
56
4597 100000000000000005551115123125L
4600 meaning that the exact number stored in the computer is approximately
4601 equal to the decimal value
0.100000000000000005551115123125. Rounding
4602 that to
17 significant digits gives the
0.10000000000000001 that Python
4603 displays (well, will display on any
754-conforming platform that does
4604 best-possible input and output conversions in its C library --- yours may
4607 \chapter{History and License
}