--- python3.4-3.4.2~rc1.orig/debian/2to3-3.1 +++ python3.4-3.4.2~rc1/debian/2to3-3.1 @@ -0,0 +1,41 @@ +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. +.TH 2TO3-3.3 "1" "January 2012" "2to3-3.3 3.3" "User Commands" +.SH NAME +2to3-3.3 \- Python2 to Python3 converter +.SH SYNOPSIS +.B 2to3 +[\fIoptions\fR] \fIfile|dir \fR... +.SH OPTIONS +.TP +\fB\-h\fR, \fB\-\-help\fR +show this help message and exit +.TP +\fB\-d\fR, \fB\-\-doctests_only\fR +Fix up doctests only +.TP +\fB\-f\fR FIX, \fB\-\-fix\fR=\fIFIX\fR +Each FIX specifies a transformation; default: all +.TP +\fB\-j\fR PROCESSES, \fB\-\-processes\fR=\fIPROCESSES\fR +Run 2to3 concurrently +.TP +\fB\-x\fR NOFIX, \fB\-\-nofix\fR=\fINOFIX\fR +Prevent a transformation from being run +.TP +\fB\-l\fR, \fB\-\-list\-fixes\fR +List available transformations +.TP +\fB\-p\fR, \fB\-\-print\-function\fR +Modify the grammar so that print() is a function +.TP +\fB\-v\fR, \fB\-\-verbose\fR +More verbose logging +.TP +\fB\-\-no\-diffs\fR +Don't show diffs of the refactoring +.TP +\fB\-w\fR, \fB\-\-write\fR +Write back modified files +.TP +\fB\-n\fR, \fB\-\-nobackups\fR +Don't write backups for modified files --- python3.4-3.4.2~rc1.orig/debian/FAQ.html +++ python3.4-3.4.2~rc1/debian/FAQ.html @@ -0,0 +1,8997 @@ + + +The Whole Python FAQ + + + +

The Whole Python FAQ

+Last changed on Wed Feb 12 21:31:08 2003 CET + +

(Entries marked with ** were changed within the last 24 hours; +entries marked with * were changed within the last 7 days.) +

+ +

1. General information and availability

1.1. What is Python? +
1.2. Why is it called Python? +
1.3. How do I obtain a copy of the Python source? +
1.4. How do I get documentation on Python? +
1.5. Are there other ftp sites that mirror the Python distribution? +
1.6. Is there a newsgroup or mailing list devoted to Python? +
1.7. Is there a WWW page devoted to Python? +
1.8. Is the Python documentation available on the WWW? +
1.9. Are there any books on Python? +
1.10. Are there any published articles about Python that I can reference? +
1.11. Are there short introductory papers or talks on Python? +
1.12. How does the Python version numbering scheme work? +
1.13. How do I get a beta test version of Python? +
1.14. Are there copyright restrictions on the use of Python? +
1.15. Why was Python created in the first place? +
1.16. Do I have to like "Monty Python's Flying Circus"? +
1.17. What is Python good for? +
1.18. Can I use the FAQ Wizard software to maintain my own FAQ? +
1.19. Which editor has good support for editing Python source code? +
1.20. I've never programmed before. Is there a Python tutorial? +
1.21. Where in the world is www.python.org located? + +

+ +

2. Python in the real world

2.1. How many people are using Python? +
2.2. Have any significant projects been done in Python? +
2.3. Are there any commercial projects going on using Python? +
2.4. How stable is Python? +
2.5. What new developments are expected for Python in the future? +
2.6. Is it reasonable to propose incompatible changes to Python? +
2.7. What is the future of Python? +
2.8. What was the PSA, anyway? +
2.9. Deleted +
2.10. Deleted +
2.11. Is Python Y2K (Year 2000) Compliant? +
2.12. Is Python a good language in a class for beginning programmers? + +

+ +

3. Building Python and Other Known Bugs

3.1. Is there a test set? +
3.2. When running the test set, I get complaints about floating point operations, but when playing with floating point operations I cannot find anything wrong with them. +
3.3. Link errors after rerunning the configure script. +
3.4. The python interpreter complains about options passed to a script (after the script name). +
3.5. When building on the SGI, make tries to run python to create glmodule.c, but python hasn't been built or installed yet. +
3.6. I use VPATH but some targets are built in the source directory. +
3.7. Trouble building or linking with the GNU readline library. +
3.8. Trouble with socket I/O on older Linux 1.x versions. +
3.9. Trouble with prototypes on Ultrix. +
3.10. Other trouble building Python on platform X. +
3.11. How to configure dynamic loading on Linux. +
3.12. I can't get shared modules to work on Linux 2.0 (Slackware96)? +
3.13. Trouble when making modules shared on Linux. +
3.14. [deleted] +
3.15. Errors when linking with a shared library containing C++ code. +
3.16. Deleted +
3.17. Deleted. +
3.18. Compilation or link errors for the _tkinter module +
3.19. I configured and built Python for Tcl/Tk but "import Tkinter" fails. +
3.20. [deleted] +
3.21. Several common system calls are missing from the posix module. +
3.22. ImportError: No module named string, on MS Windows. +
3.23. Core dump on SGI when using the gl module. +
3.24. "Initializer not a constant" while building DLL on MS-Windows +
3.25. Output directed to a pipe or file disappears on Linux. +
3.26. [deleted] +
3.27. [deleted] +
3.28. How can I test if Tkinter is working? +
3.29. Is there a way to get the interactive mode of the python interpreter to perform function/variable name completion? +
3.30. Why is the Python interpreter not built as a shared library? +
3.31. Build with GCC on Solaris 2.6 (SunOS 5.6) fails +
3.32. Running "make clean" seems to leave problematic files that cause subsequent builds to fail. +
3.33. Submitting bug reports and patches +
3.34. I can't load shared libraries under Python 1.5.2, Solaris 7, and gcc 2.95.2 +
3.35. In the regression test, test___all__ fails for the profile module. What's wrong? +
3.36. relocations remain against allocatable but non-writable sections + +

+ +

4. Programming in Python

4.1. Is there a source code level debugger with breakpoints, step, etc.? +
4.2. Can I create an object class with some methods implemented in C and others in Python (e.g. through inheritance)? (Also phrased as: Can I use a built-in type as base class?) +
4.3. Is there a curses/termcap package for Python? +
4.4. Is there an equivalent to C's onexit() in Python? +
4.5. [deleted] +
4.6. How do I iterate over a sequence in reverse order? +
4.7. My program is too slow. How do I speed it up? +
4.8. When I have imported a module, then edit it, and import it again (into the same Python process), the changes don't seem to take place. What is going on? +
4.9. How do I find the current module name? +
4.10. I have a module in which I want to execute some extra code when it is run as a script. How do I find out whether I am running as a script? +
4.11. I try to run a program from the Demo directory but it fails with ImportError: No module named ...; what gives? +
4.12. [deleted] +
4.13. What GUI toolkits exist for Python? +
4.14. Are there any interfaces to database packages in Python? +
4.15. Is it possible to write obfuscated one-liners in Python? +
4.16. Is there an equivalent of C's "?:" ternary operator? +
4.17. My class defines __del__ but it is not called when I delete the object. +
4.18. How do I change the shell environment for programs called using os.popen() or os.system()? Changing os.environ doesn't work. +
4.19. What is a class? +
4.20. What is a method? +
4.21. What is self? +
4.22. What is an unbound method? +
4.23. How do I call a method defined in a base class from a derived class that overrides it? +
4.24. How do I call a method from a base class without using the name of the base class? +
4.25. How can I organize my code to make it easier to change the base class? +
4.26. How can I find the methods or attributes of an object? +
4.27. I can't seem to use os.read() on a pipe created with os.popen(). +
4.28. How can I create a stand-alone binary from a Python script? +
4.29. What WWW tools are there for Python? +
4.30. How do I run a subprocess with pipes connected to both input and output? +
4.31. How do I call a function if I have the arguments in a tuple? +
4.32. How do I enable font-lock-mode for Python in Emacs? +
4.33. Is there a scanf() or sscanf() equivalent? +
4.34. Can I have Tk events handled while waiting for I/O? +
4.35. How do I write a function with output parameters (call by reference)? +
4.36. Please explain the rules for local and global variables in Python. +
4.37. How can I have modules that mutually import each other? +
4.38. How do I copy an object in Python? +
4.39. How to implement persistent objects in Python? (Persistent == automatically saved to and restored from disk.) +
4.40. I try to use __spam and I get an error about _SomeClassName__spam. +
4.41. How do I delete a file? And other file questions. +
4.42. How to modify urllib or httplib to support HTTP/1.1? +
4.43. Unexplicable syntax errors in compile() or exec. +
4.44. How do I convert a string to a number? +
4.45. How do I convert a number to a string? +
4.46. How do I copy a file? +
4.47. How do I check if an object is an instance of a given class or of a subclass of it? +
4.48. What is delegation? +
4.49. How do I test a Python program or component. +
4.50. My multidimensional list (array) is broken! What gives? +
4.51. I want to do a complicated sort: can you do a Schwartzian Transform in Python? +
4.52. How to convert between tuples and lists? +
4.53. Files retrieved with urllib contain leading garbage that looks like email headers. +
4.54. How do I get a list of all instances of a given class? +
4.55. A regular expression fails with regex.error: match failure. +
4.56. I can't get signal handlers to work. +
4.57. I can't use a global variable in a function? Help! +
4.58. What's a negative index? Why doesn't list.insert() use them? +
4.59. How can I sort one list by values from another list? +
4.60. Why doesn't dir() work on builtin types like files and lists? +
4.61. How can I mimic CGI form submission (METHOD=POST)? +
4.62. If my program crashes with a bsddb (or anydbm) database open, it gets corrupted. How come? +
4.63. How do I make a Python script executable on Unix? +
4.64. How do you remove duplicates from a list? +
4.65. Are there any known year 2000 problems in Python? +
4.66. I want a version of map that applies a method to a sequence of objects! Help! +
4.67. How do I generate random numbers in Python? +
4.68. How do I access the serial (RS232) port? +
4.69. Images on Tk-Buttons don't work in Py15? +
4.70. Where is the math.py (socket.py, regex.py, etc.) source file? +
4.71. How do I send mail from a Python script? +
4.72. How do I avoid blocking in connect() of a socket? +
4.73. How do I specify hexadecimal and octal integers? +
4.74. How to get a single keypress at a time? +
4.75. How can I overload constructors (or methods) in Python? +
4.76. How do I pass keyword arguments from one method to another? +
4.77. What module should I use to help with generating HTML? +
4.78. How do I create documentation from doc strings? +
4.79. How do I read (or write) binary data? +
4.80. I can't get key bindings to work in Tkinter +
4.81. "import crypt" fails +
4.82. Are there coding standards or a style guide for Python programs? +
4.83. How do I freeze Tkinter applications? +
4.84. How do I create static class data and static class methods? +
4.85. __import__('x.y.z') returns <module 'x'>; how do I get z? +
4.86. Basic thread wisdom +
4.87. Why doesn't closing sys.stdout (stdin, stderr) really close it? +
4.88. What kinds of global value mutation are thread-safe? +
4.89. How do I modify a string in place? +
4.90. How to pass on keyword/optional parameters/arguments +
4.91. How can I get a dictionary to display its keys in a consistent order? +
4.92. Is there a Python tutorial? +
4.93. Deleted +
4.94. How do I get a single keypress without blocking? +
4.95. Is there an equivalent to Perl chomp()? (Remove trailing newline from string) +
4.96. Why is join() a string method when I'm really joining the elements of a (list, tuple, sequence)? +
4.97. How can my code discover the name of an object? +
4.98. Why are floating point calculations so inaccurate? +
4.99. I tried to open Berkeley DB file, but bsddb produces bsddb.error: (22, 'Invalid argument'). Help! How can I restore my data? +
4.100. What are the "best practices" for using import in a module? +
4.101. Is there a tool to help find bugs or perform static analysis? +
4.102. UnicodeError: ASCII [decoding,encoding] error: ordinal not in range(128) +
4.103. Using strings to call functions/methods +
4.104. How fast are exceptions? +
4.105. Sharing global variables across modules +
4.106. Why is cPickle so slow? +
4.107. When importing module XXX, why do I get "undefined symbol: PyUnicodeUCS2_..." ? +
4.108. How do I create a .pyc file? + +

+ +

5. Extending Python

5.1. Can I create my own functions in C? +
5.2. Can I create my own functions in C++? +
5.3. How can I execute arbitrary Python statements from C? +
5.4. How can I evaluate an arbitrary Python expression from C? +
5.5. How do I extract C values from a Python object? +
5.6. How do I use Py_BuildValue() to create a tuple of arbitrary length? +
5.7. How do I call an object's method from C? +
5.8. How do I catch the output from PyErr_Print() (or anything that prints to stdout/stderr)? +
5.9. How do I access a module written in Python from C? +
5.10. How do I interface to C++ objects from Python? +
5.11. mSQLmodule (or other old module) won't build with Python 1.5 (or later) +
5.12. I added a module using the Setup file and the make fails! Huh? +
5.13. I want to compile a Python module on my Red Hat Linux system, but some files are missing. +
5.14. What does "SystemError: _PyImport_FixupExtension: module yourmodule not loaded" mean? +
5.15. How to tell "incomplete input" from "invalid input"? +
5.16. How do I debug an extension? +
5.17. How do I find undefined Linux g++ symbols, __builtin_new or __pure_virtural +
5.18. How do I define and create objects corresponding to built-in/extension types + +

+ +

6. Python's design

6.1. Why isn't there a switch or case statement in Python? +
6.2. Why does Python use indentation for grouping of statements? +
6.3. Why are Python strings immutable? +
6.4. Delete +
6.5. Why does Python use methods for some functionality (e.g. list.index()) but functions for other (e.g. len(list))? +
6.6. Why can't I derive a class from built-in types (e.g. lists or files)? +
6.7. Why must 'self' be declared and used explicitly in method definitions and calls? +
6.8. Can't you emulate threads in the interpreter instead of relying on an OS-specific thread implementation? +
6.9. Why can't lambda forms contain statements? +
6.10. [deleted] +
6.11. [deleted] +
6.12. Why is there no more efficient way of iterating over a dictionary than first constructing the list of keys()? +
6.13. Can Python be compiled to machine code, C or some other language? +
6.14. How does Python manage memory? +
6.15. Why are there separate tuple and list data types? +
6.16. How are lists implemented? +
6.17. How are dictionaries implemented? +
6.18. Why must dictionary keys be immutable? +
6.19. How the heck do you make an array in Python? +
6.20. Why doesn't list.sort() return the sorted list? +
6.21. How do you specify and enforce an interface spec in Python? +
6.22. Why do all classes have the same type? Why do instances all have the same type? +
6.23. Why isn't all memory freed when Python exits? +
6.24. Why no class methods or mutable class variables? +
6.25. Why are default values sometimes shared between objects? +
6.26. Why no goto? +
6.27. How do you make a higher order function in Python? +
6.28. Why do I get a SyntaxError for a 'continue' inside a 'try'? +
6.29. Why can't raw strings (r-strings) end with a backslash? +
6.30. Why can't I use an assignment in an expression? +
6.31. Why doesn't Python have a "with" statement like some other languages? +
6.32. Why are colons required for if/while/def/class? +
6.33. Can't we get rid of the Global Interpreter Lock? + +

+ +

7. Using Python on non-UNIX platforms

7.1. Is there a Mac version of Python? +
7.2. Are there DOS and Windows versions of Python? +
7.3. Is there an OS/2 version of Python? +
7.4. Is there a VMS version of Python? +
7.5. What about IBM mainframes, or other non-UNIX platforms? +
7.6. Where are the source or Makefiles for the non-UNIX versions? +
7.7. What is the status and support for the non-UNIX versions? +
7.8. I have a PC version but it appears to be only a binary. Where's the library? +
7.9. Where's the documentation for the Mac or PC version? +
7.10. How do I create a Python program file on the Mac or PC? +
7.11. How can I use Tkinter on Windows 95/NT? +
7.12. cgi.py (or other CGI programming) doesn't work sometimes on NT or win95! +
7.13. Why doesn't os.popen() work in PythonWin on NT? +
7.14. How do I use different functionality on different platforms with the same program? +
7.15. Is there an Amiga version of Python? +
7.16. Why doesn't os.popen()/win32pipe.popen() work on Win9x? + +

+ +

8. Python on Windows

8.1. Using Python for CGI on Microsoft Windows +
8.2. How to check for a keypress without blocking? +
8.3. $PYTHONPATH +
8.4. dedent syntax errors +
8.5. How do I emulate os.kill() in Windows? +
8.6. Why does os.path.isdir() fail on NT shared directories? +
8.7. PyRun_SimpleFile() crashes on Windows but not on Unix +
8.8. Import of _tkinter fails on Windows 95/98 +
8.9. Can't extract the downloaded documentation on Windows +
8.10. Can't get Py_RunSimpleFile() to work. +
8.11. Where is Freeze for Windows? +
8.12. Is a *.pyd file the same as a DLL? +
8.13. Missing cw3215mt.dll (or missing cw3215.dll) +
8.14. How to make python scripts executable: +
8.15. Warning about CTL3D32 version from installer +
8.16. How can I embed Python into a Windows application? +
8.17. Setting up IIS 5 to use Python for CGI +
8.18. How do I run a Python program under Windows? + +

+ +

1. General information and availability

+ +

1.1. What is Python?

+Python is an interpreted, interactive, object-oriented programming +language. It incorporates modules, exceptions, dynamic typing, very +high level dynamic data types, and classes. Python combines +remarkable power with very clear syntax. It has interfaces to many +system calls and libraries, as well as to various window systems, and +is extensible in C or C++. It is also usable as an extension language +for applications that need a programmable interface. Finally, Python +is portable: it runs on many brands of UNIX, on the Mac, and on PCs +under MS-DOS, Windows, Windows NT, and OS/2. +

+To find out more, the best thing to do is to start reading the +tutorial from the documentation set (see a few questions further +down). +

+See also question 1.17 (what is Python good for). +

+ +Edit this entry / +Log info + +/ Last changed on Mon May 26 16:05:18 1997 by +GvR +

+ +

1.2. Why is it called Python?

+Apart from being a computer scientist, I'm also a fan of "Monty +Python's Flying Circus" (a BBC comedy series from the seventies, in +the -- unlikely -- case you didn't know). It occurred to me one day +that I needed a name that was short, unique, and slightly mysterious. +And I happened to be reading some scripts from the series at the +time... So then I decided to call my language Python. +

+By now I don't care any more whether you use a Python, some other +snake, a foot or 16-ton weight, or a wood rat as a logo for Python! +

+ +Edit this entry / +Log info + +/ Last changed on Thu Aug 24 00:50:41 2000 by +GvR +

+ +

1.3. How do I obtain a copy of the Python source?

+The latest Python source distribution is always available from +python.org, at http://www.python.org/download. The latest development sources can be obtained via anonymous CVS from SourceForge, at http://www.sf.net/projects/python . +

+The source distribution is a gzipped tar file containing the complete C source, LaTeX +documentation, Python library modules, example programs, and several +useful pieces of freely distributable software. This will compile and +run out of the box on most UNIX platforms. (See section 7 for +non-UNIX information.) +

+Older versions of Python are also available from python.org. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Apr 9 17:06:16 2002 by +A.M. Kuchling +

+ +

1.4. How do I get documentation on Python?

+All documentation is available on-line, starting at http://www.python.org/doc/. +

+The LaTeX source for the documentation is part of the source +distribution. If you don't have LaTeX, the latest Python +documentation set is available, in various formats like postscript +and html, by anonymous ftp - visit the above URL for links to the +current versions. +

+PostScript for a high-level description of Python is in the file nluug-paper.ps +(a separate file on the ftp site). +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jan 21 12:02:55 1998 by +Ken Manheimer +

+ +

1.5. Are there other ftp sites that mirror the Python distribution?

+The following anonymous ftp sites keep mirrors of the Python +distribution: +

+USA: +

+        ftp://ftp.python.org/pub/python/
+        ftp://gatekeeper.dec.com/pub/plan/python/
+        ftp://ftp.uu.net/languages/python/
+        ftp://ftp.wustl.edu/graphics/graphics/sgi-stuff/python/
+        ftp://ftp.sterling.com/programming/languages/python/
+        ftp://uiarchive.cso.uiuc.edu/pub/lang/python/
+        ftp://ftp.pht.com/mirrors/python/python/
+	ftp://ftp.cdrom.com/pub/python/
+

+Europe: +

+        ftp://ftp.cwi.nl/pub/python/
+        ftp://ftp.funet.fi/pub/languages/python/
+        ftp://ftp.sunet.se/pub/lang/python/
+        ftp://unix.hensa.ac.uk/mirrors/uunet/languages/python/
+        ftp://ftp.lip6.fr/pub/python/
+        ftp://sunsite.cnlab-switch.ch/mirror/python/
+        ftp://ftp.informatik.tu-muenchen.de/pub/comp/programming/languages/python/
+

+Australia: +

+        ftp://ftp.dstc.edu.au/pub/python/
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Mar 24 09:20:49 1999 by +A.M. Kuchling +

+ +

1.6. Is there a newsgroup or mailing list devoted to Python?

+There is a newsgroup, comp.lang.python, +and a mailing list. The newsgroup and mailing list are gatewayed into +each other -- if you can read news it's unnecessary to subscribe to +the mailing list. To subscribe to the mailing list +(python-list@python.org) visit its Mailman webpage at +http://www.python.org/mailman/listinfo/python-list +

+More info about the newsgroup and mailing list, and about other lists, +can be found at +http://www.python.org/psa/MailingLists.html. +

+Archives of the newsgroup are kept by Deja News and accessible +through the "Python newsgroup search" web page, +http://www.python.org/search/search_news.html. +This page also contains pointer to other archival collections. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jun 23 09:29:36 1999 by +GvR +

+ +

1.7. Is there a WWW page devoted to Python?

+Yes, http://www.python.org/ is the official Python home page. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 14:42:59 1997 by +Ken Manheimer +

+ +

1.8. Is the Python documentation available on the WWW?

+Yes. Python 2.0 documentation is available from +http://www.pythonlabs.com/tech/python2.0/doc/ and from +http://www.python.org/doc/. Note that most documentation +is available for on-line browsing as well as for downloading. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 03:14:08 2001 by +Moshe Zadka +

+ +

1.9. Are there any books on Python?

+Yes, many, and more are being published. See +the python.org Wiki at http://www.python.org/cgi-bin/moinmoin/PythonBooks for a list. +

+You can also search online bookstores for "Python" +(and filter out the Monty Python references; or +perhaps search for "Python" and "language"). +

+ +Edit this entry / +Log info + +/ Last changed on Mon Aug 5 19:08:49 2002 by +amk +

+ +

1.10. Are there any published articles about Python that I can reference?

+If you can't reference the web site, and you don't want to reference the books +(see previous question), there are several articles on Python that you could +reference. +

+Most publications about Python are collected on the Python web site: +

+    http://www.python.org/doc/Publications.html
+

+It is no longer recommended to reference this +very old article by Python's author: +

+    Guido van Rossum and Jelke de Boer, "Interactively Testing Remote
+    Servers Using the Python Programming Language", CWI Quarterly, Volume
+    4, Issue 4 (December 1991), Amsterdam, pp 283-303.
+

+ +Edit this entry / +Log info + +/ Last changed on Sat Jul 4 20:52:31 1998 by +GvR +

+ +

1.11. Are there short introductory papers or talks on Python?

+There are several - you can find links to some of them collected at +http://www.python.org/doc/Hints.html#intros. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 15:04:05 1997 by +Ken Manheimer +

+ +

1.12. How does the Python version numbering scheme work?

+Python versions are numbered A.B.C or A.B. A is the major version +number -- it is only incremented for really major changes in the +language. B is the minor version number, incremented for less +earth-shattering changes. C is the micro-level -- it is +incremented for each bugfix release. See PEP 6 for more information +about bugfix releases. +

+Not all releases have bugfix releases. +Note that in the past (ending with 1.5.2), +micro releases have added significant changes; +in fact the changeover from 0.9.9 to 1.0.0 was the first time +that either A or B changed! +

+Alpha, beta and release candidate versions have an additional suffixes. +The suffix for an alpha version is "aN" for some small number N, the +suffix for a beta version is "bN" for some small number N, and the +suffix for a release candidate version is "cN" for some small number N. +

+Note that (for instance) all versions labeled 2.0aN precede the +versions labeled 2.0bN, which precede versions labeled 2.0cN, and +those precede 2.0. +

+As a rule, no changes are made between release candidates and the final +release unless there are show-stopper bugs. +

+You may also find version numbers with a "+" suffix, e.g. "2.2+". +These are unreleased versions, built directly from the CVS trunk. +

+See also the documentation for sys.version, sys.hexversion, and +sys.version_info. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jan 14 06:34:17 2002 by +GvR +

+ +

1.13. How do I get a beta test version of Python?

+All releases, including alphas, betas and release candidates, are announced on +comp.lang.python and comp.lang.python.announce newsgroups, +which are gatewayed into the python-list@python.org and +python-announce@python.org. In addition, all these announcements appear on +the Python home page, at http://www.python.org. +

+You can also access the development version of Python through CVS. See http://sourceforge.net/cvs/?group_id=5470 for details. If you're not familiar with CVS, documents like http://linux.oreillynet.com/pub/a/linux/2002/01/03/cvs_intro.html +provide an introduction. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 00:57:08 2002 by +Neal Norwitz +

+ +

1.14. Are there copyright restrictions on the use of Python?

+Hardly. You can do anything you want with the source, as long as +you leave the copyrights in, and display those copyrights in any +documentation about Python that you produce. Also, don't use the +author's institute's name in publicity without prior written +permission, and don't hold them responsible for anything (read the +actual copyright for a precise legal wording). +

+In particular, if you honor the copyright rules, it's OK to use Python +for commercial use, to sell copies of Python in source or binary form, +or to sell products that enhance Python or incorporate Python (or part +of it) in some form. I would still like to know about all commercial +use of Python! +

+ +Edit this entry / +Log info +

+ +

1.15. Why was Python created in the first place?

+Here's a very brief summary of what got me started: +

+I had extensive experience with implementing an interpreted language +in the ABC group at CWI, and from working with this group I had +learned a lot about language design. This is the origin of many +Python features, including the use of indentation for statement +grouping and the inclusion of very-high-level data types (although the +details are all different in Python). +

+I had a number of gripes about the ABC language, but also liked many +of its features. It was impossible to extend the ABC language (or its +implementation) to remedy my complaints -- in fact its lack of +extensibility was one of its biggest problems. +I had some experience with using Modula-2+ and talked with the +designers of Modula-3 (and read the M3 report). M3 is the origin of +the syntax and semantics used for exceptions, and some other Python +features. +

+I was working in the Amoeba distributed operating system group at +CWI. We needed a better way to do system administration than by +writing either C programs or Bourne shell scripts, since Amoeba had +its own system call interface which wasn't easily accessible from the +Bourne shell. My experience with error handling in Amoeba made me +acutely aware of the importance of exceptions as a programming +language feature. +

+It occurred to me that a scripting language with a syntax like ABC +but with access to the Amoeba system calls would fill the need. I +realized that it would be foolish to write an Amoeba-specific +language, so I decided that I needed a language that was generally +extensible. +

+During the 1989 Christmas holidays, I had a lot of time on my hand, +so I decided to give it a try. During the next year, while still +mostly working on it in my own time, Python was used in the Amoeba +project with increasing success, and the feedback from colleagues made +me add many early improvements. +

+In February 1991, after just over a year of development, I decided +to post to USENET. The rest is in the Misc/HISTORY file. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 00:06:23 1997 by +GvR +

+ +

1.16. Do I have to like "Monty Python's Flying Circus"?

+No, but it helps. Pythonistas like the occasional reference to SPAM, +and of course, nobody expects the Spanish Inquisition +

+The two main reasons to use Python are: +

+ - Portable
+ - Easy to learn
+

+The three main reasons to use Python are: +

+ - Portable
+ - Easy to learn
+ - Powerful standard library
+

+(And nice red uniforms.) +

+And remember, there is no rule six. +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 28 10:39:21 1997 by +GvR +

+ +

1.17. What is Python good for?

+Python is used in many situations where a great deal of dynamism, +ease of use, power, and flexibility are required. +

+In the area of basic text +manipulation core Python (without any non-core extensions) is easier +to use and is roughly as fast as just about any language, and this makes Python +good for many system administration type tasks and for CGI programming +and other application areas that manipulate text and strings and such. +

+When augmented with +standard extensions (such as PIL, COM, Numeric, oracledb, kjbuckets, +tkinter, win32api, etc.) +or special purpose extensions (that you write, perhaps using helper tools such +as SWIG, or using object protocols such as ILU/CORBA or COM) Python +becomes a very convenient "glue" or "steering" +language that helps make heterogeneous collections of unrelated +software packages work together. +For example by combining Numeric with oracledb you can help your +SQL database do statistical analysis, or even Fourier transforms. +One of the features that makes Python excel in the "glue language" role +is Python's simple, usable, and powerful C language runtime API. +

+Many developers also use Python extensively as a graphical user +interface development aide. +

+ +Edit this entry / +Log info + +/ Last changed on Sat May 24 10:13:11 1997 by +Aaron Watters +

+ +

1.18. Can I use the FAQ Wizard software to maintain my own FAQ?

+Sure. It's in Tools/faqwiz/ of the python source tree. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Mar 29 06:50:32 2002 by +Aahz +

+ +

1.19. Which editor has good support for editing Python source code?

+On Unix, the first choice is Emacs/XEmacs. There's an elaborate +mode for editing Python code, which is available from the Python +source distribution (Misc/python-mode.el). It's also bundled +with XEmacs (we're still working on legal details to make it possible +to bundle it with FSF Emacs). And it has its own web page: +

+    http://www.python.org/emacs/python-mode/index.html
+

+There are many other choices, for Unix, Windows or Macintosh. +Richard Jones compiled a table from postings on the Python newsgroup: +

+    http://www.bofh.asn.au/~richard/editors.html
+

+See also FAQ question 7.10 for some more Mac and Win options. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 15 23:21:04 1998 by +Gvr +

+ +

1.20. I've never programmed before. Is there a Python tutorial?

+There are several, and at least one book. +All information for beginning Python programmers is collected here: +

+    http://www.python.org/doc/Newbies.html
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Sep 5 05:34:07 2001 by +GvR +

+ +

1.21. Where in the world is www.python.org located?

+It's currently in Amsterdam, graciously hosted by XS4ALL: +

+    http://www.xs4all.nl
+

+Thanks to Thomas Wouters for setting this up!!!! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Aug 3 21:49:27 2001 by +GvR +

+ +

2. Python in the real world

+ +

2.1. How many people are using Python?

+Certainly thousands, and quite probably tens of thousands of users. +More are seeing the light each day. The comp.lang.python newsgroup is +very active, but overall there is no accurate estimate of the number of subscribers or Python users. +

+Jacek Artymiak has created a Python Users Counter; you can see the +current count by visiting +http://www.wszechnica.safenet.pl/cgi-bin/checkpythonuserscounter.py +(this will not increment the counter; use the link there if you haven't +added yourself already). Most Python users appear not to have registered themselves. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Feb 21 23:29:18 2002 by +GvR +

+ +

2.2. Have any significant projects been done in Python?

+At CWI (the former home of Python), we have written a 20,000 line +authoring environment for transportable hypermedia presentations, a +5,000 line multimedia teleconferencing tool, as well as many many +smaller programs. +

+At CNRI (Python's new home), we have written two large applications: +Grail, a fully featured web browser (see +http://grail.cnri.reston.va.us), +and the Knowbot Operating Environment, +a distributed environment for mobile code. +

+The University of Virginia uses Python to control a virtual reality +engine. See http://alice.cs.cmu.edu. +

+The ILU project at Xerox PARC can generate Python glue for ILU +interfaces. See ftp://ftp.parc.xerox.com/pub/ilu/ilu.html. ILU +is a free CORBA compliant ORB which supplies distributed object +connectivity to a host of platforms using a host of languages. +

+Mark Hammond and Greg Stein and others are interfacing Python to +Microsoft's COM and ActiveX architectures. This means, among other +things, that Python may be used in active server pages or as a COM +controller (for example to automatically extract from or insert information +into Excel or MSAccess or any other COM aware application). +Mark claims Python can even be a ActiveX scripting host (which +means you could embed JScript inside a Python application, if you +had a strange sense of humor). Python/AX/COM is distributed as part +of the PythonWin distribution. +

+The University of California, Irvine uses a student administration +system called TELE-Vision written entirely in Python. Contact: Ray +Price rlprice@uci.edu. +

+The Melbourne Cricket Ground (MCG) in Australia (a 100,000+ person venue) +has it's scoreboard system written largely in Python on MS Windows. +Python expressions are used to create almost every scoring entry that +appears on the board. The move to Python/C++ away from exclusive C++ +has provided a level of functionality that would simply not have been +viable otherwise. +

+See also the next question. +

+Note: this FAQ entry is really old. +See http://www.python.org/psa/Users.html for a more recent list. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Oct 25 13:24:15 2000 by +GvR +

+ +

2.3. Are there any commercial projects going on using Python?

+Yes, there's lots of commercial activity using Python. See +http://www.python.org/psa/Users.html for a list. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Oct 14 18:17:33 1998 by +ken +

+ +

2.4. How stable is Python?

+Very stable. New, stable releases have been coming out roughly every 3 to 12 months since 1991, and this seems likely to continue. +

+With the introduction of retrospective "bugfix" releases the stability of the language implementations can be, and is being, improved independently of the new features offered by more recent major or minor releases. Bugfix releases, indicated by a third component of the version number, only fix known problems and do not gratuitously introduce new and possibly incompatible features or modified library functionality. +

+Release 2.2 got its first bugfix on April 10, 2002. The new version +number is now 2.2.1. The 2.1 release, at 2.1.3, can probably be +considered the "most stable" platform because it has been bugfixed +twice. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jul 23 10:20:04 2002 by +Jens Kubieziel +

+ +

2.5. What new developments are expected for Python in the future?

+See http://www.python.org/peps/ for the Python Enhancement +Proposals (PEPs). PEPs are design +documents +describing a suggested new feature for Python, providing +a concise technical specification and a rationale. +

+Also, follow the discussions on the python-dev mailing list. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Apr 9 17:09:51 2002 by +A.M. Kuchling +

+ +

2.6. Is it reasonable to propose incompatible changes to Python?

+In general, no. There are already millions of lines of Python code +around the world, so any changes in the language that invalidates more +than a very small fraction of existing programs has to be frowned +upon. Even if you can provide a conversion program, there still is +the problem of updating all documentation. Providing a gradual +upgrade path is the only way if a feature has to be changed. +

+See http://www.python.org/peps/pep-0005.html for the proposed +mechanism for creating backwards-incompatibilities. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Apr 1 22:13:47 2002 by +Fred Drake +

+ +

2.7. What is the future of Python?

+Please see http://www.python.org/peps/ for proposals of future +activities. One of the PEPs (Python Enhancement Proposals) deals +with the PEP process and PEP format -- see +http://www.python.org/peps/pep-0001.html if you want to +submit a PEP. In http://www.python.org/peps/pep-0042.html there +is a list of wishlists the Python Development team plans to tackle. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Apr 1 22:15:46 2002 by +Fred Drake +

+ +

2.8. What was the PSA, anyway?

+The Python Software Activity was +created by a number of Python aficionados who want Python to be more +than the product and responsibility of a single individual. +The PSA was not an independent organization, but lived +under the umbrealla of CNRI. +

+The PSA has been superseded by the Python Software Foundation, +an independent non-profit organization. The PSF's home page +is at http://www.python.org/psf/. +

+Some pages created by the PSA still live at +http://www.python.org/psa/ +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jul 25 18:19:44 2002 by +GvR +

+ +

2.9. Deleted

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 02:51:30 2001 by +Moshe Zadka +

+ +

2.10. Deleted

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 02:52:19 2001 by +Moshe Zadka +

+ +

2.11. Is Python Y2K (Year 2000) Compliant?

+As of January, 2001 no major problems have been reported and Y2K +compliance seems to be a non-issue. +

+Since Python is available free of charge, there are no absolute +guarantees. If there are unforeseen problems, liability is the +user's rather than the developers', and there is nobody you can sue for damages. +

+Python does few +date manipulations, and what it does is all based on the Unix +representation for time (even on non-Unix systems) which uses seconds +since 1970 and won't overflow until 2038. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jan 8 17:19:32 2001 by +Steve Holden +

+ +

2.12. Is Python a good language in a class for beginning programmers?

+Yes. This long answer attempts to address any concerns you might +have with teaching Python as a programmer's first language. +(If you want to discuss Python's use in education, then +you may be interested in joining the edu-sig mailinglist. +See http://www.python.org/sigs/edu-sig/ ) +

+It is still common to start students with a procedural +(subset of a) statically typed language such as Pascal, C, or +a subset of C++ or Java. I think that students may be better +served by learning Python as their first language. Python has +a very simple and consistent syntax and a large standard library. +Most importantly, using Python in a beginning programming course +permits students to concentrate on important programming skills, +such as problem decomposition and data type design. +

+With Python, students can be quickly introduced to basic concepts +such as loops and procedures. They can even probably work with +user-defined objects in their very first course. They could +implement a tree structure as nested Python lists, for example. +They could be introduced to objects in their first course if +desired. For a student who has never programmed before, using +a statically typed language seems unnatural. It presents +additional complexity that the student must master and slows +the pace of the course. The students are trying to learn to +think like a computer, decompose problems, design consistent +interfaces, and encapsulate data. While learning to use a +statically typed language is important, it is not necessarily the +best topic to address in the students' first programming course. +

+Many other aspects of Python make it a good first language. +Python has a large standard library (like Java) so that +students can be assigned programming projects very early in the +course that do something. Assignments aren't restricted to the +standard four-function calculator and check balancing programs. +By using the standard library, students can gain the satisfaction +of working on realistic applications as they learn the fundamentals +of programming. Using the standard library also teaches students +about code reuse. +

+Python's interactive interpreter also enables students to +test language features while they're programming. They can keep +a window with the interpreter running while they enter their +programs' source in another window. If they can't remember the +methods for a list, they can do something like this: +

+ >>> L = []
+ >>> dir(L)
+ ['append', 'count', 'extend', 'index', 'insert', 'pop', 'remove',
+ 'reverse', 'sort']
+ >>> print L.append.__doc__
+ L.append(object) -- append object to end
+ >>> L.append(1)
+ >>> L
+ [1]
+

+With the interpreter, documentation is never far from the +student as he's programming. +

+There are also good IDEs for Python. Guido van Rossum's IDLE +is a cross-platform IDE for Python that is written in Python +using Tk. There is also a Windows specific IDE called PythonWin. +Emacs users will be happy to know that there is a very good Python +mode for Emacs. All of these programming environments provide +syntax highlighting, auto-indenting, and access to the interactive +interpreter while coding. For more information about IDEs, see XXX. +

+If your department is currently using Pascal because it was +designed to be a teaching language, then you'll be happy to +know that Guido van Rossum designed Python to be simple to +teach to everyone but powerful enough to implement real world +applications. Python makes a good language for first time +programmers because that was one of Python's design goals. +There are papers at http://www.python.org/doc/essays/ on the Python website +by Python's creator explaining his objectives for the language. +One that may interest you is titled "Computer Programming for Everybody" +http://www.python.org/doc/essays/cp4e.html +

+If you're seriously considering Python as a language for your +school, Guido van Rossum may even be willing to correspond with +you about how the language would fit in your curriculum. +See http://www.python.org/doc/FAQ.html#2.2 for examples of +Python's use in the "real world." +

+While Python, its source code, and its IDEs are freely +available, this consideration should not rule +out other languages. There are other free languages (Java, +free C compilers), and many companies are willing to waive some +or all of their fees for student programming tools if it +guarantees that a whole graduating class will know how to +use their tools. That is, if one of the requirements for +the language that will be taught is that it be freely +available, then Python qualifies, but this requirement +does not preclude other languages. +

+While Python jobs may not be as prevalent as C/C++/Java jobs, +teachers should not worry about teaching students critical job +skills in their first course. The skills that win students a +job are those they learn in their senior classes and internships. +Their first programming courses are there to lay a solid +foundation in programming fundamentals. The primary question +in choosing the language for such a course should be which +language permits the students to learn this material without +hindering or limiting them. +

+Another argument for Python is that there are many tasks for +which something like C++ is overkill. That's where languages +like Python, Perl, Tcl, and Visual Basic thrive. It's critical +for students to know something about these languages. (Every +employer for whom I've worked used at least one such language.) +Of the languages listed above, Python probably makes the best +language in a programming curriculum since its syntax is simple, +consistent, and not unlike other languages (C/C++/Java) that +are probably in the curriculum. By starting students with +Python, a department simultaneously lays the foundations for +other programming courses and introduces students to the type +of language that is often used as a "glue" language. As an +added bonus, Python can be used to interface with Microsoft's +COM components (thanks to Mark Hammond). There is also Jython, +a Java implementation of the Python interpreter, that can be +used to connect Java components. +

+If you currently start students with Pascal or C/C++ or Java, +you may be worried they will have trouble learning a statically +typed language after starting with Python. I think that this +fear most often stems from the fact that the teacher started +with a statically typed language, and we tend to like to teach +others in the same way we were taught. In reality, the +transition from Python to one of these other languages is +quite simple. +

+To motivate a statically typed language such as C++, begin the +course by explaining that unlike Python, their first language, +C++ is compiled to a machine dependent executable. Explain +that the point is to make a very fast executable. To permit +the compiler to make optimizations, programmers must help it +by specifying the "types" of variables. By restricting each +variable to a specific type, the compiler can reduce the +book-keeping it has to do to permit dynamic types. The compiler +also has to resolve references at compile time. Thus, the +language gains speed by sacrificing some of Python's dynamic +features. Then again, the C++ compiler provides type safety +and catches many bugs at compile time instead of run time (a +critical consideration for many commercial applications). C++ +is also designed for very large programs where one may want to +guarantee that others don't touch an object's implementation. +C++ provides very strong language features to separate an object's +implementation from its interface. Explain why this separation +is a good thing. +

+The first day of a C++ course could then be a whirlwind introduction +to what C++ requires and provides. The point here is that after +a semester or two of Python, students are hopefully competent +programmers. They know how to handle loops and write procedures. +They've also worked with objects, thought about the benefits of +consistent interfaces, and used the technique of subclassing to +specialize behavior. Thus, a whirlwind introduction to C++ could +show them how objects and subclassing looks in C++. The +potentially difficult concepts of object-oriented design were +taught without the additional obstacles presented by a language +such as C++ or Java. When learning one of these languages, +the students would already understand the "road map." They +understand objects; they would just be learning how objects +fit in a statically typed languages. Language requirements +and compiler errors that seem unnatural to beginning programmers +make sense in this new context. Many students will find it +helpful to be able to write a fast prototype of their algorithms +in Python. Thus, they can test and debug their ideas before +they attempt to write the code in the new language, saving the +effort of working with C++ types for when they've discovered a +working solution for their assignments. When they get annoyed +with the rigidity of types, they'll be happy to learn about +containers and templates to regain some of the lost flexibility +Python afforded them. Students may also gain an appreciation +for the fact that no language is best for every task. They'll +see that C++ is faster, but they'll know that they can gain +flexibility and development speed with a Python when execution +speed isn't critical. +

+If you have any concerns that weren't addressed here, try +posting to the Python newsgroup. Others there have done some +work with using Python as an instructional tool. Good luck. +We'd love to hear about it if you choose Python for your course. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Dec 2 19:32:35 2002 by +Bill Sconce +

+ +

3. Building Python and Other Known Bugs

+ +

3.1. Is there a test set?

+Sure. You can run it after building with "make test", or you can +run it manually with this command at the Python prompt: +

+ import test.autotest
+

+In Python 1.4 or earlier, use +

+ import autotest
+

+The test set doesn't test all features of Python, +but it goes a long way to confirm that Python is actually working. +

+NOTE: if "make test" fails, don't just mail the output to the +newsgroup -- this doesn't give enough information to debug the +problem. Instead, find out which test fails, and run that test +manually from an interactive interpreter. For example, if +"make test" reports that test_spam fails, try this interactively: +

+ import test.test_spam
+

+This generally produces more verbose output which can be diagnosed +to debug the problem. If you find a bug in Python or the libraries, or in the tests, please report this in the Python bug tracker at SourceForge: +

+http://sourceforge.net/tracker/?func=add&group_id=5470&atid=105470 +

+ +Edit this entry / +Log info + +/ Last changed on Fri Apr 27 10:29:36 2001 by +Fred Drake +

+ +

3.2. When running the test set, I get complaints about floating point operations, but when playing with floating point operations I cannot find anything wrong with them.

+The test set makes occasional unwarranted assumptions about the +semantics of C floating point operations. Until someone donates a +better floating point test set, you will have to comment out the +offending floating point tests and execute similar tests manually. +

+ +Edit this entry / +Log info +

+ +

3.3. Link errors after rerunning the configure script.

+It is generally necessary to run "make clean" after a configuration +change. +

+ +Edit this entry / +Log info +

+ +

3.4. The python interpreter complains about options passed to a script (after the script name).

+You are probably linking with GNU getopt, e.g. through -liberty. +Don't. The reason for the complaint is that GNU getopt, unlike System +V getopt and other getopt implementations, doesn't consider a +non-option to be the end of the option list. A quick (and compatible) +fix for scripts is to add "--" to the interpreter, like this: +

+        #! /usr/local/bin/python --
+

+You can also use this interactively: +

+        python -- script.py [options]
+

+Note that a working getopt implementation is provided in the Python +distribution (in Python/getopt.c) but not automatically used. +

+ +Edit this entry / +Log info +

+ +

3.5. When building on the SGI, make tries to run python to create glmodule.c, but python hasn't been built or installed yet.

+Comment out the line mentioning glmodule.c in Setup and build a +python without gl first; install it or make sure it is in your $PATH, +then edit the Setup file again to turn on the gl module, and make +again. You don't need to do "make clean"; you do need to run "make +Makefile" in the Modules subdirectory (or just run "make" at the +toplevel). +

+ +Edit this entry / +Log info +

+ +

3.6. I use VPATH but some targets are built in the source directory.

+On some systems (e.g. Sun), if the target already exists in the +source directory, it is created there instead of in the build +directory. This is usually because you have previously built without +VPATH. Try running "make clobber" in the source directory. +

+ +Edit this entry / +Log info +

+ +

3.7. Trouble building or linking with the GNU readline library.

+You can use the GNU readline library to improve the interactive user +interface: this gives you line editing and command history when +calling python interactively. Its sources are distributed with +Python (at least for 2.0). Uncomment the line +

+#readline readline.c -lreadline -ltermcap +

+in Modules/Setup. The configuration option --with-readline +is no longer supported, at least in Python 2.0. Some hints on +building and using the readline library: +On SGI IRIX 5, you may have to add the following +to rldefs.h: +

+        #ifndef sigmask
+        #define sigmask(sig) (1L << ((sig)-1))
+        #endif
+

+On some systems, you will have to add #include "rldefs.h" to the +top of several source files, and if you use the VPATH feature, you +will have to add dependencies of the form foo.o: foo.c to the +Makefile for several values of foo. +The readline library requires use of the termcap library. A +known problem with this is that it contains entry points which +cause conflicts with the STDWIN and SGI GL libraries. The STDWIN +conflict can be solved by adding a line saying '#define werase w_erase' to the +stdwin.h file (in the STDWIN distribution, subdirectory H). The +GL conflict has been solved in the Python configure script by a +hack that forces use of the static version of the termcap library. +Check the newsgroup gnu.bash.bug news:gnu.bash.bug for +specific problems with the readline library (I don't read this group +but I've been told that it is the place for readline bugs). +

+ +Edit this entry / +Log info + +/ Last changed on Sat Dec 2 18:23:48 2000 by +Issac Trotts +

+ +

3.8. Trouble with socket I/O on older Linux 1.x versions.

+Once you've built Python, use it to run the regen script in the +Lib/plat-linux2 directory. Apparently the files as distributed don't match the system headers on some Linux versions. +

+Note that this FAQ entry only applies to Linux kernel versions 1.x.y; +these are hardly around any more. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jul 30 20:05:52 2002 by +Jens Kubieziel +

+ +

3.9. Trouble with prototypes on Ultrix.

+Ultrix cc seems broken -- use gcc, or edit config.h to #undef +HAVE_PROTOTYPES. +

+ +Edit this entry / +Log info +

+ +

3.10. Other trouble building Python on platform X.

+Please submit the details to the SourceForge bug tracker: +

+  http://sourceforge.net/tracker/?group_id=5470&atid=105470
+

+and we'll look +into it. Please provide as many details as possible. In particular, +if you don't tell us what type of computer and what operating system +(and version) you are using it will be difficult for us to figure out +what is the matter. If you have compilation output logs, +please use file uploads -- don't paste everything in the message box. +

+In many cases, we won't have access to the same hardware or operating system version, so please, if you have a SourceForge account, log in before filing your report, or if you don't have an account, include an email address at which we can reach you for further questions. Logging in to SourceForge first will also cause SourceForge to send you updates as we act on your report. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Apr 27 10:53:18 2001 by +Fred Drake +

+ +

3.11. How to configure dynamic loading on Linux.

+This is now automatic as long as your Linux version uses the ELF +object format (all recent Linuxes do). +

+ +Edit this entry / +Log info +

+ +

3.12. I can't get shared modules to work on Linux 2.0 (Slackware96)?

+This is a bug in the Slackware96 release. The fix is simple: Make sure +that there is a link from /lib/libdl.so to /lib/libdl.so.1 so that the +following links are setup: /lib/libdl.so -> /lib/libdl.so.1 +/lib/libdl.so.1 -> /lib/libdl.so.1.7.14 You may have to rerun the +configure script, after rm'ing the config.cache file, before you +attempt to rebuild python after this fix. +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 15:45:03 1997 by +GvR +

+ +

3.13. Trouble when making modules shared on Linux.

+This happens when you have built Python for static linking and then +enable +

+  *shared*
+

+in the Setup file. Shared library code must be +compiled with "-fpic". If a .o file for the module already exist that +was compiled for static linking, you must remove it or do "make clean" +in the Modules directory. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 13:42:30 1997 by +GvR +

+ +

3.14. [deleted]

+[ancient information on threads on linux (when thread support +was not standard) used to be here] +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 2 17:27:13 2002 by +Erno Kuusela +

+ +

3.15. Errors when linking with a shared library containing C++ code.

+Link the main Python binary with C++. Change the definition of +LINKCC in Modules/Makefile to be your C++ compiler. You may have to +edit config.c slightly to make it compilable with C++. +

+ +Edit this entry / +Log info +

+ +

3.16. Deleted

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 11 16:02:22 2001 by +GvR +

+ +

3.17. Deleted.

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 11 15:54:57 2001 by +GvR +

+ +

3.18. Compilation or link errors for the _tkinter module

+Most likely, there's a version mismatch between the Tcl/Tk header +files (tcl.h and tk.h) and the Tcl/Tk libraries you are using e.g. +"-ltk8.0" and "-ltcl8.0" arguments for _tkinter in the Setup file). +It is possible to install several versions of the Tcl/Tk libraries, +but there can only be one version of the tcl.h and tk.h header +files. If the library doesn't match the header, you'll get +problems, either when linking the module, or when importing it. +Fortunately, the version number is clearly stated in each file, +so this is easy to find. Reinstalling and using the latest +version usually fixes the problem. +

+(Also note that when compiling unpatched Python 1.5.1 against +Tcl/Tk 7.6/4.2 or older, you get an error on Tcl_Finalize. See +the 1.5.1 patch page at http://www.python.org/1.5/patches-1.5.1/.) +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jun 11 00:49:14 1998 by +Gvr +

+ +

3.19. I configured and built Python for Tcl/Tk but "import Tkinter" fails.

+Most likely, you forgot to enable the line in Setup that says +"TKPATH=:$(DESTLIB)/tkinter". +

+ +Edit this entry / +Log info +

+ +

3.20. [deleted]

+[ancient information on a gcc+tkinter bug on alpha was here] +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 16:46:23 2002 by +Erno Kuusela +

+ +

3.21. Several common system calls are missing from the posix module.

+Most likely, all test compilations run by the configure script +are failing for some reason or another. Have a look in config.log to +see what could be the reason. A common reason is specifying a +directory to the --with-readline option that doesn't contain the +libreadline.a file. +

+ +Edit this entry / +Log info +

+ +

3.22. ImportError: No module named string, on MS Windows.

+Most likely, your PYTHONPATH environment variable should be set to +something like: +

+set PYTHONPATH=c:\python;c:\python\lib;c:\python\scripts +

+(assuming Python was installed in c:\python) +

+ +Edit this entry / +Log info +

+ +

3.23. Core dump on SGI when using the gl module.

+There are conflicts between entry points in the termcap and curses +libraries and an entry point in the GL library. There's a hack of a +fix for the termcap library if it's needed for the GNU readline +library, but it doesn't work when you're using curses. Concluding, +you can't build a Python binary containing both the curses and gl +modules. +

+ +Edit this entry / +Log info +

+ +

3.24. "Initializer not a constant" while building DLL on MS-Windows

+Static type object initializers in extension modules may cause compiles to +fail with an error message like "initializer not a constant". +Fredrik Lundh <Fredrik.Lundh@image.combitech.se> explains: +

+This shows up when building DLL under MSVC. There's two ways to +address this: either compile the module as C++, or change your code to +something like: +

+  statichere PyTypeObject bstreamtype = {
+      PyObject_HEAD_INIT(NULL) /* must be set by init function */
+      0,
+      "bstream",
+      sizeof(bstreamobject),
+

+  ...
+

+  void
+  initbstream()
+  {
+      /* Patch object type */
+      bstreamtype.ob_type = &PyType_Type;
+      Py_InitModule("bstream", functions);
+      ...
+  }
+

+ +Edit this entry / +Log info + +/ Last changed on Sun May 25 14:58:05 1997 by +Aaron Watters +

+ +

3.25. Output directed to a pipe or file disappears on Linux.

+Some people have reported that when they run their script +interactively, it runs great, but that when they redirect it +to a pipe or file, no output appears. +

+    % python script.py
+    ...some output...
+    % python script.py >file
+    % cat file
+    % # no output
+    % python script.py | cat
+    % # no output
+    %
+

+This was a bug in Linux kernel. It is fixed and should not appear anymore. So most Linux users are not affected by this. +

+If redirection doesn't work on your Linux system, check what shell you are using. Shells like (t)csh doesn't support redirection. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jan 16 13:38:30 2003 by +Jens Kubieziel +

+ +

3.26. [deleted]

+[ancient libc/linux problem was here] +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 16:48:08 2002 by +Erno Kuusela +

+ +

3.27. [deleted]

+[ancient linux + threads + tk problem was described here] +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 16:49:08 2002 by +Erno Kuusela +

+ +

3.28. How can I test if Tkinter is working?

+Try the following: +

+  python
+  >>> import _tkinter
+  >>> import Tkinter
+  >>> Tkinter._test()
+

+This should pop up a window with two buttons, +one "Click me" and one "Quit". +

+If the first statement (import _tkinter) fails, your Python +installation probably has not been configured to support Tcl/Tk. +On Unix, if you have installed Tcl/Tk, you have to rebuild Python +after editing the Modules/Setup file to enable the _tkinter module +and the TKPATH environment variable. +

+It is also possible to get complaints about Tcl/Tk version +number mismatches or missing TCL_LIBRARY or TK_LIBRARY +environment variables. These have to do with Tcl/Tk installation +problems. +

+A common problem is to have installed versions of tcl.h and tk.h +that don't match the installed version of the Tcl/Tk libraries; +this usually results in linker errors or (when using dynamic +loading) complaints about missing symbols during loading +the shared library. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Aug 28 17:01:46 1997 by +Guido van Rossum +

+ +

3.29. Is there a way to get the interactive mode of the python interpreter to perform function/variable name completion?

+(From a posting by Guido van Rossum) +

+On Unix, if you have enabled the readline module (i.e. if Emacs-style +command line editing and bash-style history works for you), you can +add this by importing the undocumented standard library module +"rlcompleter". When completing a simple identifier, it +completes keywords, built-ins and globals in __main__; when completing +NAME.NAME..., it evaluates (!) the expression up to the last dot and +completes its attributes. +

+This way, you can do "import string", type "string.", hit the +completion key twice, and see the list of names defined by the +string module. +

+Tip: to use the tab key as the completion key, call +

+    readline.parse_and_bind("tab: complete")
+

+You can put this in a ~/.pythonrc file, and set the PYTHONSTARTUP +environment variable to ~/.pythonrc. This will cause the completion to be enabled +whenever you run Python interactively. +

+Notes (see the docstring for rlcompleter.py for more information): +

+* The evaluation of the NAME.NAME... form may cause arbitrary +application defined code to be executed if an object with a +__getattr__ hook is found. Since it is the responsibility of the +application (or the user) to enable this feature, I consider this an +acceptable risk. More complicated expressions (e.g. function calls or +indexing operations) are not evaluated. +

+* GNU readline is also used by the built-in functions input() and +raw_input(), and thus these also benefit/suffer from the complete +features. Clearly an interactive application can benefit by +specifying its own completer function and using raw_input() for all +its input. +

+* When stdin is not a tty device, GNU readline is never +used, and this module (and the readline module) are silently inactive. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jun 12 09:55:24 1998 by +A.M. Kuchling +

+ +

3.30. Why is the Python interpreter not built as a shared library?

+(This is a Unix question; on Mac and Windows, it is a shared +library.) +

+It's just a nightmare to get this to work on all different platforms. +Shared library portability is a pain. And yes, I know about GNU libtool +-- but it requires me to use its conventions for filenames etc, and it +would require a complete and utter rewrite of all the makefile and +config tools I'm currently using. +

+In practice, few applications embed Python -- it's much more common to +have Python extensions, which already are shared libraries. Also, +serious embedders often want total control over which Python version +and configuration they use so they wouldn't want to use a standard +shared library anyway. So while the motivation of saving space +when lots of apps embed Python is nice in theory, I +doubt that it will save much in practice. (Hence the low priority I +give to making a shared library.) +

+For Linux systems, the simplest method of producing libpython1.5.so seems to +be (originally from the Minotaur project web page, +http://www.equi4.com/minotaur/minotaur.html): +

+  make distclean 
+  ./configure 
+  make OPT="-fpic -O2" 
+  mkdir .extract 
+  (cd .extract; ar xv ../libpython1.5.a) 
+  gcc -shared -o libpython1.5.so .extract/*.o 
+  rm -rf .extract
+

+In Python 2.3 this will be supported by the standard build routine +(at least on Linux) with --enable-shared. Note however that there +is little advantage, and it slows down Python because of the need +for PIC code and the extra cost at startup time to find the library. +

+ +Edit this entry / +Log info + +/ Last changed on Thu May 30 13:36:55 2002 by +GvR +

+ +

3.31. Build with GCC on Solaris 2.6 (SunOS 5.6) fails

+If you have upgraded Solaris 2.5 or 2.5.1 to Solaris 2.6, +but you have not upgraded +your GCC installation, the compile may fail, e.g. like this: +

+ In file included from /usr/include/sys/stream.h:26,
+                  from /usr/include/netinet/in.h:38,
+                  from /usr/include/netdb.h:96,
+                  from ./socketmodule.c:121:
+ /usr/include/sys/model.h:32: #error "No DATAMODEL_NATIVE specified"
+

+Solution: rebuild GCC for Solaris 2.6. +You might be able to simply re-run fixincludes, but +people have had mixed success with doing that. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Oct 21 11:18:46 1998 by +GvR +

+ +

3.32. Running "make clean" seems to leave problematic files that cause subsequent builds to fail.

+Use "make clobber" instead. +

+Use "make clean" to reduce the size of the source/build directory +after you're happy with your build and installation. +If you have already tried to build python and you'd like to start +over, you should use "make clobber". It does a "make clean" and also +removes files such as the partially built Python library from a previous build. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jun 24 20:39:26 1999 by +TAB +

+ +

3.33. Submitting bug reports and patches

+To report a bug or submit a patch, please use the relevant service +from the Python project at SourceForge. +

+Bugs: http://sourceforge.net/tracker/?group_id=5470&atid=105470 +

+Patches: http://sourceforge.net/tracker/?group_id=5470&atid=305470 +

+If you have a SourceForge account, please log in before submitting your bug report; this will make it easier for us to contact you regarding your report in the event we have follow-up questions. It will also enable SourceForge to send you update information as we act on your bug. If you do not have a SourceForge account, please consider leaving your name and email address as part of the report. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Apr 27 10:58:26 2001 by +Fred Drake +

+ +

3.34. I can't load shared libraries under Python 1.5.2, Solaris 7, and gcc 2.95.2

+When trying to load shared libraries, you may see errors like: +ImportError: ld.so.1: python: fatal: relocation error: file /usr/local/lib/python1.5/site-packages/Perp/util/du_SweepUtilc.so: +

+ symbol PyExc_RuntimeError: referenced symbol not found
+

+There is a problem with the configure script for Python 1.5.2 +under Solaris 7 with gcc 2.95 . configure should set the make variable +LINKFORSHARED=-Xlinker -export-dynamic +

+in Modules/Makefile, +

+Manually add this line to the Modules/Makefile. +This builds a Python executable that can load shared library extensions (xxx.so) . +

+ +Edit this entry / +Log info + +/ Last changed on Mon Feb 19 10:37:05 2001 by +GvR +

+ +

3.35. In the regression test, test_all fails for the profile module. What's wrong?

+If you have been using the profile module, and have properly calibrated a copy of the module as described in the documentation for the profiler: +

+http://www.python.org/doc/current/lib/profile-calibration.html +

+then it is possible that the regression test "test___all__" will fail if you run the regression test manually rather than using "make test" in the Python source directory. This will happen if you have set your PYTHONPATH environment variable to include the directory containing your calibrated profile module. You have probably calibrated the profiler using an older version of the profile module which does not define the __all__ value, added to the module as of Python 2.1. +

+The problem can be fixed by removing the old calibrated version of the profile module and using the latest version to do a fresh calibration. In general, you will need to re-calibrate for each version of Python anyway, since the performance characteristics can change in subtle ways that impact profiling. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Apr 27 10:44:10 2001 by +Fred Drake +

+ +

3.36. relocations remain against allocatable but non-writable sections

+This linker error occurs on Solaris if you attempt to build an extension module which incorporates position-dependent (non-PIC) code. A common source of problems is that a static library (.a file), such as libreadline.a or libcrypto.a is linked with the extension module. The error specifically occurs when using gcc as the compiler, but /usr/ccs/bin/ld as the linker. +

+The following solutions and work-arounds are known: +

+1. Rebuild the libraries (libreadline, libcrypto) with -fPIC (-KPIC if using the system compiler). This is recommended; all object files in a shared library should be position-independent. +

+2. Statically link the extension module and its libraries into the Python interpreter, by editing Modules/Setup. +

+3. Use GNU ld instead of /usr/ccs/bin/ld; GNU ld will accept non-PIC code in shared libraries (and mark the section writable) +

+4. Pass -mimpure-text to GCC when linking the module. This will force gcc to not pass -z text to ld; in turn, ld will make all text sections writable. +

+Options 3 and 4 are not recommended, since the ability to share code across processes is lost. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 29 12:05:11 2002 by +Martin v. L�wis +

+ +

4. Programming in Python

+ +

4.1. Is there a source code level debugger with breakpoints, step, etc.?

+Yes. +

+Module pdb is a rudimentary but adequate console-mode debugger for Python. It is part of the standard Python library, and is documented in the Library Reference Manual. (You can also write your own debugger by using the code for pdb as an example.) +

+The IDLE interactive development environment, which is part of the standard Python distribution (normally available in Tools/idle), includes a graphical debugger. There is documentation for the IDLE debugger at http://www.python.org/idle/doc/idle2.html#Debugger +

+Pythonwin is a Python IDE that includes a GUI debugger based on bdb. The Pythonwin debugger colors breakpoints and has quite a few cool features (including debugging non-Pythonwin programs). A reference can be found at http://www.python.org/ftp/python/pythonwin/pwindex.html +More recent versions of PythonWin are available as a part of the ActivePython distribution (see http://www.activestate.com/Products/ActivePython/index.html). +

+Pydb is a version of the standard Python debugger pdb, modified for use with DDD (Data Display Debugger), a popular graphical debugger front end. Pydb can be found at http://packages.debian.org/unstable/devel/pydb.html +and DDD can be found at http://www.gnu.org/software/ddd/ +

+There are a number of commmercial Python IDEs that include graphical debuggers. They include: +

+ * Wing IDE (http://wingide.com/) 
+ * Komodo IDE (http://www.activestate.com/Products/Komodo/)
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 28 01:43:41 2003 by +Stephen Ferg +

+ +

4.2. Can I create an object class with some methods implemented in C and others in Python (e.g. through inheritance)? (Also phrased as: Can I use a built-in type as base class?)

+In Python 2.2, you can inherit from builtin classes such as int, list, dict, etc. +

+In previous versions of Python, you can easily create a Python class which serves as a wrapper around a built-in object, e.g. (for dictionaries): +

+        # A user-defined class behaving almost identical
+        # to a built-in dictionary.
+        class UserDict:
+                def __init__(self): self.data = {}
+                def __repr__(self): return repr(self.data)
+                def __cmp__(self, dict):
+                        if type(dict) == type(self.data):
+                                return cmp(self.data, dict)
+                        else:
+                                return cmp(self.data, dict.data)
+                def __len__(self): return len(self.data)
+                def __getitem__(self, key): return self.data[key]
+                def __setitem__(self, key, item): self.data[key] = item
+                def __delitem__(self, key): del self.data[key]
+                def keys(self): return self.data.keys()
+                def items(self): return self.data.items()
+                def values(self): return self.data.values()
+                def has_key(self, key): return self.data.has_key(key)
+

+A2. See Jim Fulton's ExtensionClass for an example of a mechanism +which allows you to have superclasses which you can inherit from in +Python -- that way you can have some methods from a C superclass (call +it a mixin) and some methods from either a Python superclass or your +subclass. ExtensionClass is distributed as a part of Zope (see +http://www.zope.org), but will be phased out with Zope 3, since +Zope 3 uses Python 2.2 or later which supports direct inheritance +from built-in types. Here's a link to the original paper about +ExtensionClass: +http://debian.acm.ndsu.nodak.edu/doc/python-extclass/ExtensionClass.html +

+A3. The Boost Python Library (BPL, http://www.boost.org/libs/python/doc/index.html) +provides a way of doing this from C++ (i.e. you can inherit from an +extension class written in C++ using the BPL). +

+ +Edit this entry / +Log info + +/ Last changed on Tue May 28 21:09:52 2002 by +GvR +

+ +

4.3. Is there a curses/termcap package for Python?

+The standard Python source distribution comes with a curses module in +the Modules/ subdirectory, though it's not compiled by default (note +that this is not available in the Windows distribution -- there is +no curses module for Windows). +

+In Python versions before 2.0 the module only supported plain curses; +you couldn't use ncurses features like colors with it (though it would +link with ncurses). +

+In Python 2.0, the curses module has been greatly extended, starting +from Oliver Andrich's enhanced version, to provide many additional +functions from ncurses and SYSV curses, such as colour, alternative +character set support, pads, and mouse support. This means the +module is no longer compatible with operating systems that only +have BSD curses, but there don't seem to be any currently +maintained OSes that fall into this category. +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 23 20:24:06 2002 by +Tim Peters +

+ +

4.4. Is there an equivalent to C's onexit() in Python?

+For Python 2.0: The new atexit module provides a register function that +is similar to C's onexit. See the Library Reference for details. For +2.0 you should not assign to sys.exitfunc! +

+For Python 1.5.2: You need to import sys and assign a function to +sys.exitfunc, it will be called when your program exits, is +killed by an unhandled exception, or (on UNIX) receives a +SIGHUP or SIGTERM signal. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 12:14:55 2000 by +Bjorn Pettersen +

+ +

4.5. [deleted]

+[python used to lack nested scopes, it was explained here] +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 05:18:22 2002 by +Erno Kuusela +

+ +

4.6. How do I iterate over a sequence in reverse order?

+If it is a list, the fastest solution is +

+        list.reverse()
+        try:
+                for x in list:
+                        "do something with x"
+        finally:
+                list.reverse()
+

+This has the disadvantage that while you are in the loop, the list +is temporarily reversed. If you don't like this, you can make a copy. +This appears expensive but is actually faster than other solutions: +

+        rev = list[:]
+        rev.reverse()
+        for x in rev:
+                <do something with x>
+

+If it's not a list, a more general but slower solution is: +

+        for i in range(len(sequence)-1, -1, -1):
+                x = sequence[i]
+                <do something with x>
+

+A more elegant solution, is to define a class which acts as a sequence +and yields the elements in reverse order (solution due to Steve +Majewski): +

+        class Rev:
+                def __init__(self, seq):
+                        self.forw = seq
+                def __len__(self):
+                        return len(self.forw)
+                def __getitem__(self, i):
+                        return self.forw[-(i + 1)]
+

+You can now simply write: +

+        for x in Rev(list):
+                <do something with x>
+

+Unfortunately, this solution is slowest of all, due to the method +call overhead... +

+ +Edit this entry / +Log info + +/ Last changed on Sun May 25 21:10:50 1997 by +GvR +

+ +

4.7. My program is too slow. How do I speed it up?

+That's a tough one, in general. There are many tricks to speed up +Python code; I would consider rewriting parts in C only as a last +resort. One thing to notice is that function and (especially) method +calls are rather expensive; if you have designed a purely OO interface +with lots of tiny functions that don't do much more than get or set an +instance variable or call another method, you may consider using a +more direct way, e.g. directly accessing instance variables. Also see +the standard module "profile" (described in the Library Reference +manual) which makes it possible to find out where +your program is spending most of its time (if you have some patience +-- the profiling itself can slow your program down by an order of +magnitude). +

+Remember that many standard optimization heuristics you +may know from other programming experience may well apply +to Python. For example it may be faster to send output to output +devices using larger writes rather than smaller ones in order to +avoid the overhead of kernel system calls. Thus CGI scripts +that write all output in "one shot" may be notably faster than +those that write lots of small pieces of output. +

+Also, be sure to use "aggregate" operations where appropriate. +For example the "slicing" feature allows programs to chop up +lists and other sequence objects in a single tick of the interpreter +mainloop using highly optimized C implementations. Thus to +get the same effect as +

+  L2 = []
+  for i in range[3]:
+       L2.append(L1[i])
+

+it is much shorter and far faster to use +

+  L2 = list(L1[:3]) # "list" is redundant if L1 is a list.
+

+Note that the map() function, particularly used with +builtin methods or builtin functions can be a convenient +accelerator. For example to pair the elements of two +lists together: +

+  >>> map(None, [1,2,3], [4,5,6])
+  [(1, 4), (2, 5), (3, 6)]
+

+or to compute a number of sines: +

+  >>> map( math.sin, (1,2,3,4))
+  [0.841470984808, 0.909297426826, 0.14112000806,   -0.756802495308]
+

+The map operation completes very quickly in such cases. +

+Other examples of aggregate operations include the join and split +methods of string objects. For example if s1..s7 are large (10K+) strings then +"".join([s1,s2,s3,s4,s5,s6,s7]) may be far faster than +the more obvious s1+s2+s3+s4+s5+s6+s7, since the "summation" +will compute many subexpressions, whereas join does all +copying in one pass. For manipulating strings also consider the +regular expression libraries and the "substitution" operations +String % tuple and String % dictionary. Also be sure to use +the list.sort builtin method to do sorting, and see FAQ's 4.51 +and 4.59 for examples of moderately advanced usage -- list.sort beats +other techniques for sorting in all but the most extreme +circumstances. +

+There are many other aggregate operations +available in the standard libraries and in contributed libraries +and extensions. +

+Another common trick is to "push loops into functions or methods." +For example suppose you have a program that runs slowly and you +use the profiler (profile.run) to determine that a Python function ff +is being called lots of times. If you notice that ff +

+   def ff(x):
+       ...do something with x computing result...
+       return result
+

+tends to be called in loops like (A) +

+   list = map(ff, oldlist)
+

+or (B) +

+   for x in sequence:
+       value = ff(x)
+       ...do something with value...
+

+then you can often eliminate function call overhead by rewriting +ff to +

+   def ffseq(seq):
+       resultseq = []
+       for x in seq:
+           ...do something with x computing result...
+           resultseq.append(result)
+       return resultseq
+

+and rewrite (A) to +

+    list = ffseq(oldlist)
+

+and (B) to +

+    for value in ffseq(sequence):
+        ...do something with value...
+

+Other single calls ff(x) translate to ffseq([x])[0] with little +penalty. Of course this technique is not always appropriate +and there are other variants, which you can figure out. +

+You can gain some performance by explicitly storing the results of +a function or method lookup into a local variable. A loop like +

+    for key in token:
+        dict[key] = dict.get(key, 0) + 1
+

+resolves dict.get every iteration. If the method isn't going to +change, a faster implementation is +

+    dict_get = dict.get  # look up the method once
+    for key in token:
+        dict[key] = dict_get(key, 0) + 1
+

+Default arguments can be used to determine values once, at +compile time instead of at run time. This can only be done for +functions or objects which will not be changed during program +execution, such as replacing +

+    def degree_sin(deg):
+        return math.sin(deg * math.pi / 180.0)
+

+with +

+    def degree_sin(deg, factor = math.pi/180.0, sin = math.sin):
+        return sin(deg * factor)
+

+Because this trick uses default arguments for terms which should +not be changed, it should only be used when you are not concerned +with presenting a possibly confusing API to your users. +

+For an anecdote related to optimization, see +

+	http://www.python.org/doc/essays/list2str.html
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 01:03:54 2002 by +Neal Norwitz +

+ +

4.8. When I have imported a module, then edit it, and import it again (into the same Python process), the changes don't seem to take place. What is going on?

+For reasons of efficiency as well as consistency, Python only reads +the module file on the first time a module is imported. (Otherwise a +program consisting of many modules, each of which imports the same +basic module, would read the basic module over and over again.) To +force rereading of a changed module, do this: +

+        import modname
+        reload(modname)
+

+Warning: this technique is not 100% fool-proof. In particular, +modules containing statements like +

+        from modname import some_objects
+

+will continue to work with the old version of the imported objects. +

+ +Edit this entry / +Log info +

+ +

4.9. How do I find the current module name?

+A module can find out its own module name by looking at the +(predefined) global variable __name__. If this has the value +'__main__' you are running as a script. +

+ +Edit this entry / +Log info +

+ +

4.10. I have a module in which I want to execute some extra code when it is run as a script. How do I find out whether I am running as a script?

+See the previous question. E.g. if you put the following on the +last line of your module, main() is called only when your module is +running as a script: +

+        if __name__ == '__main__': main()
+

+ +Edit this entry / +Log info +

+ +

4.11. I try to run a program from the Demo directory but it fails with ImportError: No module named ...; what gives?

+This is probably an optional module (written in C!) which hasn't +been configured on your system. This especially happens with modules +like "Tkinter", "stdwin", "gl", "Xt" or "Xm". For Tkinter, STDWIN and +many other modules, see Modules/Setup.in for info on how to add these +modules to your Python, if it is possible at all. Sometimes you will +have to ftp and build another package first (e.g. Tcl and Tk for Tkinter). +Sometimes the module only works on specific platforms (e.g. gl only works +on SGI machines). +

+NOTE: if the complaint is about "Tkinter" (upper case T) and you have +already configured module "tkinter" (lower case t), the solution is +not to rename tkinter to Tkinter or vice versa. There is probably +something wrong with your module search path. Check out the value of +sys.path. +

+For X-related modules (Xt and Xm) you will have to do more work: they +are currently not part of the standard Python distribution. You will +have to ftp the Extensions tar file, i.e. +ftp://ftp.python.org/pub/python/src/X-extension.tar.gz and follow +the instructions there. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Feb 12 21:31:08 2003 by +Jens Kubieziel +

+ +

4.12. [deleted]

+[stdwin (long dead windowing library) entry deleted] +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 08:30:13 2002 by +Erno Kuusela +

+ +

4.13. What GUI toolkits exist for Python?

+Depending on what platform(s) you are aiming at, there are several. +

+Currently supported solutions: +

+Cross-platform: +

+Tk: +

+There's a neat object-oriented interface to the Tcl/Tk widget set, +called Tkinter. It is part of the standard Python distribution and +well-supported -- all you need to do is build and install Tcl/Tk and +enable the _tkinter module and the TKPATH definition in Modules/Setup +when building Python. This is probably the easiest to install and +use, and the most complete widget set. It is also very likely that in +the future the standard Python GUI API will be based on or at least +look very much like the Tkinter interface. For more info about Tk, +including pointers to the source, see the Tcl/Tk home page at +http://www.scriptics.com. Tcl/Tk is now fully +portable to the Mac and Windows platforms (NT and 95 only); you need +Python 1.4beta3 or later and Tk 4.1patch1 or later. +

+wxWindows: +

+There's an interface to wxWindows called wxPython. wxWindows is a +portable GUI class library written in C++. It supports GTK, Motif, +MS-Windows and Mac as targets. Ports to other platforms are being +contemplated or have already had some work done on them. wxWindows +preserves the look and feel of the underlying graphics toolkit, and +there is quite a rich widget set and collection of GDI classes. +See the wxWindows page at http://www.wxwindows.org/ for more details. +wxPython is a python extension module that wraps many of the wxWindows +C++ classes, and is quickly gaining popularity amongst Python +developers. You can get wxPython as part of the source or CVS +distribution of wxWindows, or directly from its home page at +http://alldunn.com/wxPython/. +

+Gtk+: +

+PyGtk bindings for the Gtk+ Toolkit by James Henstridge exist; see ftp://ftp.daa.com.au/pub/james/python/. Note that there are two incompatible bindings. If you are using Gtk+ 1.2.x you should get the 0.6.x PyGtk bindings from +

+    ftp://ftp.gtk.org/pub/python/v1.2
+

+If you plan to use Gtk+ 2.0 with Python (highly recommended if you are just starting with Gtk), get the most recent distribution from +

+    ftp://ftp.gtk.org/pub/python/v2.0
+

+If you are adventurous, you can also check out the source from the Gnome CVS repository. Set your CVS directory to :pserver:anonymous@anoncvs.gnome.org:/cvs/gnome and check the gnome-python module out from the repository. +

+Other: +

+There are also bindings available for the Qt toolkit (PyQt), and for KDE (PyKDE); see http://www.thekompany.com/projects/pykde/. +

+For OpenGL bindings, see http://starship.python.net/~da/PyOpenGL. +

+Platform specific: +

+The Mac port has a rich and ever-growing set of modules that support +the native Mac toolbox calls. See the documentation that comes with +the Mac port. See ftp://ftp.python.org/pub/python/mac. Support +by Jack Jansen jack@cwi.nl. +

+Pythonwin by Mark Hammond (MHammond@skippinet.com.au) +includes an interface to the Microsoft Foundation +Classes and a Python programming environment using it that's written +mostly in Python. See http://www.python.org/windows/. +

+There's an object-oriented GUI based on the Microsoft Foundation +Classes model called WPY, supported by Jim Ahlstrom jim@interet.com. +Programs written in WPY run unchanged and with native look and feel on +Windows NT/95, Windows 3.1 (using win32s), and on Unix (using Tk). +Source and binaries for Windows and Linux are available in +ftp://ftp.python.org/pub/python/wpy/. +

+Obsolete or minority solutions: +

+There's an interface to X11, including the Athena and Motif widget +sets (and a few individual widgets, like Mosaic's HTML widget and +SGI's GL widget) available from +ftp://ftp.python.org/pub/python/src/X-extension.tar.gz. +Support by Sjoerd Mullender sjoerd@cwi.nl. +

+On top of the X11 interface there's the vpApp +toolkit by Per Spilling, now also maintained by Sjoerd Mullender +sjoerd@cwi.nl. See ftp://ftp.cwi.nl/pub/sjoerd/vpApp.tar.gz. +

+For SGI IRIX only, there are unsupported interfaces to the complete +GL (Graphics Library -- low level but very good 3D capabilities) as +well as to FORMS (a buttons-and-sliders-etc package built on top of GL +by Mark Overmars -- ftp'able from +ftp://ftp.cs.ruu.nl/pub/SGI/FORMS/). This is probably also +becoming obsolete, as OpenGL takes over (see above). +

+There's an interface to STDWIN, a platform-independent low-level +windowing interface for Mac and X11. This is totally unsupported and +rapidly becoming obsolete. The STDWIN sources are at +ftp://ftp.cwi.nl/pub/stdwin/. +

+There is an interface to WAFE, a Tcl interface to the X11 +Motif and Athena widget sets. WAFE is at +http://www.wu-wien.ac.at/wafe/wafe.html. +

+ +Edit this entry / +Log info + +/ Last changed on Mon May 13 21:40:39 2002 by +Skip Montanaro +

+ +

4.14. Are there any interfaces to database packages in Python?

+Yes! See the Database Topic Guide at +http://www.python.org/topics/database/ for details. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 4 20:12:19 2000 by +Barney Warplug +

+ +

4.15. Is it possible to write obfuscated one-liners in Python?

+Yes. See the following three examples, due to Ulf Bartelt: +

+        # Primes < 1000
+        print filter(None,map(lambda y:y*reduce(lambda x,y:x*y!=0,
+        map(lambda x,y=y:y%x,range(2,int(pow(y,0.5)+1))),1),range(2,1000)))
+

+        # First 10 Fibonacci numbers
+        print map(lambda x,f=lambda x,f:(x<=1) or (f(x-1,f)+f(x-2,f)): f(x,f),
+        range(10))
+

+        # Mandelbrot set
+        print (lambda Ru,Ro,Iu,Io,IM,Sx,Sy:reduce(lambda x,y:x+y,map(lambda y,
+        Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,Sy=Sy,L=lambda yc,Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,i=IM,
+        Sx=Sx,Sy=Sy:reduce(lambda x,y:x+y,map(lambda x,xc=Ru,yc=yc,Ru=Ru,Ro=Ro,
+        i=i,Sx=Sx,F=lambda xc,yc,x,y,k,f=lambda xc,yc,x,y,k,f:(k<=0)or (x*x+y*y
+        >=4.0) or 1+f(xc,yc,x*x-y*y+xc,2.0*x*y+yc,k-1,f):f(xc,yc,x,y,k,f):chr(
+        64+F(Ru+x*(Ro-Ru)/Sx,yc,0,0,i)),range(Sx))):L(Iu+y*(Io-Iu)/Sy),range(Sy
+        ))))(-2.1, 0.7, -1.2, 1.2, 30, 80, 24)
+        #    \___ ___/  \___ ___/  |   |   |__ lines on screen
+        #        V          V      |   |______ columns on screen
+        #        |          |      |__________ maximum of "iterations"
+        #        |          |_________________ range on y axis
+        #        |____________________________ range on x axis
+

+Don't try this at home, kids! +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 15:48:33 1997 by +GvR +

+ +

4.16. Is there an equivalent of C's "?:" ternary operator?

+Not directly. In many cases you can mimic a?b:c with "a and b or +c", but there's a flaw: if b is zero (or empty, or None -- anything +that tests false) then c will be selected instead. In many cases you +can prove by looking at the code that this can't happen (e.g. because +b is a constant or has a type that can never be false), but in general +this can be a problem. +

+Tim Peters (who wishes it was Steve Majewski) suggested the following +solution: (a and [b] or [c])[0]. Because [b] is a singleton list it +is never false, so the wrong path is never taken; then applying [0] to +the whole thing gets the b or c that you really wanted. Ugly, but it +gets you there in the rare cases where it is really inconvenient to +rewrite your code using 'if'. +

+As a last resort it is possible to implement the "?:" operator as a function: +

+    def q(cond,on_true,on_false):
+        from inspect import isfunction
+

+        if cond:
+            if not isfunction(on_true): return on_true
+            else: return apply(on_true)
+        else:
+            if not isfunction(on_false): return on_false 
+            else: return apply(on_false)
+

+In most cases you'll pass b and c directly: q(a,b,c). To avoid evaluating b +or c when they shouldn't be, encapsulate them +within a lambda function, e.g.: q(a,lambda: b, lambda: c). +

+It has been asked why Python has no if-then-else expression, +since most language have one; it is a frequently requested feature. +

+There are several possible answers: just as many languages do +just fine without one; it can easily lead to less readable code; +no sufficiently "Pythonic" syntax has been discovered; a search +of the standard library found remarkably few places where using an +if-then-else expression would make the code more understandable. +

+Nevertheless, in an effort to decide once and for all whether +an if-then-else expression should be added to the language, +PEP 308 (http://www.python.org/peps/pep-0308.html) has been +put forward, proposing a specific syntax. The community can +now vote on this issue. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Feb 7 19:41:13 2003 by +David Goodger +

+ +

4.17. My class defines del but it is not called when I delete the object.

+There are several possible reasons for this. +

+The del statement does not necessarily call __del__ -- it simply +decrements the object's reference count, and if this reaches zero +__del__ is called. +

+If your data structures contain circular links (e.g. a tree where +each child has a parent pointer and each parent has a list of +children) the reference counts will never go back to zero. You'll +have to define an explicit close() method which removes those +pointers. Please don't ever call __del__ directly -- __del__ should +call close() and close() should make sure that it can be called more +than once for the same object. +

+If the object has ever been a local variable (or argument, which is +really the same thing) to a function that caught an expression in an +except clause, chances are that a reference to the object still exists +in that function's stack frame as contained in the stack trace. +Normally, deleting (better: assigning None to) sys.exc_traceback will +take care of this. If a stack was printed for an unhandled +exception in an interactive interpreter, delete sys.last_traceback +instead. +

+There is code that deletes all objects when the interpreter exits, +but it is not called if your Python has been configured to support +threads (because other threads may still be active). You can define +your own cleanup function using sys.exitfunc (see question 4.4). +

+Finally, if your __del__ method raises an exception, a warning message is printed to sys.stderr. +

+Starting with Python 2.0, a garbage collector periodically reclaims the space used by most cycles with no external references. (See the "gc" module documentation for details.) There are, however, pathological cases where it can be expected to fail. Moreover, the garbage collector runs some time after the last reference to your data structure vanishes, so your __del__ method may be called at an inconvenient and random time. This is inconvenient if you're trying to reproduce a problem. Worse, the order in which object's __del__ methods are executed is arbitrary. +

+Another way to avoid cyclical references is to use the "weakref" module, which allows you to point to objects without incrementing their reference count. Tree data structures, for instance, should use weak references for their parent and sibling pointers (if they need them!). +

+Question 6.14 is intended to explain the new garbage collection algorithm. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 10 15:27:28 2002 by +Matthias Urlichs +

+ +

4.18. How do I change the shell environment for programs called using os.popen() or os.system()? Changing os.environ doesn't work.

+You must be using either a version of python before 1.4, or on a +(rare) system that doesn't have the putenv() library function. +

+Before Python 1.4, modifying the environment passed to subshells was +left out of the interpreter because there seemed to be no +well-established portable way to do it (in particular, some systems, +have putenv(), others have setenv(), and some have none at all). As +of Python 1.4, almost all Unix systems do have putenv(), and so does +the Win32 API, and thus the os module was modified so that changes to +os.environ are trapped and the corresponding putenv() call is made. +

+ +Edit this entry / +Log info +

+ +

4.19. What is a class?

+A class is the particular object type created by executing +a class statement. Class objects are used as templates, to create +instance objects, which embody both the data structure +(attributes) and program routines (methods) specific to a datatype. +

+A class can be based on one or more other classes, called its base +class(es). It then inherits the attributes and methods of its base classes. This allows an object model to be successively refined +by inheritance. +

+The term "classic class" is used to refer to the original +class implementation in Python. One problem with classic +classes is their inability to use the built-in data types +(such as list and dictionary) as base classes. Starting +with Python 2.2 an attempt is in progress to unify user-defined +classes and built-in types. It is now possible to declare classes +that inherit from built-in types. +

+ +Edit this entry / +Log info + +/ Last changed on Mon May 27 01:31:21 2002 by +Steve Holden +

+ +

4.20. What is a method?

+A method is a function that you normally call as +x.name(arguments...) for some object x. The term is used for methods +of classes and class instances as well as for methods of built-in +objects. (The latter have a completely different implementation and +only share the way their calls look in Python code.) Methods of +classes (and class instances) are defined as functions inside the +class definition. +

+ +Edit this entry / +Log info +

+ +

4.21. What is self?

+Self is merely a conventional name for the first argument of a +method -- i.e. a function defined inside a class definition. A method +defined as meth(self, a, b, c) should be called as x.meth(a, b, c) for +some instance x of the class in which the definition occurs; +the called method will think it is called as meth(x, a, b, c). +

+ +Edit this entry / +Log info +

+ +

4.22. What is an unbound method?

+An unbound method is a method defined in a class that is not yet +bound to an instance. You get an unbound method if you ask for a +class attribute that happens to be a function. You get a bound method +if you ask for an instance attribute. A bound method knows which +instance it belongs to and calling it supplies the instance automatically; +an unbound method only knows which class it wants for its first +argument (a derived class is also OK). Calling an unbound method +doesn't "magically" derive the first argument from the context -- you +have to provide it explicitly. +

+Trivia note regarding bound methods: each reference to a bound +method of a particular object creates a bound method object. If you +have two such references (a = inst.meth; b = inst.meth), they will +compare equal (a == b) but are not the same (a is not b). +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 6 18:07:25 1998 by +Clarence Gardner +

+ +

4.23. How do I call a method defined in a base class from a derived class that overrides it?

+If your class definition starts with "class Derived(Base): ..." +then you can call method meth defined in Base (or one of Base's base +classes) as Base.meth(self, arguments...). Here, Base.meth is an +unbound method (see previous question). +

+ +Edit this entry / +Log info +

+ +

4.24. How do I call a method from a base class without using the name of the base class?

+DON'T DO THIS. REALLY. I MEAN IT. It appears that you could call +self.__class__.__bases__[0].meth(self, arguments...) but this fails when +a doubly-derived method is derived from your class: for its instances, +self.__class__.__bases__[0] is your class, not its base class -- so +(assuming you are doing this from within Derived.meth) you would start +a recursive call. +

+Often when you want to do this you are forgetting that classes +are first class in Python. You can "point to" the class you want +to delegate an operation to either at the instance or at the +subclass level. For example if you want to use a "glorp" +operation of a superclass you can point to the right superclass +to use. +

+  class subclass(superclass1, superclass2, superclass3):
+      delegate_glorp = superclass2
+      ...
+      def glorp(self, arg1, arg2):
+            ... subclass specific stuff ...
+            self.delegate_glorp.glorp(self, arg1, arg2)
+       ...
+

+  class subsubclass(subclass):
+       delegate_glorp = superclass3
+       ...
+

+Note, however that setting delegate_glorp to subclass in +subsubclass would cause an infinite recursion on subclass.delegate_glorp. Careful! Maybe you are getting too fancy for your own good. Consider simplifying the design (?). +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jul 28 13:58:22 1997 by +aaron watters +

+ +

4.25. How can I organize my code to make it easier to change the base class?

+You could define an alias for the base class, assign the real base +class to it before your class definition, and use the alias throughout +your class. Then all you have to change is the value assigned to the +alias. Incidentally, this trick is also handy if you want to decide +dynamically (e.g. depending on availability of resources) which base +class to use. Example: +

+        BaseAlias = <real base class>
+        class Derived(BaseAlias):
+                def meth(self):
+                        BaseAlias.meth(self)
+                        ...
+

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 15:49:57 1997 by +GvR +

+ +

4.26. How can I find the methods or attributes of an object?

+This depends on the object type. +

+For an instance x of a user-defined class, instance attributes are +found in the dictionary x.__dict__, and methods and attributes defined +by its class are found in x.__class__.__bases__[i].__dict__ (for i in +range(len(x.__class__.__bases__))). You'll have to walk the tree of +base classes to find all class methods and attributes. +

+Many, but not all built-in types define a list of their method names +in x.__methods__, and if they have data attributes, their names may be +found in x.__members__. However this is only a convention. +

+For more information, read the source of the standard (but +undocumented) module newdir. +

+ +Edit this entry / +Log info +

+ +

4.27. I can't seem to use os.read() on a pipe created with os.popen().

+os.read() is a low-level function which takes a file descriptor (a +small integer). os.popen() creates a high-level file object -- the +same type used for sys.std{in,out,err} and returned by the builtin +open() function. Thus, to read n bytes from a pipe p created with +os.popen(), you need to use p.read(n). +

+ +Edit this entry / +Log info +

+ +

4.28. How can I create a stand-alone binary from a Python script?

+Even though there are Python compilers being developed, +you probably don't need a real compiler, if all you want +is a stand-alone program. There are three solutions to that. +

+One is to use the freeze tool, which is included in the Python +source tree as Tools/freeze. It converts Python byte +code to C arrays. Using a C compiler, you can embed all +your modules into a new program, which is then linked +with the standard Python modules. +

+It works by scanning your source recursively for import statements +(in both forms) and looking for the modules in the standard Python path +as well as in the source directory (for built-in modules). It then +1 the modules written in Python to C code (array initializers +that can be turned into code objects using the marshal module) and +creates a custom-made config file that only contains those built-in +modules which are actually used in the program. It then compiles the +generated C code and links it with the rest of the Python interpreter +to form a self-contained binary which acts exactly like your script. +

+(Hint: the freeze program only works if your script's filename ends in +".py".) +

+There are several utilities which may be helpful. The first is Gordon McMillan's installer at +

+    http://www.mcmillan-inc.com/install1.html
+

+which works on Windows, Linux and at least some forms of Unix. +

+Another is Thomas Heller's py2exe (Windows only) at +

+    http://starship.python.net/crew/theller/py2exe/
+

+A third is Christian Tismer's SQFREEZE +(http://starship.python.net/crew/pirx/) which appends the byte code +to a specially-prepared Python interpreter, which +will find the byte code in executable. +

+A fourth is Fredrik Lundh's Squeeze +(http://www.pythonware.com/products/python/squeeze/). +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jun 19 14:01:30 2002 by +Gordon McMillan +

+ +

4.29. What WWW tools are there for Python?

+See the chapters titled "Internet Protocols and Support" and +"Internet Data Handling" in the Library Reference +Manual. Python is full of good things which will help you build server-side and client-side web systems. +

+A summary of available frameworks is maintained by Paul Boddie at +

+    http://thor.prohosting.com/~pboddie/Python/web_modules.html
+

+Cameron Laird maintains a useful set of pages about Python web technologies at +

+   http://starbase.neosoft.com/~claird/comp.lang.python/web_python.html/
+

+There was a web browser written in Python, called Grail -- +see http://sourceforge.net/project/grail/. This project has been terminated; http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/grail/grail/README gives more details. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Nov 11 22:48:25 2002 by +GvR +

+ +

4.30. How do I run a subprocess with pipes connected to both input and output?

+Use the standard popen2 module. For example: +

+	import popen2
+	fromchild, tochild = popen2.popen2("command")
+	tochild.write("input\n")
+	tochild.flush()
+	output = fromchild.readline()
+

+Warning: in general, it is unwise to +do this, because you can easily cause a deadlock where your +process is blocked waiting for output from the child, while the child +is blocked waiting for input from you. This can be caused +because the parent expects the child to output more text than it does, +or it can be caused by data being stuck in stdio buffers due to lack +of flushing. The Python parent can of course explicitly flush the data +it sends to the child before it reads any output, but if the child is +a naive C program it can easily have been written to never explicitly +flush its output, even if it is interactive, since flushing is +normally automatic. +

+Note that a deadlock is also possible if you use popen3 to read +stdout and stderr. If one of the two is too large for the internal +buffer (increasing the buffersize does not help) and you read() +the other one first, there is a deadlock, too. +

+Note on a bug in popen2: unless your program calls wait() +or waitpid(), finished child processes are never removed, +and eventually calls to popen2 will fail because of a limit on +the number of child processes. Calling os.waitpid with the +os.WNOHANG option can prevent this; a good place to insert such +a call would be before calling popen2 again. +

+Another way to produce a deadlock: Call a wait() and there is +still more output from the program than what fits into the +internal buffers. +

+In many cases, all you really need is to run some data through a +command and get the result back. Unless the data is infinite in size, +the easiest (and often the most efficient!) way to do this is to write +it to a temporary file and run the command with that temporary file as +input. The standard module tempfile exports a function mktemp() which +generates unique temporary file names. +

+ import tempfile
+ import os
+ class Popen3:
+    """
+    This is a deadlock-save version of popen, that returns
+    an object with errorlevel, out (a string) and err (a string).
+    (capturestderr may not work under windows.)
+    Example: print Popen3('grep spam','\n\nhere spam\n\n').out
+    """
+    def __init__(self,command,input=None,capturestderr=None):
+        outfile=tempfile.mktemp()
+        command="( %s ) > %s" % (command,outfile)
+        if input:
+            infile=tempfile.mktemp()
+            open(infile,"w").write(input)
+            command=command+" <"+infile
+        if capturestderr:
+            errfile=tempfile.mktemp()
+            command=command+" 2>"+errfile
+        self.errorlevel=os.system(command) >> 8
+        self.out=open(outfile,"r").read()
+        os.remove(outfile)
+        if input:
+            os.remove(infile)
+        if capturestderr:
+            self.err=open(errfile,"r").read()
+            os.remove(errfile)
+

+Note that many interactive programs (e.g. vi) don't work well with +pipes substituted for standard input and output. You will have to use +pseudo ttys ("ptys") instead of pipes. There is some undocumented +code to use these in the library module pty.py -- I'm afraid you're on +your own here. +

+A different answer is a Python interface to Don Libes' "expect" +library. A Python extension that interfaces to expect is called "expy" +and available from +http://expectpy.sourceforge.net/. +

+A pure Python solution that works like expect is pexpect of Noah Spurrier. +A beta version is available from +http://pexpect.sourceforge.net/ +

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 3 16:31:31 2002 by +Tobias Polzin +

+ +

4.31. How do I call a function if I have the arguments in a tuple?

+Use the built-in function apply(). For instance, +

+    func(1, 2, 3)
+

+is equivalent to +

+    args = (1, 2, 3)
+    apply(func, args)
+

+Note that func(args) is not the same -- it calls func() with exactly +one argument, the tuple args, instead of three arguments, the integers +1, 2 and 3. +

+In Python 2.0, you can also use extended call syntax: +

+f(*args) is equivalent to apply(f, args) +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 03:42:50 2001 by +Moshe Zadka +

+ +

4.32. How do I enable font-lock-mode for Python in Emacs?

+If you are using XEmacs 19.14 or later, any XEmacs 20, FSF Emacs 19.34 +or any Emacs 20, font-lock should work automatically for you if you +are using the latest python-mode.el. +

+If you are using an older version of XEmacs or Emacs you will need +to put this in your .emacs file: +

+        (defun my-python-mode-hook ()
+          (setq font-lock-keywords python-font-lock-keywords)
+          (font-lock-mode 1))
+        (add-hook 'python-mode-hook 'my-python-mode-hook)
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Apr 6 16:18:46 1998 by +Barry Warsaw +

+ +

4.33. Is there a scanf() or sscanf() equivalent?

+Not as such. +

+For simple input parsing, the easiest approach is usually to split +the line into whitespace-delimited words using string.split(), and to +convert decimal strings to numeric values using int(), +long() or float(). (Python's int() is 32-bit and its +long() is arbitrary precision.) string.split supports an optional +"sep" parameter which is useful if the line uses something other +than whitespace as a delimiter. +

+For more complicated input parsing, regular expressions (see module re) +are better suited and more powerful than C's sscanf(). +

+There's a contributed module that emulates sscanf(), by Steve Clift; +see contrib/Misc/sscanfmodule.c of the ftp site: +

+    http://www.python.org/ftp/python/contrib-09-Dec-1999/Misc/
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 01:07:51 2002 by +Neal Norwitz +

+ +

4.34. Can I have Tk events handled while waiting for I/O?

+Yes, and you don't even need threads! But you'll have to +restructure your I/O code a bit. Tk has the equivalent of Xt's +XtAddInput() call, which allows you to register a callback function +which will be called from the Tk mainloop when I/O is possible on a +file descriptor. Here's what you need: +

+        from Tkinter import tkinter
+        tkinter.createfilehandler(file, mask, callback)
+

+The file may be a Python file or socket object (actually, anything +with a fileno() method), or an integer file descriptor. The mask is +one of the constants tkinter.READABLE or tkinter.WRITABLE. The +callback is called as follows: +

+        callback(file, mask)
+

+You must unregister the callback when you're done, using +

+        tkinter.deletefilehandler(file)
+

+Note: since you don't know *how many bytes* are available for reading, +you can't use the Python file object's read or readline methods, since +these will insist on reading a predefined number of bytes. For +sockets, the recv() or recvfrom() methods will work fine; for other +files, use os.read(file.fileno(), maxbytecount). +

+ +Edit this entry / +Log info +

+ +

4.35. How do I write a function with output parameters (call by reference)?

+[Mark Lutz] The thing to remember is that arguments are passed by +assignment in Python. Since assignment just creates references to +objects, there's no alias between an argument name in the caller and +callee, and so no call-by-reference per se. But you can simulate it +in a number of ways: +

+1) By using global variables; but you probably shouldn't :-) +

+2) By passing a mutable (changeable in-place) object: +

+      def func1(a):
+          a[0] = 'new-value'     # 'a' references a mutable list
+          a[1] = a[1] + 1        # changes a shared object
+

+      args = ['old-value', 99]
+      func1(args)
+      print args[0], args[1]     # output: new-value 100
+

+3) By returning a tuple, holding the final values of arguments: +

+      def func2(a, b):
+          a = 'new-value'        # a and b are local names
+          b = b + 1              # assigned to new objects
+          return a, b            # return new values
+

+      x, y = 'old-value', 99
+      x, y = func2(x, y)
+      print x, y                 # output: new-value 100
+

+4) And other ideas that fall-out from Python's object model. For instance, it might be clearer to pass in a mutable dictionary: +

+      def func3(args):
+          args['a'] = 'new-value'     # args is a mutable dictionary
+          args['b'] = args['b'] + 1   # change it in-place
+

+      args = {'a':' old-value', 'b': 99}
+      func3(args)
+      print args['a'], args['b']
+

+5) Or bundle-up values in a class instance: +

+      class callByRef:
+          def __init__(self, **args):
+              for (key, value) in args.items():
+                  setattr(self, key, value)
+

+      def func4(args):
+          args.a = 'new-value'        # args is a mutable callByRef
+          args.b = args.b + 1         # change object in-place
+

+      args = callByRef(a='old-value', b=99)
+      func4(args)
+      print args.a, args.b
+

+   But there's probably no good reason to get this complicated :-).
+

+[Python's author favors solution 3 in most cases.] +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 8 23:49:46 1997 by +David Ascher +

+ +

4.36. Please explain the rules for local and global variables in Python.

+[Ken Manheimer] In Python, procedure variables are implicitly +global, unless they are assigned anywhere within the block. +In that case +they are implicitly local, and you need to explicitly declare them as +'global'. +

+Though a bit surprising at first, a moment's consideration explains +this. On one hand, requirement of 'global' for assigned vars provides +a bar against unintended side-effects. On the other hand, if global +were required for all global references, you'd be using global all the +time. Eg, you'd have to declare as global every reference to a +builtin function, or to a component of an imported module. This +clutter would defeat the usefulness of the 'global' declaration for +identifying side-effects. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Aug 28 09:53:27 1998 by +GvR +

+ +

4.37. How can I have modules that mutually import each other?

+Suppose you have the following modules: +

+foo.py: +

+	from bar import bar_var
+	foo_var=1
+

+bar.py: +

+	from foo import foo_var
+	bar_var=2
+

+The problem is that the above is processed by the interpreter thus: +

+	main imports foo
+	Empty globals for foo are created
+	foo is compiled and starts executing
+	foo imports bar
+	Empty globals for bar are created
+	bar is compiled and starts executing
+	bar imports foo (which is a no-op since there already is a module named foo)
+	bar.foo_var = foo.foo_var
+	...
+

+The last step fails, because Python isn't done with interpreting foo yet and the global symbol dict for foo is still empty. +

+The same thing happens when you use "import foo", and then try to access "foo.one" in global code. +

+There are (at least) three possible workarounds for this problem. +

+Guido van Rossum recommends to avoid all uses of "from <module> import ..." (so everything from an imported module is referenced as <module>.<name>) and to place all code inside functions. Initializations of global variables and class variables should use constants or built-in functions only. +

+Jim Roskind suggests the following order in each module: +

+ exports (globals, functions, and classes that don't need imported base classes)
+ import statements
+ active code (including globals that are initialized from imported values).
+

+Python's author doesn't like this approach much because the imports +appear in a strange place, but has to admit that it works. +

+Matthias Urlichs recommends to restructure your code so that the recursive import is not necessary in the first place. +

+These solutions are not mutually exclusive. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 06:52:51 2002 by +Matthias Urlichs +

+ +

4.38. How do I copy an object in Python?

+Try copy.copy() or copy.deepcopy() for the general case. Not all objects can be copied, but most can. +

+Dictionaries have a copy method. Sequences can be copied by slicing: +

+ new_l = l[:]
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 05:40:26 2002 by +Erno Kuusela +

+ +

4.39. How to implement persistent objects in Python? (Persistent == automatically saved to and restored from disk.)

+The library module "pickle" now solves this in a very general way +(though you still can't store things like open files, sockets or +windows), and the library module "shelve" uses pickle and (g)dbm to +create persistent mappings containing arbitrary Python objects. +For possibly better performance also look for the latest version +of the relatively recent cPickle module. +

+A more awkward way of doing things is to use pickle's little sister, +marshal. The marshal module provides very fast ways to store +noncircular basic Python types to files and strings, and back again. +Although marshal does not do fancy things like store instances or +handle shared references properly, it does run extremely fast. For +example loading a half megabyte of data may take less than a +third of a second (on some machines). This often beats doing +something more complex and general such as using gdbm with +pickle/shelve. +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 8 22:59:00 1997 by +David Ascher +

+ +

4.40. I try to use __spam and I get an error about _SomeClassName__spam.

+Variables with double leading underscore are "mangled" to provide a +simple but effective way to define class private variables. See the +chapter "New in Release 1.4" in the Python Tutorial. +

+ +Edit this entry / +Log info +

+ +

4.41. How do I delete a file? And other file questions.

+Use os.remove(filename) or os.unlink(filename); for documentation, +see the posix section of the library manual. They are the same, +unlink() is simply the Unix name for this function. In earlier +versions of Python, only os.unlink() was available. +

+To remove a directory, use os.rmdir(); use os.mkdir() to create one. +

+To rename a file, use os.rename(). +

+To truncate a file, open it using f = open(filename, "r+"), and use +f.truncate(offset); offset defaults to the current seek position. +(The "r+" mode opens the file for reading and writing.) +There's also os.ftruncate(fd, offset) for files opened with os.open() +-- for advanced Unix hacks only. +

+The shutil module also contains a number of functions to work on files +including copyfile, copytree, and rmtree amongst others. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 12:30:01 2000 by +Bjorn Pettersen +

+ +

4.42. How to modify urllib or httplib to support HTTP/1.1?

+Recent versions of Python (2.0 and onwards) support HTTP/1.1 natively. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 02:56:56 2001 by +Moshe Zadka +

+ +

4.43. Unexplicable syntax errors in compile() or exec.

+When a statement suite (as opposed to an expression) is compiled by +compile(), exec or execfile(), it must end in a newline. In some +cases, when the source ends in an indented block it appears that at +least two newlines are required. +

+ +Edit this entry / +Log info +

+ +

4.44. How do I convert a string to a number?

+For integers, use the built-in int() function, e.g. int('144') == 144. Similarly, long() converts from string to long integer, e.g. long('144') == 144L; and float() to floating-point, e.g. float('144') == 144.0. +

+Note that these are restricted to decimal interpretation, so +that int('0144') == 144 and int('0x144') raises ValueError. For Python +2.0 int takes the base to convert from as a second optional argument, so +int('0x144', 16) == 324. +

+For greater flexibility, or before Python 1.5, import the module +string and use the string.atoi() function for integers, +string.atol() for long integers, or string.atof() for +floating-point. E.g., +string.atoi('100', 16) == string.atoi('0x100', 0) == 256. +See the library reference manual section for the string module for +more details. +

+While you could use the built-in function eval() instead of +any of those, this is not recommended, because someone could pass you +a Python expression that might have unwanted side effects (like +reformatting your disk). It also has the effect of interpreting numbers +as Python expressions, so that e.g. eval('09') gives a syntax error +since Python regards numbers starting with '0' as octal (base 8). +

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 12:37:34 2000 by +Bjorn Pettersen +

+ +

4.45. How do I convert a number to a string?

+To convert, e.g., the number 144 to the string '144', use the +built-in function repr() or the backquote notation (these are +equivalent). If you want a hexadecimal or octal representation, use +the built-in functions hex() or oct(), respectively. For fancy +formatting, use the % operator on strings, just like C printf formats, +e.g. "%04d" % 144 yields '0144' and "%.3f" % (1/3.0) yields '0.333'. +See the library reference manual for details. +

+ +Edit this entry / +Log info +

+ +

4.46. How do I copy a file?

+There's the shutil module which contains a copyfile() +function that implements a copy loop; +it isn't good enough for the Macintosh, though: +it doesn't copy the resource fork and Finder info. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 02:59:40 2001 by +Moshe Zadka +

+ +

4.47. How do I check if an object is an instance of a given class or of a subclass of it?

+If you are developing the classes from scratch it might be better to +program in a more proper object-oriented style -- instead of doing a different +thing based on class membership, why not use a method and define the +method differently in different classes? +

+However, there are some legitimate situations +where you need to test for class membership. +

+In Python 1.5, you can use the built-in function isinstance(obj, cls). +

+The following approaches can be used with earlier Python versions: +

+An unobvious method is to raise the object +as an exception and to try to catch the exception with the class you're +testing for: +

+	def is_instance_of(the_instance, the_class):
+	    try:
+		raise the_instance
+	    except the_class:
+		return 1
+	    except:
+		return 0
+

+This technique can be used to distinguish "subclassness" +from a collection of classes as well +

+                try:
+                              raise the_instance
+                except Audible:
+                              the_instance.play(largo)
+                except Visual:
+                              the_instance.display(gaudy)
+                except Olfactory:
+                              sniff(the_instance)
+                except:
+                              raise ValueError, "dunno what to do with this!"
+

+This uses the fact that exception catching tests for class or subclass +membership. +

+A different approach is to test for the presence of a class attribute that +is presumably unique for the given class. For instance: +

+	class MyClass:
+	    ThisIsMyClass = 1
+	    ...
+

+	def is_a_MyClass(the_instance):
+	    return hasattr(the_instance, 'ThisIsMyClass')
+

+This version is easier to inline, and probably faster (inlined it +is definitely faster). The disadvantage is that someone else could cheat: +

+	class IntruderClass:
+	    ThisIsMyClass = 1    # Masquerade as MyClass
+	    ...
+

+but this may be seen as a feature (anyway, there are plenty of other ways +to cheat in Python). Another disadvantage is that the class must be +prepared for the membership test. If you do not "control the +source code" for the class it may not be advisable to modify the +class to support testability. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jan 2 15:16:04 1998 by +GvR +

+ +

4.48. What is delegation?

+Delegation refers to an object oriented technique Python programmers +may implement with particular ease. Consider the following: +

+  from string import upper
+

+  class UpperOut:
+        def __init__(self, outfile):
+              self.__outfile = outfile
+        def write(self, str):
+              self.__outfile.write( upper(str) )
+        def __getattr__(self, name):
+              return getattr(self.__outfile, name)
+

+Here the UpperOut class redefines the write method +to convert the argument string to upper case before +calling the underlying self.__outfile.write method, but +all other methods are delegated to the underlying +self.__outfile object. The delegation is accomplished +via the "magic" __getattr__ method. Please see the +language reference for more information on the use +of this method. +

+Note that for more general cases delegation can +get trickier. Particularly when attributes must be set +as well as gotten the class must define a __settattr__ +method too, and it must do so carefully. +

+The basic implementation of __setattr__ is roughly +equivalent to the following: +

+   class X:
+        ...
+        def __setattr__(self, name, value):
+             self.__dict__[name] = value
+        ...
+

+Most __setattr__ implementations must modify +self.__dict__ to store local state for self without +causing an infinite recursion. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 13 07:11:24 1997 by +aaron watters +

+ +

4.49. How do I test a Python program or component.

+We presume for the purposes of this question you are interested +in standalone testing, rather than testing your components inside +a testing framework. The best-known testing framework for Python +is the PyUnit module, maintained at +

+    http://pyunit.sourceforge.net/
+

+For standalone testing, it helps to write the program so that +it may be easily tested by using good modular design. +In particular your program +should have almost all functionality encapsulated in either functions +or class methods -- and this sometimes has the surprising and +delightful effect of making the program run faster (because +local variable accesses are faster than global accesses). +Furthermore the program should avoid depending on mutating +global variables, since this makes testing much more difficult to do. +

+The "global main logic" of your program may be as simple +as +

+  if __name__=="__main__":
+       main_logic()
+

+at the bottom of the main module of your program. +

+Once your program is organized as a tractable collection +of functions and class behaviours you should write test +functions that exercise the behaviours. A test suite +can be associated with each module which automates +a sequence of tests. This sounds like a lot of work, but +since Python is so terse and flexible it's surprisingly easy. +You can make coding much more pleasant and fun by +writing your test functions in parallel with the "production +code", since this makes it easy to find bugs and even +design flaws earlier. +

+"Support modules" that are not intended to be the main +module of a program may include a "test script interpretation" +which invokes a self test of the module. +

+   if __name__ == "__main__":
+      self_test()
+

+Even programs that interact with complex external +interfaces may be tested when the external interfaces are +unavailable by using "fake" interfaces implemented in +Python. For an example of a "fake" interface, the following +class defines (part of) a "fake" file interface: +

+ import string
+ testdata = "just a random sequence of characters"
+

+ class FakeInputFile:
+   data = testdata
+   position = 0
+   closed = 0
+

+   def read(self, n=None):
+       self.testclosed()
+       p = self.position
+       if n is None:
+          result= self.data[p:]
+       else:
+          result= self.data[p: p+n]
+       self.position = p + len(result)
+       return result
+

+   def seek(self, n, m=0):
+       self.testclosed()
+       last = len(self.data)
+       p = self.position
+       if m==0: 
+          final=n
+       elif m==1:
+          final=n+p
+       elif m==2:
+          final=len(self.data)+n
+       else:
+          raise ValueError, "bad m"
+       if final<0:
+          raise IOError, "negative seek"
+       self.position = final
+

+   def isatty(self):
+       return 0
+

+   def tell(self):
+       return self.position
+

+   def close(self):
+       self.closed = 1
+

+   def testclosed(self):
+       if self.closed:
+          raise IOError, "file closed"
+

+Try f=FakeInputFile() and test out its operations. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 01:12:10 2002 by +Neal Norwitz +

+ +

4.50. My multidimensional list (array) is broken! What gives?

+You probably tried to make a multidimensional array like this. +

+   A = [[None] * 2] * 3
+

+This makes a list containing 3 references to the same list of length +two. Changes to one row will show in all rows, which is probably not +what you want. The following works much better: +

+   A = [None]*3
+   for i in range(3):
+        A[i] = [None] * 2
+

+This generates a list containing 3 different lists of length two. +

+If you feel weird, you can also do it in the following way: +

+   w, h = 2, 3
+   A = map(lambda i,w=w: [None] * w, range(h))
+

+For Python 2.0 the above can be spelled using a list comprehension: +

+   w,h = 2,3
+   A = [ [None]*w for i in range(h) ]
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 12:18:35 2000 by +Bjorn Pettersen +

+ +

4.51. I want to do a complicated sort: can you do a Schwartzian Transform in Python?

+Yes, and in Python you only have to write it once: +

+ def st(List, Metric):
+     def pairing(element, M = Metric):
+           return (M(element), element)
+     paired = map(pairing, List)
+     paired.sort()
+     return map(stripit, paired)
+

+ def stripit(pair):
+     return pair[1]
+

+This technique, attributed to Randal Schwartz, sorts the elements +of a list by a metric which maps each element to its "sort value". +For example, if L is a list of string then +

+   import string
+   Usorted = st(L, string.upper)
+

+   def intfield(s):
+         return string.atoi( string.strip(s[10:15] ) )
+

+   Isorted = st(L, intfield)
+

+Usorted gives the elements of L sorted as if they were upper +case, and Isorted gives the elements of L sorted by the integer +values that appear in the string slices starting at position 10 +and ending at position 15. In Python 2.0 this can be done more +naturally with list comprehensions: +

+  tmp1 = [ (x.upper(), x) for x in L ] # Schwartzian transform
+  tmp1.sort()
+  Usorted = [ x[1] for x in tmp1 ]
+

+  tmp2 = [ (int(s[10:15]), s) for s in L ] # Schwartzian transform
+  tmp2.sort()
+  Isorted = [ x[1] for x in tmp2 ]
+

+Note that Isorted may also be computed by +

+   def Icmp(s1, s2):
+         return cmp( intfield(s1), intfield(s2) )
+

+   Isorted = L[:]
+   Isorted.sort(Icmp)
+

+but since this method computes intfield many times for each +element of L, it is slower than the Schwartzian Transform. +

+ +Edit this entry / +Log info + +/ Last changed on Sat Jun 1 19:18:46 2002 by +Neal Norwitz +

+ +

4.52. How to convert between tuples and lists?

+The function tuple(seq) converts any sequence into a tuple with +the same items in the same order. +For example, tuple([1, 2, 3]) yields (1, 2, 3) and tuple('abc') +yields ('a', 'b', 'c'). If the argument is +a tuple, it does not make a copy but returns the same object, so +it is cheap to call tuple() when you aren't sure that an object +is already a tuple. +

+The function list(seq) converts any sequence into a list with +the same items in the same order. +For example, list((1, 2, 3)) yields [1, 2, 3] and list('abc') +yields ['a', 'b', 'c']. If the argument is a list, +it makes a copy just like seq[:] would. +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 14 14:18:53 1998 by +Tim Peters +

+ +

4.53. Files retrieved with urllib contain leading garbage that looks like email headers.

+Extremely old versions of Python supplied libraries which +did not support HTTP/1.1; the vanilla httplib in Python 1.4 +only recognized HTTP/1.0. In Python 2.0 full HTTP/1.1 support is included. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jan 8 17:26:18 2001 by +Steve Holden +

+ +

4.54. How do I get a list of all instances of a given class?

+Python does not keep track of all instances of a class (or of a +built-in type). +

+You can program the class's constructor to keep track of all +instances, but unless you're very clever, this has the disadvantage +that the instances never get deleted,because your list of all +instances keeps a reference to them. +

+(The trick is to regularly inspect the reference counts of the +instances you've retained, and if the reference count is below a +certain level, remove it from the list. Determining that level is +tricky -- it's definitely larger than 1.) +

+ +Edit this entry / +Log info + +/ Last changed on Tue May 27 23:52:16 1997 by +GvR +

+ +

4.55. A regular expression fails with regex.error: match failure.

+This is usually caused by too much backtracking; the regular +expression engine has a fixed size stack which holds at most 4000 +backtrack points. Every character matched by e.g. ".*" accounts for a +backtrack point, so even a simple search like +

+  regex.match('.*x',"x"*5000)
+

+will fail. +

+This is fixed in the re module introduced with +Python 1.5; consult the Library Reference section on re for more information. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jul 30 12:35:49 1998 by +A.M. Kuchling +

+ +

4.56. I can't get signal handlers to work.

+The most common problem is that the signal handler is declared +with the wrong argument list. It is called as +

+	handler(signum, frame)
+

+so it should be declared with two arguments: +

+	def handler(signum, frame):
+		...
+

+ +Edit this entry / +Log info + +/ Last changed on Wed May 28 09:29:08 1997 by +GvR +

+ +

4.57. I can't use a global variable in a function? Help!

+Did you do something like this? +

+   x = 1 # make a global
+

+   def f():
+         print x # try to print the global
+         ...
+         for j in range(100):
+              if q>3:
+                 x=4
+

+Any variable assigned in a function is local to that function. +unless it is specifically declared global. Since a value is bound +to x as the last statement of the function body, the compiler +assumes that x is local. Consequently the "print x" +attempts to print an uninitialized local variable and will +trigger a NameError. +

+In such cases the solution is to insert an explicit global +declaration at the start of the function, making it +

+   def f():
+         global x
+         print x # try to print the global
+         ...
+         for j in range(100):
+              if q>3:
+                 x=4
+

+In this case, all references to x are interpreted as references +to the x from the module namespace. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Feb 12 15:52:12 2001 by +Steve Holden +

+ +

4.58. What's a negative index? Why doesn't list.insert() use them?

+Python sequences are indexed with positive numbers and +negative numbers. For positive numbers 0 is the first index +1 is the second index and so forth. For negative indices -1 +is the last index and -2 is the pentultimate (next to last) index +and so forth. Think of seq[-n] as the same as seq[len(seq)-n]. +

+Using negative indices can be very convenient. For example +if the string Line ends in a newline then Line[:-1] is all of Line except +the newline. +

+Sadly the list builtin method L.insert does not observe negative +indices. This feature could be considered a mistake but since +existing programs depend on this feature it may stay around +forever. L.insert for negative indices inserts at the start of the +list. To get "proper" negative index behaviour use L[n:n] = [x] +in place of the insert method. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 13 07:03:18 1997 by +aaron watters +

+ +

4.59. How can I sort one list by values from another list?

+You can sort lists of tuples. +

+  >>> list1 = ["what", "I'm", "sorting", "by"]
+  >>> list2 = ["something", "else", "to", "sort"]
+  >>> pairs = map(None, list1, list2)
+  >>> pairs
+  [('what', 'something'), ("I'm", 'else'), ('sorting', 'to'), ('by', 'sort')]
+  >>> pairs.sort()
+  >>> pairs
+  [("I'm", 'else'), ('by', 'sort'), ('sorting', 'to'), ('what', 'something')]
+  >>> result = pairs[:]
+  >>> for i in xrange(len(result)): result[i] = result[i][1]
+  ...
+  >>> result
+  ['else', 'sort', 'to', 'something']
+

+And if you didn't understand the question, please see the +example above ;c). Note that "I'm" sorts before "by" because +uppercase "I" comes before lowercase "b" in the ascii order. +Also see 4.51. +

+In Python 2.0 this can be done like: +

+ >>> list1 = ["what", "I'm", "sorting", "by"]
+ >>> list2 = ["something", "else", "to", "sort"]
+ >>> pairs = zip(list1, list2)
+ >>> pairs
+ [('what', 'something'), ("I'm", 'else'), ('sorting', 'to'), ('by', 'sort')]
+ >>> pairs.sort()
+ >>> result = [ x[1] for x in pairs ]
+ >>> result
+ ['else', 'sort', 'to', 'something']
+

+[Followup] +

+Someone asked, why not this for the last steps: +

+  result = []
+  for p in pairs: result.append(p[1])
+

+This is much more legible. However, a quick test shows that +it is almost twice as slow for long lists. Why? First of all, +the append() operation has to reallocate memory, and while it +uses some tricks to avoid doing that each time, it still has +to do it occasionally, and apparently that costs quite a bit. +Second, the expression "result.append" requires an extra +attribute lookup. The attribute lookup could be done away +with by rewriting as follows: +

+  result = []
+  append = result.append
+  for p in pairs: append(p[1])
+

+which gains back some speed, but is still considerably slower +than the original solution, and hardly less convoluted. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 12:56:35 2000 by +Bjorn Pettersen +

+ +

4.60. Why doesn't dir() work on builtin types like files and lists?

+It does starting with Python 1.5. +

+Using 1.4, you can find out which methods a given object supports +by looking at its __methods__ attribute: +

+    >>> List = []
+    >>> List.__methods__
+    ['append', 'count', 'index', 'insert', 'remove', 'reverse', 'sort']
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Sep 16 14:56:42 1999 by +Skip Montanaro +

+ +

4.61. How can I mimic CGI form submission (METHOD=POST)?

+I would like to retrieve web pages that are the result of POSTing a +form. Is there existing code that would let me do this easily? +

+Yes. Here's a simple example that uses httplib. +

+    #!/usr/local/bin/python
+

+    import httplib, sys, time
+

+    ### build the query string
+    qs = "First=Josephine&MI=Q&Last=Public"
+

+    ### connect and send the server a path
+    httpobj = httplib.HTTP('www.some-server.out-there', 80)
+    httpobj.putrequest('POST', '/cgi-bin/some-cgi-script')
+    ### now generate the rest of the HTTP headers...
+    httpobj.putheader('Accept', '*/*')
+    httpobj.putheader('Connection', 'Keep-Alive')
+    httpobj.putheader('Content-type', 'application/x-www-form-urlencoded')
+    httpobj.putheader('Content-length', '%d' % len(qs))
+    httpobj.endheaders()
+    httpobj.send(qs)
+    ### find out what the server said in response...
+    reply, msg, hdrs = httpobj.getreply()
+    if reply != 200:
+	sys.stdout.write(httpobj.getfile().read())
+

+Note that in general for "url encoded posts" (the default) query strings must be "quoted" to, for example, change equals signs and spaces to an encoded form when they occur in name or value. Use urllib.quote to perform this quoting. For example to send name="Guy Steele, Jr.": +

+   >>> from urllib import quote
+   >>> x = quote("Guy Steele, Jr.")
+   >>> x
+   'Guy%20Steele,%20Jr.'
+   >>> query_string = "name="+x
+   >>> query_string
+   'name=Guy%20Steele,%20Jr.'
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 21 03:47:07 1999 by +TAB +

+ +

4.62. If my program crashes with a bsddb (or anydbm) database open, it gets corrupted. How come?

+Databases opened for write access with the bsddb module (and often by +the anydbm module, since it will preferentially use bsddb) must +explicitly be closed using the close method of the database. The +underlying libdb package caches database contents which need to be +converted to on-disk form and written, unlike regular open files which +already have the on-disk bits in the kernel's write buffer, where they +can just be dumped by the kernel with the program exits. +

+If you have initialized a new bsddb database but not written anything to +it before the program crashes, you will often wind up with a zero-length +file and encounter an exception the next time the file is opened. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 01:15:01 2002 by +Neal Norwitz +

+ +

4.63. How do I make a Python script executable on Unix?

+You need to do two things: the script file's mode must be executable +(include the 'x' bit), and the first line must begin with #! +followed by the pathname for the Python interpreter. +

+The first is done by executing 'chmod +x scriptfile' or perhaps +'chmod 755 scriptfile'. +

+The second can be done in a number of way. The most straightforward +way is to write +

+  #!/usr/local/bin/python
+

+as the very first line of your file - or whatever the pathname is +where the python interpreter is installed on your platform. +

+If you would like the script to be independent of where the python +interpreter lives, you can use the "env" program. On almost all +platforms, the following will work, assuming the python interpreter +is in a directory on the user's $PATH: +

+  #! /usr/bin/env python
+

+Note -- *don't* do this for CGI scripts. The $PATH variable for +CGI scripts is often very minimal, so you need to use the actual +absolute pathname of the interpreter. +

+Occasionally, a user's environment is so full that the /usr/bin/env +program fails; or there's no env program at all. +In that case, you can try the following hack (due to Alex Rezinsky): +

+  #! /bin/sh
+  """:"
+  exec python $0 ${1+"$@"}
+  """
+

+The disadvantage is that this defines the script's __doc__ string. +However, you can fix that by adding +

+  __doc__ = """...Whatever..."""
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jan 15 09:19:16 2001 by +Neal Norwitz +

+ +

4.64. How do you remove duplicates from a list?

+See the Python Cookbook for a long discussion of many cool ways: +

+    http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52560
+

+Generally, if you don't mind reordering the List +

+   if List:
+      List.sort()
+      last = List[-1]
+      for i in range(len(List)-2, -1, -1):
+          if last==List[i]: del List[i]
+          else: last=List[i]
+

+If all elements of the list may be used as +dictionary keys (ie, they are all hashable) +this is often faster +

+   d = {}
+   for x in List: d[x]=x
+   List = d.values()
+

+Also, for extremely large lists you might +consider more optimal alternatives to the first one. +The second one is pretty good whenever it can +be used. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 24 21:56:33 2002 by +Tim Peters +

+ +

4.65. Are there any known year 2000 problems in Python?

+I am not aware of year 2000 deficiencies in Python 1.5. Python does +very few date calculations and for what it does, it relies on the C +library functions. Python generally represent times either as seconds +since 1970 or as a tuple (year, month, day, ...) where the year is +expressed with four digits, which makes Y2K bugs unlikely. So as long +as your C library is okay, Python should be okay. Of course, I cannot +vouch for your Python code! +

+Given the nature of freely available software, I have to add that this statement is not +legally binding. The Python copyright notice contains the following +disclaimer: +

+  STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH
+  REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
+  MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH
+  CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
+  DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
+  PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+  PERFORMANCE OF THIS SOFTWARE.
+

+The good news is that if you encounter a problem, you have full +source available to track it down and fix it! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Apr 10 14:59:31 1998 by +GvR +

+ +

4.66. I want a version of map that applies a method to a sequence of objects! Help!

+Get fancy! +

+  def method_map(objects, method, arguments):
+       """method_map([a,b], "flog", (1,2)) gives [a.flog(1,2), b.flog(1,2)]"""
+       nobjects = len(objects)
+       methods = map(getattr, objects, [method]*nobjects)
+       return map(apply, methods, [arguments]*nobjects)
+

+It's generally a good idea to get to know the mysteries of map and apply +and getattr and the other dynamic features of Python. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jan 5 14:21:14 1998 by +Aaron Watters +

+ +

4.67. How do I generate random numbers in Python?

+The standard library module "random" implements a random number +generator. Usage is simple: +

+    import random
+

+    random.random()
+

+This returns a random floating point number in the range [0, 1). +

+There are also many other specialized generators in this module, such +as +

+    randrange(a, b) chooses an integer in the range [a, b)
+    uniform(a, b) chooses a floating point number in the range [a, b)
+    normalvariate(mean, sdev) sample from normal (Gaussian) distribution
+

+Some higher-level functions operate on sequences directly, such as +

+    choice(S) chooses random element from a given sequence
+    shuffle(L) shuffles a list in-place, i.e. permutes it randomly
+

+There's also a class, Random, which you can instantiate +to create independent multiple random number generators. +

+All this is documented in the library reference manual. Note that +the module "whrandom" is obsolete. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 01:16:51 2002 by +Neal Norwitz +

+ +

4.68. How do I access the serial (RS232) port?

+There's a Windows serial communication module (for communication +over RS 232 serial ports) at +

+  ftp://ftp.python.org/pub/python/contrib/sio-151.zip
+  http://www.python.org/ftp/python/contrib/sio-151.zip
+

+For DOS, try Hans Nowak's Python-DX, which supports this, at: +

+  http://www.cuci.nl/~hnowak/
+

+For Unix, see a usenet post by Mitch Chapman: +

+  http://groups.google.com/groups?selm=34A04430.CF9@ohioee.com
+

+For Win32, POSIX(Linux, BSD, *), Jython, Chris': +

+  http://pyserial.sourceforge.net
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Jul 2 21:11:07 2002 by +Chris Liechti +

+ +

4.69. Images on Tk-Buttons don't work in Py15?

+They do work, but you must keep your own reference to the image +object now. More verbosely, you must make sure that, say, a global +variable or a class attribute refers to the object. +

+Quoting Fredrik Lundh from the mailinglist: +

+  Well, the Tk button widget keeps a reference to the internal
+  photoimage object, but Tkinter does not.  So when the last
+  Python reference goes away, Tkinter tells Tk to release the
+  photoimage.  But since the image is in use by a widget, Tk
+  doesn't destroy it.  Not completely.  It just blanks the image,
+  making it completely transparent...
+

+  And yes, there was a bug in the keyword argument handling
+  in 1.4 that kept an extra reference around in some cases.  And
+  when Guido fixed that bug in 1.5, he broke quite a few Tkinter
+  programs...
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Feb 3 11:31:03 1998 by +Case Roole +

+ +

4.70. Where is the math.py (socket.py, regex.py, etc.) source file?

+If you can't find a source file for a module it may be a builtin +or dynamically loaded module implemented in C, C++ or other +compiled language. In this case you may not have the source +file or it may be something like mathmodule.c, somewhere in +a C source directory (not on the Python Path). +

+Fredrik Lundh (fredrik@pythonware.com) explains (on the python-list): +

+There are (at least) three kinds of modules in Python: +1) modules written in Python (.py); +2) modules written in C and dynamically loaded (.dll, .pyd, .so, .sl, etc); +3) modules written in C and linked with the interpreter; to get a list +of these, type: +

+    import sys
+    print sys.builtin_module_names
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Feb 3 13:55:33 1998 by +Aaron Watters +

+ +

4.71. How do I send mail from a Python script?

+The standard library module smtplib does this. +Here's a very simple interactive mail +sender that uses it. This method will work on any host that +supports an SMTP listener. +

+    import sys, smtplib
+

+    fromaddr = raw_input("From: ")
+    toaddrs  = raw_input("To: ").split(',')
+    print "Enter message, end with ^D:"
+    msg = ''
+    while 1:
+        line = sys.stdin.readline()
+        if not line:
+            break
+        msg = msg + line
+

+    # The actual mail send
+    server = smtplib.SMTP('localhost')
+    server.sendmail(fromaddr, toaddrs, msg)
+    server.quit()
+

+If the local host doesn't have an SMTP listener, you need to find one. The simple method is to ask the user. Alternately, you can use the DNS system to find the mail gateway(s) responsible for the source address. +

+A Unix-only alternative uses sendmail. The location of the +sendmail program varies between systems; sometimes it is +/usr/lib/sendmail, sometime /usr/sbin/sendmail. The sendmail manual +page will help you out. Here's some sample code: +

+  SENDMAIL = "/usr/sbin/sendmail" # sendmail location
+  import os
+  p = os.popen("%s -t -i" % SENDMAIL, "w")
+  p.write("To: cary@ratatosk.org\n")
+  p.write("Subject: test\n")
+  p.write("\n") # blank line separating headers from body
+  p.write("Some text\n")
+  p.write("some more text\n")
+  sts = p.close()
+  if sts != 0:
+      print "Sendmail exit status", sts
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 07:05:12 2002 by +Matthias Urlichs +

+ +

4.72. How do I avoid blocking in connect() of a socket?

+The select module is widely known to help with asynchronous +I/O on sockets once they are connected. However, it is less +than common knowledge how to avoid blocking on the initial +connect() call. Jeremy Hylton has the following advice (slightly +edited): +

+To prevent the TCP connect from blocking, you can set the socket to +non-blocking mode. Then when you do the connect(), you will either +connect immediately (unlikely) or get an exception that contains the +errno. errno.EINPROGRESS indicates that the connection is in +progress, but hasn't finished yet. Different OSes will return +different errnos, so you're going to have to check. I can tell you +that different versions of Solaris return different errno values. +

+In Python 1.5 and later, you can use connect_ex() to avoid +creating an exception. It will just return the errno value. +

+To poll, you can call connect_ex() again later -- 0 or errno.EISCONN +indicate that you're connected -- or you can pass this socket to +select (checking to see if it is writeable). +

+ +Edit this entry / +Log info + +/ Last changed on Tue Feb 24 21:30:45 1998 by +GvR +

+ +

4.73. How do I specify hexadecimal and octal integers?

+To specify an octal digit, precede the octal value with a zero. For example, +to set the variable "a" to the octal value "10" (8 in decimal), type: +

+    >>> a = 010
+

+To verify that this works, you can type "a" and hit enter while in the +interpreter, which will cause Python to spit out the current value of "a" +in decimal: +

+    >>> a
+    8
+

+Hexadecimal is just as easy. Simply precede the hexadecimal number with a +zero, and then a lower or uppercase "x". Hexadecimal digits can be specified +in lower or uppercase. For example, in the Python interpreter: +

+    >>> a = 0xa5
+    >>> a
+    165
+    >>> b = 0XB2
+    >>> b
+    178
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Mar 3 12:53:16 1998 by +GvR +

+ +

4.74. How to get a single keypress at a time?

+For Windows, see question 8.2. Here is an answer for Unix (see also 4.94). +

+There are several solutions; some involve using curses, which is a +pretty big thing to learn. Here's a solution without curses, due +to Andrew Kuchling (adapted from code to do a PGP-style +randomness pool): +

+        import termios, sys, os
+        fd = sys.stdin.fileno()
+        old = termios.tcgetattr(fd)
+        new = termios.tcgetattr(fd)
+        new[3] = new[3] & ~termios.ICANON & ~termios.ECHO
+        new[6][termios.VMIN] = 1
+        new[6][termios.VTIME] = 0
+        termios.tcsetattr(fd, termios.TCSANOW, new)
+        s = ''    # We'll save the characters typed and add them to the pool.
+        try:
+            while 1:
+                c = os.read(fd, 1)
+                print "Got character", `c`
+                s = s+c
+        finally:
+            termios.tcsetattr(fd, termios.TCSAFLUSH, old)
+

+You need the termios module for any of this to work, and I've only +tried it on Linux, though it should work elsewhere. It turns off +stdin's echoing and disables canonical mode, and then reads a +character at a time from stdin, noting the time after each keystroke. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Oct 24 00:36:56 2002 by +chris +

+ +

4.75. How can I overload constructors (or methods) in Python?

+(This actually applies to all methods, but somehow the question +usually comes up first in the context of constructors.) +

+Where in C++ you'd write +

+    class C {
+        C() { cout << "No arguments\n"; }
+        C(int i) { cout << "Argument is " << i << "\n"; }
+    }
+

+in Python you have to write a single constructor that catches all +cases using default arguments. For example: +

+    class C:
+        def __init__(self, i=None):
+            if i is None:
+                print "No arguments"
+            else:
+                print "Argument is", i
+

+This is not entirely equivalent, but close enough in practice. +

+You could also try a variable-length argument list, e.g. +

+        def __init__(self, *args):
+            ....
+

+The same approach works for all method definitions. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Apr 20 11:55:55 1998 by +GvR +

+ +

4.76. How do I pass keyword arguments from one method to another?

+Use apply. For example: +

+    class Account:
+        def __init__(self, **kw):
+            self.accountType = kw.get('accountType')
+            self.balance = kw.get('balance')
+

+    class CheckingAccount(Account):
+        def __init__(self, **kw):
+            kw['accountType'] = 'checking'
+            apply(Account.__init__, (self,), kw)
+

+    myAccount = CheckingAccount(balance=100.00)
+

+In Python 2.0 you can call it directly using the new ** syntax: +

+    class CheckingAccount(Account):
+        def __init__(self, **kw):
+            kw['accountType'] = 'checking'
+            Account.__init__(self, **kw)
+

+or more generally: +

+ >>> def f(x, *y, **z):
+ ...  print x,y,z
+ ...
+ >>> Y = [1,2,3]
+ >>> Z = {'foo':3,'bar':None}
+ >>> f('hello', *Y, **Z)
+ hello (1, 2, 3) {'foo': 3, 'bar': None}
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 28 13:04:01 2000 by +Bjorn Pettersen +

+ +

4.77. What module should I use to help with generating HTML?

+Check out HTMLgen written by Robin Friedrich. It's a class library +of objects corresponding to all the HTML 3.2 markup tags. It's used +when you are writing in Python and wish to synthesize HTML pages for +generating a web or for CGI forms, etc. +

+It can be found in the FTP contrib area on python.org or on the +Starship. Use the search engines there to locate the latest version. +

+It might also be useful to consider DocumentTemplate, which offers clear +separation between Python code and HTML code. DocumentTemplate is part +of the Bobo objects publishing system (http:/www.digicool.com/releases) +but can be used independantly of course! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Aug 28 09:54:58 1998 by +GvR +

+ +

4.78. How do I create documentation from doc strings?

+Use gendoc, by Daniel Larson. See +

+http://starship.python.net/crew/danilo/ +

+It can create HTML from the doc strings in your Python source code. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Oct 7 17:15:51 2002 by +Phil Rittenhouse +

+ +

4.79. How do I read (or write) binary data?

+For complex data formats, it's best to use +use the struct module. It's documented in the library reference. +It allows you to take a string read from a file containing binary +data (usually numbers) and convert it to Python objects; and vice +versa. +

+For example, the following code reads two 2-byte integers +and one 4-byte integer in big-endian format from a file: +

+  import struct
+

+  f = open(filename, "rb")  # Open in binary mode for portability
+  s = f.read(8)
+  x, y, z = struct.unpack(">hhl", s)
+

+The '>' in the format string forces bin-endian data; the letter +'h' reads one "short integer" (2 bytes), and 'l' reads one +"long integer" (4 bytes) from the string. +

+For data that is more regular (e.g. a homogeneous list of ints or +floats), you can also use the array module, also documented +in the library reference. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Oct 7 09:16:45 1998 by +GvR +

+ +

4.80. I can't get key bindings to work in Tkinter

+An oft-heard complaint is that event handlers bound to events +with the bind() method don't get handled even when the appropriate +key is pressed. +

+The most common cause is that the widget to which the binding applies +doesn't have "keyboard focus". Check out the Tk documentation +for the focus command. Usually a widget is given the keyboard +focus by clicking in it (but not for labels; see the taketocus +option). +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jun 12 09:37:33 1998 by +GvR +

+ +

4.81. "import crypt" fails

+[Unix] +

+Starting with Python 1.5, the crypt module is disabled by default. +In order to enable it, you must go into the Python source tree and +edit the file Modules/Setup to enable it (remove a '#' sign in +front of the line starting with '#crypt'). Then rebuild. +You may also have to add the string '-lcrypt' to that same line. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 5 08:57:09 1998 by +GvR +

+ +

4.82. Are there coding standards or a style guide for Python programs?

+Yes, Guido has written the "Python Style Guide". See +http://www.python.org/doc/essays/styleguide.html +

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 29 09:50:27 1998 by +Joseph VanAndel +

+ +

4.83. How do I freeze Tkinter applications?

+Freeze is a tool to create stand-alone applications (see 4.28). +

+When freezing Tkinter applications, the applications will not be +truly stand-alone, as the application will still need the tcl and +tk libraries. +

+One solution is to ship the application with the tcl and tk libraries, +and point to them at run-time using the TCL_LIBRARY and TK_LIBRARY +environment variables. +

+To get truly stand-alone applications, the Tcl scripts that form +the library have to be integrated into the application as well. One +tool supporting that is SAM (stand-alone modules), which is part +of the Tix distribution (http://tix.mne.com). Build Tix with SAM +enabled, perform the appropriate call to Tclsam_init etc inside +Python's Modules/tkappinit.c, and link with libtclsam +and libtksam (you might include the Tix libraries as well). +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jan 20 17:35:01 1999 by +Martin v. L�wis +

+ +

4.84. How do I create static class data and static class methods?

+[Tim Peters, tim_one@email.msn.com] +

+Static data (in the sense of C++ or Java) is easy; static methods (again in the sense of C++ or Java) are not supported directly. +

+STATIC DATA +

+For example, +

+    class C:
+        count = 0   # number of times C.__init__ called
+

+        def __init__(self):
+            C.count = C.count + 1
+

+        def getcount(self):
+            return C.count  # or return self.count
+

+c.count also refers to C.count for any c such that isinstance(c, C) holds, unless overridden by c itself or by some class on the base-class search path from c.__class__ back to C. +

+Caution: within a method of C, +

+    self.count = 42
+

+creates a new and unrelated instance vrbl named "count" in self's own dict. So rebinding of a class-static data name needs the +

+    C.count = 314
+

+form whether inside a method or not. +

+STATIC METHODS +

+Static methods (as opposed to static data) are unnatural in Python, because +

+    C.getcount
+

+returns an unbound method object, which can't be invoked without supplying an instance of C as the first argument. +

+The intended way to get the effect of a static method is via a module-level function: +

+    def getcount():
+        return C.count
+

+If your code is structured so as to define one class (or tightly related class hierarchy) per module, this supplies the desired encapsulation. +

+Several tortured schemes for faking static methods can be found by searching DejaNews. Most people feel such cures are worse than the disease. Perhaps the least obnoxious is due to Pekka Pessi (mailto:ppessi@hut.fi): +

+    # helper class to disguise function objects
+    class _static:
+        def __init__(self, f):
+            self.__call__ = f
+

+    class C:
+        count = 0
+

+        def __init__(self):
+            C.count = C.count + 1
+

+        def getcount():
+            return C.count
+        getcount = _static(getcount)
+

+        def sum(x, y):
+            return x + y
+        sum = _static(sum)
+

+    C(); C()
+    c = C()
+    print C.getcount()  # prints 3
+    print c.getcount()  # prints 3
+    print C.sum(27, 15) # prints 42
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Jan 21 21:35:38 1999 by +Tim Peters +

+ +

4.85. import('x.y.z') returns <module 'x'>; how do I get z?

+Try +

+   __import__('x.y.z').y.z
+

+For more realistic situations, you may have to do something like +

+   m = __import__(s)
+   for i in string.split(s, ".")[1:]:
+       m = getattr(m, i)
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Jan 28 11:01:43 1999 by +GvR +

+ +

4.86. Basic thread wisdom

+Please note that there is no way to take advantage of +multiprocessor hardware using the Python thread model. The interpreter +uses a global interpreter lock (GIL), +which does not allow multiple threads to be concurrently active. +

+If you write a simple test program like this: +

+  import thread
+  def run(name, n):
+      for i in range(n): print name, i
+  for i in range(10):
+      thread.start_new(run, (i, 100))
+

+none of the threads seem to run! The reason is that as soon as +the main thread exits, all threads are killed. +

+A simple fix is to add a sleep to the end of the program, +sufficiently long for all threads to finish: +

+  import thread, time
+  def run(name, n):
+      for i in range(n): print name, i
+  for i in range(10):
+      thread.start_new(run, (i, 100))
+  time.sleep(10) # <----------------------------!
+

+But now (on many platforms) the threads don't run in parallel, +but appear to run sequentially, one at a time! The reason is +that the OS thread scheduler doesn't start a new thread until +the previous thread is blocked. +

+A simple fix is to add a tiny sleep to the start of the run +function: +

+  import thread, time
+  def run(name, n):
+      time.sleep(0.001) # <---------------------!
+      for i in range(n): print name, i
+  for i in range(10):
+      thread.start_new(run, (i, 100))
+  time.sleep(10)
+

+Some more hints: +

+Instead of using a time.sleep() call at the end, it's +better to use some kind of semaphore mechanism. One idea is to +use a the Queue module to create a queue object, let each thread +append a token to the queue when it finishes, and let the main +thread read as many tokens from the queue as there are threads. +

+Use the threading module instead of the thread module. It's part +of Python since version 1.5.1. It takes care of all these details, +and has many other nice features too! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Feb 7 16:21:55 2003 by +GvR +

+ +

4.87. Why doesn't closing sys.stdout (stdin, stderr) really close it?

+Python file objects are a high-level layer of abstraction on top of C streams, which in turn are a medium-level layer of abstraction on top of (among other things) low-level C file descriptors. +

+For most file objects f you create in Python via the builtin "open" function, f.close() marks the Python file object as being closed from Python's point of view, and also arranges to close the underlying C stream. This happens automatically too, in f's destructor, when f becomes garbage. +

+But stdin, stdout and stderr are treated specially by Python, because of the special status also given to them by C: doing +

+    sys.stdout.close() # ditto for stdin and stderr
+

+marks the Python-level file object as being closed, but does not close the associated C stream (provided sys.stdout is still bound to its default value, which is the stream C also calls "stdout"). +

+To close the underlying C stream for one of these three, you should first be sure that's what you really want to do (e.g., you may confuse the heck out of extension modules trying to do I/O). If it is, use os.close: +

+    os.close(0)   # close C's stdin stream
+    os.close(1)   # close C's stdout stream
+    os.close(2)   # close C's stderr stream
+

+ +Edit this entry / +Log info + +/ Last changed on Sat Apr 17 02:22:35 1999 by +Tim Peters +

+ +

4.88. What kinds of global value mutation are thread-safe?

+[adapted from c.l.py responses by Gordon McMillan & GvR] +

+A global interpreter lock (GIL) is used internally to ensure that only one thread runs in the Python VM at a time. In general, Python offers to switch among threads only between bytecode instructions (how frequently it offers to switch can be set via sys.setcheckinterval). Each bytecode instruction-- and all the C implementation code reached from it --is therefore atomic. +

+In theory, this means an exact accounting requires an exact understanding of the PVM bytecode implementation. In practice, it means that operations on shared vrbls of builtin data types (ints, lists, dicts, etc) that "look atomic" really are. +

+For example, these are atomic (L, L1, L2 are lists, D, D1, D2 are dicts, x, y +are objects, i, j are ints): +

+    L.append(x)
+    L1.extend(L2)
+    x = L[i]
+    x = L.pop()
+    L1[i:j] = L2
+    L.sort()
+    x = y
+    x.field = y
+    D[x] = y
+    D1.update(D2)
+    D.keys()
+

+These aren't: +

+    i = i+1
+    L.append(L[-1])
+    L[i] = L[j]
+    D[x] = D[x] + 1
+

+Note: operations that replace other objects may invoke those other objects' __del__ method when their reference count reaches zero, and that can affect things. This is especially true for the mass updates to dictionaries and lists. When in doubt, use a mutex! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Feb 7 16:21:03 2003 by +GvR +

+ +

4.89. How do I modify a string in place?

+Strings are immutable (see question 6.2) so you cannot modify a string +directly. If you need an object with this ability, try converting the +string to a list or take a look at the array module. +

+    >>> s = "Hello, world"
+    >>> a = list(s)
+    >>> print a
+    ['H', 'e', 'l', 'l', 'o', ',', ' ', 'w', 'o', 'r', 'l', 'd']
+    >>> a[7:] = list("there!")
+    >>> import string
+    >>> print string.join(a, '')
+    'Hello, there!'
+

+    >>> import array
+    >>> a = array.array('c', s)
+    >>> print a
+    array('c', 'Hello, world')
+    >>> a[0] = 'y' ; print a
+    array('c', 'yello world')
+    >>> a.tostring()
+    'yello, world'
+

+ +Edit this entry / +Log info + +/ Last changed on Tue May 18 01:22:47 1999 by +Andrew Dalke +

+ +

4.90. How to pass on keyword/optional parameters/arguments

+Q: How can I pass on optional or keyword parameters from one function to another? +

+	def f1(a, *b, **c):
+		...
+

+A: In Python 2.0 and above: +

+	def f2(x, *y, **z):
+		...
+		z['width']='14.3c'
+		...
+		f1(x, *y, **z)
+

+   Note: y can be any sequence (e.g., list or tuple) and z must be a dict.
+

+A: For versions prior to 2.0, use 'apply', like: +

+	def f2(x, *y, **z):
+		...
+		z['width']='14.3c'
+		...
+		apply(f1, (x,)+y, z)
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 07:20:56 2002 by +Matthias Urlichs +

+ +

4.91. How can I get a dictionary to display its keys in a consistent order?

+In general, dictionaries store their keys in an unpredictable order, +so the display order of a dictionary's elements will be similarly +unpredictable. +(See +Question 6.12 +to understand why this is so.) +

+This can be frustrating if you want to save a printable version to a +file, make some changes and then compare it with some other printed +dictionary. If you have such needs you can subclass UserDict.UserDict +to create a SortedDict class that prints itself in a predictable order. +Here's one simpleminded implementation of such a class: +

+  import UserDict, string
+

+  class SortedDict(UserDict.UserDict):
+    def __repr__(self):
+      result = []
+      append = result.append
+      keys = self.data.keys()
+      keys.sort()
+      for k in keys:
+        append("%s: %s" % (`k`, `self.data[k]`))
+      return "{%s}" % string.join(result, ", ")
+

+    ___str__ = __repr__
+

+This will work for many common situations you might encounter, though +it's far from a perfect solution. (It won't have any effect on the +pprint module and does not transparently handle values that are or +contain dictionaries. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Sep 16 17:31:06 1999 by +Skip Montanaro +

+ +

4.92. Is there a Python tutorial?

+Yes. See question 1.20 at +http://www.python.org/doc/FAQ.html#1.20 +

+ +Edit this entry / +Log info + +/ Last changed on Sat Dec 4 16:04:00 1999 by +TAB +

+ +

4.93. Deleted

+See 4.28 +

+ +Edit this entry / +Log info + +/ Last changed on Tue May 28 20:40:37 2002 by +GvR +

+ +

4.94. How do I get a single keypress without blocking?

+There are several solutions; some involve using curses, which is a +pretty big thing to learn. Here's a solution without curses. (see also 4.74, for Windows, see question 8.2) +

+  import termios, fcntl, sys, os
+  fd = sys.stdin.fileno()
+

+  oldterm = termios.tcgetattr(fd)
+  newattr = termios.tcgetattr(fd)
+  newattr[3] = newattr[3] & ~termios.ICANON & ~termios.ECHO
+  termios.tcsetattr(fd, termios.TCSANOW, newattr)
+

+  oldflags = fcntl.fcntl(fd, fcntl.F_GETFL)
+  fcntl.fcntl(fd, fcntl.F_SETFL, oldflags | os.O_NONBLOCK)
+

+  try:
+      while 1:
+          try:
+              c = sys.stdin.read(1)
+              print "Got character", `c`
+          except IOError: pass
+  finally:
+      termios.tcsetattr(fd, termios.TCSAFLUSH, oldterm)
+      fcntl.fcntl(fd, fcntl.F_SETFL, oldflags)
+

+You need the termios and the fcntl module for any of this to work, +and I've only tried it on Linux, though it should work elsewhere. +

+In this code, characters are read and printed one at a time. +

+termios.tcsetattr() turns off stdin's echoing and disables canonical +mode. fcntl.fnctl() is used to obtain stdin's file descriptor flags +and modify them for non-blocking mode. Since reading stdin when it is +empty results in an IOError, this error is caught and ignored. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Oct 24 00:39:06 2002 by +chris +

+ +

4.95. Is there an equivalent to Perl chomp()? (Remove trailing newline from string)

+There are two partial substitutes. If you want to remove all trailing +whitespace, use the method string.rstrip(). Otherwise, if there is only +one line in the string, use string.splitlines()[0]. +

+ -----------------------------------------------------------------------
+

+ rstrip() is too greedy, it strips all trailing white spaces.
+ splitlines() takes ControlM as line boundary.
+ Consider these strings as input:
+   "python python    \r\n"
+   "python\rpython\r\n"
+   "python python   \r\r\r\n"
+ The results from rstrip()/splitlines() are perhaps not what we want.
+

+ It seems re can perform this task.
+

+ #!/usr/bin/python 
+ # requires python2                                                             
+

+ import re, os, StringIO
+

+ lines=StringIO.StringIO(
+   "The Python Programming Language\r\n"
+   "The Python Programming Language \r \r \r\r\n"
+   "The\rProgramming\rLanguage\r\n"
+   "The\rProgramming\rLanguage\r\r\r\r\n"
+   "The\r\rProgramming\r\rLanguage\r\r\r\r\n"
+ )
+

+ ln=re.compile("(?:[\r]?\n|\r)$") # dos:\r\n, unix:\n, mac:\r, others: unknown
+ # os.linesep does not work if someone ftps(in binary mode) a dos/mac text file
+ # to your unix box
+ #ln=re.compile(os.linesep + "$")
+

+ while 1:
+   s=lines.readline()
+   if not s: break
+   print "1.(%s)" % `s.rstrip()`
+   print "2.(%s)" % `ln.sub( "", s, 1)`
+   print "3.(%s)" % `s.splitlines()[0]`
+   print "4.(%s)" % `s.splitlines()`
+   print
+

+ lines.close()
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 8 09:51:34 2001 by +Crystal +

+ +

4.96. Why is join() a string method when I'm really joining the elements of a (list, tuple, sequence)?

+Strings became much more like other standard types starting in release 1.6, when methods were added which give the same functionality that has always been available using the functions of the string module. These new methods have been widely accepted, but the one which appears to make (some) programmers feel uncomfortable is: +

+    ", ".join(['1', '2', '4', '8', '16'])
+

+which gives the result +

+    "1, 2, 4, 8, 16"
+

+There are two usual arguments against this usage. +

+The first runs along the lines of: "It looks really ugly using a method of a string literal (string constant)", to which the answer is that it might, but a string literal is just a fixed value. If the methods are to be allowed on names bound to strings there is no logical reason to make them unavailable on literals. Get over it! +

+The second objection is typically cast as: "I am really telling a sequence to join its members together with a string constant". Sadly, you aren't. For some reason there seems to be much less difficulty with having split() as a string method, since in that case it is easy to see that +

+    "1, 2, 4, 8, 16".split(", ")
+

+is an instruction to a string literal to return the substrings delimited by the given separator (or, by default, arbitrary runs of white space). In this case a Unicode string returns a list of Unicode strings, an ASCII string returns a list of ASCII strings, and everyone is happy. +

+join() is a string method because in using it you are telling the separator string to iterate over an arbitrary sequence, forming string representations of each of the elements, and inserting itself between the elements' representations. This method can be used with any argument which obeys the rules for sequence objects, inluding any new classes you might define yourself. +

+Because this is a string method it can work for Unicode strings as well as plain ASCII strings. If join() were a method of the sequence types then the sequence types would have to decide which type of string to return depending on the type of the separator. +

+If none of these arguments persuade you, then for the moment you can continue to use the join() function from the string module, which allows you to write +

+    string.join(['1', '2', '4', '8', '16'], ", ")
+

+You will just have to try and forget that the string module actually uses the syntax you are compaining about to implement the syntax you prefer! +

+ +Edit this entry / +Log info + +/ Last changed on Fri Aug 2 15:51:58 2002 by +Steve Holden +

+ +

4.97. How can my code discover the name of an object?

+Generally speaking, it can't, because objects don't really have names. The assignment statement does not store the assigned value in the name but a reference to it. Essentially, assignment creates a binding of a name to a value. The same is true of def and class statements, but in that case the value is a callable. Consider the following code: +

+    class A:
+        pass
+

+    B = A
+

+    a = B()
+    b = a
+    print b
+    <__main__.A instance at 016D07CC>
+    print a
+    <__main__.A instance at 016D07CC>
+

+Arguably the class has a name: even though it is bound to two names and invoked through the name B the created instance is still reported as an instance of class A. However, it is impossible to say whether the instance's name is a or b, since both names are bound to the same value. +

+Generally speaking it should not be necessary for your code to "know the names" of particular values. Unless you are deliberately writing introspective programs, this is usually an indication that a change of approach might be beneficial. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 8 03:53:39 2001 by +Steve Holden +

+ +

4.98. Why are floating point calculations so inaccurate?

+The development version of the Python Tutorial now contains an Appendix with more info: +

+    http://www.python.org/doc/current/tut/node14.html
+

+People are often very surprised by results like this: +

+ >>> 1.2-1.0
+ 0.199999999999999996
+

+And think it is a bug in Python. It's not. It's a problem caused by +the internal representation of a floating point number. A floating point +number is stored as a fixed number of binary digits. +

+In decimal math, there are many numbers that can't be represented +with a fixed number of decimal digits, i.e. +1/3 = 0.3333333333....... +

+In the binary case, 1/2 = 0.1, 1/4 = 0.01, 1/8 = 0.001, etc. There are +a lot of numbers that can't be represented. The digits are cut off at +some point. +

+Since Python 1.6, a floating point's repr() function prints as many +digits are necessary to make eval(repr(f)) == f true for any float f. +The str() function prints the more sensible number that was probably +intended: +

+ >>> 0.2
+ 0.20000000000000001
+ >>> print 0.2
+ 0.2
+

+Again, this has nothing to do with Python, but with the way the +underlying C platform handles floating points, and ultimately with +the inaccuracy you'll always have when writing down numbers of fixed +number of digit strings. +

+One of the consequences of this is that it is dangerous to compare +the result of some computation to a float with == ! +Tiny inaccuracies may mean that == fails. +

+Instead try something like this: +

+ epsilon = 0.0000000000001 # Tiny allowed error
+ expected_result = 0.4
+

+ if expected_result-epsilon <= computation() <= expected_result+epsilon:
+    ...
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Apr 1 22:18:47 2002 by +Fred Drake +

+ +

4.99. I tried to open Berkeley DB file, but bsddb produces bsddb.error: (22, 'Invalid argument'). Help! How can I restore my data?

+Don't panic! Your data are probably intact. The most frequent cause +for the error is that you tried to open an earlier Berkeley DB file +with a later version of the Berkeley DB library. +

+Many Linux systems now have all three versions of Berkeley DB +available. If you are migrating from version 1 to a newer version use +db_dump185 to dump a plain text version of the database. +If you are migrating from version 2 to version 3 use db2_dump to create +a plain text version of the database. In either case, use db_load to +create a new native database for the latest version installed on your +computer. If you have version 3 of Berkeley DB installed, you should +be able to use db2_load to create a native version 2 database. +

+You should probably move away from Berkeley DB version 1 files because +the hash file code contains known bugs that can corrupt your data. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 29 16:04:29 2001 by +Skip Montanaro +

+ +

4.100. What are the "best practices" for using import in a module?

+First, the standard modules are great. Use them! The standard Python library is large and varied. Using modules can save you time and effort and will reduce maintainenance cost of your code. (Other programs are dedicated to supporting and fixing bugs in the standard Python modules. Coworkers may also be familiar with themodules that you use, reducing the amount of time it takes them to understand your code.) +

+The rest of this answer is largely a matter of personal preference, but here's what some newsgroup posters said (thanks to all who responded) +

+In general, don't use +

+ from modulename import *
+

+Doing so clutters the importer's namespace. Some avoid this idiom even with the few modules that were designed to be imported in this manner. (Modules designed in this manner include Tkinter, thread, and wxPython.) +

+Import modules at the top of a file, one module per line. Doing so makes it clear what other modules your code requires and avoids questions of whether the module name is in scope. Using one import per line makes it easy to add and delete module imports. +

+Move imports into a local scope (such as at the top of a function definition) if there are a lot of imports, and you're trying to avoid the cost (lots of initialization time) of many imports. This technique is especially helpful if many of the imports are unnecessary depending on how the program executes. You may also want to move imports into a function if the modules are only ever used in that function. Note that loading a module the first time may be expensive (because of the one time initialization of the module) but that loading a module multiple times is virtually free (a couple of dictionary lookups). Even if the module name has gone out of scope, the module is probably available in sys.modules. Thus, there isn't really anything wrong with putting no imports at the module level (if they aren't needed) and putting all of the imports at the function level. +

+It is sometimes necessary to move imports to a function or class to avoid problems with circular imports. Gordon says: +

+ Circular imports are fine where both modules use the "import <module>"
+ form of import. They fail when the 2nd module wants to grab a name
+ out of the first ("from module import name") and the import is at
+ the top level. That's because names in the 1st are not yet available,
+ (the first module is busy importing the 2nd).  
+

+In this case, if the 2nd module is only used in one function, then the import can easily be moved into that function. By the time the import is called, the first module will have finished initializing, and the second module can do its import. +

+It may also be necessary to move imports out of the top level of code +if some of the modules are platform-specific. In that case, it may not even be possible to import all of the modules at the top of the file. In this case, importing the correct modules in the corresponding platform-specific code is a good option. +

+If only instances of a specific class uses a module, then it is reasonable to import the module in the class's __init__ method and then assign the module to an instance variable so that the module is always available (via that instance variable) during the life of the object. Note that to delay an import until the class is instantiated, the import must be inside a method. Putting the import inside the class but outside of any method still causes the import to occur when the module is initialized. +

+ +Edit this entry / +Log info + +/ Last changed on Sat Aug 4 04:44:47 2001 by +TAB +

+ +

4.101. Is there a tool to help find bugs or perform static analysis?

+Yes. PyChecker is a static analysis tool for finding bugs +in Python source code as well as warning about code complexity +and style. +

+You can get PyChecker from: http://pychecker.sf.net. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Aug 10 15:42:11 2001 by +Neal +

+ +

4.102. UnicodeError: ASCII [decoding,encoding] error: ordinal not in range(128)

+This error indicates that your Python installation can handle +only 7-bit ASCII strings. There are a couple ways to fix or +workaround the problem. +

+If your programs must handle data in arbitary character set encodings, the environment the application runs in will generally identify the encoding of the data it is handing you. You need to convert the input to Unicode data using that encoding. For instance, a program that handles email or web input will typically find character set encoding information in Content-Type headers. This can then be used to properly convert input data to Unicode. Assuming the string referred to by "value" is encoded as UTF-8: +

+    value = unicode(value, "utf-8")
+

+will return a Unicode object. If the data is not correctly encoded as UTF-8, the above call will raise a UnicodeError. +

+If you only want strings coverted to Unicode which have non-ASCII data, you can try converting them first assuming an ASCII encoding, and then generate Unicode objects if that fails: +

+    try:
+        x = unicode(value, "ascii")
+    except UnicodeError:
+        value = unicode(value, "utf-8")
+    else:
+        # value was valid ASCII data
+        pass
+

+If you normally use a character set encoding other than US-ASCII and only need to handle data in that encoding, the simplest way to fix the problem may be simply to set the encoding in sitecustomize.py. The following code is just a modified version of the encoding setup code from site.py with the relevant lines uncommented. +

+    # Set the string encoding used by the Unicode implementation.
+    # The default is 'ascii'
+    encoding = "ascii" # <= CHANGE THIS if you wish
+

+    # Enable to support locale aware default string encodings.
+    import locale
+    loc = locale.getdefaultlocale()
+    if loc[1]:
+        encoding = loc[1]
+    if encoding != "ascii":
+        import sys
+        sys.setdefaultencoding(encoding)
+

+Also note that on Windows, there is an encoding known as "mbcs", which uses an encoding specific to your current locale. In many cases, and particularly when working with COM, this may be an appropriate default encoding to use. +

+ +Edit this entry / +Log info + +/ Last changed on Sat Apr 13 04:45:41 2002 by +Skip Montanaro +

+ +

4.103. Using strings to call functions/methods

+There are various techniques: +

+* Use a dictionary pre-loaded with strings and functions. The primary +advantage of this technique is that the strings do not need to match the +names of the functions. This is also the primary technique used to +emulate a case construct: +

+    def a():
+        pass
+

+    def b():
+        pass
+

+    dispatch = {'go': a, 'stop': b}  # Note lack of parens for funcs
+

+    dispatch[get_input()]()  # Note trailing parens to call function
+

+* Use the built-in function getattr(): +

+    import foo
+    getattr(foo, 'bar')()
+

+Note that getattr() works on any object, including classes, class +instances, modules, and so on. +

+This is used in several places in the standard library, like +this: +

+    class Foo:
+        def do_foo(self):
+            ...
+

+        def do_bar(self):
+            ...
+

+     f = getattr(foo_instance, 'do_' + opname)
+     f()
+

+* Use locals() or eval() to resolve the function name: +

+def myFunc(): +

+    print "hello"
+

+fname = "myFunc" +

+f = locals()[fname] +f() +

+f = eval(fname) +f() +

+Note: Using eval() can be dangerous. If you don't have absolute control +over the contents of the string, all sorts of things could happen... +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 08:14:58 2002 by +Erno Kuusela +

+ +

4.104. How fast are exceptions?

+A try/except block is extremely efficient. Actually executing an +exception is expensive. In older versions of Python (prior to 2.0), it +was common to code this idiom: +

+    try:
+        value = dict[key]
+    except KeyError:
+        dict[key] = getvalue(key)
+        value = dict[key]
+

+This idiom only made sense when you expected the dict to have the key +95% of the time or more; other times, you coded it like this: +

+    if dict.has_key(key):
+        value = dict[key]
+    else:
+        dict[key] = getvalue(key)
+        value = dict[key]
+

+In Python 2.0 and higher, of course, you can code this as +

+    value = dict.setdefault(key, getvalue(key))
+

+However this evaluates getvalue(key) always, regardless of whether it's needed or not. So if it's slow or has a side effect you should use one of the above variants. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Dec 9 10:12:30 2002 by +Yeti +

+ +

4.105. Sharing global variables across modules

+The canonical way to share information across modules within a single +program is to create a special module (often called config or cfg). +Just import the config module in all modules of your application; the +module then becomes available as a global name. Because there is only +one instance of each module, any changes made to the module object get +reflected everywhere. For example: +

+config.py: +

+    pass
+

+mod.py: +

+    import config
+    config.x = 1
+

+main.py: +

+    import config
+    import mod
+    print config.x
+

+Note that using a module is also the basis for implementing the +Singleton design pattern, for the same reason. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Apr 23 23:07:19 2002 by +Aahz +

+ +

4.106. Why is cPickle so slow?

+Use the binary option. We'd like to make that the default, but it would +break backward compatibility: +

+    largeString = 'z' * (100 * 1024)
+    myPickle = cPickle.dumps(largeString, 1)
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Aug 22 19:54:25 2002 by +Aahz +

+ +

4.107. When importing module XXX, why do I get "undefined symbol: PyUnicodeUCS2_..." ?

+You are using a version of Python that uses a 4-byte representation for +Unicode characters, but the extension module you are importing (possibly +indirectly) was compiled using a Python that uses a 2-byte representation +for Unicode characters (the default). +

+If instead the name of the undefined symbol starts with PyUnicodeUCS4_, +the problem is the same by the relationship is reversed: Python was +built using 2-byte Unicode characters, and the extension module was +compiled using a Python with 4-byte Unicode characters. +

+This can easily occur when using pre-built extension packages. RedHat +Linux 7.x, in particular, provides a "python2" binary that is compiled +with 4-byte Unicode. This only causes the link failure if the extension +uses any of the PyUnicode_*() functions. It is also a problem if if an +extension uses any of the Unicode-related format specifiers for +Py_BuildValue (or similar) or parameter-specifications for +PyArg_ParseTuple(). +

+You can check the size of the Unicode character a Python interpreter is +using by checking the value of sys.maxunicode: +

+  >>> import sys
+  >>> if sys.maxunicode > 65535:
+  ...     print 'UCS4 build'
+  ... else:
+  ...     print 'UCS2 build'
+

+The only way to solve this problem is to use extension modules compiled +with a Python binary built using the same size for Unicode characters. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Aug 27 15:00:17 2002 by +Fred Drake +

+ +

4.108. How do I create a .pyc file?

+QUESTION: +

+I have a module and I wish to generate a .pyc file. +How do I do it? Everything I read says that generation of a .pyc file is +"automatic", but I'm not getting anywhere. +

+ANSWER: +

+When a module is imported for the first time (or when the source is more +recent than the current compiled file) a .pyc file containing the compiled code should be created in the +same directory as the .py file. +

+One reason that a .pyc file may not be created is permissions problems with the directory. This can happen, for example, if you develop as one user but run as another, such as if you are testing with a web server. +

+However, in most cases, that's not the problem. +

+Creation of a .pyc file is "automatic" if you are importing a module and Python has the +ability (permissions, free space, etc...) to write the compiled module +back to the directory. But note that running Python on a top level script is not considered an +import and so no .pyc will be created automatically. For example, if you have a top-level module abc.py that imports another module xyz.py, when you run abc, xyz.pyc will be created since xyz is imported, but no abc.pyc file will be created since abc isn't imported. +

+If you need to create abc.pyc -- that is, to create a .pyc file for a +module that is not imported -- you can. (Look up +the py_compile and compileall modules in the Library Reference.) +

+You can manually compile any module using the "py_compile" module. One +way is to use the compile() function in that module interactively: +

+    >>> import py_compile
+    >>> py_compile.compile('abc.py')
+

+This will write the .pyc to the same location as abc.py (or you +can override that with the optional parameter cfile). +

+You can also automatically compile all files in a directory or +directories using the "compileall" module, which can also be run +straight from the command line. +

+You can do it from the shell (or DOS) prompt by entering: +

+       python compile.py abc.py
+

+or +

+       python compile.py *
+

+Or you can write a script to do it on a list of filenames that you enter. +

+     import sys
+     from py_compile import compile
+

+     if len(sys.argv) <= 1:
+        sys.exit(1)
+

+     for file in sys.argv[1:]:
+        compile(file)
+

+ACKNOWLEDGMENTS: +

+Steve Holden, David Bolen, Rich Somerfield, Oleg Broytmann, Steve Ferg +

+ +Edit this entry / +Log info + +/ Last changed on Wed Feb 12 15:58:25 2003 by +Stephen Ferg +

+ +

5. Extending Python

+ +

5.1. Can I create my own functions in C?

+Yes, you can create built-in modules containing functions, +variables, exceptions and even new types in C. This is explained in +the document "Extending and Embedding the Python Interpreter" (http://www.python.org/doc/current/ext/ext.html). Also read the chapter +on dynamic loading. +

+There's more information on this in each of the Python books: +Programming Python, Internet Programming with Python, and Das Python-Buch +(in German). +

+ +Edit this entry / +Log info + +/ Last changed on Mon Dec 10 05:18:57 2001 by +Fred L. Drake, Jr. +

+ +

5.2. Can I create my own functions in C++?

+Yes, using the C-compatibility features found in C++. Basically +you place extern "C" { ... } around the Python include files and put +extern "C" before each function that is going to be called by the +Python interpreter. Global or static C++ objects with constructors +are probably not a good idea. +

+ +Edit this entry / +Log info +

+ +

5.3. How can I execute arbitrary Python statements from C?

+The highest-level function to do this is PyRun_SimpleString() which takes +a single string argument which is executed in the context of module +__main__ and returns 0 for success and -1 when an exception occurred +(including SyntaxError). If you want more control, use PyRun_String(); +see the source for PyRun_SimpleString() in Python/pythonrun.c. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 20:08:14 1997 by +Bill Tutt +

+ +

5.4. How can I evaluate an arbitrary Python expression from C?

+Call the function PyRun_String() from the previous question with the +start symbol eval_input (Py_eval_input starting with 1.5a1); it +parses an expression, evaluates it and returns its value. +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 22:23:18 1997 by +David Ascher +

+ +

5.5. How do I extract C values from a Python object?

+That depends on the object's type. If it's a tuple, +PyTupleSize(o) returns its length and PyTuple_GetItem(o, i) +returns its i'th item; similar for lists with PyListSize(o) +and PyList_GetItem(o, i). For strings, PyString_Size(o) returns +its length and PyString_AsString(o) a pointer to its value +(note that Python strings may contain null bytes so strlen() +is not safe). To test which type an object is, first make sure +it isn't NULL, and then use PyString_Check(o), PyTuple_Check(o), +PyList_Check(o), etc. +

+There is also a high-level API to Python objects which is +provided by the so-called 'abstract' interface -- read +Include/abstract.h for further details. It allows for example +interfacing with any kind of Python sequence (e.g. lists and tuples) +using calls like PySequence_Length(), PySequence_GetItem(), etc.) +as well as many other useful protocols. +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 22:34:20 1997 by +David Ascher +

+ +

5.6. How do I use Py_BuildValue() to create a tuple of arbitrary length?

+You can't. Use t = PyTuple_New(n) instead, and fill it with +objects using PyTuple_SetItem(t, i, o) -- note that this "eats" a +reference count of o. Similar for lists with PyList_New(n) and +PyList_SetItem(l, i, o). Note that you must set all the tuple items to +some value before you pass the tuple to Python code -- +PyTuple_New(n) initializes them to NULL, which isn't a valid Python +value. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jul 31 18:15:29 1997 by +Guido van Rossum +

+ +

5.7. How do I call an object's method from C?

+The PyObject_CallMethod() function can be used to call an arbitrary +method of an object. The parameters are the object, the name of the +method to call, a format string like that used with Py_BuildValue(), and the argument values: +

+    PyObject *
+    PyObject_CallMethod(PyObject *object, char *method_name,
+                        char *arg_format, ...);
+

+This works for any object that has methods -- whether built-in or +user-defined. You are responsible for eventually DECREF'ing the +return value. +

+To call, e.g., a file object's "seek" method with arguments 10, 0 +(assuming the file object pointer is "f"): +

+        res = PyObject_CallMethod(f, "seek", "(ii)", 10, 0);
+        if (res == NULL) {
+                ... an exception occurred ...
+        }
+        else {
+                Py_DECREF(res);
+        }
+

+Note that since PyObject_CallObject() always wants a tuple for the +argument list, to call a function without arguments, pass "()" for the +format, and to call a function with one argument, surround the argument +in parentheses, e.g. "(i)". +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jun 6 16:15:46 2002 by +Neal Norwitz +

+ +

5.8. How do I catch the output from PyErr_Print() (or anything that prints to stdout/stderr)?

+(Due to Mark Hammond): +

+In Python code, define an object that supports the "write()" method. +Redirect sys.stdout and sys.stderr to this object. +Call print_error, or just allow the standard traceback mechanism to +work. Then, the output will go wherever your write() method sends it. +

+The easiest way to do this is to use the StringIO class in the standard +library. +

+Sample code and use for catching stdout: +

+	>>> class StdoutCatcher:
+	...  def __init__(self):
+	...   self.data = ''
+	...  def write(self, stuff):
+	...   self.data = self.data + stuff
+	...  
+	>>> import sys
+	>>> sys.stdout = StdoutCatcher()
+	>>> print 'foo'
+	>>> print 'hello world!'
+	>>> sys.stderr.write(sys.stdout.data)
+	foo
+	hello world!
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Dec 16 18:34:25 1998 by +Richard Jones +

+ +

5.9. How do I access a module written in Python from C?

+You can get a pointer to the module object as follows: +

+        module = PyImport_ImportModule("<modulename>");
+

+If the module hasn't been imported yet (i.e. it is not yet present in +sys.modules), this initializes the module; otherwise it simply returns +the value of sys.modules["<modulename>"]. Note that it doesn't enter +the module into any namespace -- it only ensures it has been +initialized and is stored in sys.modules. +

+You can then access the module's attributes (i.e. any name defined in +the module) as follows: +

+        attr = PyObject_GetAttrString(module, "<attrname>");
+

+Calling PyObject_SetAttrString(), to assign to variables in the module, also works. +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 22:56:40 1997 by +david ascher +

+ +

5.10. How do I interface to C++ objects from Python?

+Depending on your requirements, there are many approaches. To do +this manually, begin by reading the "Extending and Embedding" document +(Doc/ext.tex, see also http://www.python.org/doc/). Realize +that for the Python run-time system, there isn't a whole lot of +difference between C and C++ -- so the strategy to build a new Python +type around a C structure (pointer) type will also work for C++ +objects. +

+A useful automated approach (which also works for C) is SWIG: +http://www.swig.org/. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Oct 15 05:14:01 1999 by +Sjoerd Mullender +

+ +

5.11. mSQLmodule (or other old module) won't build with Python 1.5 (or later)

+Since python-1.4 "Python.h" will have the file includes needed in an +extension module. +Backward compatibility is dropped after version 1.4 and therefore +mSQLmodule.c will not build as "allobjects.h" cannot be found. +The following change in mSQLmodule.c is harmless when building it with +1.4 and necessary when doing so for later python versions: +

+Remove lines: +

+	#include "allobjects.h"
+	#include "modsupport.h"
+

+And insert instead: +

+	#include "Python.h"
+

+You may also need to add +

+                #include "rename2.h"
+

+if the module uses "old names". +

+This may happen with other ancient python modules as well, +and the same fix applies. +

+ +Edit this entry / +Log info + +/ Last changed on Sun Dec 21 02:03:35 1997 by +GvR +

+ +

5.12. I added a module using the Setup file and the make fails! Huh?

+Setup must end in a newline, if there is no newline there it gets +very sad. Aside from this possibility, maybe you have other +non-Python-specific linkage problems. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jun 24 15:54:01 1997 by +aaron watters +

+ +

5.13. I want to compile a Python module on my Red Hat Linux system, but some files are missing.

+Red Hat's RPM for Python doesn't include the +/usr/lib/python1.x/config/ directory, which contains various files required +for compiling Python extensions. +Install the python-devel RPM to get the necessary files. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 26 13:44:04 1999 by +A.M. Kuchling +

+ +

5.14. What does "SystemError: _PyImport_FixupExtension: module yourmodule not loaded" mean?

+This means that you have created an extension module named "yourmodule", but your module init function does not initialize with that name. +

+Every module init function will have a line similar to: +

+  module = Py_InitModule("yourmodule", yourmodule_functions);
+

+If the string passed to this function is not the same name as your extenion module, the SystemError will be raised. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 25 07:16:08 1999 by +Mark Hammond +

+ +

5.15. How to tell "incomplete input" from "invalid input"?

+Sometimes you want to emulate the Python interactive interpreter's +behavior, where it gives you a continuation prompt when the input +is incomplete (e.g. you typed the start of an "if" statement +or you didn't close your parentheses or triple string quotes), +but it gives you a syntax error message immediately when the input +is invalid. +

+In Python you can use the codeop module, which approximates the +parser's behavior sufficiently. IDLE uses this, for example. +

+The easiest way to do it in C is to call PyRun_InteractiveLoop() +(in a separate thread maybe) and let the Python interpreter handle +the input for you. You can also set the PyOS_ReadlineFunctionPointer +to point at your custom input function. See Modules/readline.c and +Parser/myreadline.c for more hints. +

+However sometimes you have to run the embedded Python interpreter +in the same thread as your rest application and you can't allow the +PyRun_InteractiveLoop() to stop while waiting for user input. +The one solution then is to call PyParser_ParseString() +and test for e.error equal to E_EOF (then the input is incomplete). +Sample code fragment, untested, inspired by code from Alex Farber: +

+  #include <Python.h>
+  #include <node.h>
+  #include <errcode.h>
+  #include <grammar.h>
+  #include <parsetok.h>
+  #include <compile.h>
+

+  int testcomplete(char *code)
+    /* code should end in \n */
+    /* return -1 for error, 0 for incomplete, 1 for complete */
+  {
+    node *n;
+    perrdetail e;
+

+    n = PyParser_ParseString(code, &_PyParser_Grammar,
+                             Py_file_input, &e);
+    if (n == NULL) {
+      if (e.error == E_EOF) 
+        return 0;
+      return -1;
+    }
+

+    PyNode_Free(n);
+    return 1;
+  }
+

+Another solution is trying to compile the received string with +Py_CompileString(). If it compiles fine - try to execute the returned +code object by calling PyEval_EvalCode(). Otherwise save the input for +later. If the compilation fails, find out if it's an error or just +more input is required - by extracting the message string from the +exception tuple and comparing it to the "unexpected EOF while parsing". +Here is a complete example using the GNU readline library (you may +want to ignore SIGINT while calling readline()): +

+  #include <stdio.h>
+  #include <readline.h>
+

+  #include <Python.h>
+  #include <object.h>
+  #include <compile.h>
+  #include <eval.h>
+

+  int main (int argc, char* argv[])
+  {
+    int i, j, done = 0;                          /* lengths of line, code */
+    char ps1[] = ">>> ";
+    char ps2[] = "... ";
+    char *prompt = ps1;
+    char *msg, *line, *code = NULL;
+    PyObject *src, *glb, *loc;
+    PyObject *exc, *val, *trb, *obj, *dum;
+

+    Py_Initialize ();
+    loc = PyDict_New ();
+    glb = PyDict_New ();
+    PyDict_SetItemString (glb, "__builtins__", PyEval_GetBuiltins ());
+

+    while (!done)
+    {
+      line = readline (prompt);
+

+      if (NULL == line)                          /* CTRL-D pressed */
+      {
+        done = 1;
+      }
+      else
+      {
+        i = strlen (line);
+

+        if (i > 0)
+          add_history (line);                    /* save non-empty lines */
+

+        if (NULL == code)                        /* nothing in code yet */
+          j = 0;
+        else
+          j = strlen (code);
+

+        code = realloc (code, i + j + 2);
+        if (NULL == code)                        /* out of memory */
+          exit (1);
+

+        if (0 == j)                              /* code was empty, so */
+          code[0] = '\0';                        /* keep strncat happy */
+

+        strncat (code, line, i);                 /* append line to code */
+        code[i + j] = '\n';                      /* append '\n' to code */
+        code[i + j + 1] = '\0';
+

+        src = Py_CompileString (code, "<stdin>", Py_single_input);       
+

+        if (NULL != src)                         /* compiled just fine - */
+        {
+          if (ps1  == prompt ||                  /* ">>> " or */
+              '\n' == code[i + j - 1])           /* "... " and double '\n' */
+          {                                               /* so execute it */
+            dum = PyEval_EvalCode ((PyCodeObject *)src, glb, loc);
+            Py_XDECREF (dum);
+            Py_XDECREF (src);
+            free (code);
+            code = NULL;
+            if (PyErr_Occurred ())
+              PyErr_Print ();
+            prompt = ps1;
+          }
+        }                                        /* syntax error or E_EOF? */
+        else if (PyErr_ExceptionMatches (PyExc_SyntaxError))           
+        {
+          PyErr_Fetch (&exc, &val, &trb);        /* clears exception! */
+

+          if (PyArg_ParseTuple (val, "sO", &msg, &obj) &&
+              !strcmp (msg, "unexpected EOF while parsing")) /* E_EOF */
+          {
+            Py_XDECREF (exc);
+            Py_XDECREF (val);
+            Py_XDECREF (trb);
+            prompt = ps2;
+          }
+          else                                   /* some other syntax error */
+          {
+            PyErr_Restore (exc, val, trb);
+            PyErr_Print ();
+            free (code);
+            code = NULL;
+            prompt = ps1;
+          }
+        }
+        else                                     /* some non-syntax error */
+        {
+          PyErr_Print ();
+          free (code);
+          code = NULL;
+          prompt = ps1;
+        }
+

+        free (line);
+      }
+    }
+

+    Py_XDECREF(glb);
+    Py_XDECREF(loc);
+    Py_Finalize();
+    exit(0);
+  }
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Mar 15 09:47:24 2000 by +Alex Farber +

+ +

5.16. How do I debug an extension?

+When using gdb with dynamically loaded extensions, you can't set a +breakpoint in your extension until your extension is loaded. +

+In your .gdbinit file (or interactively), add the command +

+br _PyImport_LoadDynamicModule +

+$ gdb /local/bin/python +

+gdb) run myscript.py +

+gdb) continue # repeat until your extension is loaded +

+gdb) finish # so that your extension is loaded +

+gdb) br myfunction.c:50 +

+gdb) continue +

+ +Edit this entry / +Log info + +/ Last changed on Fri Oct 20 11:10:32 2000 by +Joe VanAndel +

+ +

5.17. How do I find undefined Linux g++ symbols, __builtin_new or __pure_virtural

+To dynamically load g++ extension modules, you must recompile python, relink python using g++ (change LINKCC in the python Modules Makefile), and link your extension module using g++ (e.g., "g++ -shared -o mymodule.so mymodule.o"). +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jan 14 18:03:51 2001 by +douglas orr +

+ +

5.18. How do I define and create objects corresponding to built-in/extension types

+Usually you would like to be able to inherit from a Python type when +you ask this question. The bottom line for Python 2.2 is: types and classes are miscible. You build instances by calling classes, and you can build subclasses to your heart's desire. +

+You need to be careful when instantiating immutable types like integers or strings. See http://www.amk.ca/python/2.2/, section 2, for details. +

+Prior to version 2.2, Python (like Java) insisted that there are first-class and second-class objects (the former are types, the latter classes), and never the twain shall meet. +

+The library has, however, done a good job of providing class wrappers for the more commonly desired objects (see UserDict, UserList and UserString for examples), and more are always welcome if you happen to be in the mood to write code. These wrappers still exist in Python 2.2. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 10 15:14:07 2002 by +Matthias Urlichs +

+ +

6. Python's design

+ +

6.1. Why isn't there a switch or case statement in Python?

+You can do this easily enough with a sequence of +if... elif... elif... else. There have been some proposals for switch +statement syntax, but there is no consensus (yet) on whether and how +to do range tests. +

+ +Edit this entry / +Log info +

+ +

6.2. Why does Python use indentation for grouping of statements?

+Basically I believe that using indentation for grouping is +extremely elegant and contributes a lot to the clarity of the average +Python program. Most people learn to love this feature after a while. +Some arguments for it: +

+Since there are no begin/end brackets there cannot be a disagreement +between grouping perceived by the parser and the human reader. I +remember long ago seeing a C fragment like this: +

+        if (x <= y)
+                x++;
+                y--;
+        z++;
+

+and staring a long time at it wondering why y was being decremented +even for x > y... (And I wasn't a C newbie then either.) +

+Since there are no begin/end brackets, Python is much less prone to +coding-style conflicts. In C there are loads of different ways to +place the braces (including the choice whether to place braces around +single statements in certain cases, for consistency). If you're used +to reading (and writing) code that uses one style, you will feel at +least slightly uneasy when reading (or being required to write) +another style. +Many coding styles place begin/end brackets on a line by themself. +This makes programs considerably longer and wastes valuable screen +space, making it harder to get a good overview over a program. +Ideally, a function should fit on one basic tty screen (say, 20 +lines). 20 lines of Python are worth a LOT more than 20 lines of C. +This is not solely due to the lack of begin/end brackets (the lack of +declarations also helps, and the powerful operations of course), but +it certainly helps! +

+ +Edit this entry / +Log info + +/ Last changed on Wed May 21 16:00:15 1997 by +GvR +

+ +

6.3. Why are Python strings immutable?

+There are two advantages. One is performance: knowing that a +string is immutable makes it easy to lay it out at construction time +-- fixed and unchanging storage requirements. (This is also one of +the reasons for the distinction between tuples and lists.) The +other is that strings in Python are considered as "elemental" as +numbers. No amount of activity will change the value 8 to anything +else, and in Python, no amount of activity will change the string +"eight" to anything else. (Adapted from Jim Roskind) +

+ +Edit this entry / +Log info +

+ +

6.4. Delete

+ +Edit this entry / +Log info + +/ Last changed on Tue Jan 2 03:05:25 2001 by +Moshe Zadka +

+ +

6.5. Why does Python use methods for some functionality (e.g. list.index()) but functions for other (e.g. len(list))?

+The major reason is history. Functions were used for those +operations that were generic for a group of types and which +were intended to work even for objects that didn't have +methods at all (e.g. numbers before type/class unification +began, or tuples). +

+It is also convenient to have a function that can readily be applied +to an amorphous collection of objects when you use the functional features of Python (map(), apply() et al). +

+In fact, implementing len(), max(), min() as a built-in function is +actually less code than implementing them as methods for each type. +One can quibble about individual cases but it's a part of Python, +and it's too late to change such things fundamentally now. The +functions have to remain to avoid massive code breakage. +

+Note that for string operations Python has moved from external functions +(the string module) to methods. However, len() is still a function. +

+ +Edit this entry / +Log info + +/ Last changed on Thu May 30 14:08:58 2002 by +Steve Holden +

+ +

6.6. Why can't I derive a class from built-in types (e.g. lists or files)?

+As of Python 2.2, you can derive from built-in types. For previous versions, the answer is: +

+This is caused by the relatively late addition of (user-defined) +classes to the language -- the implementation framework doesn't easily +allow it. See the answer to question 4.2 for a work-around. This +may be fixed in the (distant) future. +

+ +Edit this entry / +Log info + +/ Last changed on Thu May 23 02:53:22 2002 by +Neal Norwitz +

+ +

6.7. Why must 'self' be declared and used explicitly in method definitions and calls?

+So, is your current programming language C++ or Java? :-) +When classes were added to Python, this was (again) the simplest way of +implementing methods without too many changes to the interpreter. The +idea was borrowed from Modula-3. It turns out to be very useful, for +a variety of reasons. +

+First, it makes it more obvious that you are using a method or +instance attribute instead of a local variable. Reading "self.x" or +"self.meth()" makes it absolutely clear that an instance variable or +method is used even if you don't know the class definition by heart. +In C++, you can sort of tell by the lack of a local variable +declaration (assuming globals are rare or easily recognizable) -- but +in Python, there are no local variable declarations, so you'd have to +look up the class definition to be sure. +

+Second, it means that no special syntax is necessary if you want to +explicitly reference or call the method from a particular class. In +C++, if you want to use a method from base class that is overridden in +a derived class, you have to use the :: operator -- in Python you can +write baseclass.methodname(self, <argument list>). This is +particularly useful for __init__() methods, and in general in cases +where a derived class method wants to extend the base class method of +the same name and thus has to call the base class method somehow. +

+Lastly, for instance variables, it solves a syntactic problem with +assignment: since local variables in Python are (by definition!) those +variables to which a value assigned in a function body (and that +aren't explicitly declared global), there has to be some way to tell +the interpreter that an assignment was meant to assign to an instance +variable instead of to a local variable, and it should preferably be +syntactic (for efficiency reasons). C++ does this through +declarations, but Python doesn't have declarations and it would be a +pity having to introduce them just for this purpose. Using the +explicit "self.var" solves this nicely. Similarly, for using instance +variables, having to write "self.var" means that references to +unqualified names inside a method don't have to search the instance's +directories. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jan 12 08:01:50 2001 by +Steve Holden +

+ +

6.8. Can't you emulate threads in the interpreter instead of relying on an OS-specific thread implementation?

+Answer 1: Unfortunately, the interpreter pushes at least one C stack +frame for each Python stack frame. Also, extensions can call back into +Python at almost random moments. Therefore a complete threads +implementation requires thread support for C. +

+Answer 2: Fortunately, there is Stackless Python, which has a completely redesigned interpreter loop that avoids the C stack. It's still experimental but looks very promising. Although it is binary compatible with standard Python, it's still unclear whether Stackless will make it into the core -- maybe it's just too revolutionary. Stackless Python currently lives here: http://www.stackless.com. A microthread implementation that uses it can be found here: http://world.std.com/~wware/uthread.html. +

+ +Edit this entry / +Log info + +/ Last changed on Sat Apr 15 08:18:16 2000 by +Just van Rossum +

+ +

6.9. Why can't lambda forms contain statements?

+Python lambda forms cannot contain statements because Python's +syntactic framework can't handle statements nested inside expressions. +

+However, in Python, this is not a serious problem. Unlike lambda +forms in other languages, where they add functionality, Python lambdas +are only a shorthand notation if you're too lazy to define a function. +

+Functions are already first class objects in Python, and can be +declared in a local scope. Therefore the only advantage of using a +lambda form instead of a locally-defined function is that you don't need to invent a name for the function -- but that's just a local variable to which the function object (which is exactly the same type of object that a lambda form yields) is assigned! +

+ +Edit this entry / +Log info + +/ Last changed on Sun Jun 14 14:15:17 1998 by +Tim Peters +

+ +

6.10. [deleted]

+[lambda vs non-nested scopes used to be here] +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 05:20:56 2002 by +Erno Kuusela +

+ +

6.11. [deleted]

+[recursive functions vs non-nested scopes used to be here] +

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 05:22:04 2002 by +Erno Kuusela +

+ +

6.12. Why is there no more efficient way of iterating over a dictionary than first constructing the list of keys()?

+As of Python 2.2, you can now iterate over a dictionary directly, +using the new implied dictionary iterator: +

+    for k in d: ...
+

+There are also methods returning iterators over the values and items: +

+    for k in d.iterkeys(): # same as above
+    for v in d.itervalues(): # iterate over values
+    for k, v in d.iteritems(): # iterate over items
+

+All these require that you do not modify the dictionary during the loop. +

+For previous Python versions, the following defense should do: +

+Have you tried it? I bet it's fast enough for your purposes! In +most cases such a list takes only a few percent of the space occupied +by the dictionary. Apart from the fixed header, +the list needs only 4 bytes (the size of a pointer) per +key. A dictionary uses 12 bytes per key plus between 30 and 70 +percent hash table overhead, plus the space for the keys and values. +By necessity, all keys are distinct objects, and a string object (the most +common key type) costs at least 20 bytes plus the length of the +string. Add to that the values contained in the dictionary, and you +see that 4 bytes more per item really isn't that much more memory... +

+A call to dict.keys() makes one fast scan over the dictionary +(internally, the iteration function does exist) copying the pointers +to the key objects into a pre-allocated list object of the right size. +The iteration time isn't lost (since you'll have to iterate anyway -- +unless in the majority of cases your loop terminates very prematurely +(which I doubt since you're getting the keys in random order). +

+I don't expose the dictionary iteration operation to Python +programmers because the dictionary shouldn't be modified during the +entire iteration -- if it is, there's a small chance that the +dictionary is reorganized because the hash table becomes too full, and +then the iteration may miss some items and see others twice. Exactly +because this only occurs rarely, it would lead to hidden bugs in +programs: it's easy never to have it happen during test runs if you +only insert or delete a few items per iteration -- but your users will +surely hit upon it sooner or later. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 24 21:24:08 2002 by +GvR +

+ +

6.13. Can Python be compiled to machine code, C or some other language?

+Not easily. Python's high level data types, dynamic typing of +objects and run-time invocation of the interpreter (using eval() or +exec) together mean that a "compiled" Python program would probably +consist mostly of calls into the Python run-time system, even for +seemingly simple operations like "x+1". +

+Several projects described in the Python newsgroup or at past +Python conferences have shown that this approach is feasible, +although the speedups reached so far are only modest (e.g. 2x). +JPython uses the same strategy for compiling to Java bytecode. +(Jim Hugunin has demonstrated that in combination with whole-program +analysis, speedups of 1000x are feasible for small demo programs. +See the website for the 1997 Python conference.) +

+Internally, Python source code is always translated into a "virtual +machine code" or "byte code" representation before it is interpreted +(by the "Python virtual machine" or "bytecode interpreter"). In order +to avoid the overhead of parsing and translating modules that rarely +change over and over again, this byte code is written on a file whose +name ends in ".pyc" whenever a module is parsed (from a file whose +name ends in ".py"). When the corresponding .py file is changed, it +is parsed and translated again and the .pyc file is rewritten. +

+There is no performance difference once the .pyc file has been loaded +(the bytecode read from the .pyc file is exactly the same as the bytecode +created by direct translation). The only difference is that loading +code from a .pyc file is faster than parsing and translating a .py +file, so the presence of precompiled .pyc files will generally improve +start-up time of Python scripts. If desired, the Lib/compileall.py +module/script can be used to force creation of valid .pyc files for a +given set of modules. +

+Note that the main script executed by Python, even if its filename +ends in .py, is not compiled to a .pyc file. It is compiled to +bytecode, but the bytecode is not saved to a file. +

+If you are looking for a way to translate Python programs in order to +distribute them in binary form, without the need to distribute the +interpreter and library as well, have a look at the freeze.py script +in the Tools/freeze directory. This creates a single binary file +incorporating your program, the Python interpreter, and those parts of +the Python library that are needed by your program. Of course, the +resulting binary will only run on the same type of platform as that +used to create it. +

+Newsflash: there are now several programs that do this, to some extent. +Look for Psyco, Pyrex, PyInline, Py2Cmod, and Weave. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 24 21:26:19 2002 by +GvR +

+ +

6.14. How does Python manage memory?

+The details of Python memory management depend on the implementation. +The standard Python implementation (the C implementation) uses reference +counting and another mechanism to collect reference cycles. +

+Jython relies on the Java runtime; so it uses +the JVM's garbage collector. This difference can cause some subtle +porting problems if your Python code depends on the behavior of +the reference counting implementation. +

+The reference cycle collector was added in CPython 2.0. It +periodically executes a cycle detection algorithm which looks for inaccessible cycles and deletes the objects involved. A new gc module provides functions to perform a garbage collection, obtain debugging statistics, and tuning the collector's parameters. +

+The detection of cycles can be disabled when Python is compiled, if you can't afford even a tiny speed penalty or suspect that the cycle collection is buggy, by specifying the "--without-cycle-gc" switch when running the configure script. +

+Sometimes objects get stuck in "tracebacks" temporarily and hence are not deallocated when you might expect. Clear the tracebacks via +

+       import sys
+       sys.exc_traceback = sys.last_traceback = None
+

+Tracebacks are used for reporting errors and implementing debuggers and related things. They contain a portion of the program state extracted during the handling of an exception (usually the most recent exception). +

+In the absence of circularities and modulo tracebacks, Python programs need not explicitly manage memory. +

+Why python doesn't use a more traditional garbage collection +scheme? For one thing, unless this were +added to C as a standard feature, it's a portability pain in the ass. +And yes, I know about the Xerox library. It has bits of assembler +code for most common platforms. Not for all. And although it is +mostly transparent, it isn't completely transparent (when I once +linked Python with it, it dumped core). +

+Traditional GC also becomes a problem when Python gets embedded into +other applications. While in a stand-alone Python it may be fine to +replace the standard malloc() and free() with versions provided by the +GC library, an application embedding Python may want to have its own +substitute for malloc() and free(), and may not want Python's. Right +now, Python works with anything that implements malloc() and free() +properly. +

+In Jython, the following code (which is +fine in C Python) will probably run out of file descriptors long before +it runs out of memory: +

+        for file in <very long list of files>:
+                f = open(file)
+                c = f.read(1)
+

+Using the current reference counting and destructor scheme, each new +assignment to f closes the previous file. Using GC, this is not +guaranteed. Sure, you can think of ways to fix this. But it's not +off-the-shelf technology. If you want to write code that will +work with any Python implementation, you should explicitly close +the file; this will work regardless of GC: +

+       for file in <very long list of files>:
+                f = open(file)
+                c = f.read(1)
+                f.close()
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Mar 21 05:35:38 2002 by +Erno Kuusela +

+ +

6.15. Why are there separate tuple and list data types?

+This is done so that tuples can be immutable while lists are mutable. +

+Immutable tuples are useful in situations where you need to pass a few +items to a function and don't want the function to modify the tuple; +for example, +

+	point1 = (120, 140)
+	point2 = (200, 300)
+	record(point1, point2)
+	draw(point1, point2)
+

+You don't want to have to think about what would happen if record() +changed the coordinates -- it can't, because the tuples are immutable. +

+On the other hand, when creating large lists dynamically, it is +absolutely crucial that they are mutable -- adding elements to a tuple +one by one requires using the concatenation operator, which makes it +quadratic in time. +

+As a general guideline, use tuples like you would use structs in C or +records in Pascal, use lists like (variable length) arrays. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 15:26:03 1997 by +GvR +

+ +

6.16. How are lists implemented?

+Despite what a Lisper might think, Python's lists are really +variable-length arrays. The implementation uses a contiguous +array of references to other objects, and keeps a pointer +to this array (as well as its length) in a list head structure. +

+This makes indexing a list (a[i]) an operation whose cost is +independent of the size of the list or the value of the index. +

+When items are appended or inserted, the array of references is resized. +Some cleverness is applied to improve the performance of appending +items repeatedly; when the array must be grown, some extra space +is allocated so the next few times don't require an actual resize. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 15:32:24 1997 by +GvR +

+ +

6.17. How are dictionaries implemented?

+Python's dictionaries are implemented as resizable hash tables. +

+Compared to B-trees, this gives better performance for lookup +(the most common operation by far) under most circumstances, +and the implementation is simpler. +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 23:51:14 1997 by +Vladimir Marangozov +

+ +

6.18. Why must dictionary keys be immutable?

+The hash table implementation of dictionaries uses a hash value +calculated from the key value to find the key. If the key were +a mutable object, its value could change, and thus its hash could +change. But since whoever changes the key object can't tell that +is incorporated in a dictionary, it can't move the entry around in +the dictionary. Then, when you try to look up the same object +in the dictionary, it won't be found, since its hash value is different; +and if you try to look up the old value, it won't be found either, +since the value of the object found in that hash bin differs. +

+If you think you need to have a dictionary indexed with a list, +try to use a tuple instead. The function tuple(l) creates a tuple +with the same entries as the list l. +

+Some unacceptable solutions that have been proposed: +

+- Hash lists by their address (object ID). This doesn't work because +if you construct a new list with the same value it won't be found; +e.g., +

+  d = {[1,2]: '12'}
+  print d[[1,2]]
+

+will raise a KeyError exception because the id of the [1,2] used +in the second line differs from that in the first line. +In other words, dictionary keys should be compared using '==', not using 'is'. +

+- Make a copy when using a list as a key. This doesn't work because +the list (being a mutable object) could contain a reference to itself, +and then the copying code would run into an infinite loop. +

+- Allow lists as keys but tell the user not to modify them. This would +allow a class of hard-to-track bugs in programs that I'd rather not see; +it invalidates an important invariant of dictionaries (every value in +d.keys() is usable as a key of the dictionary). +

+- Mark lists as read-only once they are used as a dictionary key. +The problem is that it's not just the top-level object that could change +its value; you could use a tuple containing a list as a key. Entering +anything as a key into a dictionary would require marking all objects +reachable from there as read-only -- and again, self-referential objects +could cause an infinite loop again (and again and again). +

+There is a trick to get around this if you need to, but +use it at your own risk: You +can wrap a mutable structure inside a class instance which +has both a __cmp__ and a __hash__ method. +

+   class listwrapper:
+        def __init__(self, the_list):
+              self.the_list = the_list
+        def __cmp__(self, other):
+              return self.the_list == other.the_list
+        def __hash__(self):
+              l = self.the_list
+              result = 98767 - len(l)*555
+              for i in range(len(l)):
+                   try:
+                        result = result + (hash(l[i]) % 9999999) * 1001 + i
+                   except:
+                        result = (result % 7777777) + i * 333
+              return result
+

+Note that the hash computation is complicated by the +possibility that some members of the list may be unhashable +and also by the possibility of arithmetic overflow. +

+You must make +sure that the hash value for all such wrapper objects that reside in a +dictionary (or other hash based structure), remain fixed while +the object is in the dictionary (or other structure). +

+Furthermore it must always be the case that if +o1 == o2 (ie o1.__cmp__(o2)==0) then hash(o1)==hash(o2) +(ie, o1.__hash__() == o2.__hash__()), regardless of whether +the object is in a dictionary or not. +If you fail to meet these restrictions dictionaries and other +hash based structures may misbehave! +

+In the case of listwrapper above whenever the wrapper +object is in a dictionary the wrapped list must not change +to avoid anomalies. Don't do this unless you are prepared +to think hard about the requirements and the consequences +of not meeting them correctly. You've been warned! +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jul 10 10:08:40 1997 by +aaron watters +

+ +

6.19. How the heck do you make an array in Python?

+["this", 1, "is", "an", "array"] +

+Lists are arrays in the C or Pascal sense of the word (see question +6.16). The array module also provides methods for creating arrays +of fixed types with compact representations (but they are slower to +index than lists). Also note that the Numerics extensions and others +define array-like structures with various characteristics as well. +

+To get Lisp-like lists, emulate cons cells +

+    lisp_list = ("like",  ("this",  ("example", None) ) )
+

+using tuples (or lists, if you want mutability). Here the analogue +of lisp car is lisp_list[0] and the analogue of cdr is lisp_list[1]. +Only do this if you're sure you really need to (it's usually a lot +slower than using Python lists). +

+Think of Python lists as mutable heterogeneous arrays of +Python objects (say that 10 times fast :) ). +

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 13 07:08:27 1997 by +aaron watters +

+ +

6.20. Why doesn't list.sort() return the sorted list?

+In situations where performance matters, making a copy of the list +just to sort it would be wasteful. Therefore, list.sort() sorts +the list in place. In order to remind you of that fact, it does +not return the sorted list. This way, you won't be fooled into +accidentally overwriting a list when you need a sorted copy but also +need to keep the unsorted version around. +

+As a result, here's the idiom to iterate over the keys of a dictionary +in sorted order: +

+	keys = dict.keys()
+	keys.sort()
+	for key in keys:
+		...do whatever with dict[key]...
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Dec 2 17:01:52 1999 by +Fred L. Drake, Jr. +

+ +

6.21. How do you specify and enforce an interface spec in Python?

+An interfaces specification for a module as provided +by languages such as C++ and java describes the prototypes +for the methods and functions of the module. Many feel +that compile time enforcement of interface specifications +help aid in the construction of large programs. Python +does not support interface specifications directly, but many +of their advantages can be obtained by an appropriate +test discipline for components, which can often be very +easily accomplished in Python. There is also a tool, PyChecker, +which can be used to find problems due to subclassing. +

+A good test suite for a module can at +once provide a regression test and serve as a module interface +specification (even better since it also gives example usage). Look to +many of the standard libraries which often have a "script +interpretation" which provides a simple "self test." Even +modules which use complex external interfaces can often +be tested in isolation using trivial "stub" emulations of the +external interface. +

+An appropriate testing discipline (if enforced) can help +build large complex applications in Python as well as having interface +specifications would do (or better). Of course Python allows you +to get sloppy and not do it. Also you might want to design +your code with an eye to make it easily tested. +

+ +Edit this entry / +Log info + +/ Last changed on Thu May 23 03:05:29 2002 by +Neal Norwitz +

+ +

6.22. Why do all classes have the same type? Why do instances all have the same type?

+The Pythonic use of the word "type" is quite different from +common usage in much of the rest of the programming language +world. A "type" in Python is a description for an object's operations +as implemented in C. All classes have the same operations +implemented in C which sometimes "call back" to differing program +fragments implemented in Python, and hence all classes have the +same type. Similarly at the C level all class instances have the +same C implementation, and hence all instances have the same +type. +

+Remember that in Python usage "type" refers to a C implementation +of an object. To distinguish among instances of different classes +use Instance.__class__, and also look to 4.47. Sorry for the +terminological confusion, but at this point in Python's development +nothing can be done! +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jul 1 12:35:47 1997 by +aaron watters +

+ +

6.23. Why isn't all memory freed when Python exits?

+Objects referenced from Python module global name spaces are +not always deallocated when Python exits. +

+This may happen if there are circular references (see question +4.17). There are also certain bits of memory that are allocated +by the C library that are impossible to free (e.g. a tool +like Purify will complain about these). +

+But in general, Python 1.5 and beyond +(in contrast with earlier versions) is quite agressive about +cleaning up memory on exit. +

+If you want to force Python to delete certain things on deallocation +use the sys.exitfunc hook to force those deletions. For example +if you are debugging an extension module using a memory analysis +tool and you wish to make Python deallocate almost everything +you might use an exitfunc like this one: +

+  import sys
+

+  def my_exitfunc():
+       print "cleaning up"
+       import sys
+       # do order dependant deletions here
+       ...
+       # now delete everything else in arbitrary order
+       for x in sys.modules.values():
+            d = x.__dict__
+            for name in d.keys():
+                 del d[name]
+

+  sys.exitfunc = my_exitfunc
+

+Other exitfuncs can be less drastic, of course. +

+(In fact, this one just does what Python now already does itself; +but the example of using sys.exitfunc to force cleanups is still +useful.) +

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 29 09:46:26 1998 by +GvR +

+ +

6.24. Why no class methods or mutable class variables?

+The notation +

+    instance.attribute(arg1, arg2)
+

+usually translates to the equivalent of +

+    Class.attribute(instance, arg1, arg2)
+

+where Class is a (super)class of instance. Similarly +

+    instance.attribute = value
+

+sets an attribute of an instance (overriding any attribute of a class +that instance inherits). +

+Sometimes programmers want to have +different behaviours -- they want a method which does not bind +to the instance and a class attribute which changes in place. +Python does not preclude these behaviours, but you have to +adopt a convention to implement them. One way to accomplish +this is to use "list wrappers" and global functions. +

+   def C_hello():
+         print "hello"
+

+   class C:
+        hello = [C_hello]
+        counter = [0]
+

+    I = C()
+

+Here I.hello[0]() acts very much like a "class method" and +I.counter[0] = 2 alters C.counter (and doesn't override it). +If you don't understand why you'd ever want to do this, that's +because you are pure of mind, and you probably never will +want to do it! This is dangerous trickery, not recommended +when avoidable. (Inspired by Tim Peter's discussion.) +

+In Python 2.2, you can do this using the new built-in operations +classmethod and staticmethod. +See http://www.python.org/2.2/descrintro.html#staticmethods +

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 11 15:59:37 2001 by +GvR +

+ +

6.25. Why are default values sometimes shared between objects?

+It is often expected that a function CALL creates new objects for default +values. This is not what happens. Default values are created when the +function is DEFINED, that is, there is only one such object that all +functions refer to. If that object is changed, subsequent calls to the +function will refer to this changed object. By definition, immutable objects +(like numbers, strings, tuples, None) are safe from change. Changes to mutable +objects (like dictionaries, lists, class instances) is what causes the +confusion. +

+Because of this feature it is good programming practice not to use mutable +objects as default values, but to introduce them in the function. +Don't write: +

+	def foo(dict={}):  # XXX shared reference to one dict for all calls
+	    ...
+

+but: +

+	def foo(dict=None):
+		if dict is None:
+			dict = {} # create a new dict for local namespace
+

+See page 182 of "Internet Programming with Python" for one discussion +of this feature. Or see the top of page 144 or bottom of page 277 in +"Programming Python" for another discussion. +

+ +Edit this entry / +Log info + +/ Last changed on Sat Aug 16 07:03:35 1997 by +Case Roole +

+ +

6.26. Why no goto?

+Actually, you can use exceptions to provide a "structured goto" +that even works across function calls. Many feel that exceptions +can conveniently emulate all reasonable uses of the "go" or "goto" +constructs of C, Fortran, and other languages. For example: +

+   class label: pass # declare a label
+   try:
+        ...
+        if (condition): raise label() # goto label
+        ...
+   except label: # where to goto
+        pass
+   ...
+

+This doesn't allow you to jump into the middle of a loop, but +that's usually considered an abuse of goto anyway. Use sparingly. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Sep 10 07:16:44 1997 by +aaron watters +

+ +

6.27. How do you make a higher order function in Python?

+You have two choices: you can use default arguments and override +them or you can use "callable objects." For example suppose you +wanted to define linear(a,b) which returns a function f where f(x) +computes the value a*x+b. Using default arguments: +

+     def linear(a,b):
+         def result(x, a=a, b=b):
+             return a*x + b
+         return result
+

+Or using callable objects: +

+     class linear:
+        def __init__(self, a, b):
+            self.a, self.b = a,b
+        def __call__(self, x):
+            return self.a * x + self.b
+

+In both cases: +

+     taxes = linear(0.3,2)
+

+gives a callable object where taxes(10e6) == 0.3 * 10e6 + 2. +

+The defaults strategy has the disadvantage that the default arguments +could be accidentally or maliciously overridden. The callable objects +approach has the disadvantage that it is a bit slower and a bit +longer. Note however that a collection of callables can share +their signature via inheritance. EG +

+      class exponential(linear):
+         # __init__ inherited
+         def __call__(self, x):
+             return self.a * (x ** self.b)
+

+On comp.lang.python, zenin@bawdycaste.org points out that +an object can encapsulate state for several methods in order +to emulate the "closure" concept from functional programming +languages, for example: +

+    class counter:
+        value = 0
+        def set(self, x): self.value = x
+        def up(self): self.value=self.value+1
+        def down(self): self.value=self.value-1
+

+    count = counter()
+    inc, dec, reset = count.up, count.down, count.set
+

+Here inc, dec and reset act like "functions which share the +same closure containing the variable count.value" (if you +like that way of thinking). +

+ +Edit this entry / +Log info + +/ Last changed on Fri Sep 25 08:38:35 1998 by +Aaron Watters +

+ +

6.28. Why do I get a SyntaxError for a 'continue' inside a 'try'?

+This is an implementation limitation, +caused by the extremely simple-minded +way Python generates bytecode. The try block pushes something on the +"block stack" which the continue would have to pop off again. The +current code generator doesn't have the data structures around so that +'continue' can generate the right code. +

+Note that JPython doesn't have this restriction! +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 22 15:01:07 1998 by +GvR +

+ +

6.29. Why can't raw strings (r-strings) end with a backslash?

+More precisely, they can't end with an odd number of backslashes: +the unpaired backslash at the end escapes the closing quote character, +leaving an unterminated string. +

+Raw strings were designed to ease creating input for processors (chiefly +regular expression engines) that want to do their own backslash escape processing. Such processors consider an unmatched trailing backslash to be an error anyway, so raw strings disallow that. In return, they allow you to pass on the string quote character by escaping it with a backslash. These rules work well when r-strings are used for their intended purpose. +

+If you're trying to build Windows pathnames, note that all Windows system calls accept forward slashes too: +

+    f = open("/mydir/file.txt") # works fine!
+

+If you're trying to build a pathname for a DOS command, try e.g. one of +

+    dir = r"\this\is\my\dos\dir" "\\"
+    dir = r"\this\is\my\dos\dir\ "[:-1]
+    dir = "\\this\\is\\my\\dos\\dir\\"
+

+ +Edit this entry / +Log info + +/ Last changed on Mon Jul 13 20:50:20 1998 by +Tim Peters +

+ +

6.30. Why can't I use an assignment in an expression?

+Many people used to C or Perl complain that they want to be able to +use e.g. this C idiom: +

+    while (line = readline(f)) {
+        ...do something with line...
+    }
+

+where in Python you're forced to write this: +

+    while 1:
+        line = f.readline()
+        if not line:
+            break
+        ...do something with line...
+

+This issue comes up in the Python newsgroup with alarming frequency +-- search Deja News for past messages about assignment expression. +The reason for not allowing assignment in Python expressions +is a common, hard-to-find bug in those other languages, +caused by this construct: +

+    if (x = 0) {
+        ...error handling...
+    }
+    else {
+        ...code that only works for nonzero x...
+    }
+

+Many alternatives have been proposed. Most are hacks that save some +typing but use arbitrary or cryptic syntax or keywords, +and fail the simple criterion that I use for language change proposals: +it should intuitively suggest the proper meaning to a human reader +who has not yet been introduced with the construct. +

+The earliest time something can be done about this will be with +Python 2.0 -- if it is decided that it is worth fixing. +An interesting phenomenon is that most experienced Python programmers +recognize the "while 1" idiom and don't seem to be missing the +assignment in expression construct much; it's only the newcomers +who express a strong desire to add this to the language. +

+One fairly elegant solution would be to introduce a new operator +for assignment in expressions spelled ":=" -- this avoids the "=" +instead of "==" problem. It would have the same precedence +as comparison operators but the parser would flag combination with +other comparisons (without disambiguating parentheses) as an error. +

+Finally -- there's an alternative way of spelling this that seems +attractive but is generally less robust than the "while 1" solution: +

+    line = f.readline()
+    while line:
+        ...do something with line...
+        line = f.readline()
+

+The problem with this is that if you change your mind about exactly +how you get the next line (e.g. you want to change it into +sys.stdin.readline()) you have to remember to change two places +in your program -- the second one hidden at the bottom of the loop. +

+ +Edit this entry / +Log info + +/ Last changed on Tue May 18 00:57:41 1999 by +Andrew Dalke +

+ +

6.31. Why doesn't Python have a "with" statement like some other languages?

+Basically, because such a construct would be terribly ambiguous. Thanks to Carlos Ribeiro for the following remarks: +

+Some languages, such as Object Pascal, Delphi, and C++, use static types. So it is possible to know, in an unambiguous way, what member is being assigned in a "with" clause. This is the main point - the compiler always knows the scope of every variable at compile time. +

+Python uses dynamic types. It is impossible to know in advance which +attribute will be referenced at runtime. Member attributes may be added or removed from objects on the fly. This would make it impossible to know, from a simple reading, what attribute is being referenced - a local one, a global one, or a member attribute. +

+For instance, take the following snippet (it is incomplete btw, just to +give you the idea): +

+   def with_is_broken(a):
+      with a:
+         print x
+

+The snippet assumes that "a" must have a member attribute called "x". +However, there is nothing in Python that guarantees that. What should +happen if "a" is, let us say, an integer? And if I have a global variable named "x", will it end up being used inside the with block? As you see, the dynamic nature of Python makes such choices much harder. +

+The primary benefit of "with" and similar language features (reduction of code volume) can, however, easily be achieved in Python by assignment. Instead of: +

+    function(args).dict[index][index].a = 21
+    function(args).dict[index][index].b = 42
+    function(args).dict[index][index].c = 63
+

+would become: +

+    ref = function(args).dict[index][index]
+    ref.a = 21
+    ref.b = 42
+    ref.c = 63
+

+This also has the happy side-effect of increasing execution speed, since name bindings are resolved at run-time in Python, and the second method only needs to perform the resolution once. If the referenced object does not have a, b and c attributes, of course, the end result is still a run-time exception. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jan 11 14:32:58 2002 by +Steve Holden +

+ +

6.32. Why are colons required for if/while/def/class?

+The colon is required primarily to enhance readability (one of the +results of the experimental ABC language). Consider this: +

+    if a==b
+        print a
+

+versus +

+    if a==b:
+        print a
+

+Notice how the second one is slightly easier to read. Notice further how +a colon sets off the example in the second line of this FAQ answer; it's +a standard usage in English. Finally, the colon makes it easier for +editors with syntax highlighting. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Jun 3 07:22:57 2002 by +Matthias Urlichs +

+ +

6.33. Can't we get rid of the Global Interpreter Lock?

+The Global Interpreter Lock (GIL) is often seen as a hindrance to +Python's deployment on high-end multiprocessor server machines, +because a multi-threaded Python program effectively only uses +one CPU, due to the insistence that (almost) all Python code +can only run while the GIL is held. +

+Back in the days of Python 1.5, Greg Stein actually implemented +a comprehensive patch set ("free threading") +that removed the GIL, replacing it with +fine-grained locking. Unfortunately, even on Windows (where locks +are very efficient) this ran ordinary Python code about twice as +slow as the interpreter using the GIL. On Linux the performance +loss was even worse (pthread locks aren't as efficient). +

+Since then, the idea of getting rid of the GIL has occasionally +come up but nobody has found a way to deal with the expected slowdown; +Greg's free threading patch set has not been kept up-to-date for +later Python versions. +

+This doesn't mean that you can't make good use of Python on +multi-CPU machines! You just have to be creative with dividing +the work up between multiple processes rather than multiple +threads. +

+It has been suggested that the GIL should be a per-interpreter-state +lock rather than truly global; interpreters then wouldn't be able +to share objects. Unfortunately, this isn't likely to happen either. +

+It would be a tremendous amount of work, because many object +implementations currently have global state. E.g. small ints and +small strings are cached; these caches would have to be moved to the +interpreter state. Other object types have their own free list; these +free lists would have to be moved to the interpreter state. And so +on. +

+And I doubt that it can even be done in finite time, because the same +problem exists for 3rd party extensions. It is likely that 3rd party +extensions are being written at a faster rate than you can convert +them to store all their global state in the interpreter state. +

+And finally, once you have multiple interpreters not sharing any +state, what have you gained over running each interpreter +in a separate process? +

+ +Edit this entry / +Log info + +/ Last changed on Fri Feb 7 16:34:01 2003 by +GvR +

+ +

7. Using Python on non-UNIX platforms

+ +

7.1. Is there a Mac version of Python?

+Yes, it is maintained by Jack Jansen. See Jack's MacPython Page: +

+  http://www.cwi.nl/~jack/macpython.html
+

+ +Edit this entry / +Log info + +/ Last changed on Fri May 4 09:33:42 2001 by +GvR +

+ +

7.2. Are there DOS and Windows versions of Python?

+Yes. The core windows binaries are available from http://www.python.org/windows/. There is a plethora of Windows extensions available, including a large number of not-always-compatible GUI toolkits. The core binaries include the standard Tkinter GUI extension. +

+Most windows extensions can be found (or referenced) at http://www.python.org/windows/ +

+Windows 3.1/DOS support seems to have dropped off recently. You may need to settle for an old version of Python one these platforms. One such port is WPY +

+WPY: Ports to DOS, Windows 3.1(1), Windows 95, Windows NT and OS/2. +Also contains a GUI package that offers portability between Windows +(not DOS) and Unix, and native look and feel on both. +ftp://ftp.python.org/pub/python/wpy/. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Jun 2 20:21:57 1998 by +Mark Hammond +

+ +

7.3. Is there an OS/2 version of Python?

+Yes, see http://www.python.org/download/download_os2.html. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Sep 7 11:33:16 1999 by +GvR +

+ +

7.4. Is there a VMS version of Python?

+Jean-Fran�ois Pi�ronne has ported 2.1.3 to OpenVMS. It can be found at +<http://vmspython.dyndns.org/>. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Sep 19 15:40:38 2002 by +Skip Montanaro +

+ +

7.5. What about IBM mainframes, or other non-UNIX platforms?

+I haven't heard about these, except I remember hearing about an +OS/9 port and a port to Vxworks (both operating systems for embedded +systems). If you're interested in any of this, go directly to the +newsgroup and ask there, you may find exactly what you need. For +example, a port to MPE/iX 5.0 on HP3000 computers was just announced, +see http://www.allegro.com/software/. +

+On the IBM mainframe side, for Z/OS there's a port of python 1.4 that goes with their open-unix package, formely OpenEdition MVS, (http://www-1.ibm.com/servers/eserver/zseries/zos/unix/python.html). On a side note, there's also a java vm ported - so, in theory, jython could run too. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Nov 18 03:18:39 2002 by +Bruno Jessen +

+ +

7.6. Where are the source or Makefiles for the non-UNIX versions?

+The standard sources can (almost) be used. Additional sources can +be found in the platform-specific subdirectories of the distribution. +

+ +Edit this entry / +Log info +

+ +

7.7. What is the status and support for the non-UNIX versions?

+I don't have access to most of these platforms, so in general I am +dependent on material submitted by volunteers. However I strive to +integrate all changes needed to get it to compile on a particular +platform back into the standard sources, so porting of the next +version to the various non-UNIX platforms should be easy. +(Note that Linux is classified as a UNIX platform here. :-) +

+Some specific platforms: +

+Windows: all versions (95, 98, ME, NT, 2000, XP) are supported, +all python.org releases come with a Windows installer. +

+MacOS: Jack Jansen does an admirable job of keeping the Mac version +up to date (both MacOS X and older versions); +see http://www.cwi.nl/~jack/macpython.html +

+For all supported platforms, see http://www.python.org/download/ +(follow the link to "Other platforms" for less common platforms) +

+ +Edit this entry / +Log info + +/ Last changed on Fri May 24 21:34:24 2002 by +GvR +

+ +

7.8. I have a PC version but it appears to be only a binary. Where's the library?

+If you are running any version of Windows, then you have the wrong distribution. The FAQ lists current Windows versions. Notably, Pythonwin and wpy provide fully functional installations. +

+But if you are sure you have the only distribution with a hope of working on +your system, then... +

+You still need to copy the files from the distribution directory +"python/Lib" to your system. If you don't have the full distribution, +you can get the file lib<version>.tar.gz from most ftp sites carrying +Python; this is a subset of the distribution containing just those +files, e.g. ftp://ftp.python.org/pub/python/src/lib1.4.tar.gz. +

+Once you have installed the library, you need to point sys.path to it. +Assuming the library is in C:\misc\python\lib, the following commands +will point your Python interpreter to it (note the doubled backslashes +-- you can also use single forward slashes instead): +

+        >>> import sys
+        >>> sys.path.insert(0, 'C:\\misc\\python\\lib')
+        >>>
+

+For a more permanent effect, set the environment variable PYTHONPATH, +as follows (talking to a DOS prompt): +

+        C> SET PYTHONPATH=C:\misc\python\lib
+

+ +Edit this entry / +Log info + +/ Last changed on Fri May 23 16:28:27 1997 by +Ken Manheimer +

+ +

7.9. Where's the documentation for the Mac or PC version?

+The documentation for the Unix version also applies to the Mac and +PC versions. Where applicable, differences are indicated in the text. +

+ +Edit this entry / +Log info +

+ +

7.10. How do I create a Python program file on the Mac or PC?

+Use an external editor. On the Mac, BBEdit seems to be a popular +no-frills text editor. I work like this: start the interpreter; edit +a module file using BBedit; import and test it in the interpreter; +edit again in BBedit; then use the built-in function reload() to +re-read the imported module; etc. In the 1.4 distribution +you will find a BBEdit extension that makes life a little easier: +it can tell the interpreter to execute the current window. +See :Mac:Tools:BBPy:README. +

+Regarding the same question for the PC, Kurt Wm. Hemr writes: "While +anyone with a pulse could certainly figure out how to do the same on +MS-Windows, I would recommend the NotGNU Emacs clone for MS-Windows. +Not only can you easily resave and "reload()" from Python after making +changes, but since WinNot auto-copies to the clipboard any text you +select, you can simply select the entire procedure (function) which +you changed in WinNot, switch to QWPython, and shift-ins to reenter +the changed program unit." +

+If you're using Windows95 or Windows NT, you should also know about +PythonWin, which provides a GUI framework, with an mouse-driven +editor, an object browser, and a GUI-based debugger. See +

+       http://www.python.org/ftp/python/pythonwin/
+

+for details. +

+ +Edit this entry / +Log info + +/ Last changed on Sun May 25 10:04:25 1997 by +GvR +

+ +

7.11. How can I use Tkinter on Windows 95/NT?

+Starting from Python 1.5, it's very easy -- just download and install +Python and Tcl/Tk and you're in business. See +

+  http://www.python.org/download/download_windows.html
+

+One warning: don't attempt to use Tkinter from PythonWin +(Mark Hammond's IDE). Use it from the command line interface +(python.exe) or the windowless interpreter (pythonw.exe). +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jun 12 09:32:48 1998 by +GvR +

+ +

7.12. cgi.py (or other CGI programming) doesn't work sometimes on NT or win95!

+Be sure you have the latest python.exe, that you are using +python.exe rather than a GUI version of python and that you +have configured the server to execute +

+     "...\python.exe -u ..."
+

+for the cgi execution. The -u (unbuffered) option on NT and +win95 prevents the interpreter from altering newlines in the +standard input and output. Without it post/multipart requests +will seem to have the wrong length and binary (eg, GIF) +responses may get garbled (resulting in, eg, a "broken image"). +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jul 30 10:48:02 1997 by +aaron watters +

+ +

7.13. Why doesn't os.popen() work in PythonWin on NT?

+The reason that os.popen() doesn't work from within PythonWin is due to a bug in Microsoft's C Runtime Library (CRT). The CRT assumes you have a Win32 console attached to the process. +

+You should use the win32pipe module's popen() instead which doesn't depend on having an attached Win32 console. +

+Example: +

+ import win32pipe
+ f = win32pipe.popen('dir /c c:\\')
+ print f.readlines()
+ f.close()
+

+ +Edit this entry / +Log info + +/ Last changed on Thu Jul 31 15:34:09 1997 by +Bill Tutt +

+ +

7.14. How do I use different functionality on different platforms with the same program?

+Remember that Python is extremely dynamic and that you +can use this dynamism to configure a program at run-time to +use available functionality on different platforms. For example +you can test the sys.platform and import different modules based +on its value. +

+   import sys
+   if sys.platform == "win32":
+      import win32pipe
+      popen = win32pipe.popen
+   else:
+      import os
+      popen = os.popen
+

+(See FAQ 7.13 for an explanation of why you might want to +do something like this.) Also you can try to import a module +and use a fallback if the import fails: +

+    try:
+         import really_fast_implementation
+         choice = really_fast_implementation
+    except ImportError:
+         import slower_implementation
+         choice = slower_implementation
+

+ +Edit this entry / +Log info + +/ Last changed on Wed Aug 13 07:39:06 1997 by +aaron watters +

+ +

7.15. Is there an Amiga version of Python?

+Yes. See the AmigaPython homepage at http://www.bigfoot.com/~irmen/python.html. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Dec 14 06:53:32 1998 by +Irmen de Jong +

+ +

7.16. Why doesn't os.popen()/win32pipe.popen() work on Win9x?

+There is a bug in Win9x that prevents os.popen/win32pipe.popen* from working. The good news is there is a way to work around this problem. +The Microsoft Knowledge Base article that you need to lookup is: Q150956. You will find links to the knowledge base at: +http://www.microsoft.com/kb. +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jun 25 10:45:38 1999 by +Bill Tutt +

+ +

8. Python on Windows

+ +

8.1. Using Python for CGI on Microsoft Windows

+** Setting up the Microsoft IIS Server/Peer Server +

+On the Microsoft IIS +server or on the Win95 MS Personal Web Server +you set up python in the same way that you +would set up any other scripting engine. +

+Run regedt32 and go to: +

+HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\W3SVC\Parameters\ScriptMap +

+and enter the following line (making any specific changes that your system may need) +

+.py :REG_SZ: c:\<path to python>\python.exe -u %s %s +

+This line will allow you to call your script with a simple reference like: +http://yourserver/scripts/yourscript.py +provided "scripts" is an "executable" directory for your server (which +it usually is by default). +The "-u" flag specifies unbuffered and binary mode for stdin - needed when working with binary data +

+In addition, it is recommended by people who would know that using ".py" may +not be a good idea for the file extensions when used in this context +(you might want to reserve *.py for support modules and use *.cgi or *.cgp +for "main program" scripts). +However, that issue is beyond this Windows FAQ entry. +

+** Apache configuration +

+In the Apache configuration file httpd.conf, add the following line at +the end of the file: +

+ScriptInterpreterSource Registry +

+Then, give your Python CGI-scripts the extension .py and put them in the cgi-bin directory. +

+** Netscape Servers: +Information on this topic exists at: +http://home.netscape.com/comprod/server_central/support/fasttrack_man/programs.htm#1010870 +

+ +Edit this entry / +Log info + +/ Last changed on Wed Mar 27 12:25:54 2002 by +Gerhard H�ring +

+ +

8.2. How to check for a keypress without blocking?

+Use the msvcrt module. This is a standard Windows-specific extensions +in Python 1.5 and beyond. It defines a function kbhit() which checks +whether a keyboard hit is present; also getch() which gets one +character without echo. Plus a few other goodies. +

+(Search for "keypress" to find an answer for Unix as well.) +

+ +Edit this entry / +Log info + +/ Last changed on Mon Mar 30 16:21:46 1998 by +GvR +

+ +

8.3. $PYTHONPATH

+In MS-DOS derived environments, a unix variable such as $PYTHONPATH is +set as PYTHONPATH, without the dollar sign. PYTHONPATH is useful for +specifying the location of library files. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jun 11 00:41:26 1998 by +Gvr +

+ +

8.4. dedent syntax errors

+The FAQ does not recommend using tabs, and Guido's Python Style Guide recommends 4 spaces for distributed Python code; this is also the Emacs python-mode default; see +

+    http://www.python.org/doc/essays/styleguide.html
+

+Under any editor mixing tabs and spaces is a bad idea. MSVC is no different in this respect, and is easily configured to use spaces: Take Tools -> Options -> Tabs, and for file type "Default" set "Tab size" and "Indent size" to 4, and select the "Insert spaces" radio button. +

+If you suspect mixed tabs and spaces are causing problems in leading whitespace, run Python with the -t switch or, run Tools/Scripts/tabnanny.py to check a directory tree in batch mode. +

+ +Edit this entry / +Log info + +/ Last changed on Mon Feb 12 15:04:14 2001 by +Steve Holden +

+ +

8.5. How do I emulate os.kill() in Windows?

+Use win32api: +

+    def kill(pid):
+        """kill function for Win32"""
+        import win32api
+        handle = win32api.OpenProcess(1, 0, pid)
+        return (0 != win32api.TerminateProcess(handle, 0))
+

+ +Edit this entry / +Log info + +/ Last changed on Sat Aug 8 18:55:06 1998 by +Jeff Bauer +

+ +

8.6. Why does os.path.isdir() fail on NT shared directories?

+The solution appears to be always append the "\\" on +the end of shared drives. +

+  >>> import os
+  >>> os.path.isdir( '\\\\rorschach\\public')
+  0
+  >>> os.path.isdir( '\\\\rorschach\\public\\')
+  1
+

+[Blake Winton responds:] +I've had the same problem doing "Start >> Run" and then a +directory on a shared drive. If I use "\\rorschach\public", +it will fail, but if I use "\\rorschach\public\", it will +work. For that matter, os.stat() does the same thing (well, +it gives an error for "\\\\rorschach\\public", but you get +the idea)... +

+I've got a theory about why this happens, but it's only +a theory. NT knows the difference between shared directories, +and regular directories. "\\rorschach\public" isn't a +directory, it's _really_ an IPC abstraction. This is sort +of lended credence to by the fact that when you're mapping +a network drive, you can't map "\\rorschach\public\utils", +but only "\\rorschach\public". +

+[Clarification by funkster@midwinter.com] +It's not actually a Python +question, as Python is working just fine; it's clearing up something +a bit muddled about Windows networked drives. +

+It helps to think of share points as being like drive letters. +Example: +

+        k: is not a directory
+        k:\ is a directory
+        k:\media is a directory
+        k:\media\ is not a directory
+

+The same rules apply if you substitute "k:" with "\\conky\foo": +

+        \\conky\foo  is not a directory
+        \\conky\foo\ is a directory
+        \\conky\foo\media is a directory
+        \\conky\foo\media\ is not a directory
+

+ +Edit this entry / +Log info + +/ Last changed on Sun Jan 31 08:44:48 1999 by +GvR +

+ +

8.7. PyRun_SimpleFile() crashes on Windows but not on Unix

+I've seen a number of reports of PyRun_SimpleFile() failing +in a Windows port of an application embedding Python that worked +fine on Unix. PyRun_SimpleString() works fine on both platforms. +

+I think this happens because the application was compiled with a +different set of compiler flags than Python15.DLL. It seems that some +compiler flags affect the standard I/O library in such a way that +using different flags makes calls fail. You need to set it for +the non-debug multi-threaded DLL (/MD on the command line, or can be set via MSVC under Project Settings->C++/Code Generation then the "Use rum-time library" dropdown.) +

+Also note that you can not mix-and-match Debug and Release versions. If you wish to use the Debug Multithreaded DLL, then your module _must_ have an "_d" appended to the base name. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Nov 17 17:37:07 1999 by +Mark Hammond +

+ +

8.8. Import of _tkinter fails on Windows 95/98

+Sometimes, the import of _tkinter fails on Windows 95 or 98, +complaining with a message like the following: +

+  ImportError: DLL load failed: One of the library files needed
+  to run this application cannot be found.
+

+It could be that you haven't installed Tcl/Tk, but if you did +install Tcl/Tk, and the Wish application works correctly, +the problem may be that its installer didn't +manage to edit the autoexec.bat file correctly. It tries to add a +statement that changes the PATH environment variable to include +the Tcl/Tk 'bin' subdirectory, but sometimes this edit doesn't +quite work. Opening it with notepad usually reveals what the +problem is. +

+(One additional hint, noted by David Szafranski: you can't use +long filenames here; e.g. use C:\PROGRA~1\Tcl\bin instead of +C:\Program Files\Tcl\bin.) +

+ +Edit this entry / +Log info + +/ Last changed on Wed Dec 2 22:32:41 1998 by +GvR +

+ +

8.9. Can't extract the downloaded documentation on Windows

+Sometimes, when you download the documentation package to a Windows +machine using a web browser, the file extension of the saved file +ends up being .EXE. This is a mistake; the extension should be .TGZ. +

+Simply rename the downloaded file to have the .TGZ extension, and +WinZip will be able to handle it. (If your copy of WinZip doesn't, +get a newer one from http://www.winzip.com.) +

+ +Edit this entry / +Log info + +/ Last changed on Sat Nov 21 13:41:35 1998 by +GvR +

+ +

8.10. Can't get Py_RunSimpleFile() to work.

+This is very sensitive to the compiler vendor, version and (perhaps) +even options. If the FILE* structure in your embedding program isn't +the same as is assumed by the Python interpreter it won't work. +

+The Python 1.5.* DLLs (python15.dll) are all compiled +with MS VC++ 5.0 and with multithreading-DLL options (/MD, I think). +

+If you can't change compilers or flags, try using Py_RunSimpleString(). +A trick to get it to run an arbitrary file is to construct a call to +execfile() with the name of your file as argument. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Jan 13 10:58:14 1999 by +GvR +

+ +

8.11. Where is Freeze for Windows?

+("Freeze" is a program that allows you to ship a Python program +as a single stand-alone executable file. It is not a compiler, +your programs don't run any faster, but they are more easily +distributable (to platforms with the same OS and CPU). Read the +README file of the freeze program for more disclaimers.) +

+You can use freeze on Windows, but you must download the source +tree (see http://www.python.org/download/download_source.html). +This is recommended for Python 1.5.2 (and betas thereof) only; +older versions don't quite work. +

+You need the Microsoft VC++ 5.0 compiler (maybe it works with +6.0 too). You probably need to build Python -- the project files +are all in the PCbuild directory. +

+The freeze program is in the Tools\freeze subdirectory of the source +tree. +

+ +Edit this entry / +Log info + +/ Last changed on Wed Feb 17 18:47:24 1999 by +GvR +

+ +

8.12. Is a *.pyd file the same as a DLL?

+Yes, .pyd files are dll's. But there are a few differences. If you +have a DLL named foo.pyd, then it must have a function initfoo(). You +can then write Python "import foo", and Python will search for foo.pyd +(as well as foo.py, foo.pyc) and if it finds it, will attempt to call +initfoo() to initialize it. You do not link your .exe with foo.lib, +as that would cause Windows to require the DLL to be present. +

+Note that the search path for foo.pyd is PYTHONPATH, not the same as +the path that Windows uses to search for foo.dll. Also, foo.pyd need +not be present to run your program, whereas if you linked your program +with a dll, the dll is required. Of course, foo.pyd is required if +you want to say "import foo". In a dll, linkage is declared in the +source code with __declspec(dllexport). In a .pyd, linkage is defined +in a list of available functions. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Nov 23 02:40:08 1999 by +Jameson Quinn +

+ +

8.13. Missing cw3215mt.dll (or missing cw3215.dll)

+Sometimes, when using Tkinter on Windows, you get an error that +cw3215mt.dll or cw3215.dll is missing. +

+Cause: you have an old Tcl/Tk DLL built with cygwin in your path +(probably C:\Windows). You must use the Tcl/Tk DLLs from the +standard Tcl/Tk installation (Python 1.5.2 comes with one). +

+ +Edit this entry / +Log info + +/ Last changed on Fri Jun 11 00:54:13 1999 by +GvR +

+ +

8.14. How to make python scripts executable:

+[Blake Coverett] +

+Win2K: +

+The standard installer already associates the .py extension with a file type +(Python.File) and gives that file type an open command that runs the +interpreter (D:\Program Files\Python\python.exe "%1" %*). This is enough to +make scripts executable from the command prompt as 'foo.py'. If you'd +rather be able to execute the script by simple typing 'foo' with no +extension you need to add .py to the PATHEXT environment variable. +

+WinNT: +

+The steps taken by the installed as described above allow you do run a +script with 'foo.py', but a long time bug in the NT command processor +prevents you from redirecting the input or output of any script executed in +this way. This is often important. +

+An appropriate incantation for making a Python script executable under WinNT +is to give the file an extension of .cmd and add the following as the first +line: +

+    @setlocal enableextensions & python -x %~f0 %* & goto :EOF
+

+Win9x: +

+[Due to Bruce Eckel] +

+  @echo off
+  rem = """
+  rem run python on this bat file. Needs the full path where
+  rem you keep your python files. The -x causes python to skip
+  rem the first line of the file:
+  python -x c:\aaa\Python\\"%0".bat %1 %2 %3 %4 %5 %6 %7 %8 %9
+  goto endofpython
+  rem """
+

+  # The python program goes here:
+

+  print "hello, Python"
+

+  # For the end of the batch file:
+  rem = """
+  :endofpython
+  rem """
+

+ +Edit this entry / +Log info + +/ Last changed on Tue Nov 30 10:25:17 1999 by +GvR +

+ +

8.15. Warning about CTL3D32 version from installer

+The Python installer issues a warning like this: +

+  This version uses CTL3D32.DLL whitch is not the correct version.
+  This version is used for windows NT applications only.
+

+[Tim Peters] +This is a Microsoft DLL, and a notorious +source of problems. The msg means what it says: you have the wrong version +of this DLL for your operating system. The Python installation did not +cause this -- something else you installed previous to this overwrote the +DLL that came with your OS (probably older shareware of some sort, but +there's no way to tell now). If you search for "CTL3D32" using any search +engine (AltaVista, for example), you'll find hundreds and hundreds of web +pages complaining about the same problem with all sorts of installation +programs. They'll point you to ways to get the correct version reinstalled +on your system (since Python doesn't cause this, we can't fix it). +

+David A Burton has written a little program to fix this. Go to +http://www.burtonsys.com/download.html and click on "ctl3dfix.zip" +

+ +Edit this entry / +Log info + +/ Last changed on Thu Oct 26 15:42:00 2000 by +GvR +

+ +

8.16. How can I embed Python into a Windows application?

+Edward K. Ream <edream@tds.net> writes +

+When '##' appears in a file name below, it is an abbreviated version number. For example, for Python 2.1.1, ## will be replaced by 21. +

+Embedding the Python interpreter in a Windows app can be summarized as +follows: +

+1. Do _not_ build Python into your .exe file directly. On Windows, +Python must be a DLL to handle importing modules that are themselves +DLL's. (This is the first key undocumented fact.) Instead, link to +python##.dll; it is typically installed in c:\Windows\System. +

+You can link to Python statically or dynamically. Linking statically +means linking against python##.lib The drawback is that your app won't +run if python##.dll does not exist on your system. +

+General note: python##.lib is the so-called "import lib" corresponding +to python.dll. It merely defines symbols for the linker. +

+Borland note: convert python##.lib to OMF format using Coff2Omf.exe +first. +

+Linking dynamically greatly simplifies link options; everything happens +at run time. Your code must load python##.dll using the Windows +LoadLibraryEx() routine. The code must also use access routines and +data in python##.dll (that is, Python's C API's) using pointers +obtained by the Windows GetProcAddress() routine. Macros can make +using these pointers transparent to any C code that calls routines in +Python's C API. +

+2. If you use SWIG, it is easy to create a Python "extension module" +that will make the app's data and methods available to Python. SWIG +will handle just about all the grungy details for you. The result is C +code that you link _into your .exe file_ (!) You do _not_ have to +create a DLL file, and this also simplifies linking. +

+3. SWIG will create an init function (a C function) whose name depends +on the name of the extension module. For example, if the name of the +module is leo, the init function will be called initleo(). If you use +SWIG shadow classes, as you should, the init function will be called +initleoc(). This initializes a mostly hidden helper class used by the +shadow class. +

+The reason you can link the C code in step 2 into your .exe file is that +calling the initialization function is equivalent to importing the +module into Python! (This is the second key undocumented fact.) +

+4. In short, you can use the following code to initialize the Python +interpreter with your extension module. +

+    #include "python.h"
+    ...
+    Py_Initialize();  // Initialize Python.
+    initmyAppc();  // Initialize (import) the helper class. 
+    PyRun_SimpleString("import myApp") ;  // Import the shadow class.
+

+5. There are two problems with Python's C API which will become apparent +if you use a compiler other than MSVC, the compiler used to build +python##.dll. +

+Problem 1: The so-called "Very High Level" functions that take FILE * +arguments will not work in a multi-compiler environment; each compiler's +notion of a struct FILE will be different. From an implementation +standpoint these are very _low_ level functions. +

+Problem 2: SWIG generates the following code when generating wrappers to +void functions: +

+    Py_INCREF(Py_None);
+    _resultobj = Py_None;
+    return _resultobj;
+

+Alas, Py_None is a macro that expands to a reference to a complex data +structure called _Py_NoneStruct inside python##.dll. Again, this code +will fail in a mult-compiler environment. Replace such code by: +

+    return Py_BuildValue("");
+

+It may be possible to use SWIG's %typemap command to make the change +automatically, though I have not been able to get this to work (I'm a +complete SWIG newbie). +

+6. Using a Python shell script to put up a Python interpreter window +from inside your Windows app is not a good idea; the resulting window +will be independent of your app's windowing system. Rather, you (or the +wxPythonWindow class) should create a "native" interpreter window. It +is easy to connect that window to the Python interpreter. You can +redirect Python's i/o to _any_ object that supports read and write, so +all you need is a Python object (defined in your extension module) that +contains read() and write() methods. +

+ +Edit this entry / +Log info + +/ Last changed on Thu Jan 31 16:29:34 2002 by +Victor Kryukov +

+ +

8.17. Setting up IIS 5 to use Python for CGI

+In order to set up Internet Information Services 5 to use Python for CGI processing, please see the following links: +

+http://www.e-coli.net/pyiis_server.html (for Win2k Server) +http://www.e-coli.net/pyiis.html (for Win2k pro) +

+ +Edit this entry / +Log info + +/ Last changed on Fri Mar 22 22:05:51 2002 by +douglas savitsky +

+ +

8.18. How do I run a Python program under Windows?

+This is not necessarily quite the straightforward question it appears +to be. If you are already familiar with running programs from the +Windows command line then everything will seem really easy and +obvious. If your computer experience is limited then you might need a +little more guidance. Also there are differences between Windows 95, +98, NT, ME, 2000 and XP which can add to the confusion. You might +think of this as "why I pay software support charges" if you have a +helpful and friendly administrator to help you set things up without +having to understand all this yourself. If so, then great! Show them +this page and it should be a done deal. +

+Unless you use some sort of integrated development environment (such +as PythonWin or IDLE, to name only two in a growing family) then you +will end up typing Windows commands into what is variously referred +to as a "DOS window" or "Command prompt window". Usually you can +create such a window from your Start menu (under Windows 2000 I use +"Start | Programs | Accessories | Command Prompt"). You should be +able to recognize when you have started such a window because you will +see a Windows "command prompt", which usually looks like this: +

+    C:\>
+

+The letter may be different, and there might be other things after it, +so you might just as easily see something like: +

+    D:\Steve\Projects\Python>
+

+depending on how your computer has been set up and what else you have +recently done with it. Once you have started such a window, you are +well on the way to running Python programs. +

+You need to realize that your Python scripts have to be processed by +another program, usually called the "Python interpreter". The +interpreter reads your script, "compiles" it into "Python bytecodes" +(which are instructions for an imaginary computer known as the "Python +Virtual Machine") and then executes the bytecodes to run your +program. So, how do you arrange for the interpreter to handle your +Python? +

+First, you need to make sure that your command window recognises the +word "python" as an instruction to start the interpreter. If you have +opened a command window, you should try entering the command: +

+    python
+

+and hitting return. If you then see something like: +

+    Python 2.2 (#28, Dec 21 2001, 12:21:22) [MSC 32 bit (Intel)] on win32
+    Type "help", "copyright", "credits" or "license" for more information.
+    >>>
+

+then this part of the job has been correctly managed during Python's +installation process, and you have started the interpreter in +"interactive mode". That means you can enter Python statements or +expressions interactively and have them executed or evaluated while +you wait. This is one of Python's strongest features, but it takes a +little getting used to. Check it by entering a few expressions of your +choice and seeing the results... +

+    >>> print "Hello"
+    Hello
+    >>> "Hello" * 3
+    HelloHelloHello
+

+When you want to end your interactive Python session, enter a +terminator (hold the Ctrl key down while you enter a Z, then hit the +"Enter" key) to get back to your Windows command prompt. You may also +find that you have a Start-menu entry such as "Start | Programs | +Python 2.2 | Python (command line)" that results in you seeing the +">>>" prompt in a new window. If so, the window will disappear after +you enter the terminator -- Windows runs a single "python" command in +the window, which terminates when you terminate the interpreter. +

+If the "python" command, instead of displaying the interpreter prompt ">>>", gives you a message like +

+    'python' is not recognized as an internal or external command,
+    operable program or batch file.
+

+or +

+    Bad command or filename
+

+then you need to make sure that your computer knows where to find the +Python interpreter. To do this you will have to modify a setting +called the PATH, which is a just list of directories where Windows +will look for programs. Rather than just enter the right command every +time you create a command window, you should arrange for Python's +installation directory to be added to the PATH of every command window +as it starts. If you installed Python fairly recently then the command +

+    dir C:\py*
+

+will probably tell you where it is installed. Alternatively, perhaps +you made a note. Otherwise you will be reduced to a search of your +whole disk ... break out the Windows explorer and use "Tools | Find" +or hit the "Search" button and look for "python.exe". Suppose you +discover that Python is installed in the C:\Python22 directory (the +default at the time of writing) then you should make sure that +entering the command +

+    c:\Python22\python
+

+starts up the interpreter as above (and don't forget you'll need a +"CTRL-Z" and an "Enter" to get out of it). Once you have verified the +directory, you need to add it to the start-up routines your computer +goes through. For older versions of Windows the easiest way to do +this is to edit the C:\AUTOEXEC.BAT file. You would want to add a line +like the following to AUTOEXEC.BAT: +

+    PATH C:\Python22;%PATH%
+

+For Windows NT, 2000 and (I assume) XP, you will need to add a string +such as +

+    ;C:\Python22
+

+to the current setting for the PATH environment variable, which you +will find in the properties window of "My Computer" under the +"Advanced" tab. Note that if you have sufficient privilege you might +get a choice of installing the settings either for the Current User or +for System. The latter is preferred if you want everybody to be able +to run Python on the machine. +

+If you aren't confident doing any of these manipulations yourself, ask +for help! At this stage you may or may not want to reboot your system +to make absolutely sure the new setting has "taken" (don't you love +the way Windows gives you these freqeuent coffee breaks). You probably +won't need to for Windows NT, XP or 2000. You can also avoid it in +earlier versions by editing the file C:\WINDOWS\COMMAND\CMDINIT.BAT +instead of AUTOEXEC.BAT. +

+You should now be able to start a new command window, enter +

+    python
+

+at the "C:>" (or whatever) prompt, and see the ">>>" prompt that +indicates the Python interpreter is reading interactive commands. +

+Let's suppose you have a program called "pytest.py" in directory +"C:\Steve\Projects\Python". A session to run that program might look +like this: +

+    C:\> cd \Steve\Projects\Python
+    C:\Steve\Projects\Python> python pytest.py
+

+Because you added a file name to the command to start the interpreter, +when it starts up it reads the Python script in the named file, +compiles it, executes it, and terminates (so you see another "C:\>" +prompt). You might also have entered +

+    C:\> python \Steve\Projects\Python\pytest.py
+

+if you hadn't wanted to change your current directory. +

+Under NT, 2000 and XP you may well find that the installation process +has also arranged that the command +

+    pytest.py
+

+(or, if the file isn't in the current directory) +

+    C:\Steve\Projects\Python\pytest.py
+

+will automatically recognize the ".py" extension and run the Python +interpreter on the named file. Using this feature is fine, but some +versions of Windows have bugs which mean that this form isn't exactly +equivalent to using the interpreter explicitly, so be careful. Easier +to remember, for now, that +

+    python C:\Steve\Projects\Python\pytest.py
+

+works pretty close to the same, and redirection will work (more) +reliably. +

+The important things to remember are: +

+1. Start Python from the Start Menu, or make sure the PATH is set +correctly so Windows can find the Python interpreter. +

+    python
+

+should give you a '>>>" prompt from the Python interpreter. Don't +forget the CTRL-Z and ENTER to terminate the interpreter (and, if you +started the window from the Start Menu, make the window disappear). +

+2. Once this works, you run programs with commands: +

+    python {program-file}
+

+3. When you know the commands to use you can build Windows shortcuts +to run the Python interpreter on any of your scripts, naming +particular working directories, and adding them to your menus, but +that's another lessFAQ. Take a look at +

+    python --help
+

+if your needs are complex. +

+4. Interactive mode (where you see the ">>>" prompt) is best used +not for running programs, which are better executed as in steps 2 +and 3, but for checking that individual statements and expressions do +what you think they will, and for developing code by experiment. +

+ +Edit this entry / +Log info + +/ Last changed on Tue Aug 20 16:19:53 2002 by +GvR +

+ +

+Python home / +Python FAQ Wizard 1.0.3 / +Feedback to GvR +

+ + --- python3.4-3.4.2~rc1.orig/debian/PVER-dbg.README.Debian.in +++ python3.4-3.4.2~rc1/debian/PVER-dbg.README.Debian.in @@ -0,0 +1,52 @@ +Contents of the @PVER@-dbg package +------------------------------------- + +For debugging python and extension modules, you may want to add the contents +of /usr/share/doc/@PVER@/gdbinit (found in the @PVER@-dev package) to your +~/.gdbinit file. + +@PVER@-dbg contains two sets of packages: + + - debugging symbols for the standard @PVER@ build. When this package + is installed, gdb will automatically load up the debugging symbols + from it when debugging @PVER@ or one of the included extension + modules. + + - a separate @PVER@-dbg binary, configured --with-pydebug, enabling the + additional debugging code to help debug memory management problems. + +For the latter, all extension modules have to be recompiled to +correctly load with an pydebug enabled build. + + +Debian and Ubuntu specific changes to the debug interpreter +----------------------------------------------------------- +The python2.4 and python2.5 packages in Ubuntu feisty are modified to +first look for extension modules under a different name. + + normal build: foo.so + debug build: foo_d.so foo.so + +This naming schema allows installation of the extension modules into +the same path (The naming is directly taken from the Windows builds +which already uses this naming scheme). + +See https://wiki.ubuntu.com/PyDbgBuilds for more information. + + +Using the python-dbg builds +--------------------------- + + * Call the python-dbg or the pythonX.Y-dbg binaries instead of the + python or pythonX.Y binaries. + + * Properties of the debug build are described in + /usr/share/doc/@PVER@/SpecialBuilds.txt.gz. + The debug interpreter is built with Py_DEBUG defined. + + * From SpecialBuilds.txt: This is what is generally meant by "a debug + build" of Python. Py_DEBUG implies LLTRACE, Py_REF_DEBUG, + Py_TRACE_REFS, and PYMALLOC_DEBUG (if WITH_PYMALLOC is enabled). + In addition, C assert()s are enabled (via the C way: by not defining + NDEBUG), and some routines do additional sanity checks inside + "#ifdef Py_DEBUG" blocks. --- python3.4-3.4.2~rc1.orig/debian/PVER-dbg.overrides.in +++ python3.4-3.4.2~rc1/debian/PVER-dbg.overrides.in @@ -0,0 +1,5 @@ +# just the gdb debug file +@PVER@-dbg binary: python-script-but-no-python-dep + +# pointless lintian ... +@PVER@-dbg binary: hardening-no-fortify-functions --- python3.4-3.4.2~rc1.orig/debian/PVER-dbg.postinst.in +++ python3.4-3.4.2~rc1/debian/PVER-dbg.postinst.in @@ -0,0 +1,36 @@ +#! /bin/sh + +set -e + +if [ "$1" = configure ]; then + files=$(dpkg -L lib@PVER@-dbg@HOST_QUAL@ | sed -n '/^\/usr\/lib\/@PVER@\/.*\.py$/p') + if [ -n "$files" ]; then + @PVER@ -E -S /usr/lib/@PVER@/py_compile.py $files + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config; then + @PVER@ -E -S -O /usr/lib/@PVER@/py_compile.py $files + fi + else + echo >&2 "@PVER@-dbg: can't get files for byte-compilation" + fi + + if [ -d /usr/include/@PVER@_d ] && [ ! -h /usr/include/@PVER@_d ]; then + if rmdir /usr/include/@PVER@_d 2> /dev/null; then + ln -sf @PVER@dmu /usr/include/@PVER@_d + else + echo >&2 "WARNING: non-empty directory on upgrade: /usr/include/@PVER@_d" + ls -l /usr/include/@PVER@_d + fi + fi + if [ -d /usr/lib/@PVER@/config_d ] && [ ! -h /usr/lib/@PVER@/config_d ]; then + if rmdir /usr/lib/@PVER@/config_d 2> /dev/null; then + ln -sf config-dmu /usr/lib/@PVER@/config_d + else + echo >&2 "WARNING: non-empty directory on upgrade: /usr/lib/@PVER@/config_d" + ls -l /usr/lib/@PVER@/config_d + fi + fi +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER-dbg.prerm.in +++ python3.4-3.4.2~rc1/debian/PVER-dbg.prerm.in @@ -0,0 +1,35 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars=$max echo \ + | while read files; do rm -f $files; done + if [ -d /usr/bin/__pycache__ ]; then + rmdir --ignore-fail-on-non-empty /usr/bin/__pycache__ + fi +} + +case "$1" in + remove) + remove_bytecode lib@PVER@-dbg@HOST_QUAL@ + ;; + upgrade) + remove_bytecode lib@PVER@-dbg@HOST_QUAL@ + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/PVER-dev.postinst.in +++ python3.4-3.4.2~rc1/debian/PVER-dev.postinst.in @@ -0,0 +1,26 @@ +#! /bin/sh + +set -e + +if [ "$1" = configure ]; then + if [ -d /usr/include/@PVER@ ] && [ ! -h /usr/include/@PVER@ ]; then + if rmdir /usr/include/@PVER@ 2> /dev/null; then + ln -sf @PVER@mu /usr/include/@PVER@ + else + echo >&2 "WARNING: non-empty directory on upgrade: /usr/include/@PVER@" + ls -l /usr/include/@PVER@ + fi + fi + if [ -d /usr/lib/@PVER@/config ] && [ ! -h /usr/lib/@PVER@/config ]; then + if rmdir /usr/lib/@PVER@/config 2> /dev/null; then + ln -sf config-@VER@mu /usr/lib/@PVER@/config + else + echo >&2 "WARNING: non-empty directory on upgrade: /usr/lib/@PVER@/config" + ls -l /usr/lib/@PVER@/config + fi + fi +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-api.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-api.in @@ -0,0 +1,13 @@ +Document: @PVER@-api +Title: Python/C API Reference Manual (v@VER@) +Author: Guido van Rossum +Abstract: This manual documents the API used by C (or C++) programmers who + want to write extension modules or embed Python. It is a + companion to *Extending and Embedding the Python Interpreter*, + which describes the general principles of extension writing but + does not document the API functions in detail. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/c-api/index.html +Files: /usr/share/doc/@PVER@/html/c-api/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-dist.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-dist.in @@ -0,0 +1,13 @@ +Document: @PVER@-dist +Title: Distributing Python Modules (v@VER@) +Author: Greg Ward +Abstract: This document describes the Python Distribution Utilities + (``Distutils'') from the module developer's point-of-view, describing + how to use the Distutils to make Python modules and extensions easily + available to a wider audience with very little overhead for + build/release/install mechanics. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/distutils/index.html +Files: /usr/share/doc/@PVER@/html/distutils/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-ext.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-ext.in @@ -0,0 +1,16 @@ +Document: @PVER@-ext +Title: Extending and Embedding the Python Interpreter (v@VER@) +Author: Guido van Rossum +Abstract: This document describes how to write modules in C or C++ to extend + the Python interpreter with new modules. Those modules can define + new functions but also new object types and their methods. The + document also describes how to embed the Python interpreter in + another application, for use as an extension language. Finally, + it shows how to compile and link extension modules so that they + can be loaded dynamically (at run time) into the interpreter, if + the underlying operating system supports this feature. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/extending/index.html +Files: /usr/share/doc/@PVER@/html/extending/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-inst.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-inst.in @@ -0,0 +1,12 @@ +Document: @PVER@-inst +Title: Installing Python Modules (v@VER@) +Author: Greg Ward +Abstract: This document describes the Python Distribution Utilities + (``Distutils'') from the end-user's point-of-view, describing how to + extend the capabilities of a standard Python installation by building + and installing third-party Python modules and extensions. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/install/index.html +Files: /usr/share/doc/@PVER@/html/install/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-lib.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-lib.in @@ -0,0 +1,15 @@ +Document: @PVER@-lib +Title: Python Library Reference (v@VER@) +Author: Guido van Rossum +Abstract: This library reference manual documents Python's standard library, + as well as many optional library modules (which may or may not be + available, depending on whether the underlying platform supports + them and on the configuration choices made at compile time). It + also documents the standard types of the language and its built-in + functions and exceptions, many of which are not or incompletely + documented in the Reference Manual. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/library/index.html +Files: /usr/share/doc/@PVER@/html/library/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-new.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-new.in @@ -0,0 +1,10 @@ +Document: @PVER@-new +Title: What's new in Python @VER@ +Author: A.M. Kuchling +Abstract: This documents lists new features and changes worth mentioning + in Python @VER@. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/whatsnew/@VER@.html +Files: /usr/share/doc/@PVER@/html/whatsnew/@VER@.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-ref.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-ref.in @@ -0,0 +1,18 @@ +Document: @PVER@-ref +Title: Python Reference Manual (v@VER@) +Author: Guido van Rossum +Abstract: This reference manual describes the syntax and "core semantics" of + the language. It is terse, but attempts to be exact and complete. + The semantics of non-essential built-in object types and of the + built-in functions and modules are described in the *Python + Library Reference*. For an informal introduction to the language, + see the *Python Tutorial*. For C or C++ programmers, two + additional manuals exist: *Extending and Embedding the Python + Interpreter* describes the high-level picture of how to write a + Python extension module, and the *Python/C API Reference Manual* + describes the interfaces available to C/C++ programmers in detail. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/reference/index.html +Files: /usr/share/doc/@PVER@/html/reference/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.doc-base.PVER-tut.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.doc-base.PVER-tut.in @@ -0,0 +1,13 @@ +Document: @PVER@-tut +Title: Python Tutorial (v@VER@) +Author: Guido van Rossum, Fred L. Drake, Jr., editor +Abstract: This tutorial introduces the reader informally to the basic + concepts and features of the Python language and system. It helps + to have a Python interpreter handy for hands-on experience, but + all examples are self-contained, so the tutorial can be read + off-line as well. +Section: Programming/Python + +Format: HTML +Index: /usr/share/doc/@PVER@/html/tutorial/index.html +Files: /usr/share/doc/@PVER@/html/tutorial/*.html --- python3.4-3.4.2~rc1.orig/debian/PVER-doc.overrides.in +++ python3.4-3.4.2~rc1/debian/PVER-doc.overrides.in @@ -0,0 +1,2 @@ +# this is referenced by the html docs +@PVER@-doc binary: extra-license-file --- python3.4-3.4.2~rc1.orig/debian/PVER-examples.overrides.in +++ python3.4-3.4.2~rc1/debian/PVER-examples.overrides.in @@ -0,0 +1,2 @@ +# don't care about permissions of the example files +@PVER@-examples binary: executable-not-elf-or-script --- python3.4-3.4.2~rc1.orig/debian/PVER-minimal.README.Debian.in +++ python3.4-3.4.2~rc1/debian/PVER-minimal.README.Debian.in @@ -0,0 +1,169 @@ +Contents of the @PVER@-minimal package +----------------------------------------- + +@PVER@-minimal consists of a minimum set of modules which may be needed +for python scripts used during the boot process. If other packages +are needed in these scripts, don't work around the missing module, but +file a bug report against this package. The modules in this package +are: + + __builtin__ builtin + __future__ module + _ast extension + _bisect extension + _bootlocale module + _bytesio builtin + _codecs builtin + _collections extension + _collections_abc module + _compat_pickle module + _datetime extension + _elementtree extension + _fileio builtin + _functools extension + _hashlib extensionx + _heapq extension + _imp builtin + _io builtin + _locale extension + _md5 extension + _opcode extension + _operator extension + _pickle extension + _posixsubprocess extension + _random extension + _sha1 extension + _sha3 extension + _sha256 extension + _sha512 extension + _sitebuiltins module + _socket extension + _sre builtin + _ssl extensionx + _stat extension + _stringio extension + _struct extension + _string builtin + _stringio builtin + _symtable builtin + _sysconfigdata module + _thread builtin + _threading_local module + _types builtin + _weakref builtin + _weakrefset module + _warnings builtin + configparser module + abc module + argparse module + array extension + ast module + atexit extension + base64 module + binascii extension + bisect module + builtins builtin + codecs module + collections package + compileall module + contextlib module + copy module + copyreg module + dis module + encodings package + enum module + errno builtin + exceptions builtin + fcntl extension + fnmatch module + functools module + gc builtin + genericpath module + getopt module + glob module + grp extension + hashlib module + heapq module + imp module + importlib package + inspect module + io module + itertools extension + keyword module + linecache module + locale module + logging package + marshal builtin + math extension + opcode module + operator module + optparse module + os module + pickle module + pkgutil module + platform module + posix builtin + posixpath module + pwd builtin + pyexpat extension + py_compile module + random module + re module + reprlib module + runpy module + select extension + selectors module + signal builtin + socket module + spwd extension + sre_compile module + sre_constants module + sre_parse module + ssl module + stat module + string module + struct module + subprocess module + sys builtin + sysconfig module + syslog extension + tempfile module + textwrap module + threading module + time extension + token module + tokenize module + traceback module + types module + unicodedata extension + warnings module + weakref module + zipimport extension + zlib extension + +Included are as well the codecs and stringprep modules, and the encodings +modules for all encodings except the multibyte encodings and the bz2 codec. + +The following modules are excluded, their import is guarded from the +importing module: + + Used in Excluded + ------------ ------------------------------------ + io _dummy_thread + os nt ntpath os2 os2emxpath mac macpath + riscos riscospath riscosenviron + optparse gettext + pickle doctest + subprocess threading_dummy + +This list was derived by looking at the modules in the perl-base package, +then adding python specific "core modules". + +TODO's +------ + +- time.strptime cannot be used. The required _strptime module is not + included in the -minimal package yet. _strptime, locale, _locale and + calendar have to be added. + +- modules used very often in the testsuite: copy, cPickle, operator. --- python3.4-3.4.2~rc1.orig/debian/PVER-minimal.postinst.in +++ python3.4-3.4.2~rc1/debian/PVER-minimal.postinst.in @@ -0,0 +1,82 @@ +#! /bin/sh + +set -e + +if [ ! -f /etc/@PVER@/sitecustomize.py ]; then + cat <<-EOF + # Empty sitecustomize.py to avoid a dangling symlink +EOF +fi + +case "$1" in + configure) + # Create empty directories in /usr/local + if [ ! -e /usr/local/lib/@PVER@ ]; then + mkdir -p /usr/local/lib/@PVER@ 2> /dev/null || true + chmod 2775 /usr/local/lib/@PVER@ 2> /dev/null || true + chown root:staff /usr/local/lib/@PVER@ 2> /dev/null || true + fi + localsite=/usr/local/lib/@PVER@/dist-packages + if [ ! -e $localsite ]; then + mkdir -p $localsite 2> /dev/null || true + chmod 2775 $localsite 2> /dev/null || true + chown root:staff $localsite 2> /dev/null || true + fi + + if which update-binfmts >/dev/null; then + update-binfmts --import @PVER@ + fi + + ;; +esac + +if [ "$1" = configure ]; then + + # only available before removal of the packaging package + rm -f /etc/@PVER@/sysconfig.cfg + + if ls -L /usr/lib/@PVER@/sitecustomize.py >/dev/null 2>&1; then + filt='cat' + else + filt='fgrep -v sitecustomize.py' + fi + files=$(dpkg -L lib@PVER@-minimal@HOST_QUAL@ \ + | sed -n '/^\/usr\/lib\/@PVER@\/.*\.py$/p' | $filt) + if [ -n "$files" ]; then + @PVER@ -E -S /usr/lib/@PVER@/py_compile.py $files + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config; then + @PVER@ -E -S -O /usr/lib/@PVER@/py_compile.py $files + fi + else + echo >&2 "@PVER@-minimal: can't get files for byte-compilation" + fi + bc=no + #if [ -z "$2" ] || dpkg --compare-versions "$2" lt 2.5-3 \ + # || [ -f /var/lib/python/@PVER@_installed ]; then + # bc=yes + #fi + if ! grep -sq '^supported-versions[^#]*@PVER@' /usr/share/python/debian_defaults + then + # FIXME: byte compile anyway? + bc=no + fi + if [ "$bc" = yes ]; then + # new installation or installation of first version with hook support + if [ "$DEBIAN_FRONTEND" != noninteractive ]; then + echo "Linking and byte-compiling packages for runtime @PVER@..." + fi + version=$(dpkg -s @PVER@-minimal | awk '/^Version:/ {print $2}') + for hook in /usr/share/python3/runtime.d/*.rtinstall; do + [ -x $hook ] || continue + $hook rtinstall @PVER@ "$2" "$version" + done + if [ -f /var/lib/python/@PVER@_installed ]; then + rm -f /var/lib/python/@PVER@_installed + rmdir --ignore-fail-on-non-empty /var/lib/python 2>/dev/null + fi + fi +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER-minimal.postrm.in +++ python3.4-3.4.2~rc1/debian/PVER-minimal.postrm.in @@ -0,0 +1,13 @@ +#! /bin/sh + +set -e + +if [ "$1" = "remove" ]; then + + if [ -f /var/lib/python/@PVER@_installed ]; then + rm -f /var/lib/python/@PVER@_installed + rmdir --ignore-fail-on-non-empty /var/lib/python 2>/dev/null + fi + + rmdir --parents /usr/local/lib/@PVER@ 2>/dev/null || true +fi --- python3.4-3.4.2~rc1.orig/debian/PVER-minimal.preinst.in +++ python3.4-3.4.2~rc1/debian/PVER-minimal.preinst.in @@ -0,0 +1,26 @@ +#!/bin/sh + +set -e + +case "$1" in + install) + # remember newly installed runtime + mkdir -p /var/lib/python + touch /var/lib/python/@PVER@_installed + ;; + upgrade) + : + ;; + + abort-upgrade) + ;; + + *) + echo "preinst called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER-minimal.prerm.in +++ python3.4-3.4.2~rc1/debian/PVER-minimal.prerm.in @@ -0,0 +1,36 @@ +#! /bin/sh + +set -e + +case "$1" in + remove) + if [ "$DEBIAN_FRONTEND" != noninteractive ]; then + echo "Unlinking and removing bytecode for runtime @PVER@" + fi + for hook in /usr/share/python3/runtime.d/*.rtremove; do + [ -x $hook ] || continue + $hook rtremove @PVER@ || continue + done + + if which update-binfmts >/dev/null; then + update-binfmts --package @PVER@ --remove @PVER@ /usr/bin/@PVER@ + fi + + localsite=/usr/local/lib/@PVER@/dist-packages + [ -d $localsite ] && rmdir $localsite 2>/dev/null || true + [ -d $(dirname $localsite) ] \ + && rmdir $(dirname $localsite) 2>/dev/null || true + ;; + upgrade) + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/PVER-venv.postinst.in +++ python3.4-3.4.2~rc1/debian/PVER-venv.postinst.in @@ -0,0 +1,20 @@ +#! /bin/sh + +set -e + +case "$1" in + configure) + files=$(dpkg -L @PVER@-venv | sed -n '/^\/usr\/lib\/@PVER@\/.*\.py$/p') + if [ -n "$files" ]; then + @PVER@ -E -S /usr/lib/@PVER@/py_compile.py $files + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config; then + @PVER@ -E -S -O /usr/lib/@PVER@/py_compile.py $files + fi + else + echo >&2 "@PVER@: can't get files for byte-compilation" + fi +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER-venv.prerm.in +++ python3.4-3.4.2~rc1/debian/PVER-venv.prerm.in @@ -0,0 +1,35 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars="$max" echo \ + | while read files; do rm -f $files; done + + find /usr/lib/@PVER@/ensurepip \ + -name __pycache__ -type d -empty -print \ + | xargs -r rm -rf +} + +case "$1" in + remove) + remove_bytecode @PVER@-venv + ;; + upgrade) + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/PVER.desktop.in +++ python3.4-3.4.2~rc1/debian/PVER.desktop.in @@ -0,0 +1,10 @@ +[Desktop Entry] +Name=Python (v@VER@) +Comment=Python Interpreter (v@VER@) +Exec=/usr/bin/@PVER@ +Icon=/usr/share/pixmaps/@PVER@.xpm +Terminal=true +Type=Application +Categories=Development; +StartupNotify=true +NoDisplay=true --- python3.4-3.4.2~rc1.orig/debian/PVER.menu.in +++ python3.4-3.4.2~rc1/debian/PVER.menu.in @@ -0,0 +1,4 @@ +?package(@PVER@):needs="text" section="Applications/Programming"\ + title="Python (v@VER@)"\ + icon="/usr/share/pixmaps/@PVER@.xpm"\ + command="/usr/bin/python@VER@" --- python3.4-3.4.2~rc1.orig/debian/PVER.overrides.in +++ python3.4-3.4.2~rc1/debian/PVER.overrides.in @@ -0,0 +1,8 @@ +# yes, we have to +@PVER@ binary: depends-on-python-minimal + +@PVER@ binary: desktop-command-not-in-package +@PVER@ binary: menu-command-not-in-package + +# no, not useless +@PVER@ binary: manpage-has-useless-whatis-entry --- python3.4-3.4.2~rc1.orig/debian/PVER.postinst.in +++ python3.4-3.4.2~rc1/debian/PVER.postinst.in @@ -0,0 +1,20 @@ +#! /bin/sh + +set -e + +case "$1" in + configure) + files=$(dpkg -L lib@PVER@-stdlib@HOST_QUAL@ | sed -n '/^\/usr\/lib\/@PVER@\/.*\.py$/p') + if [ -n "$files" ]; then + @PVER@ -E -S /usr/lib/@PVER@/py_compile.py $files + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config; then + @PVER@ -E -S -O /usr/lib/@PVER@/py_compile.py $files + fi + else + echo >&2 "@PVER@: can't get files for byte-compilation" + fi +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/PVER.prerm.in +++ python3.4-3.4.2~rc1/debian/PVER.prerm.in @@ -0,0 +1,31 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars="$max" echo \ + | while read files; do rm -f $files; done + find /usr/lib/python3 /usr/lib/@PVER@ -name dist-packages -prune -o -name __pycache__ -empty -print \ + | xargs -r rm -rf +} + +case "$1" in + remove|upgrade) + remove_bytecode lib@PVER@-stdlib@HOST_QUAL@ + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/README.Debian.in +++ python3.4-3.4.2~rc1/debian/README.Debian.in @@ -0,0 +1,8 @@ +The documentation for this package is in /usr/share/doc/@PVER@/. + +A draft of the "Debian Python Policy" can be found in + + /usr/share/doc/python + +Sometime it will be moved to /usr/share/doc/debian-policy in the +debian-policy package. --- python3.4-3.4.2~rc1.orig/debian/README.PVER.in +++ python3.4-3.4.2~rc1/debian/README.PVER.in @@ -0,0 +1,95 @@ + + Python @VER@ for Debian + --------------------- + +This is Python @VER@ packaged for Debian. + +This document contains information specific to the Debian packages of +Python @VER@. + + + + [TODO: This document is not yet up-to-date with the packages.] + +Currently, it features those two main topics: + + 1. Release notes for the Debian packages: + 2. Notes for developers using the Debian Python packages: + +Release notes and documentation from the upstream package are installed +in /usr/share/doc/@PVER@/. + +There's a mailing list for discussion of issues related to Python on Debian +systems: debian-python@lists.debian.org. The list is not intended for +general Python problems, but as a forum for maintainers of Python-related +packages and interested third parties. + + + +1. Release notes for the Debian packages: + + +Results of the regression test: +------------------------------ + +The package does successfully run the regression tests for all included +modules. Seven packages are skipped since they are platform-dependent and +can't be used with Linux. + + +2. Notes for developers using the Debian python packages: + +See the draft of the Debian Python policy in /usr/share/doc/python. + +distutils can be found in the @PVER@-dev package. Development files +like the python library or Makefiles can be found in the @PVER@-dev +package in /usr/lib/@PVER@/config. Therefore, if you need to install +a pure python extension, you only need @PVER@. On the other hand, to +install a C extension, you need @PVER@-dev. + +a) Locally installed Python add-ons + + /usr/local/lib/@PVER@/site-packages/ + /usr/local/lib/site-python/ (version-independent modules) + +b) Python add-ons packaged for Debian + + /usr/lib/@PVER@/site-packages/ + /usr/lib/site-python/ (version-independent modules) + +Note that no package must install files directly into /usr/lib/@PVER@/ +or /usr/local/lib/@PVER@/. Only the site-packages directory is allowed +for third-party extensions. + +Use of the new `package' scheme is strongly encouraged. The `ni' interface +is obsolete in python 1.5. + +Header files for extensions go into /usr/include/@PVER@/. + + +Installing extensions for local use only: +---------------------------------------- + +Consider using distutils ... + +Most extensions use Python's Makefile.pre.in. Note that Makefile.pre.in +by default will install files into /usr/lib/, not into /usr/local/lib/, +which is not allowed for local extensions. You'll have to change the +Makefile accordingly. Most times, "make prefix=/usr/local install" will +work. + + +Packaging python extensions for Debian: +-------------------------------------- + +Maintainers of Python extension packages should read + + /usr/share/doc/python/python-policy.txt.gz + + + + + 03/09/98 + Gregor Hoffleit + +Last change: 2001-12-14 --- python3.4-3.4.2~rc1.orig/debian/README.Tk +++ python3.4-3.4.2~rc1/debian/README.Tk @@ -0,0 +1,8 @@ +Tkinter documentation can be found at + + http://www.pythonware.com/library/index.htm + +more specific: + + http://www.pythonware.com/library/tkinter/introduction/index.htm + http://www.pythonware.com/library/tkinter/an-introduction-to-tkinter.pdf --- python3.4-3.4.2~rc1.orig/debian/README.dbm +++ python3.4-3.4.2~rc1/debian/README.dbm @@ -0,0 +1,72 @@ + + Python and dbm modules on Debian + -------------------------------- + +This file documents the configuration of the dbm modules for Debian. It +gives hints at the preferred use of the dbm modules. + + +The preferred way to access dbm databases in Python is the anydbm module. +dbm databases behave like mappings (dictionaries). + +Since there exist several dbm database formats, we choose the following +layout for Python on Debian: + + * creating a new database with anydbm will create a Berkeley DB 2.X Hash + database file. This is the standard format used by libdb starting + with glibc 2.1. + + * opening an existing database with anydbm will try to guess the format + of the file (using whichdb) and then load it using one of the bsddb, + bsddb1, gdbm or dbm (only if the python-gdbm package is installed) + or dumbdbm modules. + + * The modules use the following database formats: + + - bsddb: Berkeley DB 2.X Hash (as in libc6 >=2.1 or libdb2) + - bsddb1: Berkeley DB 1.85 Hash (as in libc6 >=2.1 or libdb2) + - gdbm: GNU dbm 1.x or ndbm + - dbm: " (nearly the same as the gdbm module for us) + - dumbdbm: a hand-crafted format only used in this module + + That means that all usual formats should be readable with anydbm. + + * If you want to create a database in a format different from DB 2.X, + you can still directly use the specified module. + + * I.e. bsddb is the preferred module, and DB 2.X is the preferred format. + + * Note that the db1hash and bsddb1 modules are Debian specific. anydbm + and whichdb have been modified to support DB 2.X Hash files (see + below for details). + + + +For experts only: +---------------- + +Although bsddb employs the new DB 2.X format and uses the new Sleepycat +DB 2 library as included with glibc >= 2.1, it's still using the old +DB 1.85 API (which is still supported by DB 2). + +A more recent version 1.1 of the BSD DB module (available from +http://starship.skyport.net/robind/python/) directly uses the DB 2.X API. +It has a richer set of features. + + +On a glibc 2.1 system, bsddb is linked with -ldb, bsddb1 is linked with +-ldb1 and gdbm as well as dbm are linked with -lgdbm. + +On a glibc 2.0 system (e.g. potato for m68k or slink), bsddb will be +linked with -ldb2 while bsddb1 will be linked with -ldb (therefore +python-base here depends on libdb2). + + +db1hash and bsddb1 nearly completely identical to dbhash and bsddb. The +only difference is that bsddb is linked with the real DB 2 library, while +bsddb1 is linked with an library which provides compatibility with legacy +DB 1.85 databases. + + + July 16, 1999 + Gregor Hoffleit --- python3.4-3.4.2~rc1.orig/debian/README.idle-PVER.in +++ python3.4-3.4.2~rc1/debian/README.idle-PVER.in @@ -0,0 +1,14 @@ + + The Python IDLE package for Debian + ---------------------------------- + +This package contains Python @VER@'s Integrated DeveLopment Environment, IDLE. + +IDLE is included in the Python @VER@ upstream distribution (Tools/idle) and +depends on Tkinter (available as @PVER@-tk package). + +I have written a simple man page. + + + 06/16/1999 + Gregor Hoffleit --- python3.4-3.4.2~rc1.orig/debian/README.maintainers.in +++ python3.4-3.4.2~rc1/debian/README.maintainers.in @@ -0,0 +1,88 @@ + +Hints for maintainers of Debian packages of Python extensions +------------------------------------------------------------- + +Most of the content of this README can be found in the Debian Python policy. +See /usr/share/doc/python/python-policy.txt.gz. + +Documentation Tools +------------------- + +If your package ships documentation produced in the Python +documentation format, you can generate it at build-time by +build-depending on @PVER@-dev, and you will find the +templates, tools and scripts in /usr/lib/@PVER@/doc/tools -- +adjust your build scripts accordingly. + + +Makefile.pre.in issues +---------------------- + +Python comes with a `universal Unix Makefile for Python extensions' in +/usr/lib/@PVER@/config/Makefile.pre.in (with Debian, this is included +in the python-dev package), which is used by most Python extensions. + +In general, packages using the Makefile.pre.in approach can be packaged +simply by running dh_make or by using one of debhelper's rules' templates +(see /usr/doc/debhelper/examples/). Makefile.pre.in works fine with e.g. +"make prefix=debian/tmp/usr install". + +One glitch: You may be running into the problem that Makefile.pre.in +doesn't try to create all the directories when they don't exist. Therefore, +you may have to create them manually before "make install". In most cases, +the following should work: + + ... + dh_installdirs /usr/lib/@PVER@ + $(MAKE) prefix=debian/tmp/usr install + ... + + +Byte-compilation +---------------- + +For speed reasons, Python internally compiles source files into a byte-code. +To speed up subsequent imports, it tries to save the byte-code along with +the source with an extension .pyc (resp. pyo). This will fail if the +libraries are installed in a non-writable directory, which may be the +case for /usr/lib/@PVER@/. + +Not that .pyc and .pyo files should not be relocated, since for debugging +purposes the path of the source for is hard-coded into them. + +To precompile files in batches after installation, Python has a script +compileall.py, which compiles all files in a given directory tree. The +Debian version of compileall has been enhanced to support incremental +compilation and to feature a ddir (destination dir) option. ddir is +used to compile files in debian/usr/lib/python/ when they will be +installed into /usr/lib/python/. + + +Currently, there are two ways to use compileall for Debian packages. The +first has a speed penalty, the second has a space penalty in the package. + +1.) Compiling and removing .pyc files in postinst/prerm: + + Use dh_python(1) from the debhelper packages to add commands to byte- + compile on installation and to remove the byte-compiled files on removal. + Your package has to build-depend on: debhelper (>= 4.1.67), python. + + In /usr/share/doc/@PVER@, you'll find sample.postinst and sample.prerm. + If you set the directory where the .py files are installed, these + scripts will install and remove the .pyc and .pyo files for your + package after unpacking resp. before removing the package. + +2.) Compiling the .pyc files `out of place' during installation: + + As of 1.5.1, compileall.py allows you to specify a faked installation + directory using the "-d destdir" option, so that you can precompile + the files in their temporary directory + (e.g. debian/tmp/usr/lib/python2.1/site-packages/PACKAGE). + + + + 11/02/98 + Gregor Hoffleit + + +Last modified: 2007-10-14 --- python3.4-3.4.2~rc1.orig/debian/README.python +++ python3.4-3.4.2~rc1/debian/README.python @@ -0,0 +1,153 @@ + + Python 2.x for Debian + --------------------- + +This is Python 2.x packaged for Debian. + +This document contains information specific to the Debian packages of +Python 2.x. + + + + [TODO: This document is not yet up-to-date with the packages.] + + + + + + +Currently, it features those two main topics: + + 1. Release notes for the Debian packages: + 2. Notes for developers using the Debian Python packages: + +Release notes and documentation from the upstream package are installed +in /usr/share/doc/python/. + +Up-to-date information regarding Python on Debian systems is also +available as http://www.debian.org/~flight/python/. + +There's a mailing list for discussion of issues related to Python on Debian +systems: debian-python@lists.debian.org. The list is not intended for +general Python problems, but as a forum for maintainers of Python-related +packages and interested third parties. + + + +1. Release notes for the Debian packages: + + +Results of the regression test: +------------------------------ + +The package does successfully run the regression tests for all included +modules. Seven packages are skipped since they are platform-dependent and +can't be used with Linux. + + +Noteworthy changes since the 1.4 packages: +----------------------------------------- + +- Threading support enabled. +- Tkinter for Tcl/Tk 8.x. +- New package python-zlib. +- The dbmmodule was dropped. Use bsddb instead. gdbmmodule is provided + for compatibility's sake. +- python-elisp adheres to the new emacs add-on policy; it now depends + on emacsen. python-elisp probably won't work correctly with emacs19. + Refer to /usr/doc/python-elisp/ for more information. +- Remember that 1.5 has dropped the `ni' interface in favor of a generic + `packages' concept. +- Python 1.5 regression test as additional package python-regrtest. You + don't need to install this package unless you don't trust the + maintainer ;-). +- once again, modified upstream's compileall.py and py_compile.py. + Now they support compilation of optimized byte-code (.pyo) for use + with "python -O", removal of .pyc and .pyo files where the .py source + files are missing (-d) and finally the fake of a installation directory + when .py files have to be compiled out of place for later installation + in a different directory (-i destdir, used in ./debian/rules). +- The Debian packages for python 1.4 do call + /usr/lib/python1.4/compileall.py in their postrm script. Therefore + I had to provide a link from /usr/lib/python1.5/compileall.py, otherwise + the old packages won't be removed completely. THIS IS A SILLY HACK! + + + +2. Notes for developers using the Debian python packages: + + +Embedding python: +---------------- + +The files for embedding python resp. extending the python interpreter +are included in the python-dev package. With the configuration in the +Debian GNU/Linux packages of python 1.5, you will want to use something +like + + -I/usr/include/python1.5 (e.g. for config.h) + -L/usr/lib/python1.5/config -lpython1.5 (... -lpthread) + (also for Makefile.pre.in, Setup etc.) + +Makefile.pre.in automatically gets that right. Note that unlike 1.4, +python 1.5 has only one library, libpython1.5.a. + +Currently, there's no shared version of libpython. Future version of +the Debian python packages will support this. + + +Python extension packages: +------------------------- + +According to www.python.org/doc/essays/packages.html, extension packages +should only install into /usr/lib/python1.5/site-packages/ (resp. +/usr/lib/site-python/ for packages that are definitely version independent). +No extension package should install files directly into /usr/lib/python1.5/. + +But according to the FSSTND, only Debian packages are allowed to use +/usr/lib/python1.5/. Therefore Debian Python additionally by default +searches a second hierarchy in /usr/local/lib/. These directories take +precedence over their equivalents in /usr/lib/. + +a) Locally installed Python add-ons + + /usr/local/lib/python1.5/site-packages/ + /usr/local/lib/site-python/ (version-independent modules) + +b) Python add-ons packaged for Debian + + /usr/lib/python1.5/site-packages/ + /usr/lib/site-python/ (version-independent modules) + +Note that no package must install files directly into /usr/lib/python1.5/ +or /usr/local/lib/python1.5/. Only the site-packages directory is allowed +for third-party extensions. + +Use of the new `package' scheme is strongly encouraged. The `ni' interface +is obsolete in python 1.5. + +Header files for extensions go into /usr/include/python1.5/. + + +Installing extensions for local use only: +---------------------------------------- + +Most extensions use Python's Makefile.pre.in. Note that Makefile.pre.in +by default will install files into /usr/lib/, not into /usr/local/lib/, +which is not allowed for local extensions. You'll have to change the +Makefile accordingly. Most times, "make prefix=/usr/local install" will +work. + + +Packaging python extensions for Debian: +-------------------------------------- + +Maintainers of Python extension packages should read README.maintainers. + + + + + 03/09/98 + Gregor Hoffleit + +Last change: 07/16/1999 --- python3.4-3.4.2~rc1.orig/debian/README.source +++ python3.4-3.4.2~rc1/debian/README.source @@ -0,0 +1,7 @@ +The source tarball is lacking the files Lib/profile.py and Lib/pstats.py, +which Debian considers to have a license non-suitable for main (the use +of these modules limited to python). + +The package uses quilt to apply / unapply patches. +See /usr/share/doc/quilt/README.source. The series file is generated +during the build. --- python3.4-3.4.2~rc1.orig/debian/README.venv +++ python3.4-3.4.2~rc1/debian/README.venv @@ -0,0 +1,230 @@ +========================================= + pyvenv support in Python 3.4 and beyond +========================================= + +In Python 3.3, built-in support for virtual environments (venvs) was added via +the `pyvenv`_ command. For building venvs using Python 3, this is +functionally equivalent to the standalone `virtualenv`_ tool, except that +before Python 3.4, the pyvenv created venv didn't include pip and setuptools. + +In Python 3.4, this was made even more convenient by the `automatic +inclusion`_ of the `pip`_ command into the venv so that third party libraries +can be easily installed from the Python Package Index (PyPI_). The stdlib +module `ensurepip`_ is run when the `pyvenv-3.4` command is run to create the +venv. + +This poses a problem for Debian. ensurepip comes bundled with two third party +libraries, setuptools and pip itself, as these are requirements for pip to +function properly in the venv. These are bundled in the ensurepip module of +the upstream Python 3.4 tarball as `universal wheels`_, essentially a zip of +the source code and a new ``dist-info`` metadata directory. Upstream pip +itself comes bundled with a half dozen or so of *its* dependencies, except +that these are "vendorized", meaning their unpacked source code lives within +the pip module, under a submodule from which pip imports them rather than the +top-level package namespace. + +To make matters worse, one of pip's vendorized dependencies, the `requests`_ +module, *also* vendorizes a bunch of its own dependencies. This stack of +vendorized and bundled third party libraries fundamentally violates the DFSG +and Debian policy against including code not built from source available +within Debian, and for including embedded "convenience" copies of code in +other packages. + +It's worth noting that the virtualenv package actually suffers from the same +conflict, but its current solution in Debian is `incomplete`_. + + +Solving the conflict +==================== + +This conflict between Debian policy and upstream Python convenience must be +resolved, because pyvenv is the recommended way of creating venvs in Python 3, +and because at some point, the standalone virtualenv tool will be rewritten as +a thin layer above pyvenv. Obviously, we want to provide the best Python +virtual environment experience to our developers, adherent to Debian policy. + +The approach we've taken is layered and nuanced, so I'll provide a significant +amount of detail to explain both what we do and why. + +The first thing to notice is how upstream ensurepip works to have its pip and +setuptools dependencies available, both at venv creation time and when +``/bin/pip`` is run. When pyvenv-3.4 runs, it ends up calling the +following Python command:: + + /bin/python -Im ensurepip --upgrade + +This runs the ensurepip's ``__main__.py`` module using the venv's Python in +isolation mode, with a switch to upgrade the setuptools and pip dependencies +(if for example, they've been updated in a new micro version of Python). + +Internally, ensurepip bootstraps itself by byte-copying its embedded wheels +into a temporary directory, putting those copied wheels on ``sys.path``, and +then calling into pip as a library. Because wheels are just elaborate zips, +Python can execute (pure-Python) code directly from them, if they are on +``sys.path`` of course. Once ensurepip has set up its execution environment, +it calls into pip to install both pip and setuptools into the newly created +venv. If you poke inside the venv after successful creation, you'll see +unpacked pip and setuptools directories in the venv's ``site-packages` +directory. + +The important thing to note here is that ensurepip is *already* able to import +from and install wheels, and because wheels are self-contained single files +(of zipped content), it makes manipulating them quite easy. In order to +minimize the delta from upstream (and to eventually work with upstream to +eliminate this delta), it seems optimal that Debian's solution should also be +based on wheels, and re-use as much of the existing machinery as possible. + +The difference for Debian though is that we don't want to use the embedded pip +and setuptools wheels from upstream Python's ensurepip; we want to use wheels +created from the pip and setuptools *Debian* packages. This would solve the +problem of distributing binary packages not built from source in Debian. + +Thus, we modify the python-pip and python-setuptools packages to include new +binary packages ``python-pip-whl`` and ``python-setuptools-whl` which contain +*only* the relevant universal wheels. Those packages ``debian/rules`` files +gain an extra command:: + + python3 setup.py bdist_wheel --universal -d + +The ``bdist_wheel`` command is provided by the `wheel`_ package, which as of +this writing is newly available in Jessie. + +Note that the name of the binary packages, and other details of when and how +wheels may be used in Debian, is described in `Debian Python Policy`_ 0.9.6 or +newer. + +The universal wheels (i.e. pure-Python code compatible with both Python 2 and +Python 3) are built for pip and setuptools and installed into +``/usr/share/python-wheels`` when the python-{pip,setuptols}-whl packages are +installed. These are not needed for normal, usual, and typical operation of +Python, so none of these are installed by default. + +However, this isn't enough, because since the pip and setuptools wheels are +built from the *patched* and de-vendorized versions of the code in Debian, the +wheels will not contain their own recursive dependencies. That's a good thing +for Debian policy compliance, but does add complications to the stack of hack. + +Using the same approach as for pip and setuptools, we *also* wheelify their +dependencies, recursively. As of this writing, the list of packages needing +to be wheelified are (by Debian source package name): + + * chardet + * distlib + * html5lib + * python-colorama + * python-pip + * python-setuptools + * python-urllib3 + * requests + * six + +Most of these are DPMT maintained. six, distlib, and colorama are not team +maintained, so coordination with those maintainers is required. Also note +that the `bdist_wheel` command is a setuptools extension, so since some of +those projects use ``distutils.core.setup()`` by default, they must be patched +to use ``setuptools.setup()`` instead. This isn't a problem because there's +no functional difference relevant to those packages; they likely use +distutils.core to avoid a third party dependency on setuptools. + +Each of these Debian source packages grow an additional binary package, just +like pip and setuptools, e.g. python-chardet-whl which contains the universal +wheel for that package built from patched Debian source. As above, when +installed, these binary packages drop their .whl files into the +``/usr/share/python-wheels`` directory. + +Now comes the fun part. + +In the python3.4 source package, we add a new binary package called +python3.4-venv. This will only contain the ``/usr/bin/pyvenv-3.4`` +executable, and its associated manpage. It also includes all the run-time +dependencies to make pyvenv work *including the wheel packages described +above*. + +(Technically speaking, you should substitute "Python 3.4 or later" for all +these discussions, and e.g. pyvenv-3.x for all versions subsequent to 3.4.) + +Python's ensurepip module has been modified in the following ways (see +``debian/patches/ensurepip.diff``): + + * When ensurepip is run outside of a venv as root, it raises an exception. + This use case is only to be supported by the separate python{,3}-pip + packages. + + * When ensurepip is run inside of a venv, it copies all dependent wheels from + ``/usr/share/python-wheels``. This includes the direct dependencies pip + and setuptools, as well as the recursive dependencies listed above. The + rest of the ensurepip machinery is unchanged: the wheels are still copied + into a temporary directory and placed on ``sys.path``, however only the + direct dependencies (i.e. pip and setuptools) are *installed* into the + venv's ``site-packages`` directory. The indirect dependencies are copied + to ``/lib/python-wheels`` since they'll be needed by the venv's pip + executable. + +Why do we do this latter rather than also installing the recursive +dependencies into the venv's ``site-packages``? It's because pip requires a +very specific set of dependencies and we don't want pip to break when the user +upgrades or downgrades one of those packages, which is perfectly valid in a +venv. It's exactly the same reason why pip vendorizes those libraries in the +first place; it's just that we're doing it in a more principled way (from the +point of view of the Debian distribution). + +The final piece of the puzzle is that Debian's pip will, when run inside of a +venv, introspect ``/lib/python-wheels`` and put every .whl file it sees +there *at the front of its sys.path*. Again, this is so that when pip runs, +it will find the versions of packages known to be good first, rather than any +other versions in the venv's ``site-packages``. + +As an example of the bad things that can happen if you don't do this, try +installing nose2_ into the venv, followed by genshi_. nose2 has a hard +requirement on a version of six that is older than the one used by pip +(indirectly). This older version of six is compatible with genshi, but *not* +with pip, so once nose2 is installed, if pip didn't load its version of six +from the private wheel, the installation attempt of genshi would traceback. +As it is, with the wheels early enough on ``sys.path``, pip itself works just +fine so that both nose2 and genshi can live together in the venv. + + +Updating packages +================= + +Inevitably, new versions of Python or the pyvenv dependent packages will +appear. Unfortunately, as currently implemented (by both upstream ensurepip +and in our ensurepip patch), the versions of both the direct and indirect +dependencies are hardcoded in ``Lib/ensurepip/__init__.py``. When a Debian +developer updates any of the dependent packages, you will need to: + + * *Test that the new version is compatible with ensurepip*. + + * Update the version numbers in the ``debian/control`` file, for the + python3.x-venv binary package. + + * ``quilt push`` to the ensurepip patch, and update the version number in + ``Lib/ensurepip/__init__.py`` + +Then rebuild and upload python3.4. + +Yes, this isn't ideal, and I am working with upstream to find a good solution +that we can share. + + +Author +====== + +Barry A. Warsaw +2014-05-15 + + + +.. _pyvenv: http://legacy.python.org/dev/peps/pep-0405/ +.. _virtualenv: https://pypi.python.org/pypi/virtualenv +.. _`automatic inclusion`: http://legacy.python.org/dev/peps/pep-0453/ +.. _pip: https://pypi.python.org/pypi/pip +.. _PyPI: https://pypi.python.org/pypi +.. _ensurepip: https://docs.python.org/3/library/ensurepip.html +.. _`universal wheels`: http://legacy.python.org/dev/peps/pep-0427/ +.. _requests: https://pypi.python.org/pypi/requests +.. _incomplete: https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=719767 +.. _wheel: https://pypi.python.org/pypi/wheel +.. _nose2: https://pypi.python.org/pypi/nose2 +.. _genshi: https://pypi.python.org/pypi/Genshi +.. _`Debian Python Policy`: https://www.debian.org/doc/packaging-manuals/python-policy/ --- python3.4-3.4.2~rc1.orig/debian/_sysconfigdata.py +++ python3.4-3.4.2~rc1/debian/_sysconfigdata.py @@ -0,0 +1,6 @@ +import sys + +if hasattr(sys, 'gettotalrefcount'): + from _sysconfigdata_dm import * +else: + from _sysconfigdata_m import * --- python3.4-3.4.2~rc1.orig/debian/changelog +++ python3.4-3.4.2~rc1/debian/changelog @@ -0,0 +1,3020 @@ +python3.4 (3.4.2~rc1-1) unstable; urgency=medium + + * Python 3.4.2 release candidate 1. + * Update to 20140930 from the 3.4 branch. + + -- Matthias Klose Tue, 30 Sep 2014 01:51:50 +0200 + +python3.4 (3.4.1-11) unstable; urgency=medium + + * Update to 20140910 from the 3.4 branch. + + -- Matthias Klose Wed, 10 Sep 2014 20:21:04 +0200 + +python3.4 (3.4.1-10) unstable; urgency=medium + + * Update to 20140818 from the 3.4 branch. + * Build-depend on dpkg-dev (>= 1.17.11). + + -- Matthias Klose Mon, 18 Aug 2014 10:00:55 +0200 + +python3.4 (3.4.1-9) unstable; urgency=medium + + * Update to 20140810 from the 3.4 branch. + + -- Matthias Klose Sun, 10 Aug 2014 14:53:46 +0200 + +python3.4 (3.4.1-8) unstable; urgency=medium + + * Update to 20140726 from the 3.4 branch. + * Move turtledemo from libpython3.4-testsuite to python3.4-examples. + * Call dpkg -L in the maintainer scripts with an architecture qualifier + for M-A: same packages. Closes: #754914. + + -- Matthias Klose Sat, 26 Jul 2014 14:16:56 +0200 + +python3.4 (3.4.1-7) unstable; urgency=medium + + * Update to 20140706 from the 3.4 branch. + + -- Matthias Klose Sun, 06 Jul 2014 21:37:36 +0200 + +python3.4 (3.4.1-6) unstable; urgency=medium + + * Fix logic to disable running the pystone benchmark on KFreeBSD (Steven + Chamberlain). + + -- Matthias Klose Mon, 09 Jun 2014 12:06:18 +0200 + +python3.4 (3.4.1-5) unstable; urgency=medium + + * Update to 20140608 from the 3.4 branch. + * Disable running the pystone benchmark on KFreeBSD. + + -- Matthias Klose Sun, 08 Jun 2014 11:43:44 +0200 + +python3.4 (3.4.1-4) unstable; urgency=medium + + * Disable running the pybench benchmark on KFreeBSD. + + -- Matthias Klose Sat, 07 Jun 2014 14:01:35 +0200 + +python3.4 (3.4.1-3) unstable; urgency=medium + + * Update to 20140605 from the 3.4 branch. + - pull in pyvenv changes. + * Update the ensurepip-wheels patch (Barry Warsaw). + * Fix python3.4-venv package removal. + + -- Matthias Klose Thu, 05 Jun 2014 11:57:51 +0200 + +python3.4 (3.4.1-2) unstable; urgency=medium + + * Update to 20140603 from the 3.4 branch. + * Remove the __pycache__ directories on libpython3.4-testsuite package + removal. Closes: #749999. + * In the autopkg tests, set HOME to the temporary home directory after + the su call. + * In the autopkg tests, make $ADTTMP accessible to the su user, and + re-enable the test_site autopkg test. + * Don't try to access the pip module in ensurepip, when the wheels + are not available. + + -- Matthias Klose Tue, 03 Jun 2014 23:58:48 +0200 + +python3.4 (3.4.1-1) unstable; urgency=medium + + * Python 3.4.1 release. + * Set a temporary home directory for the build and the autopkg tests. + * Fix issue #17752, test_distutils failures in the installed location. + * Update pydoc_data/topics.py, broken in the release candidate. + * Run again the test_code_module test in the autopkg tests. + * Fix issue #21264, test_compileall test failures in the installed + location. Re-enable in autopkg tests. LP: #1264554. + * ensurepip and pyvenv: + - Split out a python3.4-venv package, include the pyvenv-3.4 binary + and the ensurepip package. + - Adjust the ensurepip patch so that the wheels are installed from + the universal wheel packages (Barry Warsaw). + - Let ensurepip read wheel dependencies from a file shipped in the + -whl packages. + - Remove any version check on required pip and setuptools versions. + These are handled within these packages if necessary. + * Re-enable the pgo build. + + -- Matthias Klose Wed, 21 May 2014 22:17:32 +0200 + +python3.4 (3.4.1~rc1-1) unstable; urgency=medium + + * Python 3.4.1 release candidate 1. + * Don't run test_code_module in the autopkg test environment, fails there + but succeeds during the build. See issue #17756. Applied workaround + for the test case. + + -- Matthias Klose Mon, 05 May 2014 16:10:23 +0200 + +python3.4 (3.4.0+20140427-1) unstable; urgency=medium + + * Update to 20140427 from the 3.4 branch. + * Fix dependency for the -testsuite package: Closes: #745879. + + -- Matthias Klose Sun, 27 Apr 2014 18:48:54 +0200 + +python3.4 (3.4.0+20140425-1) unstable; urgency=medium + + * Update to 20140425 from the 3.4 branch. + * Don't try to byte-compile bad syntax files in the testsuite. + + -- Matthias Klose Fri, 25 Apr 2014 13:52:11 +0200 + +python3.4 (3.4.0+20140417-1) unstable; urgency=medium + + * Update to 20140417 from the 3.4 branch. + - Fix the test_site test failure. + * Repackage as a new tarball and remove the wheels shipped with ensurepip. + * Re-enable running some tests, disable some tests: + - Re-enable test_platform, test_subprocess, test_code_module, test_pydoc, + - Fix a distutils test error, skip a Solaris distutils test error. + - Skip the test_platform encoding test, failing with the lsb-release patch. + - Skip tests which are failing with python3.4.zip removed from sys.path. + Tracked in issue #21249. + * Byte-compile the files in the libpython3.4-testsuite package. + * d/p/distutils-install-layout.diff, d/p/site-locations.diff: Adjust the + "am I in a virtual environment" tests to include checking + sys.base_prefix != sys.prefix. This is the definitive such test for + pyvenv created virtual environments (Barry Warsaw). + * Disallow running ensurepip with the system python, when not used in + a virtual environment (Barry Warsaw). + * Don't yet install the ensurepip module, requires further work. + ensurepip wants to install bundled modules setuptools and python-pip, + which should be built from the distro packages instead of using the + bundled code. + * python3.4-dbg: Add a python3.4-dbg.py symlink. + * Remove the linecache patch, not needed anymore in 3.4. + * Remove the disable-utimes patch, not needed anymore since glibc-2.4. + * Remove the statvfs-f_flag-constants, avoid-rpath, hurd-path_max, + kfreebsd-xattrs, freebsd-testsuite and ncurses-configure patches + applied upstream. + * Don't add runtime paths for libraries found in multiarch locations. + + -- Matthias Klose Thu, 17 Apr 2014 21:05:04 +0200 + +python3.4 (3.4.0-2) unstable; urgency=medium + + * Update to 20140407 from the 3.4 branch. + - Issue #21134: Fix segfault when str is called on an uninitialized + UnicodeEncodeError, UnicodeDecodeError, or UnicodeTranslateError object. + - Issue #19537: Fix PyUnicode_DATA() alignment under m68k. + - Issue #21155: asyncio.EventLoop.create_unix_server() now raises + a ValueError if path and sock are specified at the same time. + - Issue #21149: Improved thread-safety in logging cleanup during + interpreter shutdown. + - Issue #20145: `assertRaisesRegex` and `assertWarnsRegex` now raise a + TypeError if the second argument is not a string or compiled regex. + - Issue #21058: Fix a leak of file descriptor in + :func:`tempfile.NamedTemporaryFile`, close the file descriptor if + :func:`io.open` fails. + - Issue #21013: Enhance ssl.create_default_context() when used for server + side sockets to provide better security by default. + - Issue #20633: Replace relative import by absolute import. + - Issue #20980: Stop wrapping exception when using ThreadPool. + - Issue #21082: In os.makedirs, do not set the process-wide umask. + Note this changes behavior of makedirs when exist_ok=True. + - Issue #20990: Fix issues found by pyflakes for multiprocessing. + - Issue #21015: SSL contexts will now automatically select an elliptic + curve for ECDH key exchange on OpenSSL 1.0.2 and later, and otherwise + default to "prime256v1". + - Issue #20816: Fix inspect.getcallargs() to raise correct TypeError for + missing keyword-only arguments. + - Issue #20817: Fix inspect.getcallargs() to fail correctly if more + than 3 arguments are missing. + - Issue #6676: Ensure a meaningful exception is raised when attempting + to parse more than one XML document per pyexpat xmlparser instance. + - Issue #20942: PyImport_ImportFrozenModuleObject() no longer sets __file__ + to match what importlib does; this affects _frozen_importlib as well as + any module loaded using imp.init_frozen(). + - Documentation, tools, demo and test updates. + * Depend on the python3-tk packages in the autopkg tests. + * Fix LTO builds with GCC 4.9. + + -- Matthias Klose Mon, 07 Apr 2014 11:46:02 +0200 + +python3.4 (3.4.0-1) unstable; urgency=medium + + * Python 3.4.0 release. + * Update to 20140322 from the 3.4 branch. + + * Build without ffi on or1k. Addresses: #738519. + * Update autopkg tests (Martin Pitt): + - Don't fail if apport is not installed. + - Call su with explicit shell, as nobody has nologin as default shell now. + - Only use $SUDO_USER if that user actually exists in the testbed. + - Drop obsolete chowning of $TMPDIR and $ADTTMP; with current autopkgtest + $TMPDIR has appropriate permissions, and $ADTTMP is not being used. + + -- Matthias Klose Sat, 22 Mar 2014 13:39:34 +0100 + +python3.4 (3.4~rc2-1) unstable; urgency=medium + + * Python 3.4 release candidate 2. + + -- Matthias Klose Mon, 24 Feb 2014 10:40:55 +0100 + +python3.4 (3.4~rc1-1) unstable; urgency=medium + + * Python 3.4 release candidate 1. + + -- Matthias Klose Tue, 11 Feb 2014 13:38:50 +0100 + +python3.4 (3.4~b3-1) unstable; urgency=medium + + * Python 3.4 beta 3. + + -- Matthias Klose Mon, 27 Jan 2014 10:54:10 +0000 + +python3.4 (3.4~b2-1) unstable; urgency=medium + + * Python 3.4 beta 2. + * Configure --with-system-libmpdec. + + -- Matthias Klose Sun, 05 Jan 2014 23:34:17 +0100 + +python3.4 (3.4~b1-5ubuntu2) trusty; urgency=medium + + * Disable the test_dbm autopkg test, failing from time to time ... + + -- Matthias Klose Fri, 03 Jan 2014 02:25:31 +0100 + +python3.4 (3.4~b1-5ubuntu1) trusty; urgency=medium + + * Build for Tcl/Tk 8.6. + + -- Matthias Klose Thu, 02 Jan 2014 18:05:27 +0100 + +python3.4 (3.4~b1-5) unstable; urgency=medium + + * Update to 20131231 from the trunk. + - Fix issue #20070, don't run test_urllib2net when network resources + are not enabled. + * Move the _sitebuiltins module into libpython3.4-minimal. + * distutils: On installation with --install-layout=deb, rename extensions + to include the multiarch tag. + Renaming of extensions for python3.4 is currently not done by dh-python. + See Debian #733128. + * autopkg tests: + - Update debian/tests/control to refer to python3.4. + - Generate locales for running the autopkg tests. + - Disable some currently failing autopkg tests. LP: #1264554. + - Disable test_compileall for the autopkg tests, fails only there. + * Don't run test_faulthandler on Aarch64, hangs on the buildds. + See LP: #1264354. + + -- Matthias Klose Tue, 31 Dec 2013 13:29:08 +0100 + +python3.4 (3.4~b1-4) unstable; urgency=medium + + * Update to 20131225 from the trunk. + * Fix python3.4--config --configdir. Closes: #733050. + + -- Matthias Klose Wed, 25 Dec 2013 21:56:04 +0100 + +python3.4 (3.4~b1-3) experimental; urgency=medium + + * Update to 20131221 from the trunk. + + -- Matthias Klose Sat, 21 Dec 2013 15:20:38 +0100 + +python3.4 (3.4~b1-2) experimental; urgency=low + + * Update to 20131202 from the trunk. + * Fix dbg symbols file for i386. + * Don't provide python3.4-dbm, available in a separate package. + * (Build-)depend on net-tools, test_uuid requires ifconfig. + * Fix distutils.sysconfig.get_makefile_filename(). + * Move operator module to the -minimal package. Closes: #731100. + + -- Matthias Klose Mon, 02 Dec 2013 14:36:44 +0100 + +python3.4 (3.4~b1-1) experimental; urgency=low + + * Python 3.4 beta 1. + + -- Matthias Klose Sun, 24 Nov 2013 23:21:49 +0100 + +python3.3 (3.3.3-2) unstable; urgency=low + + * Update to 20131123 from the 3.3 branch. + * Update hurd-path_max.diff. + + -- Matthias Klose Sat, 23 Nov 2013 08:57:21 +0100 + +python3.3 (3.3.3-1) unstable; urgency=low + + * Python 3.3.3 release. + * Update to 20131119 from the 3.3 branch. + * Regenerate the patches. + * Update the symbols files. + * Fix test support when the running kernel doesn't handle port reuse. + * libpython3.3-minimal replaces libpython3.3-stdlib (<< 3.2.3-7). + Closes: #725240. + + -- Matthias Klose Tue, 19 Nov 2013 08:46:55 +0100 + +python3.3 (3.3.2-7) unstable; urgency=low + + * Update to 20130918 from the 3.3 branch. + * Update symbols file. + * Fail the build if extensions for the minimal package are not in + the libpython-minimal package. Closes: #723624. + * Fix indentation in regenerated platform-lsbrelease.diff (Dmitry Shachnev). + LP: #1220508. + * Point to the python3-tk (instead of the python-tk) package when missing. + LP: #1184082. + + -- Matthias Klose Wed, 18 Sep 2013 12:19:47 +0200 + +python3.3 (3.3.2-6) unstable; urgency=medium + + * Update to 20130917 from the 3.3 branch. + - Fix SSL module to handle NULL bytes inside subjectAltNames general + names (CVE-2013-4238). Closes: #719567. + * Don't run the curses autopkg test. + * Set Multi-Arch attributes for binary packages. + * Fix multiarch include header for sparc64. Closes: #714802. + + -- Matthias Klose Tue, 17 Sep 2013 15:12:00 +0200 + +python3.3 (3.3.2-5) unstable; urgency=low + + * Update to 20130803 from the 3.3 branch. + - Fix fcntl test case on KFreeBSD (Petr Salinger). + * Disable some socket tests on KFreeBSD (Petr Salinger). + * Fix multiarch include header for sparc64. Closes: #714802. + * Update package descriptions (Filipus Klutiero). Closes: #715801. + + -- Matthias Klose Sun, 04 Aug 2013 17:38:35 +0200 + +python3.3 (3.3.2-4) unstable; urgency=low + + * Update to 20130612 from the 3.3 branch. + * Refresh patches. + * Don't run consistency check for cross builds. + * Really skip byte compile of non-existing sitecustomize.py. + * Fix the multiarch header file for mips64 (YunQiang Su). Closes: #710374. + + -- Matthias Klose Wed, 12 Jun 2013 22:55:02 +0200 + +python3.3 (3.3.2-3) unstable; urgency=low + + * Update to 20130527 from the 3.3 branch. + - Fix #17980, possible abuse of ssl.match_hostname() for denial of service + using certificates with many wildcards (CVE-2013-2099). Closes: #708530. + * Disable the test_io test on armel, armhf, mips, mipsel. Hangs the + buildds. + * Don't try to byte-compile sitecustomize.py if the target of the + symlink doesn't exist anymore. Addresses: #709157. + * Fix directory removal in maintainer scripts. Closes: #709963. + * Handle byte compilation in python3.3{-minimal,}, byte removal in + libpython3.3{-minimal,-stdlib}. + * Backport patch to fix issue #13146, possible race conditions when writing + .pyc/.pyo files in py_compile.py (Barry Warsaw). LP: #1058884. + * Mark all _Py_dg_* symbols as optional on m68k. Closes: #709888. + + -- Matthias Klose Mon, 27 May 2013 20:44:03 +0200 + +python3.3 (3.3.2-2) unstable; urgency=high + + * Fix the multiarch header file for ppc64. Closes: #708646. + * Disable running the tests on kfreebsd and the hurd. Please + follow-up in #708652 and #708653. + + -- Matthias Klose Fri, 17 May 2013 23:16:04 +0200 + +python3.3 (3.3.2-1) unstable; urgency=low + + * Python 3.3.2 release. + * Fix sysconfig.get_makefile_name() for the multiarch location. + * Set the platinclude dir back to the non-multiarch include path, + where the multiarch pyconfig.h compatibility header is found. + * Remove obsolete profile-doc patch. + * Run the pgo profile task in batches to avoid crashes during the + pgo profile run. + * Don't set yet any Multi-Arch: attributes in Debian. + * Build a libpython3.3-testsuite package. + * Add autopkg tests to run the installed testsuite in normal and debug + mode. + * Re-enable running the tests during the build. + * Add pyconfig.h compatibility headers. + + -- Matthias Klose Wed, 15 May 2013 19:41:15 +0200 + +python3.3 (3.3.1-1ubuntu5) raring; urgency=low + + * Remove obsolete profile-doc patch. + * Run the pgo profile task in batches to avoid crashes during the + pgo profile run. + * Disable the lto build on armhf for now. + * Final (?) set of autopkg test fixes. + * Issue #17012: shutil.which() no longer fallbacks to the PATH environment. + variable if empty path argument is specified. + * Issue #17782: Fix undefined behaviour on platforms where + ``struct timespec``'s "tv_nsec" member is not a C long. + + -- Matthias Klose Wed, 17 Apr 2013 23:35:49 +0200 + +python3.3 (3.3.1-1ubuntu4) raring; urgency=low + + * Don't run the test suite in random order. + * More autopkg test fixes. + + -- Matthias Klose Wed, 17 Apr 2013 13:33:00 +0200 + +python3.3 (3.3.1-1ubuntu3) raring; urgency=low + + * Fix sysconfig.get_makefile_name() for the multiarch location. + * Set the platinclude dir back to the non-multiarch include path, + where the multiarch pyconfig.h compatibility header is found. + * Fix autopkg tests. + * More autopkgtest fixes (Jean-Baptiste Lallement): + - redirect stderr of command 'stop apport' to /dev/null. output to stderr + is an error for adt. + - script.py waits for child to exit and exit with child's return code. + - xpickle is not a valid value for option -u of regrtest.py. Removed it + LP: #1169150. + * Issue #17754, setting LANG and LC_ALL for the compiler call in ctypes/util. + * Issue #17761, platform._parse_release_file doesn't close the + /etc/lsb-release file, and doesn't know about 'Ubuntu'. + + -- Matthias Klose Tue, 16 Apr 2013 17:33:35 +0200 + +python3.3 (3.3.1-1ubuntu2) raring; urgency=low + + * Idle updates: + - Issue #17657: Show full Tk version in IDLE's about dialog. + - Issue #17613: Prevent traceback when removing syntax colorizer. + - Issue #1207589: Backwards-compatibility patch for right-click menu. + - Issue #16887: Now accepts Cancel in tabify/untabify dialog box. + - Issue #17625: Close the replace dialog after it is used. + - Issue #14254: Now handles readline correctly across shell restarts. + - Issue #17614: No longer raises exception when quickly closing a file. + - Issue #6698: Now opens just an editor window when configured to do so. + - Issue #8900: Using keyboard shortcuts in IDLE to open a file no longer + raises an exception. + - Issue #6649: Fixed missing exit status. + * Build a libpython3.3-testsuite package. LP: #301629. + * Add autopkg tests to run the installed testsuite in normal and debug + mode. + * Re-enable running the tests during the build. + * Add pyconfig.h compatibility headers. LP: #1094246. + + -- Matthias Klose Wed, 10 Apr 2013 23:05:23 +0200 + +python3.3 (3.3.1-1ubuntu1) raring; urgency=low + + * Merge with Debian; remaining changes: + - Build-depend on python3:any instead of python3. + + -- Matthias Klose Sat, 06 Apr 2013 16:21:34 +0200 + +python3.3 (3.3.1-1) unstable; urgency=low + + * Python 3.3.1 release. + * Call python with -E -S for the byte compilation. + + -- Matthias Klose Sat, 06 Apr 2013 15:12:07 +0200 + +python3.3 (3.3.1~rc1-2) experimental; urgency=low + + * Fix byte-compiliation/-removal for the split-out library packages. + LP: #1160944. + + -- Matthias Klose Sat, 30 Mar 2013 13:36:40 +0100 + +python3.3 (3.3.1~rc1-1) experimental; urgency=low + + * Python 3.3.1 release candidate 1. + + -- Matthias Klose Tue, 26 Mar 2013 10:45:37 +0100 + +python3.3 (3.3.0-12) experimental; urgency=low + + * Update to 20130306 from the 3.3 branch. + * Remove the HAVE_FSYNC configure workaround, not needed for 3.3. + * Remove the python3 manual symlink (now shipped upstream by default). + Closes: #701051. + + -- Matthias Klose Wed, 06 Mar 2013 16:38:41 +0800 + +python3.3 (3.3.0-11) experimental; urgency=low + + * Update to 20130220 from the 3.3 branch. + + -- Matthias Klose Wed, 20 Feb 2013 15:40:05 +0100 + +python3.3 (3.3.0-10) experimental; urgency=low + + * Update to 20130126 from the 3.3 branch. + * Update hurd patches. + * python3.3-dbg, libpython3.3-dbg: Drop dependency on python. + * python3.3-dbg: Make gdb (not gdb-minimal) a recommendation. + * Git rid of build-dependency on python. + * Add site-packages in virtual environments created by pyvenv. + Closes: #698777. + + -- Matthias Klose Sat, 26 Jan 2013 12:17:05 +0100 + +python3.3 (3.3.0-9) experimental; urgency=low + + * Update to 20130125 from the 3.3 branch. + * Update cross build patches, and allow the package to cross build. + + -- Matthias Klose Fri, 25 Jan 2013 17:06:25 +0100 + +python3.3 (3.3.0-8) experimental; urgency=low + + * Update to 20130105 from the 3.3 branch. + * python-config --help returns with an exit value 0. LP: #1093860. + * Update package description for the -dbg packages. Closes: #696616. + + -- Matthias Klose Sat, 05 Jan 2013 18:39:32 +0100 + +python3.3 (3.3.0-7) experimental; urgency=low + + * Update to 20121220 from the 3.3 branch. + * debian/patches/sys-multiarch.diff: Expose multiarch triplet value + as sys.implementation._multiarch (Barry Warsaw). Closes: #695959. + Note: Usage of sysconfig.get_config_var('MULTIARCH') is preferred. + * Set the install schema to `unix_prefix', if a virtual environment + is detected (VIRTUAL_ENV env var present). Closes: #695758. + * python3.3-dev, libpython3.3-dev: Drop the dependency on libssl-dev. + + -- Matthias Klose Fri, 21 Dec 2012 07:24:41 +0100 + +python3.3 (3.3.0-6) experimental; urgency=low + + * Don't use xattrs on kfreebsd and the Hurd. + + -- Matthias Klose Tue, 04 Dec 2012 04:36:42 +0100 + +python3.3 (3.3.0-5) experimental; urgency=low + + * Update to 20121203 from the 3.3 branch. + * Make python3.3, python3.3-{minimal,dev,dbg} Multi-Arch: allowed. + * Use a shell implementation for the python-config script. + + -- Matthias Klose Mon, 03 Dec 2012 21:52:33 +0100 + +python3.3 (3.3.0-4) experimental; urgency=low + + * Update to 20121128 from the 3.3 branch. + * Don't link extensions with the shared libpython library. + * Override pointless lintian warning `hardening-no-fortify-functions' + for binaries built without optimization. + + -- Matthias Klose Wed, 28 Nov 2012 13:47:16 +0100 + +python3.3 (3.3.0-3) experimental; urgency=low + + * Update to 20121106 from the 3.3 branch. + * Filter-out cflags for profiled builds from _sysconfigdata. + * Fix multiarch plat-linux installation. LP: #1075891. + * Install _sysconfigdata.py from the shared builds. LP: #1075903. + + -- Matthias Klose Wed, 07 Nov 2012 14:31:02 +0100 + +python3.3 (3.3.0-2) experimental; urgency=low + + * Update to 20121021 from the 3.3 branch. + * Fix the interpreter name for the python3.3-dbg-config script. + + -- Matthias Klose Sun, 21 Oct 2012 09:51:05 +0200 + +python3.3 (3.3.0-1) experimental; urgency=low + + * Python 3.3.0 release. + + -- Matthias Klose Sat, 29 Sep 2012 12:59:24 +0200 + +python3.3 (3.3.0~rc3-1) experimental; urgency=low + + * Python 3.3.0 release candidate 3. + * Don't try to write lib2to3's pickled grammar files. Closes: #687200. + * Fix python-config manpage symlink. Closes: #687201. + + -- Matthias Klose Mon, 24 Sep 2012 16:22:17 +0200 + +python3.3 (3.3.0~rc2-2ubuntu1) quantal; urgency=low + + * Encode the version in the devhelp documentation name. LP: #787039. + + -- Matthias Klose Mon, 10 Sep 2012 12:56:13 +0200 + +python3.3 (3.3.0~rc2-2) experimental; urgency=low + + * Fix typo fixing the pkgconfig file. + + -- Matthias Klose Mon, 10 Sep 2012 11:13:51 +0200 + +python3.3 (3.3.0~rc2-1) experimental; urgency=low + + * Python 3.3.0 release candidate 2. + * Add the platform include dir to pkgconfig's CFlags. + * Hint on installing the python-gdbm package on failing _gdbm import. + LP: #995616. + * libpython3.3: Fix libpython3.3.so symlink. Closes: #686377. + * Don't use `-n' anymore to start idle in the desktop/menu files. + + -- Matthias Klose Sun, 09 Sep 2012 13:38:55 +0200 + +python3.3 (3.3.0~rc1-2) experimental; urgency=low + + * distutils: Add the multiarch python path to the include directories. + Closes: #685041. + * Remove /etc/python3.3 in libpython3.3-minimal instead of python3.3-minimal. + Closes: #681979. + * Remove /etc/python/sysconfig.cfg, not available anymore in python3.3. + Closes: #685016. + * Don't ship the _gdbm and _tkinter extensions in the -dbg package. + Closes: #685261. + * Fix verbose parallel builds for the sharedmods target. + * Don't install the pickled lib2to3 grammar files. Closes: #685214. + * Build extensions with fortify flags. + * Overwrite arch-dependent-file-not-in-arch-specific-directory warnings. + + -- Matthias Klose Tue, 28 Aug 2012 19:47:58 +0200 + +python3.3 (3.3.0~rc1-1) experimental; urgency=low + + * Python 3.3.0 release candidate 1. + + -- Matthias Klose Sun, 26 Aug 2012 23:15:00 +0200 + +python3.3 (3.3.0~b2-1) experimental; urgency=low + + * Python 3.3.0 beta2 release. + * Fix removal of the _tkinter and dbm extensions for multiarch builds. + Closes: #684461. + * Use _sysconfigdata.py in distutils to initialize distutils. + Closes: #682475. + * Fix symlink for static libpython. Closes: #684608. + + -- Matthias Klose Mon, 13 Aug 2012 11:05:00 +0200 + +python3.3 (3.3.0~b1-3) experimental; urgency=low + + * Update to 20120712 from the trunk. + * Install separate _sysconfigdata.py for normal and debug builds. + * Install into multiarch locations. + * Split out multiarch packages libpython3.3-{minimal,stdlib,dev,dbg}. + + -- Matthias Klose Fri, 13 Jul 2012 00:43:42 +0200 + +python3.3 (3.3.0~b1-2) experimental; urgency=low + + * Update to 20120701 from the trunk. + + -- Matthias Klose Sun, 01 Jul 2012 11:45:12 +0200 + +python3.3 (3.3.0~b1-1) experimental; urgency=low + + * Python 3.3.0 beta1 release. + * Fix symlink for the -gdb.py file. + * debian/copyright: Add libmpdec license. + * Enable fortified build. + + -- Matthias Klose Wed, 27 Jun 2012 08:44:56 +0200 + +python3.3 (3.3.0~a4-1) experimental; urgency=low + + * Python 3.3.0 alpha4 release. + * Update to 20120620 from the trunk. + * Build _ctypes as an extension, not a builtin. + * Mark symbols defined in the _ctypes extension as optional. + * Remove references to the removed pyton3.3-documenting file. + * The wininst-* files cannot be built within Debian from the included + sources, needing a zlib mingw build, which the zlib maintainer isn't + going to provide. + * Use the underscore.js file provided by the libjs-underscore package. + * Let pydoc handle dist-packages the same as site-packages. + * Avoid runtime path for the sqlite extension. + + -- Matthias Klose Wed, 20 Jun 2012 13:09:19 +0200 + +python3.3 (3.3.0~a3-1) experimental; urgency=low + + * Python 3.3.0 alpha3 release. + * Build the dbm extension using db5.3. + * Update symbols file for a3. + + -- Matthias Klose Wed, 02 May 2012 23:28:46 +0200 + +python3.3 (3.3.0~a2-1) experimental; urgency=low + + * Python 3.3.0 alpha2 release. + * Update to 20120404 from the trunk. + * Build-depend on expat (>= 2.1). + + -- Matthias Klose Wed, 04 Apr 2012 16:31:34 +0200 + +python3.3 (3.3.0~a1-1) experimental; urgency=low + + * Python 3.3.0 alpha1 release. + * Update to 20120321 from the trunk. + * Update debian/copyright. + * Build-depend on expat (>= 2.1~). + + -- Matthias Klose Thu, 22 Mar 2012 06:14:01 +0100 + +python3.3 (3.3~20120109-1) experimental; urgency=low + + * 3.3 20120109 snapshot from the trunk. + * Merge packaging from python3.2 3.2.2-4. + + -- Matthias Klose Sun, 08 Jan 2012 09:44:33 +0100 + +python3.3 (3.3~20110523-1) experimental; urgency=low + + * Initial Python 3.3 packaging. + + -- Matthias Klose Mon, 23 May 2011 09:20:52 +0200 + +python3.2 (3.2.2-4) unstable; urgency=low + + * The static library belongs into the -dev package. + * Remove obsolete attributes in the control file. + + -- Matthias Klose Sat, 07 Jan 2012 20:46:39 +0100 + +python3.2 (3.2.2-3) unstable; urgency=low + + * Update to 20120106 from the 3.2 branch. + * Install manual pages for 2to3 and python-config. + * Fix file permission of token.py module. + * Add the ability to build an python3.x udeb, as copy of the + python3.x-minimal package (Colin Watson). + * Overwrite some lintian warnings: + - The -dbg interpreters are not unusual. + - The -gdb.py files don't need a python dependency. + - lintian can't handle a whatis entry starting with one word on the line. + * Fix test failures related to distutils debian installation layout. + * Update symbols files. + * Add build-arch/build-indep targets. + * Regenerate Setup and Makefiles after correcting Setup.local. + * profiled-build.diff: Pass PY_CFLAGS instead of CFLAGS for the profiled + build. + * Pass dpkg-buildflags to the build process, and build third party + extensions with these flags. + * Add support to build using -flto (and -g1) on some architectures. + * Disable pgo builds for some architectures (for now, keep just + amd64 armel armhf i386 powerpc ppc64). + * Build-depend on libgdbm-dev to build and run the gdbm tests. + * Build-depend on xvfb to run the tkinter tests. + + -- Matthias Klose Fri, 06 Jan 2012 20:10:13 +0100 + +python3.2 (3.2.2-2) unstable; urgency=low + + * Update platform patches (alpha, hppa, mips, sparc). + + -- Matthias Klose Fri, 02 Dec 2011 10:24:05 +0100 + +python3.2 (3.2.2-1) unstable; urgency=low + + * Python 3.2.2 release. + * Update to 20111201 from the 3.2 branch. + * Search headers in /usr/include/ncursesw for the curses/panel extensions. + * New patch, ctypes-arm, allow for ",hard-float" after libc6 in ldconfig -p + output (Loic Minier). LP: #898172. + + -- Matthias Klose Thu, 01 Dec 2011 13:19:16 +0100 + +python3.2 (3.2.2~rc1-1) unstable; urgency=low + + * Python 3.2.2 release candidate 1. + + -- Matthias Klose Sun, 14 Aug 2011 20:25:35 +0200 + +python3.2 (3.2.1-2) unstable; urgency=low + + * Update to 20110803 from the 3.2 branch. + * Revert previous change to treat Linux 3.x as Linux 2. Use the + plat-linux3 directory instead. + * Use linux-any for some build dependencies. Closes: #634310. + + -- Matthias Klose Wed, 03 Aug 2011 15:16:05 +0200 + +python3.2 (3.2.1-1) unstable; urgency=medium + + * Python 3.2.1 release. + * Update lib-argparse patch (Pino Toscano). Closes: #631635. + * Treat Linux 3.x as Linux 2. Closes: #633015. + + -- Matthias Klose Sun, 10 Jul 2011 21:46:36 +0200 + +python3.2 (3.2.1~rc2-1) unstable; urgency=low + + * Python 3.2.1 release candidate 2. + * Add profile/pstats to the python3.2 package, update debian copyright. + * Don't run the benchmark on hurd-i386. + * Disable threading tests on hurd-i386. Closes: #631634. + * Don't add the bsddb multilib path, if already in the standard lib path. + + -- Matthias Klose Mon, 04 Jul 2011 20:27:52 +0200 + +python3.2 (3.2.1~rc1-1) unstable; urgency=low + + * Python 3.2.1 release candidate 1. + * Only enable sphinx-0.x patches when building with sphinx-0.x. + + -- Matthias Klose Wed, 18 May 2011 12:15:47 +0200 + +python3.2 (3.2-4) unstable; urgency=low + + * Update to 20110504 from the 3.2 branch. + * Disable the profiled build on ia64 and m68k. + * Update symbols file for m68k (Thorsten Glaser). + + -- Matthias Klose Wed, 04 May 2011 21:32:08 +0200 + +python3.2 (3.2-3) unstable; urgency=low + + * Update to 20110427 from the 3.2 branch. + - Fix argparse import. Closes: #624277. + * Keep the ssl.PROTOCOL_SSLv2 module constant , just raise an exception + when trying to create a PySSL object. #624127. + * Don't depend on the locale and specific awk implementations in prerm. + Closes: #623466, #620836. + * Remove the old local site directory. Closes: #623057. + + -- Matthias Klose Wed, 27 Apr 2011 20:40:29 +0200 + +python3.2 (3.2-2) unstable; urgency=low + + * Update to 20110419 from the 3.2 branch. + * Re-enable profile-guided builds. + * Build without OpenSSL v2 support. Closes: #622004. + * Force linking the curses module against libncursesw. Closes: #622064. + * Re-enable running the testsuite during the build. + + -- Matthias Klose Tue, 19 Apr 2011 17:54:36 +0200 + +python3.2 (3.2-1) unstable; urgency=low + + * Python 3.2 final release. + + -- Matthias Klose Sun, 20 Feb 2011 19:22:24 +0100 + +python3.2 (3.2~rc3-1) experimental; urgency=low + + * Python 3.2 release candidate 3. + + -- Matthias Klose Mon, 14 Feb 2011 16:12:14 +0100 + +python3.2 (3.2~rc1-2) experimental; urgency=low + + * Fix upgrade of the python3.2-dev package. Closes: #610370. + + -- Matthias Klose Wed, 19 Jan 2011 02:21:19 +0100 + +python3.2 (3.2~rc1-1) experimental; urgency=low + + * Python 3.2 release candidate 1. + + -- Matthias Klose Sun, 16 Jan 2011 22:17:09 +0100 + +python3.2 (3.2~b2-1) experimental; urgency=low + + * Python 3.2 beta2 release. + * Fix FTBFS on hurd-i386 (Pino Toscano). Closes: #606152). + + -- Matthias Klose Tue, 21 Dec 2010 21:23:21 +0100 + +python3.2 (3.2~b1-1) experimental; urgency=low + + * Python 3.2 beta1 release. + * Configure with --enable-loadable-sqlite-extensions. + + -- Matthias Klose Mon, 06 Dec 2010 12:19:09 +0100 + +python3.2 (3.2~a4-2) experimental; urgency=low + + * Fix build failure on the hurd. + + -- Matthias Klose Fri, 26 Nov 2010 06:38:41 +0100 + +python3.2 (3.2~a4-1) experimental; urgency=low + + * Python 3.2 alpha4 release. + * Update to the py3k branch (20101124). + * Move the Makefile into the -min package, required by sysconfig. + Addresses: #603237. + + -- Matthias Klose Wed, 24 Nov 2010 22:20:32 +0100 + +python3.2 (3.2~a3-2) experimental; urgency=low + + * Update to the py3k branch (20101018). + - Issue #10094: Use versioned .so files on GNU/kfreeBSD and the GNU Hurd. + Closes: #600183. + + -- Matthias Klose Mon, 18 Oct 2010 19:34:39 +0200 + +python3.2 (3.2~a3-1) experimental; urgency=low + + * Python 3.2 alpha3 release. + * Make Lib/plat-gnukfreebsd[78] ready for python3. Closes: #597874. + + -- Matthias Klose Tue, 12 Oct 2010 16:13:15 +0200 + +python3.2 (3.2~a2-7) experimental; urgency=low + + * Update to the py3k branch (20100926). + + -- Matthias Klose Sun, 26 Sep 2010 14:41:18 +0200 + +python3.2 (3.2~a2-6) experimental; urgency=low + + * Update to the py3k branch (20100919). + * Update GNU/Hurd patches (Pino Toscano). Closes: #597320. + + -- Matthias Klose Sun, 19 Sep 2010 12:45:14 +0200 + +python3.2 (3.2~a2-5) experimental; urgency=low + + * Update to the py3k branch (20100916). + * Provide Lib/plat-gnukfreebsd[78] (Jakub Wilk). Addresses: #593818. + * Assume working semaphores, don't rely on running kernel for the check. + LP: #630511. + + -- Matthias Klose Thu, 16 Sep 2010 14:41:58 +0200 + +python3.2 (3.2~a2-4) experimental; urgency=low + + * Update to the py3k branch (20100911). + * Add the sysconfig module to python3.2-minimal. + * Remove dist-packages/README. + * Make xargs --show-limits in the maintainer scripts independent from + the locale. + + -- Matthias Klose Sat, 11 Sep 2010 20:59:47 +0200 + +python3.2 (3.2~a2-3) experimental; urgency=low + + * Update to the py3k branch (20100910). + * Disable profile feedback based optimization on armel. + * Add copyright information for expat, libffi and zlib. Sources + for the wininst-* files are in PC/bdist_wininst. Closes: #596276. + * Run the testsuite in parallel, when parallel= is set in DEB_BUILD_OPTIONS. + + -- Matthias Klose Fri, 10 Sep 2010 20:28:16 +0200 + +python3.2 (3.2~a2-2) experimental; urgency=low + + * Fix distutils.sysconfig.get_makefile_name for debug builds. + + -- Matthias Klose Thu, 09 Sep 2010 02:40:11 +0200 + +python3.2 (3.2~a2-1) experimental; urgency=low + + * Python 3.2 alpha2 release. + * Update to the py3k branch (20100908). + * Provide /usr/lib/python3/dist-packages as location for public python + packages. + + -- Matthias Klose Wed, 08 Sep 2010 17:36:06 +0200 + +python3.2 (3.2~a1-1) experimental; urgency=low + + * Python 3.2 alpha1 release. + - Files removed: Lib/profile.py, Lib/pstats.py, PC/icons/source.xar. + * Update to the py3k branch (20100827). + * Fix detection of ffi.h header file. Closes: #591408. + * python3.1-dev: Depend on libssl-dev. LP: #611845. + + -- Matthias Klose Fri, 27 Aug 2010 21:40:31 +0200 + +python3.2 (3.2~~20100707-0ubuntu1) maverick; urgency=low + + * Move the pkgconfig file into the -dev package. + * Update preremoval scripts for __pycache__ layout. + * Run hooks from /usr/share/python3/runtime.d/ + * Update distutils-install-layout and debug-build patches. + + -- Matthias Klose Wed, 07 Jul 2010 12:38:52 +0200 + +python3.2 (3.2~~20100706-0ubuntu1) maverick; urgency=low + + * Test build, taken from the py3k branch (20100706). + * Merge with the python3.1 packaging. + + -- Matthias Klose Tue, 06 Jul 2010 17:10:51 +0200 + +python3.2 (3.2~~20100704-0ubuntu1) maverick; urgency=low + + * Test build, taken from the py3k branch (20100704). + + -- Matthias Klose Sun, 04 Jul 2010 16:04:45 +0200 + +python3.2 (3.2~~20100421-0ubuntu1) lucid; urgency=low + + * Test build, taken from the py3k branch (20100421). + + -- Matthias Klose Wed, 21 Apr 2010 22:04:14 +0200 + +python3.1 (3.1.2+20100703-1) unstable; urgency=low + + * Update to the 3.1 release branch, 20100703. + * Convert internal dpatch system to quilt. + * Update module list for python3-minimal. + + -- Matthias Klose Sat, 03 Jul 2010 14:18:18 +0200 + +python3.1 (3.1.2-3) unstable; urgency=low + + * Update to the 3.1 release branch, 20100508. + * Fix backport of issue #8140. Closes: #578896. + + -- Matthias Klose Sat, 08 May 2010 15:37:35 +0200 + +python3.1 (3.1.2-2) unstable; urgency=low + + * Update to the 3.1 release branch, 20100421. + * Update patch for issue #8032, gdb7 hooks for debugging. + * Fix issue #8233: When run as a script, py_compile.py optionally + takes a single argument `-`. + * Don't build-depend on locales on avr32. + + -- Matthias Klose Wed, 21 Apr 2010 21:12:37 +0200 + +python3.1 (3.1.2-1) unstable; urgency=low + + * Python 3.1.2 release. + * Fix issue #4961: Inconsistent/wrong result of askyesno function in + tkMessageBox with Tcl8.5. LP: #462950. + * Don't complain when /usr/local is not writable on installation. + * Apply proposed patch for issue #8032, gdb7 hooks for debugging. + + -- Matthias Klose Sun, 21 Mar 2010 17:59:49 +0100 + +python3.1 (3.1.2~rc1-2) unstable; urgency=low + + * Update to the 3.1 release branch, 20100316. + * Backport issue #8140: Extend compileall to compile single files. + Add -i option. + + -- Matthias Klose Tue, 16 Mar 2010 02:38:45 +0100 + +python3.1 (3.1.2~rc1-1) unstable; urgency=low + + * Python 3.1.2 release candidate 1. + - Replace the Monty Python audio test file. Closes: #568676. + * Build using libdb4.8-dev. Only used for the dbm extension; the bsddb3 + extension isn't built from the core packages anymore. + + -- Matthias Klose Thu, 11 Mar 2010 17:26:17 +0100 + +python3.1 (3.1.1-3) unstable; urgency=low + + * Update to the 3.1 release branch, 20100119. + * Hurd fixes (Pino Toscano): + - hurd-broken-poll.dpatch: ported from 2.5. + - hurd-disable-nonworking-constants.dpatch: disable a few constants from + the public API whose C counterparts are not implemented, so using them + either always blocks or always fails (caused issues in the test suite). + - hurd-path_max.dpatch (hurd only): change few PATH_MAX occurrences to + MAXPATHLEN (which is defined by the python lib if not defined by the OS). + - cthreads.dpatch: Refresh. + - Exclude the profiled build for hurd. + - Disable six blocking tests from the test suite. + * Don't run the testsuite on armel and hppa until someone figures out + the blocking tests. + + -- Matthias Klose Tue, 19 Jan 2010 22:02:14 +0100 + +python3.1 (3.1.1-2) unstable; urgency=low + + * Update to the 3.1 release branch, 20100116. + * Fix bashism in makesetup shell script. Closes: #530170, #530171. + * Fix build issues on avr (Bradley Smith). Closes: #528439. + - Configure --without-ffi. + - Don't run lengthly tests. + + -- Matthias Klose Sat, 16 Jan 2010 23:28:05 +0100 + +python3.1 (3.1.1-1) experimental; urgency=low + + * Python 3.1.1 final release. + * Update to the 3.1 release branch, 20091011. + * Remove /usr/local/lib/python3.1 on package removal, if empty. + * Build _hashlib as a builtin. LP: #445530. + * python3.1-doc: Don't compress the sphinx inventory. + * python3.1-doc: Fix jquery.js symlink. LP: #447370. + * Run the benchmark with -C 2 -n 5 -w 4 on all architectures. + * python3.1-dbg: Don't create debug subdirectory in /usr/local. No + separate debug directory needed anymore. + * Fix title of devhelp document. LP: #423551. + + -- Matthias Klose Sun, 11 Oct 2009 22:01:57 +0200 + +python3.1 (3.1-1) experimental; urgency=low + + * Python 3.1 final release. + * Update to the 3.1 release branch, 20090723. + * Add explicit build dependency on tk8.5-dev. + + -- Matthias Klose Thu, 23 Jul 2009 15:20:35 +0200 + +python3.1 (3.1-0ubuntu2) karmic; urgency=low + + * Disable profile feedback based optimization on amd64 (GCC + PR gcov-profile/38292). + + -- Matthias Klose Fri, 24 Jul 2009 16:27:22 +0200 + +python3.1 (3.1-0ubuntu1) karmic; urgency=low + + * Python 3.1 final release. + * Update to the 3.1 release branch, 20090723. + * Add explicit build dependency on tk8.5-dev. + + -- Matthias Klose Thu, 23 Jul 2009 18:52:17 +0200 + +python3.1 (3.1~rc2+20090622-1) experimental; urgency=low + + [Matthias Klose] + * Python 3.1 rc2 release. Closes: #529320. + * Update to the trunk, 20090622, remove patches integrated upstream. + * Configure with --with-fpectl --with-dbmliborder=bdb --with-wide-unicode. + NOTE: The --with-wide-unicode configuration will break most extensions + built with 3.1~a1, but is consistent with python2.x configurations. + * Add symbols files for libpython3.1 and python3.1-dbg, don't include symbols + from builtins, which can either be built as builtins or extensions. + * Keep an empty lib-dynload in python3.1-minimal to avoid a warning on + startup. + * python3.1-doc: Depend on libjs-jquery, use jquery.js from this package. + Closes: #523485. + * Do not add /usr/lib/pythonXY.zip on sys.path. + * Add symbols files for libpython3.1 and python3.1-dbg, don't include symbols + from builtins, which can either be built as builtins or extensions. + * Keep an empty lib-dynload in python3.1-minimal to avoid a warning on + startup. + * Fix some lintian warnings. + * Use the information in /etc/lsb-release for platform.dist(). LP: #196526. + * Move the bdist_wininst files into the -dev package (only needed to build + windows installers). + * Document changes to the site directory name in the installation manual. + * Don't build a profiled binary. Closes: #521811. + + * Address issues when working with PYTHONUSERBASE and non standard prefix + (pointed out by Larry Hastings): + - distutils.sysconfig.get_python_lib(): Only return ".../dist-packages" if + prefix is the default prefix and if PYTHONUSERBASE is not set in the + environment. + - site.addusersitepackages(): Add USER_BASE/.../dist-packages to sys.path. + * Always use the `unix_prefix' scheme for setup.py install in a virtualenv + setup. LP: #339904. + * Don't make the setup.py install options --install-layout=deb and --prefix + conflict with each other. + * distutils: Always install into `/usr/local/lib/python3.1/dist-packages' + if an option `--prefix=/usr/local' is present (except for virtualenv + and PYTHONUSERBASE installations). LP: #362570. + * Always use `site-packages' as site directory name in virtualenv. + + [Marc Deslauriers] + * debian/pyhtml2devhelp.py: update for sphinx generated documentation. + * debian/rules: re-enable documentation files for devhelp. + + -- Matthias Klose Mon, 22 Jun 2009 16:18:39 +0200 + +python3.1 (3.1~a1+20090322-1) experimental; urgency=low + + * Python 3.1 alpha1 release. + * Update to the trunk, 20090322. + * Update installation schemes: LP: #338395. + - When the --prefix option is used for setup.py install, Use the + `unix_prefix' scheme. + - Use the `deb_system' scheme if --install-layout=deb is specified. + - Use the the `unix_local' scheme if neither --install-layout=deb + nor --prefix is specified. + * Use the information in /etc/lsb-release for platform.dist(). LP: #196526. + * pydoc: Fix detection of local documentation files. + * Build a shared library configured --with-pydebug. LP: #322580. + * Fix some lintian warnings. + + -- Matthias Klose Mon, 23 Mar 2009 00:01:27 +0100 + +python3.1 (3.1~~20090226-1) experimental; urgency=low + + * Python-3.1 snapshot (20090226), upload to experimental. + + -- Matthias Klose Thu, 26 Feb 2009 16:18:41 +0100 + +python3.1 (3.1~~20090222-0ubuntu1) jaunty; urgency=low + + * Python-3.1 snapshot (20090222). + * Build the _dbm extension using the Berkeley DB backend. + + -- Matthias Klose Sun, 22 Feb 2009 12:58:58 +0100 + +python3.0 (3.0.1-0ubuntu4) jaunty; urgency=low + + * Don't build-depend on locales on sparc. Currently not installable. + + -- Matthias Klose Sun, 22 Feb 2009 12:48:38 +0100 + +python3.0 (3.0.1-0ubuntu3) jaunty; urgency=low + + * Update to 20090222 from the release30-maint branch. + + -- Matthias Klose Sun, 22 Feb 2009 11:09:58 +0100 + +python3.0 (3.0.1-0ubuntu2) jaunty; urgency=low + + * Allow docs to be built with Sphinx 0.5.x. + + -- Matthias Klose Tue, 17 Feb 2009 12:58:02 +0100 + +python3.0 (3.0.1-0ubuntu1) jaunty; urgency=low + + * New upstream version. + + -- Matthias Klose Mon, 16 Feb 2009 17:18:23 +0100 + +python3.0 (3.0-0ubuntu2) jaunty; urgency=low + + * Update to 20090213 from the release30-maint branch. + + -- Matthias Klose Fri, 13 Feb 2009 15:49:12 +0100 + +python3.0 (3.0-0ubuntu1) jaunty; urgency=low + + * Final Python-3.0 release. + + -- Matthias Klose Thu, 04 Dec 2008 09:00:09 +0100 + +python3.0 (3.0~rc3-0ubuntu4) jaunty; urgency=low + + * Update to 20081127 from the py3k branch. + * Ensure that all extensions from the -minimal package are statically + linked into the interpreter. LP: #301597. + * Include expat, _elementtree, datetime in -minimal to link + these extensions statically. + + -- Matthias Klose Thu, 27 Nov 2008 08:49:02 +0100 + +python3.0 (3.0~rc3-0ubuntu3) jaunty; urgency=low + + * Ignore errors when running the profile task. + + -- Matthias Klose Sun, 23 Nov 2008 15:50:17 +0100 + +python3.0 (3.0~rc3-0ubuntu2) jaunty; urgency=low + + * Don't run test_ioctl on the buildd, before the buildd chroot is fixed: + Unable to open /dev/tty. + + -- Matthias Klose Sun, 23 Nov 2008 15:28:02 +0100 + +python3.0 (3.0~rc3-0ubuntu1) jaunty; urgency=low + + * Update to the python-3.0 release candidate 3. + + -- Matthias Klose Sun, 23 Nov 2008 13:14:20 +0100 + +python3.0 (3.0~rc1+20081027-0ubuntu1) intrepid; urgency=low + + * Update to 20081027 from the py3k branch. LP: #279227. + * Fix typos and section names in doc-base files. LP: #273344. + * Build a new package libpython3.0. + * For locally installed packages, create a directory + /usr/local/lib/python3.0/dist-packages. This is the default for + installations done with distutils and setuptools. Third party stuff + packaged within the distribution goes to /usr/lib/python3.0/dist-packages. + There is no /usr/lib/python3.0/site-packages in the file system and + on sys.path. No package within the distribution must not install + anything in this location. + * distutils: Add an option --install-layout=deb, which + - installs into $prefix/dist-packages instead of $prefix/site-packages. + - doesn't encode the python version into the egg name. + + -- Matthias Klose Mon, 27 Oct 2008 23:38:42 +0100 + +python3.0 (3.0~b3+20080915-0ubuntu1) intrepid; urgency=low + + * Update to 20080915 from the py3k branch. + * Build gdbm + + -- Matthias Klose Mon, 15 Sep 2008 23:56:44 +0200 + +python3.0 (3.0~b3-0ubuntu1~ppa1) intrepid; urgency=low + + * Python 3.0 beta3 release. + + -- Matthias Klose Sun, 24 Aug 2008 03:49:26 +0200 + +python3.0 (3.0~b2-0ubuntu1~ppa1) intrepid; urgency=low + + * Python 3.0 beta2 release. + + -- Matthias Klose Thu, 07 Aug 2008 14:57:02 +0000 + +python3.0 (3.0~b1-0ubuntu1~ppa1) intrepid; urgency=low + + * Python 3.0 beta1 release. + + -- Matthias Klose Tue, 15 Jul 2008 16:10:52 +0200 + +python3.0 (3.0~a5+0530-0ubuntu1) intrepid; urgency=low + + * Update to snapshot taken from the py3k branch. + + -- Matthias Klose Thu, 29 May 2008 15:50:55 +0200 + +python3.0 (3.0~a1-0ubuntu2) gutsy; urgency=low + + * Disable running the benchmark. + + -- Matthias Klose Fri, 31 Aug 2007 23:22:34 +0000 + +python3.0 (3.0~a1-0ubuntu1) gutsy; urgency=low + + * First Python-3.0 alpha release. + + -- Matthias Klose Fri, 31 Aug 2007 21:26:21 +0200 + +python2.6 (2.6~alpha~pre1-~0ubuntu1~ppa1) gutsy; urgency=low + + * Snapshot build, an "how to use tilde in version numbers" upload. + * SVN 20070831. + + -- Matthias Klose Fri, 31 Aug 2007 15:56:09 +0200 + +python2.5 (2.5.2-4) unstable; urgency=low + + * Update to 20080427, taken from the 2.5 release branch. + - Fix issues #2670, #2682. + * Disable running pybench on the hppa buildd (ftbfs). + * Allow setting BASECFLAGS, OPT and EXTRA_LDFLAGS (like, CC, CXX, CPP, + CFLAGS, CPPFLAGS, CCSHARED, LDSHARED) from the environment. + * Support parallel= in DEB_BUILD_OPTIONS (see #209008). + + -- Matthias Klose Sun, 27 Apr 2008 10:40:51 +0200 + +python2.5 (2.5.2-3) unstable; urgency=medium + + * Update to 20080416, taken from the 2.5 release branch. + - Fix CVE-2008-1721, integer signedness error in the zlib extension module. + - Fix urllib2 file descriptor happens byte-at-a-time, reverting + a fix for excessively large memory allocations when calling .read() + on a socket object wrapped with makefile(). + * Disable some regression tests on some architectures: + - arm: test_compiler, test_ctypes. + - armel: test_compiler. + - hppa: test_fork1, test_wait3. + - m68k: test_bsddb3, test_compiler. + * Build-depend on libffi-dev instead of libffi4-dev. + * Fix CVE-2008-1679, integer overflows in the imageop module. + + -- Matthias Klose Wed, 16 Apr 2008 23:37:46 +0200 + +python2.5 (2.5.2-2) unstable; urgency=low + + * Use site.addsitedir() to add directories in /usr/local to sys.path. + Addresses: #469157, #469818. + + -- Matthias Klose Sat, 08 Mar 2008 16:11:23 +0100 + +python2.5 (2.5.2-1) unstable; urgency=low + + * Python 2.5.2 release. + * Merge from Ubuntu: + - Move site customization into sitecustomize.py, don't make site.py + a config file. Addresses: #309719, #413172, #457361. + - Move site.py to python2.4-minimal, remove `addbuilddir' from site.py, + which is unnecessary for installed builds. + - python2.5-dev: Recommend libc-dev instead of suggesting it. LP: #164909. + - Fix issue 961805, Tk Text.edit_modified() fails. LP: #84720. + + -- Matthias Klose Thu, 28 Feb 2008 23:18:52 +0100 + +python2.5 (2.5.1-7) unstable; urgency=low + + * Update to 20080209, taken from the 2.5 release branch. + * Build the _bsddb extension with db-4.5 again; 4.6 is seriously + broken when used with the _bsddb extension. + * Do not run pybench on arm and armel. + * python2.5: Provide python2.5-wsgiref. + * Fix a pseudo RC report with duplicated attributes in the control + file. Closes: #464307. + + -- Matthias Klose Sun, 10 Feb 2008 00:22:57 +0100 + +python2.5 (2.5.1-6) unstable; urgency=low + + * Update to 20080102, taken from the 2.5 release branch. + - Only define _BSD_SOURCE on OpenBSD systems. Closes: #455400. + * Fix handling of packages in linecache.py (Kevin Goodsell). LP: #70902. + * Bump debhelper to v5. + * Register binfmt for .py[co] files. + * Use absolute paths when byte-compiling files. Addresses: #453346. + Closes: #413566, LP: #177722. + * CVE-2007-4965, http://bugs.python.org/issue1179: + Multiple integer overflows in the imageop module in Python 2.5.1 and + earlier allow context-dependent attackers to cause a denial of service + (application crash) and possibly obtain sensitive information (memory + contents) via crafted arguments to (1) the tovideo method, and unspecified + other vectors related to (2) imageop.c, (3) rbgimgmodule.c, and other + files, which trigger heap-based buffer overflows. + Patch prepared by Stephan Herrmann. Closes: #443333, LP: #163845. + * Register info docs when doing source only uploads. LP: #174786. + * Remove deprecated value from categories in desktop file. LP: #172874. + * python2.5-dbg: Don't include the gdbm and _tkinter extensions, now provided + in separate packages. + * Provide a symlink changelog -> NEWS. Closes: #439271. + * Fix build failure on hurd, working around poll() on systems on which it + returns an error on invalid FDs. Closes: #438914. + * Configure --with-system-ffi on all architectures. Closes: #448520. + * Fix version numbers in copyright and README files (Dan O'Huiginn). + Closes: #446682. + * Move some documents from python2.5 to python2.5-dev. + + -- Matthias Klose Wed, 02 Jan 2008 22:22:19 +0100 + +python2.5 (2.5.1-5) unstable; urgency=low + + * Build the _bsddb extension with db-4.6. + + -- Matthias Klose Fri, 17 Aug 2007 00:39:35 +0200 + +python2.5 (2.5.1-4) unstable; urgency=low + + * Update to 20070813, taken from the 2.5 release branch. + * Include plat-mac/plistlib.py (plat-mac is not in sys.path by default. + Closes: #435826. + * Use emacs22 to build the documentation in info format. Closes: #434969. + * Build-depend on db-dev (>= 4.6). Closes: #434965. + + -- Matthias Klose Mon, 13 Aug 2007 22:22:44 +0200 + +python2.5 (2.5.1-3) unstable; urgency=high + + * Support mixed-endian IEEE floating point, as found in the ARM old-ABI + (Aurelien Jarno). Closes: #434905. + + -- Matthias Klose Fri, 27 Jul 2007 20:01:35 +0200 + +python2.5 (2.5.1-2) unstable; urgency=low + + * Update to 20070717, taken from the 2.5 release branch. + * Fix reference count for sys.pydebug variable. Addresses: #431393. + * Build depend on libbluetooth-dev instead of libbluetooth2-dev. + + -- Matthias Klose Tue, 17 Jul 2007 14:09:47 +0200 + +python2.5 (2.5.1-1) unstable; urgency=low + + * Python-2.5.1 release. + * Build-depend on gcc-4.1 (>= 4.1.2-4) on alpha, powerpc, s390, sparc. + * Merge from Ubuntu: + - Add debian/patches/subprocess-eintr-safety.dpatch (LP: #87292): + - Create and use wrappers around read(), write(), and os.waitpid() in the + subprocess module which retry the operation on an EINTR (which happens + if e. g. an alarm was raised while the system call was in progress). + It is incredibly hard and inconvenient to sensibly handle this in + applications, so let's fix this at the right level. + - Patch based on original proposal of Peter <85>strand + in http://python.org/sf/1068268. + - Add two test cases. + - Change the interpreter to build and install python extensions + built with the python-dbg interpreter with a different name into + the same path (by appending `_d' to the extension name). The debug build + of the interpreter tries to first load a foo_d.so or foomodule_d.so + extension, then tries again with the normal name. + - When trying to import the profile and pstats modules, don't + exit, add a hint to the exception pointing to the python-profiler + package, don't exit. + - Keep the module version in the .egg-info name, only remove the + python version. + - python2.5-dbg: Install Misc/SpecialBuilds.txt, document the + debug changes in README.debug. + * Update to 20070425, taken from the 2.5 release branch. + + -- Matthias Klose Wed, 25 Apr 2007 22:12:50 +0200 + +python2.5 (2.5-6) unstable; urgency=medium + + * webbrowser.py: Recognize other browsers: www-browser, x-www-browser, + iceweasel, iceape. + * Move pyconfig.h from the python2.5-dev into the python2.5 package; + required by builds for pure python modules without having python2.5-dev + installed (matching the functionality in python2.4). + * Move the unicodedata module into python2.5-minimal; allows byte compilation + of UTF8 encoded files. + * Do not install anymore outdated debhelper sample scripts. + * Install Misc/SpecialBuilds.txt as python2.5-dbg document. + + -- Matthias Klose Wed, 21 Feb 2007 01:17:12 +0100 + +python2.5 (2.5-5) unstable; urgency=high + + * Do not run the python benchmark on m68k. Timer problems. + Fixes FTBFS on m68k. + * Update to 20061209, taken from the 2.5 release branch. + - Fixes building the library reference in info format. + + -- Matthias Klose Sat, 9 Dec 2006 13:40:48 +0100 + +python2.5 (2.5-4) unstable; urgency=medium + + * Update to 20061203, taken from the 2.5 release branch. + - Fixes build failures on knetfreebsd and the hurd. Closes: #397000. + * Clarify README about distutils. Closes: #396394. + * Move python2.5-config to python2.5-dev. Closes: #401451. + * Cleanup build-conflicts. Addresses: #394512. + + -- Matthias Klose Sun, 3 Dec 2006 18:22:49 +0100 + +python2.5 (2.5-3.1) unstable; urgency=low + + * Non-maintainer upload. + * python2.5-minimal depends on python-minimal (>= 2.4.4-1) because it's the + first version which lists python2.5 as an unsupported runtime (ie a + runtime that is available but for which modules are not auto-compiled). + And being listed there is required for python-central to accept the + installation of python2.5-minimal. Closes: #397006 + + -- Raphael Hertzog Wed, 22 Nov 2006 15:41:06 +0100 + +python2.5 (2.5-3) unstable; urgency=medium + + * Update to 20061029 (2.4.4 was released on 20061019), taken from + the 2.5 release branch. We do not want to have regressions in + 2.5 compared to the 2.4.4 release. + * Don't run pybench on m68k, fails in the calibration loop. Closes: #391030. + * Run the installation/removal hooks. Closes: #383292, #391036. + + -- Matthias Klose Sun, 29 Oct 2006 11:35:19 +0100 + +python2.5 (2.5-2) unstable; urgency=medium + + * Update to 20061003, taken from the 2.5 release branch. + * On arm and m68k, don't run the pybench in debug mode. + * Fix building the source within exec_prefix (Alexander Wirt). + Closes: #385336. + + -- Matthias Klose Tue, 3 Oct 2006 10:08:36 +0200 + +python2.5 (2.5-1) unstable; urgency=low + + * Python 2.5 release. + * Update to 20060926, taken from the 2.5 release branch. + * Run the Python benchmark during the build, compare the results + of the static and shared builds. + * Fix invalid html in python2.5.devhelp.gz. + * Add a python2.5 console entry to the menu (hidden by default). + * python2.5: Suggest python-profiler. + + -- Matthias Klose Tue, 26 Sep 2006 02:36:11 +0200 + +python2.5 (2.5~c1-1) unstable; urgency=low + + * Python 2.5 release candidate 1. + * Update to trunk 20060818. + + -- Matthias Klose Sat, 19 Aug 2006 19:21:05 +0200 + +python2.5 (2.5~b3-1) unstable; urgency=low + + * Build the _ctypes module for m68k-linux. + + -- Matthias Klose Fri, 11 Aug 2006 18:19:19 +0000 + +python2.5 (2.5~b3-0ubuntu1) edgy; urgency=low + + * Python 2.5 beta3 release. + * Update to trunk 20060811. + * Rebuild the documentation. + * Fix value of sys.exec_prefix in the debug build. + * Do not build the library reference in info format; fails to build. + * Link the interpreter against the shared runtime library. With + gcc-4.1 the difference in the pystones benchmark dropped from about + 12% to about 6%. + * Install the statically linked version of the interpreter as + python2.5-static for now. + * Link the shared libpython with -O1. + + -- Matthias Klose Thu, 10 Aug 2006 14:04:48 +0000 + +python2.5 (2.4.3+2.5b2-3) unstable; urgency=low + + * Disable the testsuite on s390; don't care about "minimally configured" + buildd's. + + -- Matthias Klose Sun, 23 Jul 2006 11:45:03 +0200 + +python2.5 (2.4.3+2.5b2-2) unstable; urgency=low + + * Update to trunk 20060722. + * Merge idle-lib from idle-python2.5 into python2.5. + * Merge lib-tk from python-tk into python2.5. + * Tkinter.py: Suggest installation of python-tk package on failed + import of the _tkinter extension. + * Don't run the testsuite for the debug build on alpha. + * Don't run the test_compiler test on m68k. Just takes too long. + * Disable building ctypes on m68k (requires support for closures). + + -- Matthias Klose Sat, 22 Jul 2006 22:26:42 +0200 + +python2.5 (2.4.3+2.5b2-1) unstable; urgency=low + + * Python 2.5 beta2 release. + * Update to trunk 20060716. + * When built on a buildd, do not run the following test which try to + access the network: test_codecmaps_cn, test_codecmaps_hk, test_codecmaps_jp, + test_codecmaps_kr, test_codecmaps_tw, test_normalization. + * When built on a buildd, do not run tests requiring missing write permissions: + test_ossaudiodev. + + -- Matthias Klose Sun, 16 Jul 2006 02:53:50 +0000 + +python2.5 (2.4.3+2.5b2-0ubuntu1) edgy; urgency=low + + * Python 2.5 beta2 release. + + -- Matthias Klose Thu, 13 Jul 2006 17:16:52 +0000 + +python2.5 (2.4.3+2.5b1-1ubuntu2) edgy; urgency=low + + * Fix python-dev dependencies. + * Update to trunk 20060709. + + -- Matthias Klose Sun, 9 Jul 2006 18:50:32 +0200 + +python2.5 (2.4.3+2.5b1-1ubuntu1) edgy; urgency=low + + * Python 2.5 beta1 release. + * Update to trunk 20060623. + * Merge changes from the python2.4 packages. + * python2.5-minimal: Add _struct. + + -- Matthias Klose Fri, 23 Jun 2006 16:04:46 +0200 + +python2.5 (2.4.3+2.5a1-1) experimental; urgency=low + + * Update to trunk 20060409. + * Run testsuite for debug build as well. + * Build-depend on gcc-4.1. + + -- Matthias Klose Sun, 9 Apr 2006 22:27:05 +0200 + +python2.5 (2.4.3+2.5a1-0ubuntu1) dapper; urgency=low + + * Python 2.5 alpha1 release. + * Drop integrated patches. + * Add build dependencies on libsqlite3-dev and libffi4-dev. + * Add (build-)dependency on mime-support, libgpmg1 (test suite). + * Build using the system FFI. + * python2.5 provides python2.5-ctypes and python2.5-pysqlite2, + python2.5-elementtree. + * Move hashlib.py to python-minimal. + * Lib/hotshot/pstats.py: Error out on missing profile/pstats modules. + + -- Matthias Klose Wed, 5 Apr 2006 14:56:15 +0200 + +python2.4 (2.4.3-8ubuntu1) edgy; urgency=low + + * Resynchronize with Debian unstable. Remaining changes: + - Apply langpack-gettext patch. + - diff.gz contains pregenerated html and info docs. + - Build the -doc package from this source. + + -- Matthias Klose Thu, 22 Jun 2006 18:39:57 +0200 + +python2.4 (2.4.3-8) unstable; urgency=low + + * Remove python2.4's dependency on python-central. On installation of + the runtime, call hooks /usr/share/python/runtime.d/*.rtinstall. + On removal, call hooks /usr/share/python/runtime.d/*.rtremove. + Addresses: #372658. + * Call the rtinstall hooks only, if it's a new installation, or the first + installation using the hooks. Adresses: #373677. + + -- Matthias Klose Sun, 18 Jun 2006 00:56:13 +0200 + +python2.4 (2.4.3-7) unstable; urgency=medium + + * Reupload, depend on python-central (>= 0.4.15). + * Add build-conflict on python-xml. + + -- Matthias Klose Wed, 14 Jun 2006 18:56:57 +0200 + +python2.4 (2.4.3-6) medium; urgency=low + + * idle-python2.4: Remove the old postinst and prerm scripts. + * Name the runtime correctly in python2.4-minimal's installation + scripts. + + -- Matthias Klose Mon, 12 Jun 2006 17:39:56 +0000 + +python2.4 (2.4.3-5) unstable; urgency=low + + * python2.4-prerm: Handle the case, when python-central is not installed. + * idle-python2.4: Depend on python-tk instead of python2.4-tk. + + -- Matthias Klose Fri, 9 Jun 2006 05:17:17 +0200 + +python2.4 (2.4.3-4) unstable; urgency=low + + * SVN update up to 2006-06-07 + * Use python-central. + * Don't build the -tk and -gdbm packages from this source; now built + from the python-stdlib-extensions source. + * Remove leftover build dependency on libgmp3-dev. + * Do not build-depend on libbluetooth1-dev and libgpmg1-dev on + hurd-i386, kfreebsd-i386, kfreebsd-amd64. Closes: #365830. + * Do not run the test_tcl test; hangs for unknown reasons on at least + the following buildds: vivaldi(m68k), goedel (alpha), mayer (mipsel). + And no virtual package to file bug reports for the buildds ... + Closes: #364419. + * Move the Makefile from python2.4-dev to python2.4. Closes: #366473. + * Fix typo in pdb(1). Closes: #365772. + * New autoconf likes the mandir in /usr/share instead of /usr; work + with both locations. Closes: #367618. + + -- Matthias Klose Wed, 7 Jun 2006 21:37:20 +0200 + +python2.4 (2.4.3-3) unstable; urgency=low + + * SVN update up to 2006-04-21 + * Update locale aliases from /usr/share/X11/locale/locale.alias. + * Start idle with option -n from the desktop menu, so that the program + can be started in parallel. + * Testsuite related changes only: + - Add build dependencies mime-support, libgpmg1 (needed by test cases). + - Run the testsuite with bsddb, audio and curses resources enabled. + - Re-run the failed tests in verbose mode. + - Run the test suite for the debug build as well. + - Build depend on netbase, needed by test_socketmodule. + - Build depend on libgpmg1, needed by test_curses. + - On the buildds do not run the tests needing the network resource. + * Update python logo. + * Check for the availability of the profile and pstats modules when + importing hotshot.pstats. Closes: #334067. + * Don't build the -doc package from the python2.4 source. + * Set OPT in the installed Makefile to -O2. + + -- Matthias Klose Fri, 21 Apr 2006 19:58:43 +0200 + +python2.4 (2.4.3-2) unstable; urgency=low + + * Add (build-)dependency on mime-support. + + -- Matthias Klose Tue, 4 Apr 2006 22:21:41 +0200 + +python2.4 (2.4.3-1) unstable; urgency=low + + * Python 2.4.3 release. + + -- Matthias Klose Thu, 30 Mar 2006 23:42:37 +0200 + +python2.4 (2.4.3-0ubuntu1) dapper; urgency=low + + * Python 2.4.3 release. + - Fixed a bug that the gb18030 codec raises RuntimeError on encoding + surrogate pair area on UCS4 build. Ubuntu: #29289. + + -- Matthias Klose Thu, 30 Mar 2006 10:57:32 +0200 + +python2.4 (2.4.2+2.4.3c1-0ubuntu1) dapper; urgency=low + + * SVN update up to 2006-03-25 (2.4.3 candidate 1). + - Regenerate the documentation. + + -- Matthias Klose Mon, 27 Mar 2006 12:03:05 +0000 + +python2.4 (2.4.2-1ubuntu3) dapper; urgency=low + + * SVN update up to 2006-03-04 + - Regenerate the documentation. + - map.mmap(-1, size, ...) can return anonymous memory again on Unix. + Ubuntu #26201. + * Build-depend on libncursesw5-dev, ncursesw5 is preferred for linking. + Provides UTF-8 compliant curses bindings. + * Fix difflib where certain patterns of differences were making difflib + touch the recursion limit. + + -- Matthias Klose Sat, 4 Mar 2006 21:38:24 +0000 + +python2.4 (2.4.2-1ubuntu2) dapper; urgency=low + + * SVN update up to 2006-01-17 + - pwd is now a builtin module, remove it from python-minimal. + - Regenerate the documentation. + * python2.4-tk: Suggest tix instead of tix8.1. + * Move config/Makefile from the -dev package into the runtime package + to be able to use the bdist_wininst distutils command. Closes: #348335. + + -- Matthias Klose Tue, 17 Jan 2006 11:02:24 +0000 + +python2.4 (2.4.2-1ubuntu1) dapper; urgency=low + + * Temporarily remove build dependency on lsb-release. + + -- Matthias Klose Sun, 20 Nov 2005 17:40:18 +0100 + +python2.4 (2.4.2-1build1) dapper; urgency=low + + * Rebuild (openssl-0.9.8). + + -- Matthias Klose Sun, 20 Nov 2005 15:27:24 +0000 + +python2.4 (2.4.2-1) unstable; urgency=low + + * Python 2.4.2 release. + + -- Matthias Klose Thu, 29 Sep 2005 01:49:28 +0200 + +python2.4 (2.4.1+2.4.2rc1-1) unstable; urgency=low + + * Python 2.4.2 release candidate 1. + * Fix "Fatal Python error" from cStringIO's writelines. + Patch by Andrew Bennetts. + + -- Matthias Klose Thu, 22 Sep 2005 10:33:22 +0200 + +python2.4 (2.4.1-5) unstable; urgency=low + + * CVS update up to 2005-09-14 + - Regenerate the html and info docs. + * Add some more locale aliases. + * Fix substitution pf python version in README.python2.4-minimal. + Closes: #327487. + * On m68k, build using -O2 (closes: #326903). + * On Debian, don't configure --with-fpectl, which stopped working with + glibc-2.3.5. + + -- Matthias Klose Wed, 14 Sep 2005 17:32:56 +0200 + +python2.4 (2.4.1-4) unstable; urgency=low + + * CVS update up to 2005-09-04 + - teTeX 3.0 related fixes (closes: #322407). + - Regenerate the html and info docs. + * Add entry for IDLE in the Gnome menus. + * Don't build-depend on libbluetooth-dev on the Hurd (closes: #307037). + * Reenable the cthreads patch for the Hurd (closes: #307052). + + -- Matthias Klose Sun, 4 Sep 2005 18:31:42 +0200 + +python2.4 (2.4.1-3) unstable; urgency=low + + * Synchronise with Ubuntu: + - Build a python2.4-minimal package. + + -- Matthias Klose Tue, 12 Jul 2005 00:23:10 +0000 + +python2.4 (2.4.1-2ubuntu3) breezy; urgency=low + + * CVS update up to 2005-07-07 + * Regenerate the documentation. + + -- Matthias Klose Thu, 7 Jul 2005 09:21:28 +0200 + +python2.4 (2.4.1-2ubuntu2) breezy; urgency=low + + * CVS update up to 2005-06-15 + * Regenerate the documentation. + * Synchronize with Debian. Ubuntu 10485. + * idle-python2.4 enhances python2.4. Ubuntu 11562. + * README.Debian: Fix reference to the doc directory (closes: #311677). + + -- Matthias Klose Wed, 15 Jun 2005 08:56:57 +0200 + +python2.4 (2.4.1-2ubuntu1) breezy; urgency=low + + * Update build dependencies: + db4.2-dev -> db4.3-dev, + libreadline4-dev -> libreadline5-dev. + * python2.4-dev: Add missing templates to generate HTML docs. Ubuntu 11531. + + -- Matthias Klose Sun, 29 May 2005 00:01:05 +0200 + +python2.4 (2.4.1-2) unstable; urgency=low + + * Add the debug symbols for the python2.4, python2.4-gdbm + and python2.4-tk packages to the python2.4-dbg package. + * Add gdbinit example to doc directory. + + -- Matthias Klose Thu, 5 May 2005 11:12:32 +0200 + +python2.4 (2.4.1-1ubuntu2) breezy; urgency=low + + * Add the debug symbols for the python2.4, python2.4-minimal, python2.4-gdbm + and python2.4-tk packages to the python2.4-dbg package. Ubuntu 10261, + * Add gdbinit example to doc directory. + * For os.utime, use utimes(2), correctly working with glibc-2.3.5. + Ubuntu 10294. + + -- Matthias Klose Thu, 5 May 2005 09:06:07 +0200 + +python2.4 (2.4.1-1ubuntu1) breezy; urgency=low + + * Reupload as 2.4.1-1ubuntu1. + + -- Matthias Klose Thu, 14 Apr 2005 10:46:32 +0200 + +python2.4 (2.4.1-1) unstable; urgency=low + + * Python 2.4.1 release. + * Fix noise in python-doc installation/removal. + * New Python section for the info docs. + + -- Matthias Klose Wed, 30 Mar 2005 19:42:03 +0200 + +python2.4 (2.4.1-0) hoary; urgency=low + + * Python 2.4.1 release. + * Fix noise in python-doc installation/removal. + * New Python section for the info docs. + + -- Matthias Klose Wed, 30 Mar 2005 16:35:34 +0200 + +python2.4 (2.4+2.4.1rc2-2) unstable; urgency=low + + * Add the valgrind support file to /etc/python2.4 + * Build the -dbg package with -DPy_USING_MEMORY_DEBUGGER. + * Lib/locale.py: + - correctly parse LANGUAGE as a colon separated list of languages. + - prefer LC_ALL, LC_CTYPE and LANG over LANGUAGE to get the correct + encoding. + - Don't map 'utf8', 'utf-8' to 'utf', which is not a known encoding + for glibc. + * Fix two typos in python(1). Addresses: #300124. + + -- Matthias Klose Sat, 19 Mar 2005 21:50:14 +0100 + +python2.4 (2.4+2.4.1rc2-1) unstable; urgency=low + + * Python 2.4.1 release candidate 2. + * Build-depend on libbluetooth1-dev. + + -- Matthias Klose Sat, 19 Mar 2005 00:57:14 +0100 + +python2.4 (2.4dfsg-2) unstable; urgency=low + + * CVS update up to 2005-03-03 + + -- Matthias Klose Thu, 3 Mar 2005 22:22:16 +0100 + +python2.4 (2.4dfsg-1ubuntu4) hoary; urgency=medium + + * Move exception finalisation later in the shutdown process - this + fixes the crash seen in bug #1165761, taken from CVS. + * codecs.StreamReader: Reset codec when seeking. Ubuntu #6972. + * Apply fix for SF1124295, fixing an obscure bit of Zope's security machinery. + * distutils: Don't add standard library dirs to library_dirs + and runtime_library_dirs. On amd64, runtime paths pointing to /usr/lib64 + aren't recognized by dpkg-shlibdeps, and the packages containing these + libraries aren't added to ${shlibs:Depends}. + * Lib/locale.py: + - correctly parse LANGUAGE as a colon separated list of languages. + - prefer LC_ALL, LC_CTYPE and LANG over LANGUAGE to get the correct + encoding. + - Don't map 'utf8', 'utf-8' to 'utf', which is not a known encoding + for glibc. + * os.py: Avoid using items() in environ.update(). Fixes #1124513. + * Python/pythonrun.c: + * Build depend on locales, generate the locales needed for the + testsuite. + * Add build dependency on libbluetooth1-dev, adding some bluetooth + functionality to the socket module. + * Lib/test/test_sundry.py: Don't fail on import of profile & pstats, + which are separated out to the python-profiler package. + * Fix typos in manpage. + + -- Matthias Klose Tue, 29 Mar 2005 13:35:53 +0200 + + +python2.4 (2.4dfsg-1ubuntu3) hoary; urgency=low + + * debian/patches/langpack-gettext.dpatch: + - langpack support for python-gettext added + + -- Michael Vogt Tue, 1 Mar 2005 13:13:36 +0100 + +python2.4 (2.4dfsg-1ubuntu2) hoary; urgency=low + + * Revert 'essential' status on python2.4-minimal. This status on + on python-minimal is sufficient (Ubuntu #6392). + + -- Matthias Klose Wed, 9 Feb 2005 23:09:42 +0100 + +python2.4 (2.4dfsg-1ubuntu1) hoary; urgency=low + + * Resyncronise with Debian. + * Mark the python2.4-minimal package as 'essential'. + + -- Matthias Klose Wed, 9 Feb 2005 13:31:09 +0100 + +python2.4 (2.4dfsg-1) unstable; urgency=medium + + * Add licenses and acknowledgements for incorporated software in the + debian/copyright file (addresses: #293932). + * Replace md5 implementation with one having a DFSG conforming license. + * Remove the profile.py and pstats.py modules from the source package, + not having a DFSG conforming license. The modules can be found in + the python2.x-profile package in the non-free section. + Addresses: #293932. + * Add missing norwegian locales (Tollef Fog Heen). + * CVS updates of the release24-maint branch upto 2005-02-08 (date of + the Python 2.3.5 release). + + -- Matthias Klose Tue, 8 Feb 2005 19:13:10 +0100 + +python2.4 (2.4-7ubuntu1) hoary; urgency=low + + * Fix the name of the python-dbg man page. + * Resyncronise with Debian. + * Move more modules to -minimal (new code in copy.py requires these): + dis, inspect, opcode, token, tokenize. + + -- Matthias Klose Tue, 8 Feb 2005 19:13:10 +0100 + +python2.4 (2.4-7) unstable; urgency=medium + + * Add licenses and acknowledgements for incorporated software in the + debian/copyright file (addresses: #293932). + * Replace md5 implementation with one having a DFSG conforming license. + * Add missing norwegian locales (Tollef Fog Heen). + * CVS updates of the release24-maint branch upto 2005-02-08 (date of + the Python 2.3.5 release). + + -- Matthias Klose Tue, 8 Feb 2005 19:13:10 +0100 + +python2.4 (2.4-6) unstable; urgency=low + + * Build a python2.4-dbg package using --with-pydebug. Add a debug + directory /lib-dynload/debug to sys.path instead of + /lib-dynload und install the extension modules of the + debug build in this directory. + Change the module load path to load extension modules from other + site-packages/debug directories (for further details see the + README in the python2.4-dbg package). Closes: #5415. + * Apply the pydebug-path patch. The package was already built in -5. + + -- Matthias Klose Fri, 4 Feb 2005 22:15:13 +0100 + +python2.4 (2.4-5) unstable; urgency=high + + * Fix a flaw in SimpleXMLRPCServerthat can affect any XML-RPC servers. + This affects any programs have been written that allow remote + untrusted users to do unrestricted traversal and can allow them to + access or change function internals using the im_* and func_* attributes. + References: CAN-2005-0089. + * CVS updates of the release24-maint branch upto 2005-02-04. + + -- Matthias Klose Fri, 4 Feb 2005 08:12:10 +0100 + +python2.4 (2.4-4) unstable; urgency=medium + + * Update debian/copyright to the 2.4 license text (closes: #290898). + * Remove /usr/bin/smtpd.py (closes: #291049). + + -- Matthias Klose Mon, 17 Jan 2005 23:54:37 +0100 + +python2.4 (2.4-3ubuntu6) hoary; urgency=low + + * Use old-style dpatches instead of dpatch-run. + + -- Tollef Fog Heen Mon, 7 Feb 2005 15:58:05 +0100 + +python2.4 (2.4-3ubuntu5) hoary; urgency=low + + * Actually apply the patch as well (add to list of patches in + debian/rules) + + -- Tollef Fog Heen Sun, 6 Feb 2005 15:12:58 +0100 + +python2.4 (2.4-3ubuntu4) hoary; urgency=low + + * Add nb_NO and nn_NO locales to Lib/locale.py + + -- Tollef Fog Heen Sun, 6 Feb 2005 14:33:05 +0100 + +python2.4 (2.4-3ubuntu3) hoary; urgency=low + + * Fix a flaw in SimpleXMLRPCServerthat can affect any XML-RPC servers. + This affects any programs have been written that allow remote + untrusted users to do unrestricted traversal and can allow them to + access or change function internals using the im_* and func_* attributes. + References: CAN-2005-0089. + + -- Matthias Klose Wed, 2 Feb 2005 09:08:20 +0000 + +python2.4 (2.4-3ubuntu2) hoary; urgency=low + + * Build a python2.4-dbg package using --with-pydebug. Add a debug + directory /lib-dynload/debug to sys.path instead of + /lib-dynload und install the extension modules of the + debug build in this directory. + Change the module load path to load extension modules from other + site-packages/debug directories (for further details see the + README in the python2.4-dbg package). Closes: #5415. + * Update debian/copyright to the 2.4 license text (closes: #290898). + * Add operator and copy to the -minimal package. + + -- Matthias Klose Mon, 17 Jan 2005 23:19:47 +0100 + +python2.4 (2.4-3ubuntu1) hoary; urgency=low + + * Resynchronise with Debian. + * python2.4: Depend on the very same version of python2.4-minimal. + * Docment, that time.strptime currently cannot be used, if the + python-minimal package is installed without the python package. + + -- Matthias Klose Sun, 9 Jan 2005 19:35:48 +0100 + +python2.4 (2.4-3) unstable; urgency=medium + + * Build the fpectl module. + * Updated to CVS release24-maint 20050107. + + -- Matthias Klose Sat, 8 Jan 2005 19:05:21 +0100 + +python2.4 (2.4-2ubuntu5) hoary; urgency=low + + * Updated to CVS release24-maint 20050102. + * python-minimal: + - os.py: Use dict instead of UserDict, remove UserDict from -minimal. + - add pickle, threading, needed for subprocess module. + - optparse.py: conditionally import gettext, if not available, + define _ as the identity function. Patch taken from the trunk. + Avoids import of _locale, locale, gettext, copy, repr, itertools, + collections, token, tokenize. + - Add a build check to make sure that the minimal module list is + closed under dependency. + * Fix lintian warnings. + + -- Matthias Klose Sun, 2 Jan 2005 22:00:14 +0100 + +python2.4 (2.4-2ubuntu4) hoary; urgency=low + + * Add UserDict.py to the -minimal package, since os.py needs it. + + -- Colin Watson Thu, 30 Dec 2004 20:41:28 +0000 + +python2.4 (2.4-2ubuntu3) hoary; urgency=low + + * Add os.py and traceback.py to the -minimal package, get the list + of modules from the README. + + -- Matthias Klose Mon, 27 Dec 2004 08:20:45 +0100 + +python2.4 (2.4-2ubuntu2) hoary; urgency=low + + * Add compileall.py and py_compile.py to the -minimal package, not + just to the README ... + + -- Matthias Klose Sat, 25 Dec 2004 22:24:56 +0100 + +python2.4 (2.4-2ubuntu1) hoary; urgency=low + + * Separate the interpreter and a minimal subset of modules into + a python2.4-minimal package. See the README.Debian.gz in this + package. + * Move site.py to python2.4-minimal as well. + * Add documentation files for devhelp. + + -- Matthias Klose Sun, 19 Dec 2004 22:47:32 +0100 + +python2.4 (2.4-2) unstable; urgency=medium + + * Updated patch for #283108. Thanks to Jim Meyering. + + -- Matthias Klose Fri, 3 Dec 2004 17:00:16 +0100 + +python2.4 (2.4-1) unstable; urgency=low + + * Final 2.4 release. + * Flush stdout/stderr if closed (SF #1074011). + + -- Matthias Klose Wed, 1 Dec 2004 07:54:34 +0100 + +python2.4 (2.3.97-2) unstable; urgency=low + + * Don't run test_tcl, hanging on the buildds. + + -- Matthias Klose Fri, 19 Nov 2004 23:48:42 +0100 + +python2.4 (2.3.97-1) unstable; urgency=low + + * Python 2.4 Release Candidate 1. + + -- Matthias Klose Fri, 19 Nov 2004 21:27:02 +0100 + +python2.4 (2.3.96-1) experimental; urgency=low + + * Updated to CVS release24-maint 20041113. + * Build the docs in info format again. + + -- Matthias Klose Sat, 13 Nov 2004 21:21:10 +0100 + +python2.4 (2.3.95-2) experimental; urgency=low + + * Move distutils package from the python2.4-dev into the python2.4 + package. + + -- Matthias Klose Thu, 11 Nov 2004 22:56:14 +0100 + +python2.4 (2.3.95-1) experimental; urgency=low + + * Python 2.4 beta2 release. + + -- Matthias Klose Thu, 4 Nov 2004 23:43:47 +0100 + +python2.4 (2.3.94-1) experimental; urgency=low + + * Python 2.4 beta1 release. + + -- Matthias Klose Sat, 16 Oct 2004 08:33:57 +0200 + +python2.4 (2.3.93-1) experimental; urgency=low + + * Python 2.4 alpha3 release. + + -- Matthias Klose Fri, 3 Sep 2004 21:53:47 +0200 + +python2.4 (2.3.92-1) experimental; urgency=low + + * Python 2.4 alpha2 release. + + -- Matthias Klose Thu, 5 Aug 2004 23:53:18 +0200 + +python2.4 (2.3.91-1) experimental; urgency=low + + * Python 2.4 alpha1 release. + Highlights: http://www.python.org/2.4/highlights.html + + -- Matthias Klose Fri, 9 Jul 2004 17:38:54 +0200 + +python2.4 (2.3.90-1) experimental; urgency=low + + * Package HEAD branch (pre alpha ..). + + -- Matthias Klose Mon, 14 Jun 2004 23:19:57 +0200 + +python2.3 (2.3.4-1) unstable; urgency=medium + + * Final Python 2.3.4 Release. + * In the API docs, fix signature of PyModule_AddIntConstant (closes: #250826). + * locale.getdefaultlocale: don't fail with empty environment variables. + Closes: #249816. + * Include distutils/command/wininst.exe in -dev package (closes: #249006). + * Disable cthreads on the Hurd (Michael Banck). Closes: #247211. + * Add a note to pygettext(1), that this program is deprecated in favour + of xgettext, which now includes support for Python as well. + Closes: #246332. + + -- Matthias Klose Fri, 28 May 2004 22:59:42 +0200 + +python2.3 (2.3.3.91-1) unstable; urgency=low + + * Python 2.3.4 Release Candidate 1. + * Do not use the default namespace for attributes. Patch taken from the + 2.3 maintenance branch. + The xmllib module is obsolete. Use xml.sax instead. + * http://python.org/sf/945642 - fix nonblocking i/o with ssl socket. + + -- Matthias Klose Thu, 13 May 2004 21:24:52 +0200 + +python2.3 (2.3.3-7) unstable; urgency=low + + * Add a workaround for GNU libc nl_langinfo()'s returning NULL. + Closes: #239237. + Patch taken from 2.3 maintenance branch. + * threading.py: Remove calls to currentThread() in _Condition methods that + were side-effect. Side-effects were deemed unnecessary and were causing + problems at shutdown time when threads were catching exceptions at start + time and then triggering exceptions trying to call currentThread() after + gc'ed. Masked the initial exception which was deemed bad. + Closes: #195812. + * Properly support normalization of empty unicode strings. Closes: #239986. + Patch taken from 2.3 maintenance branch. + * README.maintainers: Add section where to find the documentation tools. + * Fix crash in pyexpat module (closes: #229281). + * For the Hurd, set the interpreters recursion limit to 930. + * Do not try to byte-compile the test files on installation; this + currently breaks the Hurd install. + + -- Matthias Klose Sat, 1 May 2004 07:50:46 +0200 + +python2.3 (2.3.3-6) unstable; urgency=low + + * Don't build the unversioned python{,-*} packages anymore. Now + built from the python-defaults package. + * Update to the proposed python-policy: byte-compile using -E. + * Remove python-elisp's dependency on emacs20 (closes: #232785). + * Don't build python-elisp from the python2.3 source anymore, + get it from python-mode.sf.net as a separate source package. + * python2.3-dev suggests libc-dev (closes: #231091). + * get LDSHARED and CCSHARED (like, CC, CXX, CPP, CFLAGS) from + the environment + * Set CXX in installed config/Makefile (closes: #230273). + + -- Matthias Klose Tue, 24 Feb 2004 07:07:51 +0100 + +python2.3 (2.3.3-5) unstable; urgency=low + + * Build-depend on libdb4.2-dev, instead of libdb4.1-dev. According + to the docs the file format is compatible. + + -- Matthias Klose Mon, 12 Jan 2004 10:37:45 +0100 + +python2.3 (2.3.3-4) unstable; urgency=low + + * Fix broken _bsddb module. setup.py picked up the wrong library. + + -- Matthias Klose Sun, 4 Jan 2004 11:30:00 +0100 + +python2.3 (2.3.3-3) unstable; urgency=low + + * Fix typo in patch (closes: #224797, #226064). + + -- Matthias Klose Sun, 4 Jan 2004 09:23:21 +0100 + +python2.3 (2.3.3-2) unstable; urgency=medium + + * Lib/email/Charset: use locale unaware function to lower case of locale + name (closes: #224797). + * Update python-mode to version from python-mode.sf.net. Fixes highlighting + problems (closes: #223520). + * Backport from mainline: Add IPV6_ socket options from RFCs 3493 and 3542. + + -- Matthias Klose Fri, 2 Jan 2004 14:03:26 +0100 + +python2.3 (2.3.3-1) unstable; urgency=low + + * New upstream release. + * Copy the templates, tools and scripts from the Doc dir in the source + to /usr/share/lib/python2.3/doc in the python2.3-dev package. Needed + for packages building documentation like python does (closes: #207337). + + -- Matthias Klose Fri, 19 Dec 2003 10:57:39 +0100 + +python2.3 (2.3.2.91-1) unstable; urgency=low + + * New upstream version (2.3.3 release candidate). + * Update python-mode.el (closes: #158811, #159630). + Closing unreproducible report (closes: #159628). + + -- Matthias Klose Sat, 6 Dec 2003 14:41:14 +0100 + +python2.3 (2.3.2-7) unstable; urgency=low + + * Put the conflict in the correct direction. python2.3 (2.3.2-6) doesn't + conflict with python (<= 2.3.2-5) but python (2.3.2-6) conflicts with + python2.3 (<= 2.3.2-5) (thanks to Brian May). Really closes #221791. + + -- Matthias Klose Fri, 21 Nov 2003 00:20:02 +0100 + +python2.3 (2.3.2-6) unstable; urgency=low + + * Add conflicts with older python{,2.3} packages to fix overwrite + errors (closes: #221791). + + -- Matthias Klose Thu, 20 Nov 2003 07:24:36 +0100 + +python2.3 (2.3.2-5) unstable; urgency=low + + * Updated to CVS release23-maint 20031119. + * Re-upgrade the dependency of python2.3 on python (>= 2.3) to + a dependency (closes: #221523). + + -- Matthias Klose Wed, 19 Nov 2003 00:30:27 +0100 + +python2.3 (2.3.2-4) unstable; urgency=low + + * Don't build-depend on latex2html (moved to non-free), but keep + the prebuilt docs in debian/patches (closes: #221347). + * Fix typos in the library reference (closes: #220510, #220954). + * Fix typo in python-elisp's autoloading code (closes: #220308). + * Update proposed python policy: private modules can be installed + into /usr/lib/ (arch dependent) and into /usr/share/ + (arch independent). + + -- Matthias Klose Tue, 18 Nov 2003 00:41:39 +0100 + +python2.3 (2.3.2-3) unstable; urgency=low + + * Downgrade the dependency of python2.3 on python (>= 2.3) to + a recommendation. + * Fix path to interpreter in binfmt file. + * Fix segfault in unicodedata module (closes: #218697). + * Adjust python-elisp autoload code (closes: #219821). + + -- Matthias Klose Sun, 9 Nov 2003 19:43:37 +0100 + +python2.3 (2.3.2-2) unstable; urgency=medium + + * Fix broken doc link (closes: #214217). + * Disable wrongly detected large file support for GNU/Hurd. + * Really fix the FTBFS for the binary-indep target (closes: #214303). + + -- Matthias Klose Mon, 6 Oct 2003 07:54:58 +0200 + +python2.3 (2.3.2-1) unstable; urgency=low + + * New upstream version. + * Fix a FTBFS for the binary-indep target. + + -- Matthias Klose Sat, 4 Oct 2003 10:20:15 +0200 + +python2.3 (2.3.1-3) unstable; urgency=low + + * Fix names of codec packages in recommends. + * On alpha compile using -mieee (see #212912). + + -- Matthias Klose Sun, 28 Sep 2003 10:48:12 +0200 + +python2.3 (2.3.1-2) unstable; urgency=low + + * Update python policy draft (closes: #128911, #163785). + * Re-add os.fsync function (closes: #212672). + * Let python2.3-doc conflict with older python2.3 versions (closes: #211882). + * Add recommends for pythonX.Y-japanese-codecs, pythonX.Y-iconvcodec, + pythonX.Y-cjkcodecs, pythonX.Y-korean-codecs (closes: #207161). + * Generate binfmt file (closes: #208005). + * Add IPPROTO_IPV6 option to the socketmodule (closes: #206569). + * Bugs reported against python2.2 and fixed in python2.3: + - Crashes in idle (closes: #186887, #200084). + + -- Matthias Klose Sat, 27 Sep 2003 11:21:47 +0200 + +python2.3 (2.3.1-1) unstable; urgency=low + + * New upstream version (bug fix release). + + -- Matthias Klose Wed, 24 Sep 2003 11:27:43 +0200 + +python2.3 (2.3-4) unstable; urgency=high + + * Disable check for utimes function, which is broken in glibc-2.3.2. + Packages using distutils had '1970/01/01-01:00:01' timestamps in files. + * Bugs fixed by making python2.3 the default python version: + - Canvas.scan_dragto() takes a 3rd optional parmeter "gain". + Closes: #158168. + - New command line parsing module (closes: #38628). + - compileall.py allows compiling single files (closes: #139971). + * Bugs reported for 2.2 and fixed in 2.3: + - Idle does save files with ASCII characters (closes: #179313). + - imaplib support for prefix-quoted strings (closes: #150485). + - posixpath includes getctime (closes: #173827). + - pydoc has support for keywords (closes: #186775). + * Bugs reported for 2.1 and fixed in 2.3: + - Fix handling of "#anchor" URLs in urlparse (closes: #147844). + - Fix readline if C stdin is not a tty, even if sys.stdin is. + Closes: #131810. + * Updated to CVS release23-maint 20030810 (fixing memory leaks in + array and socket modules). + * pydoc's usage output uses the basename of the script. + * Don't explicitely remove /etc/python2.3 on purge (closes: #202864). + * python conflicts with python-xmlbase (closes: #204773). + * Add dependency python (>= 2.3) to python2.3, so make sure the + unversioned names can be used. + + -- Matthias Klose Sun, 10 Aug 2003 09:27:52 +0200 + +python2.3 (2.3-3) unstable; urgency=medium + + * Fix shlibs file. + + -- Matthias Klose Fri, 8 Aug 2003 08:45:12 +0200 + +python2.3 (2.3-2) unstable; urgency=medium + + * Make python2.3 the default python version. + + -- Matthias Klose Tue, 5 Aug 2003 22:13:22 +0200 + +python2.3 (2.3-1) unstable; urgency=low + + * Python 2.3 final release. + + -- Matthias Klose Wed, 30 Jul 2003 08:12:28 +0200 + +python2.3 (2.2.107-1rc2) unstable; urgency=medium + + * Python 2.3 release candidate 2. + * Don't compress .txt files referenced by the html docs (closes: #200298). + * Include the email/_compat* files (closes: #200349). + + -- Matthias Klose Fri, 25 Jul 2003 07:08:09 +0200 + +python2.3 (2.2.106-2beta2) unstable; urgency=medium + + * Python 2.3 beta2 release, updated to CVS 20030704. + - Fixes AssertionError in httplib (closed: #192452). + - Fixes uncaught division by zero in difflib.py (closed: #199287). + * Detect presence of setgroups(2) at configure time (closes: #199839). + * Use default gcc on arm as well. + + -- Matthias Klose Sat, 5 Jul 2003 10:21:33 +0200 + +python2.3 (2.2.105-1beta2) unstable; urgency=low + + * Python 2.3 beta2 release. + - Includes merged idle fork. + - Fixed socket.setdefaulttimeout(). Closes: #189380. + - socket.ssl works with _socketobj. Closes: #196082. + * Do not link libtix to the _tkinter module. It's loaded via + 'package require tix' at runtime. python2.3-tkinter now + suggests tix8.1 instead. + * On arm, use gcc-3.2 to build. + * Add -fno-strict-aliasing rules to OPT to avoid warnings + "dereferencing type-punned pointer will break strict-aliasing rules", + when building with gcc-3.3. + + -- Matthias Klose Mon, 30 Jun 2003 00:19:32 +0200 + +python2.3 (2.2.104-1beta1.1) unstable; urgency=low + + * Non-maintainer upload with maintainer consent. + * debian/control (Build-Depends): s/libgdbmg1-dev/libgdbm-dev/. + + -- James Troup Wed, 4 Jun 2003 02:24:27 +0100 + +python2.3 (2.2.104-1beta1) unstable; urgency=low + + * Python 2.3 beta1 release, updated to CVS 20030514. + - build the current documentation. + * Reenable Tix support. + + -- Matthias Klose Wed, 14 May 2003 07:38:57 +0200 + +python2.3 (2.2.103-1beta1) unstable; urgency=low + + * Python 2.3 beta1 release, updated to CVS 20030506. + - updated due to build problems on mips/mipsel. + - keep the 2.3b1 documentation (doc build problems with cvs). + + -- Matthias Klose Wed, 7 May 2003 06:26:39 +0200 + +python2.3 (2.2.102-1beta1) unstable; urgency=low + + * Python 2.3 beta1 release. + + -- Matthias Klose Sat, 3 May 2003 22:45:16 +0200 + +python2.3 (2.2.101-1exp1) unstable; urgency=medium + + * Python 2.3 alpha2 release, updated to CVS 20030321. + * Tkinter: Catch exceptions thrown for undefined substitutions in + events (needed for tk 8.4.2). + + -- Matthias Klose Fri, 21 Mar 2003 21:32:14 +0100 + +python2.3 (2.2.100-1exp1) unstable; urgency=low + + * Python 2.3 alpha2 release, updated to CVS 20030221. + + -- Matthias Klose Fri, 21 Feb 2003 19:37:17 +0100 + +python2.3 (2.2.99-1exp1) unstable; urgency=low + + * Python 2.3 alpha1 release updated to CVS 20030123. + - should fix the testsuite (and package build) failure on alpha. + * Remove build dependency on libexpat1-dev. Merge the python2.3-xmlbase + package into python2.3 (closes: #177739). + + -- Matthias Klose Thu, 23 Jan 2003 22:48:12 +0100 + +python2.3 (2.2.98-1exp1) unstable; urgency=low + + * Python 2.3 alpha1 release updated to CVS 20030117. + * Build using libdb4.1. + + -- Matthias Klose Sat, 18 Jan 2003 00:14:01 +0100 + +python2.3 (2.2.97-1exp1) unstable; urgency=low + + * Python 2.3 alpha1 release updated to CVS 20030109. + * Build-Depend on g++ (>= 3:3.2). + * Python package maintainers: please wait uploading python dependent + packages until python2.2 and python2.1 are compiled using gcc-3.2. + + -- Matthias Klose Thu, 9 Jan 2003 23:56:42 +0100 + +python2.3 (2.2.96-1exp1) unstable; urgency=low + + * Python 2.3 alpha1 release (not exactly the tarball, but taken from + CVS 20030101). + - Includes support for linking with threaded tk8.4 (closes: #172714). + * Install and register whatsnew document (closes: #173859). + * Properly unregister info documentation. + + -- Matthias Klose Wed, 1 Jan 2003 17:38:54 +0100 + +python2.3 (2.2.95-1exp1) unstable; urgency=low + + * Experimental packages from CVS 021212. + - data in unicodedate module is up to date (closes: #171061). + * Fix idle packaging (closes: #170394). + * Configure using unicode UCS-4 (closes: #171062). + This change breaks compatibility with binary modules, but what do you + expect from experimental packages ... Please recompile dependent packages. + * Don't strip binaries for now. + + -- Matthias Klose Thu, 12 Dec 2002 21:42:27 +0100 + +python2.3 (2.2.94-1exp1) unstable; urgency=low + + * Experimental packages from CVS 021120. + * Remove outdated README.dbm. + * Depend on tk8.4. + * python-elisp: Install emacsen install file with mode 644 (closes: #167718). + + -- Matthias Klose Thu, 21 Nov 2002 01:04:51 +0100 + +python2.3 (2.2.93-1exp1) unstable; urgency=medium + + * Experimental packages from CVS 021015. + * Build a static library libpython2.3-pic.a. + * Enable large file support for the Hurd (closes: #164602). + + -- Matthias Klose Tue, 15 Oct 2002 21:06:27 +0200 + +python2.3 (2.2.92-1exp1) unstable; urgency=low + + * Experimental packages from CVS 020922. + * Fix build error on ia64 (closes: #161234). + * Build depend on gcc-3.2-3.2.1-0pre2 to fix build error on arm. + + -- Matthias Klose Sun, 22 Sep 2002 18:30:28 +0200 + +python2.3 (2.2.91-1exp1) unstable; urgency=low + + * Experimental packages from CVS 020906. + * idle-python2.3: Fix conflict (closes: #159267). + * Fix location of python-mode.el (closes: #159564, #159619). + * Use tix8.1. + * Apply fix for distutils/ccompiler problem (closes: #159288). + + -- Matthias Klose Sat, 7 Sep 2002 09:55:07 +0200 + +python2.3 (2.2.90-1exp1) unstable; urgency=low + + * Experimental packages from CVS 020820. + * Don't build python2.3-elisp, but put the latest version into + python-elisp. + + -- Matthias Klose Thu, 22 Aug 2002 21:52:04 +0200 + +python2.2 (2.2.1-6) unstable; urgency=low + + * CVS updates of the release22-maint branch upto 2002-07-23. + * Enable IPv6 support (closes: #152543). + * Add python2.2-tk suggestion for python2.2 (pydoc -g). + * Fix from SF patch #527518: proxy config with user+pass authentication. + * Point pydoc to the correct location of the docs (closes: #147579). + * Remove '*.py[co]' files, when removing the python package, + not when purging (closes: #147130). + * Update to new py2texi.el version (Milan Zamazal). + + -- Matthias Klose Mon, 29 Jul 2002 23:11:32 +0200 + +python2.2 (2.2.1-5) unstable; urgency=low + + * CVS updates of the release22-maint branch upto 2002-05-03. + * Build the info docs (closes: #145653). + + -- Matthias Klose Fri, 3 May 2002 22:35:46 +0200 + +python2.2 (2.2.1-4) unstable; urgency=high + + * Fix indentation errors introduced in last upload (closes: #143809). + + -- Matthias Klose Sun, 21 Apr 2002 01:00:14 +0200 + +python2.2 (2.2.1-3) unstable; urgency=high + + * Add Build-Conflicts: tcl8.0-dev, tk8.0-dev, tcl8.2-dev, tk8.2-dev. + Closes: #143534 (build a working _tkinter module, on machines, where + 8.0's tk.h gets included). + * CVS updates of the release22-maint branch upto 2002-04-20. + + -- Matthias Klose Sat, 20 Apr 2002 09:22:37 +0200 + +python2.2 (2.2.1-2) unstable; urgency=low + + * Forgot to copy the dlmodule patch from the 2.1.3 package. Really + closes: #141681. + + -- Matthias Klose Sat, 13 Apr 2002 01:28:05 +0200 + +python2.2 (2.2.1-1) unstable; urgency=high + + * Final 2.2.1 release. + * According to report #131813, the python interpreter is much faster on some + architectures, when beeing linked statically with the python library (25%). + Gregor and me tested on i386, m68k and alpha, but we could not reproduce + such a speedup (generally between 5% and 10%). But we are linking the + python executable now statically ... + * Build info docs from the tex source, merge the python-doc-info + package into the python-doc package. + * Always build the dl module. Failure in case of + sizeof(int)!=sizeof(long)!=sizeof(void*) + is delayed until dl.open is called. Closes: #141681. + + -- Matthias Klose Thu, 11 Apr 2002 00:19:19 +0200 + +python2.2 (2.2.0.92-0) unstable; urgency=low + + * Package CVS sources, omit cvs-updates.dpatch (closes: #140977). + + -- Matthias Klose Wed, 3 Apr 2002 08:20:52 +0200 + +python2.2 (2.2-6) unstable; urgency=medium + + * Update to python-2.2.1 release candidate 2 (final release scheduled + for April 10). + * Enable dl module (closes: #138992). + * Build doc files with python binary from package (closes: #139657). + * Build _tkinter module with BLT and Tix support. + * python2.2-elisp: Conflict with python2-elisp (closes: #138970). + * string.split docs updated in python-2.2.1 (closes: #129272). + + -- Matthias Klose Mon, 1 Apr 2002 13:52:36 +0200 + +python2.2 (2.2-5) unstable; urgency=low + + * CVS updates of the release22-maint branch upto 20020310 (aproaching + the first 2.2.1 release candidate). + * Stolen from HEAD: check argument of locale.nl_langinfo (closes: #137371). + + -- Matthias Klose Fri, 15 Mar 2002 01:05:59 +0100 + +python2.2 (2.2-4) unstable; urgency=medium + + * Include test/{__init__.py,README,pystone.py} in package (closes: #129013). + * Fix python-elisp conflict (closes: #129046). + * Don't compress stylesheets (closes: #133179). + * CVS updates of the release22-maint branch upto 20020310. + + -- Matthias Klose Sun, 10 Mar 2002 23:32:28 +0100 + +python2.2 (2.2-3) unstable; urgency=medium + + * Updates from the CVS python22-maint branch up to 20020107. + webbrowser.py: properly escape url's. + * The Hurd does not have large file support: disabled. + + -- Matthias Klose Mon, 7 Jan 2002 21:55:57 +0100 + +python2.2 (2.2-2) unstable; urgency=medium + + * CVS updates of the release22-maint branch upto 20011229. Fixes: + - Include TCP_CORK flag in plat-linux2 headers (fixes: #84340). + - Update CDROM.py module (fixes: #125785). + * Add missing chunk of the GNU/Hurd patch (therefore urgency medium). + * Send anonymous password when using anonftp (closes: #126814). + + -- Matthias Klose Sat, 29 Dec 2001 20:18:26 +0100 + +python2.2 (2.2-1) unstable; urgency=low + + * New upstream version: 2.2. + * Bugs fixed upstream: + - Docs for os.kill reference the signal module for constants. + - Documentation strings in the tutorial end with a period (closes: #94770). + - Tk: grid_location method moved from Grid to Misc (closes: #98338). + - mhlib.SubMessage.getbodytext takes decode parameter (closes: #31876). + - Strings in modules are locale aware (closes: #51444). + - Printable 8-bit characters in strings are correctly printed + (closes: #64354). + - Dictionary can be updated with abstract mapping object (closes: #46566). + * Make site.py a config files. + + -- Matthias Klose Sat, 22 Dec 2001 00:51:46 +0100 + +python2.2 (2.1.99c1-1) unstable; urgency=low + + * New upstream version: 2.2c1 (release candidate). + * Do not provide python2.2-base anymore. + * Install correct README.Debian for python2.2 package. Include hint + where to find Makefile.pre.in. + * Suggest installation of python-ssl. + * Remove idle config files on purge. + * Remove empty /usr/lib/python2.2 directory on purge. + + -- Matthias Klose Sat, 15 Dec 2001 17:56:27 +0100 + +python2.2 (2.1.99beta2-1) unstable; urgency=high + + * debian/rules: Reflect removal of regrtest package (closes: #122278). + Resulted in build failures on all architectures. + * Build -doc package from source. + + -- Matthias Klose Sat, 8 Dec 2001 00:38:41 +0100 + +python2.2 (2.1.99beta2-0.1) unstable; urgency=low + + * Non maintainer upload. + * New upstream version (this is 2.2beta2). + * Do not build the python-regrtest package anymore; keep the test framework + components test/regrtest.py and test/test_support.py in the python + package (closes: #119408). + + -- Gregor Hoffleit Tue, 27 Nov 2001 09:53:26 +0100 + +python2.2 (2.1.99beta1-4) unstable; urgency=low + + * Configure with --with-fpectl (closes: #118125). + * setup.py: Remove broken check for _curses_panel module (#116081). + * idle: Move config-* files to /etc and mark as conffiles (#106390). + * Move idle packages to section `devel'. + + -- Matthias Klose Wed, 31 Oct 2001 10:56:45 +0100 + +python2.2 (2.1.99beta1-3) unstable; urgency=low + + * Fix shlibs file (was still referring to 2.1). Closes: #116810. + * README.Debian: point to draft of python-policy in the python package. + + -- Matthias Klose Wed, 31 Oct 2001 10:56:45 +0100 + +python2.2 (2.1.99beta1-2) unstable; urgency=medium + + * Fix shlibs file (was still referring to 2.1). Closes: #116810. + * Rename package python2.2-base to python2.2. + + -- Matthias Klose Wed, 24 Oct 2001 23:00:50 +0200 + +python2.2 (2.1.99beta1-1) unstable; urgency=low + + * New upstream version (beta). Call the package version 2.1.99beta1-1. + * New maintainer until the final 2.2 release. + * Updated the debian patches. + + -- Matthias Klose Sat, 20 Oct 2001 18:56:26 +0200 + +python2.1 (2.1.1-1.2) unstable; urgency=low + + * Really remove the python alternative. + + -- Matthias Klose Sat, 20 Oct 2001 15:16:56 +0200 + +python2.1 (2.1.1-1.1) unstable; urgency=low + + * README FOR PACKAGE MAINTAINERS: It is planned to remove the python2-XXX + packages from unstable and move on to python2.1. + If you repackage/adapt your modules for python2.1, don't build + python2-XXX and python2.1-XXX packages from the same source package, + so that the python2-XXX package can be removed without influencing the + python2.1-XXX package. + + See the debian-python mailing list at http://lists.debian.org/devel.html + for details and the current discussion and a draft for a debian-python + policy (August to October 2001). + + * Remove alternative for /usr/bin/python. The python-base package now + provides the default python version. + + * Regenerate control file to fix build dependencies (closes: #116190). + * Remove alternative for /usr/bin/{python,pydoc}. + * Provide a libpython2.1.so symlink in /usr/lib/python2.1/config, + so that the shared library is found when -L/usr/lib/python2.1/config + is specified. + * Conflict with old package versions, where /usr/bin/python is a real + program (closes: #115943). + * python2.1-elisp conflicts with python-elisp (closes: #115895). + * We now have 2.1 (closes: #96851, #107849, #110243). + + -- Matthias Klose Fri, 19 Oct 2001 17:34:41 +0200 + +python2.1 (2.1.1-1) unstable; urgency=low + + * Incorporated Matthias' modifications. + + -- Gregor Hoffleit Thu, 11 Oct 2001 00:16:42 +0200 + +python2.1 (2.1.1-0.2) unstable; urgency=low + + * New upstream 2.1.1. + * GPL compatible licence (fixes #84080, #102949, #110643). + * Fixed upstream (closes: #99692, #111340). + * Build in separate build directory. + * Split Debian patches into debian/patches directory. + * Build dependencies: Add libgmp3-dev, libexpat1-dev, tighten + debhelper dependency. + * debian/rules: Updated a "bit". + * python-elisp: Remove custom dependency (closes: #87783), + fix emacs path (closes: #89712), remove emacs19 dependency (#82694). + * Mention distutils in python-dev package description (closes: #108170). + * Update README.Debian (closes: #85430). + * Run versioned python in postinsts (closes: #113349). + * debian/sample.{postinst,prerm}: Change to version independent scripts. + * Use '/usr/bin/env python2.1' as interpreter for all python scripts. + * Add libssl-dev to Build-Conflicts. + * python-elisp: Add support for emacs21 (closes: #98635). + * Do not compress .py files in doc directories. + * Don't link explicitely with libc. + + -- Matthias Klose Wed, 3 Oct 2001 09:53:08 +0200 + +python2.1 (2.1.1-0.1) unstable; urgency=low + + * New upstream version (CVS branch release21-maint, will become 2.1.1): + This CVS branch will be released as 2.1.1 under a GPL compatible + license. + + -- Gregor Hoffleit Wed, 27 Jun 2001 22:47:58 +0200 + +python2 (2.1-0.1) unstable; urgency=low + + * Fixed Makefile.pre.in. + * Fixed the postinst files in order to use 2.1 (instead of 2.0). + * Mention the immanent release of 2.0.1 and 2.1.1, with a GPL + compatible license. + + -- Gregor Hoffleit Sun, 17 Jun 2001 21:05:25 +0200 + +python2 (2.1-0) unstable; urgency=low + + * New upstream version. + * Experimental packages. + + -- Gregor Hoffleit Thu, 10 May 2001 00:20:04 +0200 + +python2 (2.0-7) unstable; urgency=low + + * Rebuilt with recent tcl8.3-dev/tk8.3-dev in order to fix a + dependency problem with python2-tk (closes: #87793, #92962). + * Change postinst to create and update /usr/local/lib/python2.0 and + site-python with permissions and owner as mandated by policy: + 2775 and root:staff (closes: #89047). + * Fix to compileall.py: A superfluous argument made compileall without + options fail (cf. #92990 for python). + * Move the distutils module into python2-dev. It needs Makefile.pre.in + in order to work (closes: #89900). + * Remove build-dependency on libgdbm2-dev (which isn't built anyway). + * Add a build-dependency on libdb2-dev (cf. #90220 for python). + + -- Gregor Hoffleit Sat, 14 Apr 2001 21:07:51 +0200 + +python2 (2.0-6) unstable; urgency=low + + * Remove python-zlib package; merge it into python-base. + * Mark that README.python2 is not yet updated. + + -- Gregor Hoffleit Wed, 21 Feb 2001 12:34:18 +0100 + +python2 (2.0-5) unstable; urgency=low + + * Recompile with tcl/tk8.3 (closes: #82088). + * Modifications to README.why-python2 (closes: #82116). + * Add menu hint to idle2 menu entry. + * idle2 is renamed idle-python2 and now build correctly (closes: #82218). + * Add build-dependency on autoconf (closes: #85339). + * Build bsddbmodule as shared module (Modules/Setup.config.in), + and link libpython2.so with -lm in Makefile (closes: #86027). + * various cleanups in debian/rules, e.g. removing dh_suidregister. + * Make pdb available as /usr/bin/pdb-python2 in python2-dev + (cf. #79870 in python-base). + * Remove libgmp3 from build-dependencies, since we currently can't + build the mpzmodule for Python2 due to license problems. + + -- Gregor Hoffleit Sun, 18 Feb 2001 00:12:17 +0100 + +python2 (2.0-4) unstable; urgency=low + + * control: make python2-elisp conflict with python-elisp (it doesn't + make sense to have both of them installed, does it ?) + * include build-depend on libxmltok1-dev. + * again, build with tcl/tk8.0. + + -- Gregor Hoffleit Wed, 10 Jan 2001 23:37:01 +0100 + +python2 (2.0-3) unstable; urgency=low + + * Modules/Setup.in: Added a missing \ that made _tkinter be built + incorrectly. + * rules: on the fly, change all '#!' python scripts to use python2. + + -- Gregor Hoffleit Wed, 13 Dec 2000 20:07:24 +0100 + +python2 (2.0-2) unstable; urgency=low + + * Aaargh. Remove conflicts/provides/replaces on python-base to make + parallel installation of python-base and python2-base possible. + * Install examples into /usr/share/doc/python2 (not python) and fix + symlink to python2.0 (thanks to Rick Younie for + pointing out this). + * Rename man page to python2.1. + + -- Gregor Hoffleit Wed, 13 Dec 2000 09:31:05 +0100 + +python2 (2.0-1) unstable; urgency=low + + * New upstream version. Initial release for python2. + + -- Gregor Hoffleit Mon, 11 Dec 2000 22:39:46 +0100 --- python3.4-3.4.2~rc1.orig/debian/changelog.shared +++ python3.4-3.4.2~rc1/debian/changelog.shared @@ -0,0 +1,3 @@ + * Link the interpreter against the shared runtime library. With + gcc-4.1 the difference in the pystones benchmark dropped from about + 12% to about 5%. --- python3.4-3.4.2~rc1.orig/debian/compat +++ python3.4-3.4.2~rc1/debian/compat @@ -0,0 +1 @@ +5 --- python3.4-3.4.2~rc1.orig/debian/control +++ python3.4-3.4.2~rc1/debian/control @@ -0,0 +1,216 @@ +Source: python3.4 +Section: python +Priority: optional +Maintainer: Matthias Klose +Build-Depends: debhelper (>= 5.0.51~), dpkg-dev (>= 1.17.11), + quilt, autoconf, + lsb-release, sharutils, + libreadline6-dev, libncursesw5-dev (>= 5.3), gcc (>= 4:4.9.1-1), + zlib1g-dev, libbz2-dev, liblzma-dev, + libgdbm-dev, libdb-dev, + tk-dev, blt-dev (>= 2.4z), libssl-dev, + libexpat1-dev, libmpdec-dev (>= 2.4), + libbluetooth-dev [!hurd-i386 !kfreebsd-i386 !kfreebsd-amd64], + locales [!armel !avr32 !hppa !ia64 !mipsel], + libsqlite3-dev, libffi-dev (>= 3.0.5) [!or1k !avr32], + libgpm2 [!hurd-i386 !kfreebsd-i386 !kfreebsd-amd64], + mime-support, netbase, bzip2, python3:any, + net-tools, xvfb, xauth +Build-Depends-Indep: python-sphinx +Standards-Version: 3.9.5 +Vcs-Browser: https://code.launchpad.net/~doko/python/pkg3.4-debian +Vcs-Bzr: http://bazaar.launchpad.net/~doko/python/pkg3.4-debian +XS-Testsuite: autopkgtest + +Package: python3.4 +Architecture: any +Multi-Arch: allowed +Priority: optional +Depends: python3.4-minimal (= ${binary:Version}), libpython3.4-stdlib (= ${binary:Version}), mime-support, ${shlibs:Depends}, ${misc:Depends} +Suggests: python3.4-venv, python3.4-doc, binutils +Description: Interactive high-level object-oriented language (version 3.4) + Python is a high-level, interactive, object-oriented language. Its 3.4 version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + +Package: python3.4-venv +Architecture: any +Multi-Arch: allowed +Priority: optional +Depends: python3.4 (= ${binary:Version}), + python-setuptools-whl, python-pip-whl, ${shlibs:Depends}, ${misc:Depends} +Replaces: python3.4 (<< 3.4.1) +Description: Interactive high-level object-oriented language (pyvenv binary, version 3.4) + Python is a high-level, interactive, object-oriented language. Its 3.4 version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains the pyvenv-3.4 binary. + +Package: libpython3.4-stdlib +Architecture: any +Multi-Arch: same +Priority: optional +Pre-Depends: multiarch-support +Depends: libpython3.4-minimal (= ${binary:Version}), mime-support, ${shlibs:Depends}, ${misc:Depends} +Description: Interactive high-level object-oriented language (standard library, version 3.4) + Python is a high-level, interactive, object-oriented language. Its 3.4 version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains Python 3.4's standard library. It is normally not + used on its own, but as a dependency of python3.4. + +Package: python3.4-minimal +Architecture: any +Multi-Arch: allowed +Priority: optional +Pre-Depends: ${shlibs:Pre-Depends} +Depends: libpython3.4-minimal (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Recommends: python3.4 +Suggests: binfmt-support +Conflicts: binfmt-support (<< 1.1.2) +Description: Minimal subset of the Python language (version 3.4) + This package contains the interpreter and some essential modules. It can + be used in the boot process for some basic tasks. + See /usr/share/doc/python3.4-minimal/README.Debian for a list of the modules + contained in this package. + +Package: libpython3.4-minimal +Architecture: any +Multi-Arch: same +Priority: optional +Pre-Depends: multiarch-support +Depends: ${shlibs:Depends}, ${misc:Depends} +Recommends: libpython3.4-stdlib +Conflicts: binfmt-support (<< 1.1.2) +Replaces: libpython3.4-stdlib (<< 3.4.0+20140425-1) +Description: Minimal subset of the Python language (version 3.4) + This package contains some essential modules. It is normally not + used on it's own, but as a dependency of python3.4-minimal. + +Package: libpython3.4 +Architecture: any +Multi-Arch: same +Section: libs +Priority: optional +Pre-Depends: multiarch-support +Depends: libpython3.4-stdlib (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Description: Shared Python runtime library (version 3.4) + Python is a high-level, interactive, object-oriented language. Its 3.4 version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains the shared runtime library, normally not needed + for programs using the statically linked interpreter. + +Package: python3.4-examples +Architecture: all +Depends: python3.4 (>= ${source:Version}), ${misc:Depends} +Replaces: libpython3.4-testsuite (<< 3.4.1-8~) +Description: Examples for the Python language (v3.4) + Examples, Demos and Tools for Python (v3.4). These are files included in + the upstream Python distribution (v3.4). + +Package: python3.4-dev +Architecture: any +Multi-Arch: allowed +Depends: python3.4 (= ${binary:Version}), libpython3.4-dev (= ${binary:Version}), libpython3.4 (= ${binary:Version}), libexpat1-dev, ${shlibs:Depends}, ${misc:Depends} +Recommends: libc6-dev | libc-dev +Description: Header files and a static library for Python (v3.4) + Header files, a static library and development tools for building + Python (v3.4) modules, extending the Python interpreter or embedding + Python (v3.4) in applications. + . + Maintainers of Python packages should read README.maintainers. + +Package: libpython3.4-dev +Section: libdevel +Architecture: any +Multi-Arch: same +Pre-Depends: multiarch-support +Depends: libpython3.4-stdlib (= ${binary:Version}), libpython3.4 (= ${binary:Version}), libexpat1-dev, ${shlibs:Depends}, ${misc:Depends} +Recommends: libc6-dev | libc-dev +Description: Header files and a static library for Python (v3.4) + Header files, a static library and development tools for building + Python (v3.4) modules, extending the Python interpreter or embedding + Python (v3.4) in applications. + . + Maintainers of Python packages should read README.maintainers. + . + This package contains development files. It is normally not + used on it's own, but as a dependency of python3.4-dev. + +Package: libpython3.4-testsuite +Section: libdevel +Architecture: all +Depends: python3.4 (>= ${binary:Version}), ${misc:Depends}, net-tools +Suggests: python3-gdbm, python3-tk +Description: Testsuite for the Python standard library (v3.4) + The complete testsuite for the Python standard library. Note that + a subset is found in the libpython3.4-stdlib package, which should + be enough for other packages to use (please do not build-depend + on this package, but file a bug report to include additional + testsuite files in the libpython3.4-stdlib package). + +Package: idle-python3.4 +Architecture: all +Depends: python3.4, python3-tk, python3.4-tk, ${misc:Depends} +Enhances: python3.4 +Description: IDE for Python (v3.4) using Tkinter + IDLE is an Integrated Development Environment for Python (v3.4). + IDLE is written using Tkinter and therefore quite platform-independent. + +Package: python3.4-doc +Section: doc +Architecture: all +Depends: libjs-jquery, libjs-underscore, ${misc:Depends} +Suggests: python3.4 +Description: Documentation for the high-level object-oriented language Python (v3.4) + These is the official set of documentation for the interactive high-level + object-oriented language Python (v3.4). All documents are provided + in HTML format. The package consists of ten documents: + . + * What's New in Python3.4 + * Tutorial + * Python Library Reference + * Macintosh Module Reference + * Python Language Reference + * Extending and Embedding Python + * Python/C API Reference + * Installing Python Modules + * Documenting Python + * Distributing Python Modules + +Package: python3.4-dbg +Section: debug +Architecture: any +Multi-Arch: allowed +Priority: extra +Depends: python3.4 (= ${binary:Version}), libpython3.4-dbg (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Recommends: gdb +Suggests: python3-gdbm-dbg, python3-tk-dbg +Description: Debug Build of the Python Interpreter (version 3.4) + The package holds two things: + . + - A Python interpreter configured with --pydebug. Dynamically loaded modules + are searched as _d.so first. Third party extensions need a separate + build to be used by this interpreter. + - Debug information for standard python interpreter and extensions. + . + See the README.debug for more information. + +Package: libpython3.4-dbg +Section: debug +Architecture: any +Multi-Arch: same +Priority: extra +Pre-Depends: multiarch-support +Depends: libpython3.4-stdlib (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Description: Debug Build of the Python Interpreter (version 3.4) + The package holds two things: + . + - Extensions for a Python interpreter configured with --pydebug. + - Debug information for standard python extensions. + . + See the README.debug for more information. --- python3.4-3.4.2~rc1.orig/debian/control.in +++ python3.4-3.4.2~rc1/debian/control.in @@ -0,0 +1,216 @@ +Source: @PVER@ +Section: python +Priority: optional +Maintainer: Matthias Klose +Build-Depends: debhelper (>= 5.0.51~), @bd_dpkgdev@ + quilt, autoconf, + lsb-release, sharutils, + libreadline6-dev, libncursesw5-dev (>= 5.3), @bd_gcc@ + zlib1g-dev, libbz2-dev, liblzma-dev, + libgdbm-dev, libdb-dev, + tk-dev, blt-dev (>= 2.4z), libssl-dev, + libexpat1-dev, libmpdec-dev (>= 2.4), + libbluetooth-dev [!hurd-i386 !kfreebsd-i386 !kfreebsd-amd64], + locales [!armel !avr32 !hppa !ia64 !mipsel], + libsqlite3-dev, libffi-dev (>= 3.0.5) [!or1k !avr32], + libgpm2 [!hurd-i386 !kfreebsd-i386 !kfreebsd-amd64], + mime-support, netbase, bzip2, python3@bd_qual@, + net-tools, xvfb, xauth +Build-Depends-Indep: python-sphinx +Standards-Version: 3.9.5 +Vcs-Browser: https://code.launchpad.net/~doko/python/pkg@VER@-debian +Vcs-Bzr: http://bazaar.launchpad.net/~doko/python/pkg@VER@-debian +XS-Testsuite: autopkgtest + +Package: @PVER@ +Architecture: any +Multi-Arch: allowed +Priority: @PRIO@ +Depends: @PVER@-minimal (= ${binary:Version}), lib@PVER@-stdlib (= ${binary:Version}), mime-support, ${shlibs:Depends}, ${misc:Depends} +Suggests: @PVER@-venv, @PVER@-doc, binutils +Description: Interactive high-level object-oriented language (version @VER@) + Python is a high-level, interactive, object-oriented language. Its @VER@ version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + +Package: @PVER@-venv +Architecture: any +Multi-Arch: allowed +Priority: @PRIO@ +Depends: @PVER@ (= ${binary:Version}), + python-setuptools-whl, python-pip-whl, ${shlibs:Depends}, ${misc:Depends} +Replaces: python3.4 (<< 3.4.1) +Description: Interactive high-level object-oriented language (pyvenv binary, version @VER@) + Python is a high-level, interactive, object-oriented language. Its @VER@ version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains the pyvenv-@VER@ binary. + +Package: lib@PVER@-stdlib +Architecture: any +Multi-Arch: same +Priority: @PRIO@ +Pre-Depends: multiarch-support +Depends: lib@PVER@-minimal (= ${binary:Version}), mime-support, ${shlibs:Depends}, ${misc:Depends} +Description: Interactive high-level object-oriented language (standard library, version @VER@) + Python is a high-level, interactive, object-oriented language. Its @VER@ version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains Python @VER@'s standard library. It is normally not + used on its own, but as a dependency of python@VER@. + +Package: @PVER@-minimal +Architecture: any +Multi-Arch: allowed +Priority: @MINPRIO@ +Pre-Depends: ${shlibs:Pre-Depends} +Depends: lib@PVER@-minimal (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Recommends: @PVER@ +Suggests: binfmt-support +Conflicts: binfmt-support (<< 1.1.2) +Description: Minimal subset of the Python language (version @VER@) + This package contains the interpreter and some essential modules. It can + be used in the boot process for some basic tasks. + See /usr/share/doc/@PVER@-minimal/README.Debian for a list of the modules + contained in this package. + +Package: lib@PVER@-minimal +Architecture: any +Multi-Arch: same +Priority: @MINPRIO@ +Pre-Depends: multiarch-support +Depends: ${shlibs:Depends}, ${misc:Depends} +Recommends: lib@PVER@-stdlib +Conflicts: binfmt-support (<< 1.1.2) +Replaces: libpython3.4-stdlib (<< 3.4.0+20140425-1) +Description: Minimal subset of the Python language (version @VER@) + This package contains some essential modules. It is normally not + used on it's own, but as a dependency of @PVER@-minimal. + +Package: lib@PVER@ +Architecture: any +Multi-Arch: same +Section: libs +Priority: @PRIO@ +Pre-Depends: multiarch-support +Depends: lib@PVER@-stdlib (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Description: Shared Python runtime library (version @VER@) + Python is a high-level, interactive, object-oriented language. Its @VER@ version + includes an extensive class library with lots of goodies for + network programming, system administration, sounds and graphics. + . + This package contains the shared runtime library, normally not needed + for programs using the statically linked interpreter. + +Package: @PVER@-examples +Architecture: all +Depends: @PVER@ (>= ${source:Version}), ${misc:Depends} +Replaces: lib@PVER@-testsuite (<< 3.4.1-8~) +Description: Examples for the Python language (v@VER@) + Examples, Demos and Tools for Python (v@VER@). These are files included in + the upstream Python distribution (v@VER@). + +Package: @PVER@-dev +Architecture: any +Multi-Arch: allowed +Depends: @PVER@ (= ${binary:Version}), lib@PVER@-dev (= ${binary:Version}), lib@PVER@ (= ${binary:Version}), libexpat1-dev, ${shlibs:Depends}, ${misc:Depends} +Recommends: libc6-dev | libc-dev +Description: Header files and a static library for Python (v@VER@) + Header files, a static library and development tools for building + Python (v@VER@) modules, extending the Python interpreter or embedding + Python (v@VER@) in applications. + . + Maintainers of Python packages should read README.maintainers. + +Package: lib@PVER@-dev +Section: libdevel +Architecture: any +Multi-Arch: same +Pre-Depends: multiarch-support +Depends: lib@PVER@-stdlib (= ${binary:Version}), lib@PVER@ (= ${binary:Version}), libexpat1-dev, ${shlibs:Depends}, ${misc:Depends} +Recommends: libc6-dev | libc-dev +Description: Header files and a static library for Python (v@VER@) + Header files, a static library and development tools for building + Python (v@VER@) modules, extending the Python interpreter or embedding + Python (v@VER@) in applications. + . + Maintainers of Python packages should read README.maintainers. + . + This package contains development files. It is normally not + used on it's own, but as a dependency of @PVER@-dev. + +Package: lib@PVER@-testsuite +Section: libdevel +Architecture: all +Depends: @PVER@ (>= ${binary:Version}), ${misc:Depends}, net-tools +Suggests: python3-gdbm, python3-tk +Description: Testsuite for the Python standard library (v@VER@) + The complete testsuite for the Python standard library. Note that + a subset is found in the lib@PVER@-stdlib package, which should + be enough for other packages to use (please do not build-depend + on this package, but file a bug report to include additional + testsuite files in the lib@PVER@-stdlib package). + +Package: idle-@PVER@ +Architecture: all +Depends: @PVER@, python3-tk, @PVER@-tk, ${misc:Depends} +Enhances: @PVER@ +Description: IDE for Python (v@VER@) using Tkinter + IDLE is an Integrated Development Environment for Python (v@VER@). + IDLE is written using Tkinter and therefore quite platform-independent. + +Package: @PVER@-doc +Section: doc +Architecture: all +Depends: libjs-jquery, libjs-underscore, ${misc:Depends} +Suggests: @PVER@ +Description: Documentation for the high-level object-oriented language Python (v@VER@) + These is the official set of documentation for the interactive high-level + object-oriented language Python (v@VER@). All documents are provided + in HTML format. The package consists of ten documents: + . + * What's New in Python@VER@ + * Tutorial + * Python Library Reference + * Macintosh Module Reference + * Python Language Reference + * Extending and Embedding Python + * Python/C API Reference + * Installing Python Modules + * Documenting Python + * Distributing Python Modules + +Package: @PVER@-dbg +Section: debug +Architecture: any +Multi-Arch: allowed +Priority: extra +Depends: @PVER@ (= ${binary:Version}), lib@PVER@-dbg (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Recommends: gdb +Suggests: python3-gdbm-dbg, python3-tk-dbg +Description: Debug Build of the Python Interpreter (version @VER@) + The package holds two things: + . + - A Python interpreter configured with --pydebug. Dynamically loaded modules + are searched as _d.so first. Third party extensions need a separate + build to be used by this interpreter. + - Debug information for standard python interpreter and extensions. + . + See the README.debug for more information. + +Package: lib@PVER@-dbg +Section: debug +Architecture: any +Multi-Arch: same +Priority: extra +Pre-Depends: multiarch-support +Depends: lib@PVER@-stdlib (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends} +Description: Debug Build of the Python Interpreter (version @VER@) + The package holds two things: + . + - Extensions for a Python interpreter configured with --pydebug. + - Debug information for standard python extensions. + . + See the README.debug for more information. --- python3.4-3.4.2~rc1.orig/debian/control.stdlib +++ python3.4-3.4.2~rc1/debian/control.stdlib @@ -0,0 +1,16 @@ +Package: @PVER@-tk +Architecture: any +Depends: @PVER@ (= ${Source-Version}), ${shlibs:Depends} +Suggests: tix +XB-Python-Version: @VER@ +Description: Tkinter - Writing Tk applications with Python (v@VER@) + A module for writing portable GUI applications with Python (v@VER@) using Tk. + Also known as Tkinter. + +Package: @PVER@-gdbm +Architecture: any +Depends: @PVER@ (= ${Source-Version}), ${shlibs:Depends} +Description: GNU dbm database support for Python (v@VER@) + GNU dbm database module for Python. Install this if you want to + create or read GNU dbm database files with Python. + --- python3.4-3.4.2~rc1.orig/debian/control.udeb +++ python3.4-3.4.2~rc1/debian/control.udeb @@ -0,0 +1,11 @@ + +Package: @PVER@-udeb +XC-Package-Type: udeb +Section: debian-installer +Architecture: any +Depends: ${shlibs:Depends}, ${misc:Depends} +XB-Python-Runtime: @PVER@ +XB-Python-Version: @VER@ +Description: A minimal subset of the Python language (version @VER@) + This package contains the interpreter and some essential modules, packaged + for use in the installer. --- python3.4-3.4.2~rc1.orig/debian/copyright +++ python3.4-3.4.2~rc1/debian/copyright @@ -0,0 +1,1028 @@ +This package was put together by Klee Dienes from +sources from ftp.python.org:/pub/python, based on the Debianization by +the previous maintainers Bernd S. Brentrup and +Bruce Perens. Current maintainer is Matthias Klose . + +It was downloaded from http://python.org/ + +Copyright: + +Upstream Author: Guido van Rossum and others. + +License: + +The following text includes the Python license and licenses and +acknowledgements for incorporated software. The licenses can be read +in the HTML and texinfo versions of the documentation as well, after +installing the pythonx.y-doc package. Licenses for files not licensed +under the Python Licenses are found at the end of this file. + + +Python License +============== + +A. HISTORY OF THE SOFTWARE +========================== + +Python was created in the early 1990s by Guido van Rossum at Stichting +Mathematisch Centrum (CWI, see http://www.cwi.nl) in the Netherlands +as a successor of a language called ABC. Guido remains Python's +principal author, although it includes many contributions from others. + +In 1995, Guido continued his work on Python at the Corporation for +National Research Initiatives (CNRI, see http://www.cnri.reston.va.us) +in Reston, Virginia where he released several versions of the +software. + +In May 2000, Guido and the Python core development team moved to +BeOpen.com to form the BeOpen PythonLabs team. In October of the same +year, the PythonLabs team moved to Digital Creations (now Zope +Corporation, see http://www.zope.com). In 2001, the Python Software +Foundation (PSF, see http://www.python.org/psf/) was formed, a +non-profit organization created specifically to own Python-related +Intellectual Property. Zope Corporation is a sponsoring member of +the PSF. + +All Python releases are Open Source (see http://www.opensource.org for +the Open Source Definition). Historically, most, but not all, Python +releases have also been GPL-compatible; the table below summarizes +the various releases. + + Release Derived Year Owner GPL- + from compatible? (1) + + 0.9.0 thru 1.2 1991-1995 CWI yes + 1.3 thru 1.5.2 1.2 1995-1999 CNRI yes + 1.6 1.5.2 2000 CNRI no + 2.0 1.6 2000 BeOpen.com no + 1.6.1 1.6 2001 CNRI yes (2) + 2.1 2.0+1.6.1 2001 PSF no + 2.0.1 2.0+1.6.1 2001 PSF yes + 2.1.1 2.1+2.0.1 2001 PSF yes + 2.2 2.1.1 2001 PSF yes + 2.1.2 2.1.1 2002 PSF yes + 2.1.3 2.1.2 2002 PSF yes + 2.2.1 2.2 2002 PSF yes + 2.2.2 2.2.1 2002 PSF yes + 2.2.3 2.2.2 2003 PSF yes + 2.3 2.2.2 2002-2003 PSF yes + 2.3.1 2.3 2002-2003 PSF yes + 2.3.2 2.3.1 2002-2003 PSF yes + 2.3.3 2.3.2 2002-2003 PSF yes + 2.3.4 2.3.3 2004 PSF yes + 2.3.5 2.3.4 2005 PSF yes + 2.4 2.3 2004 PSF yes + 2.4.1 2.4 2005 PSF yes + 2.4.2 2.4.1 2005 PSF yes + 2.4.3 2.4.2 2006 PSF yes + 2.5 2.4 2006 PSF yes + 2.5.1 2.5 2007 PSF yes + 2.5.2 2.5.1 2008 PSF yes + 2.5.3 2.5.2 2008 PSF yes + 2.6 2.5 2008 PSF yes + 2.6.1 2.6 2008 PSF yes + 2.6.2 2.6.1 2009 PSF yes + 2.6.3 2.6.2 2009 PSF yes + 2.6.4 2.6.3 2009 PSF yes + 2.6.5 2.6.4 2010 PSF yes + 3.0 2.6 2008 PSF yes + 3.0.1 3.0 2009 PSF yes + 3.1 3.0.1 2009 PSF yes + 3.1.1 3.1 2009 PSF yes + 3.1.2 3.1.1 2010 PSF yes + 3.1.3 3.1.2 2010 PSF yes + 3.1.4 3.1.3 2011 PSF yes + 3.2 3.1 2011 PSF yes + 3.2.1 3.2 2011 PSF yes + 3.2.2 3.2.1 2011 PSF yes + 3.3 3.2 2012 PSF yes + +Footnotes: + +(1) GPL-compatible doesn't mean that we're distributing Python under + the GPL. All Python licenses, unlike the GPL, let you distribute + a modified version without making your changes open source. The + GPL-compatible licenses make it possible to combine Python with + other software that is released under the GPL; the others don't. + +(2) According to Richard Stallman, 1.6.1 is not GPL-compatible, + because its license has a choice of law clause. According to + CNRI, however, Stallman's lawyer has told CNRI's lawyer that 1.6.1 + is "not incompatible" with the GPL. + +Thanks to the many outside volunteers who have worked under Guido's +direction to make these releases possible. + + +B. TERMS AND CONDITIONS FOR ACCESSING OR OTHERWISE USING PYTHON +=============================================================== + +PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2 +-------------------------------------------- + +1. This LICENSE AGREEMENT is between the Python Software Foundation +("PSF"), and the Individual or Organization ("Licensee") accessing and +otherwise using this software ("Python") in source or binary form and +its associated documentation. + +2. Subject to the terms and conditions of this License Agreement, PSF +hereby grants Licensee a nonexclusive, royalty-free, world-wide +license to reproduce, analyze, test, perform and/or display publicly, +prepare derivative works, distribute, and otherwise use Python alone +or in any derivative version, provided, however, that PSF's License +Agreement and PSF's notice of copyright, i.e., "Copyright (c) 2001, +2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, +2013, 2014 Python Software Foundation; All Rights Reserved" are +retained in Python alone or in any derivative version prepared by +Licensee. + +3. In the event Licensee prepares a derivative work that is based on +or incorporates Python or any part thereof, and wants to make +the derivative work available to others as provided herein, then +Licensee hereby agrees to include in any such work a brief summary of +the changes made to Python. + +4. PSF is making Python available to Licensee on an "AS IS" +basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT +INFRINGE ANY THIRD PARTY RIGHTS. + +5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON +FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS +A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, +OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. + +6. This License Agreement will automatically terminate upon a material +breach of its terms and conditions. + +7. Nothing in this License Agreement shall be deemed to create any +relationship of agency, partnership, or joint venture between PSF and +Licensee. This License Agreement does not grant permission to use PSF +trademarks or trade name in a trademark sense to endorse or promote +products or services of Licensee, or any third party. + +8. By copying, installing or otherwise using Python, Licensee +agrees to be bound by the terms and conditions of this License +Agreement. + + +BEOPEN.COM LICENSE AGREEMENT FOR PYTHON 2.0 +------------------------------------------- + +BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1 + +1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an +office at 160 Saratoga Avenue, Santa Clara, CA 95051, and the +Individual or Organization ("Licensee") accessing and otherwise using +this software in source or binary form and its associated +documentation ("the Software"). + +2. Subject to the terms and conditions of this BeOpen Python License +Agreement, BeOpen hereby grants Licensee a non-exclusive, +royalty-free, world-wide license to reproduce, analyze, test, perform +and/or display publicly, prepare derivative works, distribute, and +otherwise use the Software alone or in any derivative version, +provided, however, that the BeOpen Python License is retained in the +Software, alone or in any derivative version prepared by Licensee. + +3. BeOpen is making the Software available to Licensee on an "AS IS" +basis. BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE WILL NOT +INFRINGE ANY THIRD PARTY RIGHTS. + +4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE +SOFTWARE FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS +AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY +DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. + +5. This License Agreement will automatically terminate upon a material +breach of its terms and conditions. + +6. This License Agreement shall be governed by and interpreted in all +respects by the law of the State of California, excluding conflict of +law provisions. Nothing in this License Agreement shall be deemed to +create any relationship of agency, partnership, or joint venture +between BeOpen and Licensee. This License Agreement does not grant +permission to use BeOpen trademarks or trade names in a trademark +sense to endorse or promote products or services of Licensee, or any +third party. As an exception, the "BeOpen Python" logos available at +http://www.pythonlabs.com/logos.html may be used according to the +permissions granted on that web page. + +7. By copying, installing or otherwise using the software, Licensee +agrees to be bound by the terms and conditions of this License +Agreement. + + +CNRI LICENSE AGREEMENT FOR PYTHON 1.6.1 +--------------------------------------- + +1. This LICENSE AGREEMENT is between the Corporation for National +Research Initiatives, having an office at 1895 Preston White Drive, +Reston, VA 20191 ("CNRI"), and the Individual or Organization +("Licensee") accessing and otherwise using Python 1.6.1 software in +source or binary form and its associated documentation. + +2. Subject to the terms and conditions of this License Agreement, CNRI +hereby grants Licensee a nonexclusive, royalty-free, world-wide +license to reproduce, analyze, test, perform and/or display publicly, +prepare derivative works, distribute, and otherwise use Python 1.6.1 +alone or in any derivative version, provided, however, that CNRI's +License Agreement and CNRI's notice of copyright, i.e., "Copyright (c) +1995-2001 Corporation for National Research Initiatives; All Rights +Reserved" are retained in Python 1.6.1 alone or in any derivative +version prepared by Licensee. Alternately, in lieu of CNRI's License +Agreement, Licensee may substitute the following text (omitting the +quotes): "Python 1.6.1 is made available subject to the terms and +conditions in CNRI's License Agreement. This Agreement together with +Python 1.6.1 may be located on the Internet using the following +unique, persistent identifier (known as a handle): 1895.22/1013. This +Agreement may also be obtained from a proxy server on the Internet +using the following URL: http://hdl.handle.net/1895.22/1013". + +3. In the event Licensee prepares a derivative work that is based on +or incorporates Python 1.6.1 or any part thereof, and wants to make +the derivative work available to others as provided herein, then +Licensee hereby agrees to include in any such work a brief summary of +the changes made to Python 1.6.1. + +4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS" +basis. CNRI MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, CNRI MAKES NO AND +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 1.6.1 WILL NOT +INFRINGE ANY THIRD PARTY RIGHTS. + +5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON +1.6.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS +A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1, +OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. + +6. This License Agreement will automatically terminate upon a material +breach of its terms and conditions. + +7. This License Agreement shall be governed by the federal +intellectual property law of the United States, including without +limitation the federal copyright law, and, to the extent such +U.S. federal law does not apply, by the law of the Commonwealth of +Virginia, excluding Virginia's conflict of law provisions. +Notwithstanding the foregoing, with regard to derivative works based +on Python 1.6.1 that incorporate non-separable material that was +previously distributed under the GNU General Public License (GPL), the +law of the Commonwealth of Virginia shall govern this License +Agreement only as to issues arising under or with respect to +Paragraphs 4, 5, and 7 of this License Agreement. Nothing in this +License Agreement shall be deemed to create any relationship of +agency, partnership, or joint venture between CNRI and Licensee. This +License Agreement does not grant permission to use CNRI trademarks or +trade name in a trademark sense to endorse or promote products or +services of Licensee, or any third party. + +8. By clicking on the "ACCEPT" button where indicated, or by copying, +installing or otherwise using Python 1.6.1, Licensee agrees to be +bound by the terms and conditions of this License Agreement. + + ACCEPT + + +CWI LICENSE AGREEMENT FOR PYTHON 0.9.0 THROUGH 1.2 +-------------------------------------------------- + +Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam, +The Netherlands. All rights reserved. + +Permission to use, copy, modify, and distribute this software and its +documentation for any purpose and without fee is hereby granted, +provided that the above copyright notice appear in all copies and that +both that copyright notice and this permission notice appear in +supporting documentation, and that the name of Stichting Mathematisch +Centrum or CWI not be used in advertising or publicity pertaining to +distribution of the software without specific, written prior +permission. + +STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO +THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND +FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE +FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES +WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN +ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT +OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + + +Licenses and Acknowledgements for Incorporated Software +======================================================= + +Mersenne Twister +---------------- + +The `_random' module includes code based on a download from +`http://www.math.keio.ac.jp/~matumoto/MT2002/emt19937ar.html'. The +following are the verbatim comments from the original code: + + A C-program for MT19937, with initialization improved 2002/1/26. + Coded by Takuji Nishimura and Makoto Matsumoto. + + Before using, initialize the state by using init_genrand(seed) + or init_by_array(init_key, key_length). + + Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, + All rights reserved. + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + 1. Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + + 3. The names of its contributors may not be used to endorse or promote + products derived from this software without specific prior written + permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED + TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR + PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF + LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING + NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS + SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + + Any feedback is very welcome. + http://www.math.keio.ac.jp/matumoto/emt.html + email: matumoto@math.keio.ac.jp + + +Sockets +------- + +The `socket' module uses the functions, `getaddrinfo', and +`getnameinfo', which are coded in separate source files from the WIDE +Project, `http://www.wide.ad.jp/about/index.html'. + + Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. + All rights reserved. + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + 1. Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + 3. Neither the name of the project nor the names of its contributors + may be used to endorse or promote products derived from this software + without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND + GAI_ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE + FOR GAI_ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR + CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF + SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS + INTERRUPTION) HOWEVER CAUSED AND ON GAI_ANY THEORY OF LIABILITY, WHETHER + IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) + ARISING IN GAI_ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED + OF THE POSSIBILITY OF SUCH DAMAGE. + + +Floating point exception control +-------------------------------- + +The source for the `fpectl' module includes the following notice: + + --------------------------------------------------------------------- + / Copyright (c) 1996. \ + | The Regents of the University of California. | + | All rights reserved. | + | | + | Permission to use, copy, modify, and distribute this software for | + | any purpose without fee is hereby granted, provided that this en- | + | tire notice is included in all copies of any software which is or | + | includes a copy or modification of this software and in all | + | copies of the supporting documentation for such software. | + | | + | This work was produced at the University of California, Lawrence | + | Livermore National Laboratory under contract no. W-7405-ENG-48 | + | between the U.S. Department of Energy and The Regents of the | + | University of California for the operation of UC LLNL. | + | | + | DISCLAIMER | + | | + | This software was prepared as an account of work sponsored by an | + | agency of the United States Government. Neither the United States | + | Government nor the University of California nor any of their em- | + | ployees, makes any warranty, express or implied, or assumes any | + | liability or responsibility for the accuracy, completeness, or | + | usefulness of any information, apparatus, product, or process | + | disclosed, or represents that its use would not infringe | + | privately-owned rights. Reference herein to any specific commer- | + | cial products, process, or service by trade name, trademark, | + | manufacturer, or otherwise, does not necessarily constitute or | + | imply its endorsement, recommendation, or favoring by the United | + | States Government or the University of California. The views and | + | opinions of authors expressed herein do not necessarily state or | + | reflect those of the United States Government or the University | + | of California, and shall not be used for advertising or product | + \ endorsement purposes. / + --------------------------------------------------------------------- + + +Cookie management +----------------- + +The `Cookie' module contains the following notice: + + Copyright 2000 by Timothy O'Malley + + All Rights Reserved + + Permission to use, copy, modify, and distribute this software + and its documentation for any purpose and without fee is hereby + granted, provided that the above copyright notice appear in all + copies and that both that copyright notice and this permission + notice appear in supporting documentation, and that the name of + Timothy O'Malley not be used in advertising or publicity + pertaining to distribution of the software without specific, written + prior permission. + + Timothy O'Malley DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS + SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY + AND FITNESS, IN NO EVENT SHALL Timothy O'Malley BE LIABLE FOR + ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, + WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS + ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR + PERFORMANCE OF THIS SOFTWARE. + + +Execution tracing +----------------- + +The `trace' module contains the following notice: + + portions copyright 2001, Autonomous Zones Industries, Inc., all rights... + err... reserved and offered to the public under the terms of the + Python 2.2 license. + Author: Zooko O'Whielacronx + http://zooko.com/ + mailto:zooko@zooko.com + + Copyright 2000, Mojam Media, Inc., all rights reserved. + Author: Skip Montanaro + + Copyright 1999, Bioreason, Inc., all rights reserved. + Author: Andrew Dalke + + Copyright 1995-1997, Automatrix, Inc., all rights reserved. + Author: Skip Montanaro + + Copyright 1991-1995, Stichting Mathematisch Centrum, all rights reserved. + + Permission to use, copy, modify, and distribute this Python software and + its associated documentation for any purpose without fee is hereby + granted, provided that the above copyright notice appears in all copies, + and that both that copyright notice and this permission notice appear in + supporting documentation, and that the name of neither Automatrix, + Bioreason or Mojam Media be used in advertising or publicity pertaining + to distribution of the software without specific, written prior + permission. + + +UUencode and UUdecode functions +------------------------------- + +The `uu' module contains the following notice: + + Copyright 1994 by Lance Ellinghouse + Cathedral City, California Republic, United States of America. + All Rights Reserved + Permission to use, copy, modify, and distribute this software and its + documentation for any purpose and without fee is hereby granted, + provided that the above copyright notice appear in all copies and that + both that copyright notice and this permission notice appear in + supporting documentation, and that the name of Lance Ellinghouse + not be used in advertising or publicity pertaining to distribution + of the software without specific, written prior permission. + LANCE ELLINGHOUSE DISCLAIMS ALL WARRANTIES WITH REGARD TO + THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS, IN NO EVENT SHALL LANCE ELLINGHOUSE CENTRUM BE LIABLE + FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN + ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT + OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + + Modified by Jack Jansen, CWI, July 1995: + - Use binascii module to do the actual line-by-line conversion + between ascii and binary. This results in a 1000-fold speedup. The C + version is still 5 times faster, though. + - Arguments more compliant with python standard + + +XML Remote Procedure Calls +-------------------------- + +The `xmlrpclib' module contains the following notice: + + The XML-RPC client interface is + + Copyright (c) 1999-2002 by Secret Labs AB + Copyright (c) 1999-2002 by Fredrik Lundh + + By obtaining, using, and/or copying this software and/or its + associated documentation, you agree that you have read, understood, + and will comply with the following terms and conditions: + + Permission to use, copy, modify, and distribute this software and + its associated documentation for any purpose and without fee is + hereby granted, provided that the above copyright notice appears in + all copies, and that both that copyright notice and this permission + notice appear in supporting documentation, and that the name of + Secret Labs AB or the author not be used in advertising or publicity + pertaining to distribution of the software without specific, written + prior permission. + + SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD + TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANT- + ABILITY AND FITNESS. IN NO EVENT SHALL SECRET LABS AB OR THE AUTHOR + BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY + DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, + WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS + ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE + OF THIS SOFTWARE. + +Licenses for Software linked to +=============================== + +Note that the choice of GPL compatibility outlined above doesn't extend +to modules linked to particular libraries, since they change the +effective License of the module binary. + + +GNU Readline +------------ + +The 'readline' module makes use of GNU Readline. + + The GNU Readline Library is free software; you can redistribute it + and/or modify it under the terms of the GNU General Public License as + published by the Free Software Foundation; either version 2, or (at + your option) any later version. + + On Debian systems, you can find the complete statement in + /usr/share/doc/readline-common/copyright'. A copy of the GNU General + Public License is available in /usr/share/common-licenses/GPL-2'. + + +OpenSSL +------- + +The '_ssl' module makes use of OpenSSL. + + The OpenSSL toolkit stays under a dual license, i.e. both the + conditions of the OpenSSL License and the original SSLeay license + apply to the toolkit. Actually both licenses are BSD-style Open + Source licenses. Note that both licenses are incompatible with + the GPL. + + On Debian systems, you can find the complete license text in + /usr/share/doc/openssl/copyright'. + + +Files with other licenses than the Python License +------------------------------------------------- + +Files: Include/dynamic_annotations.h +Files: Python/dynamic_annotations.c +Copyright: (c) 2008-2009, Google Inc. +License: Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are + met: + + * Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + * Neither the name of Google Inc. nor the names of its + contributors may be used to endorse or promote products derived from + this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT + LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +Files: Include/unicodeobject.h +Copyright: (c) Corporation for National Research Initiatives. +Copyright: (c) 1999 by Secret Labs AB. +Copyright: (c) 1999 by Fredrik Lundh. +License: By obtaining, using, and/or copying this software and/or its + associated documentation, you agree that you have read, understood, + and will comply with the following terms and conditions: + + Permission to use, copy, modify, and distribute this software and its + associated documentation for any purpose and without fee is hereby + granted, provided that the above copyright notice appears in all + copies, and that both that copyright notice and this permission notice + appear in supporting documentation, and that the name of Secret Labs + AB or the author not be used in advertising or publicity pertaining to + distribution of the software without specific, written prior + permission. + + SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO + THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS. IN NO EVENT SHALL SECRET LABS AB OR THE AUTHOR BE LIABLE FOR + ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN + ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT + OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: Lib/logging/* +Copyright: 2001-2010 by Vinay Sajip. All Rights Reserved. +License: Permission to use, copy, modify, and distribute this software and + its documentation for any purpose and without fee is hereby granted, + provided that the above copyright notice appear in all copies and that + both that copyright notice and this permission notice appear in + supporting documentation, and that the name of Vinay Sajip + not be used in advertising or publicity pertaining to distribution + of the software without specific, written prior permission. + VINAY SAJIP DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING + ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL + VINAY SAJIP BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR + ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER + IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT + OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: Lib/multiprocessing/* +Files: Modules/_multiprocessing/* +Copyright: (c) 2006-2008, R Oudkerk. All rights reserved. +License: Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + + 1. Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + 3. Neither the name of author nor the names of any contributors may be + used to endorse or promote products derived from this software + without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND + ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + SUCH DAMAGE. + +Files: Lib/sqlite3/* +Files: Modules/_sqlite/* +Copyright: (C) 2004-2005 Gerhard Häring +License: This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + +Files: Lib/async* +Copyright: Copyright 1996 by Sam Rushing +License: Permission to use, copy, modify, and distribute this software and + its documentation for any purpose and without fee is hereby + granted, provided that the above copyright notice appear in all + copies and that both that copyright notice and this permission + notice appear in supporting documentation, and that the name of Sam + Rushing not be used in advertising or publicity pertaining to + distribution of the software without specific, written prior + permission. + + SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, + INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN + NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR + CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS + OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN + CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: Lib/tarfile.py +Copyright: (C) 2002 Lars Gustaebel +License: Permission is hereby granted, free of charge, to any person + obtaining a copy of this software and associated documentation + files (the "Software"), to deal in the Software without + restriction, including without limitation the rights to use, + copy, modify, merge, publish, distribute, sublicense, and/or sell + copies of the Software, and to permit persons to whom the + Software is furnished to do so, subject to the following + conditions: + + The above copyright notice and this permission notice shall be + included in all copies or substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES + OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT + HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, + WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING + FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR + OTHER DEALINGS IN THE SOFTWARE. + +Files: Lib/turtle.py +Copyright: (C) 2006 - 2010 Gregor Lingl +License: This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + is copyright Gregor Lingl and licensed under a BSD-like license + +Files: Modules/_ctypes/libffi/* +Copyright: Copyright (C) 1996-2011 Red Hat, Inc and others. + Copyright (C) 1996-2011 Anthony Green + Copyright (C) 1996-2010 Free Software Foundation, Inc + Copyright (c) 2003, 2004, 2006, 2007, 2008 Kaz Kojima + Copyright (c) 2010, 2011, Plausible Labs Cooperative , Inc. + Copyright (c) 2010 CodeSourcery + Copyright (c) 1998 Andreas Schwab + Copyright (c) 2000 Hewlett Packard Company + Copyright (c) 2009 Bradley Smith + Copyright (c) 2008 David Daney + Copyright (c) 2004 Simon Posnjak + Copyright (c) 2005 Axis Communications AB + Copyright (c) 1998 Cygnus Solutions + Copyright (c) 2004 Renesas Technology + Copyright (c) 2002, 2007 Bo Thorsen + Copyright (c) 2002 Ranjit Mathew + Copyright (c) 2002 Roger Sayle + Copyright (c) 2000, 2007 Software AG + Copyright (c) 2003 Jakub Jelinek + Copyright (c) 2000, 2001 John Hornkvist + Copyright (c) 1998 Geoffrey Keating + Copyright (c) 2008 Björn König + +License: Permission is hereby granted, free of charge, to any person obtaining + a copy of this software and associated documentation files (the + ``Software''), to deal in the Software without restriction, including + without limitation the rights to use, copy, modify, merge, publish, + distribute, sublicense, and/or sell copies of the Software, and to + permit persons to whom the Software is furnished to do so, subject to + the following conditions: + + The above copyright notice and this permission notice shall be included + in all copies or substantial portions of the Software. + + THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND, + EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT + HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, + WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER + DEALINGS IN THE SOFTWARE. + + Documentation: + Permission is granted to copy, distribute and/or modify this document + under the terms of the GNU General Public License as published by the + Free Software Foundation; either version 2, or (at your option) any + later version. A copy of the license is included in the + section entitled ``GNU General Public License''. + +Files: Modules/_gestalt.c +Copyright: 1991-1997 by Stichting Mathematisch Centrum, Amsterdam. +License: Permission to use, copy, modify, and distribute this software and its + documentation for any purpose and without fee is hereby granted, + provided that the above copyright notice appear in all copies and that + both that copyright notice and this permission notice appear in + supporting documentation, and that the names of Stichting Mathematisch + Centrum or CWI not be used in advertising or publicity pertaining to + distribution of the software without specific, written prior permission. + + STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO + THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE + FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES + WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN + ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT + OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: Modules/syslogmodule.c +Copyright: 1994 by Lance Ellinghouse +License: Permission to use, copy, modify, and distribute this software and its + documentation for any purpose and without fee is hereby granted, + provided that the above copyright notice appear in all copies and that + both that copyright notice and this permission notice appear in + supporting documentation, and that the name of Lance Ellinghouse + not be used in advertising or publicity pertaining to distribution + of the software without specific, written prior permission. + + LANCE ELLINGHOUSE DISCLAIMS ALL WARRANTIES WITH REGARD TO + THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS, IN NO EVENT SHALL LANCE ELLINGHOUSE BE LIABLE FOR ANY SPECIAL, + INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING + FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION + WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: Modules/zlib/* +Copyright: (C) 1995-2010 Jean-loup Gailly and Mark Adler +License: This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + Jean-loup Gailly Mark Adler + jloup@gzip.org madler@alumni.caltech.edu + + If you use the zlib library in a product, we would appreciate *not* receiving + lengthy legal documents to sign. The sources are provided for free but without + warranty of any kind. The library has been entirely written by Jean-loup + Gailly and Mark Adler; it does not include third-party code. + +Files: Modules/expat/* +Copyright: Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd + and Clark Cooper + Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006 Expat maintainers +License: Permission is hereby granted, free of charge, to any person obtaining + a copy of this software and associated documentation files (the + "Software"), to deal in the Software without restriction, including + without limitation the rights to use, copy, modify, merge, publish, + distribute, sublicense, and/or sell copies of the Software, and to + permit persons to whom the Software is furnished to do so, subject to + the following conditions: + + The above copyright notice and this permission notice shall be included + in all copies or substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, + EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF + MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. + IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY + CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, + TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE + SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + +Files: Modules/_decimal/libmpdec/* +Copyright: Copyright (c) 2008-2012 Stefan Krah. All rights reserved. +License: Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions + are met: + . + 1. Redistributions of source code must retain the above copyright + notice, this list of conditions and the following disclaimer. + . + 2. Redistributions in binary form must reproduce the above copyright + notice, this list of conditions and the following disclaimer in the + documentation and/or other materials provided with the distribution. + , + THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND + ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + SUCH DAMAGE. + +Files: Misc/python-mode.el +Copyright: Copyright (C) 1992,1993,1994 Tim Peters +License: This software is provided as-is, without express or implied + warranty. Permission to use, copy, modify, distribute or sell this + software, without fee, for any purpose and by any individual or + organization, is hereby granted, provided that the above copyright + notice and this paragraph appear in all copies. + +Files: Python/dtoa.c +Copyright: (c) 1991, 2000, 2001 by Lucent Technologies. +License: Permission to use, copy, modify, and distribute this software for any + purpose without fee is hereby granted, provided that this entire notice + is included in all copies of any software which is or includes a copy + or modification of this software and in all copies of the supporting + documentation for such software. + + THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED + WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY + REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY + OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. + +Files: Python/getopt.c +Copyright: 1992-1994, David Gottner +License: Permission to use, copy, modify, and distribute this software and its + documentation for any purpose and without fee is hereby granted, + provided that the above copyright notice, this permission notice and + the following disclaimer notice appear unmodified in all copies. + + I DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL I + BE LIABLE FOR ANY SPECIAL, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY + DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA, OR PROFITS, WHETHER + IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT + OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: PC/_subprocess.c +Copyright: Copyright (c) 2004 by Fredrik Lundh + Copyright (c) 2004 by Secret Labs AB, http://www.pythonware.com + Copyright (c) 2004 by Peter Astrand +License: + * Permission to use, copy, modify, and distribute this software and + * its associated documentation for any purpose and without fee is + * hereby granted, provided that the above copyright notice appears in + * all copies, and that both that copyright notice and this permission + * notice appear in supporting documentation, and that the name of the + * authors not be used in advertising or publicity pertaining to + * distribution of the software without specific, written prior + * permission. + * + * THE AUTHORS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, + * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. + * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY SPECIAL, INDIRECT OR + * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS + * OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION + * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + +Files: PC/winsound.c +Copyright: Copyright (c) 1999 Toby Dickenson +License: * Permission to use this software in any way is granted without + * fee, provided that the copyright notice above appears in all + * copies. This software is provided "as is" without any warranty. + */ + +/* Modified by Guido van Rossum */ +/* Beep added by Mark Hammond */ +/* Win9X Beep and platform identification added by Uncle Timmy */ + +Files: Tools/pybench/* +Copyright: (c), 1997-2006, Marc-Andre Lemburg (mal@lemburg.com) + (c), 2000-2006, eGenix.com Software GmbH (info@egenix.com) +License: Permission to use, copy, modify, and distribute this software and its + documentation for any purpose and without fee or royalty is hereby + granted, provided that the above copyright notice appear in all copies + and that both that copyright notice and this permission notice appear + in supporting documentation or portions thereof, including + modifications, that you make. + + THE AUTHOR MARC-ANDRE LEMBURG DISCLAIMS ALL WARRANTIES WITH REGARD TO + THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS, IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, + INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING + FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, + NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION + WITH THE USE OR PERFORMANCE OF THIS SOFTWARE ! --- python3.4-3.4.2~rc1.orig/debian/depgraph.py +++ python3.4-3.4.2~rc1/debian/depgraph.py @@ -0,0 +1,199 @@ +#! /usr/bin/python3 + +# Copyright 2004 Toby Dickenson +# +# Permission is hereby granted, free of charge, to any person obtaining +# a copy of this software and associated documentation files (the +# "Software"), to deal in the Software without restriction, including +# without limitation the rights to use, copy, modify, merge, publish, +# distribute, sublicense, and/or sell copies of the Software, and to +# permit persons to whom the Software is furnished to do so, subject +# to the following conditions: +# +# The above copyright notice and this permission notice shall be included +# in all copies or substantial portions of the Software. +# +# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY +# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, +# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE +# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + +import sys, getopt, colorsys, imp, hashlib + +class pydepgraphdot: + + def main(self,argv): + opts,args = getopt.getopt(argv,'',['mono']) + self.colored = 1 + for o,v in opts: + if o=='--mono': + self.colored = 0 + self.render() + + def fix(self,s): + # Convert a module name to a syntactically correct node name + return s.replace('.','_') + + def render(self): + p,t = self.get_data() + + # normalise our input data + for k,d in list(p.items()): + for v in list(d.keys()): + if v not in p: + p[v] = {} + + f = self.get_output_file() + + f.write('digraph G {\n') + #f.write('concentrate = true;\n') + #f.write('ordering = out;\n') + f.write('ranksep=1.0;\n') + f.write('node [style=filled,fontname=Helvetica,fontsize=10];\n') + allkd = list(p.items()) + allkd.sort() + for k,d in allkd: + tk = t.get(k) + if self.use(k,tk): + allv = list(d.keys()) + allv.sort() + for v in allv: + tv = t.get(v) + if self.use(v,tv) and not self.toocommon(v,tv): + f.write('%s -> %s' % ( self.fix(k),self.fix(v) ) ) + self.write_attributes(f,self.edge_attributes(k,v)) + f.write(';\n') + f.write(self.fix(k)) + self.write_attributes(f,self.node_attributes(k,tk)) + f.write(';\n') + f.write('}\n') + + def write_attributes(self,f,a): + if a: + f.write(' [') + f.write(','.join(a)) + f.write(']') + + def node_attributes(self,k,type): + a = [] + a.append('label="%s"' % self.label(k)) + if self.colored: + a.append('fillcolor="%s"' % self.color(k,type)) + else: + a.append('fillcolor=white') + if self.toocommon(k,type): + a.append('peripheries=2') + return a + + def edge_attributes(self,k,v): + a = [] + weight = self.weight(k,v) + if weight!=1: + a.append('weight=%d' % weight) + length = self.alien(k,v) + if length: + a.append('minlen=%d' % length) + return a + + def get_data(self): + t = eval(sys.stdin.read()) + return t['depgraph'],t['types'] + + def get_output_file(self): + return sys.stdout + + def use(self,s,type): + # Return true if this module is interesting and should be drawn. Return false + # if it should be completely omitted. This is a default policy - please override. + if s=='__main__': + return 0 + #if s in ('os','sys','time','__future__','types','re','string'): + if s in ('sys'): + # nearly all modules use all of these... more or less. They add nothing to + # our diagram. + return 0 + if s.startswith('encodings.'): + return 0 + if self.toocommon(s,type): + # A module where we dont want to draw references _to_. Dot doesnt handle these + # well, so it is probably best to not draw them at all. + return 0 + return 1 + + def toocommon(self,s,type): + # Return true if references to this module are uninteresting. Such references + # do not get drawn. This is a default policy - please override. + # + if s=='__main__': + # references *to* __main__ are never interesting. omitting them means + # that main floats to the top of the page + return 1 + #if type==imp.PKG_DIRECTORY: + # # dont draw references to packages. + # return 1 + return 0 + + def weight(self,a,b): + # Return the weight of the dependency from a to b. Higher weights + # usually have shorter straighter edges. Return 1 if it has normal weight. + # A value of 4 is usually good for ensuring that a related pair of modules + # are drawn next to each other. This is a default policy - please override. + # + if b.split('.')[-1].startswith('_'): + # A module that starts with an underscore. You need a special reason to + # import these (for example random imports _random), so draw them close + # together + return 4 + return 1 + + def alien(self,a,b): + # Return non-zero if references to this module are strange, and should be drawn + # extra-long. the value defines the length, in rank. This is also good for putting some + # vertical space between seperate subsystems. This is a default policy - please override. + # + return 0 + + def label(self,s): + # Convert a module name to a formatted node label. This is a default policy - please override. + # + return '\\.\\n'.join(s.split('.')) + + def color(self,s,type): + # Return the node color for this module name. This is a default policy - please override. + # + # Calculate a color systematically based on the hash of the module name. Modules in the + # same package have the same color. Unpackaged modules are grey + t = self.normalise_module_name_for_hash_coloring(s,type) + return self.color_from_name(t) + + def normalise_module_name_for_hash_coloring(self,s,type): + if type==imp.PKG_DIRECTORY: + return s + else: + i = s.rfind('.') + if i<0: + return '' + else: + return s[:i] + + def color_from_name(self,name): + n = hashlib.md5(name.encode('utf-8')).digest() + hf = float(n[0]+n[1]*0xff)/0xffff + sf = float(n[2])/0xff + vf = float(n[3])/0xff + r,g,b = colorsys.hsv_to_rgb(hf, 0.3+0.6*sf, 0.8+0.2*vf) + return '#%02x%02x%02x' % (r*256,g*256,b*256) + + +def main(): + pydepgraphdot().main(sys.argv[1:]) + +if __name__=='__main__': + main() + + + --- python3.4-3.4.2~rc1.orig/debian/dh_doclink +++ python3.4-3.4.2~rc1/debian/dh_doclink @@ -0,0 +1,28 @@ +#! /bin/sh + +pkg=`echo $1 | sed 's/^-p//'` +target=$2 + +ln -sf $target debian/$pkg/usr/share/doc/$pkg + +f=debian/$pkg.postinst.debhelper +if [ ! -e $f ] || [ "`grep -c '^# dh_doclink' $f`" -eq 0 ]; then +cat >> $f <> $f <. +# + +set -e + +DIRLIST="/usr/lib/python@VER@/idlelib" + +case "$1" in + configure|abort-upgrade|abort-remove|abort-deconfigure) + + for i in $DIRLIST ; do + @PVER@ /usr/lib/@PVER@/compileall.py -q $i + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config + then + @PVER@ -O /usr/lib/@PVER@/compileall.py -q $i + fi + done + ;; + + *) + echo "postinst called with unknown argument \`$1'" >&2 + exit 1 + ;; + +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/idle-PVER.postrm.in +++ python3.4-3.4.2~rc1/debian/idle-PVER.postrm.in @@ -0,0 +1,11 @@ +#! /bin/sh + +set -e + +if [ "$1" = "purge" ]; then + rm -rf /etc/idle-@PVER@ +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/idle-PVER.prerm.in +++ python3.4-3.4.2~rc1/debian/idle-PVER.prerm.in @@ -0,0 +1,33 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars=$max echo \ + | while read files; do rm -f $files; done + find /usr/lib/@PVER@ -name dist-packages -prune -o -name __pycache__ -empty -print \ + | xargs -r rm -rf +} + +case "$1" in + remove|upgrade) + remove_bytecode idle-@PVER@ + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/idle.desktop.in +++ python3.4-3.4.2~rc1/debian/idle.desktop.in @@ -0,0 +1,9 @@ +[Desktop Entry] +Name=IDLE (using Python-@VER@) +Comment=Integrated Development Environment for Python (using Python-@VER@) +Exec=/usr/bin/idle-@PVER@ +Icon=/usr/share/pixmaps/@PVER@.xpm +Terminal=false +Type=Application +Categories=Application;Development; +StartupNotify=true --- python3.4-3.4.2~rc1.orig/debian/libPVER-dbg.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER-dbg.overrides.in @@ -0,0 +1,13 @@ +lib@PVER@-dbg binary: package-name-doesnt-match-sonames +lib@PVER@-dbg binary: non-dev-pkg-with-shlib-symlink + +# no, it's not unusual +lib@PVER@-dbg binary: unusual-interpreter + +# just the gdb debug file +lib@PVER@-dbg binary: python-script-but-no-python-dep + +# pointless lintian ... +lib@PVER@-dbg binary: hardening-no-fortify-functions + +lib@PVER@-dbg binary: arch-dependent-file-not-in-arch-specific-directory --- python3.4-3.4.2~rc1.orig/debian/libPVER-dbg.prerm.in +++ python3.4-3.4.2~rc1/debian/libPVER-dbg.prerm.in @@ -0,0 +1,23 @@ +#! /bin/sh + +set -e + +case "$1" in + remove) + dpkg -L lib@PVER@-dbg@HOST_QUAL@ \ + | awk '/\.py$/ {print $0"c\n" $0"o"}' \ + | xargs -r rm -f >&2 + ;; + upgrade) + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/libPVER-dbg.symbols.i386.in +++ python3.4-3.4.2~rc1/debian/libPVER-dbg.symbols.i386.in @@ -0,0 +1,30 @@ +libpython@VER@dm.so.1.0 libpython@VER@-dbg #MINVER# +#include "libpython.symbols" + _Py_force_double@Base @SVER@ + _Py_get_387controlword@Base @SVER@ + _Py_set_387controlword@Base @SVER@ + _PyDict_Dummy@Base @SVER@ + _PyObject_DebugMallocStats@Base @SVER@ + _PySet_Dummy@Base @SVER@ + _PyUnicode_CheckConsistency@Base @SVER@ + _PyUnicode_Dump@Base @SVER@ + _PyUnicode_compact_data@Base @SVER@ + _PyUnicode_data@Base @SVER@ + _PyUnicode_utf8@Base @SVER@ + _Py_AddToAllObjects@Base @SVER@ + _Py_Dealloc@Base @SVER@ + _Py_ForgetReference@Base @SVER@ + _Py_GetObjects@Base @SVER@ + _Py_GetRefTotal@Base @SVER@ + _Py_HashSecret_Initialized@Base @SVER@ + _Py_NegativeRefcount@Base @SVER@ + _Py_NewReference@Base @SVER@ + _Py_PrintReferenceAddresses@Base @SVER@ + _Py_PrintReferences@Base @SVER@ + _Py_RefTotal@Base @SVER@ + _Py_dumptree@Base @SVER@ + _Py_hashtable_print_stats@Base @SVER@ + _Py_printtree@Base @SVER@ + _Py_showtree@Base @SVER@ + _Py_tok_dump@Base @SVER@ + PyModule_Create2TraceRefs@Base @SVER@ --- python3.4-3.4.2~rc1.orig/debian/libPVER-dbg.symbols.in +++ python3.4-3.4.2~rc1/debian/libPVER-dbg.symbols.in @@ -0,0 +1,27 @@ +libpython@VER@dm.so.1.0 libpython@VER@-dbg #MINVER# +#include "libpython.symbols" + _PyDict_Dummy@Base @SVER@ + _PyObject_DebugMallocStats@Base @SVER@ + _PySet_Dummy@Base @SVER@ + _PyUnicode_CheckConsistency@Base @SVER@ + _PyUnicode_Dump@Base @SVER@ + _PyUnicode_compact_data@Base @SVER@ + _PyUnicode_data@Base @SVER@ + _PyUnicode_utf8@Base @SVER@ + _Py_AddToAllObjects@Base @SVER@ + _Py_Dealloc@Base @SVER@ + _Py_ForgetReference@Base @SVER@ + _Py_GetObjects@Base @SVER@ + _Py_GetRefTotal@Base @SVER@ + _Py_HashSecret_Initialized@Base @SVER@ + _Py_NegativeRefcount@Base @SVER@ + _Py_NewReference@Base @SVER@ + _Py_PrintReferenceAddresses@Base @SVER@ + _Py_PrintReferences@Base @SVER@ + _Py_RefTotal@Base @SVER@ + _Py_dumptree@Base @SVER@ + _Py_hashtable_print_stats@Base @SVER@ + _Py_printtree@Base @SVER@ + _Py_showtree@Base @SVER@ + _Py_tok_dump@Base @SVER@ + PyModule_Create2TraceRefs@Base @SVER@ --- python3.4-3.4.2~rc1.orig/debian/libPVER-dev.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER-dev.overrides.in @@ -0,0 +1,3 @@ +lib@PVER@-dev binary: python-script-but-no-python-dep + +lib@PVER@-dev binary: arch-dependent-file-not-in-arch-specific-directory --- python3.4-3.4.2~rc1.orig/debian/libPVER-minimal.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER-minimal.overrides.in @@ -0,0 +1,5 @@ +# intentional +lib@PVER@-minimal binary: python-script-but-no-python-dep + +# lintian omission, multiarch string is encoded in the filename +lib@PVER@-minimal binary: arch-dependent-file-not-in-arch-specific-directory --- python3.4-3.4.2~rc1.orig/debian/libPVER-minimal.postinst.in +++ python3.4-3.4.2~rc1/debian/libPVER-minimal.postinst.in @@ -0,0 +1,13 @@ +#! /bin/sh + +set -e + +if [ ! -f /etc/@PVER@/sitecustomize.py ]; then + cat <<-EOF + # Empty sitecustomize.py to avoid a dangling symlink +EOF +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/libPVER-minimal.postrm.in +++ python3.4-3.4.2~rc1/debian/libPVER-minimal.postrm.in @@ -0,0 +1,21 @@ +#! /bin/sh + +set -e + +if [ "$1" = "purge" ]; then + pc=$(dpkg-query -f '${db:Status-Abbrev} ${binary:Package}\n' -W pkgname \ + | grep -v '^.n' | wc -l) + if [ "$pc" -lt 1 ]; then + find /usr/lib/@PVER@ -depth -type d -name __pycache__ \ + | xargs -r rm -rf + rm -f /etc/@PVER@/sitecustomize.py + rm -rf /etc/@PVER@/__pycache__ + if [ -d /etc/@PVER@ ]; then + rmdir --ignore-fail-on-non-empty /etc/@PVER@ + fi + fi +fi + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/libPVER-minimal.prerm.in +++ python3.4-3.4.2~rc1/debian/libPVER-minimal.prerm.in @@ -0,0 +1,41 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars="$max" echo \ + | while read files; do rm -f $files; done + find /usr/lib/python3 /usr/lib/@PVER@ \ + $ -name dist-packages -prune $ -o \ + $ -name __pycache__ -type d -empty -print $ \ + | xargs -r rm -rf +} + +case "$1" in + remove) + pc=$(dpkg-query -f '${db:Status-Abbrev} ${binary:Package}\n' -W pkgname \ + | grep -v '^.n' | wc -l) + if [ "$pc" -le 1 ]; then + remove_bytecode lib@PVER@-minimal@HOST_QUAL@ + fi + ;; + upgrade) + remove_bytecode lib@PVER@-minimal@HOST_QUAL@ + # byte compilation in @PVER@-minimal postinst, strict dependency + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/libPVER-stdlib.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER-stdlib.overrides.in @@ -0,0 +1,15 @@ +# idlelib images +lib@PVER@-stdlib binary: image-file-in-usr-lib + +# license file referred by the standard library +lib@PVER@-stdlib binary: extra-license-file + +# template files +lib@PVER@-stdlib binary: interpreter-not-absolute usr/lib/@PVER@/venv/scripts/posix/pydoc #!__VENV_PYTHON__ +lib@PVER@-stdlib binary: unusual-interpreter usr/lib/@PVER@/venv/scripts/posix/pydoc #!__VENV_PYTHON__ + +# the split is the reason for that +lib@PVER@-stdlib binary: python-script-but-no-python-dep + +# lintian omission, multiarch string is encoded in the filename +lib@PVER@-stdlib binary: arch-dependent-file-not-in-arch-specific-directory --- python3.4-3.4.2~rc1.orig/debian/libPVER-stdlib.prerm.in +++ python3.4-3.4.2~rc1/debian/libPVER-stdlib.prerm.in @@ -0,0 +1,41 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars="$max" echo \ + | while read files; do rm -f $files; done + find /usr/lib/python3 /usr/lib/@PVER@ \ + $ -name dist-packages -prune $ -o \ + $ -name __pycache__ -type d -empty -print $ \ + | xargs -r rm -rf +} + +case "$1" in + remove) + pc=$(dpkg-query -f '${db:Status-Abbrev} ${binary:Package}\n' -W pkgname \ + | grep -v '^.n' | wc -l) + if [ "$pc" -le 1 ]; then + remove_bytecode lib@PVER@-stdlib@HOST_QUAL@ + fi + ;; + upgrade) + remove_bytecode lib@PVER@-stdlib@HOST_QUAL@ + # byte compilation in @PVER@ postinst, strict dependency + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/libPVER-testsuite.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER-testsuite.overrides.in @@ -0,0 +1,2 @@ +lib@PVER@-testsuite binary: python-script-but-no-python-dep +lib@PVER@-testsuite binary: image-file-in-usr-lib --- python3.4-3.4.2~rc1.orig/debian/libPVER-testsuite.postinst.in +++ python3.4-3.4.2~rc1/debian/libPVER-testsuite.postinst.in @@ -0,0 +1,20 @@ +#! /bin/sh + +set -e + +case "$1" in + configure) + files=$(dpkg -L lib@PVER@-testsuite | sed -n '/^\/usr\/lib\/@PVER@\/.*\.py$/p' | egrep -v '/lib2to3/tests/data|/test/bad') + if [ -n "$files" ]; then + @PVER@ -E -S /usr/lib/@PVER@/py_compile.py $files + if grep -sq '^byte-compile[^#]*optimize' /etc/python/debian_config; then + @PVER@ -E -S -O /usr/lib/@PVER@/py_compile.py $files + fi + else + echo >&2 "@PVER@: can't get files for byte-compilation" + fi +esac + +#DEBHELPER# + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/libPVER-testsuite.prerm.in +++ python3.4-3.4.2~rc1/debian/libPVER-testsuite.prerm.in @@ -0,0 +1,36 @@ +#! /bin/sh + +set -e + +remove_bytecode() +{ + pkg=$1 + max=$(LANG=C LC_ALL=C xargs --show-limits < /dev/null 2>&1 | awk '/Maximum/ {print int($NF / 4)}') + dpkg -L $pkg \ + | awk -F/ 'BEGIN {OFS="/"} /\.py$/ {$NF=sprintf("__pycache__/%s.*.py[co]", substr($NF,1,length($NF)-3)); print}' \ + | xargs --max-chars="$max" echo \ + | while read files; do rm -f $files; done + + find /usr/lib/@PVER@ \ + -name __pycache__ -type d -empty -print \ + | xargs -r rm -rf +} + +case "$1" in + remove) + remove_bytecode lib@PVER@-testsuite + ;; + upgrade) + remove_bytecode lib@PVER@-testsuite + ;; + deconfigure) + ;; + failed-upgrade) + ;; + *) + echo "prerm called with unknown argument \`$1'" >&2 + exit 1 + ;; +esac + +#DEBHELPER# --- python3.4-3.4.2~rc1.orig/debian/libPVER.overrides.in +++ python3.4-3.4.2~rc1/debian/libPVER.overrides.in @@ -0,0 +1 @@ +lib@PVER@ binary: package-name-doesnt-match-sonames --- python3.4-3.4.2~rc1.orig/debian/libPVER.symbols.i386.in +++ python3.4-3.4.2~rc1/debian/libPVER.symbols.i386.in @@ -0,0 +1,8 @@ +libpython@VER@m.so.1.0 libpython@VER@ #MINVER# +#include "libpython.symbols" + PyModule_Create2@Base @SVER@ + _Py_force_double@Base @SVER@ + _Py_get_387controlword@Base @SVER@ + _Py_set_387controlword@Base @SVER@ + + (optional)__gnu_lto_v1@Base @SVER@ --- python3.4-3.4.2~rc1.orig/debian/libPVER.symbols.in +++ python3.4-3.4.2~rc1/debian/libPVER.symbols.in @@ -0,0 +1,5 @@ +libpython@VER@m.so.1.0 libpython@VER@ #MINVER# +#include "libpython.symbols" + PyModule_Create2@Base @SVER@ + + (optional)__gnu_lto_v1@Base @SVER@ --- python3.4-3.4.2~rc1.orig/debian/libPVER.symbols.lpia.in +++ python3.4-3.4.2~rc1/debian/libPVER.symbols.lpia.in @@ -0,0 +1,6 @@ +libpython@VER@m.so.1.0 libpython@VER@ #MINVER# +#include "libpython.symbols" + PyModule_Create2@Base @SVER@ + _Py_force_double@Base @SVER@ + _Py_get_387controlword@Base @SVER@ + _Py_set_387controlword@Base @SVER@ --- python3.4-3.4.2~rc1.orig/debian/libpython.symbols.in +++ python3.4-3.4.2~rc1/debian/libpython.symbols.in @@ -0,0 +1,1567 @@ + PyAST_Check@Base @SVER@ + PyAST_Compile@Base @SVER@ + PyAST_CompileEx@Base @SVER@ + PyAST_CompileObject@Base @SVER@ + PyAST_FromNode@Base @SVER@ + PyAST_FromNodeObject@Base @SVER@ + PyAST_Validate@Base @SVER@ + PyAST_mod2obj@Base @SVER@ + PyAST_obj2mod@Base @SVER@ + PyArena_AddPyObject@Base @SVER@ + PyArena_Free@Base @SVER@ + PyArena_Malloc@Base @SVER@ + PyArena_New@Base @SVER@ + PyArg_Parse@Base @SVER@ + PyArg_ParseTuple@Base @SVER@ + PyArg_ParseTupleAndKeywords@Base @SVER@ + PyArg_UnpackTuple@Base @SVER@ + PyArg_VaParse@Base @SVER@ + PyArg_VaParseTupleAndKeywords@Base @SVER@ + PyArg_ValidateKeywordArguments@Base @SVER@ + PyBaseObject_Type@Base @SVER@ + PyBool_FromLong@Base @SVER@ + PyBool_Type@Base @SVER@ + PyBuffer_FillContiguousStrides@Base @SVER@ + PyBuffer_FillInfo@Base @SVER@ + PyBuffer_FromContiguous@Base @SVER@ + PyBuffer_GetPointer@Base @SVER@ + PyBuffer_IsContiguous@Base @SVER@ + PyBuffer_Release@Base @SVER@ + PyBuffer_ToContiguous@Base @SVER@ + PyBufferedIOBase_Type@Base @SVER@ + PyBufferedRWPair_Type@Base @SVER@ + PyBufferedRandom_Type@Base @SVER@ + PyBufferedReader_Type@Base @SVER@ + PyBufferedWriter_Type@Base @SVER@ + PyByteArrayIter_Type@Base @SVER@ + PyByteArray_AsString@Base @SVER@ + PyByteArray_Concat@Base @SVER@ + PyByteArray_Fini@Base @SVER@ + PyByteArray_FromObject@Base @SVER@ + PyByteArray_FromStringAndSize@Base @SVER@ + PyByteArray_Init@Base @SVER@ + PyByteArray_Resize@Base @SVER@ + PyByteArray_Size@Base @SVER@ + PyByteArray_Type@Base @SVER@ + PyBytesIO_Type@Base @SVER@ + PyBytesIter_Type@Base @SVER@ + PyBytes_AsString@Base @SVER@ + PyBytes_AsStringAndSize@Base @SVER@ + PyBytes_Concat@Base @SVER@ + PyBytes_ConcatAndDel@Base @SVER@ + PyBytes_DecodeEscape@Base @SVER@ + PyBytes_Fini@Base @SVER@ + PyBytes_FromFormat@Base @SVER@ + PyBytes_FromFormatV@Base @SVER@ + PyBytes_FromObject@Base @SVER@ + PyBytes_FromString@Base @SVER@ + PyBytes_FromStringAndSize@Base @SVER@ + PyBytes_Repr@Base @SVER@ + PyBytes_Size@Base @SVER@ + PyBytes_Type@Base @SVER@ + (optional)PyCArgObject_new@Base @SVER@ + (optional)PyCArg_Type@Base @SVER@ + (optional)PyCArrayType_Type@Base @SVER@ + (optional)PyCArrayType_from_ctype@Base @SVER@ + (optional)PyCArray_Type@Base @SVER@ + (optional)PyCData_AtAddress@Base @SVER@ + (optional)PyCData_FromBaseObj@Base @SVER@ + (optional)PyCData_Type@Base @SVER@ + (optional)PyCData_get@Base @SVER@ + (optional)PyCData_set@Base @SVER@ + (optional)PyCField_FromDesc@Base @SVER@ + (optional)PyCField_Type@Base @SVER@ + (optional)PyCFuncPtrType_Type@Base @SVER@ + (optional)PyCFuncPtr_Type@Base @SVER@ + PyCFunction_Call@Base @SVER@ + PyCFunction_ClearFreeList@Base @SVER@ + PyCFunction_Fini@Base @SVER@ + PyCFunction_GetFlags@Base @SVER@ + PyCFunction_GetFunction@Base @SVER@ + PyCFunction_GetSelf@Base @SVER@ + PyCFunction_New@Base @SVER@ + PyCFunction_NewEx@Base @SVER@ + PyCFunction_Type@Base @SVER@ + (optional)PyCPointerType_Type@Base @SVER@ + (optional)PyCPointer_Type@Base @SVER@ + (optional)PyCSimpleType_Type@Base @SVER@ + (optional)PyCStgDict_Type@Base @SVER@ + (optional)PyCStgDict_clone@Base @SVER@ + (optional)PyCStructType_Type@Base @SVER@ + (optional)PyCStructUnionType_update_stgdict@Base @SVER@ + (optional)PyCThunk_Type@Base @SVER@ + PyCallIter_New@Base @SVER@ + PyCallIter_Type@Base @SVER@ + PyCallable_Check@Base @SVER@ + PyCapsule_GetContext@Base @SVER@ + PyCapsule_GetDestructor@Base @SVER@ + PyCapsule_GetName@Base @SVER@ + PyCapsule_GetPointer@Base @SVER@ + PyCapsule_Import@Base @SVER@ + PyCapsule_IsValid@Base @SVER@ + PyCapsule_New@Base @SVER@ + PyCapsule_SetContext@Base @SVER@ + PyCapsule_SetDestructor@Base @SVER@ + PyCapsule_SetName@Base @SVER@ + PyCapsule_SetPointer@Base @SVER@ + PyCapsule_Type@Base @SVER@ + PyCell_Get@Base @SVER@ + PyCell_New@Base @SVER@ + PyCell_Set@Base @SVER@ + PyCell_Type@Base @SVER@ + PyClassMethodDescr_Type@Base @SVER@ + PyClassMethod_New@Base @SVER@ + PyClassMethod_Type@Base @SVER@ + PyCode_Addr2Line@Base @SVER@ + PyCode_New@Base @SVER@ + PyCode_NewEmpty@Base @SVER@ + PyCode_Optimize@Base @SVER@ + PyCode_Type@Base @SVER@ + PyCodec_BackslashReplaceErrors@Base @SVER@ + PyCodec_Decode@Base @SVER@ + PyCodec_Decoder@Base @SVER@ + PyCodec_Encode@Base @SVER@ + PyCodec_Encoder@Base @SVER@ + PyCodec_IgnoreErrors@Base @SVER@ + PyCodec_IncrementalDecoder@Base @SVER@ + PyCodec_IncrementalEncoder@Base @SVER@ + PyCodec_KnownEncoding@Base @SVER@ + PyCodec_LookupError@Base @SVER@ + PyCodec_Register@Base @SVER@ + PyCodec_RegisterError@Base @SVER@ + PyCodec_ReplaceErrors@Base @SVER@ + PyCodec_StreamReader@Base @SVER@ + PyCodec_StreamWriter@Base @SVER@ + PyCodec_StrictErrors@Base @SVER@ + PyCodec_XMLCharRefReplaceErrors@Base @SVER@ + PyCompileString@Base @SVER@ + PyCompile_OpcodeStackEffect@Base @SVER@ + PyComplex_AsCComplex@Base @SVER@ + PyComplex_FromCComplex@Base @SVER@ + PyComplex_FromDoubles@Base @SVER@ + PyComplex_ImagAsDouble@Base @SVER@ + PyComplex_RealAsDouble@Base @SVER@ + PyComplex_Type@Base @SVER@ + PyDescr_NewClassMethod@Base @SVER@ + PyDescr_NewGetSet@Base @SVER@ + PyDescr_NewMember@Base @SVER@ + PyDescr_NewMethod@Base @SVER@ + PyDescr_NewWrapper@Base @SVER@ + PyDictItems_Type@Base @SVER@ + PyDictIterItem_Type@Base @SVER@ + PyDictIterKey_Type@Base @SVER@ + PyDictIterValue_Type@Base @SVER@ + PyDictKeys_Type@Base @SVER@ + PyDictProxy_New@Base @SVER@ + PyDictProxy_Type@Base @SVER@ + PyDictValues_Type@Base @SVER@ + PyDict_Clear@Base @SVER@ + PyDict_ClearFreeList@Base @SVER@ + PyDict_Contains@Base @SVER@ + PyDict_Copy@Base @SVER@ + PyDict_DelItem@Base @SVER@ + PyDict_DelItemString@Base @SVER@ + PyDict_Fini@Base @SVER@ + PyDict_GetItem@Base @SVER@ + (optional)PyDict_GetItemProxy@Base @SVER@ + PyDict_GetItemString@Base @SVER@ + PyDict_GetItemWithError@Base @SVER@ + PyDict_Items@Base @SVER@ + PyDict_Keys@Base @SVER@ + PyDict_Merge@Base @SVER@ + PyDict_MergeFromSeq2@Base @SVER@ + PyDict_New@Base @SVER@ + PyDict_Next@Base @SVER@ + PyDict_SetDefault@Base @SVER@ + PyDict_SetItem@Base @SVER@ + (optional)PyDict_SetItemProxy@Base @SVER@ + PyDict_SetItemString@Base @SVER@ + PyDict_Size@Base @SVER@ + PyDict_Type@Base @SVER@ + PyDict_Update@Base @SVER@ + PyDict_Values@Base @SVER@ + PyEllipsis_Type@Base @SVER@ + PyEnum_Type@Base @SVER@ + PyErr_BadArgument@Base @SVER@ + PyErr_BadInternalCall@Base @SVER@ + PyErr_CheckSignals@Base @SVER@ + PyErr_Clear@Base @SVER@ + PyErr_Display@Base @SVER@ + PyErr_ExceptionMatches@Base @SVER@ + PyErr_Fetch@Base @SVER@ + PyErr_Format@Base @SVER@ + PyErr_GetExcInfo@Base @SVER@ + PyErr_GivenExceptionMatches@Base @SVER@ + PyErr_NewException@Base @SVER@ + PyErr_NewExceptionWithDoc@Base @SVER@ + PyErr_NoMemory@Base @SVER@ + PyErr_NormalizeException@Base @SVER@ + PyErr_Occurred@Base @SVER@ + PyErr_Print@Base @SVER@ + PyErr_PrintEx@Base @SVER@ + PyErr_ProgramText@Base @SVER@ + PyErr_ProgramTextObject@Base @SVER@ + PyErr_Restore@Base @SVER@ + PyErr_SetExcInfo@Base @SVER@ + PyErr_SetFromErrno@Base @SVER@ + PyErr_SetFromErrnoWithFilename@Base @SVER@ + PyErr_SetFromErrnoWithFilenameObject@Base @SVER@ + PyErr_SetFromErrnoWithFilenameObjects@Base @SVER@ + PyErr_SetImportError@Base @SVER@ + PyErr_SetInterrupt@Base @SVER@ + PyErr_SetNone@Base @SVER@ + PyErr_SetObject@Base @SVER@ + PyErr_SetString@Base @SVER@ + PyErr_SyntaxLocation@Base @SVER@ + PyErr_SyntaxLocationEx@Base @SVER@ + PyErr_SyntaxLocationObject@Base @SVER@ + PyErr_Warn@Base @SVER@ + PyErr_WarnEx@Base @SVER@ + PyErr_WarnExplicit@Base @SVER@ + PyErr_WarnExplicitFormat@Base @SVER@ + PyErr_WarnExplicitObject@Base @SVER@ + PyErr_WarnFormat@Base @SVER@ + PyErr_WriteUnraisable@Base @SVER@ + PyEval_AcquireLock@Base @SVER@ + PyEval_AcquireThread@Base @SVER@ + PyEval_CallFunction@Base @SVER@ + PyEval_CallMethod@Base @SVER@ + PyEval_CallObjectWithKeywords@Base @SVER@ + PyEval_EvalCode@Base @SVER@ + PyEval_EvalCodeEx@Base @SVER@ + PyEval_EvalFrame@Base @SVER@ + PyEval_EvalFrameEx@Base @SVER@ + PyEval_GetBuiltins@Base @SVER@ + PyEval_GetCallStats@Base @SVER@ + PyEval_GetFrame@Base @SVER@ + PyEval_GetFuncDesc@Base @SVER@ + PyEval_GetFuncName@Base @SVER@ + PyEval_GetGlobals@Base @SVER@ + PyEval_GetLocals@Base @SVER@ + PyEval_InitThreads@Base @SVER@ + PyEval_MergeCompilerFlags@Base @SVER@ + PyEval_ReInitThreads@Base @SVER@ + PyEval_ReleaseLock@Base @SVER@ + PyEval_ReleaseThread@Base @SVER@ + PyEval_RestoreThread@Base @SVER@ + PyEval_SaveThread@Base @SVER@ + PyEval_SetProfile@Base @SVER@ + PyEval_SetTrace@Base @SVER@ + PyEval_ThreadsInitialized@Base @SVER@ + (optional)PyExc_ArgError@Base @SVER@ + PyExc_ArithmeticError@Base @SVER@ + PyExc_AssertionError@Base @SVER@ + PyExc_AttributeError@Base @SVER@ + PyExc_BaseException@Base @SVER@ + PyExc_BlockingIOError@Base @SVER@ + PyExc_BrokenPipeError@Base @SVER@ + PyExc_BufferError@Base @SVER@ + PyExc_BytesWarning@Base @SVER@ + PyExc_ChildProcessError@Base @SVER@ + PyExc_ConnectionAbortedError@Base @SVER@ + PyExc_ConnectionError@Base @SVER@ + PyExc_ConnectionRefusedError@Base @SVER@ + PyExc_ConnectionResetError@Base @SVER@ + PyExc_DeprecationWarning@Base @SVER@ + PyExc_EOFError@Base @SVER@ + PyExc_EnvironmentError@Base @SVER@ + PyExc_Exception@Base @SVER@ + PyExc_FileExistsError@Base @SVER@ + PyExc_FileNotFoundError@Base @SVER@ + PyExc_FloatingPointError@Base @SVER@ + PyExc_FutureWarning@Base @SVER@ + PyExc_GeneratorExit@Base @SVER@ + PyExc_IOError@Base @SVER@ + PyExc_ImportError@Base @SVER@ + PyExc_ImportWarning@Base @SVER@ + PyExc_IndentationError@Base @SVER@ + PyExc_IndexError@Base @SVER@ + PyExc_InterruptedError@Base @SVER@ + PyExc_IsADirectoryError@Base @SVER@ + PyExc_KeyError@Base @SVER@ + PyExc_KeyboardInterrupt@Base @SVER@ + PyExc_LookupError@Base @SVER@ + PyExc_MemoryError@Base @SVER@ + PyExc_NameError@Base @SVER@ + PyExc_NotADirectoryError@Base @SVER@ + PyExc_NotImplementedError@Base @SVER@ + PyExc_OSError@Base @SVER@ + PyExc_OverflowError@Base @SVER@ + PyExc_PendingDeprecationWarning@Base @SVER@ + PyExc_PermissionError@Base @SVER@ + PyExc_ProcessLookupError@Base @SVER@ + PyExc_RecursionErrorInst@Base @SVER@ + PyExc_ReferenceError@Base @SVER@ + PyExc_ResourceWarning@Base @SVER@ + PyExc_RuntimeError@Base @SVER@ + PyExc_RuntimeWarning@Base @SVER@ + PyExc_StopIteration@Base @SVER@ + PyExc_SyntaxError@Base @SVER@ + PyExc_SyntaxWarning@Base @SVER@ + PyExc_SystemError@Base @SVER@ + PyExc_SystemExit@Base @SVER@ + PyExc_TabError@Base @SVER@ + PyExc_TimeoutError@Base @SVER@ + PyExc_TypeError@Base @SVER@ + PyExc_UnboundLocalError@Base @SVER@ + PyExc_UnicodeDecodeError@Base @SVER@ + PyExc_UnicodeEncodeError@Base @SVER@ + PyExc_UnicodeError@Base @SVER@ + PyExc_UnicodeTranslateError@Base @SVER@ + PyExc_UnicodeWarning@Base @SVER@ + PyExc_UserWarning@Base @SVER@ + PyExc_ValueError@Base @SVER@ + PyExc_Warning@Base @SVER@ + PyExc_ZeroDivisionError@Base @SVER@ + PyException_GetCause@Base @SVER@ + PyException_GetContext@Base @SVER@ + PyException_GetTraceback@Base @SVER@ + PyException_SetCause@Base @SVER@ + PyException_SetContext@Base @SVER@ + PyException_SetTraceback@Base @SVER@ + PyFPE_counter@Base @SVER@ + PyFPE_dummy@Base @SVER@ + PyFPE_jbuf@Base @SVER@ + PyFileIO_Type@Base @SVER@ + PyFile_FromFd@Base @SVER@ + PyFile_GetLine@Base @SVER@ + PyFile_NewStdPrinter@Base @SVER@ + PyFile_WriteObject@Base @SVER@ + PyFile_WriteString@Base @SVER@ + PyFilter_Type@Base @SVER@ + PyFloat_AsDouble@Base @SVER@ + PyFloat_ClearFreeList@Base @SVER@ + PyFloat_Fini@Base @SVER@ + PyFloat_FromDouble@Base @SVER@ + PyFloat_FromString@Base @SVER@ + PyFloat_GetInfo@Base @SVER@ + PyFloat_GetMax@Base @SVER@ + PyFloat_GetMin@Base @SVER@ + PyFloat_Type@Base @SVER@ + PyFrame_BlockPop@Base @SVER@ + PyFrame_BlockSetup@Base @SVER@ + PyFrame_ClearFreeList@Base @SVER@ + PyFrame_FastToLocals@Base @SVER@ + PyFrame_FastToLocalsWithError@Base @SVER@ + PyFrame_Fini@Base @SVER@ + PyFrame_GetLineNumber@Base @SVER@ + PyFrame_LocalsToFast@Base @SVER@ + PyFrame_New@Base @SVER@ + PyFrame_Type@Base @SVER@ + PyFrozenSet_New@Base @SVER@ + PyFrozenSet_Type@Base @SVER@ + PyFunction_GetAnnotations@Base @SVER@ + PyFunction_GetClosure@Base @SVER@ + PyFunction_GetCode@Base @SVER@ + PyFunction_GetDefaults@Base @SVER@ + PyFunction_GetGlobals@Base @SVER@ + PyFunction_GetKwDefaults@Base @SVER@ + PyFunction_GetModule@Base @SVER@ + PyFunction_New@Base @SVER@ + PyFunction_NewWithQualName@Base @SVER@ + PyFunction_SetAnnotations@Base @SVER@ + PyFunction_SetClosure@Base @SVER@ + PyFunction_SetDefaults@Base @SVER@ + PyFunction_SetKwDefaults@Base @SVER@ + PyFunction_Type@Base @SVER@ + PyFuture_FromAST@Base @SVER@ + PyFuture_FromASTObject@Base @SVER@ + PyGC_Collect@Base @SVER@ + PyGILState_Check@Base @SVER@ + PyGILState_Ensure@Base @SVER@ + PyGILState_GetThisThreadState@Base @SVER@ + PyGILState_Release@Base @SVER@ + PyGen_NeedsFinalizing@Base @SVER@ + PyGen_New@Base @SVER@ + PyGen_Type@Base @SVER@ + PyGetSetDescr_Type@Base @SVER@ + PyGrammar_AddAccelerators@Base @SVER@ + PyGrammar_FindDFA@Base @SVER@ + PyGrammar_LabelRepr@Base @SVER@ + PyGrammar_RemoveAccelerators@Base @SVER@ + PyHash_GetFuncDef@Base @SVER@ + PyIOBase_Type@Base @SVER@ + PyImport_AddModule@Base @SVER@ + PyImport_AddModuleObject@Base @SVER@ + PyImport_AppendInittab@Base @SVER@ + PyImport_Cleanup@Base @SVER@ + PyImport_ExecCodeModule@Base @SVER@ + PyImport_ExecCodeModuleEx@Base @SVER@ + PyImport_ExecCodeModuleObject@Base @SVER@ + PyImport_ExecCodeModuleWithPathnames@Base @SVER@ + PyImport_ExtendInittab@Base @SVER@ + PyImport_FrozenModules@Base @SVER@ + PyImport_GetImporter@Base @SVER@ + PyImport_GetMagicNumber@Base @SVER@ + PyImport_GetMagicTag@Base @SVER@ + PyImport_GetModuleDict@Base @SVER@ + PyImport_Import@Base @SVER@ + PyImport_ImportFrozenModule@Base @SVER@ + PyImport_ImportFrozenModuleObject@Base @SVER@ + PyImport_ImportModule@Base @SVER@ + PyImport_ImportModuleLevel@Base @SVER@ + PyImport_ImportModuleLevelObject@Base @SVER@ + PyImport_ImportModuleNoBlock@Base @SVER@ + PyImport_Inittab@Base @SVER@ + PyImport_ReloadModule@Base @SVER@ + PyIncrementalNewlineDecoder_Type@Base @SVER@ + PyInstanceMethod_Function@Base @SVER@ + PyInstanceMethod_New@Base @SVER@ + PyInstanceMethod_Type@Base @SVER@ + PyInterpreterState_Clear@Base @SVER@ + PyInterpreterState_Delete@Base @SVER@ + PyInterpreterState_Head@Base @SVER@ + PyInterpreterState_New@Base @SVER@ + PyInterpreterState_Next@Base @SVER@ + PyInterpreterState_ThreadHead@Base @SVER@ + PyIter_Next@Base @SVER@ + PyListIter_Type@Base @SVER@ + PyListRevIter_Type@Base @SVER@ + PyList_Append@Base @SVER@ + PyList_AsTuple@Base @SVER@ + PyList_ClearFreeList@Base @SVER@ + PyList_Fini@Base @SVER@ + PyList_GetItem@Base @SVER@ + PyList_GetSlice@Base @SVER@ + PyList_Insert@Base @SVER@ + PyList_New@Base @SVER@ + PyList_Reverse@Base @SVER@ + PyList_SetItem@Base @SVER@ + PyList_SetSlice@Base @SVER@ + PyList_Size@Base @SVER@ + PyList_Sort@Base @SVER@ + PyList_Type@Base @SVER@ + PyLongRangeIter_Type@Base @SVER@ + PyLong_AsDouble@Base @SVER@ + PyLong_AsLong@Base @SVER@ + PyLong_AsLongAndOverflow@Base @SVER@ + PyLong_AsLongLong@Base @SVER@ + PyLong_AsLongLongAndOverflow@Base @SVER@ + PyLong_AsSize_t@Base @SVER@ + PyLong_AsSsize_t@Base @SVER@ + PyLong_AsUnsignedLong@Base @SVER@ + PyLong_AsUnsignedLongLong@Base @SVER@ + PyLong_AsUnsignedLongLongMask@Base @SVER@ + PyLong_AsUnsignedLongMask@Base @SVER@ + PyLong_AsVoidPtr@Base @SVER@ + PyLong_Fini@Base @SVER@ + PyLong_FromDouble@Base @SVER@ + PyLong_FromLong@Base @SVER@ + PyLong_FromLongLong@Base @SVER@ + PyLong_FromSize_t@Base @SVER@ + PyLong_FromSsize_t@Base @SVER@ + PyLong_FromString@Base @SVER@ + PyLong_FromUnicode@Base @SVER@ + PyLong_FromUnicodeObject@Base @SVER@ + PyLong_FromUnsignedLong@Base @SVER@ + PyLong_FromUnsignedLongLong@Base @SVER@ + PyLong_FromVoidPtr@Base @SVER@ + PyLong_GetInfo@Base @SVER@ + PyLong_Type@Base @SVER@ + PyMap_Type@Base @SVER@ + PyMapping_Check@Base @SVER@ + PyMapping_GetItemString@Base @SVER@ + PyMapping_HasKey@Base @SVER@ + PyMapping_HasKeyString@Base @SVER@ + PyMapping_Items@Base @SVER@ + PyMapping_Keys@Base @SVER@ + PyMapping_Length@Base @SVER@ + PyMapping_SetItemString@Base @SVER@ + PyMapping_Size@Base @SVER@ + PyMapping_Values@Base @SVER@ + PyMarshal_Init@Base @SVER@ + PyMarshal_ReadLastObjectFromFile@Base @SVER@ + PyMarshal_ReadLongFromFile@Base @SVER@ + PyMarshal_ReadObjectFromFile@Base @SVER@ + PyMarshal_ReadObjectFromString@Base @SVER@ + PyMarshal_ReadShortFromFile@Base @SVER@ + PyMarshal_WriteLongToFile@Base @SVER@ + PyMarshal_WriteObjectToFile@Base @SVER@ + PyMarshal_WriteObjectToString@Base @SVER@ + PyMem_Free@Base @SVER@ + PyMem_GetAllocator@Base @SVER@ + PyMem_Malloc@Base @SVER@ + PyMem_RawFree@Base @SVER@ + PyMem_RawMalloc@Base @SVER@ + PyMem_RawRealloc@Base @SVER@ + PyMem_Realloc@Base @SVER@ + PyMem_SetAllocator@Base @SVER@ + PyMem_SetupDebugHooks@Base @SVER@ + PyMemberDescr_Type@Base @SVER@ + PyMember_GetOne@Base @SVER@ + PyMember_SetOne@Base @SVER@ + PyMemoryView_FromBuffer@Base @SVER@ + PyMemoryView_FromMemory@Base @SVER@ + PyMemoryView_FromObject@Base @SVER@ + PyMemoryView_GetContiguous@Base @SVER@ + PyMemoryView_Type@Base @SVER@ + PyMethodDescr_Type@Base @SVER@ + PyMethod_ClearFreeList@Base @SVER@ + PyMethod_Fini@Base @SVER@ + PyMethod_Function@Base @SVER@ + PyMethod_New@Base @SVER@ + PyMethod_Self@Base @SVER@ + PyMethod_Type@Base @SVER@ + PyModule_AddIntConstant@Base @SVER@ + PyModule_AddObject@Base @SVER@ + PyModule_AddStringConstant@Base @SVER@ + PyModule_GetDef@Base @SVER@ + PyModule_GetDict@Base @SVER@ + PyModule_GetFilename@Base @SVER@ + PyModule_GetFilenameObject@Base @SVER@ + PyModule_GetName@Base @SVER@ + PyModule_GetNameObject@Base @SVER@ + PyModule_GetState@Base @SVER@ + PyModule_GetWarningsModule@Base @SVER@ + PyModule_New@Base @SVER@ + PyModule_NewObject@Base @SVER@ + PyModule_Type@Base @SVER@ + PyNode_AddChild@Base @SVER@ + PyNode_Compile@Base @SVER@ + PyNode_Free@Base @SVER@ + PyNode_ListTree@Base @SVER@ + PyNode_New@Base @SVER@ + PyNumber_Absolute@Base @SVER@ + PyNumber_Add@Base @SVER@ + PyNumber_And@Base @SVER@ + PyNumber_AsOff_t@Base @SVER@ + PyNumber_AsSsize_t@Base @SVER@ + PyNumber_Check@Base @SVER@ + PyNumber_Divmod@Base @SVER@ + PyNumber_Float@Base @SVER@ + PyNumber_FloorDivide@Base @SVER@ + PyNumber_InPlaceAdd@Base @SVER@ + PyNumber_InPlaceAnd@Base @SVER@ + PyNumber_InPlaceFloorDivide@Base @SVER@ + PyNumber_InPlaceLshift@Base @SVER@ + PyNumber_InPlaceMultiply@Base @SVER@ + PyNumber_InPlaceOr@Base @SVER@ + PyNumber_InPlacePower@Base @SVER@ + PyNumber_InPlaceRemainder@Base @SVER@ + PyNumber_InPlaceRshift@Base @SVER@ + PyNumber_InPlaceSubtract@Base @SVER@ + PyNumber_InPlaceTrueDivide@Base @SVER@ + PyNumber_InPlaceXor@Base @SVER@ + PyNumber_Index@Base @SVER@ + PyNumber_Invert@Base @SVER@ + PyNumber_Long@Base @SVER@ + PyNumber_Lshift@Base @SVER@ + PyNumber_Multiply@Base @SVER@ + PyNumber_Negative@Base @SVER@ + PyNumber_Or@Base @SVER@ + PyNumber_Positive@Base @SVER@ + PyNumber_Power@Base @SVER@ + PyNumber_Remainder@Base @SVER@ + PyNumber_Rshift@Base @SVER@ + PyNumber_Subtract@Base @SVER@ + PyNumber_ToBase@Base @SVER@ + PyNumber_TrueDivide@Base @SVER@ + PyNumber_Xor@Base @SVER@ + PyOS_AfterFork@Base @SVER@ + PyOS_FiniInterrupts@Base @SVER@ + PyOS_InitInterrupts@Base @SVER@ + PyOS_InputHook@Base @SVER@ + PyOS_InterruptOccurred@Base @SVER@ + PyOS_Readline@Base @SVER@ + PyOS_ReadlineFunctionPointer@Base @SVER@ + PyOS_StdioReadline@Base @SVER@ + PyOS_double_to_string@Base @SVER@ + PyOS_getsig@Base @SVER@ + PyOS_mystricmp@Base @SVER@ + PyOS_mystrnicmp@Base @SVER@ + PyOS_setsig@Base @SVER@ + PyOS_snprintf@Base @SVER@ + PyOS_string_to_double@Base @SVER@ + PyOS_strtol@Base @SVER@ + PyOS_strtoul@Base @SVER@ + PyOS_vsnprintf@Base @SVER@ + PyObject_ASCII@Base @SVER@ + PyObject_AsCharBuffer@Base @SVER@ + PyObject_AsFileDescriptor@Base @SVER@ + PyObject_AsReadBuffer@Base @SVER@ + PyObject_AsWriteBuffer@Base @SVER@ + PyObject_Bytes@Base @SVER@ + PyObject_Call@Base @SVER@ + PyObject_CallFinalizer@Base @SVER@ + PyObject_CallFinalizerFromDealloc@Base @SVER@ + PyObject_CallFunction@Base @SVER@ + PyObject_CallFunctionObjArgs@Base @SVER@ + PyObject_CallMethod@Base @SVER@ + PyObject_CallMethodObjArgs@Base @SVER@ + PyObject_CallObject@Base @SVER@ + PyObject_CheckReadBuffer@Base @SVER@ + PyObject_ClearWeakRefs@Base @SVER@ + PyObject_CopyData@Base @SVER@ + PyObject_DelItem@Base @SVER@ + PyObject_DelItemString@Base @SVER@ + PyObject_Dir@Base @SVER@ + PyObject_Format@Base @SVER@ + PyObject_Free@Base @SVER@ + PyObject_GC_Del@Base @SVER@ + PyObject_GC_Track@Base @SVER@ + PyObject_GC_UnTrack@Base @SVER@ + PyObject_GenericGetAttr@Base @SVER@ + PyObject_GenericGetDict@Base @SVER@ + PyObject_GenericSetAttr@Base @SVER@ + PyObject_GenericSetDict@Base @SVER@ + PyObject_GetArenaAllocator@Base @SVER@ + PyObject_GetAttr@Base @SVER@ + PyObject_GetAttrString@Base @SVER@ + PyObject_GetBuffer@Base @SVER@ + PyObject_GetItem@Base @SVER@ + PyObject_GetIter@Base @SVER@ + PyObject_HasAttr@Base @SVER@ + PyObject_HasAttrString@Base @SVER@ + PyObject_Hash@Base @SVER@ + PyObject_HashNotImplemented@Base @SVER@ + PyObject_Init@Base @SVER@ + PyObject_InitVar@Base @SVER@ + PyObject_IsInstance@Base @SVER@ + PyObject_IsSubclass@Base @SVER@ + PyObject_IsTrue@Base @SVER@ + PyObject_Length@Base @SVER@ + PyObject_LengthHint@Base @SVER@ + PyObject_Malloc@Base @SVER@ + PyObject_Not@Base @SVER@ + PyObject_Print@Base @SVER@ + PyObject_Realloc@Base @SVER@ + PyObject_Repr@Base @SVER@ + PyObject_RichCompare@Base @SVER@ + PyObject_RichCompareBool@Base @SVER@ + PyObject_SelfIter@Base @SVER@ + PyObject_SetArenaAllocator@Base @SVER@ + PyObject_SetAttr@Base @SVER@ + PyObject_SetAttrString@Base @SVER@ + PyObject_SetItem@Base @SVER@ + PyObject_Size@Base @SVER@ + PyObject_Str@Base @SVER@ + PyObject_Type@Base @SVER@ + (optional)PyObject_stgdict@Base @SVER@ + PyParser_ASTFromFile@Base @SVER@ + PyParser_ASTFromFileObject@Base @SVER@ + PyParser_ASTFromString@Base @SVER@ + PyParser_ASTFromStringObject@Base @SVER@ + PyParser_AddToken@Base @SVER@ + PyParser_ClearError@Base @SVER@ + PyParser_Delete@Base @SVER@ + PyParser_New@Base @SVER@ + PyParser_ParseFile@Base @SVER@ + PyParser_ParseFileFlags@Base @SVER@ + PyParser_ParseFileFlagsEx@Base @SVER@ + PyParser_ParseFileObject@Base @SVER@ + PyParser_ParseString@Base @SVER@ + PyParser_ParseStringFlags@Base @SVER@ + PyParser_ParseStringFlagsFilename@Base @SVER@ + PyParser_ParseStringFlagsFilenameEx@Base @SVER@ + PyParser_ParseStringObject@Base @SVER@ + PyParser_SetError@Base @SVER@ + PyParser_SimpleParseFile@Base @SVER@ + PyParser_SimpleParseFileFlags@Base @SVER@ + PyParser_SimpleParseString@Base @SVER@ + PyParser_SimpleParseStringFilename@Base @SVER@ + PyParser_SimpleParseStringFlags@Base @SVER@ + PyParser_SimpleParseStringFlagsFilename@Base @SVER@ + PyProperty_Type@Base @SVER@ + PyRangeIter_Type@Base @SVER@ + PyRange_Type@Base @SVER@ + PyRawIOBase_Type@Base @SVER@ + PyReversed_Type@Base @SVER@ + PyRun_AnyFile@Base @SVER@ + PyRun_AnyFileEx@Base @SVER@ + PyRun_AnyFileExFlags@Base @SVER@ + PyRun_AnyFileFlags@Base @SVER@ + PyRun_File@Base @SVER@ + PyRun_FileEx@Base @SVER@ + PyRun_FileExFlags@Base @SVER@ + PyRun_FileFlags@Base @SVER@ + PyRun_InteractiveLoop@Base @SVER@ + PyRun_InteractiveLoopFlags@Base @SVER@ + PyRun_InteractiveOne@Base @SVER@ + PyRun_InteractiveOneFlags@Base @SVER@ + PyRun_InteractiveOneObject@Base @SVER@ + PyRun_SimpleFile@Base @SVER@ + PyRun_SimpleFileEx@Base @SVER@ + PyRun_SimpleFileExFlags@Base @SVER@ + PyRun_SimpleString@Base @SVER@ + PyRun_SimpleStringFlags@Base @SVER@ + PyRun_String@Base @SVER@ + PyRun_StringFlags@Base @SVER@ + PySTEntry_Type@Base @SVER@ + PyST_GetScope@Base @SVER@ + PySeqIter_New@Base @SVER@ + PySeqIter_Type@Base @SVER@ + PySequence_Check@Base @SVER@ + PySequence_Concat@Base @SVER@ + PySequence_Contains@Base @SVER@ + PySequence_Count@Base @SVER@ + PySequence_DelItem@Base @SVER@ + PySequence_DelSlice@Base @SVER@ + PySequence_Fast@Base @SVER@ + PySequence_GetItem@Base @SVER@ + PySequence_GetSlice@Base @SVER@ + PySequence_In@Base @SVER@ + PySequence_InPlaceConcat@Base @SVER@ + PySequence_InPlaceRepeat@Base @SVER@ + PySequence_Index@Base @SVER@ + PySequence_Length@Base @SVER@ + PySequence_List@Base @SVER@ + PySequence_Repeat@Base @SVER@ + PySequence_SetItem@Base @SVER@ + PySequence_SetSlice@Base @SVER@ + PySequence_Size@Base @SVER@ + PySequence_Tuple@Base @SVER@ + PySetIter_Type@Base @SVER@ + PySet_Add@Base @SVER@ + PySet_Clear@Base @SVER@ + PySet_ClearFreeList@Base @SVER@ + PySet_Contains@Base @SVER@ + PySet_Discard@Base @SVER@ + PySet_Fini@Base @SVER@ + PySet_New@Base @SVER@ + PySet_Pop@Base @SVER@ + PySet_Size@Base @SVER@ + PySet_Type@Base @SVER@ + PySignal_SetWakeupFd@Base @SVER@ + PySlice_Fini@Base @SVER@ + PySlice_GetIndices@Base @SVER@ + PySlice_GetIndicesEx@Base @SVER@ + PySlice_New@Base @SVER@ + PySlice_Type@Base @SVER@ + PyState_AddModule@Base @SVER@ + PyState_FindModule@Base @SVER@ + PyState_RemoveModule@Base @SVER@ + PyStaticMethod_New@Base @SVER@ + PyStaticMethod_Type@Base @SVER@ + PyStdPrinter_Type@Base @SVER@ + PyStringIO_Type@Base @SVER@ + PyStructSequence_GetItem@Base @SVER@ + PyStructSequence_InitType2@Base @SVER@ + PyStructSequence_InitType@Base @SVER@ + PyStructSequence_New@Base @SVER@ + PyStructSequence_NewType@Base @SVER@ + PyStructSequence_SetItem@Base @SVER@ + PyStructSequence_UnnamedField@Base @SVER@ + PySuper_Type@Base @SVER@ + PySymtable_Build@Base @SVER@ + PySymtable_BuildObject@Base @SVER@ + PySymtable_Free@Base @SVER@ + PySymtable_Lookup@Base @SVER@ + PySys_AddWarnOption@Base @SVER@ + PySys_AddWarnOptionUnicode@Base @SVER@ + PySys_AddXOption@Base @SVER@ + PySys_FormatStderr@Base @SVER@ + PySys_FormatStdout@Base @SVER@ + PySys_GetObject@Base @SVER@ + PySys_GetXOptions@Base @SVER@ + PySys_HasWarnOptions@Base @SVER@ + PySys_ResetWarnOptions@Base @SVER@ + PySys_SetArgv@Base @SVER@ + PySys_SetArgvEx@Base @SVER@ + PySys_SetObject@Base @SVER@ + PySys_SetPath@Base @SVER@ + PySys_WriteStderr@Base @SVER@ + PySys_WriteStdout@Base @SVER@ + PyTextIOBase_Type@Base @SVER@ + PyTextIOWrapper_Type@Base @SVER@ + PyThreadState_Clear@Base @SVER@ + PyThreadState_Delete@Base @SVER@ + PyThreadState_DeleteCurrent@Base @SVER@ + PyThreadState_Get@Base @SVER@ + PyThreadState_GetDict@Base @SVER@ + PyThreadState_New@Base @SVER@ + PyThreadState_Next@Base @SVER@ + PyThreadState_SetAsyncExc@Base @SVER@ + PyThreadState_Swap@Base @SVER@ + PyThread_GetInfo@Base @SVER@ + PyThread_ReInitTLS@Base @SVER@ + PyThread_acquire_lock@Base @SVER@ + PyThread_acquire_lock_timed@Base @SVER@ + PyThread_allocate_lock@Base @SVER@ + PyThread_create_key@Base @SVER@ + PyThread_delete_key@Base @SVER@ + PyThread_delete_key_value@Base @SVER@ + PyThread_exit_thread@Base @SVER@ + PyThread_free_lock@Base @SVER@ + PyThread_get_key_value@Base @SVER@ + PyThread_get_stacksize@Base @SVER@ + PyThread_get_thread_ident@Base @SVER@ + PyThread_init_thread@Base @SVER@ + PyThread_release_lock@Base @SVER@ + PyThread_set_key_value@Base @SVER@ + PyThread_set_stacksize@Base @SVER@ + PyThread_start_new_thread@Base @SVER@ + PyToken_OneChar@Base @SVER@ + PyToken_ThreeChars@Base @SVER@ + PyToken_TwoChars@Base @SVER@ + PyTokenizer_FindEncoding@Base @SVER@ + PyTokenizer_FindEncodingFilename@Base @SVER@ + PyTokenizer_Free@Base @SVER@ + PyTokenizer_FromFile@Base @SVER@ + PyTokenizer_FromString@Base @SVER@ + PyTokenizer_FromUTF8@Base @SVER@ + PyTokenizer_Get@Base @SVER@ + PyTraceBack_Here@Base @SVER@ + PyTraceBack_Print@Base @SVER@ + PyTraceBack_Type@Base @SVER@ + PyTupleIter_Type@Base @SVER@ + PyTuple_ClearFreeList@Base @SVER@ + PyTuple_Fini@Base @SVER@ + PyTuple_GetItem@Base @SVER@ + PyTuple_GetSlice@Base @SVER@ + PyTuple_New@Base @SVER@ + PyTuple_Pack@Base @SVER@ + PyTuple_SetItem@Base @SVER@ + PyTuple_Size@Base @SVER@ + PyTuple_Type@Base @SVER@ + PyType_ClearCache@Base @SVER@ + PyType_FromSpec@Base @SVER@ + PyType_FromSpecWithBases@Base @SVER@ + PyType_GenericAlloc@Base @SVER@ + PyType_GenericNew@Base @SVER@ + PyType_GetFlags@Base @SVER@ + PyType_GetSlot@Base @SVER@ + PyType_IsSubtype@Base @SVER@ + PyType_Modified@Base @SVER@ + PyType_Ready@Base @SVER@ + PyType_Type@Base @SVER@ + (optional)PyType_stgdict@Base @SVER@ + PyUnicodeDecodeError_Create@Base @SVER@ + PyUnicodeDecodeError_GetEncoding@Base @SVER@ + PyUnicodeDecodeError_GetEnd@Base @SVER@ + PyUnicodeDecodeError_GetObject@Base @SVER@ + PyUnicodeDecodeError_GetReason@Base @SVER@ + PyUnicodeDecodeError_GetStart@Base @SVER@ + PyUnicodeDecodeError_SetEnd@Base @SVER@ + PyUnicodeDecodeError_SetReason@Base @SVER@ + PyUnicodeDecodeError_SetStart@Base @SVER@ + PyUnicodeEncodeError_Create@Base @SVER@ + PyUnicodeEncodeError_GetEncoding@Base @SVER@ + PyUnicodeEncodeError_GetEnd@Base @SVER@ + PyUnicodeEncodeError_GetObject@Base @SVER@ + PyUnicodeEncodeError_GetReason@Base @SVER@ + PyUnicodeEncodeError_GetStart@Base @SVER@ + PyUnicodeEncodeError_SetEnd@Base @SVER@ + PyUnicodeEncodeError_SetReason@Base @SVER@ + PyUnicodeEncodeError_SetStart@Base @SVER@ + PyUnicodeIter_Type@Base @SVER@ + PyUnicodeTranslateError_Create@Base @SVER@ + PyUnicodeTranslateError_GetEnd@Base @SVER@ + PyUnicodeTranslateError_GetObject@Base @SVER@ + PyUnicodeTranslateError_GetReason@Base @SVER@ + PyUnicodeTranslateError_GetStart@Base @SVER@ + PyUnicodeTranslateError_SetEnd@Base @SVER@ + PyUnicodeTranslateError_SetReason@Base @SVER@ + PyUnicodeTranslateError_SetStart@Base @SVER@ + PyUnicode_Append@Base @SVER@ + PyUnicode_AppendAndDel@Base @SVER@ + PyUnicode_AsASCIIString@Base @SVER@ + PyUnicode_AsCharmapString@Base @SVER@ + PyUnicode_AsDecodedObject@Base @SVER@ + PyUnicode_AsDecodedUnicode@Base @SVER@ + PyUnicode_AsEncodedObject@Base @SVER@ + PyUnicode_AsEncodedString@Base @SVER@ + PyUnicode_AsEncodedUnicode@Base @SVER@ + PyUnicode_AsLatin1String@Base @SVER@ + PyUnicode_AsRawUnicodeEscapeString@Base @SVER@ + PyUnicode_AsUCS4@Base @SVER@ + PyUnicode_AsUCS4Copy@Base @SVER@ + PyUnicode_AsUTF16String@Base @SVER@ + PyUnicode_AsUTF32String@Base @SVER@ + PyUnicode_AsUTF8@Base @SVER@ + PyUnicode_AsUTF8AndSize@Base @SVER@ + PyUnicode_AsUTF8String@Base @SVER@ + PyUnicode_AsUnicode@Base @SVER@ + PyUnicode_AsUnicodeAndSize@Base @SVER@ + PyUnicode_AsUnicodeCopy@Base @SVER@ + PyUnicode_AsUnicodeEscapeString@Base @SVER@ + PyUnicode_AsWideChar@Base @SVER@ + PyUnicode_AsWideCharString@Base @SVER@ + PyUnicode_BuildEncodingMap@Base @SVER@ + PyUnicode_ClearFreeList@Base @SVER@ + PyUnicode_Compare@Base @SVER@ + PyUnicode_CompareWithASCIIString@Base @SVER@ + PyUnicode_Concat@Base @SVER@ + PyUnicode_Contains@Base @SVER@ + PyUnicode_CopyCharacters@Base @SVER@ + PyUnicode_Count@Base @SVER@ + PyUnicode_Decode@Base @SVER@ + PyUnicode_DecodeASCII@Base @SVER@ + PyUnicode_DecodeCharmap@Base @SVER@ + PyUnicode_DecodeFSDefault@Base @SVER@ + PyUnicode_DecodeFSDefaultAndSize@Base @SVER@ + PyUnicode_DecodeLatin1@Base @SVER@ + PyUnicode_DecodeLocale@Base @SVER@ + PyUnicode_DecodeLocaleAndSize@Base @SVER@ + PyUnicode_DecodeRawUnicodeEscape@Base @SVER@ + PyUnicode_DecodeUTF16@Base @SVER@ + PyUnicode_DecodeUTF16Stateful@Base @SVER@ + PyUnicode_DecodeUTF32@Base @SVER@ + PyUnicode_DecodeUTF32Stateful@Base @SVER@ + PyUnicode_DecodeUTF7@Base @SVER@ + PyUnicode_DecodeUTF7Stateful@Base @SVER@ + PyUnicode_DecodeUTF8@Base @SVER@ + PyUnicode_DecodeUTF8Stateful@Base @SVER@ + PyUnicode_DecodeUnicodeEscape@Base @SVER@ + PyUnicode_Encode@Base @SVER@ + PyUnicode_EncodeASCII@Base @SVER@ + PyUnicode_EncodeCharmap@Base @SVER@ + PyUnicode_EncodeDecimal@Base @SVER@ + PyUnicode_EncodeFSDefault@Base @SVER@ + PyUnicode_EncodeUTF8@Base @SVER@ + PyUnicode_EncodeUnicodeEscape@Base @SVER@ + PyUnicode_FSConverter@Base @SVER@ + PyUnicode_FSDecoder@Base @SVER@ + PyUnicode_Fill@Base @SVER@ + PyUnicode_Find@Base @SVER@ + PyUnicode_FindChar@Base @SVER@ + PyUnicode_Format@Base @SVER@ + PyUnicode_FromEncodedObject@Base @SVER@ + PyUnicode_FromFormat@Base @SVER@ + PyUnicode_FromFormatV@Base @SVER@ + PyUnicode_FromKindAndData@Base @SVER@ + PyUnicode_FromObject@Base @SVER@ + PyUnicode_FromOrdinal@Base @SVER@ + PyUnicode_FromString@Base @SVER@ + PyUnicode_FromStringAndSize@Base @SVER@ + PyUnicode_FromUnicode@Base @SVER@ + PyUnicode_FromWideChar@Base @SVER@ + PyUnicode_GetDefaultEncoding@Base @SVER@ + PyUnicode_GetLength@Base @SVER@ + PyUnicode_GetMax@Base @SVER@ + PyUnicode_GetSize@Base @SVER@ + PyUnicode_EncodeLatin1@Base @SVER@ + PyUnicode_EncodeLocale@Base @SVER@ + PyUnicode_EncodeRawUnicodeEscape@Base @SVER@ + PyUnicode_EncodeUTF16@Base @SVER@ + PyUnicode_EncodeUTF32@Base @SVER@ + PyUnicode_EncodeUTF7@Base @SVER@ + PyUnicode_InternFromString@Base @SVER@ + PyUnicode_InternImmortal@Base @SVER@ + PyUnicode_InternInPlace@Base @SVER@ + PyUnicode_IsIdentifier@Base @SVER@ + PyUnicode_Join@Base @SVER@ + PyUnicode_New@Base @SVER@ + PyUnicode_Partition@Base @SVER@ + PyUnicode_RPartition@Base @SVER@ + PyUnicode_RSplit@Base @SVER@ + PyUnicode_ReadChar@Base @SVER@ + PyUnicode_Replace@Base @SVER@ + PyUnicode_Resize@Base @SVER@ + PyUnicode_RichCompare@Base @SVER@ + PyUnicode_Split@Base @SVER@ + PyUnicode_Splitlines@Base @SVER@ + PyUnicode_Substring@Base @SVER@ + PyUnicode_Tailmatch@Base @SVER@ + PyUnicode_TransformDecimalToASCII@Base @SVER@ + PyUnicode_Translate@Base @SVER@ + PyUnicode_TranslateCharmap@Base @SVER@ + PyUnicode_Type@Base @SVER@ + PyUnicode_WriteChar@Base @SVER@ + PyWeakref_GetObject@Base @SVER@ + PyWeakref_NewProxy@Base @SVER@ + PyWeakref_NewRef@Base @SVER@ + PyWrapperDescr_Type@Base @SVER@ + PyWrapper_New@Base @SVER@ + PyZip_Type@Base @SVER@ + Py_AddPendingCall@Base @SVER@ + Py_AtExit@Base @SVER@ + Py_BuildValue@Base @SVER@ + Py_BytesWarningFlag@Base @SVER@ + Py_CompileString@Base @SVER@ + Py_CompileStringExFlags@Base @SVER@ + Py_CompileStringFlags@Base @SVER@ + Py_CompileStringObject@Base @SVER@ + Py_DebugFlag@Base @SVER@ + Py_DecRef@Base @SVER@ + Py_DontWriteBytecodeFlag@Base @SVER@ + Py_EndInterpreter@Base @SVER@ + Py_Exit@Base @SVER@ + Py_FatalError@Base @SVER@ + Py_FdIsInteractive@Base @SVER@ + Py_FileSystemDefaultEncoding@Base @SVER@ + Py_Finalize@Base @SVER@ + Py_FrozenFlag@Base @SVER@ + Py_FrozenMain@Base @SVER@ + Py_GetArgcArgv@Base @SVER@ + Py_GetBuildInfo@Base @SVER@ + Py_GetCompiler@Base @SVER@ + Py_GetCopyright@Base @SVER@ + Py_GetExecPrefix@Base @SVER@ + Py_GetPath@Base @SVER@ + Py_GetPlatform@Base @SVER@ + Py_GetPrefix@Base @SVER@ + Py_GetProgramFullPath@Base @SVER@ + Py_GetProgramName@Base @SVER@ + Py_GetPythonHome@Base @SVER@ + Py_GetRecursionLimit@Base @SVER@ + Py_GetVersion@Base @SVER@ + Py_HasFileSystemDefaultEncoding@Base @SVER@ + Py_HashRandomizationFlag@Base @SVER@ + Py_IgnoreEnvironmentFlag@Base @SVER@ + Py_IncRef@Base @SVER@ + Py_Initialize@Base @SVER@ + Py_InitializeEx@Base @SVER@ + Py_InspectFlag@Base @SVER@ + Py_InteractiveFlag@Base @SVER@ + Py_IsInitialized@Base @SVER@ + Py_IsolatedFlag@Base @SVER@ + Py_Main@Base @SVER@ + Py_MakePendingCalls@Base @SVER@ + Py_NewInterpreter@Base @SVER@ + Py_NoSiteFlag@Base @SVER@ + Py_NoUserSiteDirectory@Base @SVER@ + Py_OptimizeFlag@Base @SVER@ + Py_QuietFlag@Base @SVER@ + Py_ReprEnter@Base @SVER@ + Py_ReprLeave@Base @SVER@ + Py_SetPath@Base @SVER@ + Py_SetProgramName@Base @SVER@ + Py_SetPythonHome@Base @SVER@ + Py_SetRecursionLimit@Base @SVER@ + Py_SetStandardStreamEncoding@Base @SVER@ + Py_SymtableString@Base @SVER@ + Py_SymtableStringObject@Base @SVER@ + Py_UNICODE_strcat@Base @SVER@ + Py_UNICODE_strchr@Base @SVER@ + Py_UNICODE_strcmp@Base @SVER@ + Py_UNICODE_strcpy@Base @SVER@ + Py_UNICODE_strlen@Base @SVER@ + Py_UNICODE_strncmp@Base @SVER@ + Py_UNICODE_strncpy@Base @SVER@ + Py_UNICODE_strrchr@Base @SVER@ + Py_UnbufferedStdioFlag@Base @SVER@ + Py_UniversalNewlineFgets@Base @SVER@ + Py_UseClassExceptionsFlag@Base @SVER@ + Py_VaBuildValue@Base @SVER@ + Py_VerboseFlag@Base @SVER@ + Py_hexdigits@Base @SVER@ + Py_meta_grammar@Base @SVER@ + Py_pgen@Base @SVER@ + _PyAccu_Accumulate@Base @SVER@ + _PyAccu_Destroy@Base @SVER@ + _PyAccu_Finish@Base @SVER@ + _PyAccu_FinishAsList@Base @SVER@ + _PyAccu_Init@Base @SVER@ + _PyArg_NoKeywords@Base @SVER@ + _PyArg_NoPositional@Base @SVER@ + _PyArg_ParseTupleAndKeywords_SizeT@Base @SVER@ + _PyArg_ParseTuple_SizeT@Base @SVER@ + _PyArg_Parse_SizeT@Base @SVER@ + _PyArg_VaParseTupleAndKeywords_SizeT@Base @SVER@ + _PyArg_VaParse_SizeT@Base @SVER@ + _PyBuiltin_Init@Base @SVER@ + _PyByteArray_empty_string@Base @SVER@ + _PyBytesIOBuffer_Type@Base @SVER@ + _PyBytes_Join@Base @SVER@ + _PyBytes_Resize@Base @SVER@ + _PyCFunction_DebugMallocStats@Base @SVER@ + _PyCapsule_hack@Base @SVER@ + _PyCode_CheckLineNumber@Base @SVER@ + _PyCodecInfo_GetIncrementalDecoder@Base @SVER@ + _PyCodecInfo_GetIncrementalEncoder@Base @SVER@ + _PyCodec_DecodeText@Base @SVER@ + _PyCodec_EncodeText@Base @SVER@ + _PyCodec_Forget@Base @SVER@ + _PyCodec_Lookup@Base @SVER@ + _PyCodec_LookupTextEncoding@Base @SVER@ + _PyComplex_FormatAdvancedWriter@Base @SVER@ + _PyDebugAllocatorStats@Base @SVER@ + _PyDictKeys_DecRef@Base @SVER@ + _PyDict_Contains@Base @SVER@ + _PyDict_DebugMallocStats@Base @SVER@ + _PyDict_DelItemId@Base @SVER@ + _PyDict_GetItemId@Base @SVER@ + _PyDict_GetItemIdWithError@Base @SVER@ + _PyDict_HasOnlyStringKeys@Base @SVER@ + _PyDict_KeysSize@Base @SVER@ + _PyDict_LoadGlobal@Base @SVER@ + _PyDict_MaybeUntrack@Base @SVER@ + _PyDict_NewKeysForClass@Base @SVER@ + _PyDict_NewPresized@Base @SVER@ + _PyDict_Next@Base @SVER@ + _PyErr_BadInternalCall@Base @SVER@ + _PyErr_SetKeyError@Base @SVER@ + _PyErr_TrySetFromCause@Base @SVER@ + _PyDict_SetItemId@Base @SVER@ + _PyEval_CallTracing@Base @SVER@ + _PyEval_FiniThreads@Base @SVER@ + _PyEval_GetSwitchInterval@Base @SVER@ + _PyEval_SetSwitchInterval@Base @SVER@ + _PyEval_SignalAsyncExc@Base @SVER@ + _PyEval_SliceIndex@Base @SVER@ + _PyExc_Fini@Base @SVER@ + _PyExc_Init@Base @SVER@ + _PyFaulthandler_Fini@Base @SVER@ + _PyFaulthandler_Init@Base @SVER@ + _PyFileIO_closed@Base @SVER@ + _PyFloat_DebugMallocStats@Base @SVER@ + _PyFloat_FormatAdvancedWriter@Base @SVER@ + _PyFloat_Init@Base @SVER@ + _PyFloat_Pack4@Base @SVER@ + _PyFloat_Pack8@Base @SVER@ + _PyFloat_Unpack4@Base @SVER@ + _PyFloat_Unpack8@Base @SVER@ + _PyFrame_DebugMallocStats@Base @SVER@ + _PyFrame_Init@Base @SVER@ + _PyGC_CollectNoFail@Base @SVER@ + _PyGC_Dump@Base @SVER@ + _PyGC_DumpShutdownStats@Base @SVER@ + _PyGC_Fini@Base @SVER@ + _PyGC_generation0@Base @SVER@ + _PyGILState_Fini@Base @SVER@ + _PyGILState_Init@Base @SVER@ + _PyGILState_Reinit@Base @SVER@ + _PyGen_FetchStopIterationValue@Base @SVER@ + _PyGen_Finalize@Base @SVER@ + _PyGen_Send@Base @SVER@ + _PyHash_Fini@Base @SVER@ + _PyIOBase_check_closed@Base @SVER@ + _PyIOBase_check_readable@Base @SVER@ + _PyIOBase_check_seekable@Base @SVER@ + _PyIOBase_check_writable@Base @SVER@ + _PyIOBase_finalize@Base @SVER@ + _PyIO_ConvertSsize_t@Base @SVER@ + _PyIO_Module@Base @SVER@ + _PyIO_empty_bytes@Base @SVER@ + _PyIO_empty_str@Base @SVER@ + _PyIO_find_line_ending@Base @SVER@ + _PyIO_get_locale_module@Base @SVER@ + _PyIO_get_module_state@Base @SVER@ + _PyIO_str_close@Base @SVER@ + _PyIO_str_closed@Base @SVER@ + _PyIO_str_decode@Base @SVER@ + _PyIO_str_encode@Base @SVER@ + _PyIO_str_fileno@Base @SVER@ + _PyIO_str_flush@Base @SVER@ + _PyIO_str_getstate@Base @SVER@ + _PyIO_str_isatty@Base @SVER@ + _PyIO_str_newlines@Base @SVER@ + _PyIO_str_nl@Base @SVER@ + _PyIO_str_read1@Base @SVER@ + _PyIO_str_read@Base @SVER@ + _PyIO_str_readable@Base @SVER@ + _PyIO_str_readall@Base @SVER@ + _PyIO_str_readinto@Base @SVER@ + _PyIO_str_readline@Base @SVER@ + _PyIO_str_reset@Base @SVER@ + _PyIO_str_seek@Base @SVER@ + _PyIO_str_seekable@Base @SVER@ + _PyIO_str_setstate@Base @SVER@ + _PyIO_str_tell@Base @SVER@ + _PyIO_str_truncate@Base @SVER@ + _PyIO_str_writable@Base @SVER@ + _PyIO_str_write@Base @SVER@ + _PyIO_trap_eintr@Base @SVER@ + _PyIO_zero@Base @SVER@ + _PyImportHooks_Init@Base @SVER@ + _PyImportZip_Init@Base @SVER@ + _PyImport_AcquireLock@Base @SVER@ + _PyImport_DynLoadFiletab@Base @SVER@ + _PyImport_FindBuiltin@Base @SVER@ + _PyImport_FindExtensionObject@Base @SVER@ + _PyImport_Fini@Base @SVER@ + _PyImport_FixupBuiltin@Base @SVER@ + _PyImport_FixupExtensionObject@Base @SVER@ + _PyImport_GetDynLoadFunc@Base @SVER@ + _PyImport_Init@Base @SVER@ + _PyImport_Inittab@Base @SVER@ + _PyImport_LoadDynamicModule@Base @SVER@ + _PyImport_ReInitLock@Base @SVER@ + _PyImport_ReleaseLock@Base @SVER@ + _PyIncrementalNewlineDecoder_decode@Base @SVER@ + _PyList_DebugMallocStats@Base @SVER@ + _PyList_Extend@Base @SVER@ + _PyLong_AsByteArray@Base @SVER@ + _PyLong_AsInt@Base @SVER@ + _PyLong_AsTime_t@Base @SVER@ + _PyLong_Copy@Base @SVER@ + _PyLong_DigitValue@Base @SVER@ + _PyLong_DivmodNear@Base @SVER@ + _PyLong_Format@Base @SVER@ + _PyLong_FormatAdvancedWriter@Base @SVER@ + _PyLong_FormatWriter@Base @SVER@ + _PyLong_Frexp@Base @SVER@ + _PyLong_FromByteArray@Base @SVER@ + _PyLong_FromBytes@Base @SVER@ + _PyLong_FromGid@Base @SVER@ + _PyLong_FromNbInt@Base @SVER@ + _PyLong_FromTime_t@Base @SVER@ + _PyLong_FromUid@Base @SVER@ + _PyLong_Init@Base @SVER@ + _PyLong_New@Base @SVER@ + _PyLong_NumBits@Base @SVER@ + _PyLong_Sign@Base @SVER@ + _PyManagedBuffer_Type@Base @SVER@ + _PyMem_RawStrdup@Base @SVER@ + _PyMem_Strdup@Base @SVER@ + _PyMethodWrapper_Type@Base @SVER@ + _PyMethod_DebugMallocStats@Base @SVER@ + _PyModule_Clear@Base @SVER@ + _PyModule_ClearDict@Base @SVER@ + _PyNamespace_New@Base @SVER@ + _PyNamespace_Type@Base @SVER@ + _PyNode_SizeOf@Base @SVER@ + _PyNone_Type@Base @SVER@ + _PyNotImplemented_Type@Base @SVER@ + _PyOS_GetOpt@Base @SVER@ + _PyOS_IsMainThread@Base @SVER@ + _PyOS_ReadlineTState@Base @SVER@ + _PyOS_ResetGetOpt@Base @SVER@ + _PyOS_URandom@Base @SVER@ + _PyOS_mystrnicmp_hack@Base @SVER@ + _PyOS_optarg@Base @SVER@ + _PyOS_opterr@Base @SVER@ + _PyOS_optind@Base @SVER@ + _PyObjectDict_SetItem@Base @SVER@ + _PyObject_CallFunction_SizeT@Base @SVER@ + _PyObject_CallMethodId@Base @SVER@ + _PyObject_CallMethodIdObjArgs@Base @SVER@ + _PyObject_CallMethodId_SizeT@Base @SVER@ + _PyObject_CallMethod_SizeT@Base @SVER@ + _PyObject_DebugMallocStats@Base @SVER@ + _PyObject_DebugTypeStats@Base @SVER@ + _PyObject_Dump@Base @SVER@ + _PyObject_GC_Malloc@Base @SVER@ + _PyObject_GC_New@Base @SVER@ + _PyObject_GC_NewVar@Base @SVER@ + _PyObject_GC_Resize@Base @SVER@ + _PyObject_GenericGetAttrWithDict@Base @SVER@ + _PyObject_GenericSetAttrWithDict@Base @SVER@ + _PyObject_GetAttrId@Base @SVER@ + _PyObject_GetBuiltin@Base @SVER@ + _PyObject_GetDictPtr@Base @SVER@ + _PyObject_HasAttrId@Base @SVER@ + _PyObject_HasLen@Base @SVER@ + _PyObject_IsAbstract@Base @SVER@ + _PyObject_LookupSpecial@Base @SVER@ + _PyObject_New@Base @SVER@ + _PyObject_NewVar@Base @SVER@ + _PyObject_NextNotImplemented@Base @SVER@ + _PyObject_RealIsInstance@Base @SVER@ + _PyObject_RealIsSubclass@Base @SVER@ + _PyObject_SetAttrId@Base @SVER@ + _PyParser_Grammar@Base @SVER@ + _PyParser_TokenNames@Base @SVER@ + _PyRandom_Fini@Base @SVER@ + _PyRandom_Init@Base @SVER@ + _PySequence_BytesToCharpArray@Base @SVER@ + _PySequence_IterSearch@Base @SVER@ + _PySet_Dummy@Base @SVER@ + _PySet_NextEntry@Base @SVER@ + _PySet_Update@Base @SVER@ + _PySlice_FromIndices@Base @SVER@ + _PySlice_GetLongIndices@Base @SVER@ + _PyState_AddModule@Base @SVER@ + _PyState_ClearModules@Base @SVER@ + _PyStructSequence_Init@Base @SVER@ + _PySys_GetObjectId@Base @SVER@ + _PySys_GetSizeOf@Base @SVER@ + _PySys_ImplCacheTag@Base @SVER@ + _PySys_ImplName@Base @SVER@ + _PySys_Init@Base @SVER@ + _PySys_SetObjectId@Base @SVER@ + _PyThreadState_Current@Base @SVER@ + _PyThreadState_DeleteExcept@Base @SVER@ + _PyThreadState_GetFrame@Base @SVER@ + _PyThreadState_Init@Base @SVER@ + _PyThreadState_Prealloc@Base @SVER@ + _PyThread_CurrentFrames@Base @SVER@ + _PyTime_Init@Base @SVER@ + _PyTime_ObjectToTime_t@Base @SVER@ + _PyTime_ObjectToTimespec@Base @SVER@ + _PyTime_ObjectToTimeval@Base @SVER@ + _PyTime_gettimeofday@Base @SVER@ + _PyTime_gettimeofday_info@Base @SVER@ + _PyTraceMalloc_Init@Base @SVER@ + _PyTraceMalloc_Fini@Base @SVER@ + _PyTrash_delete_later@Base @SVER@ + _PyTrash_delete_nesting@Base @SVER@ + _PyTrash_deposit_object@Base @SVER@ + _PyTrash_destroy_chain@Base @SVER@ + _PyTrash_thread_deposit_object@Base @SVER@ + _PyTrash_thread_destroy_chain@Base @SVER@ + _PyTuple_DebugMallocStats@Base @SVER@ + _PyTuple_MaybeUntrack@Base @SVER@ + _PyTuple_Resize@Base @SVER@ + _PyType_CalculateMetaclass@Base @SVER@ + _PyType_Fini@Base @SVER@ + _PyType_GetDocFromInternalDoc@Base @SVER@ + _PyType_GetTextSignatureFromInternalDoc@Base @SVER@ + _PyType_Lookup@Base @SVER@ + _PyType_LookupId@Base @SVER@ + _PyUnicodeTranslateError_Create@Base @SVER@ + _PyUnicodeWriter_Dealloc@Base @SVER@ + _PyUnicodeWriter_Finish@Base @SVER@ + _PyUnicodeWriter_Init@Base @SVER@ + _PyUnicodeWriter_PrepareInternal@Base @SVER@ + _PyUnicodeWriter_WriteASCIIString@Base @SVER@ + _PyUnicodeWriter_WriteChar@Base @SVER@ + _PyUnicodeWriter_WriteLatin1String@Base @SVER@ + _PyUnicodeWriter_WriteStr@Base @SVER@ + _PyUnicodeWriter_WriteSubstring@Base @SVER@ + _PyUnicode_AsASCIIString@Base @SVER@ + _PyUnicode_AsKind@Base @SVER@ + _PyUnicode_AsLatin1String@Base @SVER@ + _PyUnicode_AsUTF8String@Base @SVER@ + _PyUnicode_BidirectionalNames@Base @SVER@ + _PyUnicode_CategoryNames@Base @SVER@ + _PyUnicode_ClearStaticStrings@Base @SVER@ + _PyUnicode_CompareWithId@Base @SVER@ + _PyUnicode_Copy@Base @SVER@ + _PyUnicode_Database_Records@Base @SVER@ + _PyUnicode_DecodeUnicodeInternal@Base @SVER@ + _PyUnicode_EastAsianWidthNames@Base @SVER@ + _PyUnicode_EncodeCharmap@Base @SVER@ + _PyUnicode_EncodeUTF16@Base @SVER@ + _PyUnicode_EncodeUTF32@Base @SVER@ + _PyUnicode_EncodeUTF7@Base @SVER@ + _PyUnicode_ExtendedCase@Base @SVER@ + _PyUnicode_FastCopyCharacters@Base @SVER@ + _PyUnicode_FastFill@Base @SVER@ + _PyUnicode_FindMaxChar@Base @SVER@ + _PyUnicode_Fini@Base @SVER@ + _PyUnicode_FormatAdvancedWriter@Base @SVER@ + _PyUnicode_FromASCII@Base @SVER@ + _PyUnicode_FromId@Base @SVER@ + _PyUnicode_Init@Base @SVER@ + _PyUnicode_HasNULChars@Base @SVER@ + _PyUnicode_InsertThousandsGrouping@Base @SVER@ + _PyUnicode_IsAlpha@Base @SVER@ + _PyUnicode_IsCaseIgnorable@Base @SVER@ + _PyUnicode_IsCased@Base @SVER@ + _PyUnicode_IsDecimalDigit@Base @SVER@ + _PyUnicode_IsDigit@Base @SVER@ + _PyUnicode_IsLinebreak@Base @SVER@ + _PyUnicode_IsLowercase@Base @SVER@ + _PyUnicode_IsNumeric@Base @SVER@ + _PyUnicode_IsPrintable@Base @SVER@ + _PyUnicode_IsTitlecase@Base @SVER@ + _PyUnicode_IsUppercase@Base @SVER@ + _PyUnicode_IsWhitespace@Base @SVER@ + _PyUnicode_IsXidContinue@Base @SVER@ + _PyUnicode_IsXidStart@Base @SVER@ + _PyUnicode_Ready@Base @SVER@ + _PyUnicode_ToDecimalDigit@Base @SVER@ + _PyUnicode_ToDigit@Base @SVER@ + _PyUnicode_ToFoldedFull@Base @SVER@ + _PyUnicode_ToLowerFull@Base @SVER@ + _PyUnicode_ToLowercase@Base @SVER@ + _PyUnicode_ToNumeric@Base @SVER@ + _PyUnicode_ToTitleFull@Base @SVER@ + _PyUnicode_ToTitlecase@Base @SVER@ + _PyUnicode_ToUpperFull@Base @SVER@ + _PyUnicode_ToUppercase@Base @SVER@ + _PyUnicode_TransformDecimalAndSpaceToASCII@Base @SVER@ + _PyUnicode_TranslateCharmap@Base @SVER@ + _PyUnicode_TypeRecords@Base @SVER@ + _PyUnicode_XStrip@Base @SVER@ + _PyWarnings_Init@Base @SVER@ + _PyWeakref_CallableProxyType@Base @SVER@ + _PyWeakref_ClearRef@Base @SVER@ + _PyWeakref_GetWeakrefCount@Base @SVER@ + _PyWeakref_ProxyType@Base @SVER@ + _PyWeakref_RefType@Base @SVER@ + _Py_Assert@Base @SVER@ + _Py_Assign@Base @SVER@ + _Py_Attribute@Base @SVER@ + _Py_AugAssign@Base @SVER@ + _Py_BinOp@Base @SVER@ + _Py_BoolOp@Base @SVER@ + _Py_Break@Base @SVER@ + _Py_BreakPoint@Base @SVER@ + _Py_BuildValue_SizeT@Base @SVER@ + _Py_Bytes@Base @SVER@ + _Py_Call@Base @SVER@ + _Py_CheckRecursionLimit@Base @SVER@ + _Py_CheckRecursiveCall@Base @SVER@ + _Py_ClassDef@Base @SVER@ + _Py_Compare@Base @SVER@ + _Py_Continue@Base @SVER@ + _Py_Dealloc@Base @SVER@ + _Py_Delete@Base @SVER@ + _Py_Dict@Base @SVER@ + _Py_DictComp@Base @SVER@ + _Py_DisplaySourceLine@Base @SVER@ + _Py_DumpTraceback@Base @SVER@ + _Py_DumpTracebackThreads@Base @SVER@ + _Py_Ellipsis@Base @SVER@ + _Py_EllipsisObject@Base @SVER@ + _Py_ExceptHandler@Base @SVER@ + _Py_Expr@Base @SVER@ + _Py_Expression@Base @SVER@ + _Py_ExtSlice@Base @SVER@ + _Py_FalseStruct@Base @SVER@ + _Py_Finalizing@Base @SVER@ + _Py_For@Base @SVER@ + _Py_FreeCharPArray@Base @SVER@ + _Py_FunctionDef@Base @SVER@ + _Py_GeneratorExp@Base @SVER@ + _Py_GetAllocatedBlocks@Base @SVER@ + _Py_Global@Base @SVER@ + _Py_Gid_Converter@Base @SVER@ + _Py_HashBytes@Base @SVER@ + _Py_HashDouble@Base @SVER@ + _Py_HashPointer@Base @SVER@ + _Py_HashSecret@Base @SVER@ + _Py_If@Base @SVER@ + _Py_IfExp@Base @SVER@ + _Py_Import@Base @SVER@ + _Py_ImportFrom@Base @SVER@ + _Py_Index@Base @SVER@ + _Py_InitializeEx_Private@Base @SVER@ + _Py_Interactive@Base @SVER@ + _Py_Lambda@Base @SVER@ + _Py_List@Base @SVER@ + _Py_ListComp@Base @SVER@ + _Py_M__importlib@Base @SVER@ + _Py_Mangle@Base @SVER@ + _Py_Module@Base @SVER@ + _Py_Name@Base @SVER@ + _Py_NameConstant@Base @SVER@ + _Py_NoneStruct@Base @SVER@ + _Py_Nonlocal@Base @SVER@ + _Py_NotImplementedStruct@Base @SVER@ + _Py_Num@Base @SVER@ + _Py_PackageContext@Base @SVER@ + _Py_Pass@Base @SVER@ + _Py_PyAtExit@Base @SVER@ + _Py_Raise@Base @SVER@ + _Py_ReadyTypes@Base @SVER@ + _Py_ReleaseInternedUnicodeStrings@Base @SVER@ + _Py_RestoreSignals@Base @SVER@ + _Py_Return@Base @SVER@ + _Py_Set@Base @SVER@ + _Py_SetComp@Base @SVER@ + _Py_Slice@Base @SVER@ + _Py_Starred@Base @SVER@ + _Py_Str@Base @SVER@ + _Py_Subscript@Base @SVER@ + _Py_Suite@Base @SVER@ + _Py_SwappedOp@Base @SVER@ + _Py_TrueStruct@Base @SVER@ + _Py_Try@Base @SVER@ + _Py_Tuple@Base @SVER@ + _Py_Uid_Converter@Base @SVER@ + _Py_UnaryOp@Base @SVER@ + _Py_VaBuildValue_SizeT@Base @SVER@ + _Py_While@Base @SVER@ + _Py_With@Base @SVER@ + _Py_Yield@Base @SVER@ + _Py_YieldFrom@Base @SVER@ + _Py_abstract_hack@Base @SVER@ + _Py_acosh@Base @SVER@ + _Py_add_one_to_index_C@Base @SVER@ + _Py_add_one_to_index_F@Base @SVER@ + _Py_addarc@Base @SVER@ + _Py_addbit@Base @SVER@ + _Py_adddfa@Base @SVER@ + _Py_addfirstsets@Base @SVER@ + _Py_addlabel@Base @SVER@ + _Py_addstate@Base @SVER@ + _Py_alias@Base @SVER@ + _Py_arg@Base @SVER@ + _Py_arguments@Base @SVER@ + _Py_ascii_whitespace@Base @SVER@ + _Py_asdl_int_seq_new@Base @SVER@ + _Py_asdl_seq_new@Base @SVER@ + _Py_asinh@Base @SVER@ + _Py_atanh@Base @SVER@ + _Py_bytes_capitalize@Base @SVER@ + _Py_bytes_isalnum@Base @SVER@ + _Py_bytes_isalpha@Base @SVER@ + _Py_bytes_isdigit@Base @SVER@ + _Py_bytes_islower@Base @SVER@ + _Py_bytes_isspace@Base @SVER@ + _Py_bytes_istitle@Base @SVER@ + _Py_bytes_isupper@Base @SVER@ + _Py_bytes_lower@Base @SVER@ + _Py_bytes_maketrans@Base @SVER@ + _Py_bytes_swapcase@Base @SVER@ + _Py_bytes_title@Base @SVER@ + _Py_bytes_upper@Base @SVER@ + _Py_c_abs@Base @SVER@ + _Py_c_diff@Base @SVER@ + _Py_c_neg@Base @SVER@ + _Py_c_pow@Base @SVER@ + _Py_c_prod@Base @SVER@ + _Py_c_quot@Base @SVER@ + _Py_c_sum@Base @SVER@ + _Py_capitalize__doc__@Base @SVER@ + _Py_char2wchar@Base @SVER@ + _Py_comprehension@Base @SVER@ + _Py_ctype_table@Base @SVER@ + _Py_ctype_tolower@Base @SVER@ + _Py_ctype_toupper@Base @SVER@ + _Py_delbitset@Base @SVER@ + _Py_device_encoding@Base @SVER@ + (arch=!m68k)_Py_dg_dtoa@Base @SVER@ + (arch=!m68k)_Py_dg_freedtoa@Base @SVER@ + (arch=!m68k)_Py_dg_infinity@Base @SVER@ + (arch=!m68k)_Py_dg_stdnan@Base @SVER@ + (arch=!m68k)_Py_dg_strtod@Base @SVER@ + _Py_dup@Base @SVER@ + _Py_expm1@Base @SVER@ + _Py_findlabel@Base @SVER@ + _Py_fopen@Base @SVER@ + _Py_fopen_obj@Base @SVER@ + (arch=i386 lpia m68k)_Py_force_double@Base @SVER@ + (arch=amd64 i386 lpia)_Py_get_387controlword@Base @SVER@ + _Py_get_inheritable@Base @SVER@ + _Py_hashtable_clear@Base @SVER@ + _Py_hashtable_compare_direct@Base @SVER@ + _Py_hashtable_copy@Base @SVER@ + _Py_hashtable_delete@Base @SVER@ + _Py_hashtable_destroy@Base @SVER@ + _Py_hashtable_foreach@Base @SVER@ + _Py_hashtable_get@Base @SVER@ + _Py_hashtable_get_entry@Base @SVER@ + _Py_hashtable_hash_int@Base @SVER@ + _Py_hashtable_hash_ptr@Base @SVER@ + _Py_hashtable_new@Base @SVER@ + _Py_hashtable_new_full@Base @SVER@ + _Py_hashtable_pop@Base @SVER@ + _Py_hashtable_set@Base @SVER@ + _Py_hashtable_size@Base @SVER@ + _Py_hgidentifier@Base @SVER@ + _Py_hgversion@Base @SVER@ + _Py_isalnum__doc__@Base @SVER@ + _Py_isalpha__doc__@Base @SVER@ + _Py_isdigit__doc__@Base @SVER@ + _Py_islower__doc__@Base @SVER@ + _Py_isspace__doc__@Base @SVER@ + _Py_istitle__doc__@Base @SVER@ + _Py_isupper__doc__@Base @SVER@ + _Py_keyword@Base @SVER@ + _Py_log1p@Base @SVER@ + _Py_lower__doc__@Base @SVER@ + _Py_maketrans__doc__@Base @SVER@ + _Py_mergebitset@Base @SVER@ + _Py_meta_grammar@Base @SVER@ + _Py_newbitset@Base @SVER@ + _Py_newgrammar@Base @SVER@ + _Py_normalize_encoding@Base @SVER@ + _Py_open@Base @SVER@ + _Py_open_cloexec_works@Base @SVER@ + _Py_parse_inf_or_nan@Base @SVER@ + _Py_pgen@Base @SVER@ + _Py_samebitset@Base @SVER@ + (arch=amd64 i386 lpia)_Py_set_387controlword@Base @SVER@ + _Py_set_inheritable@Base @SVER@ + _Py_stat@Base @SVER@ + _Py_swapcase__doc__@Base @SVER@ + _Py_title__doc__@Base @SVER@ + _Py_translatelabels@Base @SVER@ + _Py_upper__doc__@Base @SVER@ + _Py_wchar2char@Base @SVER@ + _Py_wfopen@Base @SVER@ + _Py_wgetcwd@Base @SVER@ + _Py_withitem@Base @SVER@ + _Py_wreadlink@Base @SVER@ + _Py_wrealpath@Base @SVER@ + _Py_wstat@Base @SVER@ + + (optional|regex)"^_ctypes_.*@Base$" @SVER@ + (optional|regex)"^ffi_type_.*@Base$" @SVER@ + (optional|regex)"^ffi_closure_.*@Base$" @SVER@ + + (optional|regex)"^PyInit_.*@Base$" @SVER@ --- python3.4-3.4.2~rc1.orig/debian/locale-gen +++ python3.4-3.4.2~rc1/debian/locale-gen @@ -0,0 +1,31 @@ +#!/bin/sh + +LOCPATH=`pwd`/locales +export LOCPATH + +[ -d $LOCPATH ] || mkdir -p $LOCPATH + +umask 022 + +echo "Generating locales..." +while read locale charset; do + case $locale in \#*) continue;; esac + [ -n "$locale" -a -n "$charset" ] || continue + echo -n " `echo $locale | sed 's/$[^.\@]*$.*/\1/'`" + echo -n ".$charset" + echo -n `echo $locale | sed 's/$[^\@]*$$\@.*$*/\2/'` + echo -n '...' + if [ -f $LOCPATH/$locale ]; then + input=$locale + else + input=`echo $locale | sed 's/$[^.]*$[^@]*$.*$/\1\2/'` + fi + localedef -i $input -c -f $charset $LOCPATH/$locale #-A /etc/locale.alias + echo ' done'; \ +done < +# elif defined(__x86_64__) && defined(__ILP32__) +# include +# elif defined(__i386__) +# include +# elif defined(__aarch64__) && defined(__AARCH64EL__) +# include +# elif defined(__alpha__) +# include +# elif defined(__ARM_EABI__) && defined(__ARM_PCS_VFP) +# include +# elif defined(__ARM_EABI__) && !defined(__ARM_PCS_VFP) +# include +# elif defined(__hppa__) +# include +# elif defined(__ia64__) +# include +# elif defined(__m68k__) && !defined(__mcoldfire__) +# include +# elif defined(__mips_hard_float) && defined(_MIPSEL) +# if _MIPS_SIM == _ABIO32 +# include +# elif _MIPS_SIM == _ABIN32 +# include +# elif _MIPS_SIM == _ABI64 +# include +# else +# error unknown multiarch location for @header@ +# endif +# elif defined(__mips_hard_float) +# if _MIPS_SIM == _ABIO32 +# include +# elif _MIPS_SIM == _ABIN32 +# include +# elif _MIPS_SIM == _ABI64 +# include +# else +# error unknown multiarch location for @header@ +# endif +# elif defined(__or1k__) +# include +# elif defined(__powerpc__) && defined(__SPE__) +# include +# elif defined(__powerpc64__) +# if defined(__LITTLE_ENDIAN__) +# include +# else +# include +# endif +# elif defined(__powerpc__) +# include +# elif defined(__s390x__) +# include +# elif defined(__s390__) +# include +# elif defined(__sh__) && defined(__LITTLE_ENDIAN__) +# include +# elif defined(__sparc__) && defined(__arch64__) +# include +# elif defined(__sparc__) +# include +# else +# error unknown multiarch location for @header@ +# endif +#elif defined(__FreeBSD_kernel__) +# if defined(__LP64__) +# include +# elif defined(__i386__) +# include +# else +# error unknown multiarch location for @header@ +# endif +#elif defined(__gnu_hurd__) +# include +#else +# error unknown multiarch location for @header@ +#endif --- python3.4-3.4.2~rc1.orig/debian/patches/bdist-wininst-notfound.diff +++ python3.4-3.4.2~rc1/debian/patches/bdist-wininst-notfound.diff @@ -0,0 +1,17 @@ +# DP: suggest installation of the pythonX.Y-dev package, if bdist_wininst +# DP: cannot find the wininst-* files. + +--- a/Lib/distutils/command/bdist_wininst.py ++++ b/Lib/distutils/command/bdist_wininst.py +@@ -342,7 +342,10 @@ + sfix = '' + + filename = os.path.join(directory, "wininst-%.1f%s.exe" % (bv, sfix)) +- f = open(filename, "rb") ++ try: ++ f = open(filename, "rb") ++ except IOError as e: ++ raise DistutilsFileError(str(e) + ', %s not included in the Debian packages.' % filename) + try: + return f.read() + finally: --- python3.4-3.4.2~rc1.orig/debian/patches/ctypes-arm.diff +++ python3.4-3.4.2~rc1/debian/patches/ctypes-arm.diff @@ -0,0 +1,34 @@ +Index: b/Lib/ctypes/util.py +=================================================================== +--- a/Lib/ctypes/util.py ++++ b/Lib/ctypes/util.py +@@ -201,16 +201,27 @@ elif os.name == "posix": + + def _findSoname_ldconfig(name): + import struct ++ # XXX this code assumes that we know all unames and that a single ++ # ABI is supported per uname; instead we should find what the ++ # ABI is (e.g. check ABI of current process) or simply ask libc ++ # to load the library for us ++ uname = os.uname() ++ # ARM has a variety of unames, e.g. armv7l ++ if uname.machine.startswith("arm"): ++ machine = "arm" + if struct.calcsize('l') == 4: +- machine = os.uname().machine + '-32' ++ machine = uname.machine + '-32' + else: +- machine = os.uname().machine + '-64' ++ machine = uname.machine + '-64' + mach_map = { + 'x86_64-64': 'libc6,x86-64', + 'ppc64-64': 'libc6,64bit', + 'sparc64-64': 'libc6,64bit', + 's390x-64': 'libc6,64bit', + 'ia64-64': 'libc6,IA-64', ++ # this actually breaks on biarch or multiarch as the first ++ # library wins; uname doesn't tell us which ABI we're using ++ 'arm-32': 'libc6(,hard-float)?', + } + abi_type = mach_map.get(machine, 'libc6') + --- python3.4-3.4.2~rc1.orig/debian/patches/deb-locations.diff +++ python3.4-3.4.2~rc1/debian/patches/deb-locations.diff @@ -0,0 +1,30 @@ +# DP: adjust locations of directories to debian policy + +Index: b/Lib/pydoc.py +=================================================================== +--- a/Lib/pydoc.py ++++ b/Lib/pydoc.py +@@ -28,6 +28,10 @@ to a file named ".html". + + Module docs for core modules are assumed to be in + ++ /usr/share/doc/pythonX.Y/html/library ++ ++if the pythonX.Y-doc package is installed or in ++ + http://docs.python.org/X.Y/library/ + + This can be overridden by setting the PYTHONDOCS environment variable +Index: b/Misc/python.man +=================================================================== +--- a/Misc/python.man ++++ b/Misc/python.man +@@ -330,7 +330,7 @@ exception). Error messages are written + These are subject to difference depending on local installation + conventions; ${prefix} and ${exec_prefix} are installation-dependent + and should be interpreted as for GNU software; they may be the same. +-The default for both is \fI/usr/local\fP. ++On Debian GNU/{Hurd,Linux} the default for both is \fI/usr\fP. + .IP \fI${exec_prefix}/bin/python\fP + Recommended location of the interpreter. + .PP --- python3.4-3.4.2~rc1.orig/debian/patches/deb-setup.diff +++ python3.4-3.4.2~rc1/debian/patches/deb-setup.diff @@ -0,0 +1,33 @@ +# DP: Don't include /usr/local/include and /usr/local/lib as gcc search paths + +Index: b/setup.py +=================================================================== +--- a/setup.py ++++ b/setup.py +@@ -246,8 +246,10 @@ class PyBuildExt(build_ext): + # unfortunately, distutils doesn't let us provide separate C and C++ + # compilers + if compiler is not None: +- (ccshared,cflags) = sysconfig.get_config_vars('CCSHARED','CFLAGS') +- args['compiler_so'] = compiler + ' ' + ccshared + ' ' + cflags ++ (ccshared, cppflags, cflags) = \ ++ sysconfig.get_config_vars('CCSHARED', 'CPPFLAGS', 'CFLAGS') ++ cppflags = ' '.join([f for f in cppflags.split() if not f.startswith('-I')]) ++ args['compiler_so'] = compiler + ' ' + ccshared + ' ' + cppflags + ' ' + cflags + self.compiler.set_executables(**args) + + build_ext.build_extensions(self) +@@ -447,12 +449,7 @@ class PyBuildExt(build_ext): + os.unlink(tmpfile) + + def detect_modules(self): +- # Ensure that /usr/local is always used, but the local build +- # directories (i.e. '.' and 'Include') must be first. See issue +- # 10520. +- if not cross_compiling: +- add_dir_to_list(self.compiler.library_dirs, '/usr/local/lib') +- add_dir_to_list(self.compiler.include_dirs, '/usr/local/include') ++ # On Debian /usr/local is always used, so we don't include it twice + # only change this for cross builds for 3.3, issues on Mageia + if cross_compiling: + self.add_gcc_paths() --- python3.4-3.4.2~rc1.orig/debian/patches/disable-sem-check.diff +++ python3.4-3.4.2~rc1/debian/patches/disable-sem-check.diff @@ -0,0 +1,38 @@ +# DP: Assume working semaphores, don't rely on running kernel for the check. + +Index: b/configure.ac +=================================================================== +--- a/configure.ac ++++ b/configure.ac +@@ -3947,8 +3947,13 @@ int main(void) { + AC_MSG_RESULT($ac_cv_posix_semaphores_enabled) + if test $ac_cv_posix_semaphores_enabled = no + then +- AC_DEFINE(POSIX_SEMAPHORES_NOT_ENABLED, 1, +- [Define if POSIX semaphores aren't enabled on your system]) ++ case $ac_sys_system in ++ Linux*) # assume yes, see https://launchpad.net/bugs/630511 ++ ;; ++ *) ++ AC_DEFINE(POSIX_SEMAPHORES_NOT_ENABLED, 1, ++ [Define if POSIX semaphores aren't enabled on your system]) ++ esac + fi + + # Multiprocessing check for broken sem_getvalue +@@ -3983,8 +3988,13 @@ int main(void){ + AC_MSG_RESULT($ac_cv_broken_sem_getvalue) + if test $ac_cv_broken_sem_getvalue = yes + then +- AC_DEFINE(HAVE_BROKEN_SEM_GETVALUE, 1, +- [define to 1 if your sem_getvalue is broken.]) ++ case $ac_sys_system in ++ Linux*) # assume yes, see https://launchpad.net/bugs/630511 ++ ;; ++ *) ++ AC_DEFINE(HAVE_BROKEN_SEM_GETVALUE, 1, ++ [define to 1 if your sem_getvalue is broken.]) ++ esac + fi + + # determine what size digit to use for Python's longs --- python3.4-3.4.2~rc1.orig/debian/patches/disable-some-tests.diff +++ python3.4-3.4.2~rc1/debian/patches/disable-some-tests.diff @@ -0,0 +1,14 @@ +# DP: Disable some failing tests we are not interested in + +Index: b/Lib/distutils/tests/test_build_ext.py +=================================================================== +--- a/Lib/distutils/tests/test_build_ext.py ++++ b/Lib/distutils/tests/test_build_ext.py +@@ -89,6 +89,7 @@ class BuildExtTestCase(TempdirManager, + build_ext.USER_BASE = self.old_user_base + super(BuildExtTestCase, self).tearDown() + ++ @unittest.skip('Skipping failing Solaris test') + def test_solaris_enable_shared(self): + dist = Distribution({'name': 'xx'}) + cmd = build_ext(dist) --- python3.4-3.4.2~rc1.orig/debian/patches/distutils-init.diff +++ python3.4-3.4.2~rc1/debian/patches/distutils-init.diff @@ -0,0 +1,49 @@ +# DP: Use _sysconfigdata.py in distutils to initialize distutils + +Index: b/Lib/distutils/sysconfig.py +=================================================================== +--- a/Lib/distutils/sysconfig.py ++++ b/Lib/distutils/sysconfig.py +@@ -447,38 +447,11 @@ _config_vars = None + + def _init_posix(): + """Initialize the module as appropriate for POSIX systems.""" +- g = {} +- # load the installed Makefile: +- try: +- filename = get_makefile_filename() +- parse_makefile(filename, g) +- except OSError as msg: +- my_msg = "invalid Python installation: unable to open %s" % filename +- if hasattr(msg, "strerror"): +- my_msg = my_msg + " (%s)" % msg.strerror +- +- raise DistutilsPlatformError(my_msg) +- +- # load the installed pyconfig.h: +- try: +- filename = get_config_h_filename() +- with open(filename) as file: +- parse_config_h(file, g) +- except OSError as msg: +- my_msg = "invalid Python installation: unable to open %s" % filename +- if hasattr(msg, "strerror"): +- my_msg = my_msg + " (%s)" % msg.strerror +- +- raise DistutilsPlatformError(my_msg) +- +- # On AIX, there are wrong paths to the linker scripts in the Makefile +- # -- these paths are relative to the Python source, but when installed +- # the scripts are in another directory. +- if python_build: +- g['LDSHARED'] = g['BLDSHARED'] +- ++ # _sysconfigdata is generated at build time, see the sysconfig module ++ from _sysconfigdata import build_time_vars + global _config_vars +- _config_vars = g ++ _config_vars = {} ++ _config_vars.update(build_time_vars) + + + def _init_nt(): --- python3.4-3.4.2~rc1.orig/debian/patches/distutils-install-layout.diff +++ python3.4-3.4.2~rc1/debian/patches/distutils-install-layout.diff @@ -0,0 +1,260 @@ +# DP: distutils: Add an option --install-layout=deb, which +# DP: - installs into $prefix/dist-packages instead of $prefix/site-packages. +# DP: - doesn't encode the python version into the egg name. + +Index: b/Lib/distutils/command/install_egg_info.py +=================================================================== +--- a/Lib/distutils/command/install_egg_info.py ++++ b/Lib/distutils/command/install_egg_info.py +@@ -14,18 +14,38 @@ class install_egg_info(Command): + description = "Install package's PKG-INFO metadata as an .egg-info file" + user_options = [ + ('install-dir=', 'd', "directory to install to"), ++ ('install-layout', None, "custom installation layout"), + ] + + def initialize_options(self): + self.install_dir = None ++ self.install_layout = None ++ self.prefix_option = None + + def finalize_options(self): + self.set_undefined_options('install_lib',('install_dir','install_dir')) +- basename = "%s-%s-py%s.egg-info" % ( +- to_filename(safe_name(self.distribution.get_name())), +- to_filename(safe_version(self.distribution.get_version())), +- sys.version[:3] +- ) ++ self.set_undefined_options('install',('install_layout','install_layout')) ++ self.set_undefined_options('install',('prefix_option','prefix_option')) ++ if self.install_layout: ++ if not self.install_layout.lower() in ['deb', 'unix']: ++ raise DistutilsOptionError( ++ "unknown value for --install-layout") ++ no_pyver = (self.install_layout.lower() == 'deb') ++ elif self.prefix_option: ++ no_pyver = False ++ else: ++ no_pyver = True ++ if no_pyver: ++ basename = "%s-%s.egg-info" % ( ++ to_filename(safe_name(self.distribution.get_name())), ++ to_filename(safe_version(self.distribution.get_version())) ++ ) ++ else: ++ basename = "%s-%s-py%s.egg-info" % ( ++ to_filename(safe_name(self.distribution.get_name())), ++ to_filename(safe_version(self.distribution.get_version())), ++ sys.version[:3] ++ ) + self.target = os.path.join(self.install_dir, basename) + self.outputs = [self.target] + +Index: b/Lib/distutils/command/install.py +=================================================================== +--- a/Lib/distutils/command/install.py ++++ b/Lib/distutils/command/install.py +@@ -35,6 +35,20 @@ INSTALL_SCHEMES = { + 'scripts': '$base/bin', + 'data' : '$base', + }, ++ 'unix_local': { ++ 'purelib': '$base/local/lib/python$py_version_short/dist-packages', ++ 'platlib': '$platbase/local/lib/python$py_version_short/dist-packages', ++ 'headers': '$base/local/include/python$py_version_short/$dist_name', ++ 'scripts': '$base/local/bin', ++ 'data' : '$base/local', ++ }, ++ 'deb_system': { ++ 'purelib': '$base/lib/python3/dist-packages', ++ 'platlib': '$platbase/lib/python3/dist-packages', ++ 'headers': '$base/include/python$py_version_short/$dist_name', ++ 'scripts': '$base/bin', ++ 'data' : '$base', ++ }, + 'unix_home': { + 'purelib': '$base/lib/python', + 'platlib': '$base/lib/python', +@@ -131,6 +145,9 @@ class install(Command): + + ('record=', None, + "filename in which to record list of installed files"), ++ ++ ('install-layout=', None, ++ "installation layout to choose (known values: deb, unix)"), + ] + + boolean_options = ['compile', 'force', 'skip-build'] +@@ -151,6 +168,7 @@ class install(Command): + self.exec_prefix = None + self.home = None + self.user = 0 ++ self.prefix_option = None + + # These select only the installation base; it's up to the user to + # specify the installation scheme (currently, that means supplying +@@ -172,6 +190,9 @@ class install(Command): + self.install_userbase = USER_BASE + self.install_usersite = USER_SITE + ++ # enable custom installation, known values: deb ++ self.install_layout = None ++ + self.compile = None + self.optimize = None + +@@ -411,6 +432,7 @@ class install(Command): + self.install_base = self.install_platbase = self.home + self.select_scheme("unix_home") + else: ++ self.prefix_option = self.prefix + if self.prefix is None: + if self.exec_prefix is not None: + raise DistutilsOptionError( +@@ -425,7 +447,26 @@ class install(Command): + + self.install_base = self.prefix + self.install_platbase = self.exec_prefix +- self.select_scheme("unix_prefix") ++ if self.install_layout: ++ if self.install_layout.lower() in ['deb']: ++ self.select_scheme("deb_system") ++ elif self.install_layout.lower() in ['unix']: ++ self.select_scheme("unix_prefix") ++ else: ++ raise DistutilsOptionError( ++ "unknown value for --install-layout") ++ elif ((self.prefix_option and ++ os.path.normpath(self.prefix) != '/usr/local') ++ or sys.base_prefix != sys.prefix ++ or 'PYTHONUSERBASE' in os.environ ++ or 'VIRTUAL_ENV' in os.environ ++ or 'real_prefix' in sys.__dict__): ++ self.select_scheme("unix_prefix") ++ else: ++ if os.path.normpath(self.prefix) == '/usr/local': ++ self.prefix = self.exec_prefix = '/usr' ++ self.install_base = self.install_platbase = '/usr' ++ self.select_scheme("unix_local") + + def finalize_other(self): + """Finalizes options for non-posix platforms""" +Index: b/Lib/distutils/sysconfig.py +=================================================================== +--- a/Lib/distutils/sysconfig.py ++++ b/Lib/distutils/sysconfig.py +@@ -134,6 +134,7 @@ def get_python_lib(plat_specific=0, stan + If 'prefix' is supplied, use it instead of sys.base_prefix or + sys.base_exec_prefix -- i.e., ignore 'plat_specific'. + """ ++ is_default_prefix = not prefix or os.path.normpath(prefix) in ('/usr', '/usr/local') + if prefix is None: + if standard_lib: + prefix = plat_specific and BASE_EXEC_PREFIX or BASE_PREFIX +@@ -145,6 +146,12 @@ def get_python_lib(plat_specific=0, stan + "lib", "python" + get_python_version()) + if standard_lib: + return libpython ++ elif (is_default_prefix and ++ 'PYTHONUSERBASE' not in os.environ and ++ 'VIRTUAL_ENV' not in os.environ and ++ 'real_prefix' not in sys.__dict__ and ++ sys.prefix == sys.base_prefix): ++ return os.path.join(prefix, "lib", "python3", "dist-packages") + else: + return os.path.join(libpython, "site-packages") + elif os.name == "nt": +Index: b/Lib/site.py +=================================================================== +--- a/Lib/site.py ++++ b/Lib/site.py +@@ -288,6 +288,13 @@ def addusersitepackages(known_paths): + + if ENABLE_USER_SITE and os.path.isdir(user_site): + addsitedir(user_site, known_paths) ++ if ENABLE_USER_SITE: ++ for dist_libdir in ("lib", "local/lib"): ++ user_site = os.path.join(USER_BASE, dist_libdir, ++ "python" + sys.version[:3], ++ "dist-packages") ++ if os.path.isdir(user_site): ++ addsitedir(user_site, known_paths) + return known_paths + + def getsitepackages(prefixes=None): +Index: b/Lib/test/test_site.py +=================================================================== +--- a/Lib/test/test_site.py ++++ b/Lib/test/test_site.py +@@ -243,12 +243,20 @@ class HelperFunctionsTests(unittest.Test + self.assertEqual(dirs[2], wanted) + elif os.sep == '/': + # OS X non-framwework builds, Linux, FreeBSD, etc +- self.assertEqual(len(dirs), 2) +- wanted = os.path.join('xoxo', 'lib', 'python' + sys.version[:3], +- 'site-packages') ++ self.assertEqual(len(dirs), 4) ++ wanted = os.path.join('xoxo', 'local', 'lib', ++ 'python' + sys.version[:3], ++ 'dist-packages') + self.assertEqual(dirs[0], wanted) +- wanted = os.path.join('xoxo', 'lib', 'site-python') ++ wanted = os.path.join('xoxo', 'lib', ++ 'python3', 'dist-packages') + self.assertEqual(dirs[1], wanted) ++ wanted = os.path.join('xoxo', 'lib', ++ 'python' + sys.version[:3], ++ 'dist-packages') ++ self.assertEqual(dirs[2], wanted) ++ wanted = os.path.join('xoxo', 'lib', 'dist-python') ++ self.assertEqual(dirs[3], wanted) + else: + # other platforms + self.assertEqual(len(dirs), 2) +Index: b/Lib/distutils/tests/test_bdist_dumb.py +=================================================================== +--- a/Lib/distutils/tests/test_bdist_dumb.py ++++ b/Lib/distutils/tests/test_bdist_dumb.py +@@ -85,7 +85,7 @@ class BuildDumbTestCase(support.TempdirM + fp.close() + + contents = sorted(os.path.basename(fn) for fn in contents) +- wanted = ['foo-0.1-py%s.%s.egg-info' % sys.version_info[:2], 'foo.py'] ++ wanted = ['foo-0.1.egg-info', 'foo.py'] + if not sys.dont_write_bytecode: + wanted.append('foo.%s.pyc' % sys.implementation.cache_tag) + self.assertEqual(contents, sorted(wanted)) +Index: b/Lib/distutils/tests/test_install.py +=================================================================== +--- a/Lib/distutils/tests/test_install.py ++++ b/Lib/distutils/tests/test_install.py +@@ -194,7 +194,7 @@ class InstallTestCase(support.TempdirMan + found = [os.path.basename(line) for line in content.splitlines()] + expected = ['hello.py', 'hello.%s.pyc' % sys.implementation.cache_tag, + 'sayhi', +- 'UNKNOWN-0.0.0-py%s.%s.egg-info' % sys.version_info[:2]] ++ 'UNKNOWN-0.0.0.egg-info'] + self.assertEqual(found, expected) + + def test_record_extensions(self): +@@ -224,7 +224,7 @@ class InstallTestCase(support.TempdirMan + + found = [os.path.basename(line) for line in content.splitlines()] + expected = [_make_ext_name('xx'), +- 'UNKNOWN-0.0.0-py%s.%s.egg-info' % sys.version_info[:2]] ++ 'UNKNOWN-0.0.0.egg-info'] + self.assertEqual(found, expected) + + def test_debug_mode(self): +Index: b/Lib/pydoc.py +=================================================================== +--- a/Lib/pydoc.py ++++ b/Lib/pydoc.py +@@ -405,6 +405,7 @@ class Doc: + 'marshal', 'posix', 'signal', 'sys', + '_thread', 'zipimport') or + (file.startswith(basedir) and ++ not file.startswith(os.path.join(basedir, 'dist-packages')) and + not file.startswith(os.path.join(basedir, 'site-packages')))) and + object.__name__ not in ('xml.etree', 'test.pydoc_mod')): + if docloc.startswith("http://"): --- python3.4-3.4.2~rc1.orig/debian/patches/distutils-link.diff +++ python3.4-3.4.2~rc1/debian/patches/distutils-link.diff @@ -0,0 +1,24 @@ +# DP: Don't add standard library dirs to library_dirs and runtime_library_dirs. + +Index: b/Lib/distutils/unixccompiler.py +=================================================================== +--- a/Lib/distutils/unixccompiler.py ++++ b/Lib/distutils/unixccompiler.py +@@ -153,6 +153,17 @@ + runtime_library_dirs) + libraries, library_dirs, runtime_library_dirs = fixed_args + ++ # filter out standard library paths, which are not explicitely needed ++ # for linking ++ system_libdirs = ['/lib', '/lib64', '/usr/lib', '/usr/lib64'] ++ multiarch = sysconfig.get_config_var("MULTIARCH") ++ if multiarch: ++ system_libdirs.extend(['/lib/%s' % multiarch, '/usr/lib/%s' % multiarch]) ++ library_dirs = [dir for dir in library_dirs ++ if not dir in system_libdirs] ++ runtime_library_dirs = [dir for dir in runtime_library_dirs ++ if not dir in system_libdirs] ++ + lib_opts = gen_lib_options(self, library_dirs, runtime_library_dirs, + libraries) + if not isinstance(output_dir, (str, type(None))): --- python3.4-3.4.2~rc1.orig/debian/patches/distutils-sysconfig.diff +++ python3.4-3.4.2~rc1/debian/patches/distutils-sysconfig.diff @@ -0,0 +1,45 @@ +# DP: Get CONFIGURE_CFLAGS, CONFIGURE_CPPFLAGS, CONFIGURE_LDFLAGS from +# DP: the python build, when CFLAGS, CPPFLAGS, LDSHARED) are not set +# DP: in the environment. + +Index: b/Lib/distutils/sysconfig.py +=================================================================== +--- a/Lib/distutils/sysconfig.py ++++ b/Lib/distutils/sysconfig.py +@@ -189,9 +189,11 @@ def customize_compiler(compiler): + _osx_support.customize_compiler(_config_vars) + _config_vars['CUSTOMIZED_OSX_COMPILER'] = 'True' + +- (cc, cxx, opt, cflags, ccshared, ldshared, shlib_suffix, ar, ar_flags) = \ ++ (cc, cxx, opt, cflags, ccshared, ldshared, shlib_suffix, ar, ar_flags, ++ configure_cppflags, configure_cflags, configure_ldflags) = \ + get_config_vars('CC', 'CXX', 'OPT', 'CFLAGS', +- 'CCSHARED', 'LDSHARED', 'SHLIB_SUFFIX', 'AR', 'ARFLAGS') ++ 'CCSHARED', 'LDSHARED', 'SHLIB_SUFFIX', 'AR', 'ARFLAGS', ++ 'CONFIGURE_CPPFLAGS', 'CONFIGURE_CFLAGS', 'CONFIGURE_LDFLAGS') + + if 'CC' in os.environ: + newcc = os.environ['CC'] +@@ -212,13 +214,22 @@ def customize_compiler(compiler): + cpp = cc + " -E" # not always + if 'LDFLAGS' in os.environ: + ldshared = ldshared + ' ' + os.environ['LDFLAGS'] ++ elif configure_ldflags: ++ ldshared = ldshared + ' ' + configure_ldflags + if 'CFLAGS' in os.environ: + cflags = opt + ' ' + os.environ['CFLAGS'] + ldshared = ldshared + ' ' + os.environ['CFLAGS'] ++ elif configure_cflags: ++ cflags = opt + ' ' + configure_cflags ++ ldshared = ldshared + ' ' + configure_cflags + if 'CPPFLAGS' in os.environ: + cpp = cpp + ' ' + os.environ['CPPFLAGS'] + cflags = cflags + ' ' + os.environ['CPPFLAGS'] + ldshared = ldshared + ' ' + os.environ['CPPFLAGS'] ++ elif configure_cppflags: ++ cpp = cpp + ' ' + configure_cppflags ++ cflags = cflags + ' ' + configure_cppflags ++ ldshared = ldshared + ' ' + configure_cppflags + if 'AR' in os.environ: + ar = os.environ['AR'] + if 'ARFLAGS' in os.environ: --- python3.4-3.4.2~rc1.orig/debian/patches/doc-build.diff +++ python3.4-3.4.2~rc1/debian/patches/doc-build.diff @@ -0,0 +1,38 @@ +# DP: Allow docs to be built with Sphinx 0.5.x. + +--- a/Doc/tools/sphinxext/pyspecific.py ++++ b/Doc/tools/sphinxext/pyspecific.py +@@ -171,8 +171,15 @@ + from docutils.io import StringOutput + from docutils.utils import new_document + +-from sphinx.builders import Builder +-from sphinx.writers.text import TextWriter ++try: ++ from sphinx.builders import Builder ++except ImportError: ++ from sphinx.builder import Builder ++ ++try: ++ from sphinx.writers.text import TextWriter ++except ImportError: ++ from sphinx.textwriter import TextWriter + + + class PydocTopicsBuilder(Builder): +--- a/Doc/tools/sphinxext/suspicious.py ++++ b/Doc/tools/sphinxext/suspicious.py +@@ -47,7 +47,12 @@ + import sys + + from docutils import nodes +-from sphinx.builders import Builder ++ ++try: ++ from sphinx.builders import Builder ++except ImportError: ++ from sphinx.builder import Builder ++ + + detect_all = re.compile(r''' + ::(?=[^=])| # two :: (but NOT ::=) --- python3.4-3.4.2~rc1.orig/debian/patches/doc-faq.dpatch +++ python3.4-3.4.2~rc1/debian/patches/doc-faq.dpatch @@ -0,0 +1,52 @@ +#! /bin/sh -e + +# DP: Mention the FAQ on the documentation index page. + +dir= +if [ $# -eq 3 -a "$2" = '-d' ]; then + pdir="-d $3" + dir="$3/" +elif [ $# -ne 1 ]; then + echo >&2 "usage: `basename $0`: -patch|-unpatch [-d ]" + exit 1 +fi +case "$1" in + -patch) + patch $pdir -f --no-backup-if-mismatch -p0 < $0 + ;; + -unpatch) + patch $pdir -f --no-backup-if-mismatch -R -p0 < $0 + ;; + *) + echo >&2 "usage: `basename $0`: -patch|-unpatch [-d ]" + exit 1 +esac +exit 0 + +--- Doc/html/index.html.in~ 2002-04-01 18:11:27.000000000 +0200 ++++ Doc/html/index.html.in 2003-04-05 13:33:35.000000000 +0200 +@@ -123,6 +123,24 @@ + + + ++ ++ ++ ++

FAQ (local copy) ++
(python package must be installed) ++

++ ++ ++ ++

FAQ (online wizard) ++
(maybe more recent) ++

++ ++ + + +

--- python3.4-3.4.2~rc1.orig/debian/patches/enable-fpectl.diff +++ python3.4-3.4.2~rc1/debian/patches/enable-fpectl.diff @@ -0,0 +1,16 @@ +# DP: Enable the build of the fpectl module. + +Index: b/setup.py +=================================================================== +--- a/setup.py ++++ b/setup.py +@@ -1320,6 +1320,9 @@ class PyBuildExt(build_ext): + else: + missing.append('_curses_panel') + ++ #fpectl fpectlmodule.c ... ++ exts.append( Extension('fpectl', ['fpectlmodule.c']) ) ++ + # Andrew Kuchling's zlib module. Note that some versions of zlib + # 1.1.3 have security problems. See CERT Advisory CA-2002-07: + # http://www.cert.org/advisories/CA-2002-07.html --- python3.4-3.4.2~rc1.orig/debian/patches/ensurepip-wheels.diff +++ python3.4-3.4.2~rc1/debian/patches/ensurepip-wheels.diff @@ -0,0 +1,125 @@ +--- a/Lib/ensurepip/__init__.py ++++ b/Lib/ensurepip/__init__.py +@@ -1,3 +1,4 @@ ++import glob + import os + import os.path + import pkgutil +@@ -8,13 +9,9 @@ + __all__ = ["version", "bootstrap"] + + +-_SETUPTOOLS_VERSION = "2.1" +- +-_PIP_VERSION = "1.5.6" +- + # pip currently requires ssl support, so we try to provide a nicer + # error message when that is missing (http://bugs.python.org/issue19744) +-_MISSING_SSL_MESSAGE = ("pip {} requires SSL/TLS".format(_PIP_VERSION)) ++_MISSING_SSL_MESSAGE = ("pip requires SSL/TLS") + try: + import ssl + except ImportError: +@@ -26,8 +23,8 @@ + pass + + _PROJECTS = [ +- ("setuptools", _SETUPTOOLS_VERSION), +- ("pip", _PIP_VERSION), ++ "setuptools", ++ "pip", + ] + + +@@ -45,7 +42,10 @@ + """ + Returns a string specifying the bundled version of pip. + """ +- return _PIP_VERSION ++ wheel_names = glob.glob('/usr/share/python-wheels/pip-*.whl') ++ assert len(wheel_names) == 1, wheel_names ++ return os.path.basename(wheel_names[0]).split('-')[1] ++ + + def _disable_pip_configuration_settings(): + # We deliberately ignore all pip environment variables +@@ -87,20 +87,41 @@ + # omit pip and easy_install + os.environ["ENSUREPIP_OPTIONS"] = "install" + ++ # Debian: The bundled wheels are useless to us because we must use ones ++ # crafted from source code in the archive. As we build the virtual ++ # environment, copy the wheels from the system location into the virtual ++ # environment, and place those wheels on sys.path. ++ def copy_wheels(wheels, destdir, paths): ++ for project in wheels: ++ wheel_names = glob.glob( ++ '/usr/share/python-wheels/{}-*.whl'.format(project)) ++ if len(wheel_names) == 0: ++ raise RuntimeError('missing dependency wheel %s' % project) ++ assert len(wheel_names) == 1, wheel_names ++ wheel_name = os.path.basename(wheel_names[0]) ++ path = os.path.join('/usr/share/python-wheels', wheel_name) ++ with open(path, 'rb') as fp: ++ whl = fp.read() ++ dest = os.path.join(destdir, wheel_name) ++ with open(dest, 'wb') as fp: ++ fp.write(whl) ++ paths.append(dest) ++ ++ private_wheel_dir = os.path.join(sys.prefix, 'lib', 'python-wheels') ++ os.makedirs(private_wheel_dir, exist_ok=True) ++ for project in _PROJECTS: ++ try: ++ with open('/usr/share/python-wheels/%s.dependencies' % project) as fp: ++ dependencies = [line[:-1].split()[0] for line in fp.readlines()] ++ except FileNotFoundError: ++ dependencies = [] ++ copy_wheels(dependencies, private_wheel_dir, sys.path) ++ + with tempfile.TemporaryDirectory() as tmpdir: + # Put our bundled wheels into a temporary directory and construct the + # additional paths that need added to sys.path + additional_paths = [] +- for project, version in _PROJECTS: +- wheel_name = "{}-{}-py2.py3-none-any.whl".format(project, version) +- whl = pkgutil.get_data( +- "ensurepip", +- "_bundled/{}".format(wheel_name), +- ) +- with open(os.path.join(tmpdir, wheel_name), "wb") as fp: +- fp.write(whl) +- +- additional_paths.append(os.path.join(tmpdir, wheel_name)) ++ copy_wheels(_PROJECTS, tmpdir, additional_paths) + + # Construct the arguments to be passed to the pip command + args = ["install", "--no-index", "--find-links", tmpdir] +@@ -113,7 +134,7 @@ + if verbosity: + args += ["-" + "v" * verbosity] + +- _run_pip(args + [p[0] for p in _PROJECTS], additional_paths) ++ _run_pip(args + _PROJECTS, additional_paths) + + def _uninstall_helper(*, verbosity=0): + """Helper to support a clean default uninstall process on Windows +@@ -127,7 +148,8 @@ + return + + # If the pip version doesn't match the bundled one, leave it alone +- if pip.__version__ != _PIP_VERSION: ++ # Disabled for Debian, always using the version from the python3-pip package. ++ if False and pip.__version__ != _PIP_VERSION: + msg = ("ensurepip will only uninstall a matching version " + "({!r} installed, {!r} bundled)") + print(msg.format(pip.__version__, _PIP_VERSION), file=sys.stderr) +@@ -141,7 +163,7 @@ + if verbosity: + args += ["-" + "v" * verbosity] + +- _run_pip(args + [p[0] for p in reversed(_PROJECTS)]) ++ _run_pip(args + reversed(_PROJECTS)) + + + def _main(argv=None): --- python3.4-3.4.2~rc1.orig/debian/patches/ext-no-libpython-link.diff +++ python3.4-3.4.2~rc1/debian/patches/ext-no-libpython-link.diff @@ -0,0 +1,24 @@ +# DP: Don't link extensions with the shared libpython library. + +Index: b/Lib/distutils/command/build_ext.py +=================================================================== +--- a/Lib/distutils/command/build_ext.py ++++ b/Lib/distutils/command/build_ext.py +@@ -236,7 +236,7 @@ class build_ext(Command): + # For building extensions with a shared Python library, + # Python's library directory must be appended to library_dirs + # See Issues: #1600860, #4366 +- if (sysconfig.get_config_var('Py_ENABLE_SHARED')): ++ if False and (sysconfig.get_config_var('Py_ENABLE_SHARED')): + if sys.executable.startswith(os.path.join(sys.exec_prefix, "bin")): + # building third party extensions + self.library_dirs.append(sysconfig.get_config_var('LIBDIR')) +@@ -726,7 +726,7 @@ class build_ext(Command): + return ext.libraries + else: + from distutils import sysconfig +- if sysconfig.get_config_var('Py_ENABLE_SHARED'): ++ if False and sysconfig.get_config_var('Py_ENABLE_SHARED'): + pythonlib = 'python{}.{}{}'.format( + sys.hexversion >> 24, (sys.hexversion >> 16) & 0xff, + sys.abiflags) --- python3.4-3.4.2~rc1.orig/debian/patches/gdbm-import.diff +++ python3.4-3.4.2~rc1/debian/patches/gdbm-import.diff @@ -0,0 +1,12 @@ +# DP: suggest installation of python3-gdbm package on failing _gdbm import + +--- a/Lib/dbm/gnu.py ++++ b/Lib/dbm/gnu.py +@@ -1,3 +1,6 @@ + """Provide the _gdbm module as a dbm submodule.""" + +-from _gdbm import * ++try: ++ from _gdbm import * ++except ImportError as msg: ++ raise ImportError(str(msg) + ', please install the python3-gdbm package') --- python3.4-3.4.2~rc1.orig/debian/patches/hg-updates.diff +++ python3.4-3.4.2~rc1/debian/patches/hg-updates.diff @@ -0,0 +1,14921 @@ +# DP: updates from the 3.4 release branch (until 2014-09-30, 92641:158127da99ac). + +# hg diff -r v3.4.2rc1 | filterdiff --exclude=.hgignore --exclude=.hgeol --exclude=.hgtags --remove-timestamps + +diff -r 8711a0951384 Doc/Makefile +--- a/Doc/Makefile ++++ b/Doc/Makefile +@@ -165,9 +165,10 @@ + autobuild-html: + make html SPHINXOPTS='-A daily=1 -A versionswitcher=1' + +-# for stable releases: only build if not in pre-release stage (alpha, beta, rc) ++# for stable releases: only build if not in pre-release stage (alpha, beta) ++# release candidate downloads are okay, since the stable tree can be in that stage + autobuild-stable: +- @case $(DISTVERSION) in *[abc]*) \ ++ @case $(DISTVERSION) in *[ab]*) \ + echo "Not building; $(DISTVERSION) is not a release version."; \ + exit 1;; \ + esac +diff -r 8711a0951384 Doc/conf.py +--- a/Doc/conf.py ++++ b/Doc/conf.py +@@ -61,7 +61,7 @@ + # By default, highlight as Python 3. + highlight_language = 'python3' + +-needs_sphinx = '1.1' ++needs_sphinx = '1.2' + + + # Options for HTML output +diff -r 8711a0951384 Doc/faq/programming.rst +--- a/Doc/faq/programming.rst ++++ b/Doc/faq/programming.rst +@@ -401,7 +401,7 @@ + + # Calculate the value + result = ... expensive computation ... +- _cache[(arg1, arg2)] = result # Store result in the cache ++ _cache[(arg1, arg2)] = result # Store result in the cache + return result + + You could use a global variable containing a dictionary instead of the default +@@ -448,6 +448,81 @@ + the values ``42``, ``314``, and ``somevar`` are arguments. + + ++Why did changing list 'y' also change list 'x'? ++------------------------------------------------ ++ ++If you wrote code like:: ++ ++ >>> x = [] ++ >>> y = x ++ >>> y.append(10) ++ >>> y ++ [10] ++ >>> x ++ [10] ++ ++you might be wondering why appending an element to ``y`` changed ``x`` too. ++ ++There are two factors that produce this result: ++ ++1) Variables are simply names that refer to objects. Doing ``y = x`` doesn't ++ create a copy of the list -- it creates a new variable ``y`` that refers to ++ the same object ``x`` refers to. This means that there is only one object ++ (the list), and both ``x`` and ``y`` refer to it. ++2) Lists are :term:`mutable`, which means that you can change their content. ++ ++After the call to :meth:`~list.append`, the content of the mutable object has ++changed from ``[]`` to ``[10]``. Since both the variables refer to the same ++object, using either name accesses the modified value ``[10]``. ++ ++If we instead assign an immutable object to ``x``:: ++ ++ >>> x = 5 # ints are immutable ++ >>> y = x ++ >>> x = x + 1 # 5 can't be mutated, we are creating a new object here ++ >>> x ++ 6 ++ >>> y ++ 5 ++ ++we can see that in this case ``x`` and ``y`` are not equal anymore. This is ++because integers are :term:`immutable`, and when we do ``x = x + 1`` we are not ++mutating the int ``5`` by incrementing its value; instead, we are creating a ++new object (the int ``6``) and assigning it to ``x`` (that is, changing which ++object ``x`` refers to). After this assignment we have two objects (the ints ++``6`` and ``5``) and two variables that refer to them (``x`` now refers to ++``6`` but ``y`` still refers to ``5``). ++ ++Some operations (for example ``y.append(10)`` and ``y.sort()``) mutate the ++object, whereas superficially similar operations (for example ``y = y + [10]`` ++and ``sorted(y)``) create a new object. In general in Python (and in all cases ++in the standard library) a method that mutates an object will return ``None`` ++to help avoid getting the two types of operations confused. So if you ++mistakenly write ``y.sort()`` thinking it will give you a sorted copy of ``y``, ++you'll instead end up with ``None``, which will likely cause your program to ++generate an easily diagnosed error. ++ ++However, there is one class of operations where the same operation sometimes ++has different behaviors with different types: the augmented assignment ++operators. For example, ``+=`` mutates lists but not tuples or ints (``a_list +++= [1, 2, 3]`` is equivalent to ``a_list.extend([1, 2, 3])`` and mutates ++``a_list``, whereas ``some_tuple += (1, 2, 3)`` and ``some_int += 1`` create ++new objects). ++ ++In other words: ++ ++* If we have a mutable object (:class:`list`, :class:`dict`, :class:`set`, ++ etc.), we can use some specific operations to mutate it and all the variables ++ that refer to it will see the change. ++* If we have an immutable object (:class:`str`, :class:`int`, :class:`tuple`, ++ etc.), all the variables that refer to it will always see the same value, ++ but operations that transform that value into a new value always return a new ++ object. ++ ++If you want to know if two variables refer to the same object or not, you can ++use the :keyword:`is` operator, or the built-in function :func:`id`. ++ ++ + How do I write a function with output parameters (call by reference)? + --------------------------------------------------------------------- + +diff -r 8711a0951384 Doc/library/argparse.rst +--- a/Doc/library/argparse.rst ++++ b/Doc/library/argparse.rst +@@ -1949,6 +1949,16 @@ + :mod:`optparse` had either been copy-pasted over or monkey-patched, it no + longer seemed practical to try to maintain the backwards compatibility. + ++The :mod:`argparse` module improves on the standard library :mod:`optparse` ++module in a number of ways including: ++ ++* Handling positional arguments. ++* Supporting sub-commands. ++* Allowing alternative option prefixes like ``+`` and ``/``. ++* Handling zero-or-more and one-or-more style arguments. ++* Producing more informative usage messages. ++* Providing a much simpler interface for custom ``type`` and ``action``. ++ + A partial upgrade path from :mod:`optparse` to :mod:`argparse`: + + * Replace all :meth:`optparse.OptionParser.add_option` calls with +diff -r 8711a0951384 Doc/library/asyncio-task.rst +--- a/Doc/library/asyncio-task.rst ++++ b/Doc/library/asyncio-task.rst +@@ -319,18 +319,18 @@ + Schedule the execution of a :ref:`coroutine `: wrap it in a + future. A task is a subclass of :class:`Future`. + +- A task is responsible to execute a coroutine object in an event loop. If ++ A task is responsible for executing a coroutine object in an event loop. If + the wrapped coroutine yields from a future, the task suspends the execution + of the wrapped coroutine and waits for the completition of the future. When + the future is done, the execution of the wrapped coroutine restarts with the + result or the exception of the future. + + Event loops use cooperative scheduling: an event loop only runs one task at +- the same time. Other tasks may run in parallel if other event loops are ++ a time. Other tasks may run in parallel if other event loops are + running in different threads. While a task waits for the completion of a + future, the event loop executes a new task. + +- The cancellation of a task is different than cancelling a future. Calling ++ The cancellation of a task is different from the cancelation of a future. Calling + :meth:`cancel` will throw a :exc:`~concurrent.futures.CancelledError` to the + wrapped coroutine. :meth:`~Future.cancelled` only returns ``True`` if the + wrapped coroutine did not catch the +@@ -341,7 +341,7 @@ + ` did not complete. It is probably a bug and a warning is + logged: see :ref:`Pending task destroyed `. + +- Don't create directly :class:`Task` instances: use the :func:`async` ++ Don't directly create :class:`Task` instances: use the :func:`async` + function or the :meth:`BaseEventLoop.create_task` method. + + .. classmethod:: all_tasks(loop=None) +@@ -360,17 +360,17 @@ + + .. method:: cancel() + +- Request this task to cancel itself. ++ Request that this task cancel itself. + + This arranges for a :exc:`~concurrent.futures.CancelledError` to be + thrown into the wrapped coroutine on the next cycle through the event + loop. The coroutine then has a chance to clean up or even deny the + request using try/except/finally. + +- Contrary to :meth:`Future.cancel`, this does not guarantee that the task ++ Unlike :meth:`Future.cancel`, this does not guarantee that the task + will be cancelled: the exception might be caught and acted upon, delaying +- cancellation of the task or preventing it completely. The task may also +- return a value or raise a different exception. ++ cancellation of the task or preventing cancellation completely. The task ++ may also return a value or raise a different exception. + + Immediately after this method is called, :meth:`~Future.cancelled` will + not return ``True`` (unless the task was already cancelled). A task will +@@ -405,7 +405,7 @@ + This produces output similar to that of the traceback module, for the + frames retrieved by get_stack(). The limit argument is passed to + get_stack(). The file argument is an I/O stream to which the output +- goes; by default it goes to sys.stderr. ++ is written; by default output is written to sys.stderr. + + + Example: Parallel execution of tasks +diff -r 8711a0951384 Doc/library/email.message.rst +--- a/Doc/library/email.message.rst ++++ b/Doc/library/email.message.rst +@@ -131,7 +131,11 @@ + + Return ``True`` if the message's payload is a list of sub-\ + :class:`Message` objects, otherwise return ``False``. When +- :meth:`is_multipart` returns ``False``, the payload should be a string object. ++ :meth:`is_multipart` returns ``False``, the payload should be a string ++ object. (Note that :meth:`is_multipart` returning ``True`` does not ++ necessarily mean that "msg.get_content_maintype() == 'multipart'" will ++ return the ``True``. For example, ``is_multipart`` will return ``True`` ++ when the :class:`Message` is of type ``message/rfc822``.) + + + .. method:: set_unixfrom(unixfrom) +@@ -584,23 +588,56 @@ + Here's an example that prints the MIME type of every part of a multipart + message structure: + +- .. testsetup:: ++ .. testsetup:: + +- >>> from email import message_from_binary_file +- >>> with open('Lib/test/test_email/data/msg_16.txt', 'rb') as f: +- ... msg = message_from_binary_file(f) ++ >>> from email import message_from_binary_file ++ >>> with open('Lib/test/test_email/data/msg_16.txt', 'rb') as f: ++ ... msg = message_from_binary_file(f) ++ >>> from email.iterators import _structure + +- .. doctest:: ++ .. doctest:: + +- >>> for part in msg.walk(): +- ... print(part.get_content_type()) +- multipart/report +- text/plain +- message/delivery-status +- text/plain +- text/plain +- message/rfc822 +- text/plain ++ >>> for part in msg.walk(): ++ ... print(part.get_content_type()) ++ multipart/report ++ text/plain ++ message/delivery-status ++ text/plain ++ text/plain ++ message/rfc822 ++ text/plain ++ ++ ``walk`` iterates over the subparts of any part where ++ :meth:`is_multipart` returns ``True``, even though ++ ``msg.get_content_maintype() == 'multipart'`` may return ``False``. We ++ can see this in our example by making use of the ``_structure`` debug ++ helper function: ++ ++ .. doctest:: ++ ++ >>> for part in msg.walk(): ++ ... print(part.get_content_maintype() == 'multipart'), ++ ... part.is_multipart()) ++ True True ++ False False ++ False True ++ False False ++ False False ++ False True ++ False False ++ >>> _structure(msg) ++ multipart/report ++ text/plain ++ message/delivery-status ++ text/plain ++ text/plain ++ message/rfc822 ++ text/plain ++ ++ Here the ``message`` parts are not ``multiparts``, but they do contain ++ subparts. ``is_multipart()`` returns ``True`` and ``walk`` descends ++ into the subparts. ++ + + :class:`Message` objects can also optionally contain two instance attributes, + which can be used when generating the plain text of a MIME message. +diff -r 8711a0951384 Doc/library/email.parser.rst +--- a/Doc/library/email.parser.rst ++++ b/Doc/library/email.parser.rst +@@ -181,7 +181,7 @@ + .. versionchanged:: 3.3 + Removed the *strict* argument. Added the *policy* keyword. + +- .. method:: parse(fp, headeronly=False) ++ .. method:: parse(fp, headersonly=False) + + Read all the data from the binary file-like object *fp*, parse the + resulting bytes, and return the message object. *fp* must support +diff -r 8711a0951384 Doc/library/email.rst +--- a/Doc/library/email.rst ++++ b/Doc/library/email.rst +@@ -91,15 +91,19 @@ + +---------------+------------------------------+-----------------------+ + | :const:`2.5` | Python 2.2.2+ and Python 2.3 | Python 2.1 to 2.5 | + +---------------+------------------------------+-----------------------+ +-| :const:`3.0` | Python 2.4 | Python 2.3 to 2.5 | ++| :const:`3.0` | Python 2.4 and Python 2.5 | Python 2.3 to 2.6 | + +---------------+------------------------------+-----------------------+ +-| :const:`4.0` | Python 2.5 | Python 2.3 to 2.5 | ++| :const:`4.0` | Python 2.5 to Python 2.7 | Python 2.3 to 2.7 | + +---------------+------------------------------+-----------------------+ + | :const:`5.0` | Python 3.0 and Python 3.1 | Python 3.0 to 3.2 | + +---------------+------------------------------+-----------------------+ +-| :const:`5.1` | Python 3.2 | Python 3.0 to 3.2 | ++| :const:`5.1` | Python 3.2 | Python 3.2 | + +---------------+------------------------------+-----------------------+ + ++After Version 5.1 (Python 3.2), the email package no longer has a version that ++is separate from the Python version. (See the :ref:`whatsnew-index` documents ++for the respective Python versions for details on changes.) ++ + Here are the major differences between :mod:`email` version 5.1 and + version 5.0: + +diff -r 8711a0951384 Doc/library/stdtypes.rst +--- a/Doc/library/stdtypes.rst ++++ b/Doc/library/stdtypes.rst +@@ -1830,7 +1830,7 @@ + >>> '1,2,3'.split(',') + ['1', '2', '3'] + >>> '1,2,3'.split(',', maxsplit=1) +- ['1', '2 3'] ++ ['1', '2,3'] + >>> '1,2,,3,'.split(',') + ['1', '2', '', '3', ''] + +@@ -2695,7 +2695,7 @@ + >>> b'1,2,3'.split(b',') + [b'1', b'2', b'3'] + >>> b'1,2,3'.split(b',', maxsplit=1) +- [b'1', b'2 3'] ++ [b'1', b'2,3'] + >>> b'1,2,,3,'.split(b',') + [b'1', b'2', b'', b'3', b''] + +diff -r 8711a0951384 Doc/library/subprocess.rst +--- a/Doc/library/subprocess.rst ++++ b/Doc/library/subprocess.rst +@@ -406,12 +406,18 @@ + + Read the `Security Considerations`_ section before using ``shell=True``. + +- *bufsize* will be supplied as the corresponding argument to the :func:`open` +- function when creating the stdin/stdout/stderr pipe file objects: :const:`0` +- means unbuffered (read and write are one system call and can return short), +- :const:`1` means line buffered, any other positive value means use a buffer +- of approximately that size. A negative bufsize (the default) means the +- system default of io.DEFAULT_BUFFER_SIZE will be used. ++ *bufsize* will be supplied as the corresponding argument to the ++ :func:`open` function when creating the stdin/stdout/stderr pipe ++ file objects: ++ ++ - :const:`0` means unbuffered (read and write are one ++ system call and can return short) ++ - :const:`1` means line buffered ++ (only usable if ``universal_newlines=True`` i.e., in a text mode) ++ - any other positive value means use a buffer of approximately that ++ size ++ - negative bufsize (the default) means the system default of ++ io.DEFAULT_BUFFER_SIZE will be used. + + .. versionchanged:: 3.3.1 + *bufsize* now defaults to -1 to enable buffering by default to match the +diff -r 8711a0951384 Doc/tools/sphinxext/pyspecific.py +--- a/Doc/tools/sphinxext/pyspecific.py ++++ b/Doc/tools/sphinxext/pyspecific.py +@@ -14,12 +14,10 @@ + + from docutils import nodes, utils + +-import sphinx + from sphinx.util.nodes import split_explicit_title + from sphinx.util.compat import Directive + from sphinx.writers.html import HTMLTranslator + from sphinx.writers.latex import LaTeXTranslator +-from sphinx.locale import versionlabels + + # monkey-patch reST parser to disable alphabetic and roman enumerated lists + from docutils.parsers.rst.states import Body +@@ -28,20 +26,6 @@ + Body.enum.converters['lowerroman'] = \ + Body.enum.converters['upperroman'] = lambda x: None + +-SPHINX11 = sphinx.__version__[:3] < '1.2' +- +-if SPHINX11: +- # monkey-patch HTML translator to give versionmodified paragraphs a class +- def new_visit_versionmodified(self, node): +- self.body.append(self.starttag(node, 'p', CLASS=node['type'])) +- text = versionlabels[node['type']] % node['version'] +- if len(node): +- text += ':' +- else: +- text += '.' +- self.body.append('%s ' % text) +- HTMLTranslator.visit_versionmodified = new_visit_versionmodified +- + # monkey-patch HTML and LaTeX translators to keep doctest blocks in the + # doctest docs themselves + orig_visit_literal_block = HTMLTranslator.visit_literal_block +@@ -174,10 +158,9 @@ + content.line = node[0].line + content += node[0].children + node[0].replace_self(nodes.paragraph('', '', content)) +- if not SPHINX11: + node[0].insert(0, nodes.inline('', '%s: ' % text, + classes=['versionmodified'])) +- elif not SPHINX11: ++ else: + para = nodes.paragraph('', '', + nodes.inline('', '%s.' % text, classes=['versionmodified'])) + if len(node): +@@ -188,9 +171,6 @@ + env.note_versionchange('deprecated', version[0], node, self.lineno) + return [node] + messages + +-# for Sphinx < 1.2 +-versionlabels['deprecated-removed'] = DeprecatedRemoved._label +- + + # Support for including Misc/NEWS + +@@ -289,14 +269,14 @@ + document.append(doctree.ids[labelid]) + destination = StringOutput(encoding='utf-8') + writer.write(document, destination) +- self.topics[label] = writer.output.encode('utf-8') ++ self.topics[label] = writer.output + + def finish(self): +- f = open(path.join(self.outdir, 'topics.py'), 'w') ++ f = open(path.join(self.outdir, 'topics.py'), 'wb') + try: +- f.write('# -*- coding: utf-8 -*-\n') +- f.write('# Autogenerated by Sphinx on %s\n' % asctime()) +- f.write('topics = ' + pformat(self.topics) + '\n') ++ f.write('# -*- coding: utf-8 -*-\n'.encode('utf-8')) ++ f.write(('# Autogenerated by Sphinx on %s\n' % asctime()).encode('utf-8')) ++ f.write(('topics = ' + pformat(self.topics) + '\n').encode('utf-8')) + finally: + f.close() + +diff -r 8711a0951384 Include/patchlevel.h +--- a/Include/patchlevel.h ++++ b/Include/patchlevel.h +@@ -23,7 +23,7 @@ + #define PY_RELEASE_SERIAL 1 + + /* Version as a string */ +-#define PY_VERSION "3.4.2rc1" ++#define PY_VERSION "3.4.2rc1+" + /*--end constants--*/ + + /* Version as a single 4-byte hex number, e.g. 0x010502B2 == 1.5.2b2. +diff -r 8711a0951384 Lib/asyncio/base_events.py +--- a/Lib/asyncio/base_events.py ++++ b/Lib/asyncio/base_events.py +@@ -40,6 +40,13 @@ + # Argument for default thread pool executor creation. + _MAX_WORKERS = 5 + ++# Minimum number of _scheduled timer handles before cleanup of ++# cancelled handles is performed. ++_MIN_SCHEDULED_TIMER_HANDLES = 100 ++ ++# Minimum fraction of _scheduled timer handles that are cancelled ++# before cleanup of cancelled handles is performed. ++_MIN_CANCELLED_TIMER_HANDLES_FRACTION = 0.5 + + def _format_handle(handle): + cb = handle._callback +@@ -145,6 +152,7 @@ + class BaseEventLoop(events.AbstractEventLoop): + + def __init__(self): ++ self._timer_cancelled_count = 0 + self._closed = False + self._ready = collections.deque() + self._scheduled = [] +@@ -349,6 +357,7 @@ + if timer._source_traceback: + del timer._source_traceback[-1] + heapq.heappush(self._scheduled, timer) ++ timer._scheduled = True + return timer + + def call_soon(self, callback, *args): +@@ -964,16 +973,19 @@ + assert isinstance(handle, events.Handle), 'A Handle is required here' + if handle._cancelled: + return +- if isinstance(handle, events.TimerHandle): +- heapq.heappush(self._scheduled, handle) +- else: +- self._ready.append(handle) ++ assert not isinstance(handle, events.TimerHandle) ++ self._ready.append(handle) + + def _add_callback_signalsafe(self, handle): + """Like _add_callback() but called from a signal handler.""" + self._add_callback(handle) + self._write_to_self() + ++ def _timer_handle_cancelled(self, handle): ++ """Notification that a TimerHandle has been cancelled.""" ++ if handle._scheduled: ++ self._timer_cancelled_count += 1 ++ + def _run_once(self): + """Run one full iteration of the event loop. + +@@ -981,9 +993,26 @@ + schedules the resulting callbacks, and finally schedules + 'call_later' callbacks. + """ +- # Remove delayed calls that were cancelled from head of queue. +- while self._scheduled and self._scheduled[0]._cancelled: +- heapq.heappop(self._scheduled) ++ ++ # Remove delayed calls that were cancelled if their number is too high ++ sched_count = len(self._scheduled) ++ if (sched_count > _MIN_SCHEDULED_TIMER_HANDLES and ++ self._timer_cancelled_count / sched_count > ++ _MIN_CANCELLED_TIMER_HANDLES_FRACTION): ++ for handle in self._scheduled: ++ if handle._cancelled: ++ handle._scheduled = False ++ ++ self._scheduled = [x for x in self._scheduled if not x._cancelled] ++ self._timer_cancelled_count = 0 ++ ++ heapq.heapify(self._scheduled) ++ else: ++ # Remove delayed calls that were cancelled from head of queue. ++ while self._scheduled and self._scheduled[0]._cancelled: ++ self._timer_cancelled_count -= 1 ++ handle = heapq.heappop(self._scheduled) ++ handle._scheduled = False + + timeout = None + if self._ready: +@@ -1024,6 +1053,7 @@ + if handle._when >= end_time: + break + handle = heapq.heappop(self._scheduled) ++ handle._scheduled = False + self._ready.append(handle) + + # This is the only place where callbacks are actually *called*. +diff -r 8711a0951384 Lib/asyncio/events.py +--- a/Lib/asyncio/events.py ++++ b/Lib/asyncio/events.py +@@ -105,14 +105,15 @@ + return '<%s>' % ' '.join(info) + + def cancel(self): +- self._cancelled = True +- if self._loop.get_debug(): +- # Keep a representation in debug mode to keep callback and +- # parameters. For example, to log the warning "Executing took 2.5 second" +- self._repr = repr(self) +- self._callback = None +- self._args = None ++ if not self._cancelled: ++ self._cancelled = True ++ if self._loop.get_debug(): ++ # Keep a representation in debug mode to keep callback and ++ # parameters. For example, to log the warning ++ # "Executing took 2.5 second" ++ self._repr = repr(self) ++ self._callback = None ++ self._args = None + + def _run(self): + try: +@@ -134,7 +135,7 @@ + class TimerHandle(Handle): + """Object returned by timed callback registration methods.""" + +- __slots__ = ['_when'] ++ __slots__ = ['_scheduled', '_when'] + + def __init__(self, when, callback, args, loop): + assert when is not None +@@ -142,6 +143,7 @@ + if self._source_traceback: + del self._source_traceback[-1] + self._when = when ++ self._scheduled = False + + def _repr_info(self): + info = super()._repr_info() +@@ -180,6 +182,11 @@ + equal = self.__eq__(other) + return NotImplemented if equal is NotImplemented else not equal + ++ def cancel(self): ++ if not self._cancelled: ++ self._loop._timer_handle_cancelled(self) ++ super().cancel() ++ + + class AbstractServer: + """Abstract server returned by create_server().""" +@@ -238,6 +245,10 @@ + + # Methods scheduling callbacks. All these return Handles. + ++ def _timer_handle_cancelled(self, handle): ++ """Notification that a TimerHandle has been cancelled.""" ++ raise NotImplementedError ++ + def call_soon(self, callback, *args): + return self.call_later(0, callback, *args) + +diff -r 8711a0951384 Lib/asyncio/tasks.py +--- a/Lib/asyncio/tasks.py ++++ b/Lib/asyncio/tasks.py +@@ -77,9 +77,9 @@ + # status is still pending + self._log_destroy_pending = True + +- # On Python 3.3 or older, objects with a destructor part of a reference +- # cycle are never destroyed. It's not more the case on Python 3.4 thanks to +- # the PEP 442. ++ # On Python 3.3 or older, objects with a destructor that are part of a ++ # reference cycle are never destroyed. That's not the case any more on ++ # Python 3.4 thanks to the PEP 442. + if _PY34: + def __del__(self): + if self._state == futures._PENDING and self._log_destroy_pending: +@@ -155,7 +155,8 @@ + This produces output similar to that of the traceback module, + for the frames retrieved by get_stack(). The limit argument + is passed to get_stack(). The file argument is an I/O stream +- to which the output goes; by default it goes to sys.stderr. ++ to which the output is written; by default output is written ++ to sys.stderr. + """ + extracted_list = [] + checked = set() +@@ -184,18 +185,18 @@ + print(line, file=file, end='') + + def cancel(self): +- """Request this task to cancel itself. ++ """Request that this task cancel itself. + + This arranges for a CancelledError to be thrown into the + wrapped coroutine on the next cycle through the event loop. + The coroutine then has a chance to clean up or even deny + the request using try/except/finally. + +- Contrary to Future.cancel(), this does not guarantee that the ++ Unlike Future.cancel, this does not guarantee that the + task will be cancelled: the exception might be caught and +- acted upon, delaying cancellation of the task or preventing it +- completely. The task may also return a value or raise a +- different exception. ++ acted upon, delaying cancellation of the task or preventing ++ cancellation completely. The task may also return a value or ++ raise a different exception. + + Immediately after this method is called, Task.cancelled() will + not return True (unless the task was already cancelled). A +diff -r 8711a0951384 Lib/asyncio/unix_events.py +--- a/Lib/asyncio/unix_events.py ++++ b/Lib/asyncio/unix_events.py +@@ -1,7 +1,6 @@ + """Selector event loop for Unix with signal handling.""" + + import errno +-import fcntl + import os + import signal + import socket +@@ -263,6 +262,8 @@ + def _set_nonblocking(fd): + os.set_blocking(fd, False) + else: ++ import fcntl ++ + def _set_nonblocking(fd): + flags = fcntl.fcntl(fd, fcntl.F_GETFL) + flags = flags | os.O_NONBLOCK +diff -r 8711a0951384 Lib/distutils/command/upload.py +--- a/Lib/distutils/command/upload.py ++++ b/Lib/distutils/command/upload.py +@@ -143,11 +143,11 @@ + + # Build up the MIME payload for the POST data + boundary = '--------------GHSKFJDLGDS7543FJKLFHRE75642756743254' +- sep_boundary = b'\n--' + boundary.encode('ascii') +- end_boundary = sep_boundary + b'--' ++ sep_boundary = b'\r\n--' + boundary.encode('ascii') ++ end_boundary = sep_boundary + b'--\r\n' + body = io.BytesIO() + for key, value in data.items(): +- title = '\nContent-Disposition: form-data; name="%s"' % key ++ title = '\r\nContent-Disposition: form-data; name="%s"' % key + # handle multiple entries for the same name + if type(value) != type([]): + value = [value] +@@ -159,12 +159,11 @@ + value = str(value).encode('utf-8') + body.write(sep_boundary) + body.write(title.encode('utf-8')) +- body.write(b"\n\n") ++ body.write(b"\r\n\r\n") + body.write(value) + if value and value[-1:] == b'\r': + body.write(b'\n') # write an extra newline (lurve Macs) + body.write(end_boundary) +- body.write(b"\n") + body = body.getvalue() + + self.announce("Submitting %s to %s" % (filename, self.repository), log.INFO) +diff -r 8711a0951384 Lib/distutils/tests/test_upload.py +--- a/Lib/distutils/tests/test_upload.py ++++ b/Lib/distutils/tests/test_upload.py +@@ -127,7 +127,7 @@ + + # what did we send ? + headers = dict(self.last_open.req.headers) +- self.assertEqual(headers['Content-length'], '2087') ++ self.assertEqual(headers['Content-length'], '2161') + content_type = headers['Content-type'] + self.assertTrue(content_type.startswith('multipart/form-data')) + self.assertEqual(self.last_open.req.get_method(), 'POST') +diff -r 8711a0951384 Lib/macpath.py +--- a/Lib/macpath.py ++++ b/Lib/macpath.py +@@ -53,7 +53,7 @@ + colon = _get_colon(s) + path = s + for t in p: +- if (not s) or isabs(t): ++ if (not path) or isabs(t): + path = t + continue + if t[:1] == colon: +diff -r 8711a0951384 Lib/pydoc_data/topics.py +--- a/Lib/pydoc_data/topics.py ++++ b/Lib/pydoc_data/topics.py +@@ -1,79 +1,12599 @@ + # -*- coding: utf-8 -*- +-# Autogenerated by Sphinx on Sun Sep 21 00:02:20 2014 +-topics = {'assert': b'\nThe "assert" statement\n**********************\n\nAssert statements are a convenient way to insert debugging assertions\ninto a program:\n\n assert_stmt ::= "assert" expression ["," expression]\n\nThe simple form, "assert expression", is equivalent to\n\n if __debug__:\n if not expression: raise AssertionError\n\nThe extended form, "assert expression1, expression2", is equivalent to\n\n if __debug__:\n if not expression1: raise AssertionError(expression2)\n\nThese equivalences assume that "__debug__" and "AssertionError" refer\nto the built-in variables with those names. In the current\nimplementation, the built-in variable "__debug__" is "True" under\nnormal circumstances, "False" when optimization is requested (command\nline option -O). The current code generator emits no code for an\nassert statement when optimization is requested at compile time. Note\nthat it is unnecessary to include the source code for the expression\nthat failed in the error message; it will be displayed as part of the\nstack trace.\n\nAssignments to "__debug__" are illegal. The value for the built-in\nvariable is determined when the interpreter starts.\n', +- 'assignment': b'\nAssignment statements\n*********************\n\nAssignment statements are used to (re)bind names to values and to\nmodify attributes or items of mutable objects:\n\n assignment_stmt ::= (target_list "=")+ (expression_list | yield_expression)\n target_list ::= target ("," target)* [","]\n target ::= identifier\n | "(" target_list ")"\n | "[" target_list "]"\n | attributeref\n | subscription\n | slicing\n | "*" target\n\n(See section *Primaries* for the syntax definitions for\n*attributeref*, *subscription*, and *slicing*.)\n\nAn assignment statement evaluates the expression list (remember that\nthis can be a single expression or a comma-separated list, the latter\nyielding a tuple) and assigns the single resulting object to each of\nthe target lists, from left to right.\n\nAssignment is defined recursively depending on the form of the target\n(list). When a target is part of a mutable object (an attribute\nreference, subscription or slicing), the mutable object must\nultimately perform the assignment and decide about its validity, and\nmay raise an exception if the assignment is unacceptable. The rules\nobserved by various types and the exceptions raised are given with the\ndefinition of the object types (see section *The standard type\nhierarchy*).\n\nAssignment of an object to a target list, optionally enclosed in\nparentheses or square brackets, is recursively defined as follows.\n\n* If the target list is a single target: The object is assigned to\n that target.\n\n* If the target list is a comma-separated list of targets: The\n object must be an iterable with the same number of items as there\n are targets in the target list, and the items are assigned, from\n left to right, to the corresponding targets.\n\n * If the target list contains one target prefixed with an\n asterisk, called a "starred" target: The object must be a sequence\n with at least as many items as there are targets in the target\n list, minus one. The first items of the sequence are assigned,\n from left to right, to the targets before the starred target. The\n final items of the sequence are assigned to the targets after the\n starred target. A list of the remaining items in the sequence is\n then assigned to the starred target (the list can be empty).\n\n * Else: The object must be a sequence with the same number of\n items as there are targets in the target list, and the items are\n assigned, from left to right, to the corresponding targets.\n\nAssignment of an object to a single target is recursively defined as\nfollows.\n\n* If the target is an identifier (name):\n\n * If the name does not occur in a "global" or "nonlocal" statement\n in the current code block: the name is bound to the object in the\n current local namespace.\n\n * Otherwise: the name is bound to the object in the global\n namespace or the outer namespace determined by "nonlocal",\n respectively.\n\n The name is rebound if it was already bound. This may cause the\n reference count for the object previously bound to the name to reach\n zero, causing the object to be deallocated and its destructor (if it\n has one) to be called.\n\n* If the target is a target list enclosed in parentheses or in\n square brackets: The object must be an iterable with the same number\n of items as there are targets in the target list, and its items are\n assigned, from left to right, to the corresponding targets.\n\n* If the target is an attribute reference: The primary expression in\n the reference is evaluated. It should yield an object with\n assignable attributes; if this is not the case, "TypeError" is\n raised. That object is then asked to assign the assigned object to\n the given attribute; if it cannot perform the assignment, it raises\n an exception (usually but not necessarily "AttributeError").\n\n Note: If the object is a class instance and the attribute reference\n occurs on both sides of the assignment operator, the RHS expression,\n "a.x" can access either an instance attribute or (if no instance\n attribute exists) a class attribute. The LHS target "a.x" is always\n set as an instance attribute, creating it if necessary. Thus, the\n two occurrences of "a.x" do not necessarily refer to the same\n attribute: if the RHS expression refers to a class attribute, the\n LHS creates a new instance attribute as the target of the\n assignment:\n\n class Cls:\n x = 3 # class variable\n inst = Cls()\n inst.x = inst.x + 1 # writes inst.x as 4 leaving Cls.x as 3\n\n This description does not necessarily apply to descriptor\n attributes, such as properties created with "property()".\n\n* If the target is a subscription: The primary expression in the\n reference is evaluated. It should yield either a mutable sequence\n object (such as a list) or a mapping object (such as a dictionary).\n Next, the subscript expression is evaluated.\n\n If the primary is a mutable sequence object (such as a list), the\n subscript must yield an integer. If it is negative, the sequence\'s\n length is added to it. The resulting value must be a nonnegative\n integer less than the sequence\'s length, and the sequence is asked\n to assign the assigned object to its item with that index. If the\n index is out of range, "IndexError" is raised (assignment to a\n subscripted sequence cannot add new items to a list).\n\n If the primary is a mapping object (such as a dictionary), the\n subscript must have a type compatible with the mapping\'s key type,\n and the mapping is then asked to create a key/datum pair which maps\n the subscript to the assigned object. This can either replace an\n existing key/value pair with the same key value, or insert a new\n key/value pair (if no key with the same value existed).\n\n For user-defined objects, the "__setitem__()" method is called with\n appropriate arguments.\n\n* If the target is a slicing: The primary expression in the\n reference is evaluated. It should yield a mutable sequence object\n (such as a list). The assigned object should be a sequence object\n of the same type. Next, the lower and upper bound expressions are\n evaluated, insofar they are present; defaults are zero and the\n sequence\'s length. The bounds should evaluate to integers. If\n either bound is negative, the sequence\'s length is added to it. The\n resulting bounds are clipped to lie between zero and the sequence\'s\n length, inclusive. Finally, the sequence object is asked to replace\n the slice with the items of the assigned sequence. The length of\n the slice may be different from the length of the assigned sequence,\n thus changing the length of the target sequence, if the target\n sequence allows it.\n\n**CPython implementation detail:** In the current implementation, the\nsyntax for targets is taken to be the same as for expressions, and\ninvalid syntax is rejected during the code generation phase, causing\nless detailed error messages.\n\nAlthough the definition of assignment implies that overlaps between\nthe left-hand side and the right-hand side are \'simultanenous\' (for\nexample "a, b = b, a" swaps two variables), overlaps *within* the\ncollection of assigned-to variables occur left-to-right, sometimes\nresulting in confusion. For instance, the following program prints\n"[0, 2]":\n\n x = [0, 1]\n i = 0\n i, x[i] = 1, 2 # i is updated, then x[i] is updated\n print(x)\n\nSee also: **PEP 3132** - Extended Iterable Unpacking\n\n The specification for the "*target" feature.\n\n\nAugmented assignment statements\n===============================\n\nAugmented assignment is the combination, in a single statement, of a\nbinary operation and an assignment statement:\n\n augmented_assignment_stmt ::= augtarget augop (expression_list | yield_expression)\n augtarget ::= identifier | attributeref | subscription | slicing\n augop ::= "+=" | "-=" | "*=" | "/=" | "//=" | "%=" | "**="\n | ">>=" | "<<=" | "&=" | "^=" | "|="\n\n(See section *Primaries* for the syntax definitions of the last three\nsymbols.)\n\nAn augmented assignment evaluates the target (which, unlike normal\nassignment statements, cannot be an unpacking) and the expression\nlist, performs the binary operation specific to the type of assignment\non the two operands, and assigns the result to the original target.\nThe target is only evaluated once.\n\nAn augmented assignment expression like "x += 1" can be rewritten as\n"x = x + 1" to achieve a similar, but not exactly equal effect. In the\naugmented version, "x" is only evaluated once. Also, when possible,\nthe actual operation is performed *in-place*, meaning that rather than\ncreating a new object and assigning that to the target, the old object\nis modified instead.\n\nUnlike normal assignments, augmented assignments evaluate the left-\nhand side *before* evaluating the right-hand side. For example, "a[i]\n+= f(x)" first looks-up "a[i]", then it evaluates "f(x)" and performs\nthe addition, and lastly, it writes the result back to "a[i]".\n\nWith the exception of assigning to tuples and multiple targets in a\nsingle statement, the assignment done by augmented assignment\nstatements is handled the same way as normal assignments. Similarly,\nwith the exception of the possible *in-place* behavior, the binary\noperation performed by augmented assignment is the same as the normal\nbinary operations.\n\nFor targets which are attribute references, the same *caveat about\nclass and instance attributes* applies as for regular assignments.\n', +- 'atom-identifiers': b'\nIdentifiers (Names)\n*******************\n\nAn identifier occurring as an atom is a name. See section\n*Identifiers and keywords* for lexical definition and section *Naming\nand binding* for documentation of naming and binding.\n\nWhen the name is bound to an object, evaluation of the atom yields\nthat object. When a name is not bound, an attempt to evaluate it\nraises a "NameError" exception.\n\n**Private name mangling:** When an identifier that textually occurs in\na class definition begins with two or more underscore characters and\ndoes not end in two or more underscores, it is considered a *private\nname* of that class. Private names are transformed to a longer form\nbefore code is generated for them. The transformation inserts the\nclass name, with leading underscores removed and a single underscore\ninserted, in front of the name. For example, the identifier "__spam"\noccurring in a class named "Ham" will be transformed to "_Ham__spam".\nThis transformation is independent of the syntactical context in which\nthe identifier is used. If the transformed name is extremely long\n(longer than 255 characters), implementation defined truncation may\nhappen. If the class name consists only of underscores, no\ntransformation is done.\n', +- 'atom-literals': b"\nLiterals\n********\n\nPython supports string and bytes literals and various numeric\nliterals:\n\n literal ::= stringliteral | bytesliteral\n | integer | floatnumber | imagnumber\n\nEvaluation of a literal yields an object of the given type (string,\nbytes, integer, floating point number, complex number) with the given\nvalue. The value may be approximated in the case of floating point\nand imaginary (complex) literals. See section *Literals* for details.\n\nAll literals correspond to immutable data types, and hence the\nobject's identity is less important than its value. Multiple\nevaluations of literals with the same value (either the same\noccurrence in the program text or a different occurrence) may obtain\nthe same object or a different object with the same value.\n", +- 'attribute-access': b'\nCustomizing attribute access\n****************************\n\nThe following methods can be defined to customize the meaning of\nattribute access (use of, assignment to, or deletion of "x.name") for\nclass instances.\n\nobject.__getattr__(self, name)\n\n Called when an attribute lookup has not found the attribute in the\n usual places (i.e. it is not an instance attribute nor is it found\n in the class tree for "self"). "name" is the attribute name. This\n method should return the (computed) attribute value or raise an\n "AttributeError" exception.\n\n Note that if the attribute is found through the normal mechanism,\n "__getattr__()" is not called. (This is an intentional asymmetry\n between "__getattr__()" and "__setattr__()".) This is done both for\n efficiency reasons and because otherwise "__getattr__()" would have\n no way to access other attributes of the instance. Note that at\n least for instance variables, you can fake total control by not\n inserting any values in the instance attribute dictionary (but\n instead inserting them in another object). See the\n "__getattribute__()" method below for a way to actually get total\n control over attribute access.\n\nobject.__getattribute__(self, name)\n\n Called unconditionally to implement attribute accesses for\n instances of the class. If the class also defines "__getattr__()",\n the latter will not be called unless "__getattribute__()" either\n calls it explicitly or raises an "AttributeError". This method\n should return the (computed) attribute value or raise an\n "AttributeError" exception. In order to avoid infinite recursion in\n this method, its implementation should always call the base class\n method with the same name to access any attributes it needs, for\n example, "object.__getattribute__(self, name)".\n\n Note: This method may still be bypassed when looking up special\n methods as the result of implicit invocation via language syntax\n or built-in functions. See *Special method lookup*.\n\nobject.__setattr__(self, name, value)\n\n Called when an attribute assignment is attempted. This is called\n instead of the normal mechanism (i.e. store the value in the\n instance dictionary). *name* is the attribute name, *value* is the\n value to be assigned to it.\n\n If "__setattr__()" wants to assign to an instance attribute, it\n should call the base class method with the same name, for example,\n "object.__setattr__(self, name, value)".\n\nobject.__delattr__(self, name)\n\n Like "__setattr__()" but for attribute deletion instead of\n assignment. This should only be implemented if "del obj.name" is\n meaningful for the object.\n\nobject.__dir__(self)\n\n Called when "dir()" is called on the object. A sequence must be\n returned. "dir()" converts the returned sequence to a list and\n sorts it.\n\n\nImplementing Descriptors\n========================\n\nThe following methods only apply when an instance of the class\ncontaining the method (a so-called *descriptor* class) appears in an\n*owner* class (the descriptor must be in either the owner\'s class\ndictionary or in the class dictionary for one of its parents). In the\nexamples below, "the attribute" refers to the attribute whose name is\nthe key of the property in the owner class\' "__dict__".\n\nobject.__get__(self, instance, owner)\n\n Called to get the attribute of the owner class (class attribute\n access) or of an instance of that class (instance attribute\n access). *owner* is always the owner class, while *instance* is the\n instance that the attribute was accessed through, or "None" when\n the attribute is accessed through the *owner*. This method should\n return the (computed) attribute value or raise an "AttributeError"\n exception.\n\nobject.__set__(self, instance, value)\n\n Called to set the attribute on an instance *instance* of the owner\n class to a new value, *value*.\n\nobject.__delete__(self, instance)\n\n Called to delete the attribute on an instance *instance* of the\n owner class.\n\nThe attribute "__objclass__" is interpreted by the "inspect" module as\nspecifying the class where this object was defined (setting this\nappropriately can assist in runtime introspection of dynamic class\nattributes). For callables, it may indicate that an instance of the\ngiven type (or a subclass) is expected or required as the first\npositional argument (for example, CPython sets this attribute for\nunbound methods that are implemented in C).\n\n\nInvoking Descriptors\n====================\n\nIn general, a descriptor is an object attribute with "binding\nbehavior", one whose attribute access has been overridden by methods\nin the descriptor protocol: "__get__()", "__set__()", and\n"__delete__()". If any of those methods are defined for an object, it\nis said to be a descriptor.\n\nThe default behavior for attribute access is to get, set, or delete\nthe attribute from an object\'s dictionary. For instance, "a.x" has a\nlookup chain starting with "a.__dict__[\'x\']", then\n"type(a).__dict__[\'x\']", and continuing through the base classes of\n"type(a)" excluding metaclasses.\n\nHowever, if the looked-up value is an object defining one of the\ndescriptor methods, then Python may override the default behavior and\ninvoke the descriptor method instead. Where this occurs in the\nprecedence chain depends on which descriptor methods were defined and\nhow they were called.\n\nThe starting point for descriptor invocation is a binding, "a.x". How\nthe arguments are assembled depends on "a":\n\nDirect Call\n The simplest and least common call is when user code directly\n invokes a descriptor method: "x.__get__(a)".\n\nInstance Binding\n If binding to an object instance, "a.x" is transformed into the\n call: "type(a).__dict__[\'x\'].__get__(a, type(a))".\n\nClass Binding\n If binding to a class, "A.x" is transformed into the call:\n "A.__dict__[\'x\'].__get__(None, A)".\n\nSuper Binding\n If "a" is an instance of "super", then the binding "super(B,\n obj).m()" searches "obj.__class__.__mro__" for the base class "A"\n immediately preceding "B" and then invokes the descriptor with the\n call: "A.__dict__[\'m\'].__get__(obj, obj.__class__)".\n\nFor instance bindings, the precedence of descriptor invocation depends\non the which descriptor methods are defined. A descriptor can define\nany combination of "__get__()", "__set__()" and "__delete__()". If it\ndoes not define "__get__()", then accessing the attribute will return\nthe descriptor object itself unless there is a value in the object\'s\ninstance dictionary. If the descriptor defines "__set__()" and/or\n"__delete__()", it is a data descriptor; if it defines neither, it is\na non-data descriptor. Normally, data descriptors define both\n"__get__()" and "__set__()", while non-data descriptors have just the\n"__get__()" method. Data descriptors with "__set__()" and "__get__()"\ndefined always override a redefinition in an instance dictionary. In\ncontrast, non-data descriptors can be overridden by instances.\n\nPython methods (including "staticmethod()" and "classmethod()") are\nimplemented as non-data descriptors. Accordingly, instances can\nredefine and override methods. This allows individual instances to\nacquire behaviors that differ from other instances of the same class.\n\nThe "property()" function is implemented as a data descriptor.\nAccordingly, instances cannot override the behavior of a property.\n\n\n__slots__\n=========\n\nBy default, instances of classes have a dictionary for attribute\nstorage. This wastes space for objects having very few instance\nvariables. The space consumption can become acute when creating large\nnumbers of instances.\n\nThe default can be overridden by defining *__slots__* in a class\ndefinition. The *__slots__* declaration takes a sequence of instance\nvariables and reserves just enough space in each instance to hold a\nvalue for each variable. Space is saved because *__dict__* is not\ncreated for each instance.\n\nobject.__slots__\n\n This class variable can be assigned a string, iterable, or sequence\n of strings with variable names used by instances. If defined in a\n class, *__slots__* reserves space for the declared variables and\n prevents the automatic creation of *__dict__* and *__weakref__* for\n each instance.\n\n\nNotes on using *__slots__*\n--------------------------\n\n* When inheriting from a class without *__slots__*, the *__dict__*\n attribute of that class will always be accessible, so a *__slots__*\n definition in the subclass is meaningless.\n\n* Without a *__dict__* variable, instances cannot be assigned new\n variables not listed in the *__slots__* definition. Attempts to\n assign to an unlisted variable name raises "AttributeError". If\n dynamic assignment of new variables is desired, then add\n "\'__dict__\'" to the sequence of strings in the *__slots__*\n declaration.\n\n* Without a *__weakref__* variable for each instance, classes\n defining *__slots__* do not support weak references to its\n instances. If weak reference support is needed, then add\n "\'__weakref__\'" to the sequence of strings in the *__slots__*\n declaration.\n\n* *__slots__* are implemented at the class level by creating\n descriptors (*Implementing Descriptors*) for each variable name. As\n a result, class attributes cannot be used to set default values for\n instance variables defined by *__slots__*; otherwise, the class\n attribute would overwrite the descriptor assignment.\n\n* The action of a *__slots__* declaration is limited to the class\n where it is defined. As a result, subclasses will have a *__dict__*\n unless they also define *__slots__* (which must only contain names\n of any *additional* slots).\n\n* If a class defines a slot also defined in a base class, the\n instance variable defined by the base class slot is inaccessible\n (except by retrieving its descriptor directly from the base class).\n This renders the meaning of the program undefined. In the future, a\n check may be added to prevent this.\n\n* Nonempty *__slots__* does not work for classes derived from\n "variable-length" built-in types such as "int", "bytes" and "tuple".\n\n* Any non-string iterable may be assigned to *__slots__*. Mappings\n may also be used; however, in the future, special meaning may be\n assigned to the values corresponding to each key.\n\n* *__class__* assignment works only if both classes have the same\n *__slots__*.\n', +- 'attribute-references': b'\nAttribute references\n********************\n\nAn attribute reference is a primary followed by a period and a name:\n\n attributeref ::= primary "." identifier\n\nThe primary must evaluate to an object of a type that supports\nattribute references, which most objects do. This object is then\nasked to produce the attribute whose name is the identifier. This\nproduction can be customized by overriding the "__getattr__()" method.\nIf this attribute is not available, the exception "AttributeError" is\nraised. Otherwise, the type and value of the object produced is\ndetermined by the object. Multiple evaluations of the same attribute\nreference may yield different objects.\n', +- 'augassign': b'\nAugmented assignment statements\n*******************************\n\nAugmented assignment is the combination, in a single statement, of a\nbinary operation and an assignment statement:\n\n augmented_assignment_stmt ::= augtarget augop (expression_list | yield_expression)\n augtarget ::= identifier | attributeref | subscription | slicing\n augop ::= "+=" | "-=" | "*=" | "/=" | "//=" | "%=" | "**="\n | ">>=" | "<<=" | "&=" | "^=" | "|="\n\n(See section *Primaries* for the syntax definitions of the last three\nsymbols.)\n\nAn augmented assignment evaluates the target (which, unlike normal\nassignment statements, cannot be an unpacking) and the expression\nlist, performs the binary operation specific to the type of assignment\non the two operands, and assigns the result to the original target.\nThe target is only evaluated once.\n\nAn augmented assignment expression like "x += 1" can be rewritten as\n"x = x + 1" to achieve a similar, but not exactly equal effect. In the\naugmented version, "x" is only evaluated once. Also, when possible,\nthe actual operation is performed *in-place*, meaning that rather than\ncreating a new object and assigning that to the target, the old object\nis modified instead.\n\nUnlike normal assignments, augmented assignments evaluate the left-\nhand side *before* evaluating the right-hand side. For example, "a[i]\n+= f(x)" first looks-up "a[i]", then it evaluates "f(x)" and performs\nthe addition, and lastly, it writes the result back to "a[i]".\n\nWith the exception of assigning to tuples and multiple targets in a\nsingle statement, the assignment done by augmented assignment\nstatements is handled the same way as normal assignments. Similarly,\nwith the exception of the possible *in-place* behavior, the binary\noperation performed by augmented assignment is the same as the normal\nbinary operations.\n\nFor targets which are attribute references, the same *caveat about\nclass and instance attributes* applies as for regular assignments.\n', +- 'binary': b'\nBinary arithmetic operations\n****************************\n\nThe binary arithmetic operations have the conventional priority\nlevels. Note that some of these operations also apply to certain non-\nnumeric types. Apart from the power operator, there are only two\nlevels, one for multiplicative operators and one for additive\noperators:\n\n m_expr ::= u_expr | m_expr "*" u_expr | m_expr "//" u_expr | m_expr "/" u_expr\n | m_expr "%" u_expr\n a_expr ::= m_expr | a_expr "+" m_expr | a_expr "-" m_expr\n\nThe "*" (multiplication) operator yields the product of its arguments.\nThe arguments must either both be numbers, or one argument must be an\ninteger and the other must be a sequence. In the former case, the\nnumbers are converted to a common type and then multiplied together.\nIn the latter case, sequence repetition is performed; a negative\nrepetition factor yields an empty sequence.\n\nThe "/" (division) and "//" (floor division) operators yield the\nquotient of their arguments. The numeric arguments are first\nconverted to a common type. Division of integers yields a float, while\nfloor division of integers results in an integer; the result is that\nof mathematical division with the \'floor\' function applied to the\nresult. Division by zero raises the "ZeroDivisionError" exception.\n\nThe "%" (modulo) operator yields the remainder from the division of\nthe first argument by the second. The numeric arguments are first\nconverted to a common type. A zero right argument raises the\n"ZeroDivisionError" exception. The arguments may be floating point\nnumbers, e.g., "3.14%0.7" equals "0.34" (since "3.14" equals "4*0.7 +\n0.34".) The modulo operator always yields a result with the same sign\nas its second operand (or zero); the absolute value of the result is\nstrictly smaller than the absolute value of the second operand [1].\n\nThe floor division and modulo operators are connected by the following\nidentity: "x == (x//y)*y + (x%y)". Floor division and modulo are also\nconnected with the built-in function "divmod()": "divmod(x, y) ==\n(x//y, x%y)". [2].\n\nIn addition to performing the modulo operation on numbers, the "%"\noperator is also overloaded by string objects to perform old-style\nstring formatting (also known as interpolation). The syntax for\nstring formatting is described in the Python Library Reference,\nsection *printf-style String Formatting*.\n\nThe floor division operator, the modulo operator, and the "divmod()"\nfunction are not defined for complex numbers. Instead, convert to a\nfloating point number using the "abs()" function if appropriate.\n\nThe "+" (addition) operator yields the sum of its arguments. The\narguments must either both be numbers or both be sequences of the same\ntype. In the former case, the numbers are converted to a common type\nand then added together. In the latter case, the sequences are\nconcatenated.\n\nThe "-" (subtraction) operator yields the difference of its arguments.\nThe numeric arguments are first converted to a common type.\n', +- 'bitwise': b'\nBinary bitwise operations\n*************************\n\nEach of the three bitwise operations has a different priority level:\n\n and_expr ::= shift_expr | and_expr "&" shift_expr\n xor_expr ::= and_expr | xor_expr "^" and_expr\n or_expr ::= xor_expr | or_expr "|" xor_expr\n\nThe "&" operator yields the bitwise AND of its arguments, which must\nbe integers.\n\nThe "^" operator yields the bitwise XOR (exclusive OR) of its\narguments, which must be integers.\n\nThe "|" operator yields the bitwise (inclusive) OR of its arguments,\nwhich must be integers.\n', +- 'bltin-code-objects': b'\nCode Objects\n************\n\nCode objects are used by the implementation to represent "pseudo-\ncompiled" executable Python code such as a function body. They differ\nfrom function objects because they don\'t contain a reference to their\nglobal execution environment. Code objects are returned by the built-\nin "compile()" function and can be extracted from function objects\nthrough their "__code__" attribute. See also the "code" module.\n\nA code object can be executed or evaluated by passing it (instead of a\nsource string) to the "exec()" or "eval()" built-in functions.\n\nSee *The standard type hierarchy* for more information.\n', +- 'bltin-ellipsis-object': b'\nThe Ellipsis Object\n*******************\n\nThis object is commonly used by slicing (see *Slicings*). It supports\nno special operations. There is exactly one ellipsis object, named\n"Ellipsis" (a built-in name). "type(Ellipsis)()" produces the\n"Ellipsis" singleton.\n\nIt is written as "Ellipsis" or "...".\n', +- 'bltin-null-object': b'\nThe Null Object\n***************\n\nThis object is returned by functions that don\'t explicitly return a\nvalue. It supports no special operations. There is exactly one null\nobject, named "None" (a built-in name). "type(None)()" produces the\nsame singleton.\n\nIt is written as "None".\n', +- 'bltin-type-objects': b'\nType Objects\n************\n\nType objects represent the various object types. An object\'s type is\naccessed by the built-in function "type()". There are no special\noperations on types. The standard module "types" defines names for\nall standard built-in types.\n\nTypes are written like this: "".\n', +- 'booleans': b'\nBoolean operations\n******************\n\n or_test ::= and_test | or_test "or" and_test\n and_test ::= not_test | and_test "and" not_test\n not_test ::= comparison | "not" not_test\n\nIn the context of Boolean operations, and also when expressions are\nused by control flow statements, the following values are interpreted\nas false: "False", "None", numeric zero of all types, and empty\nstrings and containers (including strings, tuples, lists,\ndictionaries, sets and frozensets). All other values are interpreted\nas true. User-defined objects can customize their truth value by\nproviding a "__bool__()" method.\n\nThe operator "not" yields "True" if its argument is false, "False"\notherwise.\n\nThe expression "x and y" first evaluates *x*; if *x* is false, its\nvalue is returned; otherwise, *y* is evaluated and the resulting value\nis returned.\n\nThe expression "x or y" first evaluates *x*; if *x* is true, its value\nis returned; otherwise, *y* is evaluated and the resulting value is\nreturned.\n\n(Note that neither "and" nor "or" restrict the value and type they\nreturn to "False" and "True", but rather return the last evaluated\nargument. This is sometimes useful, e.g., if "s" is a string that\nshould be replaced by a default value if it is empty, the expression\n"s or \'foo\'" yields the desired value. Because "not" has to create a\nnew value, it returns a boolean value regardless of the type of its\nargument (for example, "not \'foo\'" produces "False" rather than "\'\'".)\n', +- 'break': b'\nThe "break" statement\n*********************\n\n break_stmt ::= "break"\n\n"break" may only occur syntactically nested in a "for" or "while"\nloop, but not nested in a function or class definition within that\nloop.\n\nIt terminates the nearest enclosing loop, skipping the optional "else"\nclause if the loop has one.\n\nIf a "for" loop is terminated by "break", the loop control target\nkeeps its current value.\n\nWhen "break" passes control out of a "try" statement with a "finally"\nclause, that "finally" clause is executed before really leaving the\nloop.\n', +- 'callable-types': b'\nEmulating callable objects\n**************************\n\nobject.__call__(self[, args...])\n\n Called when the instance is "called" as a function; if this method\n is defined, "x(arg1, arg2, ...)" is a shorthand for\n "x.__call__(arg1, arg2, ...)".\n', +- 'calls': b'\nCalls\n*****\n\nA call calls a callable object (e.g., a *function*) with a possibly\nempty series of *arguments*:\n\n call ::= primary "(" [argument_list [","] | comprehension] ")"\n argument_list ::= positional_arguments ["," keyword_arguments]\n ["," "*" expression] ["," keyword_arguments]\n ["," "**" expression]\n | keyword_arguments ["," "*" expression]\n ["," keyword_arguments] ["," "**" expression]\n | "*" expression ["," keyword_arguments] ["," "**" expression]\n | "**" expression\n positional_arguments ::= expression ("," expression)*\n keyword_arguments ::= keyword_item ("," keyword_item)*\n keyword_item ::= identifier "=" expression\n\nAn optional trailing comma may be present after the positional and\nkeyword arguments but does not affect the semantics.\n\nThe primary must evaluate to a callable object (user-defined\nfunctions, built-in functions, methods of built-in objects, class\nobjects, methods of class instances, and all objects having a\n"__call__()" method are callable). All argument expressions are\nevaluated before the call is attempted. Please refer to section\n*Function definitions* for the syntax of formal *parameter* lists.\n\nIf keyword arguments are present, they are first converted to\npositional arguments, as follows. First, a list of unfilled slots is\ncreated for the formal parameters. If there are N positional\narguments, they are placed in the first N slots. Next, for each\nkeyword argument, the identifier is used to determine the\ncorresponding slot (if the identifier is the same as the first formal\nparameter name, the first slot is used, and so on). If the slot is\nalready filled, a "TypeError" exception is raised. Otherwise, the\nvalue of the argument is placed in the slot, filling it (even if the\nexpression is "None", it fills the slot). When all arguments have\nbeen processed, the slots that are still unfilled are filled with the\ncorresponding default value from the function definition. (Default\nvalues are calculated, once, when the function is defined; thus, a\nmutable object such as a list or dictionary used as default value will\nbe shared by all calls that don\'t specify an argument value for the\ncorresponding slot; this should usually be avoided.) If there are any\nunfilled slots for which no default value is specified, a "TypeError"\nexception is raised. Otherwise, the list of filled slots is used as\nthe argument list for the call.\n\n**CPython implementation detail:** An implementation may provide\nbuilt-in functions whose positional parameters do not have names, even\nif they are \'named\' for the purpose of documentation, and which\ntherefore cannot be supplied by keyword. In CPython, this is the case\nfor functions implemented in C that use "PyArg_ParseTuple()" to parse\ntheir arguments.\n\nIf there are more positional arguments than there are formal parameter\nslots, a "TypeError" exception is raised, unless a formal parameter\nusing the syntax "*identifier" is present; in this case, that formal\nparameter receives a tuple containing the excess positional arguments\n(or an empty tuple if there were no excess positional arguments).\n\nIf any keyword argument does not correspond to a formal parameter\nname, a "TypeError" exception is raised, unless a formal parameter\nusing the syntax "**identifier" is present; in this case, that formal\nparameter receives a dictionary containing the excess keyword\narguments (using the keywords as keys and the argument values as\ncorresponding values), or a (new) empty dictionary if there were no\nexcess keyword arguments.\n\nIf the syntax "*expression" appears in the function call, "expression"\nmust evaluate to an iterable. Elements from this iterable are treated\nas if they were additional positional arguments; if there are\npositional arguments *x1*, ..., *xN*, and "expression" evaluates to a\nsequence *y1*, ..., *yM*, this is equivalent to a call with M+N\npositional arguments *x1*, ..., *xN*, *y1*, ..., *yM*.\n\nA consequence of this is that although the "*expression" syntax may\nappear *after* some keyword arguments, it is processed *before* the\nkeyword arguments (and the "**expression" argument, if any -- see\nbelow). So:\n\n >>> def f(a, b):\n ... print(a, b)\n ...\n >>> f(b=1, *(2,))\n 2 1\n >>> f(a=1, *(2,))\n Traceback (most recent call last):\n File "", line 1, in ?\n TypeError: f() got multiple values for keyword argument \'a\'\n >>> f(1, *(2,))\n 1 2\n\nIt is unusual for both keyword arguments and the "*expression" syntax\nto be used in the same call, so in practice this confusion does not\narise.\n\nIf the syntax "**expression" appears in the function call,\n"expression" must evaluate to a mapping, the contents of which are\ntreated as additional keyword arguments. In the case of a keyword\nappearing in both "expression" and as an explicit keyword argument, a\n"TypeError" exception is raised.\n\nFormal parameters using the syntax "*identifier" or "**identifier"\ncannot be used as positional argument slots or as keyword argument\nnames.\n\nA call always returns some value, possibly "None", unless it raises an\nexception. How this value is computed depends on the type of the\ncallable object.\n\nIf it is---\n\na user-defined function:\n The code block for the function is executed, passing it the\n argument list. The first thing the code block will do is bind the\n formal parameters to the arguments; this is described in section\n *Function definitions*. When the code block executes a "return"\n statement, this specifies the return value of the function call.\n\na built-in function or method:\n The result is up to the interpreter; see *Built-in Functions* for\n the descriptions of built-in functions and methods.\n\na class object:\n A new instance of that class is returned.\n\na class instance method:\n The corresponding user-defined function is called, with an argument\n list that is one longer than the argument list of the call: the\n instance becomes the first argument.\n\na class instance:\n The class must define a "__call__()" method; the effect is then the\n same as if that method was called.\n', +- 'class': b'\nClass definitions\n*****************\n\nA class definition defines a class object (see section *The standard\ntype hierarchy*):\n\n classdef ::= [decorators] "class" classname [inheritance] ":" suite\n inheritance ::= "(" [parameter_list] ")"\n classname ::= identifier\n\nA class definition is an executable statement. The inheritance list\nusually gives a list of base classes (see *Customizing class creation*\nfor more advanced uses), so each item in the list should evaluate to a\nclass object which allows subclassing. Classes without an inheritance\nlist inherit, by default, from the base class "object"; hence,\n\n class Foo:\n pass\n\nis equivalent to\n\n class Foo(object):\n pass\n\nThe class\'s suite is then executed in a new execution frame (see\n*Naming and binding*), using a newly created local namespace and the\noriginal global namespace. (Usually, the suite contains mostly\nfunction definitions.) When the class\'s suite finishes execution, its\nexecution frame is discarded but its local namespace is saved. [4] A\nclass object is then created using the inheritance list for the base\nclasses and the saved local namespace for the attribute dictionary.\nThe class name is bound to this class object in the original local\nnamespace.\n\nClass creation can be customized heavily using *metaclasses*.\n\nClasses can also be decorated: just like when decorating functions,\n\n @f1(arg)\n @f2\n class Foo: pass\n\nis equivalent to\n\n class Foo: pass\n Foo = f1(arg)(f2(Foo))\n\nThe evaluation rules for the decorator expressions are the same as for\nfunction decorators. The result must be a class object, which is then\nbound to the class name.\n\n**Programmer\'s note:** Variables defined in the class definition are\nclass attributes; they are shared by instances. Instance attributes\ncan be set in a method with "self.name = value". Both class and\ninstance attributes are accessible through the notation ""self.name"",\nand an instance attribute hides a class attribute with the same name\nwhen accessed in this way. Class attributes can be used as defaults\nfor instance attributes, but using mutable values there can lead to\nunexpected results. *Descriptors* can be used to create instance\nvariables with different implementation details.\n\nSee also: **PEP 3115** - Metaclasses in Python 3 **PEP 3129** -\n Class Decorators\n\n-[ Footnotes ]-\n\n[1] The exception is propagated to the invocation stack unless\n there is a "finally" clause which happens to raise another\n exception. That new exception causes the old one to be lost.\n\n[2] Currently, control "flows off the end" except in the case of\n an exception or the execution of a "return", "continue", or\n "break" statement.\n\n[3] A string literal appearing as the first statement in the\n function body is transformed into the function\'s "__doc__"\n attribute and therefore the function\'s *docstring*.\n\n[4] A string literal appearing as the first statement in the class\n body is transformed into the namespace\'s "__doc__" item and\n therefore the class\'s *docstring*.\n', +- 'comparisons': b'\nComparisons\n***********\n\nUnlike C, all comparison operations in Python have the same priority,\nwhich is lower than that of any arithmetic, shifting or bitwise\noperation. Also unlike C, expressions like "a < b < c" have the\ninterpretation that is conventional in mathematics:\n\n comparison ::= or_expr ( comp_operator or_expr )*\n comp_operator ::= "<" | ">" | "==" | ">=" | "<=" | "!="\n | "is" ["not"] | ["not"] "in"\n\nComparisons yield boolean values: "True" or "False".\n\nComparisons can be chained arbitrarily, e.g., "x < y <= z" is\nequivalent to "x < y and y <= z", except that "y" is evaluated only\nonce (but in both cases "z" is not evaluated at all when "x < y" is\nfound to be false).\n\nFormally, if *a*, *b*, *c*, ..., *y*, *z* are expressions and *op1*,\n*op2*, ..., *opN* are comparison operators, then "a op1 b op2 c ... y\nopN z" is equivalent to "a op1 b and b op2 c and ... y opN z", except\nthat each expression is evaluated at most once.\n\nNote that "a op1 b op2 c" doesn\'t imply any kind of comparison between\n*a* and *c*, so that, e.g., "x < y > z" is perfectly legal (though\nperhaps not pretty).\n\nThe operators "<", ">", "==", ">=", "<=", and "!=" compare the values\nof two objects. The objects need not have the same type. If both are\nnumbers, they are converted to a common type. Otherwise, the "==" and\n"!=" operators *always* consider objects of different types to be\nunequal, while the "<", ">", ">=" and "<=" operators raise a\n"TypeError" when comparing objects of different types that do not\nimplement these operators for the given pair of types. You can\ncontrol comparison behavior of objects of non-built-in types by\ndefining rich comparison methods like "__gt__()", described in section\n*Basic customization*.\n\nComparison of objects of the same type depends on the type:\n\n* Numbers are compared arithmetically.\n\n* The values "float(\'NaN\')" and "Decimal(\'NaN\')" are special. The\n are identical to themselves, "x is x" but are not equal to\n themselves, "x != x". Additionally, comparing any value to a\n not-a-number value will return "False". For example, both "3 <\n float(\'NaN\')" and "float(\'NaN\') < 3" will return "False".\n\n* Bytes objects are compared lexicographically using the numeric\n values of their elements.\n\n* Strings are compared lexicographically using the numeric\n equivalents (the result of the built-in function "ord()") of their\n characters. [3] String and bytes object can\'t be compared!\n\n* Tuples and lists are compared lexicographically using comparison\n of corresponding elements. This means that to compare equal, each\n element must compare equal and the two sequences must be of the same\n type and have the same length.\n\n If not equal, the sequences are ordered the same as their first\n differing elements. For example, "[1,2,x] <= [1,2,y]" has the same\n value as "x <= y". If the corresponding element does not exist, the\n shorter sequence is ordered first (for example, "[1,2] < [1,2,3]").\n\n* Mappings (dictionaries) compare equal if and only if they have the\n same "(key, value)" pairs. Order comparisons "(\'<\', \'<=\', \'>=\',\n \'>\')" raise "TypeError".\n\n* Sets and frozensets define comparison operators to mean subset and\n superset tests. Those relations do not define total orderings (the\n two sets "{1,2}" and {2,3} are not equal, nor subsets of one\n another, nor supersets of one another). Accordingly, sets are not\n appropriate arguments for functions which depend on total ordering.\n For example, "min()", "max()", and "sorted()" produce undefined\n results given a list of sets as inputs.\n\n* Most other objects of built-in types compare unequal unless they\n are the same object; the choice whether one object is considered\n smaller or larger than another one is made arbitrarily but\n consistently within one execution of a program.\n\nComparison of objects of differing types depends on whether either of\nthe types provide explicit support for the comparison. Most numeric\ntypes can be compared with one another. When cross-type comparison is\nnot supported, the comparison method returns "NotImplemented".\n\nThe operators "in" and "not in" test for membership. "x in s"\nevaluates to true if *x* is a member of *s*, and false otherwise. "x\nnot in s" returns the negation of "x in s". All built-in sequences\nand set types support this as well as dictionary, for which "in" tests\nwhether the dictionary has a given key. For container types such as\nlist, tuple, set, frozenset, dict, or collections.deque, the\nexpression "x in y" is equivalent to "any(x is e or x == e for e in\ny)".\n\nFor the string and bytes types, "x in y" is true if and only if *x* is\na substring of *y*. An equivalent test is "y.find(x) != -1". Empty\nstrings are always considered to be a substring of any other string,\nso """ in "abc"" will return "True".\n\nFor user-defined classes which define the "__contains__()" method, "x\nin y" is true if and only if "y.__contains__(x)" is true.\n\nFor user-defined classes which do not define "__contains__()" but do\ndefine "__iter__()", "x in y" is true if some value "z" with "x == z"\nis produced while iterating over "y". If an exception is raised\nduring the iteration, it is as if "in" raised that exception.\n\nLastly, the old-style iteration protocol is tried: if a class defines\n"__getitem__()", "x in y" is true if and only if there is a non-\nnegative integer index *i* such that "x == y[i]", and all lower\ninteger indices do not raise "IndexError" exception. (If any other\nexception is raised, it is as if "in" raised that exception).\n\nThe operator "not in" is defined to have the inverse true value of\n"in".\n\nThe operators "is" and "is not" test for object identity: "x is y" is\ntrue if and only if *x* and *y* are the same object. "x is not y"\nyields the inverse truth value. [4]\n', +- 'compound': b'\nCompound statements\n*******************\n\nCompound statements contain (groups of) other statements; they affect\nor control the execution of those other statements in some way. In\ngeneral, compound statements span multiple lines, although in simple\nincarnations a whole compound statement may be contained in one line.\n\nThe "if", "while" and "for" statements implement traditional control\nflow constructs. "try" specifies exception handlers and/or cleanup\ncode for a group of statements, while the "with" statement allows the\nexecution of initialization and finalization code around a block of\ncode. Function and class definitions are also syntactically compound\nstatements.\n\nA compound statement consists of one or more \'clauses.\' A clause\nconsists of a header and a \'suite.\' The clause headers of a\nparticular compound statement are all at the same indentation level.\nEach clause header begins with a uniquely identifying keyword and ends\nwith a colon. A suite is a group of statements controlled by a\nclause. A suite can be one or more semicolon-separated simple\nstatements on the same line as the header, following the header\'s\ncolon, or it can be one or more indented statements on subsequent\nlines. Only the latter form of a suite can contain nested compound\nstatements; the following is illegal, mostly because it wouldn\'t be\nclear to which "if" clause a following "else" clause would belong:\n\n if test1: if test2: print(x)\n\nAlso note that the semicolon binds tighter than the colon in this\ncontext, so that in the following example, either all or none of the\n"print()" calls are executed:\n\n if x < y < z: print(x); print(y); print(z)\n\nSummarizing:\n\n compound_stmt ::= if_stmt\n | while_stmt\n | for_stmt\n | try_stmt\n | with_stmt\n | funcdef\n | classdef\n suite ::= stmt_list NEWLINE | NEWLINE INDENT statement+ DEDENT\n statement ::= stmt_list NEWLINE | compound_stmt\n stmt_list ::= simple_stmt (";" simple_stmt)* [";"]\n\nNote that statements always end in a "NEWLINE" possibly followed by a\n"DEDENT". Also note that optional continuation clauses always begin\nwith a keyword that cannot start a statement, thus there are no\nambiguities (the \'dangling "else"\' problem is solved in Python by\nrequiring nested "if" statements to be indented).\n\nThe formatting of the grammar rules in the following sections places\neach clause on a separate line for clarity.\n\n\nThe "if" statement\n==================\n\nThe "if" statement is used for conditional execution:\n\n if_stmt ::= "if" expression ":" suite\n ( "elif" expression ":" suite )*\n ["else" ":" suite]\n\nIt selects exactly one of the suites by evaluating the expressions one\nby one until one is found to be true (see section *Boolean operations*\nfor the definition of true and false); then that suite is executed\n(and no other part of the "if" statement is executed or evaluated).\nIf all expressions are false, the suite of the "else" clause, if\npresent, is executed.\n\n\nThe "while" statement\n=====================\n\nThe "while" statement is used for repeated execution as long as an\nexpression is true:\n\n while_stmt ::= "while" expression ":" suite\n ["else" ":" suite]\n\nThis repeatedly tests the expression and, if it is true, executes the\nfirst suite; if the expression is false (which may be the first time\nit is tested) the suite of the "else" clause, if present, is executed\nand the loop terminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and goes back\nto testing the expression.\n\n\nThe "for" statement\n===================\n\nThe "for" statement is used to iterate over the elements of a sequence\n(such as a string, tuple or list) or other iterable object:\n\n for_stmt ::= "for" target_list "in" expression_list ":" suite\n ["else" ":" suite]\n\nThe expression list is evaluated once; it should yield an iterable\nobject. An iterator is created for the result of the\n"expression_list". The suite is then executed once for each item\nprovided by the iterator, in the order returned by the iterator. Each\nitem in turn is assigned to the target list using the standard rules\nfor assignments (see *Assignment statements*), and then the suite is\nexecuted. When the items are exhausted (which is immediately when the\nsequence is empty or an iterator raises a "StopIteration" exception),\nthe suite in the "else" clause, if present, is executed, and the loop\nterminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and continues\nwith the next item, or with the "else" clause if there is no next\nitem.\n\nThe for-loop makes assignments to the variables(s) in the target list.\nThis overwrites all previous assignments to those variables including\nthose made in the suite of the for-loop:\n\n for i in range(10):\n print(i)\n i = 5 # this will not affect the for-loop\n # because i will be overwritten with the next\n # index in the range\n\nNames in the target list are not deleted when the loop is finished,\nbut if the sequence is empty, they will not have been assigned to at\nall by the loop. Hint: the built-in function "range()" returns an\niterator of integers suitable to emulate the effect of Pascal\'s "for i\n:= a to b do"; e.g., "list(range(3))" returns the list "[0, 1, 2]".\n\nNote: There is a subtlety when the sequence is being modified by the\n loop (this can only occur for mutable sequences, i.e. lists). An\n internal counter is used to keep track of which item is used next,\n and this is incremented on each iteration. When this counter has\n reached the length of the sequence the loop terminates. This means\n that if the suite deletes the current (or a previous) item from the\n sequence, the next item will be skipped (since it gets the index of\n the current item which has already been treated). Likewise, if the\n suite inserts an item in the sequence before the current item, the\n current item will be treated again the next time through the loop.\n This can lead to nasty bugs that can be avoided by making a\n temporary copy using a slice of the whole sequence, e.g.,\n\n for x in a[:]:\n if x < 0: a.remove(x)\n\n\nThe "try" statement\n===================\n\nThe "try" statement specifies exception handlers and/or cleanup code\nfor a group of statements:\n\n try_stmt ::= try1_stmt | try2_stmt\n try1_stmt ::= "try" ":" suite\n ("except" [expression ["as" identifier]] ":" suite)+\n ["else" ":" suite]\n ["finally" ":" suite]\n try2_stmt ::= "try" ":" suite\n "finally" ":" suite\n\nThe "except" clause(s) specify one or more exception handlers. When no\nexception occurs in the "try" clause, no exception handler is\nexecuted. When an exception occurs in the "try" suite, a search for an\nexception handler is started. This search inspects the except clauses\nin turn until one is found that matches the exception. An expression-\nless except clause, if present, must be last; it matches any\nexception. For an except clause with an expression, that expression\nis evaluated, and the clause matches the exception if the resulting\nobject is "compatible" with the exception. An object is compatible\nwith an exception if it is the class or a base class of the exception\nobject or a tuple containing an item compatible with the exception.\n\nIf no except clause matches the exception, the search for an exception\nhandler continues in the surrounding code and on the invocation stack.\n[1]\n\nIf the evaluation of an expression in the header of an except clause\nraises an exception, the original search for a handler is canceled and\na search starts for the new exception in the surrounding code and on\nthe call stack (it is treated as if the entire "try" statement raised\nthe exception).\n\nWhen a matching except clause is found, the exception is assigned to\nthe target specified after the "as" keyword in that except clause, if\npresent, and the except clause\'s suite is executed. All except\nclauses must have an executable block. When the end of this block is\nreached, execution continues normally after the entire try statement.\n(This means that if two nested handlers exist for the same exception,\nand the exception occurs in the try clause of the inner handler, the\nouter handler will not handle the exception.)\n\nWhen an exception has been assigned using "as target", it is cleared\nat the end of the except clause. This is as if\n\n except E as N:\n foo\n\nwas translated to\n\n except E as N:\n try:\n foo\n finally:\n del N\n\nThis means the exception must be assigned to a different name to be\nable to refer to it after the except clause. Exceptions are cleared\nbecause with the traceback attached to them, they form a reference\ncycle with the stack frame, keeping all locals in that frame alive\nuntil the next garbage collection occurs.\n\nBefore an except clause\'s suite is executed, details about the\nexception are stored in the "sys" module and can be accessed via\n"sys.exc_info()". "sys.exc_info()" returns a 3-tuple consisting of the\nexception class, the exception instance and a traceback object (see\nsection *The standard type hierarchy*) identifying the point in the\nprogram where the exception occurred. "sys.exc_info()" values are\nrestored to their previous values (before the call) when returning\nfrom a function that handled an exception.\n\nThe optional "else" clause is executed if and when control flows off\nthe end of the "try" clause. [2] Exceptions in the "else" clause are\nnot handled by the preceding "except" clauses.\n\nIf "finally" is present, it specifies a \'cleanup\' handler. The "try"\nclause is executed, including any "except" and "else" clauses. If an\nexception occurs in any of the clauses and is not handled, the\nexception is temporarily saved. The "finally" clause is executed. If\nthere is a saved exception it is re-raised at the end of the "finally"\nclause. If the "finally" clause raises another exception, the saved\nexception is set as the context of the new exception. If the "finally"\nclause executes a "return" or "break" statement, the saved exception\nis discarded:\n\n >>> def f():\n ... try:\n ... 1/0\n ... finally:\n ... return 42\n ...\n >>> f()\n 42\n\nThe exception information is not available to the program during\nexecution of the "finally" clause.\n\nWhen a "return", "break" or "continue" statement is executed in the\n"try" suite of a "try"..."finally" statement, the "finally" clause is\nalso executed \'on the way out.\' A "continue" statement is illegal in\nthe "finally" clause. (The reason is a problem with the current\nimplementation --- this restriction may be lifted in the future).\n\nThe return value of a function is determined by the last "return"\nstatement executed. Since the "finally" clause always executes, a\n"return" statement executed in the "finally" clause will always be the\nlast one executed:\n\n >>> def foo():\n ... try:\n ... return \'try\'\n ... finally:\n ... return \'finally\'\n ...\n >>> foo()\n \'finally\'\n\nAdditional information on exceptions can be found in section\n*Exceptions*, and information on using the "raise" statement to\ngenerate exceptions may be found in section *The raise statement*.\n\n\nThe "with" statement\n====================\n\nThe "with" statement is used to wrap the execution of a block with\nmethods defined by a context manager (see section *With Statement\nContext Managers*). This allows common "try"..."except"..."finally"\nusage patterns to be encapsulated for convenient reuse.\n\n with_stmt ::= "with" with_item ("," with_item)* ":" suite\n with_item ::= expression ["as" target]\n\nThe execution of the "with" statement with one "item" proceeds as\nfollows:\n\n1. The context expression (the expression given in the "with_item")\n is evaluated to obtain a context manager.\n\n2. The context manager\'s "__exit__()" is loaded for later use.\n\n3. The context manager\'s "__enter__()" method is invoked.\n\n4. If a target was included in the "with" statement, the return\n value from "__enter__()" is assigned to it.\n\n Note: The "with" statement guarantees that if the "__enter__()"\n method returns without an error, then "__exit__()" will always be\n called. Thus, if an error occurs during the assignment to the\n target list, it will be treated the same as an error occurring\n within the suite would be. See step 6 below.\n\n5. The suite is executed.\n\n6. The context manager\'s "__exit__()" method is invoked. If an\n exception caused the suite to be exited, its type, value, and\n traceback are passed as arguments to "__exit__()". Otherwise, three\n "None" arguments are supplied.\n\n If the suite was exited due to an exception, and the return value\n from the "__exit__()" method was false, the exception is reraised.\n If the return value was true, the exception is suppressed, and\n execution continues with the statement following the "with"\n statement.\n\n If the suite was exited for any reason other than an exception, the\n return value from "__exit__()" is ignored, and execution proceeds\n at the normal location for the kind of exit that was taken.\n\nWith more than one item, the context managers are processed as if\nmultiple "with" statements were nested:\n\n with A() as a, B() as b:\n suite\n\nis equivalent to\n\n with A() as a:\n with B() as b:\n suite\n\nChanged in version 3.1: Support for multiple context expressions.\n\nSee also: **PEP 0343** - The "with" statement\n\n The specification, background, and examples for the Python "with"\n statement.\n\n\nFunction definitions\n====================\n\nA function definition defines a user-defined function object (see\nsection *The standard type hierarchy*):\n\n funcdef ::= [decorators] "def" funcname "(" [parameter_list] ")" ["->" expression] ":" suite\n decorators ::= decorator+\n decorator ::= "@" dotted_name ["(" [parameter_list [","]] ")"] NEWLINE\n dotted_name ::= identifier ("." identifier)*\n parameter_list ::= (defparameter ",")*\n | "*" [parameter] ("," defparameter)* ["," "**" parameter]\n | "**" parameter\n | defparameter [","] )\n parameter ::= identifier [":" expression]\n defparameter ::= parameter ["=" expression]\n funcname ::= identifier\n\nA function definition is an executable statement. Its execution binds\nthe function name in the current local namespace to a function object\n(a wrapper around the executable code for the function). This\nfunction object contains a reference to the current global namespace\nas the global namespace to be used when the function is called.\n\nThe function definition does not execute the function body; this gets\nexecuted only when the function is called. [3]\n\nA function definition may be wrapped by one or more *decorator*\nexpressions. Decorator expressions are evaluated when the function is\ndefined, in the scope that contains the function definition. The\nresult must be a callable, which is invoked with the function object\nas the only argument. The returned value is bound to the function name\ninstead of the function object. Multiple decorators are applied in\nnested fashion. For example, the following code\n\n @f1(arg)\n @f2\n def func(): pass\n\nis equivalent to\n\n def func(): pass\n func = f1(arg)(f2(func))\n\nWhen one or more *parameters* have the form *parameter* "="\n*expression*, the function is said to have "default parameter values."\nFor a parameter with a default value, the corresponding *argument* may\nbe omitted from a call, in which case the parameter\'s default value is\nsubstituted. If a parameter has a default value, all following\nparameters up until the ""*"" must also have a default value --- this\nis a syntactic restriction that is not expressed by the grammar.\n\n**Default parameter values are evaluated from left to right when the\nfunction definition is executed.** This means that the expression is\nevaluated once, when the function is defined, and that the same "pre-\ncomputed" value is used for each call. This is especially important\nto understand when a default parameter is a mutable object, such as a\nlist or a dictionary: if the function modifies the object (e.g. by\nappending an item to a list), the default value is in effect modified.\nThis is generally not what was intended. A way around this is to use\n"None" as the default, and explicitly test for it in the body of the\nfunction, e.g.:\n\n def whats_on_the_telly(penguin=None):\n if penguin is None:\n penguin = []\n penguin.append("property of the zoo")\n return penguin\n\nFunction call semantics are described in more detail in section\n*Calls*. A function call always assigns values to all parameters\nmentioned in the parameter list, either from position arguments, from\nkeyword arguments, or from default values. If the form\n""*identifier"" is present, it is initialized to a tuple receiving any\nexcess positional parameters, defaulting to the empty tuple. If the\nform ""**identifier"" is present, it is initialized to a new\ndictionary receiving any excess keyword arguments, defaulting to a new\nempty dictionary. Parameters after ""*"" or ""*identifier"" are\nkeyword-only parameters and may only be passed used keyword arguments.\n\nParameters may have annotations of the form "": expression"" following\nthe parameter name. Any parameter may have an annotation even those\nof the form "*identifier" or "**identifier". Functions may have\n"return" annotation of the form ""-> expression"" after the parameter\nlist. These annotations can be any valid Python expression and are\nevaluated when the function definition is executed. Annotations may\nbe evaluated in a different order than they appear in the source code.\nThe presence of annotations does not change the semantics of a\nfunction. The annotation values are available as values of a\ndictionary keyed by the parameters\' names in the "__annotations__"\nattribute of the function object.\n\nIt is also possible to create anonymous functions (functions not bound\nto a name), for immediate use in expressions. This uses lambda\nexpressions, described in section *Lambdas*. Note that the lambda\nexpression is merely a shorthand for a simplified function definition;\na function defined in a ""def"" statement can be passed around or\nassigned to another name just like a function defined by a lambda\nexpression. The ""def"" form is actually more powerful since it\nallows the execution of multiple statements and annotations.\n\n**Programmer\'s note:** Functions are first-class objects. A ""def""\nstatement executed inside a function definition defines a local\nfunction that can be returned or passed around. Free variables used\nin the nested function can access the local variables of the function\ncontaining the def. See section *Naming and binding* for details.\n\nSee also: **PEP 3107** - Function Annotations\n\n The original specification for function annotations.\n\n\nClass definitions\n=================\n\nA class definition defines a class object (see section *The standard\ntype hierarchy*):\n\n classdef ::= [decorators] "class" classname [inheritance] ":" suite\n inheritance ::= "(" [parameter_list] ")"\n classname ::= identifier\n\nA class definition is an executable statement. The inheritance list\nusually gives a list of base classes (see *Customizing class creation*\nfor more advanced uses), so each item in the list should evaluate to a\nclass object which allows subclassing. Classes without an inheritance\nlist inherit, by default, from the base class "object"; hence,\n\n class Foo:\n pass\n\nis equivalent to\n\n class Foo(object):\n pass\n\nThe class\'s suite is then executed in a new execution frame (see\n*Naming and binding*), using a newly created local namespace and the\noriginal global namespace. (Usually, the suite contains mostly\nfunction definitions.) When the class\'s suite finishes execution, its\nexecution frame is discarded but its local namespace is saved. [4] A\nclass object is then created using the inheritance list for the base\nclasses and the saved local namespace for the attribute dictionary.\nThe class name is bound to this class object in the original local\nnamespace.\n\nClass creation can be customized heavily using *metaclasses*.\n\nClasses can also be decorated: just like when decorating functions,\n\n @f1(arg)\n @f2\n class Foo: pass\n\nis equivalent to\n\n class Foo: pass\n Foo = f1(arg)(f2(Foo))\n\nThe evaluation rules for the decorator expressions are the same as for\nfunction decorators. The result must be a class object, which is then\nbound to the class name.\n\n**Programmer\'s note:** Variables defined in the class definition are\nclass attributes; they are shared by instances. Instance attributes\ncan be set in a method with "self.name = value". Both class and\ninstance attributes are accessible through the notation ""self.name"",\nand an instance attribute hides a class attribute with the same name\nwhen accessed in this way. Class attributes can be used as defaults\nfor instance attributes, but using mutable values there can lead to\nunexpected results. *Descriptors* can be used to create instance\nvariables with different implementation details.\n\nSee also: **PEP 3115** - Metaclasses in Python 3 **PEP 3129** -\n Class Decorators\n\n-[ Footnotes ]-\n\n[1] The exception is propagated to the invocation stack unless\n there is a "finally" clause which happens to raise another\n exception. That new exception causes the old one to be lost.\n\n[2] Currently, control "flows off the end" except in the case of\n an exception or the execution of a "return", "continue", or\n "break" statement.\n\n[3] A string literal appearing as the first statement in the\n function body is transformed into the function\'s "__doc__"\n attribute and therefore the function\'s *docstring*.\n\n[4] A string literal appearing as the first statement in the class\n body is transformed into the namespace\'s "__doc__" item and\n therefore the class\'s *docstring*.\n', +- 'context-managers': b'\nWith Statement Context Managers\n*******************************\n\nA *context manager* is an object that defines the runtime context to\nbe established when executing a "with" statement. The context manager\nhandles the entry into, and the exit from, the desired runtime context\nfor the execution of the block of code. Context managers are normally\ninvoked using the "with" statement (described in section *The with\nstatement*), but can also be used by directly invoking their methods.\n\nTypical uses of context managers include saving and restoring various\nkinds of global state, locking and unlocking resources, closing opened\nfiles, etc.\n\nFor more information on context managers, see *Context Manager Types*.\n\nobject.__enter__(self)\n\n Enter the runtime context related to this object. The "with"\n statement will bind this method\'s return value to the target(s)\n specified in the "as" clause of the statement, if any.\n\nobject.__exit__(self, exc_type, exc_value, traceback)\n\n Exit the runtime context related to this object. The parameters\n describe the exception that caused the context to be exited. If the\n context was exited without an exception, all three arguments will\n be "None".\n\n If an exception is supplied, and the method wishes to suppress the\n exception (i.e., prevent it from being propagated), it should\n return a true value. Otherwise, the exception will be processed\n normally upon exit from this method.\n\n Note that "__exit__()" methods should not reraise the passed-in\n exception; this is the caller\'s responsibility.\n\nSee also: **PEP 0343** - The "with" statement\n\n The specification, background, and examples for the Python "with"\n statement.\n', +- 'continue': b'\nThe "continue" statement\n************************\n\n continue_stmt ::= "continue"\n\n"continue" may only occur syntactically nested in a "for" or "while"\nloop, but not nested in a function or class definition or "finally"\nclause within that loop. It continues with the next cycle of the\nnearest enclosing loop.\n\nWhen "continue" passes control out of a "try" statement with a\n"finally" clause, that "finally" clause is executed before really\nstarting the next loop cycle.\n', +- 'conversions': b'\nArithmetic conversions\n**********************\n\nWhen a description of an arithmetic operator below uses the phrase\n"the numeric arguments are converted to a common type," this means\nthat the operator implementation for built-in types works as follows:\n\n* If either argument is a complex number, the other is converted to\n complex;\n\n* otherwise, if either argument is a floating point number, the\n other is converted to floating point;\n\n* otherwise, both must be integers and no conversion is necessary.\n\nSome additional rules apply for certain operators (e.g., a string as a\nleft argument to the \'%\' operator). Extensions must define their own\nconversion behavior.\n', +- 'customization': b'\nBasic customization\n*******************\n\nobject.__new__(cls[, ...])\n\n Called to create a new instance of class *cls*. "__new__()" is a\n static method (special-cased so you need not declare it as such)\n that takes the class of which an instance was requested as its\n first argument. The remaining arguments are those passed to the\n object constructor expression (the call to the class). The return\n value of "__new__()" should be the new object instance (usually an\n instance of *cls*).\n\n Typical implementations create a new instance of the class by\n invoking the superclass\'s "__new__()" method using\n "super(currentclass, cls).__new__(cls[, ...])" with appropriate\n arguments and then modifying the newly-created instance as\n necessary before returning it.\n\n If "__new__()" returns an instance of *cls*, then the new\n instance\'s "__init__()" method will be invoked like\n "__init__(self[, ...])", where *self* is the new instance and the\n remaining arguments are the same as were passed to "__new__()".\n\n If "__new__()" does not return an instance of *cls*, then the new\n instance\'s "__init__()" method will not be invoked.\n\n "__new__()" is intended mainly to allow subclasses of immutable\n types (like int, str, or tuple) to customize instance creation. It\n is also commonly overridden in custom metaclasses in order to\n customize class creation.\n\nobject.__init__(self[, ...])\n\n Called when the instance is created. The arguments are those\n passed to the class constructor expression. If a base class has an\n "__init__()" method, the derived class\'s "__init__()" method, if\n any, must explicitly call it to ensure proper initialization of the\n base class part of the instance; for example:\n "BaseClass.__init__(self, [args...])". As a special constraint on\n constructors, no value may be returned; doing so will cause a\n "TypeError" to be raised at runtime.\n\nobject.__del__(self)\n\n Called when the instance is about to be destroyed. This is also\n called a destructor. If a base class has a "__del__()" method, the\n derived class\'s "__del__()" method, if any, must explicitly call it\n to ensure proper deletion of the base class part of the instance.\n Note that it is possible (though not recommended!) for the\n "__del__()" method to postpone destruction of the instance by\n creating a new reference to it. It may then be called at a later\n time when this new reference is deleted. It is not guaranteed that\n "__del__()" methods are called for objects that still exist when\n the interpreter exits.\n\n Note: "del x" doesn\'t directly call "x.__del__()" --- the former\n decrements the reference count for "x" by one, and the latter is\n only called when "x"\'s reference count reaches zero. Some common\n situations that may prevent the reference count of an object from\n going to zero include: circular references between objects (e.g.,\n a doubly-linked list or a tree data structure with parent and\n child pointers); a reference to the object on the stack frame of\n a function that caught an exception (the traceback stored in\n "sys.exc_info()[2]" keeps the stack frame alive); or a reference\n to the object on the stack frame that raised an unhandled\n exception in interactive mode (the traceback stored in\n "sys.last_traceback" keeps the stack frame alive). The first\n situation can only be remedied by explicitly breaking the cycles;\n the latter two situations can be resolved by storing "None" in\n "sys.last_traceback". Circular references which are garbage are\n detected and cleaned up when the cyclic garbage collector is\n enabled (it\'s on by default). Refer to the documentation for the\n "gc" module for more information about this topic.\n\n Warning: Due to the precarious circumstances under which\n "__del__()" methods are invoked, exceptions that occur during\n their execution are ignored, and a warning is printed to\n "sys.stderr" instead. Also, when "__del__()" is invoked in\n response to a module being deleted (e.g., when execution of the\n program is done), other globals referenced by the "__del__()"\n method may already have been deleted or in the process of being\n torn down (e.g. the import machinery shutting down). For this\n reason, "__del__()" methods should do the absolute minimum needed\n to maintain external invariants. Starting with version 1.5,\n Python guarantees that globals whose name begins with a single\n underscore are deleted from their module before other globals are\n deleted; if no other references to such globals exist, this may\n help in assuring that imported modules are still available at the\n time when the "__del__()" method is called.\n\nobject.__repr__(self)\n\n Called by the "repr()" built-in function to compute the "official"\n string representation of an object. If at all possible, this\n should look like a valid Python expression that could be used to\n recreate an object with the same value (given an appropriate\n environment). If this is not possible, a string of the form\n "<...some useful description...>" should be returned. The return\n value must be a string object. If a class defines "__repr__()" but\n not "__str__()", then "__repr__()" is also used when an "informal"\n string representation of instances of that class is required.\n\n This is typically used for debugging, so it is important that the\n representation is information-rich and unambiguous.\n\nobject.__str__(self)\n\n Called by "str(object)" and the built-in functions "format()" and\n "print()" to compute the "informal" or nicely printable string\n representation of an object. The return value must be a *string*\n object.\n\n This method differs from "object.__repr__()" in that there is no\n expectation that "__str__()" return a valid Python expression: a\n more convenient or concise representation can be used.\n\n The default implementation defined by the built-in type "object"\n calls "object.__repr__()".\n\nobject.__bytes__(self)\n\n Called by "bytes()" to compute a byte-string representation of an\n object. This should return a "bytes" object.\n\nobject.__format__(self, format_spec)\n\n Called by the "format()" built-in function (and by extension, the\n "str.format()" method of class "str") to produce a "formatted"\n string representation of an object. The "format_spec" argument is a\n string that contains a description of the formatting options\n desired. The interpretation of the "format_spec" argument is up to\n the type implementing "__format__()", however most classes will\n either delegate formatting to one of the built-in types, or use a\n similar formatting option syntax.\n\n See *Format Specification Mini-Language* for a description of the\n standard formatting syntax.\n\n The return value must be a string object.\n\n Changed in version 3.4: The __format__ method of "object" itself\n raises a "TypeError" if passed any non-empty string.\n\nobject.__lt__(self, other)\nobject.__le__(self, other)\nobject.__eq__(self, other)\nobject.__ne__(self, other)\nobject.__gt__(self, other)\nobject.__ge__(self, other)\n\n These are the so-called "rich comparison" methods. The\n correspondence between operator symbols and method names is as\n follows: "xy" calls\n "x.__gt__(y)", and "x>=y" calls "x.__ge__(y)".\n\n A rich comparison method may return the singleton "NotImplemented"\n if it does not implement the operation for a given pair of\n arguments. By convention, "False" and "True" are returned for a\n successful comparison. However, these methods can return any value,\n so if the comparison operator is used in a Boolean context (e.g.,\n in the condition of an "if" statement), Python will call "bool()"\n on the value to determine if the result is true or false.\n\n There are no implied relationships among the comparison operators.\n The truth of "x==y" does not imply that "x!=y" is false.\n Accordingly, when defining "__eq__()", one should also define\n "__ne__()" so that the operators will behave as expected. See the\n paragraph on "__hash__()" for some important notes on creating\n *hashable* objects which support custom comparison operations and\n are usable as dictionary keys.\n\n There are no swapped-argument versions of these methods (to be used\n when the left argument does not support the operation but the right\n argument does); rather, "__lt__()" and "__gt__()" are each other\'s\n reflection, "__le__()" and "__ge__()" are each other\'s reflection,\n and "__eq__()" and "__ne__()" are their own reflection.\n\n Arguments to rich comparison methods are never coerced.\n\n To automatically generate ordering operations from a single root\n operation, see "functools.total_ordering()".\n\nobject.__hash__(self)\n\n Called by built-in function "hash()" and for operations on members\n of hashed collections including "set", "frozenset", and "dict".\n "__hash__()" should return an integer. The only required property\n is that objects which compare equal have the same hash value; it is\n advised to somehow mix together (e.g. using exclusive or) the hash\n values for the components of the object that also play a part in\n comparison of objects.\n\n Note: "hash()" truncates the value returned from an object\'s\n custom "__hash__()" method to the size of a "Py_ssize_t". This\n is typically 8 bytes on 64-bit builds and 4 bytes on 32-bit\n builds. If an object\'s "__hash__()" must interoperate on builds\n of different bit sizes, be sure to check the width on all\n supported builds. An easy way to do this is with "python -c\n "import sys; print(sys.hash_info.width)""\n\n If a class does not define an "__eq__()" method it should not\n define a "__hash__()" operation either; if it defines "__eq__()"\n but not "__hash__()", its instances will not be usable as items in\n hashable collections. If a class defines mutable objects and\n implements an "__eq__()" method, it should not implement\n "__hash__()", since the implementation of hashable collections\n requires that a key\'s hash value is immutable (if the object\'s hash\n value changes, it will be in the wrong hash bucket).\n\n User-defined classes have "__eq__()" and "__hash__()" methods by\n default; with them, all objects compare unequal (except with\n themselves) and "x.__hash__()" returns an appropriate value such\n that "x == y" implies both that "x is y" and "hash(x) == hash(y)".\n\n A class that overrides "__eq__()" and does not define "__hash__()"\n will have its "__hash__()" implicitly set to "None". When the\n "__hash__()" method of a class is "None", instances of the class\n will raise an appropriate "TypeError" when a program attempts to\n retrieve their hash value, and will also be correctly identified as\n unhashable when checking "isinstance(obj, collections.Hashable").\n\n If a class that overrides "__eq__()" needs to retain the\n implementation of "__hash__()" from a parent class, the interpreter\n must be told this explicitly by setting "__hash__ =\n .__hash__".\n\n If a class that does not override "__eq__()" wishes to suppress\n hash support, it should include "__hash__ = None" in the class\n definition. A class which defines its own "__hash__()" that\n explicitly raises a "TypeError" would be incorrectly identified as\n hashable by an "isinstance(obj, collections.Hashable)" call.\n\n Note: By default, the "__hash__()" values of str, bytes and\n datetime objects are "salted" with an unpredictable random value.\n Although they remain constant within an individual Python\n process, they are not predictable between repeated invocations of\n Python.This is intended to provide protection against a denial-\n of-service caused by carefully-chosen inputs that exploit the\n worst case performance of a dict insertion, O(n^2) complexity.\n See http://www.ocert.org/advisories/ocert-2011-003.html for\n details.Changing hash values affects the iteration order of\n dicts, sets and other mappings. Python has never made guarantees\n about this ordering (and it typically varies between 32-bit and\n 64-bit builds).See also "PYTHONHASHSEED".\n\n Changed in version 3.3: Hash randomization is enabled by default.\n\nobject.__bool__(self)\n\n Called to implement truth value testing and the built-in operation\n "bool()"; should return "False" or "True". When this method is not\n defined, "__len__()" is called, if it is defined, and the object is\n considered true if its result is nonzero. If a class defines\n neither "__len__()" nor "__bool__()", all its instances are\n considered true.\n', +- 'debugger': b'\n"pdb" --- The Python Debugger\n*****************************\n\nThe module "pdb" defines an interactive source code debugger for\nPython programs. It supports setting (conditional) breakpoints and\nsingle stepping at the source line level, inspection of stack frames,\nsource code listing, and evaluation of arbitrary Python code in the\ncontext of any stack frame. It also supports post-mortem debugging\nand can be called under program control.\n\nThe debugger is extensible -- it is actually defined as the class\n"Pdb". This is currently undocumented but easily understood by reading\nthe source. The extension interface uses the modules "bdb" and "cmd".\n\nThe debugger\'s prompt is "(Pdb)". Typical usage to run a program under\ncontrol of the debugger is:\n\n >>> import pdb\n >>> import mymodule\n >>> pdb.run(\'mymodule.test()\')\n > (0)?()\n (Pdb) continue\n > (1)?()\n (Pdb) continue\n NameError: \'spam\'\n > (1)?()\n (Pdb)\n\nChanged in version 3.3: Tab-completion via the "readline" module is\navailable for commands and command arguments, e.g. the current global\nand local names are offered as arguments of the "p" command.\n\n"pdb.py" can also be invoked as a script to debug other scripts. For\nexample:\n\n python3 -m pdb myscript.py\n\nWhen invoked as a script, pdb will automatically enter post-mortem\ndebugging if the program being debugged exits abnormally. After post-\nmortem debugging (or after normal exit of the program), pdb will\nrestart the program. Automatic restarting preserves pdb\'s state (such\nas breakpoints) and in most cases is more useful than quitting the\ndebugger upon program\'s exit.\n\nNew in version 3.2: "pdb.py" now accepts a "-c" option that executes\ncommands as if given in a ".pdbrc" file, see *Debugger Commands*.\n\nThe typical usage to break into the debugger from a running program is\nto insert\n\n import pdb; pdb.set_trace()\n\nat the location you want to break into the debugger. You can then\nstep through the code following this statement, and continue running\nwithout the debugger using the "continue" command.\n\nThe typical usage to inspect a crashed program is:\n\n >>> import pdb\n >>> import mymodule\n >>> mymodule.test()\n Traceback (most recent call last):\n File "", line 1, in ?\n File "./mymodule.py", line 4, in test\n test2()\n File "./mymodule.py", line 3, in test2\n print(spam)\n NameError: spam\n >>> pdb.pm()\n > ./mymodule.py(3)test2()\n -> print(spam)\n (Pdb)\n\nThe module defines the following functions; each enters the debugger\nin a slightly different way:\n\npdb.run(statement, globals=None, locals=None)\n\n Execute the *statement* (given as a string or a code object) under\n debugger control. The debugger prompt appears before any code is\n executed; you can set breakpoints and type "continue", or you can\n step through the statement using "step" or "next" (all these\n commands are explained below). The optional *globals* and *locals*\n arguments specify the environment in which the code is executed; by\n default the dictionary of the module "__main__" is used. (See the\n explanation of the built-in "exec()" or "eval()" functions.)\n\npdb.runeval(expression, globals=None, locals=None)\n\n Evaluate the *expression* (given as a string or a code object)\n under debugger control. When "runeval()" returns, it returns the\n value of the expression. Otherwise this function is similar to\n "run()".\n\npdb.runcall(function, *args, **kwds)\n\n Call the *function* (a function or method object, not a string)\n with the given arguments. When "runcall()" returns, it returns\n whatever the function call returned. The debugger prompt appears\n as soon as the function is entered.\n\npdb.set_trace()\n\n Enter the debugger at the calling stack frame. This is useful to\n hard-code a breakpoint at a given point in a program, even if the\n code is not otherwise being debugged (e.g. when an assertion\n fails).\n\npdb.post_mortem(traceback=None)\n\n Enter post-mortem debugging of the given *traceback* object. If no\n *traceback* is given, it uses the one of the exception that is\n currently being handled (an exception must be being handled if the\n default is to be used).\n\npdb.pm()\n\n Enter post-mortem debugging of the traceback found in\n "sys.last_traceback".\n\nThe "run*" functions and "set_trace()" are aliases for instantiating\nthe "Pdb" class and calling the method of the same name. If you want\nto access further features, you have to do this yourself:\n\nclass class pdb.Pdb(completekey=\'tab\', stdin=None, stdout=None, skip=None, nosigint=False)\n\n "Pdb" is the debugger class.\n\n The *completekey*, *stdin* and *stdout* arguments are passed to the\n underlying "cmd.Cmd" class; see the description there.\n\n The *skip* argument, if given, must be an iterable of glob-style\n module name patterns. The debugger will not step into frames that\n originate in a module that matches one of these patterns. [1]\n\n By default, Pdb sets a handler for the SIGINT signal (which is sent\n when the user presses Ctrl-C on the console) when you give a\n "continue" command. This allows you to break into the debugger\n again by pressing Ctrl-C. If you want Pdb not to touch the SIGINT\n handler, set *nosigint* tot true.\n\n Example call to enable tracing with *skip*:\n\n import pdb; pdb.Pdb(skip=[\'django.*\']).set_trace()\n\n New in version 3.1: The *skip* argument.\n\n New in version 3.2: The *nosigint* argument. Previously, a SIGINT\n handler was never set by Pdb.\n\n run(statement, globals=None, locals=None)\n runeval(expression, globals=None, locals=None)\n runcall(function, *args, **kwds)\n set_trace()\n\n See the documentation for the functions explained above.\n\n\nDebugger Commands\n=================\n\nThe commands recognized by the debugger are listed below. Most\ncommands can be abbreviated to one or two letters as indicated; e.g.\n"h(elp)" means that either "h" or "help" can be used to enter the help\ncommand (but not "he" or "hel", nor "H" or "Help" or "HELP").\nArguments to commands must be separated by whitespace (spaces or\ntabs). Optional arguments are enclosed in square brackets ("[]") in\nthe command syntax; the square brackets must not be typed.\nAlternatives in the command syntax are separated by a vertical bar\n("|").\n\nEntering a blank line repeats the last command entered. Exception: if\nthe last command was a "list" command, the next 11 lines are listed.\n\nCommands that the debugger doesn\'t recognize are assumed to be Python\nstatements and are executed in the context of the program being\ndebugged. Python statements can also be prefixed with an exclamation\npoint ("!"). This is a powerful way to inspect the program being\ndebugged; it is even possible to change a variable or call a function.\nWhen an exception occurs in such a statement, the exception name is\nprinted but the debugger\'s state is not changed.\n\nThe debugger supports *aliases*. Aliases can have parameters which\nallows one a certain level of adaptability to the context under\nexamination.\n\nMultiple commands may be entered on a single line, separated by ";;".\n(A single ";" is not used as it is the separator for multiple commands\nin a line that is passed to the Python parser.) No intelligence is\napplied to separating the commands; the input is split at the first\n";;" pair, even if it is in the middle of a quoted string.\n\nIf a file ".pdbrc" exists in the user\'s home directory or in the\ncurrent directory, it is read in and executed as if it had been typed\nat the debugger prompt. This is particularly useful for aliases. If\nboth files exist, the one in the home directory is read first and\naliases defined there can be overridden by the local file.\n\nChanged in version 3.2: ".pdbrc" can now contain commands that\ncontinue debugging, such as "continue" or "next". Previously, these\ncommands had no effect.\n\nh(elp) [command]\n\n Without argument, print the list of available commands. With a\n *command* as argument, print help about that command. "help pdb"\n displays the full documentation (the docstring of the "pdb"\n module). Since the *command* argument must be an identifier, "help\n exec" must be entered to get help on the "!" command.\n\nw(here)\n\n Print a stack trace, with the most recent frame at the bottom. An\n arrow indicates the current frame, which determines the context of\n most commands.\n\nd(own) [count]\n\n Move the current frame *count* (default one) levels down in the\n stack trace (to a newer frame).\n\nu(p) [count]\n\n Move the current frame *count* (default one) levels up in the stack\n trace (to an older frame).\n\nb(reak) [([filename:]lineno | function) [, condition]]\n\n With a *lineno* argument, set a break there in the current file.\n With a *function* argument, set a break at the first executable\n statement within that function. The line number may be prefixed\n with a filename and a colon, to specify a breakpoint in another\n file (probably one that hasn\'t been loaded yet). The file is\n searched on "sys.path". Note that each breakpoint is assigned a\n number to which all the other breakpoint commands refer.\n\n If a second argument is present, it is an expression which must\n evaluate to true before the breakpoint is honored.\n\n Without argument, list all breaks, including for each breakpoint,\n the number of times that breakpoint has been hit, the current\n ignore count, and the associated condition if any.\n\ntbreak [([filename:]lineno | function) [, condition]]\n\n Temporary breakpoint, which is removed automatically when it is\n first hit. The arguments are the same as for "break".\n\ncl(ear) [filename:lineno | bpnumber [bpnumber ...]]\n\n With a *filename:lineno* argument, clear all the breakpoints at\n this line. With a space separated list of breakpoint numbers, clear\n those breakpoints. Without argument, clear all breaks (but first\n ask confirmation).\n\ndisable [bpnumber [bpnumber ...]]\n\n Disable the breakpoints given as a space separated list of\n breakpoint numbers. Disabling a breakpoint means it cannot cause\n the program to stop execution, but unlike clearing a breakpoint, it\n remains in the list of breakpoints and can be (re-)enabled.\n\nenable [bpnumber [bpnumber ...]]\n\n Enable the breakpoints specified.\n\nignore bpnumber [count]\n\n Set the ignore count for the given breakpoint number. If count is\n omitted, the ignore count is set to 0. A breakpoint becomes active\n when the ignore count is zero. When non-zero, the count is\n decremented each time the breakpoint is reached and the breakpoint\n is not disabled and any associated condition evaluates to true.\n\ncondition bpnumber [condition]\n\n Set a new *condition* for the breakpoint, an expression which must\n evaluate to true before the breakpoint is honored. If *condition*\n is absent, any existing condition is removed; i.e., the breakpoint\n is made unconditional.\n\ncommands [bpnumber]\n\n Specify a list of commands for breakpoint number *bpnumber*. The\n commands themselves appear on the following lines. Type a line\n containing just "end" to terminate the commands. An example:\n\n (Pdb) commands 1\n (com) p some_variable\n (com) end\n (Pdb)\n\n To remove all commands from a breakpoint, type commands and follow\n it immediately with "end"; that is, give no commands.\n\n With no *bpnumber* argument, commands refers to the last breakpoint\n set.\n\n You can use breakpoint commands to start your program up again.\n Simply use the continue command, or step, or any other command that\n resumes execution.\n\n Specifying any command resuming execution (currently continue,\n step, next, return, jump, quit and their abbreviations) terminates\n the command list (as if that command was immediately followed by\n end). This is because any time you resume execution (even with a\n simple next or step), you may encounter another breakpoint--which\n could have its own command list, leading to ambiguities about which\n list to execute.\n\n If you use the \'silent\' command in the command list, the usual\n message about stopping at a breakpoint is not printed. This may be\n desirable for breakpoints that are to print a specific message and\n then continue. If none of the other commands print anything, you\n see no sign that the breakpoint was reached.\n\ns(tep)\n\n Execute the current line, stop at the first possible occasion\n (either in a function that is called or on the next line in the\n current function).\n\nn(ext)\n\n Continue execution until the next line in the current function is\n reached or it returns. (The difference between "next" and "step"\n is that "step" stops inside a called function, while "next"\n executes called functions at (nearly) full speed, only stopping at\n the next line in the current function.)\n\nunt(il) [lineno]\n\n Without argument, continue execution until the line with a number\n greater than the current one is reached.\n\n With a line number, continue execution until a line with a number\n greater or equal to that is reached. In both cases, also stop when\n the current frame returns.\n\n Changed in version 3.2: Allow giving an explicit line number.\n\nr(eturn)\n\n Continue execution until the current function returns.\n\nc(ont(inue))\n\n Continue execution, only stop when a breakpoint is encountered.\n\nj(ump) lineno\n\n Set the next line that will be executed. Only available in the\n bottom-most frame. This lets you jump back and execute code again,\n or jump forward to skip code that you don\'t want to run.\n\n It should be noted that not all jumps are allowed -- for instance\n it is not possible to jump into the middle of a "for" loop or out\n of a "finally" clause.\n\nl(ist) [first[, last]]\n\n List source code for the current file. Without arguments, list 11\n lines around the current line or continue the previous listing.\n With "." as argument, list 11 lines around the current line. With\n one argument, list 11 lines around at that line. With two\n arguments, list the given range; if the second argument is less\n than the first, it is interpreted as a count.\n\n The current line in the current frame is indicated by "->". If an\n exception is being debugged, the line where the exception was\n originally raised or propagated is indicated by ">>", if it differs\n from the current line.\n\n New in version 3.2: The ">>" marker.\n\nll | longlist\n\n List all source code for the current function or frame.\n Interesting lines are marked as for "list".\n\n New in version 3.2.\n\na(rgs)\n\n Print the argument list of the current function.\n\np expression\n\n Evaluate the *expression* in the current context and print its\n value.\n\n Note: "print()" can also be used, but is not a debugger command\n --- this executes the Python "print()" function.\n\npp expression\n\n Like the "p" command, except the value of the expression is pretty-\n printed using the "pprint" module.\n\nwhatis expression\n\n Print the type of the *expression*.\n\nsource expression\n\n Try to get source code for the given object and display it.\n\n New in version 3.2.\n\ndisplay [expression]\n\n Display the value of the expression if it changed, each time\n execution stops in the current frame.\n\n Without expression, list all display expressions for the current\n frame.\n\n New in version 3.2.\n\nundisplay [expression]\n\n Do not display the expression any more in the current frame.\n Without expression, clear all display expressions for the current\n frame.\n\n New in version 3.2.\n\ninteract\n\n Start an interative interpreter (using the "code" module) whose\n global namespace contains all the (global and local) names found in\n the current scope.\n\n New in version 3.2.\n\nalias [name [command]]\n\n Create an alias called *name* that executes *command*. The command\n must *not* be enclosed in quotes. Replaceable parameters can be\n indicated by "%1", "%2", and so on, while "%*" is replaced by all\n the parameters. If no command is given, the current alias for\n *name* is shown. If no arguments are given, all aliases are listed.\n\n Aliases may be nested and can contain anything that can be legally\n typed at the pdb prompt. Note that internal pdb commands *can* be\n overridden by aliases. Such a command is then hidden until the\n alias is removed. Aliasing is recursively applied to the first\n word of the command line; all other words in the line are left\n alone.\n\n As an example, here are two useful aliases (especially when placed\n in the ".pdbrc" file):\n\n # Print instance variables (usage "pi classInst")\n alias pi for k in %1.__dict__.keys(): print("%1.",k,"=",%1.__dict__[k])\n # Print instance variables in self\n alias ps pi self\n\nunalias name\n\n Delete the specified alias.\n\n! statement\n\n Execute the (one-line) *statement* in the context of the current\n stack frame. The exclamation point can be omitted unless the first\n word of the statement resembles a debugger command. To set a\n global variable, you can prefix the assignment command with a\n "global" statement on the same line, e.g.:\n\n (Pdb) global list_options; list_options = [\'-l\']\n (Pdb)\n\nrun [args ...]\nrestart [args ...]\n\n Restart the debugged Python program. If an argument is supplied,\n it is split with "shlex" and the result is used as the new\n "sys.argv". History, breakpoints, actions and debugger options are\n preserved. "restart" is an alias for "run".\n\nq(uit)\n\n Quit from the debugger. The program being executed is aborted.\n\n-[ Footnotes ]-\n\n[1] Whether a frame is considered to originate in a certain module\n is determined by the "__name__" in the frame globals.\n', +- 'del': b'\nThe "del" statement\n*******************\n\n del_stmt ::= "del" target_list\n\nDeletion is recursively defined very similar to the way assignment is\ndefined. Rather than spelling it out in full details, here are some\nhints.\n\nDeletion of a target list recursively deletes each target, from left\nto right.\n\nDeletion of a name removes the binding of that name from the local or\nglobal namespace, depending on whether the name occurs in a "global"\nstatement in the same code block. If the name is unbound, a\n"NameError" exception will be raised.\n\nDeletion of attribute references, subscriptions and slicings is passed\nto the primary object involved; deletion of a slicing is in general\nequivalent to assignment of an empty slice of the right type (but even\nthis is determined by the sliced object).\n\nChanged in version 3.2: Previously it was illegal to delete a name\nfrom the local namespace if it occurs as a free variable in a nested\nblock.\n', +- 'dict': b'\nDictionary displays\n*******************\n\nA dictionary display is a possibly empty series of key/datum pairs\nenclosed in curly braces:\n\n dict_display ::= "{" [key_datum_list | dict_comprehension] "}"\n key_datum_list ::= key_datum ("," key_datum)* [","]\n key_datum ::= expression ":" expression\n dict_comprehension ::= expression ":" expression comp_for\n\nA dictionary display yields a new dictionary object.\n\nIf a comma-separated sequence of key/datum pairs is given, they are\nevaluated from left to right to define the entries of the dictionary:\neach key object is used as a key into the dictionary to store the\ncorresponding datum. This means that you can specify the same key\nmultiple times in the key/datum list, and the final dictionary\'s value\nfor that key will be the last one given.\n\nA dict comprehension, in contrast to list and set comprehensions,\nneeds two expressions separated with a colon followed by the usual\n"for" and "if" clauses. When the comprehension is run, the resulting\nkey and value elements are inserted in the new dictionary in the order\nthey are produced.\n\nRestrictions on the types of the key values are listed earlier in\nsection *The standard type hierarchy*. (To summarize, the key type\nshould be *hashable*, which excludes all mutable objects.) Clashes\nbetween duplicate keys are not detected; the last datum (textually\nrightmost in the display) stored for a given key value prevails.\n', +- 'dynamic-features': b'\nInteraction with dynamic features\n*********************************\n\nThere are several cases where Python statements are illegal when used\nin conjunction with nested scopes that contain free variables.\n\nIf a variable is referenced in an enclosing scope, it is illegal to\ndelete the name. An error will be reported at compile time.\n\nIf the wild card form of import --- "import *" --- is used in a\nfunction and the function contains or is a nested block with free\nvariables, the compiler will raise a "SyntaxError".\n\nThe "eval()" and "exec()" functions do not have access to the full\nenvironment for resolving names. Names may be resolved in the local\nand global namespaces of the caller. Free variables are not resolved\nin the nearest enclosing namespace, but in the global namespace. [1]\nThe "exec()" and "eval()" functions have optional arguments to\noverride the global and local namespace. If only one namespace is\nspecified, it is used for both.\n', +- 'else': b'\nThe "if" statement\n******************\n\nThe "if" statement is used for conditional execution:\n\n if_stmt ::= "if" expression ":" suite\n ( "elif" expression ":" suite )*\n ["else" ":" suite]\n\nIt selects exactly one of the suites by evaluating the expressions one\nby one until one is found to be true (see section *Boolean operations*\nfor the definition of true and false); then that suite is executed\n(and no other part of the "if" statement is executed or evaluated).\nIf all expressions are false, the suite of the "else" clause, if\npresent, is executed.\n', +- 'exceptions': b'\nExceptions\n**********\n\nExceptions are a means of breaking out of the normal flow of control\nof a code block in order to handle errors or other exceptional\nconditions. An exception is *raised* at the point where the error is\ndetected; it may be *handled* by the surrounding code block or by any\ncode block that directly or indirectly invoked the code block where\nthe error occurred.\n\nThe Python interpreter raises an exception when it detects a run-time\nerror (such as division by zero). A Python program can also\nexplicitly raise an exception with the "raise" statement. Exception\nhandlers are specified with the "try" ... "except" statement. The\n"finally" clause of such a statement can be used to specify cleanup\ncode which does not handle the exception, but is executed whether an\nexception occurred or not in the preceding code.\n\nPython uses the "termination" model of error handling: an exception\nhandler can find out what happened and continue execution at an outer\nlevel, but it cannot repair the cause of the error and retry the\nfailing operation (except by re-entering the offending piece of code\nfrom the top).\n\nWhen an exception is not handled at all, the interpreter terminates\nexecution of the program, or returns to its interactive main loop. In\neither case, it prints a stack backtrace, except when the exception is\n"SystemExit".\n\nExceptions are identified by class instances. The "except" clause is\nselected depending on the class of the instance: it must reference the\nclass of the instance or a base class thereof. The instance can be\nreceived by the handler and can carry additional information about the\nexceptional condition.\n\nNote: Exception messages are not part of the Python API. Their\n contents may change from one version of Python to the next without\n warning and should not be relied on by code which will run under\n multiple versions of the interpreter.\n\nSee also the description of the "try" statement in section *The try\nstatement* and "raise" statement in section *The raise statement*.\n\n-[ Footnotes ]-\n\n[1] This limitation occurs because the code that is executed by\n these operations is not available at the time the module is\n compiled.\n', +- 'execmodel': b'\nExecution model\n***************\n\n\nNaming and binding\n==================\n\n*Names* refer to objects. Names are introduced by name binding\noperations. Each occurrence of a name in the program text refers to\nthe *binding* of that name established in the innermost function block\ncontaining the use.\n\nA *block* is a piece of Python program text that is executed as a\nunit. The following are blocks: a module, a function body, and a class\ndefinition. Each command typed interactively is a block. A script\nfile (a file given as standard input to the interpreter or specified\nas a command line argument to the interpreter) is a code block. A\nscript command (a command specified on the interpreter command line\nwith the \'**-c**\' option) is a code block. The string argument passed\nto the built-in functions "eval()" and "exec()" is a code block.\n\nA code block is executed in an *execution frame*. A frame contains\nsome administrative information (used for debugging) and determines\nwhere and how execution continues after the code block\'s execution has\ncompleted.\n\nA *scope* defines the visibility of a name within a block. If a local\nvariable is defined in a block, its scope includes that block. If the\ndefinition occurs in a function block, the scope extends to any blocks\ncontained within the defining one, unless a contained block introduces\na different binding for the name. The scope of names defined in a\nclass block is limited to the class block; it does not extend to the\ncode blocks of methods -- this includes comprehensions and generator\nexpressions since they are implemented using a function scope. This\nmeans that the following will fail:\n\n class A:\n a = 42\n b = list(a + i for i in range(10))\n\nWhen a name is used in a code block, it is resolved using the nearest\nenclosing scope. The set of all such scopes visible to a code block\nis called the block\'s *environment*.\n\nIf a name is bound in a block, it is a local variable of that block,\nunless declared as "nonlocal". If a name is bound at the module\nlevel, it is a global variable. (The variables of the module code\nblock are local and global.) If a variable is used in a code block\nbut not defined there, it is a *free variable*.\n\nWhen a name is not found at all, a "NameError" exception is raised.\nIf the name refers to a local variable that has not been bound, an\n"UnboundLocalError" exception is raised. "UnboundLocalError" is a\nsubclass of "NameError".\n\nThe following constructs bind names: formal parameters to functions,\n"import" statements, class and function definitions (these bind the\nclass or function name in the defining block), and targets that are\nidentifiers if occurring in an assignment, "for" loop header, or after\n"as" in a "with" statement or "except" clause. The "import" statement\nof the form "from ... import *" binds all names defined in the\nimported module, except those beginning with an underscore. This form\nmay only be used at the module level.\n\nA target occurring in a "del" statement is also considered bound for\nthis purpose (though the actual semantics are to unbind the name).\n\nEach assignment or import statement occurs within a block defined by a\nclass or function definition or at the module level (the top-level\ncode block).\n\nIf a name binding operation occurs anywhere within a code block, all\nuses of the name within the block are treated as references to the\ncurrent block. This can lead to errors when a name is used within a\nblock before it is bound. This rule is subtle. Python lacks\ndeclarations and allows name binding operations to occur anywhere\nwithin a code block. The local variables of a code block can be\ndetermined by scanning the entire text of the block for name binding\noperations.\n\nIf the "global" statement occurs within a block, all uses of the name\nspecified in the statement refer to the binding of that name in the\ntop-level namespace. Names are resolved in the top-level namespace by\nsearching the global namespace, i.e. the namespace of the module\ncontaining the code block, and the builtins namespace, the namespace\nof the module "builtins". The global namespace is searched first. If\nthe name is not found there, the builtins namespace is searched. The\nglobal statement must precede all uses of the name.\n\nThe builtins namespace associated with the execution of a code block\nis actually found by looking up the name "__builtins__" in its global\nnamespace; this should be a dictionary or a module (in the latter case\nthe module\'s dictionary is used). By default, when in the "__main__"\nmodule, "__builtins__" is the built-in module "builtins"; when in any\nother module, "__builtins__" is an alias for the dictionary of the\n"builtins" module itself. "__builtins__" can be set to a user-created\ndictionary to create a weak form of restricted execution.\n\n**CPython implementation detail:** Users should not touch\n"__builtins__"; it is strictly an implementation detail. Users\nwanting to override values in the builtins namespace should "import"\nthe "builtins" module and modify its attributes appropriately.\n\nThe namespace for a module is automatically created the first time a\nmodule is imported. The main module for a script is always called\n"__main__".\n\nThe "global" statement has the same scope as a name binding operation\nin the same block. If the nearest enclosing scope for a free variable\ncontains a global statement, the free variable is treated as a global.\n\nA class definition is an executable statement that may use and define\nnames. These references follow the normal rules for name resolution.\nThe namespace of the class definition becomes the attribute dictionary\nof the class. Names defined at the class scope are not visible in\nmethods.\n\n\nInteraction with dynamic features\n---------------------------------\n\nThere are several cases where Python statements are illegal when used\nin conjunction with nested scopes that contain free variables.\n\nIf a variable is referenced in an enclosing scope, it is illegal to\ndelete the name. An error will be reported at compile time.\n\nIf the wild card form of import --- "import *" --- is used in a\nfunction and the function contains or is a nested block with free\nvariables, the compiler will raise a "SyntaxError".\n\nThe "eval()" and "exec()" functions do not have access to the full\nenvironment for resolving names. Names may be resolved in the local\nand global namespaces of the caller. Free variables are not resolved\nin the nearest enclosing namespace, but in the global namespace. [1]\nThe "exec()" and "eval()" functions have optional arguments to\noverride the global and local namespace. If only one namespace is\nspecified, it is used for both.\n\n\nExceptions\n==========\n\nExceptions are a means of breaking out of the normal flow of control\nof a code block in order to handle errors or other exceptional\nconditions. An exception is *raised* at the point where the error is\ndetected; it may be *handled* by the surrounding code block or by any\ncode block that directly or indirectly invoked the code block where\nthe error occurred.\n\nThe Python interpreter raises an exception when it detects a run-time\nerror (such as division by zero). A Python program can also\nexplicitly raise an exception with the "raise" statement. Exception\nhandlers are specified with the "try" ... "except" statement. The\n"finally" clause of such a statement can be used to specify cleanup\ncode which does not handle the exception, but is executed whether an\nexception occurred or not in the preceding code.\n\nPython uses the "termination" model of error handling: an exception\nhandler can find out what happened and continue execution at an outer\nlevel, but it cannot repair the cause of the error and retry the\nfailing operation (except by re-entering the offending piece of code\nfrom the top).\n\nWhen an exception is not handled at all, the interpreter terminates\nexecution of the program, or returns to its interactive main loop. In\neither case, it prints a stack backtrace, except when the exception is\n"SystemExit".\n\nExceptions are identified by class instances. The "except" clause is\nselected depending on the class of the instance: it must reference the\nclass of the instance or a base class thereof. The instance can be\nreceived by the handler and can carry additional information about the\nexceptional condition.\n\nNote: Exception messages are not part of the Python API. Their\n contents may change from one version of Python to the next without\n warning and should not be relied on by code which will run under\n multiple versions of the interpreter.\n\nSee also the description of the "try" statement in section *The try\nstatement* and "raise" statement in section *The raise statement*.\n\n-[ Footnotes ]-\n\n[1] This limitation occurs because the code that is executed by\n these operations is not available at the time the module is\n compiled.\n', +- 'exprlists': b'\nExpression lists\n****************\n\n expression_list ::= expression ( "," expression )* [","]\n\nAn expression list containing at least one comma yields a tuple. The\nlength of the tuple is the number of expressions in the list. The\nexpressions are evaluated from left to right.\n\nThe trailing comma is required only to create a single tuple (a.k.a. a\n*singleton*); it is optional in all other cases. A single expression\nwithout a trailing comma doesn\'t create a tuple, but rather yields the\nvalue of that expression. (To create an empty tuple, use an empty pair\nof parentheses: "()".)\n', +- 'floating': b'\nFloating point literals\n***********************\n\nFloating point literals are described by the following lexical\ndefinitions:\n\n floatnumber ::= pointfloat | exponentfloat\n pointfloat ::= [intpart] fraction | intpart "."\n exponentfloat ::= (intpart | pointfloat) exponent\n intpart ::= digit+\n fraction ::= "." digit+\n exponent ::= ("e" | "E") ["+" | "-"] digit+\n\nNote that the integer and exponent parts are always interpreted using\nradix 10. For example, "077e010" is legal, and denotes the same number\nas "77e10". The allowed range of floating point literals is\nimplementation-dependent. Some examples of floating point literals:\n\n 3.14 10. .001 1e100 3.14e-10 0e0\n\nNote that numeric literals do not include a sign; a phrase like "-1"\nis actually an expression composed of the unary operator "-" and the\nliteral "1".\n', +- 'for': b'\nThe "for" statement\n*******************\n\nThe "for" statement is used to iterate over the elements of a sequence\n(such as a string, tuple or list) or other iterable object:\n\n for_stmt ::= "for" target_list "in" expression_list ":" suite\n ["else" ":" suite]\n\nThe expression list is evaluated once; it should yield an iterable\nobject. An iterator is created for the result of the\n"expression_list". The suite is then executed once for each item\nprovided by the iterator, in the order returned by the iterator. Each\nitem in turn is assigned to the target list using the standard rules\nfor assignments (see *Assignment statements*), and then the suite is\nexecuted. When the items are exhausted (which is immediately when the\nsequence is empty or an iterator raises a "StopIteration" exception),\nthe suite in the "else" clause, if present, is executed, and the loop\nterminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and continues\nwith the next item, or with the "else" clause if there is no next\nitem.\n\nThe for-loop makes assignments to the variables(s) in the target list.\nThis overwrites all previous assignments to those variables including\nthose made in the suite of the for-loop:\n\n for i in range(10):\n print(i)\n i = 5 # this will not affect the for-loop\n # because i will be overwritten with the next\n # index in the range\n\nNames in the target list are not deleted when the loop is finished,\nbut if the sequence is empty, they will not have been assigned to at\nall by the loop. Hint: the built-in function "range()" returns an\niterator of integers suitable to emulate the effect of Pascal\'s "for i\n:= a to b do"; e.g., "list(range(3))" returns the list "[0, 1, 2]".\n\nNote: There is a subtlety when the sequence is being modified by the\n loop (this can only occur for mutable sequences, i.e. lists). An\n internal counter is used to keep track of which item is used next,\n and this is incremented on each iteration. When this counter has\n reached the length of the sequence the loop terminates. This means\n that if the suite deletes the current (or a previous) item from the\n sequence, the next item will be skipped (since it gets the index of\n the current item which has already been treated). Likewise, if the\n suite inserts an item in the sequence before the current item, the\n current item will be treated again the next time through the loop.\n This can lead to nasty bugs that can be avoided by making a\n temporary copy using a slice of the whole sequence, e.g.,\n\n for x in a[:]:\n if x < 0: a.remove(x)\n', +- 'formatstrings': b'\nFormat String Syntax\n********************\n\nThe "str.format()" method and the "Formatter" class share the same\nsyntax for format strings (although in the case of "Formatter",\nsubclasses can define their own format string syntax).\n\nFormat strings contain "replacement fields" surrounded by curly braces\n"{}". Anything that is not contained in braces is considered literal\ntext, which is copied unchanged to the output. If you need to include\na brace character in the literal text, it can be escaped by doubling:\n"{{" and "}}".\n\nThe grammar for a replacement field is as follows:\n\n replacement_field ::= "{" [field_name] ["!" conversion] [":" format_spec] "}"\n field_name ::= arg_name ("." attribute_name | "[" element_index "]")*\n arg_name ::= [identifier | integer]\n attribute_name ::= identifier\n element_index ::= integer | index_string\n index_string ::= +\n conversion ::= "r" | "s" | "a"\n format_spec ::= \n\nIn less formal terms, the replacement field can start with a\n*field_name* that specifies the object whose value is to be formatted\nand inserted into the output instead of the replacement field. The\n*field_name* is optionally followed by a *conversion* field, which is\npreceded by an exclamation point "\'!\'", and a *format_spec*, which is\npreceded by a colon "\':\'". These specify a non-default format for the\nreplacement value.\n\nSee also the *Format Specification Mini-Language* section.\n\nThe *field_name* itself begins with an *arg_name* that is either a\nnumber or a keyword. If it\'s a number, it refers to a positional\nargument, and if it\'s a keyword, it refers to a named keyword\nargument. If the numerical arg_names in a format string are 0, 1, 2,\n... in sequence, they can all be omitted (not just some) and the\nnumbers 0, 1, 2, ... will be automatically inserted in that order.\nBecause *arg_name* is not quote-delimited, it is not possible to\nspecify arbitrary dictionary keys (e.g., the strings "\'10\'" or\n"\':-]\'") within a format string. The *arg_name* can be followed by any\nnumber of index or attribute expressions. An expression of the form\n"\'.name\'" selects the named attribute using "getattr()", while an\nexpression of the form "\'[index]\'" does an index lookup using\n"__getitem__()".\n\nChanged in version 3.1: The positional argument specifiers can be\nomitted, so "\'{} {}\'" is equivalent to "\'{0} {1}\'".\n\nSome simple format string examples:\n\n "First, thou shalt count to {0}" # References first positional argument\n "Bring me a {}" # Implicitly references the first positional argument\n "From {} to {}" # Same as "From {0} to {1}"\n "My quest is {name}" # References keyword argument \'name\'\n "Weight in tons {0.weight}" # \'weight\' attribute of first positional arg\n "Units destroyed: {players[0]}" # First element of keyword argument \'players\'.\n\nThe *conversion* field causes a type coercion before formatting.\nNormally, the job of formatting a value is done by the "__format__()"\nmethod of the value itself. However, in some cases it is desirable to\nforce a type to be formatted as a string, overriding its own\ndefinition of formatting. By converting the value to a string before\ncalling "__format__()", the normal formatting logic is bypassed.\n\nThree conversion flags are currently supported: "\'!s\'" which calls\n"str()" on the value, "\'!r\'" which calls "repr()" and "\'!a\'" which\ncalls "ascii()".\n\nSome examples:\n\n "Harold\'s a clever {0!s}" # Calls str() on the argument first\n "Bring out the holy {name!r}" # Calls repr() on the argument first\n "More {!a}" # Calls ascii() on the argument first\n\nThe *format_spec* field contains a specification of how the value\nshould be presented, including such details as field width, alignment,\npadding, decimal precision and so on. Each value type can define its\nown "formatting mini-language" or interpretation of the *format_spec*.\n\nMost built-in types support a common formatting mini-language, which\nis described in the next section.\n\nA *format_spec* field can also include nested replacement fields\nwithin it. These nested replacement fields can contain only a field\nname; conversion flags and format specifications are not allowed. The\nreplacement fields within the format_spec are substituted before the\n*format_spec* string is interpreted. This allows the formatting of a\nvalue to be dynamically specified.\n\nSee the *Format examples* section for some examples.\n\n\nFormat Specification Mini-Language\n==================================\n\n"Format specifications" are used within replacement fields contained\nwithin a format string to define how individual values are presented\n(see *Format String Syntax*). They can also be passed directly to the\nbuilt-in "format()" function. Each formattable type may define how\nthe format specification is to be interpreted.\n\nMost built-in types implement the following options for format\nspecifications, although some of the formatting options are only\nsupported by the numeric types.\n\nA general convention is that an empty format string ("""") produces\nthe same result as if you had called "str()" on the value. A non-empty\nformat string typically modifies the result.\n\nThe general form of a *standard format specifier* is:\n\n format_spec ::= [[fill]align][sign][#][0][width][,][.precision][type]\n fill ::= \n align ::= "<" | ">" | "=" | "^"\n sign ::= "+" | "-" | " "\n width ::= integer\n precision ::= integer\n type ::= "b" | "c" | "d" | "e" | "E" | "f" | "F" | "g" | "G" | "n" | "o" | "s" | "x" | "X" | "%"\n\nIf a valid *align* value is specified, it can be preceded by a *fill*\ncharacter that can be any character and defaults to a space if\nomitted. Note that it is not possible to use "{" and "}" as *fill*\nchar while using the "str.format()" method; this limitation however\ndoesn\'t affect the "format()" function.\n\nThe meaning of the various alignment options is as follows:\n\n +-----------+------------------------------------------------------------+\n | Option | Meaning |\n +===========+============================================================+\n | "\'<\'" | Forces the field to be left-aligned within the available |\n | | space (this is the default for most objects). |\n +-----------+------------------------------------------------------------+\n | "\'>\'" | Forces the field to be right-aligned within the available |\n | | space (this is the default for numbers). |\n +-----------+------------------------------------------------------------+\n | "\'=\'" | Forces the padding to be placed after the sign (if any) |\n | | but before the digits. This is used for printing fields |\n | | in the form \'+000000120\'. This alignment option is only |\n | | valid for numeric types. |\n +-----------+------------------------------------------------------------+\n | "\'^\'" | Forces the field to be centered within the available |\n | | space. |\n +-----------+------------------------------------------------------------+\n\nNote that unless a minimum field width is defined, the field width\nwill always be the same size as the data to fill it, so that the\nalignment option has no meaning in this case.\n\nThe *sign* option is only valid for number types, and can be one of\nthe following:\n\n +-----------+------------------------------------------------------------+\n | Option | Meaning |\n +===========+============================================================+\n | "\'+\'" | indicates that a sign should be used for both positive as |\n | | well as negative numbers. |\n +-----------+------------------------------------------------------------+\n | "\'-\'" | indicates that a sign should be used only for negative |\n | | numbers (this is the default behavior). |\n +-----------+------------------------------------------------------------+\n | space | indicates that a leading space should be used on positive |\n | | numbers, and a minus sign on negative numbers. |\n +-----------+------------------------------------------------------------+\n\nThe "\'#\'" option causes the "alternate form" to be used for the\nconversion. The alternate form is defined differently for different\ntypes. This option is only valid for integer, float, complex and\nDecimal types. For integers, when binary, octal, or hexadecimal output\nis used, this option adds the prefix respective "\'0b\'", "\'0o\'", or\n"\'0x\'" to the output value. For floats, complex and Decimal the\nalternate form causes the result of the conversion to always contain a\ndecimal-point character, even if no digits follow it. Normally, a\ndecimal-point character appears in the result of these conversions\nonly if a digit follows it. In addition, for "\'g\'" and "\'G\'"\nconversions, trailing zeros are not removed from the result.\n\nThe "\',\'" option signals the use of a comma for a thousands separator.\nFor a locale aware separator, use the "\'n\'" integer presentation type\ninstead.\n\nChanged in version 3.1: Added the "\',\'" option (see also **PEP 378**).\n\n*width* is a decimal integer defining the minimum field width. If not\nspecified, then the field width will be determined by the content.\n\nPreceding the *width* field by a zero ("\'0\'") character enables sign-\naware zero-padding for numeric types. This is equivalent to a *fill*\ncharacter of "\'0\'" with an *alignment* type of "\'=\'".\n\nThe *precision* is a decimal number indicating how many digits should\nbe displayed after the decimal point for a floating point value\nformatted with "\'f\'" and "\'F\'", or before and after the decimal point\nfor a floating point value formatted with "\'g\'" or "\'G\'". For non-\nnumber types the field indicates the maximum field size - in other\nwords, how many characters will be used from the field content. The\n*precision* is not allowed for integer values.\n\nFinally, the *type* determines how the data should be presented.\n\nThe available string presentation types are:\n\n +-----------+------------------------------------------------------------+\n | Type | Meaning |\n +===========+============================================================+\n | "\'s\'" | String format. This is the default type for strings and |\n | | may be omitted. |\n +-----------+------------------------------------------------------------+\n | None | The same as "\'s\'". |\n +-----------+------------------------------------------------------------+\n\nThe available integer presentation types are:\n\n +-----------+------------------------------------------------------------+\n | Type | Meaning |\n +===========+============================================================+\n | "\'b\'" | Binary format. Outputs the number in base 2. |\n +-----------+------------------------------------------------------------+\n | "\'c\'" | Character. Converts the integer to the corresponding |\n | | unicode character before printing. |\n +-----------+------------------------------------------------------------+\n | "\'d\'" | Decimal Integer. Outputs the number in base 10. |\n +-----------+------------------------------------------------------------+\n | "\'o\'" | Octal format. Outputs the number in base 8. |\n +-----------+------------------------------------------------------------+\n | "\'x\'" | Hex format. Outputs the number in base 16, using lower- |\n | | case letters for the digits above 9. |\n +-----------+------------------------------------------------------------+\n | "\'X\'" | Hex format. Outputs the number in base 16, using upper- |\n | | case letters for the digits above 9. |\n +-----------+------------------------------------------------------------+\n | "\'n\'" | Number. This is the same as "\'d\'", except that it uses the |\n | | current locale setting to insert the appropriate number |\n | | separator characters. |\n +-----------+------------------------------------------------------------+\n | None | The same as "\'d\'". |\n +-----------+------------------------------------------------------------+\n\nIn addition to the above presentation types, integers can be formatted\nwith the floating point presentation types listed below (except "\'n\'"\nand None). When doing so, "float()" is used to convert the integer to\na floating point number before formatting.\n\nThe available presentation types for floating point and decimal values\nare:\n\n +-----------+------------------------------------------------------------+\n | Type | Meaning |\n +===========+============================================================+\n | "\'e\'" | Exponent notation. Prints the number in scientific |\n | | notation using the letter \'e\' to indicate the exponent. |\n | | The default precision is "6". |\n +-----------+------------------------------------------------------------+\n | "\'E\'" | Exponent notation. Same as "\'e\'" except it uses an upper |\n | | case \'E\' as the separator character. |\n +-----------+------------------------------------------------------------+\n | "\'f\'" | Fixed point. Displays the number as a fixed-point number. |\n | | The default precision is "6". |\n +-----------+------------------------------------------------------------+\n | "\'F\'" | Fixed point. Same as "\'f\'", but converts "nan" to "NAN" |\n | | and "inf" to "INF". |\n +-----------+------------------------------------------------------------+\n | "\'g\'" | General format. For a given precision "p >= 1", this |\n | | rounds the number to "p" significant digits and then |\n | | formats the result in either fixed-point format or in |\n | | scientific notation, depending on its magnitude. The |\n | | precise rules are as follows: suppose that the result |\n | | formatted with presentation type "\'e\'" and precision "p-1" |\n | | would have exponent "exp". Then if "-4 <= exp < p", the |\n | | number is formatted with presentation type "\'f\'" and |\n | | precision "p-1-exp". Otherwise, the number is formatted |\n | | with presentation type "\'e\'" and precision "p-1". In both |\n | | cases insignificant trailing zeros are removed from the |\n | | significand, and the decimal point is also removed if |\n | | there are no remaining digits following it. Positive and |\n | | negative infinity, positive and negative zero, and nans, |\n | | are formatted as "inf", "-inf", "0", "-0" and "nan" |\n | | respectively, regardless of the precision. A precision of |\n | | "0" is treated as equivalent to a precision of "1". The |\n | | default precision is "6". |\n +-----------+------------------------------------------------------------+\n | "\'G\'" | General format. Same as "\'g\'" except switches to "\'E\'" if |\n | | the number gets too large. The representations of infinity |\n | | and NaN are uppercased, too. |\n +-----------+------------------------------------------------------------+\n | "\'n\'" | Number. This is the same as "\'g\'", except that it uses the |\n | | current locale setting to insert the appropriate number |\n | | separator characters. |\n +-----------+------------------------------------------------------------+\n | "\'%\'" | Percentage. Multiplies the number by 100 and displays in |\n | | fixed ("\'f\'") format, followed by a percent sign. |\n +-----------+------------------------------------------------------------+\n | None | Similar to "\'g\'", except with at least one digit past the |\n | | decimal point and a default precision of 12. This is |\n | | intended to match "str()", except you can add the other |\n | | format modifiers. |\n +-----------+------------------------------------------------------------+\n\n\nFormat examples\n===============\n\nThis section contains examples of the new format syntax and comparison\nwith the old "%"-formatting.\n\nIn most of the cases the syntax is similar to the old "%"-formatting,\nwith the addition of the "{}" and with ":" used instead of "%". For\nexample, "\'%03.2f\'" can be translated to "\'{:03.2f}\'".\n\nThe new format syntax also supports new and different options, shown\nin the follow examples.\n\nAccessing arguments by position:\n\n >>> \'{0}, {1}, {2}\'.format(\'a\', \'b\', \'c\')\n \'a, b, c\'\n >>> \'{}, {}, {}\'.format(\'a\', \'b\', \'c\') # 3.1+ only\n \'a, b, c\'\n >>> \'{2}, {1}, {0}\'.format(\'a\', \'b\', \'c\')\n \'c, b, a\'\n >>> \'{2}, {1}, {0}\'.format(*\'abc\') # unpacking argument sequence\n \'c, b, a\'\n >>> \'{0}{1}{0}\'.format(\'abra\', \'cad\') # arguments\' indices can be repeated\n \'abracadabra\'\n\nAccessing arguments by name:\n\n >>> \'Coordinates: {latitude}, {longitude}\'.format(latitude=\'37.24N\', longitude=\'-115.81W\')\n \'Coordinates: 37.24N, -115.81W\'\n >>> coord = {\'latitude\': \'37.24N\', \'longitude\': \'-115.81W\'}\n >>> \'Coordinates: {latitude}, {longitude}\'.format(**coord)\n \'Coordinates: 37.24N, -115.81W\'\n\nAccessing arguments\' attributes:\n\n >>> c = 3-5j\n >>> (\'The complex number {0} is formed from the real part {0.real} \'\n ... \'and the imaginary part {0.imag}.\').format(c)\n \'The complex number (3-5j) is formed from the real part 3.0 and the imaginary part -5.0.\'\n >>> class Point:\n ... def __init__(self, x, y):\n ... self.x, self.y = x, y\n ... def __str__(self):\n ... return \'Point({self.x}, {self.y})\'.format(self=self)\n ...\n >>> str(Point(4, 2))\n \'Point(4, 2)\'\n\nAccessing arguments\' items:\n\n >>> coord = (3, 5)\n >>> \'X: {0[0]}; Y: {0[1]}\'.format(coord)\n \'X: 3; Y: 5\'\n\nReplacing "%s" and "%r":\n\n >>> "repr() shows quotes: {!r}; str() doesn\'t: {!s}".format(\'test1\', \'test2\')\n "repr() shows quotes: \'test1\'; str() doesn\'t: test2"\n\nAligning the text and specifying a width:\n\n >>> \'{:<30}\'.format(\'left aligned\')\n \'left aligned \'\n >>> \'{:>30}\'.format(\'right aligned\')\n \' right aligned\'\n >>> \'{:^30}\'.format(\'centered\')\n \' centered \'\n >>> \'{:*^30}\'.format(\'centered\') # use \'*\' as a fill char\n \'***********centered***********\'\n\nReplacing "%+f", "%-f", and "% f" and specifying a sign:\n\n >>> \'{:+f}; {:+f}\'.format(3.14, -3.14) # show it always\n \'+3.140000; -3.140000\'\n >>> \'{: f}; {: f}\'.format(3.14, -3.14) # show a space for positive numbers\n \' 3.140000; -3.140000\'\n >>> \'{:-f}; {:-f}\'.format(3.14, -3.14) # show only the minus -- same as \'{:f}; {:f}\'\n \'3.140000; -3.140000\'\n\nReplacing "%x" and "%o" and converting the value to different bases:\n\n >>> # format also supports binary numbers\n >>> "int: {0:d}; hex: {0:x}; oct: {0:o}; bin: {0:b}".format(42)\n \'int: 42; hex: 2a; oct: 52; bin: 101010\'\n >>> # with 0x, 0o, or 0b as prefix:\n >>> "int: {0:d}; hex: {0:#x}; oct: {0:#o}; bin: {0:#b}".format(42)\n \'int: 42; hex: 0x2a; oct: 0o52; bin: 0b101010\'\n\nUsing the comma as a thousands separator:\n\n >>> \'{:,}\'.format(1234567890)\n \'1,234,567,890\'\n\nExpressing a percentage:\n\n >>> points = 19\n >>> total = 22\n >>> \'Correct answers: {:.2%}\'.format(points/total)\n \'Correct answers: 86.36%\'\n\nUsing type-specific formatting:\n\n >>> import datetime\n >>> d = datetime.datetime(2010, 7, 4, 12, 15, 58)\n >>> \'{:%Y-%m-%d %H:%M:%S}\'.format(d)\n \'2010-07-04 12:15:58\'\n\nNesting arguments and more complex examples:\n\n >>> for align, text in zip(\'<^>\', [\'left\', \'center\', \'right\']):\n ... \'{0:{fill}{align}16}\'.format(text, fill=align, align=align)\n ...\n \'left<<<<<<<<<<<<\'\n \'^^^^^center^^^^^\'\n \'>>>>>>>>>>>right\'\n >>>\n >>> octets = [192, 168, 0, 1]\n >>> \'{:02X}{:02X}{:02X}{:02X}\'.format(*octets)\n \'C0A80001\'\n >>> int(_, 16)\n 3232235521\n >>>\n >>> width = 5\n >>> for num in range(5,12): #doctest: +NORMALIZE_WHITESPACE\n ... for base in \'dXob\':\n ... print(\'{0:{width}{base}}\'.format(num, base=base, width=width), end=\' \')\n ... print()\n ...\n 5 5 5 101\n 6 6 6 110\n 7 7 7 111\n 8 8 10 1000\n 9 9 11 1001\n 10 A 12 1010\n 11 B 13 1011\n', +- 'function': b'\nFunction definitions\n********************\n\nA function definition defines a user-defined function object (see\nsection *The standard type hierarchy*):\n\n funcdef ::= [decorators] "def" funcname "(" [parameter_list] ")" ["->" expression] ":" suite\n decorators ::= decorator+\n decorator ::= "@" dotted_name ["(" [parameter_list [","]] ")"] NEWLINE\n dotted_name ::= identifier ("." identifier)*\n parameter_list ::= (defparameter ",")*\n | "*" [parameter] ("," defparameter)* ["," "**" parameter]\n | "**" parameter\n | defparameter [","] )\n parameter ::= identifier [":" expression]\n defparameter ::= parameter ["=" expression]\n funcname ::= identifier\n\nA function definition is an executable statement. Its execution binds\nthe function name in the current local namespace to a function object\n(a wrapper around the executable code for the function). This\nfunction object contains a reference to the current global namespace\nas the global namespace to be used when the function is called.\n\nThe function definition does not execute the function body; this gets\nexecuted only when the function is called. [3]\n\nA function definition may be wrapped by one or more *decorator*\nexpressions. Decorator expressions are evaluated when the function is\ndefined, in the scope that contains the function definition. The\nresult must be a callable, which is invoked with the function object\nas the only argument. The returned value is bound to the function name\ninstead of the function object. Multiple decorators are applied in\nnested fashion. For example, the following code\n\n @f1(arg)\n @f2\n def func(): pass\n\nis equivalent to\n\n def func(): pass\n func = f1(arg)(f2(func))\n\nWhen one or more *parameters* have the form *parameter* "="\n*expression*, the function is said to have "default parameter values."\nFor a parameter with a default value, the corresponding *argument* may\nbe omitted from a call, in which case the parameter\'s default value is\nsubstituted. If a parameter has a default value, all following\nparameters up until the ""*"" must also have a default value --- this\nis a syntactic restriction that is not expressed by the grammar.\n\n**Default parameter values are evaluated from left to right when the\nfunction definition is executed.** This means that the expression is\nevaluated once, when the function is defined, and that the same "pre-\ncomputed" value is used for each call. This is especially important\nto understand when a default parameter is a mutable object, such as a\nlist or a dictionary: if the function modifies the object (e.g. by\nappending an item to a list), the default value is in effect modified.\nThis is generally not what was intended. A way around this is to use\n"None" as the default, and explicitly test for it in the body of the\nfunction, e.g.:\n\n def whats_on_the_telly(penguin=None):\n if penguin is None:\n penguin = []\n penguin.append("property of the zoo")\n return penguin\n\nFunction call semantics are described in more detail in section\n*Calls*. A function call always assigns values to all parameters\nmentioned in the parameter list, either from position arguments, from\nkeyword arguments, or from default values. If the form\n""*identifier"" is present, it is initialized to a tuple receiving any\nexcess positional parameters, defaulting to the empty tuple. If the\nform ""**identifier"" is present, it is initialized to a new\ndictionary receiving any excess keyword arguments, defaulting to a new\nempty dictionary. Parameters after ""*"" or ""*identifier"" are\nkeyword-only parameters and may only be passed used keyword arguments.\n\nParameters may have annotations of the form "": expression"" following\nthe parameter name. Any parameter may have an annotation even those\nof the form "*identifier" or "**identifier". Functions may have\n"return" annotation of the form ""-> expression"" after the parameter\nlist. These annotations can be any valid Python expression and are\nevaluated when the function definition is executed. Annotations may\nbe evaluated in a different order than they appear in the source code.\nThe presence of annotations does not change the semantics of a\nfunction. The annotation values are available as values of a\ndictionary keyed by the parameters\' names in the "__annotations__"\nattribute of the function object.\n\nIt is also possible to create anonymous functions (functions not bound\nto a name), for immediate use in expressions. This uses lambda\nexpressions, described in section *Lambdas*. Note that the lambda\nexpression is merely a shorthand for a simplified function definition;\na function defined in a ""def"" statement can be passed around or\nassigned to another name just like a function defined by a lambda\nexpression. The ""def"" form is actually more powerful since it\nallows the execution of multiple statements and annotations.\n\n**Programmer\'s note:** Functions are first-class objects. A ""def""\nstatement executed inside a function definition defines a local\nfunction that can be returned or passed around. Free variables used\nin the nested function can access the local variables of the function\ncontaining the def. See section *Naming and binding* for details.\n\nSee also: **PEP 3107** - Function Annotations\n\n The original specification for function annotations.\n', +- 'global': b'\nThe "global" statement\n**********************\n\n global_stmt ::= "global" identifier ("," identifier)*\n\nThe "global" statement is a declaration which holds for the entire\ncurrent code block. It means that the listed identifiers are to be\ninterpreted as globals. It would be impossible to assign to a global\nvariable without "global", although free variables may refer to\nglobals without being declared global.\n\nNames listed in a "global" statement must not be used in the same code\nblock textually preceding that "global" statement.\n\nNames listed in a "global" statement must not be defined as formal\nparameters or in a "for" loop control target, "class" definition,\nfunction definition, or "import" statement.\n\n**CPython implementation detail:** The current implementation does not\nenforce the two restrictions, but programs should not abuse this\nfreedom, as future implementations may enforce them or silently change\nthe meaning of the program.\n\n**Programmer\'s note:** the "global" is a directive to the parser. It\napplies only to code parsed at the same time as the "global"\nstatement. In particular, a "global" statement contained in a string\nor code object supplied to the built-in "exec()" function does not\naffect the code block *containing* the function call, and code\ncontained in such a string is unaffected by "global" statements in the\ncode containing the function call. The same applies to the "eval()"\nand "compile()" functions.\n', +- 'id-classes': b'\nReserved classes of identifiers\n*******************************\n\nCertain classes of identifiers (besides keywords) have special\nmeanings. These classes are identified by the patterns of leading and\ntrailing underscore characters:\n\n"_*"\n Not imported by "from module import *". The special identifier "_"\n is used in the interactive interpreter to store the result of the\n last evaluation; it is stored in the "builtins" module. When not\n in interactive mode, "_" has no special meaning and is not defined.\n See section *The import statement*.\n\n Note: The name "_" is often used in conjunction with\n internationalization; refer to the documentation for the\n "gettext" module for more information on this convention.\n\n"__*__"\n System-defined names. These names are defined by the interpreter\n and its implementation (including the standard library). Current\n system names are discussed in the *Special method names* section\n and elsewhere. More will likely be defined in future versions of\n Python. *Any* use of "__*__" names, in any context, that does not\n follow explicitly documented use, is subject to breakage without\n warning.\n\n"__*"\n Class-private names. Names in this category, when used within the\n context of a class definition, are re-written to use a mangled form\n to help avoid name clashes between "private" attributes of base and\n derived classes. See section *Identifiers (Names)*.\n', +- 'identifiers': b'\nIdentifiers and keywords\n************************\n\nIdentifiers (also referred to as *names*) are described by the\nfollowing lexical definitions.\n\nThe syntax of identifiers in Python is based on the Unicode standard\nannex UAX-31, with elaboration and changes as defined below; see also\n**PEP 3131** for further details.\n\nWithin the ASCII range (U+0001..U+007F), the valid characters for\nidentifiers are the same as in Python 2.x: the uppercase and lowercase\nletters "A" through "Z", the underscore "_" and, except for the first\ncharacter, the digits "0" through "9".\n\nPython 3.0 introduces additional characters from outside the ASCII\nrange (see **PEP 3131**). For these characters, the classification\nuses the version of the Unicode Character Database as included in the\n"unicodedata" module.\n\nIdentifiers are unlimited in length. Case is significant.\n\n identifier ::= xid_start xid_continue*\n id_start ::= \n id_continue ::= \n xid_start ::= \n xid_continue ::= \n\nThe Unicode category codes mentioned above stand for:\n\n* *Lu* - uppercase letters\n\n* *Ll* - lowercase letters\n\n* *Lt* - titlecase letters\n\n* *Lm* - modifier letters\n\n* *Lo* - other letters\n\n* *Nl* - letter numbers\n\n* *Mn* - nonspacing marks\n\n* *Mc* - spacing combining marks\n\n* *Nd* - decimal numbers\n\n* *Pc* - connector punctuations\n\n* *Other_ID_Start* - explicit list of characters in PropList.txt to\n support backwards compatibility\n\n* *Other_ID_Continue* - likewise\n\nAll identifiers are converted into the normal form NFKC while parsing;\ncomparison of identifiers is based on NFKC.\n\nA non-normative HTML file listing all valid identifier characters for\nUnicode 4.1 can be found at http://www.dcl.hpi.uni-\npotsdam.de/home/loewis/table-3131.html.\n\n\nKeywords\n========\n\nThe following identifiers are used as reserved words, or *keywords* of\nthe language, and cannot be used as ordinary identifiers. They must\nbe spelled exactly as written here:\n\n False class finally is return\n None continue for lambda try\n True def from nonlocal while\n and del global not with\n as elif if or yield\n assert else import pass\n break except in raise\n\n\nReserved classes of identifiers\n===============================\n\nCertain classes of identifiers (besides keywords) have special\nmeanings. These classes are identified by the patterns of leading and\ntrailing underscore characters:\n\n"_*"\n Not imported by "from module import *". The special identifier "_"\n is used in the interactive interpreter to store the result of the\n last evaluation; it is stored in the "builtins" module. When not\n in interactive mode, "_" has no special meaning and is not defined.\n See section *The import statement*.\n\n Note: The name "_" is often used in conjunction with\n internationalization; refer to the documentation for the\n "gettext" module for more information on this convention.\n\n"__*__"\n System-defined names. These names are defined by the interpreter\n and its implementation (including the standard library). Current\n system names are discussed in the *Special method names* section\n and elsewhere. More will likely be defined in future versions of\n Python. *Any* use of "__*__" names, in any context, that does not\n follow explicitly documented use, is subject to breakage without\n warning.\n\n"__*"\n Class-private names. Names in this category, when used within the\n context of a class definition, are re-written to use a mangled form\n to help avoid name clashes between "private" attributes of base and\n derived classes. See section *Identifiers (Names)*.\n', +- 'if': b'\nThe "if" statement\n******************\n\nThe "if" statement is used for conditional execution:\n\n if_stmt ::= "if" expression ":" suite\n ( "elif" expression ":" suite )*\n ["else" ":" suite]\n\nIt selects exactly one of the suites by evaluating the expressions one\nby one until one is found to be true (see section *Boolean operations*\nfor the definition of true and false); then that suite is executed\n(and no other part of the "if" statement is executed or evaluated).\nIf all expressions are false, the suite of the "else" clause, if\npresent, is executed.\n', +- 'imaginary': b'\nImaginary literals\n******************\n\nImaginary literals are described by the following lexical definitions:\n\n imagnumber ::= (floatnumber | intpart) ("j" | "J")\n\nAn imaginary literal yields a complex number with a real part of 0.0.\nComplex numbers are represented as a pair of floating point numbers\nand have the same restrictions on their range. To create a complex\nnumber with a nonzero real part, add a floating point number to it,\ne.g., "(3+4j)". Some examples of imaginary literals:\n\n 3.14j 10.j 10j .001j 1e100j 3.14e-10j\n', +- 'import': b'\nThe "import" statement\n**********************\n\n import_stmt ::= "import" module ["as" name] ( "," module ["as" name] )*\n | "from" relative_module "import" identifier ["as" name]\n ( "," identifier ["as" name] )*\n | "from" relative_module "import" "(" identifier ["as" name]\n ( "," identifier ["as" name] )* [","] ")"\n | "from" module "import" "*"\n module ::= (identifier ".")* identifier\n relative_module ::= "."* module | "."+\n name ::= identifier\n\nThe basic import statement (no "from" clause) is executed in two\nsteps:\n\n1. find a module, loading and initializing it if necessary\n\n2. define a name or names in the local namespace for the scope\n where the "import" statement occurs.\n\nWhen the statement contains multiple clauses (separated by commas) the\ntwo steps are carried out separately for each clause, just as though\nthe clauses had been separated out into individiual import statements.\n\nThe details of the first step, finding and loading modules are\ndescribed in greater detail in the section on the *import system*,\nwhich also describes the various types of packages and modules that\ncan be imported, as well as all the hooks that can be used to\ncustomize the import system. Note that failures in this step may\nindicate either that the module could not be located, *or* that an\nerror occurred while initializing the module, which includes execution\nof the module\'s code.\n\nIf the requested module is retrieved successfully, it will be made\navailable in the local namespace in one of three ways:\n\n* If the module name is followed by "as", then the name following\n "as" is bound directly to the imported module.\n\n* If no other name is specified, and the module being imported is a\n top level module, the module\'s name is bound in the local namespace\n as a reference to the imported module\n\n* If the module being imported is *not* a top level module, then the\n name of the top level package that contains the module is bound in\n the local namespace as a reference to the top level package. The\n imported module must be accessed using its full qualified name\n rather than directly\n\nThe "from" form uses a slightly more complex process:\n\n1. find the module specified in the "from" clause, loading and\n initializing it if necessary;\n\n2. for each of the identifiers specified in the "import" clauses:\n\n 1. check if the imported module has an attribute by that name\n\n 2. if not, attempt to import a submodule with that name and then\n check the imported module again for that attribute\n\n 3. if the attribute is not found, "ImportError" is raised.\n\n 4. otherwise, a reference to that value is stored in the local\n namespace, using the name in the "as" clause if it is present,\n otherwise using the attribute name\n\nExamples:\n\n import foo # foo imported and bound locally\n import foo.bar.baz # foo.bar.baz imported, foo bound locally\n import foo.bar.baz as fbb # foo.bar.baz imported and bound as fbb\n from foo.bar import baz # foo.bar.baz imported and bound as baz\n from foo import attr # foo imported and foo.attr bound as attr\n\nIf the list of identifiers is replaced by a star ("\'*\'"), all public\nnames defined in the module are bound in the local namespace for the\nscope where the "import" statement occurs.\n\nThe *public names* defined by a module are determined by checking the\nmodule\'s namespace for a variable named "__all__"; if defined, it must\nbe a sequence of strings which are names defined or imported by that\nmodule. The names given in "__all__" are all considered public and\nare required to exist. If "__all__" is not defined, the set of public\nnames includes all names found in the module\'s namespace which do not\nbegin with an underscore character ("\'_\'"). "__all__" should contain\nthe entire public API. It is intended to avoid accidentally exporting\nitems that are not part of the API (such as library modules which were\nimported and used within the module).\n\nThe "from" form with "*" may only occur in a module scope. The wild\ncard form of import --- "from module import *" --- is only allowed at\nthe module level. Attempting to use it in class or function\ndefinitions will raise a "SyntaxError".\n\nWhen specifying what module to import you do not have to specify the\nabsolute name of the module. When a module or package is contained\nwithin another package it is possible to make a relative import within\nthe same top package without having to mention the package name. By\nusing leading dots in the specified module or package after "from" you\ncan specify how high to traverse up the current package hierarchy\nwithout specifying exact names. One leading dot means the current\npackage where the module making the import exists. Two dots means up\none package level. Three dots is up two levels, etc. So if you execute\n"from . import mod" from a module in the "pkg" package then you will\nend up importing "pkg.mod". If you execute "from ..subpkg2 import mod"\nfrom within "pkg.subpkg1" you will import "pkg.subpkg2.mod". The\nspecification for relative imports is contained within **PEP 328**.\n\n"importlib.import_module()" is provided to support applications that\ndetermine dynamically the modules to be loaded.\n\n\nFuture statements\n=================\n\nA *future statement* is a directive to the compiler that a particular\nmodule should be compiled using syntax or semantics that will be\navailable in a specified future release of Python where the feature\nbecomes standard.\n\nThe future statement is intended to ease migration to future versions\nof Python that introduce incompatible changes to the language. It\nallows use of the new features on a per-module basis before the\nrelease in which the feature becomes standard.\n\n future_statement ::= "from" "__future__" "import" feature ["as" name]\n ("," feature ["as" name])*\n | "from" "__future__" "import" "(" feature ["as" name]\n ("," feature ["as" name])* [","] ")"\n feature ::= identifier\n name ::= identifier\n\nA future statement must appear near the top of the module. The only\nlines that can appear before a future statement are:\n\n* the module docstring (if any),\n\n* comments,\n\n* blank lines, and\n\n* other future statements.\n\nThe features recognized by Python 3.0 are "absolute_import",\n"division", "generators", "unicode_literals", "print_function",\n"nested_scopes" and "with_statement". They are all redundant because\nthey are always enabled, and only kept for backwards compatibility.\n\nA future statement is recognized and treated specially at compile\ntime: Changes to the semantics of core constructs are often\nimplemented by generating different code. It may even be the case\nthat a new feature introduces new incompatible syntax (such as a new\nreserved word), in which case the compiler may need to parse the\nmodule differently. Such decisions cannot be pushed off until\nruntime.\n\nFor any given release, the compiler knows which feature names have\nbeen defined, and raises a compile-time error if a future statement\ncontains a feature not known to it.\n\nThe direct runtime semantics are the same as for any import statement:\nthere is a standard module "__future__", described later, and it will\nbe imported in the usual way at the time the future statement is\nexecuted.\n\nThe interesting runtime semantics depend on the specific feature\nenabled by the future statement.\n\nNote that there is nothing special about the statement:\n\n import __future__ [as name]\n\nThat is not a future statement; it\'s an ordinary import statement with\nno special semantics or syntax restrictions.\n\nCode compiled by calls to the built-in functions "exec()" and\n"compile()" that occur in a module "M" containing a future statement\nwill, by default, use the new syntax or semantics associated with the\nfuture statement. This can be controlled by optional arguments to\n"compile()" --- see the documentation of that function for details.\n\nA future statement typed at an interactive interpreter prompt will\ntake effect for the rest of the interpreter session. If an\ninterpreter is started with the *-i* option, is passed a script name\nto execute, and the script includes a future statement, it will be in\neffect in the interactive session started after the script is\nexecuted.\n\nSee also: **PEP 236** - Back to the __future__\n\n The original proposal for the __future__ mechanism.\n', +- 'in': b'\nComparisons\n***********\n\nUnlike C, all comparison operations in Python have the same priority,\nwhich is lower than that of any arithmetic, shifting or bitwise\noperation. Also unlike C, expressions like "a < b < c" have the\ninterpretation that is conventional in mathematics:\n\n comparison ::= or_expr ( comp_operator or_expr )*\n comp_operator ::= "<" | ">" | "==" | ">=" | "<=" | "!="\n | "is" ["not"] | ["not"] "in"\n\nComparisons yield boolean values: "True" or "False".\n\nComparisons can be chained arbitrarily, e.g., "x < y <= z" is\nequivalent to "x < y and y <= z", except that "y" is evaluated only\nonce (but in both cases "z" is not evaluated at all when "x < y" is\nfound to be false).\n\nFormally, if *a*, *b*, *c*, ..., *y*, *z* are expressions and *op1*,\n*op2*, ..., *opN* are comparison operators, then "a op1 b op2 c ... y\nopN z" is equivalent to "a op1 b and b op2 c and ... y opN z", except\nthat each expression is evaluated at most once.\n\nNote that "a op1 b op2 c" doesn\'t imply any kind of comparison between\n*a* and *c*, so that, e.g., "x < y > z" is perfectly legal (though\nperhaps not pretty).\n\nThe operators "<", ">", "==", ">=", "<=", and "!=" compare the values\nof two objects. The objects need not have the same type. If both are\nnumbers, they are converted to a common type. Otherwise, the "==" and\n"!=" operators *always* consider objects of different types to be\nunequal, while the "<", ">", ">=" and "<=" operators raise a\n"TypeError" when comparing objects of different types that do not\nimplement these operators for the given pair of types. You can\ncontrol comparison behavior of objects of non-built-in types by\ndefining rich comparison methods like "__gt__()", described in section\n*Basic customization*.\n\nComparison of objects of the same type depends on the type:\n\n* Numbers are compared arithmetically.\n\n* The values "float(\'NaN\')" and "Decimal(\'NaN\')" are special. The\n are identical to themselves, "x is x" but are not equal to\n themselves, "x != x". Additionally, comparing any value to a\n not-a-number value will return "False". For example, both "3 <\n float(\'NaN\')" and "float(\'NaN\') < 3" will return "False".\n\n* Bytes objects are compared lexicographically using the numeric\n values of their elements.\n\n* Strings are compared lexicographically using the numeric\n equivalents (the result of the built-in function "ord()") of their\n characters. [3] String and bytes object can\'t be compared!\n\n* Tuples and lists are compared lexicographically using comparison\n of corresponding elements. This means that to compare equal, each\n element must compare equal and the two sequences must be of the same\n type and have the same length.\n\n If not equal, the sequences are ordered the same as their first\n differing elements. For example, "[1,2,x] <= [1,2,y]" has the same\n value as "x <= y". If the corresponding element does not exist, the\n shorter sequence is ordered first (for example, "[1,2] < [1,2,3]").\n\n* Mappings (dictionaries) compare equal if and only if they have the\n same "(key, value)" pairs. Order comparisons "(\'<\', \'<=\', \'>=\',\n \'>\')" raise "TypeError".\n\n* Sets and frozensets define comparison operators to mean subset and\n superset tests. Those relations do not define total orderings (the\n two sets "{1,2}" and {2,3} are not equal, nor subsets of one\n another, nor supersets of one another). Accordingly, sets are not\n appropriate arguments for functions which depend on total ordering.\n For example, "min()", "max()", and "sorted()" produce undefined\n results given a list of sets as inputs.\n\n* Most other objects of built-in types compare unequal unless they\n are the same object; the choice whether one object is considered\n smaller or larger than another one is made arbitrarily but\n consistently within one execution of a program.\n\nComparison of objects of differing types depends on whether either of\nthe types provide explicit support for the comparison. Most numeric\ntypes can be compared with one another. When cross-type comparison is\nnot supported, the comparison method returns "NotImplemented".\n\nThe operators "in" and "not in" test for membership. "x in s"\nevaluates to true if *x* is a member of *s*, and false otherwise. "x\nnot in s" returns the negation of "x in s". All built-in sequences\nand set types support this as well as dictionary, for which "in" tests\nwhether the dictionary has a given key. For container types such as\nlist, tuple, set, frozenset, dict, or collections.deque, the\nexpression "x in y" is equivalent to "any(x is e or x == e for e in\ny)".\n\nFor the string and bytes types, "x in y" is true if and only if *x* is\na substring of *y*. An equivalent test is "y.find(x) != -1". Empty\nstrings are always considered to be a substring of any other string,\nso """ in "abc"" will return "True".\n\nFor user-defined classes which define the "__contains__()" method, "x\nin y" is true if and only if "y.__contains__(x)" is true.\n\nFor user-defined classes which do not define "__contains__()" but do\ndefine "__iter__()", "x in y" is true if some value "z" with "x == z"\nis produced while iterating over "y". If an exception is raised\nduring the iteration, it is as if "in" raised that exception.\n\nLastly, the old-style iteration protocol is tried: if a class defines\n"__getitem__()", "x in y" is true if and only if there is a non-\nnegative integer index *i* such that "x == y[i]", and all lower\ninteger indices do not raise "IndexError" exception. (If any other\nexception is raised, it is as if "in" raised that exception).\n\nThe operator "not in" is defined to have the inverse true value of\n"in".\n\nThe operators "is" and "is not" test for object identity: "x is y" is\ntrue if and only if *x* and *y* are the same object. "x is not y"\nyields the inverse truth value. [4]\n', +- 'integers': b'\nInteger literals\n****************\n\nInteger literals are described by the following lexical definitions:\n\n integer ::= decimalinteger | octinteger | hexinteger | bininteger\n decimalinteger ::= nonzerodigit digit* | "0"+\n nonzerodigit ::= "1"..."9"\n digit ::= "0"..."9"\n octinteger ::= "0" ("o" | "O") octdigit+\n hexinteger ::= "0" ("x" | "X") hexdigit+\n bininteger ::= "0" ("b" | "B") bindigit+\n octdigit ::= "0"..."7"\n hexdigit ::= digit | "a"..."f" | "A"..."F"\n bindigit ::= "0" | "1"\n\nThere is no limit for the length of integer literals apart from what\ncan be stored in available memory.\n\nNote that leading zeros in a non-zero decimal number are not allowed.\nThis is for disambiguation with C-style octal literals, which Python\nused before version 3.0.\n\nSome examples of integer literals:\n\n 7 2147483647 0o177 0b100110111\n 3 79228162514264337593543950336 0o377 0x100000000\n 79228162514264337593543950336 0xdeadbeef\n', +- 'lambda': b'\nLambdas\n*******\n\n lambda_expr ::= "lambda" [parameter_list]: expression\n lambda_expr_nocond ::= "lambda" [parameter_list]: expression_nocond\n\nLambda expressions (sometimes called lambda forms) are used to create\nanonymous functions. The expression "lambda arguments: expression"\nyields a function object. The unnamed object behaves like a function\nobject defined with\n\n def (arguments):\n return expression\n\nSee section *Function definitions* for the syntax of parameter lists.\nNote that functions created with lambda expressions cannot contain\nstatements or annotations.\n', +- 'lists': b'\nList displays\n*************\n\nA list display is a possibly empty series of expressions enclosed in\nsquare brackets:\n\n list_display ::= "[" [expression_list | comprehension] "]"\n\nA list display yields a new list object, the contents being specified\nby either a list of expressions or a comprehension. When a comma-\nseparated list of expressions is supplied, its elements are evaluated\nfrom left to right and placed into the list object in that order.\nWhen a comprehension is supplied, the list is constructed from the\nelements resulting from the comprehension.\n', +- 'naming': b'\nNaming and binding\n******************\n\n*Names* refer to objects. Names are introduced by name binding\noperations. Each occurrence of a name in the program text refers to\nthe *binding* of that name established in the innermost function block\ncontaining the use.\n\nA *block* is a piece of Python program text that is executed as a\nunit. The following are blocks: a module, a function body, and a class\ndefinition. Each command typed interactively is a block. A script\nfile (a file given as standard input to the interpreter or specified\nas a command line argument to the interpreter) is a code block. A\nscript command (a command specified on the interpreter command line\nwith the \'**-c**\' option) is a code block. The string argument passed\nto the built-in functions "eval()" and "exec()" is a code block.\n\nA code block is executed in an *execution frame*. A frame contains\nsome administrative information (used for debugging) and determines\nwhere and how execution continues after the code block\'s execution has\ncompleted.\n\nA *scope* defines the visibility of a name within a block. If a local\nvariable is defined in a block, its scope includes that block. If the\ndefinition occurs in a function block, the scope extends to any blocks\ncontained within the defining one, unless a contained block introduces\na different binding for the name. The scope of names defined in a\nclass block is limited to the class block; it does not extend to the\ncode blocks of methods -- this includes comprehensions and generator\nexpressions since they are implemented using a function scope. This\nmeans that the following will fail:\n\n class A:\n a = 42\n b = list(a + i for i in range(10))\n\nWhen a name is used in a code block, it is resolved using the nearest\nenclosing scope. The set of all such scopes visible to a code block\nis called the block\'s *environment*.\n\nIf a name is bound in a block, it is a local variable of that block,\nunless declared as "nonlocal". If a name is bound at the module\nlevel, it is a global variable. (The variables of the module code\nblock are local and global.) If a variable is used in a code block\nbut not defined there, it is a *free variable*.\n\nWhen a name is not found at all, a "NameError" exception is raised.\nIf the name refers to a local variable that has not been bound, an\n"UnboundLocalError" exception is raised. "UnboundLocalError" is a\nsubclass of "NameError".\n\nThe following constructs bind names: formal parameters to functions,\n"import" statements, class and function definitions (these bind the\nclass or function name in the defining block), and targets that are\nidentifiers if occurring in an assignment, "for" loop header, or after\n"as" in a "with" statement or "except" clause. The "import" statement\nof the form "from ... import *" binds all names defined in the\nimported module, except those beginning with an underscore. This form\nmay only be used at the module level.\n\nA target occurring in a "del" statement is also considered bound for\nthis purpose (though the actual semantics are to unbind the name).\n\nEach assignment or import statement occurs within a block defined by a\nclass or function definition or at the module level (the top-level\ncode block).\n\nIf a name binding operation occurs anywhere within a code block, all\nuses of the name within the block are treated as references to the\ncurrent block. This can lead to errors when a name is used within a\nblock before it is bound. This rule is subtle. Python lacks\ndeclarations and allows name binding operations to occur anywhere\nwithin a code block. The local variables of a code block can be\ndetermined by scanning the entire text of the block for name binding\noperations.\n\nIf the "global" statement occurs within a block, all uses of the name\nspecified in the statement refer to the binding of that name in the\ntop-level namespace. Names are resolved in the top-level namespace by\nsearching the global namespace, i.e. the namespace of the module\ncontaining the code block, and the builtins namespace, the namespace\nof the module "builtins". The global namespace is searched first. If\nthe name is not found there, the builtins namespace is searched. The\nglobal statement must precede all uses of the name.\n\nThe builtins namespace associated with the execution of a code block\nis actually found by looking up the name "__builtins__" in its global\nnamespace; this should be a dictionary or a module (in the latter case\nthe module\'s dictionary is used). By default, when in the "__main__"\nmodule, "__builtins__" is the built-in module "builtins"; when in any\nother module, "__builtins__" is an alias for the dictionary of the\n"builtins" module itself. "__builtins__" can be set to a user-created\ndictionary to create a weak form of restricted execution.\n\n**CPython implementation detail:** Users should not touch\n"__builtins__"; it is strictly an implementation detail. Users\nwanting to override values in the builtins namespace should "import"\nthe "builtins" module and modify its attributes appropriately.\n\nThe namespace for a module is automatically created the first time a\nmodule is imported. The main module for a script is always called\n"__main__".\n\nThe "global" statement has the same scope as a name binding operation\nin the same block. If the nearest enclosing scope for a free variable\ncontains a global statement, the free variable is treated as a global.\n\nA class definition is an executable statement that may use and define\nnames. These references follow the normal rules for name resolution.\nThe namespace of the class definition becomes the attribute dictionary\nof the class. Names defined at the class scope are not visible in\nmethods.\n\n\nInteraction with dynamic features\n=================================\n\nThere are several cases where Python statements are illegal when used\nin conjunction with nested scopes that contain free variables.\n\nIf a variable is referenced in an enclosing scope, it is illegal to\ndelete the name. An error will be reported at compile time.\n\nIf the wild card form of import --- "import *" --- is used in a\nfunction and the function contains or is a nested block with free\nvariables, the compiler will raise a "SyntaxError".\n\nThe "eval()" and "exec()" functions do not have access to the full\nenvironment for resolving names. Names may be resolved in the local\nand global namespaces of the caller. Free variables are not resolved\nin the nearest enclosing namespace, but in the global namespace. [1]\nThe "exec()" and "eval()" functions have optional arguments to\noverride the global and local namespace. If only one namespace is\nspecified, it is used for both.\n', +- 'nonlocal': b'\nThe "nonlocal" statement\n************************\n\n nonlocal_stmt ::= "nonlocal" identifier ("," identifier)*\n\nThe "nonlocal" statement causes the listed identifiers to refer to\npreviously bound variables in the nearest enclosing scope excluding\nglobals. This is important because the default behavior for binding is\nto search the local namespace first. The statement allows\nencapsulated code to rebind variables outside of the local scope\nbesides the global (module) scope.\n\nNames listed in a "nonlocal" statement, unlike those listed in a\n"global" statement, must refer to pre-existing bindings in an\nenclosing scope (the scope in which a new binding should be created\ncannot be determined unambiguously).\n\nNames listed in a "nonlocal" statement must not collide with pre-\nexisting bindings in the local scope.\n\nSee also: **PEP 3104** - Access to Names in Outer Scopes\n\n The specification for the "nonlocal" statement.\n', +- 'numbers': b'\nNumeric literals\n****************\n\nThere are three types of numeric literals: integers, floating point\nnumbers, and imaginary numbers. There are no complex literals\n(complex numbers can be formed by adding a real number and an\nimaginary number).\n\nNote that numeric literals do not include a sign; a phrase like "-1"\nis actually an expression composed of the unary operator \'"-"\' and the\nliteral "1".\n', +- 'numeric-types': b'\nEmulating numeric types\n***********************\n\nThe following methods can be defined to emulate numeric objects.\nMethods corresponding to operations that are not supported by the\nparticular kind of number implemented (e.g., bitwise operations for\nnon-integral numbers) should be left undefined.\n\nobject.__add__(self, other)\nobject.__sub__(self, other)\nobject.__mul__(self, other)\nobject.__truediv__(self, other)\nobject.__floordiv__(self, other)\nobject.__mod__(self, other)\nobject.__divmod__(self, other)\nobject.__pow__(self, other[, modulo])\nobject.__lshift__(self, other)\nobject.__rshift__(self, other)\nobject.__and__(self, other)\nobject.__xor__(self, other)\nobject.__or__(self, other)\n\n These methods are called to implement the binary arithmetic\n operations ("+", "-", "*", "/", "//", "%", "divmod()", "pow()",\n "**", "<<", ">>", "&", "^", "|"). For instance, to evaluate the\n expression "x + y", where *x* is an instance of a class that has an\n "__add__()" method, "x.__add__(y)" is called. The "__divmod__()"\n method should be the equivalent to using "__floordiv__()" and\n "__mod__()"; it should not be related to "__truediv__()". Note\n that "__pow__()" should be defined to accept an optional third\n argument if the ternary version of the built-in "pow()" function is\n to be supported.\n\n If one of those methods does not support the operation with the\n supplied arguments, it should return "NotImplemented".\n\nobject.__radd__(self, other)\nobject.__rsub__(self, other)\nobject.__rmul__(self, other)\nobject.__rtruediv__(self, other)\nobject.__rfloordiv__(self, other)\nobject.__rmod__(self, other)\nobject.__rdivmod__(self, other)\nobject.__rpow__(self, other)\nobject.__rlshift__(self, other)\nobject.__rrshift__(self, other)\nobject.__rand__(self, other)\nobject.__rxor__(self, other)\nobject.__ror__(self, other)\n\n These methods are called to implement the binary arithmetic\n operations ("+", "-", "*", "/", "//", "%", "divmod()", "pow()",\n "**", "<<", ">>", "&", "^", "|") with reflected (swapped) operands.\n These functions are only called if the left operand does not\n support the corresponding operation and the operands are of\n different types. [2] For instance, to evaluate the expression "x -\n y", where *y* is an instance of a class that has an "__rsub__()"\n method, "y.__rsub__(x)" is called if "x.__sub__(y)" returns\n *NotImplemented*.\n\n Note that ternary "pow()" will not try calling "__rpow__()" (the\n coercion rules would become too complicated).\n\n Note: If the right operand\'s type is a subclass of the left\n operand\'s type and that subclass provides the reflected method\n for the operation, this method will be called before the left\n operand\'s non-reflected method. This behavior allows subclasses\n to override their ancestors\' operations.\n\nobject.__iadd__(self, other)\nobject.__isub__(self, other)\nobject.__imul__(self, other)\nobject.__itruediv__(self, other)\nobject.__ifloordiv__(self, other)\nobject.__imod__(self, other)\nobject.__ipow__(self, other[, modulo])\nobject.__ilshift__(self, other)\nobject.__irshift__(self, other)\nobject.__iand__(self, other)\nobject.__ixor__(self, other)\nobject.__ior__(self, other)\n\n These methods are called to implement the augmented arithmetic\n assignments ("+=", "-=", "*=", "/=", "//=", "%=", "**=", "<<=",\n ">>=", "&=", "^=", "|="). These methods should attempt to do the\n operation in-place (modifying *self*) and return the result (which\n could be, but does not have to be, *self*). If a specific method\n is not defined, the augmented assignment falls back to the normal\n methods. For instance, if *x* is an instance of a class with an\n "__iadd__()" method, "x += y" is equivalent to "x = x.__iadd__(y)"\n . Otherwise, "x.__add__(y)" and "y.__radd__(x)" are considered, as\n with the evaluation of "x + y". In certain situations, augmented\n assignment can result in unexpected errors (see *Why does\n a_tuple[i] += [\'item\'] raise an exception when the addition\n works?*), but this behavior is in fact part of the data model.\n\nobject.__neg__(self)\nobject.__pos__(self)\nobject.__abs__(self)\nobject.__invert__(self)\n\n Called to implement the unary arithmetic operations ("-", "+",\n "abs()" and "~").\n\nobject.__complex__(self)\nobject.__int__(self)\nobject.__float__(self)\nobject.__round__(self[, n])\n\n Called to implement the built-in functions "complex()", "int()",\n "float()" and "round()". Should return a value of the appropriate\n type.\n\nobject.__index__(self)\n\n Called to implement "operator.index()", and whenever Python needs\n to losslessly convert the numeric object to an integer object (such\n as in slicing, or in the built-in "bin()", "hex()" and "oct()"\n functions). Presence of this method indicates that the numeric\n object is an integer type. Must return an integer.\n\n Note: In order to have a coherent integer type class, when\n "__index__()" is defined "__int__()" should also be defined, and\n both should return the same value.\n', +- 'objects': b'\nObjects, values and types\n*************************\n\n*Objects* are Python\'s abstraction for data. All data in a Python\nprogram is represented by objects or by relations between objects. (In\na sense, and in conformance to Von Neumann\'s model of a "stored\nprogram computer," code is also represented by objects.)\n\nEvery object has an identity, a type and a value. An object\'s\n*identity* never changes once it has been created; you may think of it\nas the object\'s address in memory. The \'"is"\' operator compares the\nidentity of two objects; the "id()" function returns an integer\nrepresenting its identity.\n\n**CPython implementation detail:** For CPython, "id(x)" is the memory\naddress where "x" is stored.\n\nAn object\'s type determines the operations that the object supports\n(e.g., "does it have a length?") and also defines the possible values\nfor objects of that type. The "type()" function returns an object\'s\ntype (which is an object itself). Like its identity, an object\'s\n*type* is also unchangeable. [1]\n\nThe *value* of some objects can change. Objects whose value can\nchange are said to be *mutable*; objects whose value is unchangeable\nonce they are created are called *immutable*. (The value of an\nimmutable container object that contains a reference to a mutable\nobject can change when the latter\'s value is changed; however the\ncontainer is still considered immutable, because the collection of\nobjects it contains cannot be changed. So, immutability is not\nstrictly the same as having an unchangeable value, it is more subtle.)\nAn object\'s mutability is determined by its type; for instance,\nnumbers, strings and tuples are immutable, while dictionaries and\nlists are mutable.\n\nObjects are never explicitly destroyed; however, when they become\nunreachable they may be garbage-collected. An implementation is\nallowed to postpone garbage collection or omit it altogether --- it is\na matter of implementation quality how garbage collection is\nimplemented, as long as no objects are collected that are still\nreachable.\n\n**CPython implementation detail:** CPython currently uses a reference-\ncounting scheme with (optional) delayed detection of cyclically linked\ngarbage, which collects most objects as soon as they become\nunreachable, but is not guaranteed to collect garbage containing\ncircular references. See the documentation of the "gc" module for\ninformation on controlling the collection of cyclic garbage. Other\nimplementations act differently and CPython may change. Do not depend\non immediate finalization of objects when they become unreachable (so\nyou should always close files explicitly).\n\nNote that the use of the implementation\'s tracing or debugging\nfacilities may keep objects alive that would normally be collectable.\nAlso note that catching an exception with a \'"try"..."except"\'\nstatement may keep objects alive.\n\nSome objects contain references to "external" resources such as open\nfiles or windows. It is understood that these resources are freed\nwhen the object is garbage-collected, but since garbage collection is\nnot guaranteed to happen, such objects also provide an explicit way to\nrelease the external resource, usually a "close()" method. Programs\nare strongly recommended to explicitly close such objects. The\n\'"try"..."finally"\' statement and the \'"with"\' statement provide\nconvenient ways to do this.\n\nSome objects contain references to other objects; these are called\n*containers*. Examples of containers are tuples, lists and\ndictionaries. The references are part of a container\'s value. In\nmost cases, when we talk about the value of a container, we imply the\nvalues, not the identities of the contained objects; however, when we\ntalk about the mutability of a container, only the identities of the\nimmediately contained objects are implied. So, if an immutable\ncontainer (like a tuple) contains a reference to a mutable object, its\nvalue changes if that mutable object is changed.\n\nTypes affect almost all aspects of object behavior. Even the\nimportance of object identity is affected in some sense: for immutable\ntypes, operations that compute new values may actually return a\nreference to any existing object with the same type and value, while\nfor mutable objects this is not allowed. E.g., after "a = 1; b = 1",\n"a" and "b" may or may not refer to the same object with the value\none, depending on the implementation, but after "c = []; d = []", "c"\nand "d" are guaranteed to refer to two different, unique, newly\ncreated empty lists. (Note that "c = d = []" assigns the same object\nto both "c" and "d".)\n', +- 'operator-summary': b'\nOperator precedence\n*******************\n\nThe following table summarizes the operator precedence in Python, from\nlowest precedence (least binding) to highest precedence (most\nbinding). Operators in the same box have the same precedence. Unless\nthe syntax is explicitly given, operators are binary. Operators in\nthe same box group left to right (except for exponentiation, which\ngroups from right to left).\n\nNote that comparisons, membership tests, and identity tests, all have\nthe same precedence and have a left-to-right chaining feature as\ndescribed in the *Comparisons* section.\n\n+-------------------------------------------------+---------------------------------------+\n| Operator | Description |\n+=================================================+=======================================+\n| "lambda" | Lambda expression |\n+-------------------------------------------------+---------------------------------------+\n| "if" -- "else" | Conditional expression |\n+-------------------------------------------------+---------------------------------------+\n| "or" | Boolean OR |\n+-------------------------------------------------+---------------------------------------+\n| "and" | Boolean AND |\n+-------------------------------------------------+---------------------------------------+\n| "not" "x" | Boolean NOT |\n+-------------------------------------------------+---------------------------------------+\n| "in", "not in", "is", "is not", "<", "<=", ">", | Comparisons, including membership |\n| ">=", "!=", "==" | tests and identity tests |\n+-------------------------------------------------+---------------------------------------+\n| "|" | Bitwise OR |\n+-------------------------------------------------+---------------------------------------+\n| "^" | Bitwise XOR |\n+-------------------------------------------------+---------------------------------------+\n| "&" | Bitwise AND |\n+-------------------------------------------------+---------------------------------------+\n| "<<", ">>" | Shifts |\n+-------------------------------------------------+---------------------------------------+\n| "+", "-" | Addition and subtraction |\n+-------------------------------------------------+---------------------------------------+\n| "*", "/", "//", "%" | Multiplication, division, remainder |\n| | [5] |\n+-------------------------------------------------+---------------------------------------+\n| "+x", "-x", "~x" | Positive, negative, bitwise NOT |\n+-------------------------------------------------+---------------------------------------+\n| "**" | Exponentiation [6] |\n+-------------------------------------------------+---------------------------------------+\n| "x[index]", "x[index:index]", | Subscription, slicing, call, |\n| "x(arguments...)", "x.attribute" | attribute reference |\n+-------------------------------------------------+---------------------------------------+\n| "(expressions...)", "[expressions...]", "{key: | Binding or tuple display, list |\n| value...}", "{expressions...}" | display, dictionary display, set |\n| | display |\n+-------------------------------------------------+---------------------------------------+\n\n-[ Footnotes ]-\n\n[1] While "abs(x%y) < abs(y)" is true mathematically, for floats\n it may not be true numerically due to roundoff. For example, and\n assuming a platform on which a Python float is an IEEE 754 double-\n precision number, in order that "-1e-100 % 1e100" have the same\n sign as "1e100", the computed result is "-1e-100 + 1e100", which\n is numerically exactly equal to "1e100". The function\n "math.fmod()" returns a result whose sign matches the sign of the\n first argument instead, and so returns "-1e-100" in this case.\n Which approach is more appropriate depends on the application.\n\n[2] If x is very close to an exact integer multiple of y, it\'s\n possible for "x//y" to be one larger than "(x-x%y)//y" due to\n rounding. In such cases, Python returns the latter result, in\n order to preserve that "divmod(x,y)[0] * y + x % y" be very close\n to "x".\n\n[3] While comparisons between strings make sense at the byte\n level, they may be counter-intuitive to users. For example, the\n strings ""\\u00C7"" and ""\\u0327\\u0043"" compare differently, even\n though they both represent the same unicode character (LATIN\n CAPITAL LETTER C WITH CEDILLA). To compare strings in a human\n recognizable way, compare using "unicodedata.normalize()".\n\n[4] Due to automatic garbage-collection, free lists, and the\n dynamic nature of descriptors, you may notice seemingly unusual\n behaviour in certain uses of the "is" operator, like those\n involving comparisons between instance methods, or constants.\n Check their documentation for more info.\n\n[5] The "%" operator is also used for string formatting; the same\n precedence applies.\n\n[6] The power operator "**" binds less tightly than an arithmetic\n or bitwise unary operator on its right, that is, "2**-1" is "0.5".\n', +- 'pass': b'\nThe "pass" statement\n********************\n\n pass_stmt ::= "pass"\n\n"pass" is a null operation --- when it is executed, nothing happens.\nIt is useful as a placeholder when a statement is required\nsyntactically, but no code needs to be executed, for example:\n\n def f(arg): pass # a function that does nothing (yet)\n\n class C: pass # a class with no methods (yet)\n', +- 'power': b'\nThe power operator\n******************\n\nThe power operator binds more tightly than unary operators on its\nleft; it binds less tightly than unary operators on its right. The\nsyntax is:\n\n power ::= primary ["**" u_expr]\n\nThus, in an unparenthesized sequence of power and unary operators, the\noperators are evaluated from right to left (this does not constrain\nthe evaluation order for the operands): "-1**2" results in "-1".\n\nThe power operator has the same semantics as the built-in "pow()"\nfunction, when called with two arguments: it yields its left argument\nraised to the power of its right argument. The numeric arguments are\nfirst converted to a common type, and the result is of that type.\n\nFor int operands, the result has the same type as the operands unless\nthe second argument is negative; in that case, all arguments are\nconverted to float and a float result is delivered. For example,\n"10**2" returns "100", but "10**-2" returns "0.01".\n\nRaising "0.0" to a negative power results in a "ZeroDivisionError".\nRaising a negative number to a fractional power results in a "complex"\nnumber. (In earlier versions it raised a "ValueError".)\n', +- 'raise': b'\nThe "raise" statement\n*********************\n\n raise_stmt ::= "raise" [expression ["from" expression]]\n\nIf no expressions are present, "raise" re-raises the last exception\nthat was active in the current scope. If no exception is active in\nthe current scope, a "RuntimeError" exception is raised indicating\nthat this is an error.\n\nOtherwise, "raise" evaluates the first expression as the exception\nobject. It must be either a subclass or an instance of\n"BaseException". If it is a class, the exception instance will be\nobtained when needed by instantiating the class with no arguments.\n\nThe *type* of the exception is the exception instance\'s class, the\n*value* is the instance itself.\n\nA traceback object is normally created automatically when an exception\nis raised and attached to it as the "__traceback__" attribute, which\nis writable. You can create an exception and set your own traceback in\none step using the "with_traceback()" exception method (which returns\nthe same exception instance, with its traceback set to its argument),\nlike so:\n\n raise Exception("foo occurred").with_traceback(tracebackobj)\n\nThe "from" clause is used for exception chaining: if given, the second\n*expression* must be another exception class or instance, which will\nthen be attached to the raised exception as the "__cause__" attribute\n(which is writable). If the raised exception is not handled, both\nexceptions will be printed:\n\n >>> try:\n ... print(1 / 0)\n ... except Exception as exc:\n ... raise RuntimeError("Something bad happened") from exc\n ...\n Traceback (most recent call last):\n File "", line 2, in \n ZeroDivisionError: int division or modulo by zero\n\n The above exception was the direct cause of the following exception:\n\n Traceback (most recent call last):\n File "", line 4, in \n RuntimeError: Something bad happened\n\nA similar mechanism works implicitly if an exception is raised inside\nan exception handler: the previous exception is then attached as the\nnew exception\'s "__context__" attribute:\n\n >>> try:\n ... print(1 / 0)\n ... except:\n ... raise RuntimeError("Something bad happened")\n ...\n Traceback (most recent call last):\n File "", line 2, in \n ZeroDivisionError: int division or modulo by zero\n\n During handling of the above exception, another exception occurred:\n\n Traceback (most recent call last):\n File "", line 4, in \n RuntimeError: Something bad happened\n\nAdditional information on exceptions can be found in section\n*Exceptions*, and information about handling exceptions is in section\n*The try statement*.\n', +- 'return': b'\nThe "return" statement\n**********************\n\n return_stmt ::= "return" [expression_list]\n\n"return" may only occur syntactically nested in a function definition,\nnot within a nested class definition.\n\nIf an expression list is present, it is evaluated, else "None" is\nsubstituted.\n\n"return" leaves the current function call with the expression list (or\n"None") as return value.\n\nWhen "return" passes control out of a "try" statement with a "finally"\nclause, that "finally" clause is executed before really leaving the\nfunction.\n\nIn a generator function, the "return" statement indicates that the\ngenerator is done and will cause "StopIteration" to be raised. The\nreturned value (if any) is used as an argument to construct\n"StopIteration" and becomes the "StopIteration.value" attribute.\n', +- 'sequence-types': b'\nEmulating container types\n*************************\n\nThe following methods can be defined to implement container objects.\nContainers usually are sequences (such as lists or tuples) or mappings\n(like dictionaries), but can represent other containers as well. The\nfirst set of methods is used either to emulate a sequence or to\nemulate a mapping; the difference is that for a sequence, the\nallowable keys should be the integers *k* for which "0 <= k < N" where\n*N* is the length of the sequence, or slice objects, which define a\nrange of items. It is also recommended that mappings provide the\nmethods "keys()", "values()", "items()", "get()", "clear()",\n"setdefault()", "pop()", "popitem()", "copy()", and "update()"\nbehaving similar to those for Python\'s standard dictionary objects.\nThe "collections" module provides a "MutableMapping" abstract base\nclass to help create those methods from a base set of "__getitem__()",\n"__setitem__()", "__delitem__()", and "keys()". Mutable sequences\nshould provide methods "append()", "count()", "index()", "extend()",\n"insert()", "pop()", "remove()", "reverse()" and "sort()", like Python\nstandard list objects. Finally, sequence types should implement\naddition (meaning concatenation) and multiplication (meaning\nrepetition) by defining the methods "__add__()", "__radd__()",\n"__iadd__()", "__mul__()", "__rmul__()" and "__imul__()" described\nbelow; they should not define other numerical operators. It is\nrecommended that both mappings and sequences implement the\n"__contains__()" method to allow efficient use of the "in" operator;\nfor mappings, "in" should search the mapping\'s keys; for sequences, it\nshould search through the values. It is further recommended that both\nmappings and sequences implement the "__iter__()" method to allow\nefficient iteration through the container; for mappings, "__iter__()"\nshould be the same as "keys()"; for sequences, it should iterate\nthrough the values.\n\nobject.__len__(self)\n\n Called to implement the built-in function "len()". Should return\n the length of the object, an integer ">=" 0. Also, an object that\n doesn\'t define a "__bool__()" method and whose "__len__()" method\n returns zero is considered to be false in a Boolean context.\n\nobject.__length_hint__(self)\n\n Called to implement "operator.length_hint()". Should return an\n estimated length for the object (which may be greater or less than\n the actual length). The length must be an integer ">=" 0. This\n method is purely an optimization and is never required for\n correctness.\n\n New in version 3.4.\n\nNote: Slicing is done exclusively with the following three methods.\n A call like\n\n a[1:2] = b\n\n is translated to\n\n a[slice(1, 2, None)] = b\n\n and so forth. Missing slice items are always filled in with "None".\n\nobject.__getitem__(self, key)\n\n Called to implement evaluation of "self[key]". For sequence types,\n the accepted keys should be integers and slice objects. Note that\n the special interpretation of negative indexes (if the class wishes\n to emulate a sequence type) is up to the "__getitem__()" method. If\n *key* is of an inappropriate type, "TypeError" may be raised; if of\n a value outside the set of indexes for the sequence (after any\n special interpretation of negative values), "IndexError" should be\n raised. For mapping types, if *key* is missing (not in the\n container), "KeyError" should be raised.\n\n Note: "for" loops expect that an "IndexError" will be raised for\n illegal indexes to allow proper detection of the end of the\n sequence.\n\nobject.__setitem__(self, key, value)\n\n Called to implement assignment to "self[key]". Same note as for\n "__getitem__()". This should only be implemented for mappings if\n the objects support changes to the values for keys, or if new keys\n can be added, or for sequences if elements can be replaced. The\n same exceptions should be raised for improper *key* values as for\n the "__getitem__()" method.\n\nobject.__delitem__(self, key)\n\n Called to implement deletion of "self[key]". Same note as for\n "__getitem__()". This should only be implemented for mappings if\n the objects support removal of keys, or for sequences if elements\n can be removed from the sequence. The same exceptions should be\n raised for improper *key* values as for the "__getitem__()" method.\n\nobject.__iter__(self)\n\n This method is called when an iterator is required for a container.\n This method should return a new iterator object that can iterate\n over all the objects in the container. For mappings, it should\n iterate over the keys of the container, and should also be made\n available as the method "keys()".\n\n Iterator objects also need to implement this method; they are\n required to return themselves. For more information on iterator\n objects, see *Iterator Types*.\n\nobject.__reversed__(self)\n\n Called (if present) by the "reversed()" built-in to implement\n reverse iteration. It should return a new iterator object that\n iterates over all the objects in the container in reverse order.\n\n If the "__reversed__()" method is not provided, the "reversed()"\n built-in will fall back to using the sequence protocol ("__len__()"\n and "__getitem__()"). Objects that support the sequence protocol\n should only provide "__reversed__()" if they can provide an\n implementation that is more efficient than the one provided by\n "reversed()".\n\nThe membership test operators ("in" and "not in") are normally\nimplemented as an iteration through a sequence. However, container\nobjects can supply the following special method with a more efficient\nimplementation, which also does not require the object be a sequence.\n\nobject.__contains__(self, item)\n\n Called to implement membership test operators. Should return true\n if *item* is in *self*, false otherwise. For mapping objects, this\n should consider the keys of the mapping rather than the values or\n the key-item pairs.\n\n For objects that don\'t define "__contains__()", the membership test\n first tries iteration via "__iter__()", then the old sequence\n iteration protocol via "__getitem__()", see *this section in the\n language reference*.\n', +- 'shifting': b'\nShifting operations\n*******************\n\nThe shifting operations have lower priority than the arithmetic\noperations:\n\n shift_expr ::= a_expr | shift_expr ( "<<" | ">>" ) a_expr\n\nThese operators accept integers as arguments. They shift the first\nargument to the left or right by the number of bits given by the\nsecond argument.\n\nA right shift by *n* bits is defined as floor division by "pow(2,n)".\nA left shift by *n* bits is defined as multiplication with "pow(2,n)".\n\nNote: In the current implementation, the right-hand operand is\n required to be at most "sys.maxsize". If the right-hand operand is\n larger than "sys.maxsize" an "OverflowError" exception is raised.\n', +- 'slicings': b'\nSlicings\n********\n\nA slicing selects a range of items in a sequence object (e.g., a\nstring, tuple or list). Slicings may be used as expressions or as\ntargets in assignment or "del" statements. The syntax for a slicing:\n\n slicing ::= primary "[" slice_list "]"\n slice_list ::= slice_item ("," slice_item)* [","]\n slice_item ::= expression | proper_slice\n proper_slice ::= [lower_bound] ":" [upper_bound] [ ":" [stride] ]\n lower_bound ::= expression\n upper_bound ::= expression\n stride ::= expression\n\nThere is ambiguity in the formal syntax here: anything that looks like\nan expression list also looks like a slice list, so any subscription\ncan be interpreted as a slicing. Rather than further complicating the\nsyntax, this is disambiguated by defining that in this case the\ninterpretation as a subscription takes priority over the\ninterpretation as a slicing (this is the case if the slice list\ncontains no proper slice).\n\nThe semantics for a slicing are as follows. The primary must evaluate\nto a mapping object, and it is indexed (using the same "__getitem__()"\nmethod as normal subscription) with a key that is constructed from the\nslice list, as follows. If the slice list contains at least one\ncomma, the key is a tuple containing the conversion of the slice\nitems; otherwise, the conversion of the lone slice item is the key.\nThe conversion of a slice item that is an expression is that\nexpression. The conversion of a proper slice is a slice object (see\nsection *The standard type hierarchy*) whose "start", "stop" and\n"step" attributes are the values of the expressions given as lower\nbound, upper bound and stride, respectively, substituting "None" for\nmissing expressions.\n', +- 'specialattrs': b'\nSpecial Attributes\n******************\n\nThe implementation adds a few special read-only attributes to several\nobject types, where they are relevant. Some of these are not reported\nby the "dir()" built-in function.\n\nobject.__dict__\n\n A dictionary or other mapping object used to store an object\'s\n (writable) attributes.\n\ninstance.__class__\n\n The class to which a class instance belongs.\n\nclass.__bases__\n\n The tuple of base classes of a class object.\n\nclass.__name__\n\n The name of the class or type.\n\nclass.__qualname__\n\n The *qualified name* of the class or type.\n\n New in version 3.3.\n\nclass.__mro__\n\n This attribute is a tuple of classes that are considered when\n looking for base classes during method resolution.\n\nclass.mro()\n\n This method can be overridden by a metaclass to customize the\n method resolution order for its instances. It is called at class\n instantiation, and its result is stored in "__mro__".\n\nclass.__subclasses__()\n\n Each class keeps a list of weak references to its immediate\n subclasses. This method returns a list of all those references\n still alive. Example:\n\n >>> int.__subclasses__()\n []\n\n-[ Footnotes ]-\n\n[1] Additional information on these special methods may be found\n in the Python Reference Manual (*Basic customization*).\n\n[2] As a consequence, the list "[1, 2]" is considered equal to\n "[1.0, 2.0]", and similarly for tuples.\n\n[3] They must have since the parser can\'t tell the type of the\n operands.\n\n[4] Cased characters are those with general category property\n being one of "Lu" (Letter, uppercase), "Ll" (Letter, lowercase),\n or "Lt" (Letter, titlecase).\n\n[5] To format only a tuple you should therefore provide a\n singleton tuple whose only element is the tuple to be formatted.\n', +- 'specialnames': b'\nSpecial method names\n********************\n\nA class can implement certain operations that are invoked by special\nsyntax (such as arithmetic operations or subscripting and slicing) by\ndefining methods with special names. This is Python\'s approach to\n*operator overloading*, allowing classes to define their own behavior\nwith respect to language operators. For instance, if a class defines\na method named "__getitem__()", and "x" is an instance of this class,\nthen "x[i]" is roughly equivalent to "type(x).__getitem__(x, i)".\nExcept where mentioned, attempts to execute an operation raise an\nexception when no appropriate method is defined (typically\n"AttributeError" or "TypeError").\n\nWhen implementing a class that emulates any built-in type, it is\nimportant that the emulation only be implemented to the degree that it\nmakes sense for the object being modelled. For example, some\nsequences may work well with retrieval of individual elements, but\nextracting a slice may not make sense. (One example of this is the\n"NodeList" interface in the W3C\'s Document Object Model.)\n\n\nBasic customization\n===================\n\nobject.__new__(cls[, ...])\n\n Called to create a new instance of class *cls*. "__new__()" is a\n static method (special-cased so you need not declare it as such)\n that takes the class of which an instance was requested as its\n first argument. The remaining arguments are those passed to the\n object constructor expression (the call to the class). The return\n value of "__new__()" should be the new object instance (usually an\n instance of *cls*).\n\n Typical implementations create a new instance of the class by\n invoking the superclass\'s "__new__()" method using\n "super(currentclass, cls).__new__(cls[, ...])" with appropriate\n arguments and then modifying the newly-created instance as\n necessary before returning it.\n\n If "__new__()" returns an instance of *cls*, then the new\n instance\'s "__init__()" method will be invoked like\n "__init__(self[, ...])", where *self* is the new instance and the\n remaining arguments are the same as were passed to "__new__()".\n\n If "__new__()" does not return an instance of *cls*, then the new\n instance\'s "__init__()" method will not be invoked.\n\n "__new__()" is intended mainly to allow subclasses of immutable\n types (like int, str, or tuple) to customize instance creation. It\n is also commonly overridden in custom metaclasses in order to\n customize class creation.\n\nobject.__init__(self[, ...])\n\n Called when the instance is created. The arguments are those\n passed to the class constructor expression. If a base class has an\n "__init__()" method, the derived class\'s "__init__()" method, if\n any, must explicitly call it to ensure proper initialization of the\n base class part of the instance; for example:\n "BaseClass.__init__(self, [args...])". As a special constraint on\n constructors, no value may be returned; doing so will cause a\n "TypeError" to be raised at runtime.\n\nobject.__del__(self)\n\n Called when the instance is about to be destroyed. This is also\n called a destructor. If a base class has a "__del__()" method, the\n derived class\'s "__del__()" method, if any, must explicitly call it\n to ensure proper deletion of the base class part of the instance.\n Note that it is possible (though not recommended!) for the\n "__del__()" method to postpone destruction of the instance by\n creating a new reference to it. It may then be called at a later\n time when this new reference is deleted. It is not guaranteed that\n "__del__()" methods are called for objects that still exist when\n the interpreter exits.\n\n Note: "del x" doesn\'t directly call "x.__del__()" --- the former\n decrements the reference count for "x" by one, and the latter is\n only called when "x"\'s reference count reaches zero. Some common\n situations that may prevent the reference count of an object from\n going to zero include: circular references between objects (e.g.,\n a doubly-linked list or a tree data structure with parent and\n child pointers); a reference to the object on the stack frame of\n a function that caught an exception (the traceback stored in\n "sys.exc_info()[2]" keeps the stack frame alive); or a reference\n to the object on the stack frame that raised an unhandled\n exception in interactive mode (the traceback stored in\n "sys.last_traceback" keeps the stack frame alive). The first\n situation can only be remedied by explicitly breaking the cycles;\n the latter two situations can be resolved by storing "None" in\n "sys.last_traceback". Circular references which are garbage are\n detected and cleaned up when the cyclic garbage collector is\n enabled (it\'s on by default). Refer to the documentation for the\n "gc" module for more information about this topic.\n\n Warning: Due to the precarious circumstances under which\n "__del__()" methods are invoked, exceptions that occur during\n their execution are ignored, and a warning is printed to\n "sys.stderr" instead. Also, when "__del__()" is invoked in\n response to a module being deleted (e.g., when execution of the\n program is done), other globals referenced by the "__del__()"\n method may already have been deleted or in the process of being\n torn down (e.g. the import machinery shutting down). For this\n reason, "__del__()" methods should do the absolute minimum needed\n to maintain external invariants. Starting with version 1.5,\n Python guarantees that globals whose name begins with a single\n underscore are deleted from their module before other globals are\n deleted; if no other references to such globals exist, this may\n help in assuring that imported modules are still available at the\n time when the "__del__()" method is called.\n\nobject.__repr__(self)\n\n Called by the "repr()" built-in function to compute the "official"\n string representation of an object. If at all possible, this\n should look like a valid Python expression that could be used to\n recreate an object with the same value (given an appropriate\n environment). If this is not possible, a string of the form\n "<...some useful description...>" should be returned. The return\n value must be a string object. If a class defines "__repr__()" but\n not "__str__()", then "__repr__()" is also used when an "informal"\n string representation of instances of that class is required.\n\n This is typically used for debugging, so it is important that the\n representation is information-rich and unambiguous.\n\nobject.__str__(self)\n\n Called by "str(object)" and the built-in functions "format()" and\n "print()" to compute the "informal" or nicely printable string\n representation of an object. The return value must be a *string*\n object.\n\n This method differs from "object.__repr__()" in that there is no\n expectation that "__str__()" return a valid Python expression: a\n more convenient or concise representation can be used.\n\n The default implementation defined by the built-in type "object"\n calls "object.__repr__()".\n\nobject.__bytes__(self)\n\n Called by "bytes()" to compute a byte-string representation of an\n object. This should return a "bytes" object.\n\nobject.__format__(self, format_spec)\n\n Called by the "format()" built-in function (and by extension, the\n "str.format()" method of class "str") to produce a "formatted"\n string representation of an object. The "format_spec" argument is a\n string that contains a description of the formatting options\n desired. The interpretation of the "format_spec" argument is up to\n the type implementing "__format__()", however most classes will\n either delegate formatting to one of the built-in types, or use a\n similar formatting option syntax.\n\n See *Format Specification Mini-Language* for a description of the\n standard formatting syntax.\n\n The return value must be a string object.\n\n Changed in version 3.4: The __format__ method of "object" itself\n raises a "TypeError" if passed any non-empty string.\n\nobject.__lt__(self, other)\nobject.__le__(self, other)\nobject.__eq__(self, other)\nobject.__ne__(self, other)\nobject.__gt__(self, other)\nobject.__ge__(self, other)\n\n These are the so-called "rich comparison" methods. The\n correspondence between operator symbols and method names is as\n follows: "xy" calls\n "x.__gt__(y)", and "x>=y" calls "x.__ge__(y)".\n\n A rich comparison method may return the singleton "NotImplemented"\n if it does not implement the operation for a given pair of\n arguments. By convention, "False" and "True" are returned for a\n successful comparison. However, these methods can return any value,\n so if the comparison operator is used in a Boolean context (e.g.,\n in the condition of an "if" statement), Python will call "bool()"\n on the value to determine if the result is true or false.\n\n There are no implied relationships among the comparison operators.\n The truth of "x==y" does not imply that "x!=y" is false.\n Accordingly, when defining "__eq__()", one should also define\n "__ne__()" so that the operators will behave as expected. See the\n paragraph on "__hash__()" for some important notes on creating\n *hashable* objects which support custom comparison operations and\n are usable as dictionary keys.\n\n There are no swapped-argument versions of these methods (to be used\n when the left argument does not support the operation but the right\n argument does); rather, "__lt__()" and "__gt__()" are each other\'s\n reflection, "__le__()" and "__ge__()" are each other\'s reflection,\n and "__eq__()" and "__ne__()" are their own reflection.\n\n Arguments to rich comparison methods are never coerced.\n\n To automatically generate ordering operations from a single root\n operation, see "functools.total_ordering()".\n\nobject.__hash__(self)\n\n Called by built-in function "hash()" and for operations on members\n of hashed collections including "set", "frozenset", and "dict".\n "__hash__()" should return an integer. The only required property\n is that objects which compare equal have the same hash value; it is\n advised to somehow mix together (e.g. using exclusive or) the hash\n values for the components of the object that also play a part in\n comparison of objects.\n\n Note: "hash()" truncates the value returned from an object\'s\n custom "__hash__()" method to the size of a "Py_ssize_t". This\n is typically 8 bytes on 64-bit builds and 4 bytes on 32-bit\n builds. If an object\'s "__hash__()" must interoperate on builds\n of different bit sizes, be sure to check the width on all\n supported builds. An easy way to do this is with "python -c\n "import sys; print(sys.hash_info.width)""\n\n If a class does not define an "__eq__()" method it should not\n define a "__hash__()" operation either; if it defines "__eq__()"\n but not "__hash__()", its instances will not be usable as items in\n hashable collections. If a class defines mutable objects and\n implements an "__eq__()" method, it should not implement\n "__hash__()", since the implementation of hashable collections\n requires that a key\'s hash value is immutable (if the object\'s hash\n value changes, it will be in the wrong hash bucket).\n\n User-defined classes have "__eq__()" and "__hash__()" methods by\n default; with them, all objects compare unequal (except with\n themselves) and "x.__hash__()" returns an appropriate value such\n that "x == y" implies both that "x is y" and "hash(x) == hash(y)".\n\n A class that overrides "__eq__()" and does not define "__hash__()"\n will have its "__hash__()" implicitly set to "None". When the\n "__hash__()" method of a class is "None", instances of the class\n will raise an appropriate "TypeError" when a program attempts to\n retrieve their hash value, and will also be correctly identified as\n unhashable when checking "isinstance(obj, collections.Hashable").\n\n If a class that overrides "__eq__()" needs to retain the\n implementation of "__hash__()" from a parent class, the interpreter\n must be told this explicitly by setting "__hash__ =\n .__hash__".\n\n If a class that does not override "__eq__()" wishes to suppress\n hash support, it should include "__hash__ = None" in the class\n definition. A class which defines its own "__hash__()" that\n explicitly raises a "TypeError" would be incorrectly identified as\n hashable by an "isinstance(obj, collections.Hashable)" call.\n\n Note: By default, the "__hash__()" values of str, bytes and\n datetime objects are "salted" with an unpredictable random value.\n Although they remain constant within an individual Python\n process, they are not predictable between repeated invocations of\n Python.This is intended to provide protection against a denial-\n of-service caused by carefully-chosen inputs that exploit the\n worst case performance of a dict insertion, O(n^2) complexity.\n See http://www.ocert.org/advisories/ocert-2011-003.html for\n details.Changing hash values affects the iteration order of\n dicts, sets and other mappings. Python has never made guarantees\n about this ordering (and it typically varies between 32-bit and\n 64-bit builds).See also "PYTHONHASHSEED".\n\n Changed in version 3.3: Hash randomization is enabled by default.\n\nobject.__bool__(self)\n\n Called to implement truth value testing and the built-in operation\n "bool()"; should return "False" or "True". When this method is not\n defined, "__len__()" is called, if it is defined, and the object is\n considered true if its result is nonzero. If a class defines\n neither "__len__()" nor "__bool__()", all its instances are\n considered true.\n\n\nCustomizing attribute access\n============================\n\nThe following methods can be defined to customize the meaning of\nattribute access (use of, assignment to, or deletion of "x.name") for\nclass instances.\n\nobject.__getattr__(self, name)\n\n Called when an attribute lookup has not found the attribute in the\n usual places (i.e. it is not an instance attribute nor is it found\n in the class tree for "self"). "name" is the attribute name. This\n method should return the (computed) attribute value or raise an\n "AttributeError" exception.\n\n Note that if the attribute is found through the normal mechanism,\n "__getattr__()" is not called. (This is an intentional asymmetry\n between "__getattr__()" and "__setattr__()".) This is done both for\n efficiency reasons and because otherwise "__getattr__()" would have\n no way to access other attributes of the instance. Note that at\n least for instance variables, you can fake total control by not\n inserting any values in the instance attribute dictionary (but\n instead inserting them in another object). See the\n "__getattribute__()" method below for a way to actually get total\n control over attribute access.\n\nobject.__getattribute__(self, name)\n\n Called unconditionally to implement attribute accesses for\n instances of the class. If the class also defines "__getattr__()",\n the latter will not be called unless "__getattribute__()" either\n calls it explicitly or raises an "AttributeError". This method\n should return the (computed) attribute value or raise an\n "AttributeError" exception. In order to avoid infinite recursion in\n this method, its implementation should always call the base class\n method with the same name to access any attributes it needs, for\n example, "object.__getattribute__(self, name)".\n\n Note: This method may still be bypassed when looking up special\n methods as the result of implicit invocation via language syntax\n or built-in functions. See *Special method lookup*.\n\nobject.__setattr__(self, name, value)\n\n Called when an attribute assignment is attempted. This is called\n instead of the normal mechanism (i.e. store the value in the\n instance dictionary). *name* is the attribute name, *value* is the\n value to be assigned to it.\n\n If "__setattr__()" wants to assign to an instance attribute, it\n should call the base class method with the same name, for example,\n "object.__setattr__(self, name, value)".\n\nobject.__delattr__(self, name)\n\n Like "__setattr__()" but for attribute deletion instead of\n assignment. This should only be implemented if "del obj.name" is\n meaningful for the object.\n\nobject.__dir__(self)\n\n Called when "dir()" is called on the object. A sequence must be\n returned. "dir()" converts the returned sequence to a list and\n sorts it.\n\n\nImplementing Descriptors\n------------------------\n\nThe following methods only apply when an instance of the class\ncontaining the method (a so-called *descriptor* class) appears in an\n*owner* class (the descriptor must be in either the owner\'s class\ndictionary or in the class dictionary for one of its parents). In the\nexamples below, "the attribute" refers to the attribute whose name is\nthe key of the property in the owner class\' "__dict__".\n\nobject.__get__(self, instance, owner)\n\n Called to get the attribute of the owner class (class attribute\n access) or of an instance of that class (instance attribute\n access). *owner* is always the owner class, while *instance* is the\n instance that the attribute was accessed through, or "None" when\n the attribute is accessed through the *owner*. This method should\n return the (computed) attribute value or raise an "AttributeError"\n exception.\n\nobject.__set__(self, instance, value)\n\n Called to set the attribute on an instance *instance* of the owner\n class to a new value, *value*.\n\nobject.__delete__(self, instance)\n\n Called to delete the attribute on an instance *instance* of the\n owner class.\n\nThe attribute "__objclass__" is interpreted by the "inspect" module as\nspecifying the class where this object was defined (setting this\nappropriately can assist in runtime introspection of dynamic class\nattributes). For callables, it may indicate that an instance of the\ngiven type (or a subclass) is expected or required as the first\npositional argument (for example, CPython sets this attribute for\nunbound methods that are implemented in C).\n\n\nInvoking Descriptors\n--------------------\n\nIn general, a descriptor is an object attribute with "binding\nbehavior", one whose attribute access has been overridden by methods\nin the descriptor protocol: "__get__()", "__set__()", and\n"__delete__()". If any of those methods are defined for an object, it\nis said to be a descriptor.\n\nThe default behavior for attribute access is to get, set, or delete\nthe attribute from an object\'s dictionary. For instance, "a.x" has a\nlookup chain starting with "a.__dict__[\'x\']", then\n"type(a).__dict__[\'x\']", and continuing through the base classes of\n"type(a)" excluding metaclasses.\n\nHowever, if the looked-up value is an object defining one of the\ndescriptor methods, then Python may override the default behavior and\ninvoke the descriptor method instead. Where this occurs in the\nprecedence chain depends on which descriptor methods were defined and\nhow they were called.\n\nThe starting point for descriptor invocation is a binding, "a.x". How\nthe arguments are assembled depends on "a":\n\nDirect Call\n The simplest and least common call is when user code directly\n invokes a descriptor method: "x.__get__(a)".\n\nInstance Binding\n If binding to an object instance, "a.x" is transformed into the\n call: "type(a).__dict__[\'x\'].__get__(a, type(a))".\n\nClass Binding\n If binding to a class, "A.x" is transformed into the call:\n "A.__dict__[\'x\'].__get__(None, A)".\n\nSuper Binding\n If "a" is an instance of "super", then the binding "super(B,\n obj).m()" searches "obj.__class__.__mro__" for the base class "A"\n immediately preceding "B" and then invokes the descriptor with the\n call: "A.__dict__[\'m\'].__get__(obj, obj.__class__)".\n\nFor instance bindings, the precedence of descriptor invocation depends\non the which descriptor methods are defined. A descriptor can define\nany combination of "__get__()", "__set__()" and "__delete__()". If it\ndoes not define "__get__()", then accessing the attribute will return\nthe descriptor object itself unless there is a value in the object\'s\ninstance dictionary. If the descriptor defines "__set__()" and/or\n"__delete__()", it is a data descriptor; if it defines neither, it is\na non-data descriptor. Normally, data descriptors define both\n"__get__()" and "__set__()", while non-data descriptors have just the\n"__get__()" method. Data descriptors with "__set__()" and "__get__()"\ndefined always override a redefinition in an instance dictionary. In\ncontrast, non-data descriptors can be overridden by instances.\n\nPython methods (including "staticmethod()" and "classmethod()") are\nimplemented as non-data descriptors. Accordingly, instances can\nredefine and override methods. This allows individual instances to\nacquire behaviors that differ from other instances of the same class.\n\nThe "property()" function is implemented as a data descriptor.\nAccordingly, instances cannot override the behavior of a property.\n\n\n__slots__\n---------\n\nBy default, instances of classes have a dictionary for attribute\nstorage. This wastes space for objects having very few instance\nvariables. The space consumption can become acute when creating large\nnumbers of instances.\n\nThe default can be overridden by defining *__slots__* in a class\ndefinition. The *__slots__* declaration takes a sequence of instance\nvariables and reserves just enough space in each instance to hold a\nvalue for each variable. Space is saved because *__dict__* is not\ncreated for each instance.\n\nobject.__slots__\n\n This class variable can be assigned a string, iterable, or sequence\n of strings with variable names used by instances. If defined in a\n class, *__slots__* reserves space for the declared variables and\n prevents the automatic creation of *__dict__* and *__weakref__* for\n each instance.\n\n\nNotes on using *__slots__*\n~~~~~~~~~~~~~~~~~~~~~~~~~~\n\n* When inheriting from a class without *__slots__*, the *__dict__*\n attribute of that class will always be accessible, so a *__slots__*\n definition in the subclass is meaningless.\n\n* Without a *__dict__* variable, instances cannot be assigned new\n variables not listed in the *__slots__* definition. Attempts to\n assign to an unlisted variable name raises "AttributeError". If\n dynamic assignment of new variables is desired, then add\n "\'__dict__\'" to the sequence of strings in the *__slots__*\n declaration.\n\n* Without a *__weakref__* variable for each instance, classes\n defining *__slots__* do not support weak references to its\n instances. If weak reference support is needed, then add\n "\'__weakref__\'" to the sequence of strings in the *__slots__*\n declaration.\n\n* *__slots__* are implemented at the class level by creating\n descriptors (*Implementing Descriptors*) for each variable name. As\n a result, class attributes cannot be used to set default values for\n instance variables defined by *__slots__*; otherwise, the class\n attribute would overwrite the descriptor assignment.\n\n* The action of a *__slots__* declaration is limited to the class\n where it is defined. As a result, subclasses will have a *__dict__*\n unless they also define *__slots__* (which must only contain names\n of any *additional* slots).\n\n* If a class defines a slot also defined in a base class, the\n instance variable defined by the base class slot is inaccessible\n (except by retrieving its descriptor directly from the base class).\n This renders the meaning of the program undefined. In the future, a\n check may be added to prevent this.\n\n* Nonempty *__slots__* does not work for classes derived from\n "variable-length" built-in types such as "int", "bytes" and "tuple".\n\n* Any non-string iterable may be assigned to *__slots__*. Mappings\n may also be used; however, in the future, special meaning may be\n assigned to the values corresponding to each key.\n\n* *__class__* assignment works only if both classes have the same\n *__slots__*.\n\n\nCustomizing class creation\n==========================\n\nBy default, classes are constructed using "type()". The class body is\nexecuted in a new namespace and the class name is bound locally to the\nresult of "type(name, bases, namespace)".\n\nThe class creation process can be customised by passing the\n"metaclass" keyword argument in the class definition line, or by\ninheriting from an existing class that included such an argument. In\nthe following example, both "MyClass" and "MySubclass" are instances\nof "Meta":\n\n class Meta(type):\n pass\n\n class MyClass(metaclass=Meta):\n pass\n\n class MySubclass(MyClass):\n pass\n\nAny other keyword arguments that are specified in the class definition\nare passed through to all metaclass operations described below.\n\nWhen a class definition is executed, the following steps occur:\n\n* the appropriate metaclass is determined\n\n* the class namespace is prepared\n\n* the class body is executed\n\n* the class object is created\n\n\nDetermining the appropriate metaclass\n-------------------------------------\n\nThe appropriate metaclass for a class definition is determined as\nfollows:\n\n* if no bases and no explicit metaclass are given, then "type()" is\n used\n\n* if an explicit metaclass is given and it is *not* an instance of\n "type()", then it is used directly as the metaclass\n\n* if an instance of "type()" is given as the explicit metaclass, or\n bases are defined, then the most derived metaclass is used\n\nThe most derived metaclass is selected from the explicitly specified\nmetaclass (if any) and the metaclasses (i.e. "type(cls)") of all\nspecified base classes. The most derived metaclass is one which is a\nsubtype of *all* of these candidate metaclasses. If none of the\ncandidate metaclasses meets that criterion, then the class definition\nwill fail with "TypeError".\n\n\nPreparing the class namespace\n-----------------------------\n\nOnce the appropriate metaclass has been identified, then the class\nnamespace is prepared. If the metaclass has a "__prepare__" attribute,\nit is called as "namespace = metaclass.__prepare__(name, bases,\n**kwds)" (where the additional keyword arguments, if any, come from\nthe class definition).\n\nIf the metaclass has no "__prepare__" attribute, then the class\nnamespace is initialised as an empty "dict()" instance.\n\nSee also: **PEP 3115** - Metaclasses in Python 3000\n\n Introduced the "__prepare__" namespace hook\n\n\nExecuting the class body\n------------------------\n\nThe class body is executed (approximately) as "exec(body, globals(),\nnamespace)". The key difference from a normal call to "exec()" is that\nlexical scoping allows the class body (including any methods) to\nreference names from the current and outer scopes when the class\ndefinition occurs inside a function.\n\nHowever, even when the class definition occurs inside the function,\nmethods defined inside the class still cannot see names defined at the\nclass scope. Class variables must be accessed through the first\nparameter of instance or class methods, and cannot be accessed at all\nfrom static methods.\n\n\nCreating the class object\n-------------------------\n\nOnce the class namespace has been populated by executing the class\nbody, the class object is created by calling "metaclass(name, bases,\nnamespace, **kwds)" (the additional keywords passed here are the same\nas those passed to "__prepare__").\n\nThis class object is the one that will be referenced by the zero-\nargument form of "super()". "__class__" is an implicit closure\nreference created by the compiler if any methods in a class body refer\nto either "__class__" or "super". This allows the zero argument form\nof "super()" to correctly identify the class being defined based on\nlexical scoping, while the class or instance that was used to make the\ncurrent call is identified based on the first argument passed to the\nmethod.\n\nAfter the class object is created, it is passed to the class\ndecorators included in the class definition (if any) and the resulting\nobject is bound in the local namespace as the defined class.\n\nSee also: **PEP 3135** - New super\n\n Describes the implicit "__class__" closure reference\n\n\nMetaclass example\n-----------------\n\nThe potential uses for metaclasses are boundless. Some ideas that have\nbeen explored include logging, interface checking, automatic\ndelegation, automatic property creation, proxies, frameworks, and\nautomatic resource locking/synchronization.\n\nHere is an example of a metaclass that uses an\n"collections.OrderedDict" to remember the order that class variables\nare defined:\n\n class OrderedClass(type):\n\n @classmethod\n def __prepare__(metacls, name, bases, **kwds):\n return collections.OrderedDict()\n\n def __new__(cls, name, bases, namespace, **kwds):\n result = type.__new__(cls, name, bases, dict(namespace))\n result.members = tuple(namespace)\n return result\n\n class A(metaclass=OrderedClass):\n def one(self): pass\n def two(self): pass\n def three(self): pass\n def four(self): pass\n\n >>> A.members\n (\'__module__\', \'one\', \'two\', \'three\', \'four\')\n\nWhen the class definition for *A* gets executed, the process begins\nwith calling the metaclass\'s "__prepare__()" method which returns an\nempty "collections.OrderedDict". That mapping records the methods and\nattributes of *A* as they are defined within the body of the class\nstatement. Once those definitions are executed, the ordered dictionary\nis fully populated and the metaclass\'s "__new__()" method gets\ninvoked. That method builds the new type and it saves the ordered\ndictionary keys in an attribute called "members".\n\n\nCustomizing instance and subclass checks\n========================================\n\nThe following methods are used to override the default behavior of the\n"isinstance()" and "issubclass()" built-in functions.\n\nIn particular, the metaclass "abc.ABCMeta" implements these methods in\norder to allow the addition of Abstract Base Classes (ABCs) as\n"virtual base classes" to any class or type (including built-in\ntypes), including other ABCs.\n\nclass.__instancecheck__(self, instance)\n\n Return true if *instance* should be considered a (direct or\n indirect) instance of *class*. If defined, called to implement\n "isinstance(instance, class)".\n\nclass.__subclasscheck__(self, subclass)\n\n Return true if *subclass* should be considered a (direct or\n indirect) subclass of *class*. If defined, called to implement\n "issubclass(subclass, class)".\n\nNote that these methods are looked up on the type (metaclass) of a\nclass. They cannot be defined as class methods in the actual class.\nThis is consistent with the lookup of special methods that are called\non instances, only in this case the instance is itself a class.\n\nSee also: **PEP 3119** - Introducing Abstract Base Classes\n\n Includes the specification for customizing "isinstance()" and\n "issubclass()" behavior through "__instancecheck__()" and\n "__subclasscheck__()", with motivation for this functionality in\n the context of adding Abstract Base Classes (see the "abc"\n module) to the language.\n\n\nEmulating callable objects\n==========================\n\nobject.__call__(self[, args...])\n\n Called when the instance is "called" as a function; if this method\n is defined, "x(arg1, arg2, ...)" is a shorthand for\n "x.__call__(arg1, arg2, ...)".\n\n\nEmulating container types\n=========================\n\nThe following methods can be defined to implement container objects.\nContainers usually are sequences (such as lists or tuples) or mappings\n(like dictionaries), but can represent other containers as well. The\nfirst set of methods is used either to emulate a sequence or to\nemulate a mapping; the difference is that for a sequence, the\nallowable keys should be the integers *k* for which "0 <= k < N" where\n*N* is the length of the sequence, or slice objects, which define a\nrange of items. It is also recommended that mappings provide the\nmethods "keys()", "values()", "items()", "get()", "clear()",\n"setdefault()", "pop()", "popitem()", "copy()", and "update()"\nbehaving similar to those for Python\'s standard dictionary objects.\nThe "collections" module provides a "MutableMapping" abstract base\nclass to help create those methods from a base set of "__getitem__()",\n"__setitem__()", "__delitem__()", and "keys()". Mutable sequences\nshould provide methods "append()", "count()", "index()", "extend()",\n"insert()", "pop()", "remove()", "reverse()" and "sort()", like Python\nstandard list objects. Finally, sequence types should implement\naddition (meaning concatenation) and multiplication (meaning\nrepetition) by defining the methods "__add__()", "__radd__()",\n"__iadd__()", "__mul__()", "__rmul__()" and "__imul__()" described\nbelow; they should not define other numerical operators. It is\nrecommended that both mappings and sequences implement the\n"__contains__()" method to allow efficient use of the "in" operator;\nfor mappings, "in" should search the mapping\'s keys; for sequences, it\nshould search through the values. It is further recommended that both\nmappings and sequences implement the "__iter__()" method to allow\nefficient iteration through the container; for mappings, "__iter__()"\nshould be the same as "keys()"; for sequences, it should iterate\nthrough the values.\n\nobject.__len__(self)\n\n Called to implement the built-in function "len()". Should return\n the length of the object, an integer ">=" 0. Also, an object that\n doesn\'t define a "__bool__()" method and whose "__len__()" method\n returns zero is considered to be false in a Boolean context.\n\nobject.__length_hint__(self)\n\n Called to implement "operator.length_hint()". Should return an\n estimated length for the object (which may be greater or less than\n the actual length). The length must be an integer ">=" 0. This\n method is purely an optimization and is never required for\n correctness.\n\n New in version 3.4.\n\nNote: Slicing is done exclusively with the following three methods.\n A call like\n\n a[1:2] = b\n\n is translated to\n\n a[slice(1, 2, None)] = b\n\n and so forth. Missing slice items are always filled in with "None".\n\nobject.__getitem__(self, key)\n\n Called to implement evaluation of "self[key]". For sequence types,\n the accepted keys should be integers and slice objects. Note that\n the special interpretation of negative indexes (if the class wishes\n to emulate a sequence type) is up to the "__getitem__()" method. If\n *key* is of an inappropriate type, "TypeError" may be raised; if of\n a value outside the set of indexes for the sequence (after any\n special interpretation of negative values), "IndexError" should be\n raised. For mapping types, if *key* is missing (not in the\n container), "KeyError" should be raised.\n\n Note: "for" loops expect that an "IndexError" will be raised for\n illegal indexes to allow proper detection of the end of the\n sequence.\n\nobject.__setitem__(self, key, value)\n\n Called to implement assignment to "self[key]". Same note as for\n "__getitem__()". This should only be implemented for mappings if\n the objects support changes to the values for keys, or if new keys\n can be added, or for sequences if elements can be replaced. The\n same exceptions should be raised for improper *key* values as for\n the "__getitem__()" method.\n\nobject.__delitem__(self, key)\n\n Called to implement deletion of "self[key]". Same note as for\n "__getitem__()". This should only be implemented for mappings if\n the objects support removal of keys, or for sequences if elements\n can be removed from the sequence. The same exceptions should be\n raised for improper *key* values as for the "__getitem__()" method.\n\nobject.__iter__(self)\n\n This method is called when an iterator is required for a container.\n This method should return a new iterator object that can iterate\n over all the objects in the container. For mappings, it should\n iterate over the keys of the container, and should also be made\n available as the method "keys()".\n\n Iterator objects also need to implement this method; they are\n required to return themselves. For more information on iterator\n objects, see *Iterator Types*.\n\nobject.__reversed__(self)\n\n Called (if present) by the "reversed()" built-in to implement\n reverse iteration. It should return a new iterator object that\n iterates over all the objects in the container in reverse order.\n\n If the "__reversed__()" method is not provided, the "reversed()"\n built-in will fall back to using the sequence protocol ("__len__()"\n and "__getitem__()"). Objects that support the sequence protocol\n should only provide "__reversed__()" if they can provide an\n implementation that is more efficient than the one provided by\n "reversed()".\n\nThe membership test operators ("in" and "not in") are normally\nimplemented as an iteration through a sequence. However, container\nobjects can supply the following special method with a more efficient\nimplementation, which also does not require the object be a sequence.\n\nobject.__contains__(self, item)\n\n Called to implement membership test operators. Should return true\n if *item* is in *self*, false otherwise. For mapping objects, this\n should consider the keys of the mapping rather than the values or\n the key-item pairs.\n\n For objects that don\'t define "__contains__()", the membership test\n first tries iteration via "__iter__()", then the old sequence\n iteration protocol via "__getitem__()", see *this section in the\n language reference*.\n\n\nEmulating numeric types\n=======================\n\nThe following methods can be defined to emulate numeric objects.\nMethods corresponding to operations that are not supported by the\nparticular kind of number implemented (e.g., bitwise operations for\nnon-integral numbers) should be left undefined.\n\nobject.__add__(self, other)\nobject.__sub__(self, other)\nobject.__mul__(self, other)\nobject.__truediv__(self, other)\nobject.__floordiv__(self, other)\nobject.__mod__(self, other)\nobject.__divmod__(self, other)\nobject.__pow__(self, other[, modulo])\nobject.__lshift__(self, other)\nobject.__rshift__(self, other)\nobject.__and__(self, other)\nobject.__xor__(self, other)\nobject.__or__(self, other)\n\n These methods are called to implement the binary arithmetic\n operations ("+", "-", "*", "/", "//", "%", "divmod()", "pow()",\n "**", "<<", ">>", "&", "^", "|"). For instance, to evaluate the\n expression "x + y", where *x* is an instance of a class that has an\n "__add__()" method, "x.__add__(y)" is called. The "__divmod__()"\n method should be the equivalent to using "__floordiv__()" and\n "__mod__()"; it should not be related to "__truediv__()". Note\n that "__pow__()" should be defined to accept an optional third\n argument if the ternary version of the built-in "pow()" function is\n to be supported.\n\n If one of those methods does not support the operation with the\n supplied arguments, it should return "NotImplemented".\n\nobject.__radd__(self, other)\nobject.__rsub__(self, other)\nobject.__rmul__(self, other)\nobject.__rtruediv__(self, other)\nobject.__rfloordiv__(self, other)\nobject.__rmod__(self, other)\nobject.__rdivmod__(self, other)\nobject.__rpow__(self, other)\nobject.__rlshift__(self, other)\nobject.__rrshift__(self, other)\nobject.__rand__(self, other)\nobject.__rxor__(self, other)\nobject.__ror__(self, other)\n\n These methods are called to implement the binary arithmetic\n operations ("+", "-", "*", "/", "//", "%", "divmod()", "pow()",\n "**", "<<", ">>", "&", "^", "|") with reflected (swapped) operands.\n These functions are only called if the left operand does not\n support the corresponding operation and the operands are of\n different types. [2] For instance, to evaluate the expression "x -\n y", where *y* is an instance of a class that has an "__rsub__()"\n method, "y.__rsub__(x)" is called if "x.__sub__(y)" returns\n *NotImplemented*.\n\n Note that ternary "pow()" will not try calling "__rpow__()" (the\n coercion rules would become too complicated).\n\n Note: If the right operand\'s type is a subclass of the left\n operand\'s type and that subclass provides the reflected method\n for the operation, this method will be called before the left\n operand\'s non-reflected method. This behavior allows subclasses\n to override their ancestors\' operations.\n\nobject.__iadd__(self, other)\nobject.__isub__(self, other)\nobject.__imul__(self, other)\nobject.__itruediv__(self, other)\nobject.__ifloordiv__(self, other)\nobject.__imod__(self, other)\nobject.__ipow__(self, other[, modulo])\nobject.__ilshift__(self, other)\nobject.__irshift__(self, other)\nobject.__iand__(self, other)\nobject.__ixor__(self, other)\nobject.__ior__(self, other)\n\n These methods are called to implement the augmented arithmetic\n assignments ("+=", "-=", "*=", "/=", "//=", "%=", "**=", "<<=",\n ">>=", "&=", "^=", "|="). These methods should attempt to do the\n operation in-place (modifying *self*) and return the result (which\n could be, but does not have to be, *self*). If a specific method\n is not defined, the augmented assignment falls back to the normal\n methods. For instance, if *x* is an instance of a class with an\n "__iadd__()" method, "x += y" is equivalent to "x = x.__iadd__(y)"\n . Otherwise, "x.__add__(y)" and "y.__radd__(x)" are considered, as\n with the evaluation of "x + y". In certain situations, augmented\n assignment can result in unexpected errors (see *Why does\n a_tuple[i] += [\'item\'] raise an exception when the addition\n works?*), but this behavior is in fact part of the data model.\n\nobject.__neg__(self)\nobject.__pos__(self)\nobject.__abs__(self)\nobject.__invert__(self)\n\n Called to implement the unary arithmetic operations ("-", "+",\n "abs()" and "~").\n\nobject.__complex__(self)\nobject.__int__(self)\nobject.__float__(self)\nobject.__round__(self[, n])\n\n Called to implement the built-in functions "complex()", "int()",\n "float()" and "round()". Should return a value of the appropriate\n type.\n\nobject.__index__(self)\n\n Called to implement "operator.index()", and whenever Python needs\n to losslessly convert the numeric object to an integer object (such\n as in slicing, or in the built-in "bin()", "hex()" and "oct()"\n functions). Presence of this method indicates that the numeric\n object is an integer type. Must return an integer.\n\n Note: In order to have a coherent integer type class, when\n "__index__()" is defined "__int__()" should also be defined, and\n both should return the same value.\n\n\nWith Statement Context Managers\n===============================\n\nA *context manager* is an object that defines the runtime context to\nbe established when executing a "with" statement. The context manager\nhandles the entry into, and the exit from, the desired runtime context\nfor the execution of the block of code. Context managers are normally\ninvoked using the "with" statement (described in section *The with\nstatement*), but can also be used by directly invoking their methods.\n\nTypical uses of context managers include saving and restoring various\nkinds of global state, locking and unlocking resources, closing opened\nfiles, etc.\n\nFor more information on context managers, see *Context Manager Types*.\n\nobject.__enter__(self)\n\n Enter the runtime context related to this object. The "with"\n statement will bind this method\'s return value to the target(s)\n specified in the "as" clause of the statement, if any.\n\nobject.__exit__(self, exc_type, exc_value, traceback)\n\n Exit the runtime context related to this object. The parameters\n describe the exception that caused the context to be exited. If the\n context was exited without an exception, all three arguments will\n be "None".\n\n If an exception is supplied, and the method wishes to suppress the\n exception (i.e., prevent it from being propagated), it should\n return a true value. Otherwise, the exception will be processed\n normally upon exit from this method.\n\n Note that "__exit__()" methods should not reraise the passed-in\n exception; this is the caller\'s responsibility.\n\nSee also: **PEP 0343** - The "with" statement\n\n The specification, background, and examples for the Python "with"\n statement.\n\n\nSpecial method lookup\n=====================\n\nFor custom classes, implicit invocations of special methods are only\nguaranteed to work correctly if defined on an object\'s type, not in\nthe object\'s instance dictionary. That behaviour is the reason why\nthe following code raises an exception:\n\n >>> class C:\n ... pass\n ...\n >>> c = C()\n >>> c.__len__ = lambda: 5\n >>> len(c)\n Traceback (most recent call last):\n File "", line 1, in \n TypeError: object of type \'C\' has no len()\n\nThe rationale behind this behaviour lies with a number of special\nmethods such as "__hash__()" and "__repr__()" that are implemented by\nall objects, including type objects. If the implicit lookup of these\nmethods used the conventional lookup process, they would fail when\ninvoked on the type object itself:\n\n >>> 1 .__hash__() == hash(1)\n True\n >>> int.__hash__() == hash(int)\n Traceback (most recent call last):\n File "", line 1, in \n TypeError: descriptor \'__hash__\' of \'int\' object needs an argument\n\nIncorrectly attempting to invoke an unbound method of a class in this\nway is sometimes referred to as \'metaclass confusion\', and is avoided\nby bypassing the instance when looking up special methods:\n\n >>> type(1).__hash__(1) == hash(1)\n True\n >>> type(int).__hash__(int) == hash(int)\n True\n\nIn addition to bypassing any instance attributes in the interest of\ncorrectness, implicit special method lookup generally also bypasses\nthe "__getattribute__()" method even of the object\'s metaclass:\n\n >>> class Meta(type):\n ... def __getattribute__(*args):\n ... print("Metaclass getattribute invoked")\n ... return type.__getattribute__(*args)\n ...\n >>> class C(object, metaclass=Meta):\n ... def __len__(self):\n ... return 10\n ... def __getattribute__(*args):\n ... print("Class getattribute invoked")\n ... return object.__getattribute__(*args)\n ...\n >>> c = C()\n >>> c.__len__() # Explicit lookup via instance\n Class getattribute invoked\n 10\n >>> type(c).__len__(c) # Explicit lookup via type\n Metaclass getattribute invoked\n 10\n >>> len(c) # Implicit lookup\n 10\n\nBypassing the "__getattribute__()" machinery in this fashion provides\nsignificant scope for speed optimisations within the interpreter, at\nthe cost of some flexibility in the handling of special methods (the\nspecial method *must* be set on the class object itself in order to be\nconsistently invoked by the interpreter).\n\n-[ Footnotes ]-\n\n[1] It *is* possible in some cases to change an object\'s type,\n under certain controlled conditions. It generally isn\'t a good\n idea though, since it can lead to some very strange behaviour if\n it is handled incorrectly.\n\n[2] For operands of the same type, it is assumed that if the non-\n reflected method (such as "__add__()") fails the operation is not\n supported, which is why the reflected method is not called.\n', +- 'string-methods': b'\nString Methods\n**************\n\nStrings implement all of the *common* sequence operations, along with\nthe additional methods described below.\n\nStrings also support two styles of string formatting, one providing a\nlarge degree of flexibility and customization (see "str.format()",\n*Format String Syntax* and *String Formatting*) and the other based on\nC "printf" style formatting that handles a narrower range of types and\nis slightly harder to use correctly, but is often faster for the cases\nit can handle (*printf-style String Formatting*).\n\nThe *Text Processing Services* section of the standard library covers\na number of other modules that provide various text related utilities\n(including regular expression support in the "re" module).\n\nstr.capitalize()\n\n Return a copy of the string with its first character capitalized\n and the rest lowercased.\n\nstr.casefold()\n\n Return a casefolded copy of the string. Casefolded strings may be\n used for caseless matching.\n\n Casefolding is similar to lowercasing but more aggressive because\n it is intended to remove all case distinctions in a string. For\n example, the German lowercase letter "\'\xc3\x9f\'" is equivalent to ""ss"".\n Since it is already lowercase, "lower()" would do nothing to "\'\xc3\x9f\'";\n "casefold()" converts it to ""ss"".\n\n The casefolding algorithm is described in section 3.13 of the\n Unicode Standard.\n\n New in version 3.3.\n\nstr.center(width[, fillchar])\n\n Return centered in a string of length *width*. Padding is done\n using the specified *fillchar* (default is an ASCII space). The\n original string is returned if *width* is less than or equal to\n "len(s)".\n\nstr.count(sub[, start[, end]])\n\n Return the number of non-overlapping occurrences of substring *sub*\n in the range [*start*, *end*]. Optional arguments *start* and\n *end* are interpreted as in slice notation.\n\nstr.encode(encoding="utf-8", errors="strict")\n\n Return an encoded version of the string as a bytes object. Default\n encoding is "\'utf-8\'". *errors* may be given to set a different\n error handling scheme. The default for *errors* is "\'strict\'",\n meaning that encoding errors raise a "UnicodeError". Other possible\n values are "\'ignore\'", "\'replace\'", "\'xmlcharrefreplace\'",\n "\'backslashreplace\'" and any other name registered via\n "codecs.register_error()", see section *Codec Base Classes*. For a\n list of possible encodings, see section *Standard Encodings*.\n\n Changed in version 3.1: Support for keyword arguments added.\n\nstr.endswith(suffix[, start[, end]])\n\n Return "True" if the string ends with the specified *suffix*,\n otherwise return "False". *suffix* can also be a tuple of suffixes\n to look for. With optional *start*, test beginning at that\n position. With optional *end*, stop comparing at that position.\n\nstr.expandtabs(tabsize=8)\n\n Return a copy of the string where all tab characters are replaced\n by one or more spaces, depending on the current column and the\n given tab size. Tab positions occur every *tabsize* characters\n (default is 8, giving tab positions at columns 0, 8, 16 and so on).\n To expand the string, the current column is set to zero and the\n string is examined character by character. If the character is a\n tab ("\\t"), one or more space characters are inserted in the result\n until the current column is equal to the next tab position. (The\n tab character itself is not copied.) If the character is a newline\n ("\\n") or return ("\\r"), it is copied and the current column is\n reset to zero. Any other character is copied unchanged and the\n current column is incremented by one regardless of how the\n character is represented when printed.\n\n >>> \'01\\t012\\t0123\\t01234\'.expandtabs()\n \'01 012 0123 01234\'\n >>> \'01\\t012\\t0123\\t01234\'.expandtabs(4)\n \'01 012 0123 01234\'\n\nstr.find(sub[, start[, end]])\n\n Return the lowest index in the string where substring *sub* is\n found, such that *sub* is contained in the slice "s[start:end]".\n Optional arguments *start* and *end* are interpreted as in slice\n notation. Return "-1" if *sub* is not found.\n\n Note: The "find()" method should be used only if you need to know\n the position of *sub*. To check if *sub* is a substring or not,\n use the "in" operator:\n\n >>> \'Py\' in \'Python\'\n True\n\nstr.format(*args, **kwargs)\n\n Perform a string formatting operation. The string on which this\n method is called can contain literal text or replacement fields\n delimited by braces "{}". Each replacement field contains either\n the numeric index of a positional argument, or the name of a\n keyword argument. Returns a copy of the string where each\n replacement field is replaced with the string value of the\n corresponding argument.\n\n >>> "The sum of 1 + 2 is {0}".format(1+2)\n \'The sum of 1 + 2 is 3\'\n\n See *Format String Syntax* for a description of the various\n formatting options that can be specified in format strings.\n\nstr.format_map(mapping)\n\n Similar to "str.format(**mapping)", except that "mapping" is used\n directly and not copied to a "dict". This is useful if for example\n "mapping" is a dict subclass:\n\n >>> class Default(dict):\n ... def __missing__(self, key):\n ... return key\n ...\n >>> \'{name} was born in {country}\'.format_map(Default(name=\'Guido\'))\n \'Guido was born in country\'\n\n New in version 3.2.\n\nstr.index(sub[, start[, end]])\n\n Like "find()", but raise "ValueError" when the substring is not\n found.\n\nstr.isalnum()\n\n Return true if all characters in the string are alphanumeric and\n there is at least one character, false otherwise. A character "c"\n is alphanumeric if one of the following returns "True":\n "c.isalpha()", "c.isdecimal()", "c.isdigit()", or "c.isnumeric()".\n\nstr.isalpha()\n\n Return true if all characters in the string are alphabetic and\n there is at least one character, false otherwise. Alphabetic\n characters are those characters defined in the Unicode character\n database as "Letter", i.e., those with general category property\n being one of "Lm", "Lt", "Lu", "Ll", or "Lo". Note that this is\n different from the "Alphabetic" property defined in the Unicode\n Standard.\n\nstr.isdecimal()\n\n Return true if all characters in the string are decimal characters\n and there is at least one character, false otherwise. Decimal\n characters are those from general category "Nd". This category\n includes digit characters, and all characters that can be used to\n form decimal-radix numbers, e.g. U+0660, ARABIC-INDIC DIGIT ZERO.\n\nstr.isdigit()\n\n Return true if all characters in the string are digits and there is\n at least one character, false otherwise. Digits include decimal\n characters and digits that need special handling, such as the\n compatibility superscript digits. Formally, a digit is a character\n that has the property value Numeric_Type=Digit or\n Numeric_Type=Decimal.\n\nstr.isidentifier()\n\n Return true if the string is a valid identifier according to the\n language definition, section *Identifiers and keywords*.\n\n Use "keyword.iskeyword()" to test for reserved identifiers such as\n "def" and "class".\n\nstr.islower()\n\n Return true if all cased characters [4] in the string are lowercase\n and there is at least one cased character, false otherwise.\n\nstr.isnumeric()\n\n Return true if all characters in the string are numeric characters,\n and there is at least one character, false otherwise. Numeric\n characters include digit characters, and all characters that have\n the Unicode numeric value property, e.g. U+2155, VULGAR FRACTION\n ONE FIFTH. Formally, numeric characters are those with the\n property value Numeric_Type=Digit, Numeric_Type=Decimal or\n Numeric_Type=Numeric.\n\nstr.isprintable()\n\n Return true if all characters in the string are printable or the\n string is empty, false otherwise. Nonprintable characters are\n those characters defined in the Unicode character database as\n "Other" or "Separator", excepting the ASCII space (0x20) which is\n considered printable. (Note that printable characters in this\n context are those which should not be escaped when "repr()" is\n invoked on a string. It has no bearing on the handling of strings\n written to "sys.stdout" or "sys.stderr".)\n\nstr.isspace()\n\n Return true if there are only whitespace characters in the string\n and there is at least one character, false otherwise. Whitespace\n characters are those characters defined in the Unicode character\n database as "Other" or "Separator" and those with bidirectional\n property being one of "WS", "B", or "S".\n\nstr.istitle()\n\n Return true if the string is a titlecased string and there is at\n least one character, for example uppercase characters may only\n follow uncased characters and lowercase characters only cased ones.\n Return false otherwise.\n\nstr.isupper()\n\n Return true if all cased characters [4] in the string are uppercase\n and there is at least one cased character, false otherwise.\n\nstr.join(iterable)\n\n Return a string which is the concatenation of the strings in the\n *iterable* *iterable*. A "TypeError" will be raised if there are\n any non-string values in *iterable*, including "bytes" objects.\n The separator between elements is the string providing this method.\n\nstr.ljust(width[, fillchar])\n\n Return the string left justified in a string of length *width*.\n Padding is done using the specified *fillchar* (default is an ASCII\n space). The original string is returned if *width* is less than or\n equal to "len(s)".\n\nstr.lower()\n\n Return a copy of the string with all the cased characters [4]\n converted to lowercase.\n\n The lowercasing algorithm used is described in section 3.13 of the\n Unicode Standard.\n\nstr.lstrip([chars])\n\n Return a copy of the string with leading characters removed. The\n *chars* argument is a string specifying the set of characters to be\n removed. If omitted or "None", the *chars* argument defaults to\n removing whitespace. The *chars* argument is not a prefix; rather,\n all combinations of its values are stripped:\n\n >>> \' spacious \'.lstrip()\n \'spacious \'\n >>> \'www.example.com\'.lstrip(\'cmowz.\')\n \'example.com\'\n\nstatic str.maketrans(x[, y[, z]])\n\n This static method returns a translation table usable for\n "str.translate()".\n\n If there is only one argument, it must be a dictionary mapping\n Unicode ordinals (integers) or characters (strings of length 1) to\n Unicode ordinals, strings (of arbitrary lengths) or None.\n Character keys will then be converted to ordinals.\n\n If there are two arguments, they must be strings of equal length,\n and in the resulting dictionary, each character in x will be mapped\n to the character at the same position in y. If there is a third\n argument, it must be a string, whose characters will be mapped to\n None in the result.\n\nstr.partition(sep)\n\n Split the string at the first occurrence of *sep*, and return a\n 3-tuple containing the part before the separator, the separator\n itself, and the part after the separator. If the separator is not\n found, return a 3-tuple containing the string itself, followed by\n two empty strings.\n\nstr.replace(old, new[, count])\n\n Return a copy of the string with all occurrences of substring *old*\n replaced by *new*. If the optional argument *count* is given, only\n the first *count* occurrences are replaced.\n\nstr.rfind(sub[, start[, end]])\n\n Return the highest index in the string where substring *sub* is\n found, such that *sub* is contained within "s[start:end]".\n Optional arguments *start* and *end* are interpreted as in slice\n notation. Return "-1" on failure.\n\nstr.rindex(sub[, start[, end]])\n\n Like "rfind()" but raises "ValueError" when the substring *sub* is\n not found.\n\nstr.rjust(width[, fillchar])\n\n Return the string right justified in a string of length *width*.\n Padding is done using the specified *fillchar* (default is an ASCII\n space). The original string is returned if *width* is less than or\n equal to "len(s)".\n\nstr.rpartition(sep)\n\n Split the string at the last occurrence of *sep*, and return a\n 3-tuple containing the part before the separator, the separator\n itself, and the part after the separator. If the separator is not\n found, return a 3-tuple containing two empty strings, followed by\n the string itself.\n\nstr.rsplit(sep=None, maxsplit=-1)\n\n Return a list of the words in the string, using *sep* as the\n delimiter string. If *maxsplit* is given, at most *maxsplit* splits\n are done, the *rightmost* ones. If *sep* is not specified or\n "None", any whitespace string is a separator. Except for splitting\n from the right, "rsplit()" behaves like "split()" which is\n described in detail below.\n\nstr.rstrip([chars])\n\n Return a copy of the string with trailing characters removed. The\n *chars* argument is a string specifying the set of characters to be\n removed. If omitted or "None", the *chars* argument defaults to\n removing whitespace. The *chars* argument is not a suffix; rather,\n all combinations of its values are stripped:\n\n >>> \' spacious \'.rstrip()\n \' spacious\'\n >>> \'mississippi\'.rstrip(\'ipz\')\n \'mississ\'\n\nstr.split(sep=None, maxsplit=-1)\n\n Return a list of the words in the string, using *sep* as the\n delimiter string. If *maxsplit* is given, at most *maxsplit*\n splits are done (thus, the list will have at most "maxsplit+1"\n elements). If *maxsplit* is not specified or "-1", then there is\n no limit on the number of splits (all possible splits are made).\n\n If *sep* is given, consecutive delimiters are not grouped together\n and are deemed to delimit empty strings (for example,\n "\'1,,2\'.split(\',\')" returns "[\'1\', \'\', \'2\']"). The *sep* argument\n may consist of multiple characters (for example,\n "\'1<>2<>3\'.split(\'<>\')" returns "[\'1\', \'2\', \'3\']"). Splitting an\n empty string with a specified separator returns "[\'\']".\n\n For example:\n\n >>> \'1,2,3\'.split(\',\')\n [\'1\', \'2\', \'3\']\n >>> \'1,2,3\'.split(\',\', maxsplit=1)\n [\'1\', \'2 3\']\n >>> \'1,2,,3,\'.split(\',\')\n [\'1\', \'2\', \'\', \'3\', \'\']\n\n If *sep* is not specified or is "None", a different splitting\n algorithm is applied: runs of consecutive whitespace are regarded\n as a single separator, and the result will contain no empty strings\n at the start or end if the string has leading or trailing\n whitespace. Consequently, splitting an empty string or a string\n consisting of just whitespace with a "None" separator returns "[]".\n\n For example:\n\n >>> \'1 2 3\'.split()\n [\'1\', \'2\', \'3\']\n >>> \'1 2 3\'.split(maxsplit=1)\n [\'1\', \'2 3\']\n >>> \' 1 2 3 \'.split()\n [\'1\', \'2\', \'3\']\n\nstr.splitlines([keepends])\n\n Return a list of the lines in the string, breaking at line\n boundaries. This method uses the *universal newlines* approach to\n splitting lines. Line breaks are not included in the resulting list\n unless *keepends* is given and true.\n\n For example:\n\n >>> \'ab c\\n\\nde fg\\rkl\\r\\n\'.splitlines()\n [\'ab c\', \'\', \'de fg\', \'kl\']``\n >>> \'ab c\\n\\nde fg\\rkl\\r\\n\'.splitlines(keepends=True)\n [\'ab c\\n\', \'\\n\', \'de fg\\r\', \'kl\\r\\n\']\n\n Unlike "split()" when a delimiter string *sep* is given, this\n method returns an empty list for the empty string, and a terminal\n line break does not result in an extra line:\n\n >>> "".splitlines()\n []\n >>> "One line\\n".splitlines()\n [\'One line\']\n\n For comparison, "split(\'\\n\')" gives:\n\n >>> \'\'.split(\'\\n\')\n [\'\']\n >>> \'Two lines\\n\'.split(\'\\n\')\n [\'Two lines\', \'\']\n\nstr.startswith(prefix[, start[, end]])\n\n Return "True" if string starts with the *prefix*, otherwise return\n "False". *prefix* can also be a tuple of prefixes to look for.\n With optional *start*, test string beginning at that position.\n With optional *end*, stop comparing string at that position.\n\nstr.strip([chars])\n\n Return a copy of the string with the leading and trailing\n characters removed. The *chars* argument is a string specifying the\n set of characters to be removed. If omitted or "None", the *chars*\n argument defaults to removing whitespace. The *chars* argument is\n not a prefix or suffix; rather, all combinations of its values are\n stripped:\n\n >>> \' spacious \'.strip()\n \'spacious\'\n >>> \'www.example.com\'.strip(\'cmowz.\')\n \'example\'\n\nstr.swapcase()\n\n Return a copy of the string with uppercase characters converted to\n lowercase and vice versa. Note that it is not necessarily true that\n "s.swapcase().swapcase() == s".\n\nstr.title()\n\n Return a titlecased version of the string where words start with an\n uppercase character and the remaining characters are lowercase.\n\n For example:\n\n >>> \'Hello world\'.title()\n \'Hello World\'\n\n The algorithm uses a simple language-independent definition of a\n word as groups of consecutive letters. The definition works in\n many contexts but it means that apostrophes in contractions and\n possessives form word boundaries, which may not be the desired\n result:\n\n >>> "they\'re bill\'s friends from the UK".title()\n "They\'Re Bill\'S Friends From The Uk"\n\n A workaround for apostrophes can be constructed using regular\n expressions:\n\n >>> import re\n >>> def titlecase(s):\n ... return re.sub(r"[A-Za-z]+(\'[A-Za-z]+)?",\n ... lambda mo: mo.group(0)[0].upper() +\n ... mo.group(0)[1:].lower(),\n ... s)\n ...\n >>> titlecase("they\'re bill\'s friends.")\n "They\'re Bill\'s Friends."\n\nstr.translate(map)\n\n Return a copy of the *s* where all characters have been mapped\n through the *map* which must be a dictionary of Unicode ordinals\n (integers) to Unicode ordinals, strings or "None". Unmapped\n characters are left untouched. Characters mapped to "None" are\n deleted.\n\n You can use "str.maketrans()" to create a translation map from\n character-to-character mappings in different formats.\n\n Note: An even more flexible approach is to create a custom\n character mapping codec using the "codecs" module (see\n "encodings.cp1251" for an example).\n\nstr.upper()\n\n Return a copy of the string with all the cased characters [4]\n converted to uppercase. Note that "str.upper().isupper()" might be\n "False" if "s" contains uncased characters or if the Unicode\n category of the resulting character(s) is not "Lu" (Letter,\n uppercase), but e.g. "Lt" (Letter, titlecase).\n\n The uppercasing algorithm used is described in section 3.13 of the\n Unicode Standard.\n\nstr.zfill(width)\n\n Return a copy of the string left filled with ASCII "\'0\'" digits to\n make a string of length *width*. A leading sign prefix ("\'+\'"/"\'-\'"\n is handled by inserting the padding *after* the sign character\n rather than before. The original string is returned if *width* is\n less than or equal to "len(s)".\n\n For example:\n\n >>> "42".zfill(5)\n \'00042\'\n >>> "-42".zfill(5)\n \'-0042\'\n', +- 'strings': b'\nString and Bytes literals\n*************************\n\nString literals are described by the following lexical definitions:\n\n stringliteral ::= [stringprefix](shortstring | longstring)\n stringprefix ::= "r" | "u" | "R" | "U"\n shortstring ::= "\'" shortstringitem* "\'" | \'"\' shortstringitem* \'"\'\n longstring ::= "\'\'\'" longstringitem* "\'\'\'" | \'"""\' longstringitem* \'"""\'\n shortstringitem ::= shortstringchar | stringescapeseq\n longstringitem ::= longstringchar | stringescapeseq\n shortstringchar ::= \n longstringchar ::= \n stringescapeseq ::= "\\" \n\n bytesliteral ::= bytesprefix(shortbytes | longbytes)\n bytesprefix ::= "b" | "B" | "br" | "Br" | "bR" | "BR" | "rb" | "rB" | "Rb" | "RB"\n shortbytes ::= "\'" shortbytesitem* "\'" | \'"\' shortbytesitem* \'"\'\n longbytes ::= "\'\'\'" longbytesitem* "\'\'\'" | \'"""\' longbytesitem* \'"""\'\n shortbytesitem ::= shortbyteschar | bytesescapeseq\n longbytesitem ::= longbyteschar | bytesescapeseq\n shortbyteschar ::= \n longbyteschar ::= \n bytesescapeseq ::= "\\" \n\nOne syntactic restriction not indicated by these productions is that\nwhitespace is not allowed between the "stringprefix" or "bytesprefix"\nand the rest of the literal. The source character set is defined by\nthe encoding declaration; it is UTF-8 if no encoding declaration is\ngiven in the source file; see section *Encoding declarations*.\n\nIn plain English: Both types of literals can be enclosed in matching\nsingle quotes ("\'") or double quotes ("""). They can also be enclosed\nin matching groups of three single or double quotes (these are\ngenerally referred to as *triple-quoted strings*). The backslash\n("\\") character is used to escape characters that otherwise have a\nspecial meaning, such as newline, backslash itself, or the quote\ncharacter.\n\nBytes literals are always prefixed with "\'b\'" or "\'B\'"; they produce\nan instance of the "bytes" type instead of the "str" type. They may\nonly contain ASCII characters; bytes with a numeric value of 128 or\ngreater must be expressed with escapes.\n\nAs of Python 3.3 it is possible again to prefix unicode strings with a\n"u" prefix to simplify maintenance of dual 2.x and 3.x codebases.\n\nBoth string and bytes literals may optionally be prefixed with a\nletter "\'r\'" or "\'R\'"; such strings are called *raw strings* and treat\nbackslashes as literal characters. As a result, in string literals,\n"\'\\U\'" and "\'\\u\'" escapes in raw strings are not treated specially.\nGiven that Python 2.x\'s raw unicode literals behave differently than\nPython 3.x\'s the "\'ur\'" syntax is not supported.\n\n New in version 3.3: The "\'rb\'" prefix of raw bytes literals has\n been added as a synonym of "\'br\'".\n\n New in version 3.3: Support for the unicode legacy literal\n ("u\'value\'") was reintroduced to simplify the maintenance of dual\n Python 2.x and 3.x codebases. See **PEP 414** for more information.\n\nIn triple-quoted strings, unescaped newlines and quotes are allowed\n(and are retained), except that three unescaped quotes in a row\nterminate the string. (A "quote" is the character used to open the\nstring, i.e. either "\'" or """.)\n\nUnless an "\'r\'" or "\'R\'" prefix is present, escape sequences in\nstrings are interpreted according to rules similar to those used by\nStandard C. The recognized escape sequences are:\n\n+-------------------+-----------------------------------+---------+\n| Escape Sequence | Meaning | Notes |\n+===================+===================================+=========+\n| "\\newline" | Backslash and newline ignored | |\n+-------------------+-----------------------------------+---------+\n| "\\\\" | Backslash ("\\") | |\n+-------------------+-----------------------------------+---------+\n| "\\\'" | Single quote ("\'") | |\n+-------------------+-----------------------------------+---------+\n| "\\"" | Double quote (""") | |\n+-------------------+-----------------------------------+---------+\n| "\\a" | ASCII Bell (BEL) | |\n+-------------------+-----------------------------------+---------+\n| "\\b" | ASCII Backspace (BS) | |\n+-------------------+-----------------------------------+---------+\n| "\\f" | ASCII Formfeed (FF) | |\n+-------------------+-----------------------------------+---------+\n| "\\n" | ASCII Linefeed (LF) | |\n+-------------------+-----------------------------------+---------+\n| "\\r" | ASCII Carriage Return (CR) | |\n+-------------------+-----------------------------------+---------+\n| "\\t" | ASCII Horizontal Tab (TAB) | |\n+-------------------+-----------------------------------+---------+\n| "\\v" | ASCII Vertical Tab (VT) | |\n+-------------------+-----------------------------------+---------+\n| "\\ooo" | Character with octal value *ooo* | (1,3) |\n+-------------------+-----------------------------------+---------+\n| "\\xhh" | Character with hex value *hh* | (2,3) |\n+-------------------+-----------------------------------+---------+\n\nEscape sequences only recognized in string literals are:\n\n+-------------------+-----------------------------------+---------+\n| Escape Sequence | Meaning | Notes |\n+===================+===================================+=========+\n| "\\N{name}" | Character named *name* in the | (4) |\n| | Unicode database | |\n+-------------------+-----------------------------------+---------+\n| "\\uxxxx" | Character with 16-bit hex value | (5) |\n| | *xxxx* | |\n+-------------------+-----------------------------------+---------+\n| "\\Uxxxxxxxx" | Character with 32-bit hex value | (6) |\n| | *xxxxxxxx* | |\n+-------------------+-----------------------------------+---------+\n\nNotes:\n\n1. As in Standard C, up to three octal digits are accepted.\n\n2. Unlike in Standard C, exactly two hex digits are required.\n\n3. In a bytes literal, hexadecimal and octal escapes denote the\n byte with the given value. In a string literal, these escapes\n denote a Unicode character with the given value.\n\n4. Changed in version 3.3: Support for name aliases [1] has been\n added.\n\n5. Individual code units which form parts of a surrogate pair can\n be encoded using this escape sequence. Exactly four hex digits are\n required.\n\n6. Any Unicode character can be encoded this way. Exactly eight\n hex digits are required.\n\nUnlike Standard C, all unrecognized escape sequences are left in the\nstring unchanged, i.e., *the backslash is left in the string*. (This\nbehavior is useful when debugging: if an escape sequence is mistyped,\nthe resulting output is more easily recognized as broken.) It is also\nimportant to note that the escape sequences only recognized in string\nliterals fall into the category of unrecognized escapes for bytes\nliterals.\n\nEven in a raw string, string quotes can be escaped with a backslash,\nbut the backslash remains in the string; for example, "r"\\""" is a\nvalid string literal consisting of two characters: a backslash and a\ndouble quote; "r"\\"" is not a valid string literal (even a raw string\ncannot end in an odd number of backslashes). Specifically, *a raw\nstring cannot end in a single backslash* (since the backslash would\nescape the following quote character). Note also that a single\nbackslash followed by a newline is interpreted as those two characters\nas part of the string, *not* as a line continuation.\n', +- 'subscriptions': b'\nSubscriptions\n*************\n\nA subscription selects an item of a sequence (string, tuple or list)\nor mapping (dictionary) object:\n\n subscription ::= primary "[" expression_list "]"\n\nThe primary must evaluate to an object that supports subscription\n(lists or dictionaries for example). User-defined objects can support\nsubscription by defining a "__getitem__()" method.\n\nFor built-in objects, there are two types of objects that support\nsubscription:\n\nIf the primary is a mapping, the expression list must evaluate to an\nobject whose value is one of the keys of the mapping, and the\nsubscription selects the value in the mapping that corresponds to that\nkey. (The expression list is a tuple except if it has exactly one\nitem.)\n\nIf the primary is a sequence, the expression (list) must evaluate to\nan integer or a slice (as discussed in the following section).\n\nThe formal syntax makes no special provision for negative indices in\nsequences; however, built-in sequences all provide a "__getitem__()"\nmethod that interprets negative indices by adding the length of the\nsequence to the index (so that "x[-1]" selects the last item of "x").\nThe resulting value must be a nonnegative integer less than the number\nof items in the sequence, and the subscription selects the item whose\nindex is that value (counting from zero). Since the support for\nnegative indices and slicing occurs in the object\'s "__getitem__()"\nmethod, subclasses overriding this method will need to explicitly add\nthat support.\n\nA string\'s items are characters. A character is not a separate data\ntype but a string of exactly one character.\n', +- 'truth': b'\nTruth Value Testing\n*******************\n\nAny object can be tested for truth value, for use in an "if" or\n"while" condition or as operand of the Boolean operations below. The\nfollowing values are considered false:\n\n* "None"\n\n* "False"\n\n* zero of any numeric type, for example, "0", "0.0", "0j".\n\n* any empty sequence, for example, "\'\'", "()", "[]".\n\n* any empty mapping, for example, "{}".\n\n* instances of user-defined classes, if the class defines a\n "__bool__()" or "__len__()" method, when that method returns the\n integer zero or "bool" value "False". [1]\n\nAll other values are considered true --- so objects of many types are\nalways true.\n\nOperations and built-in functions that have a Boolean result always\nreturn "0" or "False" for false and "1" or "True" for true, unless\notherwise stated. (Important exception: the Boolean operations "or"\nand "and" always return one of their operands.)\n', +- 'try': b'\nThe "try" statement\n*******************\n\nThe "try" statement specifies exception handlers and/or cleanup code\nfor a group of statements:\n\n try_stmt ::= try1_stmt | try2_stmt\n try1_stmt ::= "try" ":" suite\n ("except" [expression ["as" identifier]] ":" suite)+\n ["else" ":" suite]\n ["finally" ":" suite]\n try2_stmt ::= "try" ":" suite\n "finally" ":" suite\n\nThe "except" clause(s) specify one or more exception handlers. When no\nexception occurs in the "try" clause, no exception handler is\nexecuted. When an exception occurs in the "try" suite, a search for an\nexception handler is started. This search inspects the except clauses\nin turn until one is found that matches the exception. An expression-\nless except clause, if present, must be last; it matches any\nexception. For an except clause with an expression, that expression\nis evaluated, and the clause matches the exception if the resulting\nobject is "compatible" with the exception. An object is compatible\nwith an exception if it is the class or a base class of the exception\nobject or a tuple containing an item compatible with the exception.\n\nIf no except clause matches the exception, the search for an exception\nhandler continues in the surrounding code and on the invocation stack.\n[1]\n\nIf the evaluation of an expression in the header of an except clause\nraises an exception, the original search for a handler is canceled and\na search starts for the new exception in the surrounding code and on\nthe call stack (it is treated as if the entire "try" statement raised\nthe exception).\n\nWhen a matching except clause is found, the exception is assigned to\nthe target specified after the "as" keyword in that except clause, if\npresent, and the except clause\'s suite is executed. All except\nclauses must have an executable block. When the end of this block is\nreached, execution continues normally after the entire try statement.\n(This means that if two nested handlers exist for the same exception,\nand the exception occurs in the try clause of the inner handler, the\nouter handler will not handle the exception.)\n\nWhen an exception has been assigned using "as target", it is cleared\nat the end of the except clause. This is as if\n\n except E as N:\n foo\n\nwas translated to\n\n except E as N:\n try:\n foo\n finally:\n del N\n\nThis means the exception must be assigned to a different name to be\nable to refer to it after the except clause. Exceptions are cleared\nbecause with the traceback attached to them, they form a reference\ncycle with the stack frame, keeping all locals in that frame alive\nuntil the next garbage collection occurs.\n\nBefore an except clause\'s suite is executed, details about the\nexception are stored in the "sys" module and can be accessed via\n"sys.exc_info()". "sys.exc_info()" returns a 3-tuple consisting of the\nexception class, the exception instance and a traceback object (see\nsection *The standard type hierarchy*) identifying the point in the\nprogram where the exception occurred. "sys.exc_info()" values are\nrestored to their previous values (before the call) when returning\nfrom a function that handled an exception.\n\nThe optional "else" clause is executed if and when control flows off\nthe end of the "try" clause. [2] Exceptions in the "else" clause are\nnot handled by the preceding "except" clauses.\n\nIf "finally" is present, it specifies a \'cleanup\' handler. The "try"\nclause is executed, including any "except" and "else" clauses. If an\nexception occurs in any of the clauses and is not handled, the\nexception is temporarily saved. The "finally" clause is executed. If\nthere is a saved exception it is re-raised at the end of the "finally"\nclause. If the "finally" clause raises another exception, the saved\nexception is set as the context of the new exception. If the "finally"\nclause executes a "return" or "break" statement, the saved exception\nis discarded:\n\n >>> def f():\n ... try:\n ... 1/0\n ... finally:\n ... return 42\n ...\n >>> f()\n 42\n\nThe exception information is not available to the program during\nexecution of the "finally" clause.\n\nWhen a "return", "break" or "continue" statement is executed in the\n"try" suite of a "try"..."finally" statement, the "finally" clause is\nalso executed \'on the way out.\' A "continue" statement is illegal in\nthe "finally" clause. (The reason is a problem with the current\nimplementation --- this restriction may be lifted in the future).\n\nThe return value of a function is determined by the last "return"\nstatement executed. Since the "finally" clause always executes, a\n"return" statement executed in the "finally" clause will always be the\nlast one executed:\n\n >>> def foo():\n ... try:\n ... return \'try\'\n ... finally:\n ... return \'finally\'\n ...\n >>> foo()\n \'finally\'\n\nAdditional information on exceptions can be found in section\n*Exceptions*, and information on using the "raise" statement to\ngenerate exceptions may be found in section *The raise statement*.\n', +- 'types': b'\nThe standard type hierarchy\n***************************\n\nBelow is a list of the types that are built into Python. Extension\nmodules (written in C, Java, or other languages, depending on the\nimplementation) can define additional types. Future versions of\nPython may add types to the type hierarchy (e.g., rational numbers,\nefficiently stored arrays of integers, etc.), although such additions\nwill often be provided via the standard library instead.\n\nSome of the type descriptions below contain a paragraph listing\n\'special attributes.\' These are attributes that provide access to the\nimplementation and are not intended for general use. Their definition\nmay change in the future.\n\nNone\n This type has a single value. There is a single object with this\n value. This object is accessed through the built-in name "None". It\n is used to signify the absence of a value in many situations, e.g.,\n it is returned from functions that don\'t explicitly return\n anything. Its truth value is false.\n\nNotImplemented\n This type has a single value. There is a single object with this\n value. This object is accessed through the built-in name\n "NotImplemented". Numeric methods and rich comparison methods may\n return this value if they do not implement the operation for the\n operands provided. (The interpreter will then try the reflected\n operation, or some other fallback, depending on the operator.) Its\n truth value is true.\n\nEllipsis\n This type has a single value. There is a single object with this\n value. This object is accessed through the literal "..." or the\n built-in name "Ellipsis". Its truth value is true.\n\n"numbers.Number"\n These are created by numeric literals and returned as results by\n arithmetic operators and arithmetic built-in functions. Numeric\n objects are immutable; once created their value never changes.\n Python numbers are of course strongly related to mathematical\n numbers, but subject to the limitations of numerical representation\n in computers.\n\n Python distinguishes between integers, floating point numbers, and\n complex numbers:\n\n "numbers.Integral"\n These represent elements from the mathematical set of integers\n (positive and negative).\n\n There are two types of integers:\n\n Integers ("int")\n\n These represent numbers in an unlimited range, subject to\n available (virtual) memory only. For the purpose of shift\n and mask operations, a binary representation is assumed, and\n negative numbers are represented in a variant of 2\'s\n complement which gives the illusion of an infinite string of\n sign bits extending to the left.\n\n Booleans ("bool")\n These represent the truth values False and True. The two\n objects representing the values "False" and "True" are the\n only Boolean objects. The Boolean type is a subtype of the\n integer type, and Boolean values behave like the values 0 and\n 1, respectively, in almost all contexts, the exception being\n that when converted to a string, the strings ""False"" or\n ""True"" are returned, respectively.\n\n The rules for integer representation are intended to give the\n most meaningful interpretation of shift and mask operations\n involving negative integers.\n\n "numbers.Real" ("float")\n These represent machine-level double precision floating point\n numbers. You are at the mercy of the underlying machine\n architecture (and C or Java implementation) for the accepted\n range and handling of overflow. Python does not support single-\n precision floating point numbers; the savings in processor and\n memory usage that are usually the reason for using these is\n dwarfed by the overhead of using objects in Python, so there is\n no reason to complicate the language with two kinds of floating\n point numbers.\n\n "numbers.Complex" ("complex")\n These represent complex numbers as a pair of machine-level\n double precision floating point numbers. The same caveats apply\n as for floating point numbers. The real and imaginary parts of a\n complex number "z" can be retrieved through the read-only\n attributes "z.real" and "z.imag".\n\nSequences\n These represent finite ordered sets indexed by non-negative\n numbers. The built-in function "len()" returns the number of items\n of a sequence. When the length of a sequence is *n*, the index set\n contains the numbers 0, 1, ..., *n*-1. Item *i* of sequence *a* is\n selected by "a[i]".\n\n Sequences also support slicing: "a[i:j]" selects all items with\n index *k* such that *i* "<=" *k* "<" *j*. When used as an\n expression, a slice is a sequence of the same type. This implies\n that the index set is renumbered so that it starts at 0.\n\n Some sequences also support "extended slicing" with a third "step"\n parameter: "a[i:j:k]" selects all items of *a* with index *x* where\n "x = i + n*k", *n* ">=" "0" and *i* "<=" *x* "<" *j*.\n\n Sequences are distinguished according to their mutability:\n\n Immutable sequences\n An object of an immutable sequence type cannot change once it is\n created. (If the object contains references to other objects,\n these other objects may be mutable and may be changed; however,\n the collection of objects directly referenced by an immutable\n object cannot change.)\n\n The following types are immutable sequences:\n\n Strings\n A string is a sequence of values that represent Unicode code\n points. All the code points in the range "U+0000 - U+10FFFF"\n can be represented in a string. Python doesn\'t have a "char"\n type; instead, every code point in the string is represented\n as a string object with length "1". The built-in function\n "ord()" converts a code point from its string form to an\n integer in the range "0 - 10FFFF"; "chr()" converts an\n integer in the range "0 - 10FFFF" to the corresponding length\n "1" string object. "str.encode()" can be used to convert a\n "str" to "bytes" using the given text encoding, and\n "bytes.decode()" can be used to achieve the opposite.\n\n Tuples\n The items of a tuple are arbitrary Python objects. Tuples of\n two or more items are formed by comma-separated lists of\n expressions. A tuple of one item (a \'singleton\') can be\n formed by affixing a comma to an expression (an expression by\n itself does not create a tuple, since parentheses must be\n usable for grouping of expressions). An empty tuple can be\n formed by an empty pair of parentheses.\n\n Bytes\n A bytes object is an immutable array. The items are 8-bit\n bytes, represented by integers in the range 0 <= x < 256.\n Bytes literals (like "b\'abc\'") and the built-in function\n "bytes()" can be used to construct bytes objects. Also,\n bytes objects can be decoded to strings via the "decode()"\n method.\n\n Mutable sequences\n Mutable sequences can be changed after they are created. The\n subscription and slicing notations can be used as the target of\n assignment and "del" (delete) statements.\n\n There are currently two intrinsic mutable sequence types:\n\n Lists\n The items of a list are arbitrary Python objects. Lists are\n formed by placing a comma-separated list of expressions in\n square brackets. (Note that there are no special cases needed\n to form lists of length 0 or 1.)\n\n Byte Arrays\n A bytearray object is a mutable array. They are created by\n the built-in "bytearray()" constructor. Aside from being\n mutable (and hence unhashable), byte arrays otherwise provide\n the same interface and functionality as immutable bytes\n objects.\n\n The extension module "array" provides an additional example of a\n mutable sequence type, as does the "collections" module.\n\nSet types\n These represent unordered, finite sets of unique, immutable\n objects. As such, they cannot be indexed by any subscript. However,\n they can be iterated over, and the built-in function "len()"\n returns the number of items in a set. Common uses for sets are fast\n membership testing, removing duplicates from a sequence, and\n computing mathematical operations such as intersection, union,\n difference, and symmetric difference.\n\n For set elements, the same immutability rules apply as for\n dictionary keys. Note that numeric types obey the normal rules for\n numeric comparison: if two numbers compare equal (e.g., "1" and\n "1.0"), only one of them can be contained in a set.\n\n There are currently two intrinsic set types:\n\n Sets\n These represent a mutable set. They are created by the built-in\n "set()" constructor and can be modified afterwards by several\n methods, such as "add()".\n\n Frozen sets\n These represent an immutable set. They are created by the\n built-in "frozenset()" constructor. As a frozenset is immutable\n and *hashable*, it can be used again as an element of another\n set, or as a dictionary key.\n\nMappings\n These represent finite sets of objects indexed by arbitrary index\n sets. The subscript notation "a[k]" selects the item indexed by "k"\n from the mapping "a"; this can be used in expressions and as the\n target of assignments or "del" statements. The built-in function\n "len()" returns the number of items in a mapping.\n\n There is currently a single intrinsic mapping type:\n\n Dictionaries\n These represent finite sets of objects indexed by nearly\n arbitrary values. The only types of values not acceptable as\n keys are values containing lists or dictionaries or other\n mutable types that are compared by value rather than by object\n identity, the reason being that the efficient implementation of\n dictionaries requires a key\'s hash value to remain constant.\n Numeric types used for keys obey the normal rules for numeric\n comparison: if two numbers compare equal (e.g., "1" and "1.0")\n then they can be used interchangeably to index the same\n dictionary entry.\n\n Dictionaries are mutable; they can be created by the "{...}"\n notation (see section *Dictionary displays*).\n\n The extension modules "dbm.ndbm" and "dbm.gnu" provide\n additional examples of mapping types, as does the "collections"\n module.\n\nCallable types\n These are the types to which the function call operation (see\n section *Calls*) can be applied:\n\n User-defined functions\n A user-defined function object is created by a function\n definition (see section *Function definitions*). It should be\n called with an argument list containing the same number of items\n as the function\'s formal parameter list.\n\n Special attributes:\n\n +---------------------------+---------------------------------+-------------+\n | Attribute | Meaning | |\n +===========================+=================================+=============+\n | "__doc__" | The function\'s documentation | Writable |\n | | string, or "None" if | |\n | | unavailable | |\n +---------------------------+---------------------------------+-------------+\n | "__name__" | The function\'s name | Writable |\n +---------------------------+---------------------------------+-------------+\n | "__qualname__" | The function\'s *qualified name* | Writable |\n | | New in version 3.3. | |\n +---------------------------+---------------------------------+-------------+\n | "__module__" | The name of the module the | Writable |\n | | function was defined in, or | |\n | | "None" if unavailable. | |\n +---------------------------+---------------------------------+-------------+\n | "__defaults__" | A tuple containing default | Writable |\n | | argument values for those | |\n | | arguments that have defaults, | |\n | | or "None" if no arguments have | |\n | | a default value | |\n +---------------------------+---------------------------------+-------------+\n | "__code__" | The code object representing | Writable |\n | | the compiled function body. | |\n +---------------------------+---------------------------------+-------------+\n | "__globals__" | A reference to the dictionary | Read-only |\n | | that holds the function\'s | |\n | | global variables --- the global | |\n | | namespace of the module in | |\n | | which the function was defined. | |\n +---------------------------+---------------------------------+-------------+\n | "__dict__" | The namespace supporting | Writable |\n | | arbitrary function attributes. | |\n +---------------------------+---------------------------------+-------------+\n | "__closure__" | "None" or a tuple of cells that | Read-only |\n | | contain bindings for the | |\n | | function\'s free variables. | |\n +---------------------------+---------------------------------+-------------+\n | "__annotations__" | A dict containing annotations | Writable |\n | | of parameters. The keys of the | |\n | | dict are the parameter names, | |\n | | and "\'return\'" for the return | |\n | | annotation, if provided. | |\n +---------------------------+---------------------------------+-------------+\n | "__kwdefaults__" | A dict containing defaults for | Writable |\n | | keyword-only parameters. | |\n +---------------------------+---------------------------------+-------------+\n\n Most of the attributes labelled "Writable" check the type of the\n assigned value.\n\n Function objects also support getting and setting arbitrary\n attributes, which can be used, for example, to attach metadata\n to functions. Regular attribute dot-notation is used to get and\n set such attributes. *Note that the current implementation only\n supports function attributes on user-defined functions. Function\n attributes on built-in functions may be supported in the\n future.*\n\n Additional information about a function\'s definition can be\n retrieved from its code object; see the description of internal\n types below.\n\n Instance methods\n An instance method object combines a class, a class instance and\n any callable object (normally a user-defined function).\n\n Special read-only attributes: "__self__" is the class instance\n object, "__func__" is the function object; "__doc__" is the\n method\'s documentation (same as "__func__.__doc__"); "__name__"\n is the method name (same as "__func__.__name__"); "__module__"\n is the name of the module the method was defined in, or "None"\n if unavailable.\n\n Methods also support accessing (but not setting) the arbitrary\n function attributes on the underlying function object.\n\n User-defined method objects may be created when getting an\n attribute of a class (perhaps via an instance of that class), if\n that attribute is a user-defined function object or a class\n method object.\n\n When an instance method object is created by retrieving a user-\n defined function object from a class via one of its instances,\n its "__self__" attribute is the instance, and the method object\n is said to be bound. The new method\'s "__func__" attribute is\n the original function object.\n\n When a user-defined method object is created by retrieving\n another method object from a class or instance, the behaviour is\n the same as for a function object, except that the "__func__"\n attribute of the new instance is not the original method object\n but its "__func__" attribute.\n\n When an instance method object is created by retrieving a class\n method object from a class or instance, its "__self__" attribute\n is the class itself, and its "__func__" attribute is the\n function object underlying the class method.\n\n When an instance method object is called, the underlying\n function ("__func__") is called, inserting the class instance\n ("__self__") in front of the argument list. For instance, when\n "C" is a class which contains a definition for a function "f()",\n and "x" is an instance of "C", calling "x.f(1)" is equivalent to\n calling "C.f(x, 1)".\n\n When an instance method object is derived from a class method\n object, the "class instance" stored in "__self__" will actually\n be the class itself, so that calling either "x.f(1)" or "C.f(1)"\n is equivalent to calling "f(C,1)" where "f" is the underlying\n function.\n\n Note that the transformation from function object to instance\n method object happens each time the attribute is retrieved from\n the instance. In some cases, a fruitful optimization is to\n assign the attribute to a local variable and call that local\n variable. Also notice that this transformation only happens for\n user-defined functions; other callable objects (and all non-\n callable objects) are retrieved without transformation. It is\n also important to note that user-defined functions which are\n attributes of a class instance are not converted to bound\n methods; this *only* happens when the function is an attribute\n of the class.\n\n Generator functions\n A function or method which uses the "yield" statement (see\n section *The yield statement*) is called a *generator function*.\n Such a function, when called, always returns an iterator object\n which can be used to execute the body of the function: calling\n the iterator\'s "iterator.__next__()" method will cause the\n function to execute until it provides a value using the "yield"\n statement. When the function executes a "return" statement or\n falls off the end, a "StopIteration" exception is raised and the\n iterator will have reached the end of the set of values to be\n returned.\n\n Built-in functions\n A built-in function object is a wrapper around a C function.\n Examples of built-in functions are "len()" and "math.sin()"\n ("math" is a standard built-in module). The number and type of\n the arguments are determined by the C function. Special read-\n only attributes: "__doc__" is the function\'s documentation\n string, or "None" if unavailable; "__name__" is the function\'s\n name; "__self__" is set to "None" (but see the next item);\n "__module__" is the name of the module the function was defined\n in or "None" if unavailable.\n\n Built-in methods\n This is really a different disguise of a built-in function, this\n time containing an object passed to the C function as an\n implicit extra argument. An example of a built-in method is\n "alist.append()", assuming *alist* is a list object. In this\n case, the special read-only attribute "__self__" is set to the\n object denoted by *alist*.\n\n Classes\n Classes are callable. These objects normally act as factories\n for new instances of themselves, but variations are possible for\n class types that override "__new__()". The arguments of the\n call are passed to "__new__()" and, in the typical case, to\n "__init__()" to initialize the new instance.\n\n Class Instances\n Instances of arbitrary classes can be made callable by defining\n a "__call__()" method in their class.\n\nModules\n Modules are a basic organizational unit of Python code, and are\n created by the *import system* as invoked either by the "import"\n statement (see "import"), or by calling functions such as\n "importlib.import_module()" and built-in "__import__()". A module\n object has a namespace implemented by a dictionary object (this is\n the dictionary referenced by the "__globals__" attribute of\n functions defined in the module). Attribute references are\n translated to lookups in this dictionary, e.g., "m.x" is equivalent\n to "m.__dict__["x"]". A module object does not contain the code\n object used to initialize the module (since it isn\'t needed once\n the initialization is done).\n\n Attribute assignment updates the module\'s namespace dictionary,\n e.g., "m.x = 1" is equivalent to "m.__dict__["x"] = 1".\n\n Special read-only attribute: "__dict__" is the module\'s namespace\n as a dictionary object.\n\n **CPython implementation detail:** Because of the way CPython\n clears module dictionaries, the module dictionary will be cleared\n when the module falls out of scope even if the dictionary still has\n live references. To avoid this, copy the dictionary or keep the\n module around while using its dictionary directly.\n\n Predefined (writable) attributes: "__name__" is the module\'s name;\n "__doc__" is the module\'s documentation string, or "None" if\n unavailable; "__file__" is the pathname of the file from which the\n module was loaded, if it was loaded from a file. The "__file__"\n attribute may be missing for certain types of modules, such as C\n modules that are statically linked into the interpreter; for\n extension modules loaded dynamically from a shared library, it is\n the pathname of the shared library file.\n\nCustom classes\n Custom class types are typically created by class definitions (see\n section *Class definitions*). A class has a namespace implemented\n by a dictionary object. Class attribute references are translated\n to lookups in this dictionary, e.g., "C.x" is translated to\n "C.__dict__["x"]" (although there are a number of hooks which allow\n for other means of locating attributes). When the attribute name is\n not found there, the attribute search continues in the base\n classes. This search of the base classes uses the C3 method\n resolution order which behaves correctly even in the presence of\n \'diamond\' inheritance structures where there are multiple\n inheritance paths leading back to a common ancestor. Additional\n details on the C3 MRO used by Python can be found in the\n documentation accompanying the 2.3 release at\n http://www.python.org/download/releases/2.3/mro/.\n\n When a class attribute reference (for class "C", say) would yield a\n class method object, it is transformed into an instance method\n object whose "__self__" attributes is "C". When it would yield a\n static method object, it is transformed into the object wrapped by\n the static method object. See section *Implementing Descriptors*\n for another way in which attributes retrieved from a class may\n differ from those actually contained in its "__dict__".\n\n Class attribute assignments update the class\'s dictionary, never\n the dictionary of a base class.\n\n A class object can be called (see above) to yield a class instance\n (see below).\n\n Special attributes: "__name__" is the class name; "__module__" is\n the module name in which the class was defined; "__dict__" is the\n dictionary containing the class\'s namespace; "__bases__" is a tuple\n (possibly empty or a singleton) containing the base classes, in the\n order of their occurrence in the base class list; "__doc__" is the\n class\'s documentation string, or None if undefined.\n\nClass instances\n A class instance is created by calling a class object (see above).\n A class instance has a namespace implemented as a dictionary which\n is the first place in which attribute references are searched.\n When an attribute is not found there, and the instance\'s class has\n an attribute by that name, the search continues with the class\n attributes. If a class attribute is found that is a user-defined\n function object, it is transformed into an instance method object\n whose "__self__" attribute is the instance. Static method and\n class method objects are also transformed; see above under\n "Classes". See section *Implementing Descriptors* for another way\n in which attributes of a class retrieved via its instances may\n differ from the objects actually stored in the class\'s "__dict__".\n If no class attribute is found, and the object\'s class has a\n "__getattr__()" method, that is called to satisfy the lookup.\n\n Attribute assignments and deletions update the instance\'s\n dictionary, never a class\'s dictionary. If the class has a\n "__setattr__()" or "__delattr__()" method, this is called instead\n of updating the instance dictionary directly.\n\n Class instances can pretend to be numbers, sequences, or mappings\n if they have methods with certain special names. See section\n *Special method names*.\n\n Special attributes: "__dict__" is the attribute dictionary;\n "__class__" is the instance\'s class.\n\nI/O objects (also known as file objects)\n A *file object* represents an open file. Various shortcuts are\n available to create file objects: the "open()" built-in function,\n and also "os.popen()", "os.fdopen()", and the "makefile()" method\n of socket objects (and perhaps by other functions or methods\n provided by extension modules).\n\n The objects "sys.stdin", "sys.stdout" and "sys.stderr" are\n initialized to file objects corresponding to the interpreter\'s\n standard input, output and error streams; they are all open in text\n mode and therefore follow the interface defined by the\n "io.TextIOBase" abstract class.\n\nInternal types\n A few types used internally by the interpreter are exposed to the\n user. Their definitions may change with future versions of the\n interpreter, but they are mentioned here for completeness.\n\n Code objects\n Code objects represent *byte-compiled* executable Python code,\n or *bytecode*. The difference between a code object and a\n function object is that the function object contains an explicit\n reference to the function\'s globals (the module in which it was\n defined), while a code object contains no context; also the\n default argument values are stored in the function object, not\n in the code object (because they represent values calculated at\n run-time). Unlike function objects, code objects are immutable\n and contain no references (directly or indirectly) to mutable\n objects.\n\n Special read-only attributes: "co_name" gives the function name;\n "co_argcount" is the number of positional arguments (including\n arguments with default values); "co_nlocals" is the number of\n local variables used by the function (including arguments);\n "co_varnames" is a tuple containing the names of the local\n variables (starting with the argument names); "co_cellvars" is a\n tuple containing the names of local variables that are\n referenced by nested functions; "co_freevars" is a tuple\n containing the names of free variables; "co_code" is a string\n representing the sequence of bytecode instructions; "co_consts"\n is a tuple containing the literals used by the bytecode;\n "co_names" is a tuple containing the names used by the bytecode;\n "co_filename" is the filename from which the code was compiled;\n "co_firstlineno" is the first line number of the function;\n "co_lnotab" is a string encoding the mapping from bytecode\n offsets to line numbers (for details see the source code of the\n interpreter); "co_stacksize" is the required stack size\n (including local variables); "co_flags" is an integer encoding a\n number of flags for the interpreter.\n\n The following flag bits are defined for "co_flags": bit "0x04"\n is set if the function uses the "*arguments" syntax to accept an\n arbitrary number of positional arguments; bit "0x08" is set if\n the function uses the "**keywords" syntax to accept arbitrary\n keyword arguments; bit "0x20" is set if the function is a\n generator.\n\n Future feature declarations ("from __future__ import division")\n also use bits in "co_flags" to indicate whether a code object\n was compiled with a particular feature enabled: bit "0x2000" is\n set if the function was compiled with future division enabled;\n bits "0x10" and "0x1000" were used in earlier versions of\n Python.\n\n Other bits in "co_flags" are reserved for internal use.\n\n If a code object represents a function, the first item in\n "co_consts" is the documentation string of the function, or\n "None" if undefined.\n\n Frame objects\n Frame objects represent execution frames. They may occur in\n traceback objects (see below).\n\n Special read-only attributes: "f_back" is to the previous stack\n frame (towards the caller), or "None" if this is the bottom\n stack frame; "f_code" is the code object being executed in this\n frame; "f_locals" is the dictionary used to look up local\n variables; "f_globals" is used for global variables;\n "f_builtins" is used for built-in (intrinsic) names; "f_lasti"\n gives the precise instruction (this is an index into the\n bytecode string of the code object).\n\n Special writable attributes: "f_trace", if not "None", is a\n function called at the start of each source code line (this is\n used by the debugger); "f_lineno" is the current line number of\n the frame --- writing to this from within a trace function jumps\n to the given line (only for the bottom-most frame). A debugger\n can implement a Jump command (aka Set Next Statement) by writing\n to f_lineno.\n\n Frame objects support one method:\n\n frame.clear()\n\n This method clears all references to local variables held by\n the frame. Also, if the frame belonged to a generator, the\n generator is finalized. This helps break reference cycles\n involving frame objects (for example when catching an\n exception and storing its traceback for later use).\n\n "RuntimeError" is raised if the frame is currently executing.\n\n New in version 3.4.\n\n Traceback objects\n Traceback objects represent a stack trace of an exception. A\n traceback object is created when an exception occurs. When the\n search for an exception handler unwinds the execution stack, at\n each unwound level a traceback object is inserted in front of\n the current traceback. When an exception handler is entered,\n the stack trace is made available to the program. (See section\n *The try statement*.) It is accessible as the third item of the\n tuple returned by "sys.exc_info()". When the program contains no\n suitable handler, the stack trace is written (nicely formatted)\n to the standard error stream; if the interpreter is interactive,\n it is also made available to the user as "sys.last_traceback".\n\n Special read-only attributes: "tb_next" is the next level in the\n stack trace (towards the frame where the exception occurred), or\n "None" if there is no next level; "tb_frame" points to the\n execution frame of the current level; "tb_lineno" gives the line\n number where the exception occurred; "tb_lasti" indicates the\n precise instruction. The line number and last instruction in\n the traceback may differ from the line number of its frame\n object if the exception occurred in a "try" statement with no\n matching except clause or with a finally clause.\n\n Slice objects\n Slice objects are used to represent slices for "__getitem__()"\n methods. They are also created by the built-in "slice()"\n function.\n\n Special read-only attributes: "start" is the lower bound; "stop"\n is the upper bound; "step" is the step value; each is "None" if\n omitted. These attributes can have any type.\n\n Slice objects support one method:\n\n slice.indices(self, length)\n\n This method takes a single integer argument *length* and\n computes information about the slice that the slice object\n would describe if applied to a sequence of *length* items.\n It returns a tuple of three integers; respectively these are\n the *start* and *stop* indices and the *step* or stride\n length of the slice. Missing or out-of-bounds indices are\n handled in a manner consistent with regular slices.\n\n Static method objects\n Static method objects provide a way of defeating the\n transformation of function objects to method objects described\n above. A static method object is a wrapper around any other\n object, usually a user-defined method object. When a static\n method object is retrieved from a class or a class instance, the\n object actually returned is the wrapped object, which is not\n subject to any further transformation. Static method objects are\n not themselves callable, although the objects they wrap usually\n are. Static method objects are created by the built-in\n "staticmethod()" constructor.\n\n Class method objects\n A class method object, like a static method object, is a wrapper\n around another object that alters the way in which that object\n is retrieved from classes and class instances. The behaviour of\n class method objects upon such retrieval is described above,\n under "User-defined methods". Class method objects are created\n by the built-in "classmethod()" constructor.\n', +- 'typesfunctions': b'\nFunctions\n*********\n\nFunction objects are created by function definitions. The only\noperation on a function object is to call it: "func(argument-list)".\n\nThere are really two flavors of function objects: built-in functions\nand user-defined functions. Both support the same operation (to call\nthe function), but the implementation is different, hence the\ndifferent object types.\n\nSee *Function definitions* for more information.\n', +- 'typesmapping': b'\nMapping Types --- "dict"\n************************\n\nA *mapping* object maps *hashable* values to arbitrary objects.\nMappings are mutable objects. There is currently only one standard\nmapping type, the *dictionary*. (For other containers see the built-\nin "list", "set", and "tuple" classes, and the "collections" module.)\n\nA dictionary\'s keys are *almost* arbitrary values. Values that are\nnot *hashable*, that is, values containing lists, dictionaries or\nother mutable types (that are compared by value rather than by object\nidentity) may not be used as keys. Numeric types used for keys obey\nthe normal rules for numeric comparison: if two numbers compare equal\n(such as "1" and "1.0") then they can be used interchangeably to index\nthe same dictionary entry. (Note however, that since computers store\nfloating-point numbers as approximations it is usually unwise to use\nthem as dictionary keys.)\n\nDictionaries can be created by placing a comma-separated list of "key:\nvalue" pairs within braces, for example: "{\'jack\': 4098, \'sjoerd\':\n4127}" or "{4098: \'jack\', 4127: \'sjoerd\'}", or by the "dict"\nconstructor.\n\nclass class dict(**kwarg)\nclass class dict(mapping, **kwarg)\nclass class dict(iterable, **kwarg)\n\n Return a new dictionary initialized from an optional positional\n argument and a possibly empty set of keyword arguments.\n\n If no positional argument is given, an empty dictionary is created.\n If a positional argument is given and it is a mapping object, a\n dictionary is created with the same key-value pairs as the mapping\n object. Otherwise, the positional argument must be an *iterable*\n object. Each item in the iterable must itself be an iterable with\n exactly two objects. The first object of each item becomes a key\n in the new dictionary, and the second object the corresponding\n value. If a key occurs more than once, the last value for that key\n becomes the corresponding value in the new dictionary.\n\n If keyword arguments are given, the keyword arguments and their\n values are added to the dictionary created from the positional\n argument. If a key being added is already present, the value from\n the keyword argument replaces the value from the positional\n argument.\n\n To illustrate, the following examples all return a dictionary equal\n to "{"one": 1, "two": 2, "three": 3}":\n\n >>> a = dict(one=1, two=2, three=3)\n >>> b = {\'one\': 1, \'two\': 2, \'three\': 3}\n >>> c = dict(zip([\'one\', \'two\', \'three\'], [1, 2, 3]))\n >>> d = dict([(\'two\', 2), (\'one\', 1), (\'three\', 3)])\n >>> e = dict({\'three\': 3, \'one\': 1, \'two\': 2})\n >>> a == b == c == d == e\n True\n\n Providing keyword arguments as in the first example only works for\n keys that are valid Python identifiers. Otherwise, any valid keys\n can be used.\n\n These are the operations that dictionaries support (and therefore,\n custom mapping types should support too):\n\n len(d)\n\n Return the number of items in the dictionary *d*.\n\n d[key]\n\n Return the item of *d* with key *key*. Raises a "KeyError" if\n *key* is not in the map.\n\n If a subclass of dict defines a method "__missing__()", if the\n key *key* is not present, the "d[key]" operation calls that\n method with the key *key* as argument. The "d[key]" operation\n then returns or raises whatever is returned or raised by the\n "__missing__(key)" call if the key is not present. No other\n operations or methods invoke "__missing__()". If "__missing__()"\n is not defined, "KeyError" is raised. "__missing__()" must be a\n method; it cannot be an instance variable:\n\n >>> class Counter(dict):\n ... def __missing__(self, key):\n ... return 0\n >>> c = Counter()\n >>> c[\'red\']\n 0\n >>> c[\'red\'] += 1\n >>> c[\'red\']\n 1\n\n See "collections.Counter" for a complete implementation\n including other methods helpful for accumulating and managing\n tallies.\n\n d[key] = value\n\n Set "d[key]" to *value*.\n\n del d[key]\n\n Remove "d[key]" from *d*. Raises a "KeyError" if *key* is not\n in the map.\n\n key in d\n\n Return "True" if *d* has a key *key*, else "False".\n\n key not in d\n\n Equivalent to "not key in d".\n\n iter(d)\n\n Return an iterator over the keys of the dictionary. This is a\n shortcut for "iter(d.keys())".\n\n clear()\n\n Remove all items from the dictionary.\n\n copy()\n\n Return a shallow copy of the dictionary.\n\n classmethod fromkeys(seq[, value])\n\n Create a new dictionary with keys from *seq* and values set to\n *value*.\n\n "fromkeys()" is a class method that returns a new dictionary.\n *value* defaults to "None".\n\n get(key[, default])\n\n Return the value for *key* if *key* is in the dictionary, else\n *default*. If *default* is not given, it defaults to "None", so\n that this method never raises a "KeyError".\n\n items()\n\n Return a new view of the dictionary\'s items ("(key, value)"\n pairs). See the *documentation of view objects*.\n\n keys()\n\n Return a new view of the dictionary\'s keys. See the\n *documentation of view objects*.\n\n pop(key[, default])\n\n If *key* is in the dictionary, remove it and return its value,\n else return *default*. If *default* is not given and *key* is\n not in the dictionary, a "KeyError" is raised.\n\n popitem()\n\n Remove and return an arbitrary "(key, value)" pair from the\n dictionary.\n\n "popitem()" is useful to destructively iterate over a\n dictionary, as often used in set algorithms. If the dictionary\n is empty, calling "popitem()" raises a "KeyError".\n\n setdefault(key[, default])\n\n If *key* is in the dictionary, return its value. If not, insert\n *key* with a value of *default* and return *default*. *default*\n defaults to "None".\n\n update([other])\n\n Update the dictionary with the key/value pairs from *other*,\n overwriting existing keys. Return "None".\n\n "update()" accepts either another dictionary object or an\n iterable of key/value pairs (as tuples or other iterables of\n length two). If keyword arguments are specified, the dictionary\n is then updated with those key/value pairs: "d.update(red=1,\n blue=2)".\n\n values()\n\n Return a new view of the dictionary\'s values. See the\n *documentation of view objects*.\n\nSee also: "types.MappingProxyType" can be used to create a read-only\n view of a "dict".\n\n\nDictionary view objects\n=======================\n\nThe objects returned by "dict.keys()", "dict.values()" and\n"dict.items()" are *view objects*. They provide a dynamic view on the\ndictionary\'s entries, which means that when the dictionary changes,\nthe view reflects these changes.\n\nDictionary views can be iterated over to yield their respective data,\nand support membership tests:\n\nlen(dictview)\n\n Return the number of entries in the dictionary.\n\niter(dictview)\n\n Return an iterator over the keys, values or items (represented as\n tuples of "(key, value)") in the dictionary.\n\n Keys and values are iterated over in an arbitrary order which is\n non-random, varies across Python implementations, and depends on\n the dictionary\'s history of insertions and deletions. If keys,\n values and items views are iterated over with no intervening\n modifications to the dictionary, the order of items will directly\n correspond. This allows the creation of "(value, key)" pairs using\n "zip()": "pairs = zip(d.values(), d.keys())". Another way to\n create the same list is "pairs = [(v, k) for (k, v) in d.items()]".\n\n Iterating views while adding or deleting entries in the dictionary\n may raise a "RuntimeError" or fail to iterate over all entries.\n\nx in dictview\n\n Return "True" if *x* is in the underlying dictionary\'s keys, values\n or items (in the latter case, *x* should be a "(key, value)"\n tuple).\n\nKeys views are set-like since their entries are unique and hashable.\nIf all values are hashable, so that "(key, value)" pairs are unique\nand hashable, then the items view is also set-like. (Values views are\nnot treated as set-like since the entries are generally not unique.)\nFor set-like views, all of the operations defined for the abstract\nbase class "collections.abc.Set" are available (for example, "==",\n"<", or "^").\n\nAn example of dictionary view usage:\n\n >>> dishes = {\'eggs\': 2, \'sausage\': 1, \'bacon\': 1, \'spam\': 500}\n >>> keys = dishes.keys()\n >>> values = dishes.values()\n\n >>> # iteration\n >>> n = 0\n >>> for val in values:\n ... n += val\n >>> print(n)\n 504\n\n >>> # keys and values are iterated over in the same order\n >>> list(keys)\n [\'eggs\', \'bacon\', \'sausage\', \'spam\']\n >>> list(values)\n [2, 1, 1, 500]\n\n >>> # view objects are dynamic and reflect dict changes\n >>> del dishes[\'eggs\']\n >>> del dishes[\'sausage\']\n >>> list(keys)\n [\'spam\', \'bacon\']\n\n >>> # set operations\n >>> keys & {\'eggs\', \'bacon\', \'salad\'}\n {\'bacon\'}\n >>> keys ^ {\'sausage\', \'juice\'}\n {\'juice\', \'sausage\', \'bacon\', \'spam\'}\n', +- 'typesmethods': b'\nMethods\n*******\n\nMethods are functions that are called using the attribute notation.\nThere are two flavors: built-in methods (such as "append()" on lists)\nand class instance methods. Built-in methods are described with the\ntypes that support them.\n\nIf you access a method (a function defined in a class namespace)\nthrough an instance, you get a special object: a *bound method* (also\ncalled *instance method*) object. When called, it will add the "self"\nargument to the argument list. Bound methods have two special read-\nonly attributes: "m.__self__" is the object on which the method\noperates, and "m.__func__" is the function implementing the method.\nCalling "m(arg-1, arg-2, ..., arg-n)" is completely equivalent to\ncalling "m.__func__(m.__self__, arg-1, arg-2, ..., arg-n)".\n\nLike function objects, bound method objects support getting arbitrary\nattributes. However, since method attributes are actually stored on\nthe underlying function object ("meth.__func__"), setting method\nattributes on bound methods is disallowed. Attempting to set an\nattribute on a method results in an "AttributeError" being raised. In\norder to set a method attribute, you need to explicitly set it on the\nunderlying function object:\n\n >>> class C:\n ... def method(self):\n ... pass\n ...\n >>> c = C()\n >>> c.method.whoami = \'my name is method\' # can\'t set on the method\n Traceback (most recent call last):\n File "", line 1, in \n AttributeError: \'method\' object has no attribute \'whoami\'\n >>> c.method.__func__.whoami = \'my name is method\'\n >>> c.method.whoami\n \'my name is method\'\n\nSee *The standard type hierarchy* for more information.\n', +- 'typesmodules': b'\nModules\n*******\n\nThe only special operation on a module is attribute access: "m.name",\nwhere *m* is a module and *name* accesses a name defined in *m*\'s\nsymbol table. Module attributes can be assigned to. (Note that the\n"import" statement is not, strictly speaking, an operation on a module\nobject; "import foo" does not require a module object named *foo* to\nexist, rather it requires an (external) *definition* for a module\nnamed *foo* somewhere.)\n\nA special attribute of every module is "__dict__". This is the\ndictionary containing the module\'s symbol table. Modifying this\ndictionary will actually change the module\'s symbol table, but direct\nassignment to the "__dict__" attribute is not possible (you can write\n"m.__dict__[\'a\'] = 1", which defines "m.a" to be "1", but you can\'t\nwrite "m.__dict__ = {}"). Modifying "__dict__" directly is not\nrecommended.\n\nModules built into the interpreter are written like this: "". If loaded from a file, they are written as\n"".\n', +- 'typesseq': b'\nSequence Types --- "list", "tuple", "range"\n*******************************************\n\nThere are three basic sequence types: lists, tuples, and range\nobjects. Additional sequence types tailored for processing of *binary\ndata* and *text strings* are described in dedicated sections.\n\n\nCommon Sequence Operations\n==========================\n\nThe operations in the following table are supported by most sequence\ntypes, both mutable and immutable. The "collections.abc.Sequence" ABC\nis provided to make it easier to correctly implement these operations\non custom sequence types.\n\nThis table lists the sequence operations sorted in ascending priority\n(operations in the same box have the same priority). In the table,\n*s* and *t* are sequences of the same type, *n*, *i*, *j* and *k* are\nintegers and *x* is an arbitrary object that meets any type and value\nrestrictions imposed by *s*.\n\nThe "in" and "not in" operations have the same priorities as the\ncomparison operations. The "+" (concatenation) and "*" (repetition)\noperations have the same priority as the corresponding numeric\noperations.\n\n+----------------------------+----------------------------------+------------+\n| Operation | Result | Notes |\n+============================+==================================+============+\n| "x in s" | "True" if an item of *s* is | (1) |\n| | equal to *x*, else "False" | |\n+----------------------------+----------------------------------+------------+\n| "x not in s" | "False" if an item of *s* is | (1) |\n| | equal to *x*, else "True" | |\n+----------------------------+----------------------------------+------------+\n| "s + t" | the concatenation of *s* and *t* | (6)(7) |\n+----------------------------+----------------------------------+------------+\n| "s * n" or "n * s" | *n* shallow copies of *s* | (2)(7) |\n| | concatenated | |\n+----------------------------+----------------------------------+------------+\n| "s[i]" | *i*th item of *s*, origin 0 | (3) |\n+----------------------------+----------------------------------+------------+\n| "s[i:j]" | slice of *s* from *i* to *j* | (3)(4) |\n+----------------------------+----------------------------------+------------+\n| "s[i:j:k]" | slice of *s* from *i* to *j* | (3)(5) |\n| | with step *k* | |\n+----------------------------+----------------------------------+------------+\n| "len(s)" | length of *s* | |\n+----------------------------+----------------------------------+------------+\n| "min(s)" | smallest item of *s* | |\n+----------------------------+----------------------------------+------------+\n| "max(s)" | largest item of *s* | |\n+----------------------------+----------------------------------+------------+\n| "s.index(x[, i[, j]])" | index of the first occurrence of | (8) |\n| | *x* in *s* (at or after index | |\n| | *i* and before index *j*) | |\n+----------------------------+----------------------------------+------------+\n| "s.count(x)" | total number of occurrences of | |\n| | *x* in *s* | |\n+----------------------------+----------------------------------+------------+\n\nSequences of the same type also support comparisons. In particular,\ntuples and lists are compared lexicographically by comparing\ncorresponding elements. This means that to compare equal, every\nelement must compare equal and the two sequences must be of the same\ntype and have the same length. (For full details see *Comparisons* in\nthe language reference.)\n\nNotes:\n\n1. While the "in" and "not in" operations are used only for simple\n containment testing in the general case, some specialised sequences\n (such as "str", "bytes" and "bytearray") also use them for\n subsequence testing:\n\n >>> "gg" in "eggs"\n True\n\n2. Values of *n* less than "0" are treated as "0" (which yields an\n empty sequence of the same type as *s*). Note also that the copies\n are shallow; nested structures are not copied. This often haunts\n new Python programmers; consider:\n\n >>> lists = [[]] * 3\n >>> lists\n [[], [], []]\n >>> lists[0].append(3)\n >>> lists\n [[3], [3], [3]]\n\n What has happened is that "[[]]" is a one-element list containing\n an empty list, so all three elements of "[[]] * 3" are (pointers\n to) this single empty list. Modifying any of the elements of\n "lists" modifies this single list. You can create a list of\n different lists this way:\n\n >>> lists = [[] for i in range(3)]\n >>> lists[0].append(3)\n >>> lists[1].append(5)\n >>> lists[2].append(7)\n >>> lists\n [[3], [5], [7]]\n\n3. If *i* or *j* is negative, the index is relative to the end of\n the string: "len(s) + i" or "len(s) + j" is substituted. But note\n that "-0" is still "0".\n\n4. The slice of *s* from *i* to *j* is defined as the sequence of\n items with index *k* such that "i <= k < j". If *i* or *j* is\n greater than "len(s)", use "len(s)". If *i* is omitted or "None",\n use "0". If *j* is omitted or "None", use "len(s)". If *i* is\n greater than or equal to *j*, the slice is empty.\n\n5. The slice of *s* from *i* to *j* with step *k* is defined as the\n sequence of items with index "x = i + n*k" such that "0 <= n <\n (j-i)/k". In other words, the indices are "i", "i+k", "i+2*k",\n "i+3*k" and so on, stopping when *j* is reached (but never\n including *j*). If *i* or *j* is greater than "len(s)", use\n "len(s)". If *i* or *j* are omitted or "None", they become "end"\n values (which end depends on the sign of *k*). Note, *k* cannot be\n zero. If *k* is "None", it is treated like "1".\n\n6. Concatenating immutable sequences always results in a new\n object. This means that building up a sequence by repeated\n concatenation will have a quadratic runtime cost in the total\n sequence length. To get a linear runtime cost, you must switch to\n one of the alternatives below:\n\n * if concatenating "str" objects, you can build a list and use\n "str.join()" at the end or else write to a "io.StringIO" instance\n and retrieve its value when complete\n\n * if concatenating "bytes" objects, you can similarly use\n "bytes.join()" or "io.BytesIO", or you can do in-place\n concatenation with a "bytearray" object. "bytearray" objects are\n mutable and have an efficient overallocation mechanism\n\n * if concatenating "tuple" objects, extend a "list" instead\n\n * for other types, investigate the relevant class documentation\n\n7. Some sequence types (such as "range") only support item\n sequences that follow specific patterns, and hence don\'t support\n sequence concatenation or repetition.\n\n8. "index" raises "ValueError" when *x* is not found in *s*. When\n supported, the additional arguments to the index method allow\n efficient searching of subsections of the sequence. Passing the\n extra arguments is roughly equivalent to using "s[i:j].index(x)",\n only without copying any data and with the returned index being\n relative to the start of the sequence rather than the start of the\n slice.\n\n\nImmutable Sequence Types\n========================\n\nThe only operation that immutable sequence types generally implement\nthat is not also implemented by mutable sequence types is support for\nthe "hash()" built-in.\n\nThis support allows immutable sequences, such as "tuple" instances, to\nbe used as "dict" keys and stored in "set" and "frozenset" instances.\n\nAttempting to hash an immutable sequence that contains unhashable\nvalues will result in "TypeError".\n\n\nMutable Sequence Types\n======================\n\nThe operations in the following table are defined on mutable sequence\ntypes. The "collections.abc.MutableSequence" ABC is provided to make\nit easier to correctly implement these operations on custom sequence\ntypes.\n\nIn the table *s* is an instance of a mutable sequence type, *t* is any\niterable object and *x* is an arbitrary object that meets any type and\nvalue restrictions imposed by *s* (for example, "bytearray" only\naccepts integers that meet the value restriction "0 <= x <= 255").\n\n+--------------------------------+----------------------------------+-----------------------+\n| Operation | Result | Notes |\n+================================+==================================+=======================+\n| "s[i] = x" | item *i* of *s* is replaced by | |\n| | *x* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s[i:j] = t" | slice of *s* from *i* to *j* is | |\n| | replaced by the contents of the | |\n| | iterable *t* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "del s[i:j]" | same as "s[i:j] = []" | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s[i:j:k] = t" | the elements of "s[i:j:k]" are | (1) |\n| | replaced by those of *t* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "del s[i:j:k]" | removes the elements of | |\n| | "s[i:j:k]" from the list | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.append(x)" | appends *x* to the end of the | |\n| | sequence (same as | |\n| | "s[len(s):len(s)] = [x]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.clear()" | removes all items from "s" (same | (5) |\n| | as "del s[:]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.copy()" | creates a shallow copy of "s" | (5) |\n| | (same as "s[:]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.extend(t)" | extends *s* with the contents of | |\n| | *t* (same as "s[len(s):len(s)] = | |\n| | t") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.insert(i, x)" | inserts *x* into *s* at the | |\n| | index given by *i* (same as | |\n| | "s[i:i] = [x]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.pop([i])" | retrieves the item at *i* and | (2) |\n| | also removes it from *s* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.remove(x)" | remove the first item from *s* | (3) |\n| | where "s[i] == x" | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.reverse()" | reverses the items of *s* in | (4) |\n| | place | |\n+--------------------------------+----------------------------------+-----------------------+\n\nNotes:\n\n1. *t* must have the same length as the slice it is replacing.\n\n2. The optional argument *i* defaults to "-1", so that by default\n the last item is removed and returned.\n\n3. "remove" raises "ValueError" when *x* is not found in *s*.\n\n4. The "reverse()" method modifies the sequence in place for\n economy of space when reversing a large sequence. To remind users\n that it operates by side effect, it does not return the reversed\n sequence.\n\n5. "clear()" and "copy()" are included for consistency with the\n interfaces of mutable containers that don\'t support slicing\n operations (such as "dict" and "set")\n\n New in version 3.3: "clear()" and "copy()" methods.\n\n\nLists\n=====\n\nLists are mutable sequences, typically used to store collections of\nhomogeneous items (where the precise degree of similarity will vary by\napplication).\n\nclass class list([iterable])\n\n Lists may be constructed in several ways:\n\n * Using a pair of square brackets to denote the empty list: "[]"\n\n * Using square brackets, separating items with commas: "[a]",\n "[a, b, c]"\n\n * Using a list comprehension: "[x for x in iterable]"\n\n * Using the type constructor: "list()" or "list(iterable)"\n\n The constructor builds a list whose items are the same and in the\n same order as *iterable*\'s items. *iterable* may be either a\n sequence, a container that supports iteration, or an iterator\n object. If *iterable* is already a list, a copy is made and\n returned, similar to "iterable[:]". For example, "list(\'abc\')"\n returns "[\'a\', \'b\', \'c\']" and "list( (1, 2, 3) )" returns "[1, 2,\n 3]". If no argument is given, the constructor creates a new empty\n list, "[]".\n\n Many other operations also produce lists, including the "sorted()"\n built-in.\n\n Lists implement all of the *common* and *mutable* sequence\n operations. Lists also provide the following additional method:\n\n sort(*, key=None, reverse=None)\n\n This method sorts the list in place, using only "<" comparisons\n between items. Exceptions are not suppressed - if any comparison\n operations fail, the entire sort operation will fail (and the\n list will likely be left in a partially modified state).\n\n "sort()" accepts two arguments that can only be passed by\n keyword (*keyword-only arguments*):\n\n *key* specifies a function of one argument that is used to\n extract a comparison key from each list element (for example,\n "key=str.lower"). The key corresponding to each item in the list\n is calculated once and then used for the entire sorting process.\n The default value of "None" means that list items are sorted\n directly without calculating a separate key value.\n\n The "functools.cmp_to_key()" utility is available to convert a\n 2.x style *cmp* function to a *key* function.\n\n *reverse* is a boolean value. If set to "True", then the list\n elements are sorted as if each comparison were reversed.\n\n This method modifies the sequence in place for economy of space\n when sorting a large sequence. To remind users that it operates\n by side effect, it does not return the sorted sequence (use\n "sorted()" to explicitly request a new sorted list instance).\n\n The "sort()" method is guaranteed to be stable. A sort is\n stable if it guarantees not to change the relative order of\n elements that compare equal --- this is helpful for sorting in\n multiple passes (for example, sort by department, then by salary\n grade).\n\n **CPython implementation detail:** While a list is being sorted,\n the effect of attempting to mutate, or even inspect, the list is\n undefined. The C implementation of Python makes the list appear\n empty for the duration, and raises "ValueError" if it can detect\n that the list has been mutated during a sort.\n\n\nTuples\n======\n\nTuples are immutable sequences, typically used to store collections of\nheterogeneous data (such as the 2-tuples produced by the "enumerate()"\nbuilt-in). Tuples are also used for cases where an immutable sequence\nof homogeneous data is needed (such as allowing storage in a "set" or\n"dict" instance).\n\nclass class tuple([iterable])\n\n Tuples may be constructed in a number of ways:\n\n * Using a pair of parentheses to denote the empty tuple: "()"\n\n * Using a trailing comma for a singleton tuple: "a," or "(a,)"\n\n * Separating items with commas: "a, b, c" or "(a, b, c)"\n\n * Using the "tuple()" built-in: "tuple()" or "tuple(iterable)"\n\n The constructor builds a tuple whose items are the same and in the\n same order as *iterable*\'s items. *iterable* may be either a\n sequence, a container that supports iteration, or an iterator\n object. If *iterable* is already a tuple, it is returned\n unchanged. For example, "tuple(\'abc\')" returns "(\'a\', \'b\', \'c\')"\n and "tuple( [1, 2, 3] )" returns "(1, 2, 3)". If no argument is\n given, the constructor creates a new empty tuple, "()".\n\n Note that it is actually the comma which makes a tuple, not the\n parentheses. The parentheses are optional, except in the empty\n tuple case, or when they are needed to avoid syntactic ambiguity.\n For example, "f(a, b, c)" is a function call with three arguments,\n while "f((a, b, c))" is a function call with a 3-tuple as the sole\n argument.\n\n Tuples implement all of the *common* sequence operations.\n\nFor heterogeneous collections of data where access by name is clearer\nthan access by index, "collections.namedtuple()" may be a more\nappropriate choice than a simple tuple object.\n\n\nRanges\n======\n\nThe "range" type represents an immutable sequence of numbers and is\ncommonly used for looping a specific number of times in "for" loops.\n\nclass class range(stop)\nclass class range(start, stop[, step])\n\n The arguments to the range constructor must be integers (either\n built-in "int" or any object that implements the "__index__"\n special method). If the *step* argument is omitted, it defaults to\n "1". If the *start* argument is omitted, it defaults to "0". If\n *step* is zero, "ValueError" is raised.\n\n For a positive *step*, the contents of a range "r" are determined\n by the formula "r[i] = start + step*i" where "i >= 0" and "r[i] <\n stop".\n\n For a negative *step*, the contents of the range are still\n determined by the formula "r[i] = start + step*i", but the\n constraints are "i >= 0" and "r[i] > stop".\n\n A range object will be empty if "r[0]" does not meet the value\n constraint. Ranges do support negative indices, but these are\n interpreted as indexing from the end of the sequence determined by\n the positive indices.\n\n Ranges containing absolute values larger than "sys.maxsize" are\n permitted but some features (such as "len()") may raise\n "OverflowError".\n\n Range examples:\n\n >>> list(range(10))\n [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n >>> list(range(1, 11))\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n >>> list(range(0, 30, 5))\n [0, 5, 10, 15, 20, 25]\n >>> list(range(0, 10, 3))\n [0, 3, 6, 9]\n >>> list(range(0, -10, -1))\n [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]\n >>> list(range(0))\n []\n >>> list(range(1, 0))\n []\n\n Ranges implement all of the *common* sequence operations except\n concatenation and repetition (due to the fact that range objects\n can only represent sequences that follow a strict pattern and\n repetition and concatenation will usually violate that pattern).\n\nThe advantage of the "range" type over a regular "list" or "tuple" is\nthat a "range" object will always take the same (small) amount of\nmemory, no matter the size of the range it represents (as it only\nstores the "start", "stop" and "step" values, calculating individual\nitems and subranges as needed).\n\nRange objects implement the "collections.abc.Sequence" ABC, and\nprovide features such as containment tests, element index lookup,\nslicing and support for negative indices (see *Sequence Types ---\nlist, tuple, range*):\n\n>>> r = range(0, 20, 2)\n>>> r\nrange(0, 20, 2)\n>>> 11 in r\nFalse\n>>> 10 in r\nTrue\n>>> r.index(10)\n5\n>>> r[5]\n10\n>>> r[:5]\nrange(0, 10, 2)\n>>> r[-1]\n18\n\nTesting range objects for equality with "==" and "!=" compares them as\nsequences. That is, two range objects are considered equal if they\nrepresent the same sequence of values. (Note that two range objects\nthat compare equal might have different "start", "stop" and "step"\nattributes, for example "range(0) == range(2, 1, 3)" or "range(0, 3,\n2) == range(0, 4, 2)".)\n\nChanged in version 3.2: Implement the Sequence ABC. Support slicing\nand negative indices. Test "int" objects for membership in constant\ntime instead of iterating through all items.\n\nChanged in version 3.3: Define \'==\' and \'!=\' to compare range objects\nbased on the sequence of values they define (instead of comparing\nbased on object identity).\n\nNew in version 3.3: The "start", "stop" and "step" attributes.\n', +- 'typesseq-mutable': b'\nMutable Sequence Types\n**********************\n\nThe operations in the following table are defined on mutable sequence\ntypes. The "collections.abc.MutableSequence" ABC is provided to make\nit easier to correctly implement these operations on custom sequence\ntypes.\n\nIn the table *s* is an instance of a mutable sequence type, *t* is any\niterable object and *x* is an arbitrary object that meets any type and\nvalue restrictions imposed by *s* (for example, "bytearray" only\naccepts integers that meet the value restriction "0 <= x <= 255").\n\n+--------------------------------+----------------------------------+-----------------------+\n| Operation | Result | Notes |\n+================================+==================================+=======================+\n| "s[i] = x" | item *i* of *s* is replaced by | |\n| | *x* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s[i:j] = t" | slice of *s* from *i* to *j* is | |\n| | replaced by the contents of the | |\n| | iterable *t* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "del s[i:j]" | same as "s[i:j] = []" | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s[i:j:k] = t" | the elements of "s[i:j:k]" are | (1) |\n| | replaced by those of *t* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "del s[i:j:k]" | removes the elements of | |\n| | "s[i:j:k]" from the list | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.append(x)" | appends *x* to the end of the | |\n| | sequence (same as | |\n| | "s[len(s):len(s)] = [x]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.clear()" | removes all items from "s" (same | (5) |\n| | as "del s[:]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.copy()" | creates a shallow copy of "s" | (5) |\n| | (same as "s[:]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.extend(t)" | extends *s* with the contents of | |\n| | *t* (same as "s[len(s):len(s)] = | |\n| | t") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.insert(i, x)" | inserts *x* into *s* at the | |\n| | index given by *i* (same as | |\n| | "s[i:i] = [x]") | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.pop([i])" | retrieves the item at *i* and | (2) |\n| | also removes it from *s* | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.remove(x)" | remove the first item from *s* | (3) |\n| | where "s[i] == x" | |\n+--------------------------------+----------------------------------+-----------------------+\n| "s.reverse()" | reverses the items of *s* in | (4) |\n| | place | |\n+--------------------------------+----------------------------------+-----------------------+\n\nNotes:\n\n1. *t* must have the same length as the slice it is replacing.\n\n2. The optional argument *i* defaults to "-1", so that by default\n the last item is removed and returned.\n\n3. "remove" raises "ValueError" when *x* is not found in *s*.\n\n4. The "reverse()" method modifies the sequence in place for\n economy of space when reversing a large sequence. To remind users\n that it operates by side effect, it does not return the reversed\n sequence.\n\n5. "clear()" and "copy()" are included for consistency with the\n interfaces of mutable containers that don\'t support slicing\n operations (such as "dict" and "set")\n\n New in version 3.3: "clear()" and "copy()" methods.\n', +- 'unary': b'\nUnary arithmetic and bitwise operations\n***************************************\n\nAll unary arithmetic and bitwise operations have the same priority:\n\n u_expr ::= power | "-" u_expr | "+" u_expr | "~" u_expr\n\nThe unary "-" (minus) operator yields the negation of its numeric\nargument.\n\nThe unary "+" (plus) operator yields its numeric argument unchanged.\n\nThe unary "~" (invert) operator yields the bitwise inversion of its\ninteger argument. The bitwise inversion of "x" is defined as\n"-(x+1)". It only applies to integral numbers.\n\nIn all three cases, if the argument does not have the proper type, a\n"TypeError" exception is raised.\n', +- 'while': b'\nThe "while" statement\n*********************\n\nThe "while" statement is used for repeated execution as long as an\nexpression is true:\n\n while_stmt ::= "while" expression ":" suite\n ["else" ":" suite]\n\nThis repeatedly tests the expression and, if it is true, executes the\nfirst suite; if the expression is false (which may be the first time\nit is tested) the suite of the "else" clause, if present, is executed\nand the loop terminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and goes back\nto testing the expression.\n', +- 'with': b'\nThe "with" statement\n********************\n\nThe "with" statement is used to wrap the execution of a block with\nmethods defined by a context manager (see section *With Statement\nContext Managers*). This allows common "try"..."except"..."finally"\nusage patterns to be encapsulated for convenient reuse.\n\n with_stmt ::= "with" with_item ("," with_item)* ":" suite\n with_item ::= expression ["as" target]\n\nThe execution of the "with" statement with one "item" proceeds as\nfollows:\n\n1. The context expression (the expression given in the "with_item")\n is evaluated to obtain a context manager.\n\n2. The context manager\'s "__exit__()" is loaded for later use.\n\n3. The context manager\'s "__enter__()" method is invoked.\n\n4. If a target was included in the "with" statement, the return\n value from "__enter__()" is assigned to it.\n\n Note: The "with" statement guarantees that if the "__enter__()"\n method returns without an error, then "__exit__()" will always be\n called. Thus, if an error occurs during the assignment to the\n target list, it will be treated the same as an error occurring\n within the suite would be. See step 6 below.\n\n5. The suite is executed.\n\n6. The context manager\'s "__exit__()" method is invoked. If an\n exception caused the suite to be exited, its type, value, and\n traceback are passed as arguments to "__exit__()". Otherwise, three\n "None" arguments are supplied.\n\n If the suite was exited due to an exception, and the return value\n from the "__exit__()" method was false, the exception is reraised.\n If the return value was true, the exception is suppressed, and\n execution continues with the statement following the "with"\n statement.\n\n If the suite was exited for any reason other than an exception, the\n return value from "__exit__()" is ignored, and execution proceeds\n at the normal location for the kind of exit that was taken.\n\nWith more than one item, the context managers are processed as if\nmultiple "with" statements were nested:\n\n with A() as a, B() as b:\n suite\n\nis equivalent to\n\n with A() as a:\n with B() as b:\n suite\n\nChanged in version 3.1: Support for multiple context expressions.\n\nSee also: **PEP 0343** - The "with" statement\n\n The specification, background, and examples for the Python "with"\n statement.\n', +- 'yield': b'\nThe "yield" statement\n*********************\n\n yield_stmt ::= yield_expression\n\nA "yield" statement is semantically equivalent to a *yield\nexpression*. The yield statement can be used to omit the parentheses\nthat would otherwise be required in the equivalent yield expression\nstatement. For example, the yield statements\n\n yield \n yield from \n\nare equivalent to the yield expression statements\n\n (yield )\n (yield from )\n\nYield expressions and statements are only used when defining a\n*generator* function, and are only used in the body of the generator\nfunction. Using yield in a function definition is sufficient to cause\nthat definition to create a generator function instead of a normal\nfunction.\n\nFor full details of "yield" semantics, refer to the *Yield\nexpressions* section.\n'} ++# Autogenerated by Sphinx on Mon Sep 22 23:49:46 2014 ++topics = {'assert': '\n' ++ 'The "assert" statement\n' ++ '**********************\n' ++ '\n' ++ 'Assert statements are a convenient way to insert debugging ' ++ 'assertions\n' ++ 'into a program:\n' ++ '\n' ++ ' assert_stmt ::= "assert" expression ["," expression]\n' ++ '\n' ++ 'The simple form, "assert expression", is equivalent to\n' ++ '\n' ++ ' if __debug__:\n' ++ ' if not expression: raise AssertionError\n' ++ '\n' ++ 'The extended form, "assert expression1, expression2", is ' ++ 'equivalent to\n' ++ '\n' ++ ' if __debug__:\n' ++ ' if not expression1: raise AssertionError(expression2)\n' ++ '\n' ++ 'These equivalences assume that "__debug__" and "AssertionError" ' ++ 'refer\n' ++ 'to the built-in variables with those names. In the current\n' ++ 'implementation, the built-in variable "__debug__" is "True" ' ++ 'under\n' ++ 'normal circumstances, "False" when optimization is requested ' ++ '(command\n' ++ 'line option -O). The current code generator emits no code for ' ++ 'an\n' ++ 'assert statement when optimization is requested at compile ' ++ 'time. Note\n' ++ 'that it is unnecessary to include the source code for the ' ++ 'expression\n' ++ 'that failed in the error message; it will be displayed as part ' ++ 'of the\n' ++ 'stack trace.\n' ++ '\n' ++ 'Assignments to "__debug__" are illegal. The value for the ' ++ 'built-in\n' ++ 'variable is determined when the interpreter starts.\n', ++ 'assignment': '\n' ++ 'Assignment statements\n' ++ '*********************\n' ++ '\n' ++ 'Assignment statements are used to (re)bind names to values ' ++ 'and to\n' ++ 'modify attributes or items of mutable objects:\n' ++ '\n' ++ ' assignment_stmt ::= (target_list "=")+ (expression_list | ' ++ 'yield_expression)\n' ++ ' target_list ::= target ("," target)* [","]\n' ++ ' target ::= identifier\n' ++ ' | "(" target_list ")"\n' ++ ' | "[" target_list "]"\n' ++ ' | attributeref\n' ++ ' | subscription\n' ++ ' | slicing\n' ++ ' | "*" target\n' ++ '\n' ++ '(See section *Primaries* for the syntax definitions for\n' ++ '*attributeref*, *subscription*, and *slicing*.)\n' ++ '\n' ++ 'An assignment statement evaluates the expression list ' ++ '(remember that\n' ++ 'this can be a single expression or a comma-separated list, ' ++ 'the latter\n' ++ 'yielding a tuple) and assigns the single resulting object to ' ++ 'each of\n' ++ 'the target lists, from left to right.\n' ++ '\n' ++ 'Assignment is defined recursively depending on the form of ' ++ 'the target\n' ++ '(list). When a target is part of a mutable object (an ' ++ 'attribute\n' ++ 'reference, subscription or slicing), the mutable object ' ++ 'must\n' ++ 'ultimately perform the assignment and decide about its ' ++ 'validity, and\n' ++ 'may raise an exception if the assignment is unacceptable. ' ++ 'The rules\n' ++ 'observed by various types and the exceptions raised are ' ++ 'given with the\n' ++ 'definition of the object types (see section *The standard ' ++ 'type\n' ++ 'hierarchy*).\n' ++ '\n' ++ 'Assignment of an object to a target list, optionally ' ++ 'enclosed in\n' ++ 'parentheses or square brackets, is recursively defined as ' ++ 'follows.\n' ++ '\n' ++ '* If the target list is a single target: The object is ' ++ 'assigned to\n' ++ ' that target.\n' ++ '\n' ++ '* If the target list is a comma-separated list of targets: ' ++ 'The\n' ++ ' object must be an iterable with the same number of items ' ++ 'as there\n' ++ ' are targets in the target list, and the items are ' ++ 'assigned, from\n' ++ ' left to right, to the corresponding targets.\n' ++ '\n' ++ ' * If the target list contains one target prefixed with an\n' ++ ' asterisk, called a "starred" target: The object must be ' ++ 'a sequence\n' ++ ' with at least as many items as there are targets in the ' ++ 'target\n' ++ ' list, minus one. The first items of the sequence are ' ++ 'assigned,\n' ++ ' from left to right, to the targets before the starred ' ++ 'target. The\n' ++ ' final items of the sequence are assigned to the targets ' ++ 'after the\n' ++ ' starred target. A list of the remaining items in the ' ++ 'sequence is\n' ++ ' then assigned to the starred target (the list can be ' ++ 'empty).\n' ++ '\n' ++ ' * Else: The object must be a sequence with the same number ' ++ 'of\n' ++ ' items as there are targets in the target list, and the ' ++ 'items are\n' ++ ' assigned, from left to right, to the corresponding ' ++ 'targets.\n' ++ '\n' ++ 'Assignment of an object to a single target is recursively ' ++ 'defined as\n' ++ 'follows.\n' ++ '\n' ++ '* If the target is an identifier (name):\n' ++ '\n' ++ ' * If the name does not occur in a "global" or "nonlocal" ' ++ 'statement\n' ++ ' in the current code block: the name is bound to the ' ++ 'object in the\n' ++ ' current local namespace.\n' ++ '\n' ++ ' * Otherwise: the name is bound to the object in the ' ++ 'global\n' ++ ' namespace or the outer namespace determined by ' ++ '"nonlocal",\n' ++ ' respectively.\n' ++ '\n' ++ ' The name is rebound if it was already bound. This may ' ++ 'cause the\n' ++ ' reference count for the object previously bound to the ' ++ 'name to reach\n' ++ ' zero, causing the object to be deallocated and its ' ++ 'destructor (if it\n' ++ ' has one) to be called.\n' ++ '\n' ++ '* If the target is a target list enclosed in parentheses or ' ++ 'in\n' ++ ' square brackets: The object must be an iterable with the ' ++ 'same number\n' ++ ' of items as there are targets in the target list, and its ' ++ 'items are\n' ++ ' assigned, from left to right, to the corresponding ' ++ 'targets.\n' ++ '\n' ++ '* If the target is an attribute reference: The primary ' ++ 'expression in\n' ++ ' the reference is evaluated. It should yield an object ' ++ 'with\n' ++ ' assignable attributes; if this is not the case, ' ++ '"TypeError" is\n' ++ ' raised. That object is then asked to assign the assigned ' ++ 'object to\n' ++ ' the given attribute; if it cannot perform the assignment, ' ++ 'it raises\n' ++ ' an exception (usually but not necessarily ' ++ '"AttributeError").\n' ++ '\n' ++ ' Note: If the object is a class instance and the attribute ' ++ 'reference\n' ++ ' occurs on both sides of the assignment operator, the RHS ' ++ 'expression,\n' ++ ' "a.x" can access either an instance attribute or (if no ' ++ 'instance\n' ++ ' attribute exists) a class attribute. The LHS target "a.x" ' ++ 'is always\n' ++ ' set as an instance attribute, creating it if necessary. ' ++ 'Thus, the\n' ++ ' two occurrences of "a.x" do not necessarily refer to the ' ++ 'same\n' ++ ' attribute: if the RHS expression refers to a class ' ++ 'attribute, the\n' ++ ' LHS creates a new instance attribute as the target of the\n' ++ ' assignment:\n' ++ '\n' ++ ' class Cls:\n' ++ ' x = 3 # class variable\n' ++ ' inst = Cls()\n' ++ ' inst.x = inst.x + 1 # writes inst.x as 4 leaving ' ++ 'Cls.x as 3\n' ++ '\n' ++ ' This description does not necessarily apply to descriptor\n' ++ ' attributes, such as properties created with "property()".\n' ++ '\n' ++ '* If the target is a subscription: The primary expression in ' ++ 'the\n' ++ ' reference is evaluated. It should yield either a mutable ' ++ 'sequence\n' ++ ' object (such as a list) or a mapping object (such as a ' ++ 'dictionary).\n' ++ ' Next, the subscript expression is evaluated.\n' ++ '\n' ++ ' If the primary is a mutable sequence object (such as a ' ++ 'list), the\n' ++ ' subscript must yield an integer. If it is negative, the ' ++ "sequence's\n" ++ ' length is added to it. The resulting value must be a ' ++ 'nonnegative\n' ++ " integer less than the sequence's length, and the sequence " ++ 'is asked\n' ++ ' to assign the assigned object to its item with that ' ++ 'index. If the\n' ++ ' index is out of range, "IndexError" is raised (assignment ' ++ 'to a\n' ++ ' subscripted sequence cannot add new items to a list).\n' ++ '\n' ++ ' If the primary is a mapping object (such as a dictionary), ' ++ 'the\n' ++ " subscript must have a type compatible with the mapping's " ++ 'key type,\n' ++ ' and the mapping is then asked to create a key/datum pair ' ++ 'which maps\n' ++ ' the subscript to the assigned object. This can either ' ++ 'replace an\n' ++ ' existing key/value pair with the same key value, or insert ' ++ 'a new\n' ++ ' key/value pair (if no key with the same value existed).\n' ++ '\n' ++ ' For user-defined objects, the "__setitem__()" method is ' ++ 'called with\n' ++ ' appropriate arguments.\n' ++ '\n' ++ '* If the target is a slicing: The primary expression in the\n' ++ ' reference is evaluated. It should yield a mutable ' ++ 'sequence object\n' ++ ' (such as a list). The assigned object should be a ' ++ 'sequence object\n' ++ ' of the same type. Next, the lower and upper bound ' ++ 'expressions are\n' ++ ' evaluated, insofar they are present; defaults are zero and ' ++ 'the\n' ++ " sequence's length. The bounds should evaluate to " ++ 'integers. If\n' ++ " either bound is negative, the sequence's length is added " ++ 'to it. The\n' ++ ' resulting bounds are clipped to lie between zero and the ' ++ "sequence's\n" ++ ' length, inclusive. Finally, the sequence object is asked ' ++ 'to replace\n' ++ ' the slice with the items of the assigned sequence. The ' ++ 'length of\n' ++ ' the slice may be different from the length of the assigned ' ++ 'sequence,\n' ++ ' thus changing the length of the target sequence, if the ' ++ 'target\n' ++ ' sequence allows it.\n' ++ '\n' ++ '**CPython implementation detail:** In the current ' ++ 'implementation, the\n' ++ 'syntax for targets is taken to be the same as for ' ++ 'expressions, and\n' ++ 'invalid syntax is rejected during the code generation phase, ' ++ 'causing\n' ++ 'less detailed error messages.\n' ++ '\n' ++ 'Although the definition of assignment implies that overlaps ' ++ 'between\n' ++ 'the left-hand side and the right-hand side are ' ++ "'simultanenous' (for\n" ++ 'example "a, b = b, a" swaps two variables), overlaps ' ++ '*within* the\n' ++ 'collection of assigned-to variables occur left-to-right, ' ++ 'sometimes\n' ++ 'resulting in confusion. For instance, the following program ' ++ 'prints\n' ++ '"[0, 2]":\n' ++ '\n' ++ ' x = [0, 1]\n' ++ ' i = 0\n' ++ ' i, x[i] = 1, 2 # i is updated, then x[i] is ' ++ 'updated\n' ++ ' print(x)\n' ++ '\n' ++ 'See also: **PEP 3132** - Extended Iterable Unpacking\n' ++ '\n' ++ ' The specification for the "*target" feature.\n' ++ '\n' ++ '\n' ++ 'Augmented assignment statements\n' ++ '===============================\n' ++ '\n' ++ 'Augmented assignment is the combination, in a single ' ++ 'statement, of a\n' ++ 'binary operation and an assignment statement:\n' ++ '\n' ++ ' augmented_assignment_stmt ::= augtarget augop ' ++ '(expression_list | yield_expression)\n' ++ ' augtarget ::= identifier | attributeref | ' ++ 'subscription | slicing\n' ++ ' augop ::= "+=" | "-=" | "*=" | "/=" | ' ++ '"//=" | "%=" | "**="\n' ++ ' | ">>=" | "<<=" | "&=" | "^=" | "|="\n' ++ '\n' ++ '(See section *Primaries* for the syntax definitions of the ' ++ 'last three\n' ++ 'symbols.)\n' ++ '\n' ++ 'An augmented assignment evaluates the target (which, unlike ' ++ 'normal\n' ++ 'assignment statements, cannot be an unpacking) and the ' ++ 'expression\n' ++ 'list, performs the binary operation specific to the type of ' ++ 'assignment\n' ++ 'on the two operands, and assigns the result to the original ' ++ 'target.\n' ++ 'The target is only evaluated once.\n' ++ '\n' ++ 'An augmented assignment expression like "x += 1" can be ' ++ 'rewritten as\n' ++ '"x = x + 1" to achieve a similar, but not exactly equal ' ++ 'effect. In the\n' ++ 'augmented version, "x" is only evaluated once. Also, when ' ++ 'possible,\n' ++ 'the actual operation is performed *in-place*, meaning that ' ++ 'rather than\n' ++ 'creating a new object and assigning that to the target, the ' ++ 'old object\n' ++ 'is modified instead.\n' ++ '\n' ++ 'Unlike normal assignments, augmented assignments evaluate ' ++ 'the left-\n' ++ 'hand side *before* evaluating the right-hand side. For ' ++ 'example, "a[i]\n' ++ '+= f(x)" first looks-up "a[i]", then it evaluates "f(x)" and ' ++ 'performs\n' ++ 'the addition, and lastly, it writes the result back to ' ++ '"a[i]".\n' ++ '\n' ++ 'With the exception of assigning to tuples and multiple ' ++ 'targets in a\n' ++ 'single statement, the assignment done by augmented ' ++ 'assignment\n' ++ 'statements is handled the same way as normal assignments. ' ++ 'Similarly,\n' ++ 'with the exception of the possible *in-place* behavior, the ' ++ 'binary\n' ++ 'operation performed by augmented assignment is the same as ' ++ 'the normal\n' ++ 'binary operations.\n' ++ '\n' ++ 'For targets which are attribute references, the same *caveat ' ++ 'about\n' ++ 'class and instance attributes* applies as for regular ' ++ 'assignments.\n', ++ 'atom-identifiers': '\n' ++ 'Identifiers (Names)\n' ++ '*******************\n' ++ '\n' ++ 'An identifier occurring as an atom is a name. See ' ++ 'section\n' ++ '*Identifiers and keywords* for lexical definition and ' ++ 'section *Naming\n' ++ 'and binding* for documentation of naming and binding.\n' ++ '\n' ++ 'When the name is bound to an object, evaluation of the ' ++ 'atom yields\n' ++ 'that object. When a name is not bound, an attempt to ' ++ 'evaluate it\n' ++ 'raises a "NameError" exception.\n' ++ '\n' ++ '**Private name mangling:** When an identifier that ' ++ 'textually occurs in\n' ++ 'a class definition begins with two or more underscore ' ++ 'characters and\n' ++ 'does not end in two or more underscores, it is ' ++ 'considered a *private\n' ++ 'name* of that class. Private names are transformed to ' ++ 'a longer form\n' ++ 'before code is generated for them. The transformation ' ++ 'inserts the\n' ++ 'class name, with leading underscores removed and a ' ++ 'single underscore\n' ++ 'inserted, in front of the name. For example, the ' ++ 'identifier "__spam"\n' ++ 'occurring in a class named "Ham" will be transformed ' ++ 'to "_Ham__spam".\n' ++ 'This transformation is independent of the syntactical ' ++ 'context in which\n' ++ 'the identifier is used. If the transformed name is ' ++ 'extremely long\n' ++ '(longer than 255 characters), implementation defined ' ++ 'truncation may\n' ++ 'happen. If the class name consists only of ' ++ 'underscores, no\n' ++ 'transformation is done.\n', ++ 'atom-literals': '\n' ++ 'Literals\n' ++ '********\n' ++ '\n' ++ 'Python supports string and bytes literals and various ' ++ 'numeric\n' ++ 'literals:\n' ++ '\n' ++ ' literal ::= stringliteral | bytesliteral\n' ++ ' | integer | floatnumber | imagnumber\n' ++ '\n' ++ 'Evaluation of a literal yields an object of the given ' ++ 'type (string,\n' ++ 'bytes, integer, floating point number, complex number) ' ++ 'with the given\n' ++ 'value. The value may be approximated in the case of ' ++ 'floating point\n' ++ 'and imaginary (complex) literals. See section *Literals* ' ++ 'for details.\n' ++ '\n' ++ 'All literals correspond to immutable data types, and ' ++ 'hence the\n' ++ "object's identity is less important than its value. " ++ 'Multiple\n' ++ 'evaluations of literals with the same value (either the ' ++ 'same\n' ++ 'occurrence in the program text or a different occurrence) ' ++ 'may obtain\n' ++ 'the same object or a different object with the same ' ++ 'value.\n', ++ 'attribute-access': '\n' ++ 'Customizing attribute access\n' ++ '****************************\n' ++ '\n' ++ 'The following methods can be defined to customize the ' ++ 'meaning of\n' ++ 'attribute access (use of, assignment to, or deletion ' ++ 'of "x.name") for\n' ++ 'class instances.\n' ++ '\n' ++ 'object.__getattr__(self, name)\n' ++ '\n' ++ ' Called when an attribute lookup has not found the ' ++ 'attribute in the\n' ++ ' usual places (i.e. it is not an instance attribute ' ++ 'nor is it found\n' ++ ' in the class tree for "self"). "name" is the ' ++ 'attribute name. This\n' ++ ' method should return the (computed) attribute value ' ++ 'or raise an\n' ++ ' "AttributeError" exception.\n' ++ '\n' ++ ' Note that if the attribute is found through the ' ++ 'normal mechanism,\n' ++ ' "__getattr__()" is not called. (This is an ' ++ 'intentional asymmetry\n' ++ ' between "__getattr__()" and "__setattr__()".) This ' ++ 'is done both for\n' ++ ' efficiency reasons and because otherwise ' ++ '"__getattr__()" would have\n' ++ ' no way to access other attributes of the instance. ' ++ 'Note that at\n' ++ ' least for instance variables, you can fake total ' ++ 'control by not\n' ++ ' inserting any values in the instance attribute ' ++ 'dictionary (but\n' ++ ' instead inserting them in another object). See ' ++ 'the\n' ++ ' "__getattribute__()" method below for a way to ' ++ 'actually get total\n' ++ ' control over attribute access.\n' ++ '\n' ++ 'object.__getattribute__(self, name)\n' ++ '\n' ++ ' Called unconditionally to implement attribute ' ++ 'accesses for\n' ++ ' instances of the class. If the class also defines ' ++ '"__getattr__()",\n' ++ ' the latter will not be called unless ' ++ '"__getattribute__()" either\n' ++ ' calls it explicitly or raises an "AttributeError". ' ++ 'This method\n' ++ ' should return the (computed) attribute value or ' ++ 'raise an\n' ++ ' "AttributeError" exception. In order to avoid ' ++ 'infinite recursion in\n' ++ ' this method, its implementation should always call ' ++ 'the base class\n' ++ ' method with the same name to access any attributes ' ++ 'it needs, for\n' ++ ' example, "object.__getattribute__(self, name)".\n' ++ '\n' ++ ' Note: This method may still be bypassed when ' ++ 'looking up special\n' ++ ' methods as the result of implicit invocation via ' ++ 'language syntax\n' ++ ' or built-in functions. See *Special method ' ++ 'lookup*.\n' ++ '\n' ++ 'object.__setattr__(self, name, value)\n' ++ '\n' ++ ' Called when an attribute assignment is attempted. ' ++ 'This is called\n' ++ ' instead of the normal mechanism (i.e. store the ' ++ 'value in the\n' ++ ' instance dictionary). *name* is the attribute name, ' ++ '*value* is the\n' ++ ' value to be assigned to it.\n' ++ '\n' ++ ' If "__setattr__()" wants to assign to an instance ' ++ 'attribute, it\n' ++ ' should call the base class method with the same ' ++ 'name, for example,\n' ++ ' "object.__setattr__(self, name, value)".\n' ++ '\n' ++ 'object.__delattr__(self, name)\n' ++ '\n' ++ ' Like "__setattr__()" but for attribute deletion ' ++ 'instead of\n' ++ ' assignment. This should only be implemented if ' ++ '"del obj.name" is\n' ++ ' meaningful for the object.\n' ++ '\n' ++ 'object.__dir__(self)\n' ++ '\n' ++ ' Called when "dir()" is called on the object. A ' ++ 'sequence must be\n' ++ ' returned. "dir()" converts the returned sequence to ' ++ 'a list and\n' ++ ' sorts it.\n' ++ '\n' ++ '\n' ++ 'Implementing Descriptors\n' ++ '========================\n' ++ '\n' ++ 'The following methods only apply when an instance of ' ++ 'the class\n' ++ 'containing the method (a so-called *descriptor* class) ' ++ 'appears in an\n' ++ '*owner* class (the descriptor must be in either the ' ++ "owner's class\n" ++ 'dictionary or in the class dictionary for one of its ' ++ 'parents). In the\n' ++ 'examples below, "the attribute" refers to the ' ++ 'attribute whose name is\n' ++ "the key of the property in the owner class' " ++ '"__dict__".\n' ++ '\n' ++ 'object.__get__(self, instance, owner)\n' ++ '\n' ++ ' Called to get the attribute of the owner class ' ++ '(class attribute\n' ++ ' access) or of an instance of that class (instance ' ++ 'attribute\n' ++ ' access). *owner* is always the owner class, while ' ++ '*instance* is the\n' ++ ' instance that the attribute was accessed through, ' ++ 'or "None" when\n' ++ ' the attribute is accessed through the *owner*. ' ++ 'This method should\n' ++ ' return the (computed) attribute value or raise an ' ++ '"AttributeError"\n' ++ ' exception.\n' ++ '\n' ++ 'object.__set__(self, instance, value)\n' ++ '\n' ++ ' Called to set the attribute on an instance ' ++ '*instance* of the owner\n' ++ ' class to a new value, *value*.\n' ++ '\n' ++ 'object.__delete__(self, instance)\n' ++ '\n' ++ ' Called to delete the attribute on an instance ' ++ '*instance* of the\n' ++ ' owner class.\n' ++ '\n' ++ 'The attribute "__objclass__" is interpreted by the ' ++ '"inspect" module as\n' ++ 'specifying the class where this object was defined ' ++ '(setting this\n' ++ 'appropriately can assist in runtime introspection of ' ++ 'dynamic class\n' ++ 'attributes). For callables, it may indicate that an ' ++ 'instance of the\n' ++ 'given type (or a subclass) is expected or required as ' ++ 'the first\n' ++ 'positional argument (for example, CPython sets this ' ++ 'attribute for\n' ++ 'unbound methods that are implemented in C).\n' ++ '\n' ++ '\n' ++ 'Invoking Descriptors\n' ++ '====================\n' ++ '\n' ++ 'In general, a descriptor is an object attribute with ' ++ '"binding\n' ++ 'behavior", one whose attribute access has been ' ++ 'overridden by methods\n' ++ 'in the descriptor protocol: "__get__()", "__set__()", ' ++ 'and\n' ++ '"__delete__()". If any of those methods are defined ' ++ 'for an object, it\n' ++ 'is said to be a descriptor.\n' ++ '\n' ++ 'The default behavior for attribute access is to get, ' ++ 'set, or delete\n' ++ "the attribute from an object's dictionary. For " ++ 'instance, "a.x" has a\n' ++ 'lookup chain starting with "a.__dict__[\'x\']", then\n' ++ '"type(a).__dict__[\'x\']", and continuing through the ' ++ 'base classes of\n' ++ '"type(a)" excluding metaclasses.\n' ++ '\n' ++ 'However, if the looked-up value is an object defining ' ++ 'one of the\n' ++ 'descriptor methods, then Python may override the ' ++ 'default behavior and\n' ++ 'invoke the descriptor method instead. Where this ' ++ 'occurs in the\n' ++ 'precedence chain depends on which descriptor methods ' ++ 'were defined and\n' ++ 'how they were called.\n' ++ '\n' ++ 'The starting point for descriptor invocation is a ' ++ 'binding, "a.x". How\n' ++ 'the arguments are assembled depends on "a":\n' ++ '\n' ++ 'Direct Call\n' ++ ' The simplest and least common call is when user ' ++ 'code directly\n' ++ ' invokes a descriptor method: "x.__get__(a)".\n' ++ '\n' ++ 'Instance Binding\n' ++ ' If binding to an object instance, "a.x" is ' ++ 'transformed into the\n' ++ ' call: "type(a).__dict__[\'x\'].__get__(a, ' ++ 'type(a))".\n' ++ '\n' ++ 'Class Binding\n' ++ ' If binding to a class, "A.x" is transformed into ' ++ 'the call:\n' ++ ' "A.__dict__[\'x\'].__get__(None, A)".\n' ++ '\n' ++ 'Super Binding\n' ++ ' If "a" is an instance of "super", then the binding ' ++ '"super(B,\n' ++ ' obj).m()" searches "obj.__class__.__mro__" for the ' ++ 'base class "A"\n' ++ ' immediately preceding "B" and then invokes the ' ++ 'descriptor with the\n' ++ ' call: "A.__dict__[\'m\'].__get__(obj, ' ++ 'obj.__class__)".\n' ++ '\n' ++ 'For instance bindings, the precedence of descriptor ' ++ 'invocation depends\n' ++ 'on the which descriptor methods are defined. A ' ++ 'descriptor can define\n' ++ 'any combination of "__get__()", "__set__()" and ' ++ '"__delete__()". If it\n' ++ 'does not define "__get__()", then accessing the ' ++ 'attribute will return\n' ++ 'the descriptor object itself unless there is a value ' ++ "in the object's\n" ++ 'instance dictionary. If the descriptor defines ' ++ '"__set__()" and/or\n' ++ '"__delete__()", it is a data descriptor; if it defines ' ++ 'neither, it is\n' ++ 'a non-data descriptor. Normally, data descriptors ' ++ 'define both\n' ++ '"__get__()" and "__set__()", while non-data ' ++ 'descriptors have just the\n' ++ '"__get__()" method. Data descriptors with "__set__()" ' ++ 'and "__get__()"\n' ++ 'defined always override a redefinition in an instance ' ++ 'dictionary. In\n' ++ 'contrast, non-data descriptors can be overridden by ' ++ 'instances.\n' ++ '\n' ++ 'Python methods (including "staticmethod()" and ' ++ '"classmethod()") are\n' ++ 'implemented as non-data descriptors. Accordingly, ' ++ 'instances can\n' ++ 'redefine and override methods. This allows individual ' ++ 'instances to\n' ++ 'acquire behaviors that differ from other instances of ' ++ 'the same class.\n' ++ '\n' ++ 'The "property()" function is implemented as a data ' ++ 'descriptor.\n' ++ 'Accordingly, instances cannot override the behavior of ' ++ 'a property.\n' ++ '\n' ++ '\n' ++ '__slots__\n' ++ '=========\n' ++ '\n' ++ 'By default, instances of classes have a dictionary for ' ++ 'attribute\n' ++ 'storage. This wastes space for objects having very ' ++ 'few instance\n' ++ 'variables. The space consumption can become acute ' ++ 'when creating large\n' ++ 'numbers of instances.\n' ++ '\n' ++ 'The default can be overridden by defining *__slots__* ' ++ 'in a class\n' ++ 'definition. The *__slots__* declaration takes a ' ++ 'sequence of instance\n' ++ 'variables and reserves just enough space in each ' ++ 'instance to hold a\n' ++ 'value for each variable. Space is saved because ' ++ '*__dict__* is not\n' ++ 'created for each instance.\n' ++ '\n' ++ 'object.__slots__\n' ++ '\n' ++ ' This class variable can be assigned a string, ' ++ 'iterable, or sequence\n' ++ ' of strings with variable names used by instances. ' ++ 'If defined in a\n' ++ ' class, *__slots__* reserves space for the declared ' ++ 'variables and\n' ++ ' prevents the automatic creation of *__dict__* and ' ++ '*__weakref__* for\n' ++ ' each instance.\n' ++ '\n' ++ '\n' ++ 'Notes on using *__slots__*\n' ++ '--------------------------\n' ++ '\n' ++ '* When inheriting from a class without *__slots__*, ' ++ 'the *__dict__*\n' ++ ' attribute of that class will always be accessible, ' ++ 'so a *__slots__*\n' ++ ' definition in the subclass is meaningless.\n' ++ '\n' ++ '* Without a *__dict__* variable, instances cannot be ' ++ 'assigned new\n' ++ ' variables not listed in the *__slots__* definition. ' ++ 'Attempts to\n' ++ ' assign to an unlisted variable name raises ' ++ '"AttributeError". If\n' ++ ' dynamic assignment of new variables is desired, then ' ++ 'add\n' ++ ' "\'__dict__\'" to the sequence of strings in the ' ++ '*__slots__*\n' ++ ' declaration.\n' ++ '\n' ++ '* Without a *__weakref__* variable for each instance, ' ++ 'classes\n' ++ ' defining *__slots__* do not support weak references ' ++ 'to its\n' ++ ' instances. If weak reference support is needed, then ' ++ 'add\n' ++ ' "\'__weakref__\'" to the sequence of strings in the ' ++ '*__slots__*\n' ++ ' declaration.\n' ++ '\n' ++ '* *__slots__* are implemented at the class level by ' ++ 'creating\n' ++ ' descriptors (*Implementing Descriptors*) for each ' ++ 'variable name. As\n' ++ ' a result, class attributes cannot be used to set ' ++ 'default values for\n' ++ ' instance variables defined by *__slots__*; ' ++ 'otherwise, the class\n' ++ ' attribute would overwrite the descriptor ' ++ 'assignment.\n' ++ '\n' ++ '* The action of a *__slots__* declaration is limited ' ++ 'to the class\n' ++ ' where it is defined. As a result, subclasses will ' ++ 'have a *__dict__*\n' ++ ' unless they also define *__slots__* (which must only ' ++ 'contain names\n' ++ ' of any *additional* slots).\n' ++ '\n' ++ '* If a class defines a slot also defined in a base ' ++ 'class, the\n' ++ ' instance variable defined by the base class slot is ' ++ 'inaccessible\n' ++ ' (except by retrieving its descriptor directly from ' ++ 'the base class).\n' ++ ' This renders the meaning of the program undefined. ' ++ 'In the future, a\n' ++ ' check may be added to prevent this.\n' ++ '\n' ++ '* Nonempty *__slots__* does not work for classes ' ++ 'derived from\n' ++ ' "variable-length" built-in types such as "int", ' ++ '"bytes" and "tuple".\n' ++ '\n' ++ '* Any non-string iterable may be assigned to ' ++ '*__slots__*. Mappings\n' ++ ' may also be used; however, in the future, special ' ++ 'meaning may be\n' ++ ' assigned to the values corresponding to each key.\n' ++ '\n' ++ '* *__class__* assignment works only if both classes ' ++ 'have the same\n' ++ ' *__slots__*.\n', ++ 'attribute-references': '\n' ++ 'Attribute references\n' ++ '********************\n' ++ '\n' ++ 'An attribute reference is a primary followed by a ' ++ 'period and a name:\n' ++ '\n' ++ ' attributeref ::= primary "." identifier\n' ++ '\n' ++ 'The primary must evaluate to an object of a type ' ++ 'that supports\n' ++ 'attribute references, which most objects do. This ' ++ 'object is then\n' ++ 'asked to produce the attribute whose name is the ' ++ 'identifier. This\n' ++ 'production can be customized by overriding the ' ++ '"__getattr__()" method.\n' ++ 'If this attribute is not available, the exception ' ++ '"AttributeError" is\n' ++ 'raised. Otherwise, the type and value of the ' ++ 'object produced is\n' ++ 'determined by the object. Multiple evaluations of ' ++ 'the same attribute\n' ++ 'reference may yield different objects.\n', ++ 'augassign': '\n' ++ 'Augmented assignment statements\n' ++ '*******************************\n' ++ '\n' ++ 'Augmented assignment is the combination, in a single ' ++ 'statement, of a\n' ++ 'binary operation and an assignment statement:\n' ++ '\n' ++ ' augmented_assignment_stmt ::= augtarget augop ' ++ '(expression_list | yield_expression)\n' ++ ' augtarget ::= identifier | attributeref | ' ++ 'subscription | slicing\n' ++ ' augop ::= "+=" | "-=" | "*=" | "/=" | ' ++ '"//=" | "%=" | "**="\n' ++ ' | ">>=" | "<<=" | "&=" | "^=" | "|="\n' ++ '\n' ++ '(See section *Primaries* for the syntax definitions of the ' ++ 'last three\n' ++ 'symbols.)\n' ++ '\n' ++ 'An augmented assignment evaluates the target (which, unlike ' ++ 'normal\n' ++ 'assignment statements, cannot be an unpacking) and the ' ++ 'expression\n' ++ 'list, performs the binary operation specific to the type of ' ++ 'assignment\n' ++ 'on the two operands, and assigns the result to the original ' ++ 'target.\n' ++ 'The target is only evaluated once.\n' ++ '\n' ++ 'An augmented assignment expression like "x += 1" can be ' ++ 'rewritten as\n' ++ '"x = x + 1" to achieve a similar, but not exactly equal ' ++ 'effect. In the\n' ++ 'augmented version, "x" is only evaluated once. Also, when ' ++ 'possible,\n' ++ 'the actual operation is performed *in-place*, meaning that ' ++ 'rather than\n' ++ 'creating a new object and assigning that to the target, the ' ++ 'old object\n' ++ 'is modified instead.\n' ++ '\n' ++ 'Unlike normal assignments, augmented assignments evaluate the ' ++ 'left-\n' ++ 'hand side *before* evaluating the right-hand side. For ' ++ 'example, "a[i]\n' ++ '+= f(x)" first looks-up "a[i]", then it evaluates "f(x)" and ' ++ 'performs\n' ++ 'the addition, and lastly, it writes the result back to ' ++ '"a[i]".\n' ++ '\n' ++ 'With the exception of assigning to tuples and multiple ' ++ 'targets in a\n' ++ 'single statement, the assignment done by augmented ' ++ 'assignment\n' ++ 'statements is handled the same way as normal assignments. ' ++ 'Similarly,\n' ++ 'with the exception of the possible *in-place* behavior, the ' ++ 'binary\n' ++ 'operation performed by augmented assignment is the same as ' ++ 'the normal\n' ++ 'binary operations.\n' ++ '\n' ++ 'For targets which are attribute references, the same *caveat ' ++ 'about\n' ++ 'class and instance attributes* applies as for regular ' ++ 'assignments.\n', ++ 'binary': '\n' ++ 'Binary arithmetic operations\n' ++ '****************************\n' ++ '\n' ++ 'The binary arithmetic operations have the conventional priority\n' ++ 'levels. Note that some of these operations also apply to ' ++ 'certain non-\n' ++ 'numeric types. Apart from the power operator, there are only ' ++ 'two\n' ++ 'levels, one for multiplicative operators and one for additive\n' ++ 'operators:\n' ++ '\n' ++ ' m_expr ::= u_expr | m_expr "*" u_expr | m_expr "//" u_expr | ' ++ 'm_expr "/" u_expr\n' ++ ' | m_expr "%" u_expr\n' ++ ' a_expr ::= m_expr | a_expr "+" m_expr | a_expr "-" m_expr\n' ++ '\n' ++ 'The "*" (multiplication) operator yields the product of its ' ++ 'arguments.\n' ++ 'The arguments must either both be numbers, or one argument must ' ++ 'be an\n' ++ 'integer and the other must be a sequence. In the former case, ' ++ 'the\n' ++ 'numbers are converted to a common type and then multiplied ' ++ 'together.\n' ++ 'In the latter case, sequence repetition is performed; a ' ++ 'negative\n' ++ 'repetition factor yields an empty sequence.\n' ++ '\n' ++ 'The "/" (division) and "//" (floor division) operators yield ' ++ 'the\n' ++ 'quotient of their arguments. The numeric arguments are first\n' ++ 'converted to a common type. Division of integers yields a float, ' ++ 'while\n' ++ 'floor division of integers results in an integer; the result is ' ++ 'that\n' ++ "of mathematical division with the 'floor' function applied to " ++ 'the\n' ++ 'result. Division by zero raises the "ZeroDivisionError" ' ++ 'exception.\n' ++ '\n' ++ 'The "%" (modulo) operator yields the remainder from the division ' ++ 'of\n' ++ 'the first argument by the second. The numeric arguments are ' ++ 'first\n' ++ 'converted to a common type. A zero right argument raises the\n' ++ '"ZeroDivisionError" exception. The arguments may be floating ' ++ 'point\n' ++ 'numbers, e.g., "3.14%0.7" equals "0.34" (since "3.14" equals ' ++ '"4*0.7 +\n' ++ '0.34".) The modulo operator always yields a result with the ' ++ 'same sign\n' ++ 'as its second operand (or zero); the absolute value of the ' ++ 'result is\n' ++ 'strictly smaller than the absolute value of the second operand ' ++ '[1].\n' ++ '\n' ++ 'The floor division and modulo operators are connected by the ' ++ 'following\n' ++ 'identity: "x == (x//y)*y + (x%y)". Floor division and modulo ' ++ 'are also\n' ++ 'connected with the built-in function "divmod()": "divmod(x, y) ' ++ '==\n' ++ '(x//y, x%y)". [2].\n' ++ '\n' ++ 'In addition to performing the modulo operation on numbers, the ' ++ '"%"\n' ++ 'operator is also overloaded by string objects to perform ' ++ 'old-style\n' ++ 'string formatting (also known as interpolation). The syntax ' ++ 'for\n' ++ 'string formatting is described in the Python Library Reference,\n' ++ 'section *printf-style String Formatting*.\n' ++ '\n' ++ 'The floor division operator, the modulo operator, and the ' ++ '"divmod()"\n' ++ 'function are not defined for complex numbers. Instead, convert ' ++ 'to a\n' ++ 'floating point number using the "abs()" function if ' ++ 'appropriate.\n' ++ '\n' ++ 'The "+" (addition) operator yields the sum of its arguments. ' ++ 'The\n' ++ 'arguments must either both be numbers or both be sequences of ' ++ 'the same\n' ++ 'type. In the former case, the numbers are converted to a common ' ++ 'type\n' ++ 'and then added together. In the latter case, the sequences are\n' ++ 'concatenated.\n' ++ '\n' ++ 'The "-" (subtraction) operator yields the difference of its ' ++ 'arguments.\n' ++ 'The numeric arguments are first converted to a common type.\n', ++ 'bitwise': '\n' ++ 'Binary bitwise operations\n' ++ '*************************\n' ++ '\n' ++ 'Each of the three bitwise operations has a different priority ' ++ 'level:\n' ++ '\n' ++ ' and_expr ::= shift_expr | and_expr "&" shift_expr\n' ++ ' xor_expr ::= and_expr | xor_expr "^" and_expr\n' ++ ' or_expr ::= xor_expr | or_expr "|" xor_expr\n' ++ '\n' ++ 'The "&" operator yields the bitwise AND of its arguments, which ' ++ 'must\n' ++ 'be integers.\n' ++ '\n' ++ 'The "^" operator yields the bitwise XOR (exclusive OR) of its\n' ++ 'arguments, which must be integers.\n' ++ '\n' ++ 'The "|" operator yields the bitwise (inclusive) OR of its ' ++ 'arguments,\n' ++ 'which must be integers.\n', ++ 'bltin-code-objects': '\n' ++ 'Code Objects\n' ++ '************\n' ++ '\n' ++ 'Code objects are used by the implementation to ' ++ 'represent "pseudo-\n' ++ 'compiled" executable Python code such as a function ' ++ 'body. They differ\n' ++ "from function objects because they don't contain a " ++ 'reference to their\n' ++ 'global execution environment. Code objects are ' ++ 'returned by the built-\n' ++ 'in "compile()" function and can be extracted from ' ++ 'function objects\n' ++ 'through their "__code__" attribute. See also the ' ++ '"code" module.\n' ++ '\n' ++ 'A code object can be executed or evaluated by ' ++ 'passing it (instead of a\n' ++ 'source string) to the "exec()" or "eval()" built-in ' ++ 'functions.\n' ++ '\n' ++ 'See *The standard type hierarchy* for more ' ++ 'information.\n', ++ 'bltin-ellipsis-object': '\n' ++ 'The Ellipsis Object\n' ++ '*******************\n' ++ '\n' ++ 'This object is commonly used by slicing (see ' ++ '*Slicings*). It supports\n' ++ 'no special operations. There is exactly one ' ++ 'ellipsis object, named\n' ++ '"Ellipsis" (a built-in name). "type(Ellipsis)()" ' ++ 'produces the\n' ++ '"Ellipsis" singleton.\n' ++ '\n' ++ 'It is written as "Ellipsis" or "...".\n', ++ 'bltin-null-object': '\n' ++ 'The Null Object\n' ++ '***************\n' ++ '\n' ++ "This object is returned by functions that don't " ++ 'explicitly return a\n' ++ 'value. It supports no special operations. There is ' ++ 'exactly one null\n' ++ 'object, named "None" (a built-in name). ' ++ '"type(None)()" produces the\n' ++ 'same singleton.\n' ++ '\n' ++ 'It is written as "None".\n', ++ 'bltin-type-objects': '\n' ++ 'Type Objects\n' ++ '************\n' ++ '\n' ++ 'Type objects represent the various object types. An ' ++ "object's type is\n" ++ 'accessed by the built-in function "type()". There ' ++ 'are no special\n' ++ 'operations on types. The standard module "types" ' ++ 'defines names for\n' ++ 'all standard built-in types.\n' ++ '\n' ++ 'Types are written like this: "".\n', ++ 'booleans': '\n' ++ 'Boolean operations\n' ++ '******************\n' ++ '\n' ++ ' or_test ::= and_test | or_test "or" and_test\n' ++ ' and_test ::= not_test | and_test "and" not_test\n' ++ ' not_test ::= comparison | "not" not_test\n' ++ '\n' ++ 'In the context of Boolean operations, and also when ' ++ 'expressions are\n' ++ 'used by control flow statements, the following values are ' ++ 'interpreted\n' ++ 'as false: "False", "None", numeric zero of all types, and ' ++ 'empty\n' ++ 'strings and containers (including strings, tuples, lists,\n' ++ 'dictionaries, sets and frozensets). All other values are ' ++ 'interpreted\n' ++ 'as true. User-defined objects can customize their truth value ' ++ 'by\n' ++ 'providing a "__bool__()" method.\n' ++ '\n' ++ 'The operator "not" yields "True" if its argument is false, ' ++ '"False"\n' ++ 'otherwise.\n' ++ '\n' ++ 'The expression "x and y" first evaluates *x*; if *x* is false, ' ++ 'its\n' ++ 'value is returned; otherwise, *y* is evaluated and the ' ++ 'resulting value\n' ++ 'is returned.\n' ++ '\n' ++ 'The expression "x or y" first evaluates *x*; if *x* is true, ' ++ 'its value\n' ++ 'is returned; otherwise, *y* is evaluated and the resulting ' ++ 'value is\n' ++ 'returned.\n' ++ '\n' ++ '(Note that neither "and" nor "or" restrict the value and type ' ++ 'they\n' ++ 'return to "False" and "True", but rather return the last ' ++ 'evaluated\n' ++ 'argument. This is sometimes useful, e.g., if "s" is a string ' ++ 'that\n' ++ 'should be replaced by a default value if it is empty, the ' ++ 'expression\n' ++ '"s or \'foo\'" yields the desired value. Because "not" has to ' ++ 'create a\n' ++ 'new value, it returns a boolean value regardless of the type ' ++ 'of its\n' ++ 'argument (for example, "not \'foo\'" produces "False" rather ' ++ 'than "\'\'".)\n', ++ 'break': '\n' ++ 'The "break" statement\n' ++ '*********************\n' ++ '\n' ++ ' break_stmt ::= "break"\n' ++ '\n' ++ '"break" may only occur syntactically nested in a "for" or ' ++ '"while"\n' ++ 'loop, but not nested in a function or class definition within ' ++ 'that\n' ++ 'loop.\n' ++ '\n' ++ 'It terminates the nearest enclosing loop, skipping the optional ' ++ '"else"\n' ++ 'clause if the loop has one.\n' ++ '\n' ++ 'If a "for" loop is terminated by "break", the loop control ' ++ 'target\n' ++ 'keeps its current value.\n' ++ '\n' ++ 'When "break" passes control out of a "try" statement with a ' ++ '"finally"\n' ++ 'clause, that "finally" clause is executed before really leaving ' ++ 'the\n' ++ 'loop.\n', ++ 'callable-types': '\n' ++ 'Emulating callable objects\n' ++ '**************************\n' ++ '\n' ++ 'object.__call__(self[, args...])\n' ++ '\n' ++ ' Called when the instance is "called" as a function; ' ++ 'if this method\n' ++ ' is defined, "x(arg1, arg2, ...)" is a shorthand for\n' ++ ' "x.__call__(arg1, arg2, ...)".\n', ++ 'calls': '\n' ++ 'Calls\n' ++ '*****\n' ++ '\n' ++ 'A call calls a callable object (e.g., a *function*) with a ' ++ 'possibly\n' ++ 'empty series of *arguments*:\n' ++ '\n' ++ ' call ::= primary "(" [argument_list [","] | ' ++ 'comprehension] ")"\n' ++ ' argument_list ::= positional_arguments ["," ' ++ 'keyword_arguments]\n' ++ ' ["," "*" expression] ["," ' ++ 'keyword_arguments]\n' ++ ' ["," "**" expression]\n' ++ ' | keyword_arguments ["," "*" expression]\n' ++ ' ["," keyword_arguments] ["," "**" ' ++ 'expression]\n' ++ ' | "*" expression ["," keyword_arguments] ' ++ '["," "**" expression]\n' ++ ' | "**" expression\n' ++ ' positional_arguments ::= expression ("," expression)*\n' ++ ' keyword_arguments ::= keyword_item ("," keyword_item)*\n' ++ ' keyword_item ::= identifier "=" expression\n' ++ '\n' ++ 'An optional trailing comma may be present after the positional ' ++ 'and\n' ++ 'keyword arguments but does not affect the semantics.\n' ++ '\n' ++ 'The primary must evaluate to a callable object (user-defined\n' ++ 'functions, built-in functions, methods of built-in objects, ' ++ 'class\n' ++ 'objects, methods of class instances, and all objects having a\n' ++ '"__call__()" method are callable). All argument expressions are\n' ++ 'evaluated before the call is attempted. Please refer to section\n' ++ '*Function definitions* for the syntax of formal *parameter* ' ++ 'lists.\n' ++ '\n' ++ 'If keyword arguments are present, they are first converted to\n' ++ 'positional arguments, as follows. First, a list of unfilled ' ++ 'slots is\n' ++ 'created for the formal parameters. If there are N positional\n' ++ 'arguments, they are placed in the first N slots. Next, for each\n' ++ 'keyword argument, the identifier is used to determine the\n' ++ 'corresponding slot (if the identifier is the same as the first ' ++ 'formal\n' ++ 'parameter name, the first slot is used, and so on). If the slot ' ++ 'is\n' ++ 'already filled, a "TypeError" exception is raised. Otherwise, ' ++ 'the\n' ++ 'value of the argument is placed in the slot, filling it (even if ' ++ 'the\n' ++ 'expression is "None", it fills the slot). When all arguments ' ++ 'have\n' ++ 'been processed, the slots that are still unfilled are filled with ' ++ 'the\n' ++ 'corresponding default value from the function definition. ' ++ '(Default\n' ++ 'values are calculated, once, when the function is defined; thus, ' ++ 'a\n' ++ 'mutable object such as a list or dictionary used as default value ' ++ 'will\n' ++ "be shared by all calls that don't specify an argument value for " ++ 'the\n' ++ 'corresponding slot; this should usually be avoided.) If there ' ++ 'are any\n' ++ 'unfilled slots for which no default value is specified, a ' ++ '"TypeError"\n' ++ 'exception is raised. Otherwise, the list of filled slots is used ' ++ 'as\n' ++ 'the argument list for the call.\n' ++ '\n' ++ '**CPython implementation detail:** An implementation may provide\n' ++ 'built-in functions whose positional parameters do not have names, ' ++ 'even\n' ++ "if they are 'named' for the purpose of documentation, and which\n" ++ 'therefore cannot be supplied by keyword. In CPython, this is the ' ++ 'case\n' ++ 'for functions implemented in C that use "PyArg_ParseTuple()" to ' ++ 'parse\n' ++ 'their arguments.\n' ++ '\n' ++ 'If there are more positional arguments than there are formal ' ++ 'parameter\n' ++ 'slots, a "TypeError" exception is raised, unless a formal ' ++ 'parameter\n' ++ 'using the syntax "*identifier" is present; in this case, that ' ++ 'formal\n' ++ 'parameter receives a tuple containing the excess positional ' ++ 'arguments\n' ++ '(or an empty tuple if there were no excess positional ' ++ 'arguments).\n' ++ '\n' ++ 'If any keyword argument does not correspond to a formal ' ++ 'parameter\n' ++ 'name, a "TypeError" exception is raised, unless a formal ' ++ 'parameter\n' ++ 'using the syntax "**identifier" is present; in this case, that ' ++ 'formal\n' ++ 'parameter receives a dictionary containing the excess keyword\n' ++ 'arguments (using the keywords as keys and the argument values as\n' ++ 'corresponding values), or a (new) empty dictionary if there were ' ++ 'no\n' ++ 'excess keyword arguments.\n' ++ '\n' ++ 'If the syntax "*expression" appears in the function call, ' ++ '"expression"\n' ++ 'must evaluate to an iterable. Elements from this iterable are ' ++ 'treated\n' ++ 'as if they were additional positional arguments; if there are\n' ++ 'positional arguments *x1*, ..., *xN*, and "expression" evaluates ' ++ 'to a\n' ++ 'sequence *y1*, ..., *yM*, this is equivalent to a call with M+N\n' ++ 'positional arguments *x1*, ..., *xN*, *y1*, ..., *yM*.\n' ++ '\n' ++ 'A consequence of this is that although the "*expression" syntax ' ++ 'may\n' ++ 'appear *after* some keyword arguments, it is processed *before* ' ++ 'the\n' ++ 'keyword arguments (and the "**expression" argument, if any -- ' ++ 'see\n' ++ 'below). So:\n' ++ '\n' ++ ' >>> def f(a, b):\n' ++ ' ... print(a, b)\n' ++ ' ...\n' ++ ' >>> f(b=1, *(2,))\n' ++ ' 2 1\n' ++ ' >>> f(a=1, *(2,))\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 1, in ?\n' ++ " TypeError: f() got multiple values for keyword argument 'a'\n" ++ ' >>> f(1, *(2,))\n' ++ ' 1 2\n' ++ '\n' ++ 'It is unusual for both keyword arguments and the "*expression" ' ++ 'syntax\n' ++ 'to be used in the same call, so in practice this confusion does ' ++ 'not\n' ++ 'arise.\n' ++ '\n' ++ 'If the syntax "**expression" appears in the function call,\n' ++ '"expression" must evaluate to a mapping, the contents of which ' ++ 'are\n' ++ 'treated as additional keyword arguments. In the case of a ' ++ 'keyword\n' ++ 'appearing in both "expression" and as an explicit keyword ' ++ 'argument, a\n' ++ '"TypeError" exception is raised.\n' ++ '\n' ++ 'Formal parameters using the syntax "*identifier" or ' ++ '"**identifier"\n' ++ 'cannot be used as positional argument slots or as keyword ' ++ 'argument\n' ++ 'names.\n' ++ '\n' ++ 'A call always returns some value, possibly "None", unless it ' ++ 'raises an\n' ++ 'exception. How this value is computed depends on the type of ' ++ 'the\n' ++ 'callable object.\n' ++ '\n' ++ 'If it is---\n' ++ '\n' ++ 'a user-defined function:\n' ++ ' The code block for the function is executed, passing it the\n' ++ ' argument list. The first thing the code block will do is bind ' ++ 'the\n' ++ ' formal parameters to the arguments; this is described in ' ++ 'section\n' ++ ' *Function definitions*. When the code block executes a ' ++ '"return"\n' ++ ' statement, this specifies the return value of the function ' ++ 'call.\n' ++ '\n' ++ 'a built-in function or method:\n' ++ ' The result is up to the interpreter; see *Built-in Functions* ' ++ 'for\n' ++ ' the descriptions of built-in functions and methods.\n' ++ '\n' ++ 'a class object:\n' ++ ' A new instance of that class is returned.\n' ++ '\n' ++ 'a class instance method:\n' ++ ' The corresponding user-defined function is called, with an ' ++ 'argument\n' ++ ' list that is one longer than the argument list of the call: ' ++ 'the\n' ++ ' instance becomes the first argument.\n' ++ '\n' ++ 'a class instance:\n' ++ ' The class must define a "__call__()" method; the effect is ' ++ 'then the\n' ++ ' same as if that method was called.\n', ++ 'class': '\n' ++ 'Class definitions\n' ++ '*****************\n' ++ '\n' ++ 'A class definition defines a class object (see section *The ' ++ 'standard\n' ++ 'type hierarchy*):\n' ++ '\n' ++ ' classdef ::= [decorators] "class" classname [inheritance] ' ++ '":" suite\n' ++ ' inheritance ::= "(" [parameter_list] ")"\n' ++ ' classname ::= identifier\n' ++ '\n' ++ 'A class definition is an executable statement. The inheritance ' ++ 'list\n' ++ 'usually gives a list of base classes (see *Customizing class ' ++ 'creation*\n' ++ 'for more advanced uses), so each item in the list should evaluate ' ++ 'to a\n' ++ 'class object which allows subclassing. Classes without an ' ++ 'inheritance\n' ++ 'list inherit, by default, from the base class "object"; hence,\n' ++ '\n' ++ ' class Foo:\n' ++ ' pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' class Foo(object):\n' ++ ' pass\n' ++ '\n' ++ "The class's suite is then executed in a new execution frame (see\n" ++ '*Naming and binding*), using a newly created local namespace and ' ++ 'the\n' ++ 'original global namespace. (Usually, the suite contains mostly\n' ++ "function definitions.) When the class's suite finishes " ++ 'execution, its\n' ++ 'execution frame is discarded but its local namespace is saved. ' ++ '[4] A\n' ++ 'class object is then created using the inheritance list for the ' ++ 'base\n' ++ 'classes and the saved local namespace for the attribute ' ++ 'dictionary.\n' ++ 'The class name is bound to this class object in the original ' ++ 'local\n' ++ 'namespace.\n' ++ '\n' ++ 'Class creation can be customized heavily using *metaclasses*.\n' ++ '\n' ++ 'Classes can also be decorated: just like when decorating ' ++ 'functions,\n' ++ '\n' ++ ' @f1(arg)\n' ++ ' @f2\n' ++ ' class Foo: pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' class Foo: pass\n' ++ ' Foo = f1(arg)(f2(Foo))\n' ++ '\n' ++ 'The evaluation rules for the decorator expressions are the same ' ++ 'as for\n' ++ 'function decorators. The result must be a class object, which is ' ++ 'then\n' ++ 'bound to the class name.\n' ++ '\n' ++ "**Programmer's note:** Variables defined in the class definition " ++ 'are\n' ++ 'class attributes; they are shared by instances. Instance ' ++ 'attributes\n' ++ 'can be set in a method with "self.name = value". Both class and\n' ++ 'instance attributes are accessible through the notation ' ++ '""self.name"",\n' ++ 'and an instance attribute hides a class attribute with the same ' ++ 'name\n' ++ 'when accessed in this way. Class attributes can be used as ' ++ 'defaults\n' ++ 'for instance attributes, but using mutable values there can lead ' ++ 'to\n' ++ 'unexpected results. *Descriptors* can be used to create ' ++ 'instance\n' ++ 'variables with different implementation details.\n' ++ '\n' ++ 'See also: **PEP 3115** - Metaclasses in Python 3 **PEP 3129** -\n' ++ ' Class Decorators\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] The exception is propagated to the invocation stack unless\n' ++ ' there is a "finally" clause which happens to raise another\n' ++ ' exception. That new exception causes the old one to be lost.\n' ++ '\n' ++ '[2] Currently, control "flows off the end" except in the case of\n' ++ ' an exception or the execution of a "return", "continue", or\n' ++ ' "break" statement.\n' ++ '\n' ++ '[3] A string literal appearing as the first statement in the\n' ++ ' function body is transformed into the function\'s "__doc__"\n' ++ " attribute and therefore the function's *docstring*.\n" ++ '\n' ++ '[4] A string literal appearing as the first statement in the ' ++ 'class\n' ++ ' body is transformed into the namespace\'s "__doc__" item and\n' ++ " therefore the class's *docstring*.\n", ++ 'comparisons': '\n' ++ 'Comparisons\n' ++ '***********\n' ++ '\n' ++ 'Unlike C, all comparison operations in Python have the same ' ++ 'priority,\n' ++ 'which is lower than that of any arithmetic, shifting or ' ++ 'bitwise\n' ++ 'operation. Also unlike C, expressions like "a < b < c" ' ++ 'have the\n' ++ 'interpretation that is conventional in mathematics:\n' ++ '\n' ++ ' comparison ::= or_expr ( comp_operator or_expr )*\n' ++ ' comp_operator ::= "<" | ">" | "==" | ">=" | "<=" | "!="\n' ++ ' | "is" ["not"] | ["not"] "in"\n' ++ '\n' ++ 'Comparisons yield boolean values: "True" or "False".\n' ++ '\n' ++ 'Comparisons can be chained arbitrarily, e.g., "x < y <= z" ' ++ 'is\n' ++ 'equivalent to "x < y and y <= z", except that "y" is ' ++ 'evaluated only\n' ++ 'once (but in both cases "z" is not evaluated at all when "x ' ++ '< y" is\n' ++ 'found to be false).\n' ++ '\n' ++ 'Formally, if *a*, *b*, *c*, ..., *y*, *z* are expressions ' ++ 'and *op1*,\n' ++ '*op2*, ..., *opN* are comparison operators, then "a op1 b ' ++ 'op2 c ... y\n' ++ 'opN z" is equivalent to "a op1 b and b op2 c and ... y opN ' ++ 'z", except\n' ++ 'that each expression is evaluated at most once.\n' ++ '\n' ++ 'Note that "a op1 b op2 c" doesn\'t imply any kind of ' ++ 'comparison between\n' ++ '*a* and *c*, so that, e.g., "x < y > z" is perfectly legal ' ++ '(though\n' ++ 'perhaps not pretty).\n' ++ '\n' ++ 'The operators "<", ">", "==", ">=", "<=", and "!=" compare ' ++ 'the values\n' ++ 'of two objects. The objects need not have the same type. ' ++ 'If both are\n' ++ 'numbers, they are converted to a common type. Otherwise, ' ++ 'the "==" and\n' ++ '"!=" operators *always* consider objects of different types ' ++ 'to be\n' ++ 'unequal, while the "<", ">", ">=" and "<=" operators raise ' ++ 'a\n' ++ '"TypeError" when comparing objects of different types that ' ++ 'do not\n' ++ 'implement these operators for the given pair of types. You ' ++ 'can\n' ++ 'control comparison behavior of objects of non-built-in ' ++ 'types by\n' ++ 'defining rich comparison methods like "__gt__()", described ' ++ 'in section\n' ++ '*Basic customization*.\n' ++ '\n' ++ 'Comparison of objects of the same type depends on the ' ++ 'type:\n' ++ '\n' ++ '* Numbers are compared arithmetically.\n' ++ '\n' ++ '* The values "float(\'NaN\')" and "Decimal(\'NaN\')" are ' ++ 'special. The\n' ++ ' are identical to themselves, "x is x" but are not equal ' ++ 'to\n' ++ ' themselves, "x != x". Additionally, comparing any value ' ++ 'to a\n' ++ ' not-a-number value will return "False". For example, ' ++ 'both "3 <\n' ++ ' float(\'NaN\')" and "float(\'NaN\') < 3" will return ' ++ '"False".\n' ++ '\n' ++ '* Bytes objects are compared lexicographically using the ' ++ 'numeric\n' ++ ' values of their elements.\n' ++ '\n' ++ '* Strings are compared lexicographically using the numeric\n' ++ ' equivalents (the result of the built-in function "ord()") ' ++ 'of their\n' ++ " characters. [3] String and bytes object can't be " ++ 'compared!\n' ++ '\n' ++ '* Tuples and lists are compared lexicographically using ' ++ 'comparison\n' ++ ' of corresponding elements. This means that to compare ' ++ 'equal, each\n' ++ ' element must compare equal and the two sequences must be ' ++ 'of the same\n' ++ ' type and have the same length.\n' ++ '\n' ++ ' If not equal, the sequences are ordered the same as their ' ++ 'first\n' ++ ' differing elements. For example, "[1,2,x] <= [1,2,y]" ' ++ 'has the same\n' ++ ' value as "x <= y". If the corresponding element does not ' ++ 'exist, the\n' ++ ' shorter sequence is ordered first (for example, "[1,2] < ' ++ '[1,2,3]").\n' ++ '\n' ++ '* Mappings (dictionaries) compare equal if and only if they ' ++ 'have the\n' ++ ' same "(key, value)" pairs. Order comparisons "(\'<\', ' ++ "'<=', '>=',\n" ++ ' \'>\')" raise "TypeError".\n' ++ '\n' ++ '* Sets and frozensets define comparison operators to mean ' ++ 'subset and\n' ++ ' superset tests. Those relations do not define total ' ++ 'orderings (the\n' ++ ' two sets "{1,2}" and {2,3} are not equal, nor subsets of ' ++ 'one\n' ++ ' another, nor supersets of one another). Accordingly, ' ++ 'sets are not\n' ++ ' appropriate arguments for functions which depend on total ' ++ 'ordering.\n' ++ ' For example, "min()", "max()", and "sorted()" produce ' ++ 'undefined\n' ++ ' results given a list of sets as inputs.\n' ++ '\n' ++ '* Most other objects of built-in types compare unequal ' ++ 'unless they\n' ++ ' are the same object; the choice whether one object is ' ++ 'considered\n' ++ ' smaller or larger than another one is made arbitrarily ' ++ 'but\n' ++ ' consistently within one execution of a program.\n' ++ '\n' ++ 'Comparison of objects of differing types depends on whether ' ++ 'either of\n' ++ 'the types provide explicit support for the comparison. ' ++ 'Most numeric\n' ++ 'types can be compared with one another. When cross-type ' ++ 'comparison is\n' ++ 'not supported, the comparison method returns ' ++ '"NotImplemented".\n' ++ '\n' ++ 'The operators "in" and "not in" test for membership. "x in ' ++ 's"\n' ++ 'evaluates to true if *x* is a member of *s*, and false ' ++ 'otherwise. "x\n' ++ 'not in s" returns the negation of "x in s". All built-in ' ++ 'sequences\n' ++ 'and set types support this as well as dictionary, for which ' ++ '"in" tests\n' ++ 'whether the dictionary has a given key. For container types ' ++ 'such as\n' ++ 'list, tuple, set, frozenset, dict, or collections.deque, ' ++ 'the\n' ++ 'expression "x in y" is equivalent to "any(x is e or x == e ' ++ 'for e in\n' ++ 'y)".\n' ++ '\n' ++ 'For the string and bytes types, "x in y" is true if and ' ++ 'only if *x* is\n' ++ 'a substring of *y*. An equivalent test is "y.find(x) != ' ++ '-1". Empty\n' ++ 'strings are always considered to be a substring of any ' ++ 'other string,\n' ++ 'so """ in "abc"" will return "True".\n' ++ '\n' ++ 'For user-defined classes which define the "__contains__()" ' ++ 'method, "x\n' ++ 'in y" is true if and only if "y.__contains__(x)" is true.\n' ++ '\n' ++ 'For user-defined classes which do not define ' ++ '"__contains__()" but do\n' ++ 'define "__iter__()", "x in y" is true if some value "z" ' ++ 'with "x == z"\n' ++ 'is produced while iterating over "y". If an exception is ' ++ 'raised\n' ++ 'during the iteration, it is as if "in" raised that ' ++ 'exception.\n' ++ '\n' ++ 'Lastly, the old-style iteration protocol is tried: if a ' ++ 'class defines\n' ++ '"__getitem__()", "x in y" is true if and only if there is a ' ++ 'non-\n' ++ 'negative integer index *i* such that "x == y[i]", and all ' ++ 'lower\n' ++ 'integer indices do not raise "IndexError" exception. (If ' ++ 'any other\n' ++ 'exception is raised, it is as if "in" raised that ' ++ 'exception).\n' ++ '\n' ++ 'The operator "not in" is defined to have the inverse true ' ++ 'value of\n' ++ '"in".\n' ++ '\n' ++ 'The operators "is" and "is not" test for object identity: ' ++ '"x is y" is\n' ++ 'true if and only if *x* and *y* are the same object. "x is ' ++ 'not y"\n' ++ 'yields the inverse truth value. [4]\n', ++ 'compound': '\n' ++ 'Compound statements\n' ++ '*******************\n' ++ '\n' ++ 'Compound statements contain (groups of) other statements; they ' ++ 'affect\n' ++ 'or control the execution of those other statements in some ' ++ 'way. In\n' ++ 'general, compound statements span multiple lines, although in ' ++ 'simple\n' ++ 'incarnations a whole compound statement may be contained in ' ++ 'one line.\n' ++ '\n' ++ 'The "if", "while" and "for" statements implement traditional ' ++ 'control\n' ++ 'flow constructs. "try" specifies exception handlers and/or ' ++ 'cleanup\n' ++ 'code for a group of statements, while the "with" statement ' ++ 'allows the\n' ++ 'execution of initialization and finalization code around a ' ++ 'block of\n' ++ 'code. Function and class definitions are also syntactically ' ++ 'compound\n' ++ 'statements.\n' ++ '\n' ++ "A compound statement consists of one or more 'clauses.' A " ++ 'clause\n' ++ "consists of a header and a 'suite.' The clause headers of a\n" ++ 'particular compound statement are all at the same indentation ' ++ 'level.\n' ++ 'Each clause header begins with a uniquely identifying keyword ' ++ 'and ends\n' ++ 'with a colon. A suite is a group of statements controlled by ' ++ 'a\n' ++ 'clause. A suite can be one or more semicolon-separated ' ++ 'simple\n' ++ 'statements on the same line as the header, following the ' ++ "header's\n" ++ 'colon, or it can be one or more indented statements on ' ++ 'subsequent\n' ++ 'lines. Only the latter form of a suite can contain nested ' ++ 'compound\n' ++ 'statements; the following is illegal, mostly because it ' ++ "wouldn't be\n" ++ 'clear to which "if" clause a following "else" clause would ' ++ 'belong:\n' ++ '\n' ++ ' if test1: if test2: print(x)\n' ++ '\n' ++ 'Also note that the semicolon binds tighter than the colon in ' ++ 'this\n' ++ 'context, so that in the following example, either all or none ' ++ 'of the\n' ++ '"print()" calls are executed:\n' ++ '\n' ++ ' if x < y < z: print(x); print(y); print(z)\n' ++ '\n' ++ 'Summarizing:\n' ++ '\n' ++ ' compound_stmt ::= if_stmt\n' ++ ' | while_stmt\n' ++ ' | for_stmt\n' ++ ' | try_stmt\n' ++ ' | with_stmt\n' ++ ' | funcdef\n' ++ ' | classdef\n' ++ ' suite ::= stmt_list NEWLINE | NEWLINE INDENT ' ++ 'statement+ DEDENT\n' ++ ' statement ::= stmt_list NEWLINE | compound_stmt\n' ++ ' stmt_list ::= simple_stmt (";" simple_stmt)* [";"]\n' ++ '\n' ++ 'Note that statements always end in a "NEWLINE" possibly ' ++ 'followed by a\n' ++ '"DEDENT". Also note that optional continuation clauses always ' ++ 'begin\n' ++ 'with a keyword that cannot start a statement, thus there are ' ++ 'no\n' ++ 'ambiguities (the \'dangling "else"\' problem is solved in ' ++ 'Python by\n' ++ 'requiring nested "if" statements to be indented).\n' ++ '\n' ++ 'The formatting of the grammar rules in the following sections ' ++ 'places\n' ++ 'each clause on a separate line for clarity.\n' ++ '\n' ++ '\n' ++ 'The "if" statement\n' ++ '==================\n' ++ '\n' ++ 'The "if" statement is used for conditional execution:\n' ++ '\n' ++ ' if_stmt ::= "if" expression ":" suite\n' ++ ' ( "elif" expression ":" suite )*\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'It selects exactly one of the suites by evaluating the ' ++ 'expressions one\n' ++ 'by one until one is found to be true (see section *Boolean ' ++ 'operations*\n' ++ 'for the definition of true and false); then that suite is ' ++ 'executed\n' ++ '(and no other part of the "if" statement is executed or ' ++ 'evaluated).\n' ++ 'If all expressions are false, the suite of the "else" clause, ' ++ 'if\n' ++ 'present, is executed.\n' ++ '\n' ++ '\n' ++ 'The "while" statement\n' ++ '=====================\n' ++ '\n' ++ 'The "while" statement is used for repeated execution as long ' ++ 'as an\n' ++ 'expression is true:\n' ++ '\n' ++ ' while_stmt ::= "while" expression ":" suite\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'This repeatedly tests the expression and, if it is true, ' ++ 'executes the\n' ++ 'first suite; if the expression is false (which may be the ' ++ 'first time\n' ++ 'it is tested) the suite of the "else" clause, if present, is ' ++ 'executed\n' ++ 'and the loop terminates.\n' ++ '\n' ++ 'A "break" statement executed in the first suite terminates the ' ++ 'loop\n' ++ 'without executing the "else" clause\'s suite. A "continue" ' ++ 'statement\n' ++ 'executed in the first suite skips the rest of the suite and ' ++ 'goes back\n' ++ 'to testing the expression.\n' ++ '\n' ++ '\n' ++ 'The "for" statement\n' ++ '===================\n' ++ '\n' ++ 'The "for" statement is used to iterate over the elements of a ' ++ 'sequence\n' ++ '(such as a string, tuple or list) or other iterable object:\n' ++ '\n' ++ ' for_stmt ::= "for" target_list "in" expression_list ":" ' ++ 'suite\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'The expression list is evaluated once; it should yield an ' ++ 'iterable\n' ++ 'object. An iterator is created for the result of the\n' ++ '"expression_list". The suite is then executed once for each ' ++ 'item\n' ++ 'provided by the iterator, in the order returned by the ' ++ 'iterator. Each\n' ++ 'item in turn is assigned to the target list using the standard ' ++ 'rules\n' ++ 'for assignments (see *Assignment statements*), and then the ' ++ 'suite is\n' ++ 'executed. When the items are exhausted (which is immediately ' ++ 'when the\n' ++ 'sequence is empty or an iterator raises a "StopIteration" ' ++ 'exception),\n' ++ 'the suite in the "else" clause, if present, is executed, and ' ++ 'the loop\n' ++ 'terminates.\n' ++ '\n' ++ 'A "break" statement executed in the first suite terminates the ' ++ 'loop\n' ++ 'without executing the "else" clause\'s suite. A "continue" ' ++ 'statement\n' ++ 'executed in the first suite skips the rest of the suite and ' ++ 'continues\n' ++ 'with the next item, or with the "else" clause if there is no ' ++ 'next\n' ++ 'item.\n' ++ '\n' ++ 'The for-loop makes assignments to the variables(s) in the ' ++ 'target list.\n' ++ 'This overwrites all previous assignments to those variables ' ++ 'including\n' ++ 'those made in the suite of the for-loop:\n' ++ '\n' ++ ' for i in range(10):\n' ++ ' print(i)\n' ++ ' i = 5 # this will not affect the for-loop\n' ++ ' # because i will be overwritten with ' ++ 'the next\n' ++ ' # index in the range\n' ++ '\n' ++ 'Names in the target list are not deleted when the loop is ' ++ 'finished,\n' ++ 'but if the sequence is empty, they will not have been assigned ' ++ 'to at\n' ++ 'all by the loop. Hint: the built-in function "range()" ' ++ 'returns an\n' ++ 'iterator of integers suitable to emulate the effect of ' ++ 'Pascal\'s "for i\n' ++ ':= a to b do"; e.g., "list(range(3))" returns the list "[0, 1, ' ++ '2]".\n' ++ '\n' ++ 'Note: There is a subtlety when the sequence is being modified ' ++ 'by the\n' ++ ' loop (this can only occur for mutable sequences, i.e. ' ++ 'lists). An\n' ++ ' internal counter is used to keep track of which item is used ' ++ 'next,\n' ++ ' and this is incremented on each iteration. When this ' ++ 'counter has\n' ++ ' reached the length of the sequence the loop terminates. ' ++ 'This means\n' ++ ' that if the suite deletes the current (or a previous) item ' ++ 'from the\n' ++ ' sequence, the next item will be skipped (since it gets the ' ++ 'index of\n' ++ ' the current item which has already been treated). Likewise, ' ++ 'if the\n' ++ ' suite inserts an item in the sequence before the current ' ++ 'item, the\n' ++ ' current item will be treated again the next time through the ' ++ 'loop.\n' ++ ' This can lead to nasty bugs that can be avoided by making a\n' ++ ' temporary copy using a slice of the whole sequence, e.g.,\n' ++ '\n' ++ ' for x in a[:]:\n' ++ ' if x < 0: a.remove(x)\n' ++ '\n' ++ '\n' ++ 'The "try" statement\n' ++ '===================\n' ++ '\n' ++ 'The "try" statement specifies exception handlers and/or ' ++ 'cleanup code\n' ++ 'for a group of statements:\n' ++ '\n' ++ ' try_stmt ::= try1_stmt | try2_stmt\n' ++ ' try1_stmt ::= "try" ":" suite\n' ++ ' ("except" [expression ["as" identifier]] ":" ' ++ 'suite)+\n' ++ ' ["else" ":" suite]\n' ++ ' ["finally" ":" suite]\n' ++ ' try2_stmt ::= "try" ":" suite\n' ++ ' "finally" ":" suite\n' ++ '\n' ++ 'The "except" clause(s) specify one or more exception handlers. ' ++ 'When no\n' ++ 'exception occurs in the "try" clause, no exception handler is\n' ++ 'executed. When an exception occurs in the "try" suite, a ' ++ 'search for an\n' ++ 'exception handler is started. This search inspects the except ' ++ 'clauses\n' ++ 'in turn until one is found that matches the exception. An ' ++ 'expression-\n' ++ 'less except clause, if present, must be last; it matches any\n' ++ 'exception. For an except clause with an expression, that ' ++ 'expression\n' ++ 'is evaluated, and the clause matches the exception if the ' ++ 'resulting\n' ++ 'object is "compatible" with the exception. An object is ' ++ 'compatible\n' ++ 'with an exception if it is the class or a base class of the ' ++ 'exception\n' ++ 'object or a tuple containing an item compatible with the ' ++ 'exception.\n' ++ '\n' ++ 'If no except clause matches the exception, the search for an ' ++ 'exception\n' ++ 'handler continues in the surrounding code and on the ' ++ 'invocation stack.\n' ++ '[1]\n' ++ '\n' ++ 'If the evaluation of an expression in the header of an except ' ++ 'clause\n' ++ 'raises an exception, the original search for a handler is ' ++ 'canceled and\n' ++ 'a search starts for the new exception in the surrounding code ' ++ 'and on\n' ++ 'the call stack (it is treated as if the entire "try" statement ' ++ 'raised\n' ++ 'the exception).\n' ++ '\n' ++ 'When a matching except clause is found, the exception is ' ++ 'assigned to\n' ++ 'the target specified after the "as" keyword in that except ' ++ 'clause, if\n' ++ "present, and the except clause's suite is executed. All " ++ 'except\n' ++ 'clauses must have an executable block. When the end of this ' ++ 'block is\n' ++ 'reached, execution continues normally after the entire try ' ++ 'statement.\n' ++ '(This means that if two nested handlers exist for the same ' ++ 'exception,\n' ++ 'and the exception occurs in the try clause of the inner ' ++ 'handler, the\n' ++ 'outer handler will not handle the exception.)\n' ++ '\n' ++ 'When an exception has been assigned using "as target", it is ' ++ 'cleared\n' ++ 'at the end of the except clause. This is as if\n' ++ '\n' ++ ' except E as N:\n' ++ ' foo\n' ++ '\n' ++ 'was translated to\n' ++ '\n' ++ ' except E as N:\n' ++ ' try:\n' ++ ' foo\n' ++ ' finally:\n' ++ ' del N\n' ++ '\n' ++ 'This means the exception must be assigned to a different name ' ++ 'to be\n' ++ 'able to refer to it after the except clause. Exceptions are ' ++ 'cleared\n' ++ 'because with the traceback attached to them, they form a ' ++ 'reference\n' ++ 'cycle with the stack frame, keeping all locals in that frame ' ++ 'alive\n' ++ 'until the next garbage collection occurs.\n' ++ '\n' ++ "Before an except clause's suite is executed, details about " ++ 'the\n' ++ 'exception are stored in the "sys" module and can be accessed ' ++ 'via\n' ++ '"sys.exc_info()". "sys.exc_info()" returns a 3-tuple ' ++ 'consisting of the\n' ++ 'exception class, the exception instance and a traceback object ' ++ '(see\n' ++ 'section *The standard type hierarchy*) identifying the point ' ++ 'in the\n' ++ 'program where the exception occurred. "sys.exc_info()" values ' ++ 'are\n' ++ 'restored to their previous values (before the call) when ' ++ 'returning\n' ++ 'from a function that handled an exception.\n' ++ '\n' ++ 'The optional "else" clause is executed if and when control ' ++ 'flows off\n' ++ 'the end of the "try" clause. [2] Exceptions in the "else" ' ++ 'clause are\n' ++ 'not handled by the preceding "except" clauses.\n' ++ '\n' ++ 'If "finally" is present, it specifies a \'cleanup\' handler. ' ++ 'The "try"\n' ++ 'clause is executed, including any "except" and "else" ' ++ 'clauses. If an\n' ++ 'exception occurs in any of the clauses and is not handled, ' ++ 'the\n' ++ 'exception is temporarily saved. The "finally" clause is ' ++ 'executed. If\n' ++ 'there is a saved exception it is re-raised at the end of the ' ++ '"finally"\n' ++ 'clause. If the "finally" clause raises another exception, the ' ++ 'saved\n' ++ 'exception is set as the context of the new exception. If the ' ++ '"finally"\n' ++ 'clause executes a "return" or "break" statement, the saved ' ++ 'exception\n' ++ 'is discarded:\n' ++ '\n' ++ ' >>> def f():\n' ++ ' ... try:\n' ++ ' ... 1/0\n' ++ ' ... finally:\n' ++ ' ... return 42\n' ++ ' ...\n' ++ ' >>> f()\n' ++ ' 42\n' ++ '\n' ++ 'The exception information is not available to the program ' ++ 'during\n' ++ 'execution of the "finally" clause.\n' ++ '\n' ++ 'When a "return", "break" or "continue" statement is executed ' ++ 'in the\n' ++ '"try" suite of a "try"..."finally" statement, the "finally" ' ++ 'clause is\n' ++ 'also executed \'on the way out.\' A "continue" statement is ' ++ 'illegal in\n' ++ 'the "finally" clause. (The reason is a problem with the ' ++ 'current\n' ++ 'implementation --- this restriction may be lifted in the ' ++ 'future).\n' ++ '\n' ++ 'The return value of a function is determined by the last ' ++ '"return"\n' ++ 'statement executed. Since the "finally" clause always ' ++ 'executes, a\n' ++ '"return" statement executed in the "finally" clause will ' ++ 'always be the\n' ++ 'last one executed:\n' ++ '\n' ++ ' >>> def foo():\n' ++ ' ... try:\n' ++ " ... return 'try'\n" ++ ' ... finally:\n' ++ " ... return 'finally'\n" ++ ' ...\n' ++ ' >>> foo()\n' ++ " 'finally'\n" ++ '\n' ++ 'Additional information on exceptions can be found in section\n' ++ '*Exceptions*, and information on using the "raise" statement ' ++ 'to\n' ++ 'generate exceptions may be found in section *The raise ' ++ 'statement*.\n' ++ '\n' ++ '\n' ++ 'The "with" statement\n' ++ '====================\n' ++ '\n' ++ 'The "with" statement is used to wrap the execution of a block ' ++ 'with\n' ++ 'methods defined by a context manager (see section *With ' ++ 'Statement\n' ++ 'Context Managers*). This allows common ' ++ '"try"..."except"..."finally"\n' ++ 'usage patterns to be encapsulated for convenient reuse.\n' ++ '\n' ++ ' with_stmt ::= "with" with_item ("," with_item)* ":" suite\n' ++ ' with_item ::= expression ["as" target]\n' ++ '\n' ++ 'The execution of the "with" statement with one "item" proceeds ' ++ 'as\n' ++ 'follows:\n' ++ '\n' ++ '1. The context expression (the expression given in the ' ++ '"with_item")\n' ++ ' is evaluated to obtain a context manager.\n' ++ '\n' ++ '2. The context manager\'s "__exit__()" is loaded for later ' ++ 'use.\n' ++ '\n' ++ '3. The context manager\'s "__enter__()" method is invoked.\n' ++ '\n' ++ '4. If a target was included in the "with" statement, the ' ++ 'return\n' ++ ' value from "__enter__()" is assigned to it.\n' ++ '\n' ++ ' Note: The "with" statement guarantees that if the ' ++ '"__enter__()"\n' ++ ' method returns without an error, then "__exit__()" will ' ++ 'always be\n' ++ ' called. Thus, if an error occurs during the assignment to ' ++ 'the\n' ++ ' target list, it will be treated the same as an error ' ++ 'occurring\n' ++ ' within the suite would be. See step 6 below.\n' ++ '\n' ++ '5. The suite is executed.\n' ++ '\n' ++ '6. The context manager\'s "__exit__()" method is invoked. If ' ++ 'an\n' ++ ' exception caused the suite to be exited, its type, value, ' ++ 'and\n' ++ ' traceback are passed as arguments to "__exit__()". ' ++ 'Otherwise, three\n' ++ ' "None" arguments are supplied.\n' ++ '\n' ++ ' If the suite was exited due to an exception, and the return ' ++ 'value\n' ++ ' from the "__exit__()" method was false, the exception is ' ++ 'reraised.\n' ++ ' If the return value was true, the exception is suppressed, ' ++ 'and\n' ++ ' execution continues with the statement following the ' ++ '"with"\n' ++ ' statement.\n' ++ '\n' ++ ' If the suite was exited for any reason other than an ' ++ 'exception, the\n' ++ ' return value from "__exit__()" is ignored, and execution ' ++ 'proceeds\n' ++ ' at the normal location for the kind of exit that was ' ++ 'taken.\n' ++ '\n' ++ 'With more than one item, the context managers are processed as ' ++ 'if\n' ++ 'multiple "with" statements were nested:\n' ++ '\n' ++ ' with A() as a, B() as b:\n' ++ ' suite\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' with A() as a:\n' ++ ' with B() as b:\n' ++ ' suite\n' ++ '\n' ++ 'Changed in version 3.1: Support for multiple context ' ++ 'expressions.\n' ++ '\n' ++ 'See also: **PEP 0343** - The "with" statement\n' ++ '\n' ++ ' The specification, background, and examples for the ' ++ 'Python "with"\n' ++ ' statement.\n' ++ '\n' ++ '\n' ++ 'Function definitions\n' ++ '====================\n' ++ '\n' ++ 'A function definition defines a user-defined function object ' ++ '(see\n' ++ 'section *The standard type hierarchy*):\n' ++ '\n' ++ ' funcdef ::= [decorators] "def" funcname "(" ' ++ '[parameter_list] ")" ["->" expression] ":" suite\n' ++ ' decorators ::= decorator+\n' ++ ' decorator ::= "@" dotted_name ["(" [parameter_list ' ++ '[","]] ")"] NEWLINE\n' ++ ' dotted_name ::= identifier ("." identifier)*\n' ++ ' parameter_list ::= (defparameter ",")*\n' ++ ' | "*" [parameter] ("," defparameter)* ' ++ '["," "**" parameter]\n' ++ ' | "**" parameter\n' ++ ' | defparameter [","] )\n' ++ ' parameter ::= identifier [":" expression]\n' ++ ' defparameter ::= parameter ["=" expression]\n' ++ ' funcname ::= identifier\n' ++ '\n' ++ 'A function definition is an executable statement. Its ' ++ 'execution binds\n' ++ 'the function name in the current local namespace to a function ' ++ 'object\n' ++ '(a wrapper around the executable code for the function). ' ++ 'This\n' ++ 'function object contains a reference to the current global ' ++ 'namespace\n' ++ 'as the global namespace to be used when the function is ' ++ 'called.\n' ++ '\n' ++ 'The function definition does not execute the function body; ' ++ 'this gets\n' ++ 'executed only when the function is called. [3]\n' ++ '\n' ++ 'A function definition may be wrapped by one or more ' ++ '*decorator*\n' ++ 'expressions. Decorator expressions are evaluated when the ' ++ 'function is\n' ++ 'defined, in the scope that contains the function definition. ' ++ 'The\n' ++ 'result must be a callable, which is invoked with the function ' ++ 'object\n' ++ 'as the only argument. The returned value is bound to the ' ++ 'function name\n' ++ 'instead of the function object. Multiple decorators are ' ++ 'applied in\n' ++ 'nested fashion. For example, the following code\n' ++ '\n' ++ ' @f1(arg)\n' ++ ' @f2\n' ++ ' def func(): pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' def func(): pass\n' ++ ' func = f1(arg)(f2(func))\n' ++ '\n' ++ 'When one or more *parameters* have the form *parameter* "="\n' ++ '*expression*, the function is said to have "default parameter ' ++ 'values."\n' ++ 'For a parameter with a default value, the corresponding ' ++ '*argument* may\n' ++ "be omitted from a call, in which case the parameter's default " ++ 'value is\n' ++ 'substituted. If a parameter has a default value, all ' ++ 'following\n' ++ 'parameters up until the ""*"" must also have a default value ' ++ '--- this\n' ++ 'is a syntactic restriction that is not expressed by the ' ++ 'grammar.\n' ++ '\n' ++ '**Default parameter values are evaluated from left to right ' ++ 'when the\n' ++ 'function definition is executed.** This means that the ' ++ 'expression is\n' ++ 'evaluated once, when the function is defined, and that the ' ++ 'same "pre-\n' ++ 'computed" value is used for each call. This is especially ' ++ 'important\n' ++ 'to understand when a default parameter is a mutable object, ' ++ 'such as a\n' ++ 'list or a dictionary: if the function modifies the object ' ++ '(e.g. by\n' ++ 'appending an item to a list), the default value is in effect ' ++ 'modified.\n' ++ 'This is generally not what was intended. A way around this is ' ++ 'to use\n' ++ '"None" as the default, and explicitly test for it in the body ' ++ 'of the\n' ++ 'function, e.g.:\n' ++ '\n' ++ ' def whats_on_the_telly(penguin=None):\n' ++ ' if penguin is None:\n' ++ ' penguin = []\n' ++ ' penguin.append("property of the zoo")\n' ++ ' return penguin\n' ++ '\n' ++ 'Function call semantics are described in more detail in ' ++ 'section\n' ++ '*Calls*. A function call always assigns values to all ' ++ 'parameters\n' ++ 'mentioned in the parameter list, either from position ' ++ 'arguments, from\n' ++ 'keyword arguments, or from default values. If the form\n' ++ '""*identifier"" is present, it is initialized to a tuple ' ++ 'receiving any\n' ++ 'excess positional parameters, defaulting to the empty tuple. ' ++ 'If the\n' ++ 'form ""**identifier"" is present, it is initialized to a new\n' ++ 'dictionary receiving any excess keyword arguments, defaulting ' ++ 'to a new\n' ++ 'empty dictionary. Parameters after ""*"" or ""*identifier"" ' ++ 'are\n' ++ 'keyword-only parameters and may only be passed used keyword ' ++ 'arguments.\n' ++ '\n' ++ 'Parameters may have annotations of the form "": expression"" ' ++ 'following\n' ++ 'the parameter name. Any parameter may have an annotation even ' ++ 'those\n' ++ 'of the form "*identifier" or "**identifier". Functions may ' ++ 'have\n' ++ '"return" annotation of the form ""-> expression"" after the ' ++ 'parameter\n' ++ 'list. These annotations can be any valid Python expression ' ++ 'and are\n' ++ 'evaluated when the function definition is executed. ' ++ 'Annotations may\n' ++ 'be evaluated in a different order than they appear in the ' ++ 'source code.\n' ++ 'The presence of annotations does not change the semantics of ' ++ 'a\n' ++ 'function. The annotation values are available as values of a\n' ++ "dictionary keyed by the parameters' names in the " ++ '"__annotations__"\n' ++ 'attribute of the function object.\n' ++ '\n' ++ 'It is also possible to create anonymous functions (functions ' ++ 'not bound\n' ++ 'to a name), for immediate use in expressions. This uses ' ++ 'lambda\n' ++ 'expressions, described in section *Lambdas*. Note that the ' ++ 'lambda\n' ++ 'expression is merely a shorthand for a simplified function ' ++ 'definition;\n' ++ 'a function defined in a ""def"" statement can be passed around ' ++ 'or\n' ++ 'assigned to another name just like a function defined by a ' ++ 'lambda\n' ++ 'expression. The ""def"" form is actually more powerful since ' ++ 'it\n' ++ 'allows the execution of multiple statements and annotations.\n' ++ '\n' ++ "**Programmer's note:** Functions are first-class objects. A " ++ '""def""\n' ++ 'statement executed inside a function definition defines a ' ++ 'local\n' ++ 'function that can be returned or passed around. Free ' ++ 'variables used\n' ++ 'in the nested function can access the local variables of the ' ++ 'function\n' ++ 'containing the def. See section *Naming and binding* for ' ++ 'details.\n' ++ '\n' ++ 'See also: **PEP 3107** - Function Annotations\n' ++ '\n' ++ ' The original specification for function annotations.\n' ++ '\n' ++ '\n' ++ 'Class definitions\n' ++ '=================\n' ++ '\n' ++ 'A class definition defines a class object (see section *The ' ++ 'standard\n' ++ 'type hierarchy*):\n' ++ '\n' ++ ' classdef ::= [decorators] "class" classname ' ++ '[inheritance] ":" suite\n' ++ ' inheritance ::= "(" [parameter_list] ")"\n' ++ ' classname ::= identifier\n' ++ '\n' ++ 'A class definition is an executable statement. The ' ++ 'inheritance list\n' ++ 'usually gives a list of base classes (see *Customizing class ' ++ 'creation*\n' ++ 'for more advanced uses), so each item in the list should ' ++ 'evaluate to a\n' ++ 'class object which allows subclassing. Classes without an ' ++ 'inheritance\n' ++ 'list inherit, by default, from the base class "object"; ' ++ 'hence,\n' ++ '\n' ++ ' class Foo:\n' ++ ' pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' class Foo(object):\n' ++ ' pass\n' ++ '\n' ++ "The class's suite is then executed in a new execution frame " ++ '(see\n' ++ '*Naming and binding*), using a newly created local namespace ' ++ 'and the\n' ++ 'original global namespace. (Usually, the suite contains ' ++ 'mostly\n' ++ "function definitions.) When the class's suite finishes " ++ 'execution, its\n' ++ 'execution frame is discarded but its local namespace is saved. ' ++ '[4] A\n' ++ 'class object is then created using the inheritance list for ' ++ 'the base\n' ++ 'classes and the saved local namespace for the attribute ' ++ 'dictionary.\n' ++ 'The class name is bound to this class object in the original ' ++ 'local\n' ++ 'namespace.\n' ++ '\n' ++ 'Class creation can be customized heavily using *metaclasses*.\n' ++ '\n' ++ 'Classes can also be decorated: just like when decorating ' ++ 'functions,\n' ++ '\n' ++ ' @f1(arg)\n' ++ ' @f2\n' ++ ' class Foo: pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' class Foo: pass\n' ++ ' Foo = f1(arg)(f2(Foo))\n' ++ '\n' ++ 'The evaluation rules for the decorator expressions are the ' ++ 'same as for\n' ++ 'function decorators. The result must be a class object, which ' ++ 'is then\n' ++ 'bound to the class name.\n' ++ '\n' ++ "**Programmer's note:** Variables defined in the class " ++ 'definition are\n' ++ 'class attributes; they are shared by instances. Instance ' ++ 'attributes\n' ++ 'can be set in a method with "self.name = value". Both class ' ++ 'and\n' ++ 'instance attributes are accessible through the notation ' ++ '""self.name"",\n' ++ 'and an instance attribute hides a class attribute with the ' ++ 'same name\n' ++ 'when accessed in this way. Class attributes can be used as ' ++ 'defaults\n' ++ 'for instance attributes, but using mutable values there can ' ++ 'lead to\n' ++ 'unexpected results. *Descriptors* can be used to create ' ++ 'instance\n' ++ 'variables with different implementation details.\n' ++ '\n' ++ 'See also: **PEP 3115** - Metaclasses in Python 3 **PEP 3129** ' ++ '-\n' ++ ' Class Decorators\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] The exception is propagated to the invocation stack ' ++ 'unless\n' ++ ' there is a "finally" clause which happens to raise ' ++ 'another\n' ++ ' exception. That new exception causes the old one to be ' ++ 'lost.\n' ++ '\n' ++ '[2] Currently, control "flows off the end" except in the case ' ++ 'of\n' ++ ' an exception or the execution of a "return", "continue", ' ++ 'or\n' ++ ' "break" statement.\n' ++ '\n' ++ '[3] A string literal appearing as the first statement in the\n' ++ " function body is transformed into the function's " ++ '"__doc__"\n' ++ " attribute and therefore the function's *docstring*.\n" ++ '\n' ++ '[4] A string literal appearing as the first statement in the ' ++ 'class\n' ++ ' body is transformed into the namespace\'s "__doc__" item ' ++ 'and\n' ++ " therefore the class's *docstring*.\n", ++ 'context-managers': '\n' ++ 'With Statement Context Managers\n' ++ '*******************************\n' ++ '\n' ++ 'A *context manager* is an object that defines the ' ++ 'runtime context to\n' ++ 'be established when executing a "with" statement. The ' ++ 'context manager\n' ++ 'handles the entry into, and the exit from, the desired ' ++ 'runtime context\n' ++ 'for the execution of the block of code. Context ' ++ 'managers are normally\n' ++ 'invoked using the "with" statement (described in ' ++ 'section *The with\n' ++ 'statement*), but can also be used by directly invoking ' ++ 'their methods.\n' ++ '\n' ++ 'Typical uses of context managers include saving and ' ++ 'restoring various\n' ++ 'kinds of global state, locking and unlocking ' ++ 'resources, closing opened\n' ++ 'files, etc.\n' ++ '\n' ++ 'For more information on context managers, see *Context ' ++ 'Manager Types*.\n' ++ '\n' ++ 'object.__enter__(self)\n' ++ '\n' ++ ' Enter the runtime context related to this object. ' ++ 'The "with"\n' ++ " statement will bind this method's return value to " ++ 'the target(s)\n' ++ ' specified in the "as" clause of the statement, if ' ++ 'any.\n' ++ '\n' ++ 'object.__exit__(self, exc_type, exc_value, traceback)\n' ++ '\n' ++ ' Exit the runtime context related to this object. ' ++ 'The parameters\n' ++ ' describe the exception that caused the context to ' ++ 'be exited. If the\n' ++ ' context was exited without an exception, all three ' ++ 'arguments will\n' ++ ' be "None".\n' ++ '\n' ++ ' If an exception is supplied, and the method wishes ' ++ 'to suppress the\n' ++ ' exception (i.e., prevent it from being propagated), ' ++ 'it should\n' ++ ' return a true value. Otherwise, the exception will ' ++ 'be processed\n' ++ ' normally upon exit from this method.\n' ++ '\n' ++ ' Note that "__exit__()" methods should not reraise ' ++ 'the passed-in\n' ++ " exception; this is the caller's responsibility.\n" ++ '\n' ++ 'See also: **PEP 0343** - The "with" statement\n' ++ '\n' ++ ' The specification, background, and examples for ' ++ 'the Python "with"\n' ++ ' statement.\n', ++ 'continue': '\n' ++ 'The "continue" statement\n' ++ '************************\n' ++ '\n' ++ ' continue_stmt ::= "continue"\n' ++ '\n' ++ '"continue" may only occur syntactically nested in a "for" or ' ++ '"while"\n' ++ 'loop, but not nested in a function or class definition or ' ++ '"finally"\n' ++ 'clause within that loop. It continues with the next cycle of ' ++ 'the\n' ++ 'nearest enclosing loop.\n' ++ '\n' ++ 'When "continue" passes control out of a "try" statement with ' ++ 'a\n' ++ '"finally" clause, that "finally" clause is executed before ' ++ 'really\n' ++ 'starting the next loop cycle.\n', ++ 'conversions': '\n' ++ 'Arithmetic conversions\n' ++ '**********************\n' ++ '\n' ++ 'When a description of an arithmetic operator below uses the ' ++ 'phrase\n' ++ '"the numeric arguments are converted to a common type," ' ++ 'this means\n' ++ 'that the operator implementation for built-in types works ' ++ 'as follows:\n' ++ '\n' ++ '* If either argument is a complex number, the other is ' ++ 'converted to\n' ++ ' complex;\n' ++ '\n' ++ '* otherwise, if either argument is a floating point number, ' ++ 'the\n' ++ ' other is converted to floating point;\n' ++ '\n' ++ '* otherwise, both must be integers and no conversion is ' ++ 'necessary.\n' ++ '\n' ++ 'Some additional rules apply for certain operators (e.g., a ' ++ 'string as a\n' ++ "left argument to the '%' operator). Extensions must define " ++ 'their own\n' ++ 'conversion behavior.\n', ++ 'customization': '\n' ++ 'Basic customization\n' ++ '*******************\n' ++ '\n' ++ 'object.__new__(cls[, ...])\n' ++ '\n' ++ ' Called to create a new instance of class *cls*. ' ++ '"__new__()" is a\n' ++ ' static method (special-cased so you need not declare ' ++ 'it as such)\n' ++ ' that takes the class of which an instance was ' ++ 'requested as its\n' ++ ' first argument. The remaining arguments are those ' ++ 'passed to the\n' ++ ' object constructor expression (the call to the ' ++ 'class). The return\n' ++ ' value of "__new__()" should be the new object instance ' ++ '(usually an\n' ++ ' instance of *cls*).\n' ++ '\n' ++ ' Typical implementations create a new instance of the ' ++ 'class by\n' ++ ' invoking the superclass\'s "__new__()" method using\n' ++ ' "super(currentclass, cls).__new__(cls[, ...])" with ' ++ 'appropriate\n' ++ ' arguments and then modifying the newly-created ' ++ 'instance as\n' ++ ' necessary before returning it.\n' ++ '\n' ++ ' If "__new__()" returns an instance of *cls*, then the ' ++ 'new\n' ++ ' instance\'s "__init__()" method will be invoked like\n' ++ ' "__init__(self[, ...])", where *self* is the new ' ++ 'instance and the\n' ++ ' remaining arguments are the same as were passed to ' ++ '"__new__()".\n' ++ '\n' ++ ' If "__new__()" does not return an instance of *cls*, ' ++ 'then the new\n' ++ ' instance\'s "__init__()" method will not be invoked.\n' ++ '\n' ++ ' "__new__()" is intended mainly to allow subclasses of ' ++ 'immutable\n' ++ ' types (like int, str, or tuple) to customize instance ' ++ 'creation. It\n' ++ ' is also commonly overridden in custom metaclasses in ' ++ 'order to\n' ++ ' customize class creation.\n' ++ '\n' ++ 'object.__init__(self[, ...])\n' ++ '\n' ++ ' Called when the instance is created. The arguments ' ++ 'are those\n' ++ ' passed to the class constructor expression. If a base ' ++ 'class has an\n' ++ ' "__init__()" method, the derived class\'s "__init__()" ' ++ 'method, if\n' ++ ' any, must explicitly call it to ensure proper ' ++ 'initialization of the\n' ++ ' base class part of the instance; for example:\n' ++ ' "BaseClass.__init__(self, [args...])". As a special ' ++ 'constraint on\n' ++ ' constructors, no value may be returned; doing so will ' ++ 'cause a\n' ++ ' "TypeError" to be raised at runtime.\n' ++ '\n' ++ 'object.__del__(self)\n' ++ '\n' ++ ' Called when the instance is about to be destroyed. ' ++ 'This is also\n' ++ ' called a destructor. If a base class has a ' ++ '"__del__()" method, the\n' ++ ' derived class\'s "__del__()" method, if any, must ' ++ 'explicitly call it\n' ++ ' to ensure proper deletion of the base class part of ' ++ 'the instance.\n' ++ ' Note that it is possible (though not recommended!) for ' ++ 'the\n' ++ ' "__del__()" method to postpone destruction of the ' ++ 'instance by\n' ++ ' creating a new reference to it. It may then be called ' ++ 'at a later\n' ++ ' time when this new reference is deleted. It is not ' ++ 'guaranteed that\n' ++ ' "__del__()" methods are called for objects that still ' ++ 'exist when\n' ++ ' the interpreter exits.\n' ++ '\n' ++ ' Note: "del x" doesn\'t directly call "x.__del__()" --- ' ++ 'the former\n' ++ ' decrements the reference count for "x" by one, and ' ++ 'the latter is\n' ++ ' only called when "x"\'s reference count reaches ' ++ 'zero. Some common\n' ++ ' situations that may prevent the reference count of ' ++ 'an object from\n' ++ ' going to zero include: circular references between ' ++ 'objects (e.g.,\n' ++ ' a doubly-linked list or a tree data structure with ' ++ 'parent and\n' ++ ' child pointers); a reference to the object on the ' ++ 'stack frame of\n' ++ ' a function that caught an exception (the traceback ' ++ 'stored in\n' ++ ' "sys.exc_info()[2]" keeps the stack frame alive); or ' ++ 'a reference\n' ++ ' to the object on the stack frame that raised an ' ++ 'unhandled\n' ++ ' exception in interactive mode (the traceback stored ' ++ 'in\n' ++ ' "sys.last_traceback" keeps the stack frame alive). ' ++ 'The first\n' ++ ' situation can only be remedied by explicitly ' ++ 'breaking the cycles;\n' ++ ' the latter two situations can be resolved by storing ' ++ '"None" in\n' ++ ' "sys.last_traceback". Circular references which are ' ++ 'garbage are\n' ++ ' detected and cleaned up when the cyclic garbage ' ++ 'collector is\n' ++ " enabled (it's on by default). Refer to the " ++ 'documentation for the\n' ++ ' "gc" module for more information about this topic.\n' ++ '\n' ++ ' Warning: Due to the precarious circumstances under ' ++ 'which\n' ++ ' "__del__()" methods are invoked, exceptions that ' ++ 'occur during\n' ++ ' their execution are ignored, and a warning is ' ++ 'printed to\n' ++ ' "sys.stderr" instead. Also, when "__del__()" is ' ++ 'invoked in\n' ++ ' response to a module being deleted (e.g., when ' ++ 'execution of the\n' ++ ' program is done), other globals referenced by the ' ++ '"__del__()"\n' ++ ' method may already have been deleted or in the ' ++ 'process of being\n' ++ ' torn down (e.g. the import machinery shutting ' ++ 'down). For this\n' ++ ' reason, "__del__()" methods should do the absolute ' ++ 'minimum needed\n' ++ ' to maintain external invariants. Starting with ' ++ 'version 1.5,\n' ++ ' Python guarantees that globals whose name begins ' ++ 'with a single\n' ++ ' underscore are deleted from their module before ' ++ 'other globals are\n' ++ ' deleted; if no other references to such globals ' ++ 'exist, this may\n' ++ ' help in assuring that imported modules are still ' ++ 'available at the\n' ++ ' time when the "__del__()" method is called.\n' ++ '\n' ++ 'object.__repr__(self)\n' ++ '\n' ++ ' Called by the "repr()" built-in function to compute ' ++ 'the "official"\n' ++ ' string representation of an object. If at all ' ++ 'possible, this\n' ++ ' should look like a valid Python expression that could ' ++ 'be used to\n' ++ ' recreate an object with the same value (given an ' ++ 'appropriate\n' ++ ' environment). If this is not possible, a string of ' ++ 'the form\n' ++ ' "<...some useful description...>" should be returned. ' ++ 'The return\n' ++ ' value must be a string object. If a class defines ' ++ '"__repr__()" but\n' ++ ' not "__str__()", then "__repr__()" is also used when ' ++ 'an "informal"\n' ++ ' string representation of instances of that class is ' ++ 'required.\n' ++ '\n' ++ ' This is typically used for debugging, so it is ' ++ 'important that the\n' ++ ' representation is information-rich and unambiguous.\n' ++ '\n' ++ 'object.__str__(self)\n' ++ '\n' ++ ' Called by "str(object)" and the built-in functions ' ++ '"format()" and\n' ++ ' "print()" to compute the "informal" or nicely ' ++ 'printable string\n' ++ ' representation of an object. The return value must be ' ++ 'a *string*\n' ++ ' object.\n' ++ '\n' ++ ' This method differs from "object.__repr__()" in that ' ++ 'there is no\n' ++ ' expectation that "__str__()" return a valid Python ' ++ 'expression: a\n' ++ ' more convenient or concise representation can be ' ++ 'used.\n' ++ '\n' ++ ' The default implementation defined by the built-in ' ++ 'type "object"\n' ++ ' calls "object.__repr__()".\n' ++ '\n' ++ 'object.__bytes__(self)\n' ++ '\n' ++ ' Called by "bytes()" to compute a byte-string ' ++ 'representation of an\n' ++ ' object. This should return a "bytes" object.\n' ++ '\n' ++ 'object.__format__(self, format_spec)\n' ++ '\n' ++ ' Called by the "format()" built-in function (and by ' ++ 'extension, the\n' ++ ' "str.format()" method of class "str") to produce a ' ++ '"formatted"\n' ++ ' string representation of an object. The "format_spec" ' ++ 'argument is a\n' ++ ' string that contains a description of the formatting ' ++ 'options\n' ++ ' desired. The interpretation of the "format_spec" ' ++ 'argument is up to\n' ++ ' the type implementing "__format__()", however most ' ++ 'classes will\n' ++ ' either delegate formatting to one of the built-in ' ++ 'types, or use a\n' ++ ' similar formatting option syntax.\n' ++ '\n' ++ ' See *Format Specification Mini-Language* for a ' ++ 'description of the\n' ++ ' standard formatting syntax.\n' ++ '\n' ++ ' The return value must be a string object.\n' ++ '\n' ++ ' Changed in version 3.4: The __format__ method of ' ++ '"object" itself\n' ++ ' raises a "TypeError" if passed any non-empty string.\n' ++ '\n' ++ 'object.__lt__(self, other)\n' ++ 'object.__le__(self, other)\n' ++ 'object.__eq__(self, other)\n' ++ 'object.__ne__(self, other)\n' ++ 'object.__gt__(self, other)\n' ++ 'object.__ge__(self, other)\n' ++ '\n' ++ ' These are the so-called "rich comparison" methods. ' ++ 'The\n' ++ ' correspondence between operator symbols and method ' ++ 'names is as\n' ++ ' follows: "xy" calls\n' ++ ' "x.__gt__(y)", and "x>=y" calls "x.__ge__(y)".\n' ++ '\n' ++ ' A rich comparison method may return the singleton ' ++ '"NotImplemented"\n' ++ ' if it does not implement the operation for a given ' ++ 'pair of\n' ++ ' arguments. By convention, "False" and "True" are ' ++ 'returned for a\n' ++ ' successful comparison. However, these methods can ' ++ 'return any value,\n' ++ ' so if the comparison operator is used in a Boolean ' ++ 'context (e.g.,\n' ++ ' in the condition of an "if" statement), Python will ' ++ 'call "bool()"\n' ++ ' on the value to determine if the result is true or ' ++ 'false.\n' ++ '\n' ++ ' There are no implied relationships among the ' ++ 'comparison operators.\n' ++ ' The truth of "x==y" does not imply that "x!=y" is ' ++ 'false.\n' ++ ' Accordingly, when defining "__eq__()", one should also ' ++ 'define\n' ++ ' "__ne__()" so that the operators will behave as ' ++ 'expected. See the\n' ++ ' paragraph on "__hash__()" for some important notes on ' ++ 'creating\n' ++ ' *hashable* objects which support custom comparison ' ++ 'operations and\n' ++ ' are usable as dictionary keys.\n' ++ '\n' ++ ' There are no swapped-argument versions of these ' ++ 'methods (to be used\n' ++ ' when the left argument does not support the operation ' ++ 'but the right\n' ++ ' argument does); rather, "__lt__()" and "__gt__()" are ' ++ "each other's\n" ++ ' reflection, "__le__()" and "__ge__()" are each ' ++ "other's reflection,\n" ++ ' and "__eq__()" and "__ne__()" are their own ' ++ 'reflection.\n' ++ '\n' ++ ' Arguments to rich comparison methods are never ' ++ 'coerced.\n' ++ '\n' ++ ' To automatically generate ordering operations from a ' ++ 'single root\n' ++ ' operation, see "functools.total_ordering()".\n' ++ '\n' ++ 'object.__hash__(self)\n' ++ '\n' ++ ' Called by built-in function "hash()" and for ' ++ 'operations on members\n' ++ ' of hashed collections including "set", "frozenset", ' ++ 'and "dict".\n' ++ ' "__hash__()" should return an integer. The only ' ++ 'required property\n' ++ ' is that objects which compare equal have the same hash ' ++ 'value; it is\n' ++ ' advised to somehow mix together (e.g. using exclusive ' ++ 'or) the hash\n' ++ ' values for the components of the object that also play ' ++ 'a part in\n' ++ ' comparison of objects.\n' ++ '\n' ++ ' Note: "hash()" truncates the value returned from an ' ++ "object's\n" ++ ' custom "__hash__()" method to the size of a ' ++ '"Py_ssize_t". This\n' ++ ' is typically 8 bytes on 64-bit builds and 4 bytes on ' ++ '32-bit\n' ++ ' builds. If an object\'s "__hash__()" must ' ++ 'interoperate on builds\n' ++ ' of different bit sizes, be sure to check the width ' ++ 'on all\n' ++ ' supported builds. An easy way to do this is with ' ++ '"python -c\n' ++ ' "import sys; print(sys.hash_info.width)""\n' ++ '\n' ++ ' If a class does not define an "__eq__()" method it ' ++ 'should not\n' ++ ' define a "__hash__()" operation either; if it defines ' ++ '"__eq__()"\n' ++ ' but not "__hash__()", its instances will not be usable ' ++ 'as items in\n' ++ ' hashable collections. If a class defines mutable ' ++ 'objects and\n' ++ ' implements an "__eq__()" method, it should not ' ++ 'implement\n' ++ ' "__hash__()", since the implementation of hashable ' ++ 'collections\n' ++ " requires that a key's hash value is immutable (if the " ++ "object's hash\n" ++ ' value changes, it will be in the wrong hash bucket).\n' ++ '\n' ++ ' User-defined classes have "__eq__()" and "__hash__()" ' ++ 'methods by\n' ++ ' default; with them, all objects compare unequal ' ++ '(except with\n' ++ ' themselves) and "x.__hash__()" returns an appropriate ' ++ 'value such\n' ++ ' that "x == y" implies both that "x is y" and "hash(x) ' ++ '== hash(y)".\n' ++ '\n' ++ ' A class that overrides "__eq__()" and does not define ' ++ '"__hash__()"\n' ++ ' will have its "__hash__()" implicitly set to "None". ' ++ 'When the\n' ++ ' "__hash__()" method of a class is "None", instances of ' ++ 'the class\n' ++ ' will raise an appropriate "TypeError" when a program ' ++ 'attempts to\n' ++ ' retrieve their hash value, and will also be correctly ' ++ 'identified as\n' ++ ' unhashable when checking "isinstance(obj, ' ++ 'collections.Hashable").\n' ++ '\n' ++ ' If a class that overrides "__eq__()" needs to retain ' ++ 'the\n' ++ ' implementation of "__hash__()" from a parent class, ' ++ 'the interpreter\n' ++ ' must be told this explicitly by setting "__hash__ =\n' ++ ' .__hash__".\n' ++ '\n' ++ ' If a class that does not override "__eq__()" wishes to ' ++ 'suppress\n' ++ ' hash support, it should include "__hash__ = None" in ' ++ 'the class\n' ++ ' definition. A class which defines its own "__hash__()" ' ++ 'that\n' ++ ' explicitly raises a "TypeError" would be incorrectly ' ++ 'identified as\n' ++ ' hashable by an "isinstance(obj, collections.Hashable)" ' ++ 'call.\n' ++ '\n' ++ ' Note: By default, the "__hash__()" values of str, ' ++ 'bytes and\n' ++ ' datetime objects are "salted" with an unpredictable ' ++ 'random value.\n' ++ ' Although they remain constant within an individual ' ++ 'Python\n' ++ ' process, they are not predictable between repeated ' ++ 'invocations of\n' ++ ' Python.This is intended to provide protection ' ++ 'against a denial-\n' ++ ' of-service caused by carefully-chosen inputs that ' ++ 'exploit the\n' ++ ' worst case performance of a dict insertion, O(n^2) ' ++ 'complexity.\n' ++ ' See ' ++ 'http://www.ocert.org/advisories/ocert-2011-003.html for\n' ++ ' details.Changing hash values affects the iteration ' ++ 'order of\n' ++ ' dicts, sets and other mappings. Python has never ' ++ 'made guarantees\n' ++ ' about this ordering (and it typically varies between ' ++ '32-bit and\n' ++ ' 64-bit builds).See also "PYTHONHASHSEED".\n' ++ '\n' ++ ' Changed in version 3.3: Hash randomization is enabled ' ++ 'by default.\n' ++ '\n' ++ 'object.__bool__(self)\n' ++ '\n' ++ ' Called to implement truth value testing and the ' ++ 'built-in operation\n' ++ ' "bool()"; should return "False" or "True". When this ' ++ 'method is not\n' ++ ' defined, "__len__()" is called, if it is defined, and ' ++ 'the object is\n' ++ ' considered true if its result is nonzero. If a class ' ++ 'defines\n' ++ ' neither "__len__()" nor "__bool__()", all its ' ++ 'instances are\n' ++ ' considered true.\n', ++ 'debugger': '\n' ++ '"pdb" --- The Python Debugger\n' ++ '*****************************\n' ++ '\n' ++ 'The module "pdb" defines an interactive source code debugger ' ++ 'for\n' ++ 'Python programs. It supports setting (conditional) ' ++ 'breakpoints and\n' ++ 'single stepping at the source line level, inspection of stack ' ++ 'frames,\n' ++ 'source code listing, and evaluation of arbitrary Python code ' ++ 'in the\n' ++ 'context of any stack frame. It also supports post-mortem ' ++ 'debugging\n' ++ 'and can be called under program control.\n' ++ '\n' ++ 'The debugger is extensible -- it is actually defined as the ' ++ 'class\n' ++ '"Pdb". This is currently undocumented but easily understood by ' ++ 'reading\n' ++ 'the source. The extension interface uses the modules "bdb" ' ++ 'and "cmd".\n' ++ '\n' ++ 'The debugger\'s prompt is "(Pdb)". Typical usage to run a ' ++ 'program under\n' ++ 'control of the debugger is:\n' ++ '\n' ++ ' >>> import pdb\n' ++ ' >>> import mymodule\n' ++ " >>> pdb.run('mymodule.test()')\n" ++ ' > (0)?()\n' ++ ' (Pdb) continue\n' ++ ' > (1)?()\n' ++ ' (Pdb) continue\n' ++ " NameError: 'spam'\n" ++ ' > (1)?()\n' ++ ' (Pdb)\n' ++ '\n' ++ 'Changed in version 3.3: Tab-completion via the "readline" ' ++ 'module is\n' ++ 'available for commands and command arguments, e.g. the current ' ++ 'global\n' ++ 'and local names are offered as arguments of the "p" command.\n' ++ '\n' ++ '"pdb.py" can also be invoked as a script to debug other ' ++ 'scripts. For\n' ++ 'example:\n' ++ '\n' ++ ' python3 -m pdb myscript.py\n' ++ '\n' ++ 'When invoked as a script, pdb will automatically enter ' ++ 'post-mortem\n' ++ 'debugging if the program being debugged exits abnormally. ' ++ 'After post-\n' ++ 'mortem debugging (or after normal exit of the program), pdb ' ++ 'will\n' ++ "restart the program. Automatic restarting preserves pdb's " ++ 'state (such\n' ++ 'as breakpoints) and in most cases is more useful than quitting ' ++ 'the\n' ++ "debugger upon program's exit.\n" ++ '\n' ++ 'New in version 3.2: "pdb.py" now accepts a "-c" option that ' ++ 'executes\n' ++ 'commands as if given in a ".pdbrc" file, see *Debugger ' ++ 'Commands*.\n' ++ '\n' ++ 'The typical usage to break into the debugger from a running ' ++ 'program is\n' ++ 'to insert\n' ++ '\n' ++ ' import pdb; pdb.set_trace()\n' ++ '\n' ++ 'at the location you want to break into the debugger. You can ' ++ 'then\n' ++ 'step through the code following this statement, and continue ' ++ 'running\n' ++ 'without the debugger using the "continue" command.\n' ++ '\n' ++ 'The typical usage to inspect a crashed program is:\n' ++ '\n' ++ ' >>> import pdb\n' ++ ' >>> import mymodule\n' ++ ' >>> mymodule.test()\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 1, in ?\n' ++ ' File "./mymodule.py", line 4, in test\n' ++ ' test2()\n' ++ ' File "./mymodule.py", line 3, in test2\n' ++ ' print(spam)\n' ++ ' NameError: spam\n' ++ ' >>> pdb.pm()\n' ++ ' > ./mymodule.py(3)test2()\n' ++ ' -> print(spam)\n' ++ ' (Pdb)\n' ++ '\n' ++ 'The module defines the following functions; each enters the ' ++ 'debugger\n' ++ 'in a slightly different way:\n' ++ '\n' ++ 'pdb.run(statement, globals=None, locals=None)\n' ++ '\n' ++ ' Execute the *statement* (given as a string or a code ' ++ 'object) under\n' ++ ' debugger control. The debugger prompt appears before any ' ++ 'code is\n' ++ ' executed; you can set breakpoints and type "continue", or ' ++ 'you can\n' ++ ' step through the statement using "step" or "next" (all ' ++ 'these\n' ++ ' commands are explained below). The optional *globals* and ' ++ '*locals*\n' ++ ' arguments specify the environment in which the code is ' ++ 'executed; by\n' ++ ' default the dictionary of the module "__main__" is used. ' ++ '(See the\n' ++ ' explanation of the built-in "exec()" or "eval()" ' ++ 'functions.)\n' ++ '\n' ++ 'pdb.runeval(expression, globals=None, locals=None)\n' ++ '\n' ++ ' Evaluate the *expression* (given as a string or a code ' ++ 'object)\n' ++ ' under debugger control. When "runeval()" returns, it ' ++ 'returns the\n' ++ ' value of the expression. Otherwise this function is ' ++ 'similar to\n' ++ ' "run()".\n' ++ '\n' ++ 'pdb.runcall(function, *args, **kwds)\n' ++ '\n' ++ ' Call the *function* (a function or method object, not a ' ++ 'string)\n' ++ ' with the given arguments. When "runcall()" returns, it ' ++ 'returns\n' ++ ' whatever the function call returned. The debugger prompt ' ++ 'appears\n' ++ ' as soon as the function is entered.\n' ++ '\n' ++ 'pdb.set_trace()\n' ++ '\n' ++ ' Enter the debugger at the calling stack frame. This is ' ++ 'useful to\n' ++ ' hard-code a breakpoint at a given point in a program, even ' ++ 'if the\n' ++ ' code is not otherwise being debugged (e.g. when an ' ++ 'assertion\n' ++ ' fails).\n' ++ '\n' ++ 'pdb.post_mortem(traceback=None)\n' ++ '\n' ++ ' Enter post-mortem debugging of the given *traceback* ' ++ 'object. If no\n' ++ ' *traceback* is given, it uses the one of the exception that ' ++ 'is\n' ++ ' currently being handled (an exception must be being handled ' ++ 'if the\n' ++ ' default is to be used).\n' ++ '\n' ++ 'pdb.pm()\n' ++ '\n' ++ ' Enter post-mortem debugging of the traceback found in\n' ++ ' "sys.last_traceback".\n' ++ '\n' ++ 'The "run*" functions and "set_trace()" are aliases for ' ++ 'instantiating\n' ++ 'the "Pdb" class and calling the method of the same name. If ' ++ 'you want\n' ++ 'to access further features, you have to do this yourself:\n' ++ '\n' ++ "class class pdb.Pdb(completekey='tab', stdin=None, " ++ 'stdout=None, skip=None, nosigint=False)\n' ++ '\n' ++ ' "Pdb" is the debugger class.\n' ++ '\n' ++ ' The *completekey*, *stdin* and *stdout* arguments are ' ++ 'passed to the\n' ++ ' underlying "cmd.Cmd" class; see the description there.\n' ++ '\n' ++ ' The *skip* argument, if given, must be an iterable of ' ++ 'glob-style\n' ++ ' module name patterns. The debugger will not step into ' ++ 'frames that\n' ++ ' originate in a module that matches one of these patterns. ' ++ '[1]\n' ++ '\n' ++ ' By default, Pdb sets a handler for the SIGINT signal (which ' ++ 'is sent\n' ++ ' when the user presses Ctrl-C on the console) when you give ' ++ 'a\n' ++ ' "continue" command. This allows you to break into the ' ++ 'debugger\n' ++ ' again by pressing Ctrl-C. If you want Pdb not to touch the ' ++ 'SIGINT\n' ++ ' handler, set *nosigint* tot true.\n' ++ '\n' ++ ' Example call to enable tracing with *skip*:\n' ++ '\n' ++ " import pdb; pdb.Pdb(skip=['django.*']).set_trace()\n" ++ '\n' ++ ' New in version 3.1: The *skip* argument.\n' ++ '\n' ++ ' New in version 3.2: The *nosigint* argument. Previously, a ' ++ 'SIGINT\n' ++ ' handler was never set by Pdb.\n' ++ '\n' ++ ' run(statement, globals=None, locals=None)\n' ++ ' runeval(expression, globals=None, locals=None)\n' ++ ' runcall(function, *args, **kwds)\n' ++ ' set_trace()\n' ++ '\n' ++ ' See the documentation for the functions explained ' ++ 'above.\n' ++ '\n' ++ '\n' ++ 'Debugger Commands\n' ++ '=================\n' ++ '\n' ++ 'The commands recognized by the debugger are listed below. ' ++ 'Most\n' ++ 'commands can be abbreviated to one or two letters as ' ++ 'indicated; e.g.\n' ++ '"h(elp)" means that either "h" or "help" can be used to enter ' ++ 'the help\n' ++ 'command (but not "he" or "hel", nor "H" or "Help" or "HELP").\n' ++ 'Arguments to commands must be separated by whitespace (spaces ' ++ 'or\n' ++ 'tabs). Optional arguments are enclosed in square brackets ' ++ '("[]") in\n' ++ 'the command syntax; the square brackets must not be typed.\n' ++ 'Alternatives in the command syntax are separated by a vertical ' ++ 'bar\n' ++ '("|").\n' ++ '\n' ++ 'Entering a blank line repeats the last command entered. ' ++ 'Exception: if\n' ++ 'the last command was a "list" command, the next 11 lines are ' ++ 'listed.\n' ++ '\n' ++ "Commands that the debugger doesn't recognize are assumed to be " ++ 'Python\n' ++ 'statements and are executed in the context of the program ' ++ 'being\n' ++ 'debugged. Python statements can also be prefixed with an ' ++ 'exclamation\n' ++ 'point ("!"). This is a powerful way to inspect the program ' ++ 'being\n' ++ 'debugged; it is even possible to change a variable or call a ' ++ 'function.\n' ++ 'When an exception occurs in such a statement, the exception ' ++ 'name is\n' ++ "printed but the debugger's state is not changed.\n" ++ '\n' ++ 'The debugger supports *aliases*. Aliases can have parameters ' ++ 'which\n' ++ 'allows one a certain level of adaptability to the context ' ++ 'under\n' ++ 'examination.\n' ++ '\n' ++ 'Multiple commands may be entered on a single line, separated ' ++ 'by ";;".\n' ++ '(A single ";" is not used as it is the separator for multiple ' ++ 'commands\n' ++ 'in a line that is passed to the Python parser.) No ' ++ 'intelligence is\n' ++ 'applied to separating the commands; the input is split at the ' ++ 'first\n' ++ '";;" pair, even if it is in the middle of a quoted string.\n' ++ '\n' ++ 'If a file ".pdbrc" exists in the user\'s home directory or in ' ++ 'the\n' ++ 'current directory, it is read in and executed as if it had ' ++ 'been typed\n' ++ 'at the debugger prompt. This is particularly useful for ' ++ 'aliases. If\n' ++ 'both files exist, the one in the home directory is read first ' ++ 'and\n' ++ 'aliases defined there can be overridden by the local file.\n' ++ '\n' ++ 'Changed in version 3.2: ".pdbrc" can now contain commands ' ++ 'that\n' ++ 'continue debugging, such as "continue" or "next". Previously, ' ++ 'these\n' ++ 'commands had no effect.\n' ++ '\n' ++ 'h(elp) [command]\n' ++ '\n' ++ ' Without argument, print the list of available commands. ' ++ 'With a\n' ++ ' *command* as argument, print help about that command. ' ++ '"help pdb"\n' ++ ' displays the full documentation (the docstring of the ' ++ '"pdb"\n' ++ ' module). Since the *command* argument must be an ' ++ 'identifier, "help\n' ++ ' exec" must be entered to get help on the "!" command.\n' ++ '\n' ++ 'w(here)\n' ++ '\n' ++ ' Print a stack trace, with the most recent frame at the ' ++ 'bottom. An\n' ++ ' arrow indicates the current frame, which determines the ' ++ 'context of\n' ++ ' most commands.\n' ++ '\n' ++ 'd(own) [count]\n' ++ '\n' ++ ' Move the current frame *count* (default one) levels down in ' ++ 'the\n' ++ ' stack trace (to a newer frame).\n' ++ '\n' ++ 'u(p) [count]\n' ++ '\n' ++ ' Move the current frame *count* (default one) levels up in ' ++ 'the stack\n' ++ ' trace (to an older frame).\n' ++ '\n' ++ 'b(reak) [([filename:]lineno | function) [, condition]]\n' ++ '\n' ++ ' With a *lineno* argument, set a break there in the current ' ++ 'file.\n' ++ ' With a *function* argument, set a break at the first ' ++ 'executable\n' ++ ' statement within that function. The line number may be ' ++ 'prefixed\n' ++ ' with a filename and a colon, to specify a breakpoint in ' ++ 'another\n' ++ " file (probably one that hasn't been loaded yet). The file " ++ 'is\n' ++ ' searched on "sys.path". Note that each breakpoint is ' ++ 'assigned a\n' ++ ' number to which all the other breakpoint commands refer.\n' ++ '\n' ++ ' If a second argument is present, it is an expression which ' ++ 'must\n' ++ ' evaluate to true before the breakpoint is honored.\n' ++ '\n' ++ ' Without argument, list all breaks, including for each ' ++ 'breakpoint,\n' ++ ' the number of times that breakpoint has been hit, the ' ++ 'current\n' ++ ' ignore count, and the associated condition if any.\n' ++ '\n' ++ 'tbreak [([filename:]lineno | function) [, condition]]\n' ++ '\n' ++ ' Temporary breakpoint, which is removed automatically when ' ++ 'it is\n' ++ ' first hit. The arguments are the same as for "break".\n' ++ '\n' ++ 'cl(ear) [filename:lineno | bpnumber [bpnumber ...]]\n' ++ '\n' ++ ' With a *filename:lineno* argument, clear all the ' ++ 'breakpoints at\n' ++ ' this line. With a space separated list of breakpoint ' ++ 'numbers, clear\n' ++ ' those breakpoints. Without argument, clear all breaks (but ' ++ 'first\n' ++ ' ask confirmation).\n' ++ '\n' ++ 'disable [bpnumber [bpnumber ...]]\n' ++ '\n' ++ ' Disable the breakpoints given as a space separated list of\n' ++ ' breakpoint numbers. Disabling a breakpoint means it cannot ' ++ 'cause\n' ++ ' the program to stop execution, but unlike clearing a ' ++ 'breakpoint, it\n' ++ ' remains in the list of breakpoints and can be ' ++ '(re-)enabled.\n' ++ '\n' ++ 'enable [bpnumber [bpnumber ...]]\n' ++ '\n' ++ ' Enable the breakpoints specified.\n' ++ '\n' ++ 'ignore bpnumber [count]\n' ++ '\n' ++ ' Set the ignore count for the given breakpoint number. If ' ++ 'count is\n' ++ ' omitted, the ignore count is set to 0. A breakpoint ' ++ 'becomes active\n' ++ ' when the ignore count is zero. When non-zero, the count ' ++ 'is\n' ++ ' decremented each time the breakpoint is reached and the ' ++ 'breakpoint\n' ++ ' is not disabled and any associated condition evaluates to ' ++ 'true.\n' ++ '\n' ++ 'condition bpnumber [condition]\n' ++ '\n' ++ ' Set a new *condition* for the breakpoint, an expression ' ++ 'which must\n' ++ ' evaluate to true before the breakpoint is honored. If ' ++ '*condition*\n' ++ ' is absent, any existing condition is removed; i.e., the ' ++ 'breakpoint\n' ++ ' is made unconditional.\n' ++ '\n' ++ 'commands [bpnumber]\n' ++ '\n' ++ ' Specify a list of commands for breakpoint number ' ++ '*bpnumber*. The\n' ++ ' commands themselves appear on the following lines. Type a ' ++ 'line\n' ++ ' containing just "end" to terminate the commands. An ' ++ 'example:\n' ++ '\n' ++ ' (Pdb) commands 1\n' ++ ' (com) p some_variable\n' ++ ' (com) end\n' ++ ' (Pdb)\n' ++ '\n' ++ ' To remove all commands from a breakpoint, type commands and ' ++ 'follow\n' ++ ' it immediately with "end"; that is, give no commands.\n' ++ '\n' ++ ' With no *bpnumber* argument, commands refers to the last ' ++ 'breakpoint\n' ++ ' set.\n' ++ '\n' ++ ' You can use breakpoint commands to start your program up ' ++ 'again.\n' ++ ' Simply use the continue command, or step, or any other ' ++ 'command that\n' ++ ' resumes execution.\n' ++ '\n' ++ ' Specifying any command resuming execution (currently ' ++ 'continue,\n' ++ ' step, next, return, jump, quit and their abbreviations) ' ++ 'terminates\n' ++ ' the command list (as if that command was immediately ' ++ 'followed by\n' ++ ' end). This is because any time you resume execution (even ' ++ 'with a\n' ++ ' simple next or step), you may encounter another ' ++ 'breakpoint--which\n' ++ ' could have its own command list, leading to ambiguities ' ++ 'about which\n' ++ ' list to execute.\n' ++ '\n' ++ " If you use the 'silent' command in the command list, the " ++ 'usual\n' ++ ' message about stopping at a breakpoint is not printed. ' ++ 'This may be\n' ++ ' desirable for breakpoints that are to print a specific ' ++ 'message and\n' ++ ' then continue. If none of the other commands print ' ++ 'anything, you\n' ++ ' see no sign that the breakpoint was reached.\n' ++ '\n' ++ 's(tep)\n' ++ '\n' ++ ' Execute the current line, stop at the first possible ' ++ 'occasion\n' ++ ' (either in a function that is called or on the next line in ' ++ 'the\n' ++ ' current function).\n' ++ '\n' ++ 'n(ext)\n' ++ '\n' ++ ' Continue execution until the next line in the current ' ++ 'function is\n' ++ ' reached or it returns. (The difference between "next" and ' ++ '"step"\n' ++ ' is that "step" stops inside a called function, while ' ++ '"next"\n' ++ ' executes called functions at (nearly) full speed, only ' ++ 'stopping at\n' ++ ' the next line in the current function.)\n' ++ '\n' ++ 'unt(il) [lineno]\n' ++ '\n' ++ ' Without argument, continue execution until the line with a ' ++ 'number\n' ++ ' greater than the current one is reached.\n' ++ '\n' ++ ' With a line number, continue execution until a line with a ' ++ 'number\n' ++ ' greater or equal to that is reached. In both cases, also ' ++ 'stop when\n' ++ ' the current frame returns.\n' ++ '\n' ++ ' Changed in version 3.2: Allow giving an explicit line ' ++ 'number.\n' ++ '\n' ++ 'r(eturn)\n' ++ '\n' ++ ' Continue execution until the current function returns.\n' ++ '\n' ++ 'c(ont(inue))\n' ++ '\n' ++ ' Continue execution, only stop when a breakpoint is ' ++ 'encountered.\n' ++ '\n' ++ 'j(ump) lineno\n' ++ '\n' ++ ' Set the next line that will be executed. Only available in ' ++ 'the\n' ++ ' bottom-most frame. This lets you jump back and execute ' ++ 'code again,\n' ++ " or jump forward to skip code that you don't want to run.\n" ++ '\n' ++ ' It should be noted that not all jumps are allowed -- for ' ++ 'instance\n' ++ ' it is not possible to jump into the middle of a "for" loop ' ++ 'or out\n' ++ ' of a "finally" clause.\n' ++ '\n' ++ 'l(ist) [first[, last]]\n' ++ '\n' ++ ' List source code for the current file. Without arguments, ' ++ 'list 11\n' ++ ' lines around the current line or continue the previous ' ++ 'listing.\n' ++ ' With "." as argument, list 11 lines around the current ' ++ 'line. With\n' ++ ' one argument, list 11 lines around at that line. With two\n' ++ ' arguments, list the given range; if the second argument is ' ++ 'less\n' ++ ' than the first, it is interpreted as a count.\n' ++ '\n' ++ ' The current line in the current frame is indicated by ' ++ '"->". If an\n' ++ ' exception is being debugged, the line where the exception ' ++ 'was\n' ++ ' originally raised or propagated is indicated by ">>", if it ' ++ 'differs\n' ++ ' from the current line.\n' ++ '\n' ++ ' New in version 3.2: The ">>" marker.\n' ++ '\n' ++ 'll | longlist\n' ++ '\n' ++ ' List all source code for the current function or frame.\n' ++ ' Interesting lines are marked as for "list".\n' ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'a(rgs)\n' ++ '\n' ++ ' Print the argument list of the current function.\n' ++ '\n' ++ 'p expression\n' ++ '\n' ++ ' Evaluate the *expression* in the current context and print ' ++ 'its\n' ++ ' value.\n' ++ '\n' ++ ' Note: "print()" can also be used, but is not a debugger ' ++ 'command\n' ++ ' --- this executes the Python "print()" function.\n' ++ '\n' ++ 'pp expression\n' ++ '\n' ++ ' Like the "p" command, except the value of the expression is ' ++ 'pretty-\n' ++ ' printed using the "pprint" module.\n' ++ '\n' ++ 'whatis expression\n' ++ '\n' ++ ' Print the type of the *expression*.\n' ++ '\n' ++ 'source expression\n' ++ '\n' ++ ' Try to get source code for the given object and display ' ++ 'it.\n' ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'display [expression]\n' ++ '\n' ++ ' Display the value of the expression if it changed, each ' ++ 'time\n' ++ ' execution stops in the current frame.\n' ++ '\n' ++ ' Without expression, list all display expressions for the ' ++ 'current\n' ++ ' frame.\n' ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'undisplay [expression]\n' ++ '\n' ++ ' Do not display the expression any more in the current ' ++ 'frame.\n' ++ ' Without expression, clear all display expressions for the ' ++ 'current\n' ++ ' frame.\n' ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'interact\n' ++ '\n' ++ ' Start an interative interpreter (using the "code" module) ' ++ 'whose\n' ++ ' global namespace contains all the (global and local) names ' ++ 'found in\n' ++ ' the current scope.\n' ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'alias [name [command]]\n' ++ '\n' ++ ' Create an alias called *name* that executes *command*. The ' ++ 'command\n' ++ ' must *not* be enclosed in quotes. Replaceable parameters ' ++ 'can be\n' ++ ' indicated by "%1", "%2", and so on, while "%*" is replaced ' ++ 'by all\n' ++ ' the parameters. If no command is given, the current alias ' ++ 'for\n' ++ ' *name* is shown. If no arguments are given, all aliases are ' ++ 'listed.\n' ++ '\n' ++ ' Aliases may be nested and can contain anything that can be ' ++ 'legally\n' ++ ' typed at the pdb prompt. Note that internal pdb commands ' ++ '*can* be\n' ++ ' overridden by aliases. Such a command is then hidden until ' ++ 'the\n' ++ ' alias is removed. Aliasing is recursively applied to the ' ++ 'first\n' ++ ' word of the command line; all other words in the line are ' ++ 'left\n' ++ ' alone.\n' ++ '\n' ++ ' As an example, here are two useful aliases (especially when ' ++ 'placed\n' ++ ' in the ".pdbrc" file):\n' ++ '\n' ++ ' # Print instance variables (usage "pi classInst")\n' ++ ' alias pi for k in %1.__dict__.keys(): ' ++ 'print("%1.",k,"=",%1.__dict__[k])\n' ++ ' # Print instance variables in self\n' ++ ' alias ps pi self\n' ++ '\n' ++ 'unalias name\n' ++ '\n' ++ ' Delete the specified alias.\n' ++ '\n' ++ '! statement\n' ++ '\n' ++ ' Execute the (one-line) *statement* in the context of the ' ++ 'current\n' ++ ' stack frame. The exclamation point can be omitted unless ' ++ 'the first\n' ++ ' word of the statement resembles a debugger command. To set ' ++ 'a\n' ++ ' global variable, you can prefix the assignment command with ' ++ 'a\n' ++ ' "global" statement on the same line, e.g.:\n' ++ '\n' ++ " (Pdb) global list_options; list_options = ['-l']\n" ++ ' (Pdb)\n' ++ '\n' ++ 'run [args ...]\n' ++ 'restart [args ...]\n' ++ '\n' ++ ' Restart the debugged Python program. If an argument is ' ++ 'supplied,\n' ++ ' it is split with "shlex" and the result is used as the new\n' ++ ' "sys.argv". History, breakpoints, actions and debugger ' ++ 'options are\n' ++ ' preserved. "restart" is an alias for "run".\n' ++ '\n' ++ 'q(uit)\n' ++ '\n' ++ ' Quit from the debugger. The program being executed is ' ++ 'aborted.\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] Whether a frame is considered to originate in a certain ' ++ 'module\n' ++ ' is determined by the "__name__" in the frame globals.\n', ++ 'del': '\n' ++ 'The "del" statement\n' ++ '*******************\n' ++ '\n' ++ ' del_stmt ::= "del" target_list\n' ++ '\n' ++ 'Deletion is recursively defined very similar to the way assignment ' ++ 'is\n' ++ 'defined. Rather than spelling it out in full details, here are ' ++ 'some\n' ++ 'hints.\n' ++ '\n' ++ 'Deletion of a target list recursively deletes each target, from ' ++ 'left\n' ++ 'to right.\n' ++ '\n' ++ 'Deletion of a name removes the binding of that name from the local ' ++ 'or\n' ++ 'global namespace, depending on whether the name occurs in a ' ++ '"global"\n' ++ 'statement in the same code block. If the name is unbound, a\n' ++ '"NameError" exception will be raised.\n' ++ '\n' ++ 'Deletion of attribute references, subscriptions and slicings is ' ++ 'passed\n' ++ 'to the primary object involved; deletion of a slicing is in ' ++ 'general\n' ++ 'equivalent to assignment of an empty slice of the right type (but ' ++ 'even\n' ++ 'this is determined by the sliced object).\n' ++ '\n' ++ 'Changed in version 3.2: Previously it was illegal to delete a name\n' ++ 'from the local namespace if it occurs as a free variable in a ' ++ 'nested\n' ++ 'block.\n', ++ 'dict': '\n' ++ 'Dictionary displays\n' ++ '*******************\n' ++ '\n' ++ 'A dictionary display is a possibly empty series of key/datum ' ++ 'pairs\n' ++ 'enclosed in curly braces:\n' ++ '\n' ++ ' dict_display ::= "{" [key_datum_list | ' ++ 'dict_comprehension] "}"\n' ++ ' key_datum_list ::= key_datum ("," key_datum)* [","]\n' ++ ' key_datum ::= expression ":" expression\n' ++ ' dict_comprehension ::= expression ":" expression comp_for\n' ++ '\n' ++ 'A dictionary display yields a new dictionary object.\n' ++ '\n' ++ 'If a comma-separated sequence of key/datum pairs is given, they ' ++ 'are\n' ++ 'evaluated from left to right to define the entries of the ' ++ 'dictionary:\n' ++ 'each key object is used as a key into the dictionary to store the\n' ++ 'corresponding datum. This means that you can specify the same ' ++ 'key\n' ++ "multiple times in the key/datum list, and the final dictionary's " ++ 'value\n' ++ 'for that key will be the last one given.\n' ++ '\n' ++ 'A dict comprehension, in contrast to list and set comprehensions,\n' ++ 'needs two expressions separated with a colon followed by the ' ++ 'usual\n' ++ '"for" and "if" clauses. When the comprehension is run, the ' ++ 'resulting\n' ++ 'key and value elements are inserted in the new dictionary in the ' ++ 'order\n' ++ 'they are produced.\n' ++ '\n' ++ 'Restrictions on the types of the key values are listed earlier in\n' ++ 'section *The standard type hierarchy*. (To summarize, the key ' ++ 'type\n' ++ 'should be *hashable*, which excludes all mutable objects.) ' ++ 'Clashes\n' ++ 'between duplicate keys are not detected; the last datum ' ++ '(textually\n' ++ 'rightmost in the display) stored for a given key value prevails.\n', ++ 'dynamic-features': '\n' ++ 'Interaction with dynamic features\n' ++ '*********************************\n' ++ '\n' ++ 'There are several cases where Python statements are ' ++ 'illegal when used\n' ++ 'in conjunction with nested scopes that contain free ' ++ 'variables.\n' ++ '\n' ++ 'If a variable is referenced in an enclosing scope, it ' ++ 'is illegal to\n' ++ 'delete the name. An error will be reported at compile ' ++ 'time.\n' ++ '\n' ++ 'If the wild card form of import --- "import *" --- is ' ++ 'used in a\n' ++ 'function and the function contains or is a nested ' ++ 'block with free\n' ++ 'variables, the compiler will raise a "SyntaxError".\n' ++ '\n' ++ 'The "eval()" and "exec()" functions do not have access ' ++ 'to the full\n' ++ 'environment for resolving names. Names may be ' ++ 'resolved in the local\n' ++ 'and global namespaces of the caller. Free variables ' ++ 'are not resolved\n' ++ 'in the nearest enclosing namespace, but in the global ' ++ 'namespace. [1]\n' ++ 'The "exec()" and "eval()" functions have optional ' ++ 'arguments to\n' ++ 'override the global and local namespace. If only one ' ++ 'namespace is\n' ++ 'specified, it is used for both.\n', ++ 'else': '\n' ++ 'The "if" statement\n' ++ '******************\n' ++ '\n' ++ 'The "if" statement is used for conditional execution:\n' ++ '\n' ++ ' if_stmt ::= "if" expression ":" suite\n' ++ ' ( "elif" expression ":" suite )*\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'It selects exactly one of the suites by evaluating the expressions ' ++ 'one\n' ++ 'by one until one is found to be true (see section *Boolean ' ++ 'operations*\n' ++ 'for the definition of true and false); then that suite is ' ++ 'executed\n' ++ '(and no other part of the "if" statement is executed or ' ++ 'evaluated).\n' ++ 'If all expressions are false, the suite of the "else" clause, if\n' ++ 'present, is executed.\n', ++ 'exceptions': '\n' ++ 'Exceptions\n' ++ '**********\n' ++ '\n' ++ 'Exceptions are a means of breaking out of the normal flow of ' ++ 'control\n' ++ 'of a code block in order to handle errors or other ' ++ 'exceptional\n' ++ 'conditions. An exception is *raised* at the point where the ' ++ 'error is\n' ++ 'detected; it may be *handled* by the surrounding code block ' ++ 'or by any\n' ++ 'code block that directly or indirectly invoked the code ' ++ 'block where\n' ++ 'the error occurred.\n' ++ '\n' ++ 'The Python interpreter raises an exception when it detects a ' ++ 'run-time\n' ++ 'error (such as division by zero). A Python program can ' ++ 'also\n' ++ 'explicitly raise an exception with the "raise" statement. ' ++ 'Exception\n' ++ 'handlers are specified with the "try" ... "except" ' ++ 'statement. The\n' ++ '"finally" clause of such a statement can be used to specify ' ++ 'cleanup\n' ++ 'code which does not handle the exception, but is executed ' ++ 'whether an\n' ++ 'exception occurred or not in the preceding code.\n' ++ '\n' ++ 'Python uses the "termination" model of error handling: an ' ++ 'exception\n' ++ 'handler can find out what happened and continue execution at ' ++ 'an outer\n' ++ 'level, but it cannot repair the cause of the error and retry ' ++ 'the\n' ++ 'failing operation (except by re-entering the offending piece ' ++ 'of code\n' ++ 'from the top).\n' ++ '\n' ++ 'When an exception is not handled at all, the interpreter ' ++ 'terminates\n' ++ 'execution of the program, or returns to its interactive main ' ++ 'loop. In\n' ++ 'either case, it prints a stack backtrace, except when the ' ++ 'exception is\n' ++ '"SystemExit".\n' ++ '\n' ++ 'Exceptions are identified by class instances. The "except" ' ++ 'clause is\n' ++ 'selected depending on the class of the instance: it must ' ++ 'reference the\n' ++ 'class of the instance or a base class thereof. The instance ' ++ 'can be\n' ++ 'received by the handler and can carry additional information ' ++ 'about the\n' ++ 'exceptional condition.\n' ++ '\n' ++ 'Note: Exception messages are not part of the Python API. ' ++ 'Their\n' ++ ' contents may change from one version of Python to the next ' ++ 'without\n' ++ ' warning and should not be relied on by code which will run ' ++ 'under\n' ++ ' multiple versions of the interpreter.\n' ++ '\n' ++ 'See also the description of the "try" statement in section ' ++ '*The try\n' ++ 'statement* and "raise" statement in section *The raise ' ++ 'statement*.\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] This limitation occurs because the code that is executed ' ++ 'by\n' ++ ' these operations is not available at the time the module ' ++ 'is\n' ++ ' compiled.\n', ++ 'execmodel': '\n' ++ 'Execution model\n' ++ '***************\n' ++ '\n' ++ '\n' ++ 'Naming and binding\n' ++ '==================\n' ++ '\n' ++ '*Names* refer to objects. Names are introduced by name ' ++ 'binding\n' ++ 'operations. Each occurrence of a name in the program text ' ++ 'refers to\n' ++ 'the *binding* of that name established in the innermost ' ++ 'function block\n' ++ 'containing the use.\n' ++ '\n' ++ 'A *block* is a piece of Python program text that is executed ' ++ 'as a\n' ++ 'unit. The following are blocks: a module, a function body, ' ++ 'and a class\n' ++ 'definition. Each command typed interactively is a block. A ' ++ 'script\n' ++ 'file (a file given as standard input to the interpreter or ' ++ 'specified\n' ++ 'as a command line argument to the interpreter) is a code ' ++ 'block. A\n' ++ 'script command (a command specified on the interpreter ' ++ 'command line\n' ++ "with the '**-c**' option) is a code block. The string " ++ 'argument passed\n' ++ 'to the built-in functions "eval()" and "exec()" is a code ' ++ 'block.\n' ++ '\n' ++ 'A code block is executed in an *execution frame*. A frame ' ++ 'contains\n' ++ 'some administrative information (used for debugging) and ' ++ 'determines\n' ++ "where and how execution continues after the code block's " ++ 'execution has\n' ++ 'completed.\n' ++ '\n' ++ 'A *scope* defines the visibility of a name within a block. ' ++ 'If a local\n' ++ 'variable is defined in a block, its scope includes that ' ++ 'block. If the\n' ++ 'definition occurs in a function block, the scope extends to ' ++ 'any blocks\n' ++ 'contained within the defining one, unless a contained block ' ++ 'introduces\n' ++ 'a different binding for the name. The scope of names defined ' ++ 'in a\n' ++ 'class block is limited to the class block; it does not extend ' ++ 'to the\n' ++ 'code blocks of methods -- this includes comprehensions and ' ++ 'generator\n' ++ 'expressions since they are implemented using a function ' ++ 'scope. This\n' ++ 'means that the following will fail:\n' ++ '\n' ++ ' class A:\n' ++ ' a = 42\n' ++ ' b = list(a + i for i in range(10))\n' ++ '\n' ++ 'When a name is used in a code block, it is resolved using the ' ++ 'nearest\n' ++ 'enclosing scope. The set of all such scopes visible to a ' ++ 'code block\n' ++ "is called the block's *environment*.\n" ++ '\n' ++ 'If a name is bound in a block, it is a local variable of that ' ++ 'block,\n' ++ 'unless declared as "nonlocal". If a name is bound at the ' ++ 'module\n' ++ 'level, it is a global variable. (The variables of the module ' ++ 'code\n' ++ 'block are local and global.) If a variable is used in a code ' ++ 'block\n' ++ 'but not defined there, it is a *free variable*.\n' ++ '\n' ++ 'When a name is not found at all, a "NameError" exception is ' ++ 'raised.\n' ++ 'If the name refers to a local variable that has not been ' ++ 'bound, an\n' ++ '"UnboundLocalError" exception is raised. "UnboundLocalError" ' ++ 'is a\n' ++ 'subclass of "NameError".\n' ++ '\n' ++ 'The following constructs bind names: formal parameters to ' ++ 'functions,\n' ++ '"import" statements, class and function definitions (these ' ++ 'bind the\n' ++ 'class or function name in the defining block), and targets ' ++ 'that are\n' ++ 'identifiers if occurring in an assignment, "for" loop header, ' ++ 'or after\n' ++ '"as" in a "with" statement or "except" clause. The "import" ' ++ 'statement\n' ++ 'of the form "from ... import *" binds all names defined in ' ++ 'the\n' ++ 'imported module, except those beginning with an underscore. ' ++ 'This form\n' ++ 'may only be used at the module level.\n' ++ '\n' ++ 'A target occurring in a "del" statement is also considered ' ++ 'bound for\n' ++ 'this purpose (though the actual semantics are to unbind the ' ++ 'name).\n' ++ '\n' ++ 'Each assignment or import statement occurs within a block ' ++ 'defined by a\n' ++ 'class or function definition or at the module level (the ' ++ 'top-level\n' ++ 'code block).\n' ++ '\n' ++ 'If a name binding operation occurs anywhere within a code ' ++ 'block, all\n' ++ 'uses of the name within the block are treated as references ' ++ 'to the\n' ++ 'current block. This can lead to errors when a name is used ' ++ 'within a\n' ++ 'block before it is bound. This rule is subtle. Python ' ++ 'lacks\n' ++ 'declarations and allows name binding operations to occur ' ++ 'anywhere\n' ++ 'within a code block. The local variables of a code block can ' ++ 'be\n' ++ 'determined by scanning the entire text of the block for name ' ++ 'binding\n' ++ 'operations.\n' ++ '\n' ++ 'If the "global" statement occurs within a block, all uses of ' ++ 'the name\n' ++ 'specified in the statement refer to the binding of that name ' ++ 'in the\n' ++ 'top-level namespace. Names are resolved in the top-level ' ++ 'namespace by\n' ++ 'searching the global namespace, i.e. the namespace of the ' ++ 'module\n' ++ 'containing the code block, and the builtins namespace, the ' ++ 'namespace\n' ++ 'of the module "builtins". The global namespace is searched ' ++ 'first. If\n' ++ 'the name is not found there, the builtins namespace is ' ++ 'searched. The\n' ++ 'global statement must precede all uses of the name.\n' ++ '\n' ++ 'The builtins namespace associated with the execution of a ' ++ 'code block\n' ++ 'is actually found by looking up the name "__builtins__" in ' ++ 'its global\n' ++ 'namespace; this should be a dictionary or a module (in the ' ++ 'latter case\n' ++ "the module's dictionary is used). By default, when in the " ++ '"__main__"\n' ++ 'module, "__builtins__" is the built-in module "builtins"; ' ++ 'when in any\n' ++ 'other module, "__builtins__" is an alias for the dictionary ' ++ 'of the\n' ++ '"builtins" module itself. "__builtins__" can be set to a ' ++ 'user-created\n' ++ 'dictionary to create a weak form of restricted execution.\n' ++ '\n' ++ '**CPython implementation detail:** Users should not touch\n' ++ '"__builtins__"; it is strictly an implementation detail. ' ++ 'Users\n' ++ 'wanting to override values in the builtins namespace should ' ++ '"import"\n' ++ 'the "builtins" module and modify its attributes ' ++ 'appropriately.\n' ++ '\n' ++ 'The namespace for a module is automatically created the first ' ++ 'time a\n' ++ 'module is imported. The main module for a script is always ' ++ 'called\n' ++ '"__main__".\n' ++ '\n' ++ 'The "global" statement has the same scope as a name binding ' ++ 'operation\n' ++ 'in the same block. If the nearest enclosing scope for a free ' ++ 'variable\n' ++ 'contains a global statement, the free variable is treated as ' ++ 'a global.\n' ++ '\n' ++ 'A class definition is an executable statement that may use ' ++ 'and define\n' ++ 'names. These references follow the normal rules for name ' ++ 'resolution.\n' ++ 'The namespace of the class definition becomes the attribute ' ++ 'dictionary\n' ++ 'of the class. Names defined at the class scope are not ' ++ 'visible in\n' ++ 'methods.\n' ++ '\n' ++ '\n' ++ 'Interaction with dynamic features\n' ++ '---------------------------------\n' ++ '\n' ++ 'There are several cases where Python statements are illegal ' ++ 'when used\n' ++ 'in conjunction with nested scopes that contain free ' ++ 'variables.\n' ++ '\n' ++ 'If a variable is referenced in an enclosing scope, it is ' ++ 'illegal to\n' ++ 'delete the name. An error will be reported at compile time.\n' ++ '\n' ++ 'If the wild card form of import --- "import *" --- is used in ' ++ 'a\n' ++ 'function and the function contains or is a nested block with ' ++ 'free\n' ++ 'variables, the compiler will raise a "SyntaxError".\n' ++ '\n' ++ 'The "eval()" and "exec()" functions do not have access to the ' ++ 'full\n' ++ 'environment for resolving names. Names may be resolved in ' ++ 'the local\n' ++ 'and global namespaces of the caller. Free variables are not ' ++ 'resolved\n' ++ 'in the nearest enclosing namespace, but in the global ' ++ 'namespace. [1]\n' ++ 'The "exec()" and "eval()" functions have optional arguments ' ++ 'to\n' ++ 'override the global and local namespace. If only one ' ++ 'namespace is\n' ++ 'specified, it is used for both.\n' ++ '\n' ++ '\n' ++ 'Exceptions\n' ++ '==========\n' ++ '\n' ++ 'Exceptions are a means of breaking out of the normal flow of ' ++ 'control\n' ++ 'of a code block in order to handle errors or other ' ++ 'exceptional\n' ++ 'conditions. An exception is *raised* at the point where the ' ++ 'error is\n' ++ 'detected; it may be *handled* by the surrounding code block ' ++ 'or by any\n' ++ 'code block that directly or indirectly invoked the code block ' ++ 'where\n' ++ 'the error occurred.\n' ++ '\n' ++ 'The Python interpreter raises an exception when it detects a ' ++ 'run-time\n' ++ 'error (such as division by zero). A Python program can also\n' ++ 'explicitly raise an exception with the "raise" statement. ' ++ 'Exception\n' ++ 'handlers are specified with the "try" ... "except" ' ++ 'statement. The\n' ++ '"finally" clause of such a statement can be used to specify ' ++ 'cleanup\n' ++ 'code which does not handle the exception, but is executed ' ++ 'whether an\n' ++ 'exception occurred or not in the preceding code.\n' ++ '\n' ++ 'Python uses the "termination" model of error handling: an ' ++ 'exception\n' ++ 'handler can find out what happened and continue execution at ' ++ 'an outer\n' ++ 'level, but it cannot repair the cause of the error and retry ' ++ 'the\n' ++ 'failing operation (except by re-entering the offending piece ' ++ 'of code\n' ++ 'from the top).\n' ++ '\n' ++ 'When an exception is not handled at all, the interpreter ' ++ 'terminates\n' ++ 'execution of the program, or returns to its interactive main ' ++ 'loop. In\n' ++ 'either case, it prints a stack backtrace, except when the ' ++ 'exception is\n' ++ '"SystemExit".\n' ++ '\n' ++ 'Exceptions are identified by class instances. The "except" ' ++ 'clause is\n' ++ 'selected depending on the class of the instance: it must ' ++ 'reference the\n' ++ 'class of the instance or a base class thereof. The instance ' ++ 'can be\n' ++ 'received by the handler and can carry additional information ' ++ 'about the\n' ++ 'exceptional condition.\n' ++ '\n' ++ 'Note: Exception messages are not part of the Python API. ' ++ 'Their\n' ++ ' contents may change from one version of Python to the next ' ++ 'without\n' ++ ' warning and should not be relied on by code which will run ' ++ 'under\n' ++ ' multiple versions of the interpreter.\n' ++ '\n' ++ 'See also the description of the "try" statement in section ' ++ '*The try\n' ++ 'statement* and "raise" statement in section *The raise ' ++ 'statement*.\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] This limitation occurs because the code that is executed ' ++ 'by\n' ++ ' these operations is not available at the time the module ' ++ 'is\n' ++ ' compiled.\n', ++ 'exprlists': '\n' ++ 'Expression lists\n' ++ '****************\n' ++ '\n' ++ ' expression_list ::= expression ( "," expression )* [","]\n' ++ '\n' ++ 'An expression list containing at least one comma yields a ' ++ 'tuple. The\n' ++ 'length of the tuple is the number of expressions in the ' ++ 'list. The\n' ++ 'expressions are evaluated from left to right.\n' ++ '\n' ++ 'The trailing comma is required only to create a single tuple ' ++ '(a.k.a. a\n' ++ '*singleton*); it is optional in all other cases. A single ' ++ 'expression\n' ++ "without a trailing comma doesn't create a tuple, but rather " ++ 'yields the\n' ++ 'value of that expression. (To create an empty tuple, use an ' ++ 'empty pair\n' ++ 'of parentheses: "()".)\n', ++ 'floating': '\n' ++ 'Floating point literals\n' ++ '***********************\n' ++ '\n' ++ 'Floating point literals are described by the following ' ++ 'lexical\n' ++ 'definitions:\n' ++ '\n' ++ ' floatnumber ::= pointfloat | exponentfloat\n' ++ ' pointfloat ::= [intpart] fraction | intpart "."\n' ++ ' exponentfloat ::= (intpart | pointfloat) exponent\n' ++ ' intpart ::= digit+\n' ++ ' fraction ::= "." digit+\n' ++ ' exponent ::= ("e" | "E") ["+" | "-"] digit+\n' ++ '\n' ++ 'Note that the integer and exponent parts are always ' ++ 'interpreted using\n' ++ 'radix 10. For example, "077e010" is legal, and denotes the ' ++ 'same number\n' ++ 'as "77e10". The allowed range of floating point literals is\n' ++ 'implementation-dependent. Some examples of floating point ' ++ 'literals:\n' ++ '\n' ++ ' 3.14 10. .001 1e100 3.14e-10 0e0\n' ++ '\n' ++ 'Note that numeric literals do not include a sign; a phrase ' ++ 'like "-1"\n' ++ 'is actually an expression composed of the unary operator "-" ' ++ 'and the\n' ++ 'literal "1".\n', ++ 'for': '\n' ++ 'The "for" statement\n' ++ '*******************\n' ++ '\n' ++ 'The "for" statement is used to iterate over the elements of a ' ++ 'sequence\n' ++ '(such as a string, tuple or list) or other iterable object:\n' ++ '\n' ++ ' for_stmt ::= "for" target_list "in" expression_list ":" suite\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'The expression list is evaluated once; it should yield an iterable\n' ++ 'object. An iterator is created for the result of the\n' ++ '"expression_list". The suite is then executed once for each item\n' ++ 'provided by the iterator, in the order returned by the iterator. ' ++ 'Each\n' ++ 'item in turn is assigned to the target list using the standard ' ++ 'rules\n' ++ 'for assignments (see *Assignment statements*), and then the suite ' ++ 'is\n' ++ 'executed. When the items are exhausted (which is immediately when ' ++ 'the\n' ++ 'sequence is empty or an iterator raises a "StopIteration" ' ++ 'exception),\n' ++ 'the suite in the "else" clause, if present, is executed, and the ' ++ 'loop\n' ++ 'terminates.\n' ++ '\n' ++ 'A "break" statement executed in the first suite terminates the ' ++ 'loop\n' ++ 'without executing the "else" clause\'s suite. A "continue" ' ++ 'statement\n' ++ 'executed in the first suite skips the rest of the suite and ' ++ 'continues\n' ++ 'with the next item, or with the "else" clause if there is no next\n' ++ 'item.\n' ++ '\n' ++ 'The for-loop makes assignments to the variables(s) in the target ' ++ 'list.\n' ++ 'This overwrites all previous assignments to those variables ' ++ 'including\n' ++ 'those made in the suite of the for-loop:\n' ++ '\n' ++ ' for i in range(10):\n' ++ ' print(i)\n' ++ ' i = 5 # this will not affect the for-loop\n' ++ ' # because i will be overwritten with the ' ++ 'next\n' ++ ' # index in the range\n' ++ '\n' ++ 'Names in the target list are not deleted when the loop is ' ++ 'finished,\n' ++ 'but if the sequence is empty, they will not have been assigned to ' ++ 'at\n' ++ 'all by the loop. Hint: the built-in function "range()" returns an\n' ++ "iterator of integers suitable to emulate the effect of Pascal's " ++ '"for i\n' ++ ':= a to b do"; e.g., "list(range(3))" returns the list "[0, 1, ' ++ '2]".\n' ++ '\n' ++ 'Note: There is a subtlety when the sequence is being modified by ' ++ 'the\n' ++ ' loop (this can only occur for mutable sequences, i.e. lists). ' ++ 'An\n' ++ ' internal counter is used to keep track of which item is used ' ++ 'next,\n' ++ ' and this is incremented on each iteration. When this counter ' ++ 'has\n' ++ ' reached the length of the sequence the loop terminates. This ' ++ 'means\n' ++ ' that if the suite deletes the current (or a previous) item from ' ++ 'the\n' ++ ' sequence, the next item will be skipped (since it gets the index ' ++ 'of\n' ++ ' the current item which has already been treated). Likewise, if ' ++ 'the\n' ++ ' suite inserts an item in the sequence before the current item, ' ++ 'the\n' ++ ' current item will be treated again the next time through the ' ++ 'loop.\n' ++ ' This can lead to nasty bugs that can be avoided by making a\n' ++ ' temporary copy using a slice of the whole sequence, e.g.,\n' ++ '\n' ++ ' for x in a[:]:\n' ++ ' if x < 0: a.remove(x)\n', ++ 'formatstrings': '\n' ++ 'Format String Syntax\n' ++ '********************\n' ++ '\n' ++ 'The "str.format()" method and the "Formatter" class share ' ++ 'the same\n' ++ 'syntax for format strings (although in the case of ' ++ '"Formatter",\n' ++ 'subclasses can define their own format string syntax).\n' ++ '\n' ++ 'Format strings contain "replacement fields" surrounded by ' ++ 'curly braces\n' ++ '"{}". Anything that is not contained in braces is ' ++ 'considered literal\n' ++ 'text, which is copied unchanged to the output. If you ' ++ 'need to include\n' ++ 'a brace character in the literal text, it can be escaped ' ++ 'by doubling:\n' ++ '"{{" and "}}".\n' ++ '\n' ++ 'The grammar for a replacement field is as follows:\n' ++ '\n' ++ ' replacement_field ::= "{" [field_name] ["!" ' ++ 'conversion] [":" format_spec] "}"\n' ++ ' field_name ::= arg_name ("." attribute_name ' ++ '| "[" element_index "]")*\n' ++ ' arg_name ::= [identifier | integer]\n' ++ ' attribute_name ::= identifier\n' ++ ' element_index ::= integer | index_string\n' ++ ' index_string ::= +\n' ++ ' conversion ::= "r" | "s" | "a"\n' ++ ' format_spec ::= \n' ++ '\n' ++ 'In less formal terms, the replacement field can start ' ++ 'with a\n' ++ '*field_name* that specifies the object whose value is to ' ++ 'be formatted\n' ++ 'and inserted into the output instead of the replacement ' ++ 'field. The\n' ++ '*field_name* is optionally followed by a *conversion* ' ++ 'field, which is\n' ++ 'preceded by an exclamation point "\'!\'", and a ' ++ '*format_spec*, which is\n' ++ 'preceded by a colon "\':\'". These specify a non-default ' ++ 'format for the\n' ++ 'replacement value.\n' ++ '\n' ++ 'See also the *Format Specification Mini-Language* ' ++ 'section.\n' ++ '\n' ++ 'The *field_name* itself begins with an *arg_name* that is ' ++ 'either a\n' ++ "number or a keyword. If it's a number, it refers to a " ++ 'positional\n' ++ "argument, and if it's a keyword, it refers to a named " ++ 'keyword\n' ++ 'argument. If the numerical arg_names in a format string ' ++ 'are 0, 1, 2,\n' ++ '... in sequence, they can all be omitted (not just some) ' ++ 'and the\n' ++ 'numbers 0, 1, 2, ... will be automatically inserted in ' ++ 'that order.\n' ++ 'Because *arg_name* is not quote-delimited, it is not ' ++ 'possible to\n' ++ 'specify arbitrary dictionary keys (e.g., the strings ' ++ '"\'10\'" or\n' ++ '"\':-]\'") within a format string. The *arg_name* can be ' ++ 'followed by any\n' ++ 'number of index or attribute expressions. An expression ' ++ 'of the form\n' ++ '"\'.name\'" selects the named attribute using ' ++ '"getattr()", while an\n' ++ 'expression of the form "\'[index]\'" does an index lookup ' ++ 'using\n' ++ '"__getitem__()".\n' ++ '\n' ++ 'Changed in version 3.1: The positional argument ' ++ 'specifiers can be\n' ++ 'omitted, so "\'{} {}\'" is equivalent to "\'{0} {1}\'".\n' ++ '\n' ++ 'Some simple format string examples:\n' ++ '\n' ++ ' "First, thou shalt count to {0}" # References first ' ++ 'positional argument\n' ++ ' "Bring me a {}" # Implicitly ' ++ 'references the first positional argument\n' ++ ' "From {} to {}" # Same as "From {0} ' ++ 'to {1}"\n' ++ ' "My quest is {name}" # References keyword ' ++ "argument 'name'\n" ++ ' "Weight in tons {0.weight}" # \'weight\' ' ++ 'attribute of first positional arg\n' ++ ' "Units destroyed: {players[0]}" # First element of ' ++ "keyword argument 'players'.\n" ++ '\n' ++ 'The *conversion* field causes a type coercion before ' ++ 'formatting.\n' ++ 'Normally, the job of formatting a value is done by the ' ++ '"__format__()"\n' ++ 'method of the value itself. However, in some cases it is ' ++ 'desirable to\n' ++ 'force a type to be formatted as a string, overriding its ' ++ 'own\n' ++ 'definition of formatting. By converting the value to a ' ++ 'string before\n' ++ 'calling "__format__()", the normal formatting logic is ' ++ 'bypassed.\n' ++ '\n' ++ 'Three conversion flags are currently supported: "\'!s\'" ' ++ 'which calls\n' ++ '"str()" on the value, "\'!r\'" which calls "repr()" and ' ++ '"\'!a\'" which\n' ++ 'calls "ascii()".\n' ++ '\n' ++ 'Some examples:\n' ++ '\n' ++ ' "Harold\'s a clever {0!s}" # Calls str() on the ' ++ 'argument first\n' ++ ' "Bring out the holy {name!r}" # Calls repr() on the ' ++ 'argument first\n' ++ ' "More {!a}" # Calls ascii() on ' ++ 'the argument first\n' ++ '\n' ++ 'The *format_spec* field contains a specification of how ' ++ 'the value\n' ++ 'should be presented, including such details as field ' ++ 'width, alignment,\n' ++ 'padding, decimal precision and so on. Each value type ' ++ 'can define its\n' ++ 'own "formatting mini-language" or interpretation of the ' ++ '*format_spec*.\n' ++ '\n' ++ 'Most built-in types support a common formatting ' ++ 'mini-language, which\n' ++ 'is described in the next section.\n' ++ '\n' ++ 'A *format_spec* field can also include nested replacement ' ++ 'fields\n' ++ 'within it. These nested replacement fields can contain ' ++ 'only a field\n' ++ 'name; conversion flags and format specifications are not ' ++ 'allowed. The\n' ++ 'replacement fields within the format_spec are substituted ' ++ 'before the\n' ++ '*format_spec* string is interpreted. This allows the ' ++ 'formatting of a\n' ++ 'value to be dynamically specified.\n' ++ '\n' ++ 'See the *Format examples* section for some examples.\n' ++ '\n' ++ '\n' ++ 'Format Specification Mini-Language\n' ++ '==================================\n' ++ '\n' ++ '"Format specifications" are used within replacement ' ++ 'fields contained\n' ++ 'within a format string to define how individual values ' ++ 'are presented\n' ++ '(see *Format String Syntax*). They can also be passed ' ++ 'directly to the\n' ++ 'built-in "format()" function. Each formattable type may ' ++ 'define how\n' ++ 'the format specification is to be interpreted.\n' ++ '\n' ++ 'Most built-in types implement the following options for ' ++ 'format\n' ++ 'specifications, although some of the formatting options ' ++ 'are only\n' ++ 'supported by the numeric types.\n' ++ '\n' ++ 'A general convention is that an empty format string ' ++ '("""") produces\n' ++ 'the same result as if you had called "str()" on the ' ++ 'value. A non-empty\n' ++ 'format string typically modifies the result.\n' ++ '\n' ++ 'The general form of a *standard format specifier* is:\n' ++ '\n' ++ ' format_spec ::= ' ++ '[[fill]align][sign][#][0][width][,][.precision][type]\n' ++ ' fill ::= \n' ++ ' align ::= "<" | ">" | "=" | "^"\n' ++ ' sign ::= "+" | "-" | " "\n' ++ ' width ::= integer\n' ++ ' precision ::= integer\n' ++ ' type ::= "b" | "c" | "d" | "e" | "E" | "f" | ' ++ '"F" | "g" | "G" | "n" | "o" | "s" | "x" | "X" | "%"\n' ++ '\n' ++ 'If a valid *align* value is specified, it can be preceded ' ++ 'by a *fill*\n' ++ 'character that can be any character and defaults to a ' ++ 'space if\n' ++ 'omitted. Note that it is not possible to use "{" and "}" ' ++ 'as *fill*\n' ++ 'char while using the "str.format()" method; this ' ++ 'limitation however\n' ++ 'doesn\'t affect the "format()" function.\n' ++ '\n' ++ 'The meaning of the various alignment options is as ' ++ 'follows:\n' ++ '\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | Option | ' ++ 'Meaning ' ++ '|\n' ++ ' ' ++ '+===========+============================================================+\n' ++ ' | "\'<\'" | Forces the field to be left-aligned ' ++ 'within the available |\n' ++ ' | | space (this is the default for most ' ++ 'objects). |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'>\'" | Forces the field to be right-aligned ' ++ 'within the available |\n' ++ ' | | space (this is the default for ' ++ 'numbers). |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'=\'" | Forces the padding to be placed after ' ++ 'the sign (if any) |\n' ++ ' | | but before the digits. This is used for ' ++ 'printing fields |\n' ++ " | | in the form '+000000120'. This alignment " ++ 'option is only |\n' ++ ' | | valid for numeric ' ++ 'types. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'^\'" | Forces the field to be centered within ' ++ 'the available |\n' ++ ' | | ' ++ 'space. ' ++ '|\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ '\n' ++ 'Note that unless a minimum field width is defined, the ' ++ 'field width\n' ++ 'will always be the same size as the data to fill it, so ' ++ 'that the\n' ++ 'alignment option has no meaning in this case.\n' ++ '\n' ++ 'The *sign* option is only valid for number types, and can ' ++ 'be one of\n' ++ 'the following:\n' ++ '\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | Option | ' ++ 'Meaning ' ++ '|\n' ++ ' ' ++ '+===========+============================================================+\n' ++ ' | "\'+\'" | indicates that a sign should be used ' ++ 'for both positive as |\n' ++ ' | | well as negative ' ++ 'numbers. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'-\'" | indicates that a sign should be used ' ++ 'only for negative |\n' ++ ' | | numbers (this is the default ' ++ 'behavior). |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | space | indicates that a leading space should be ' ++ 'used on positive |\n' ++ ' | | numbers, and a minus sign on negative ' ++ 'numbers. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ '\n' ++ 'The "\'#\'" option causes the "alternate form" to be used ' ++ 'for the\n' ++ 'conversion. The alternate form is defined differently ' ++ 'for different\n' ++ 'types. This option is only valid for integer, float, ' ++ 'complex and\n' ++ 'Decimal types. For integers, when binary, octal, or ' ++ 'hexadecimal output\n' ++ 'is used, this option adds the prefix respective "\'0b\'", ' ++ '"\'0o\'", or\n' ++ '"\'0x\'" to the output value. For floats, complex and ' ++ 'Decimal the\n' ++ 'alternate form causes the result of the conversion to ' ++ 'always contain a\n' ++ 'decimal-point character, even if no digits follow it. ' ++ 'Normally, a\n' ++ 'decimal-point character appears in the result of these ' ++ 'conversions\n' ++ 'only if a digit follows it. In addition, for "\'g\'" and ' ++ '"\'G\'"\n' ++ 'conversions, trailing zeros are not removed from the ' ++ 'result.\n' ++ '\n' ++ 'The "\',\'" option signals the use of a comma for a ' ++ 'thousands separator.\n' ++ 'For a locale aware separator, use the "\'n\'" integer ' ++ 'presentation type\n' ++ 'instead.\n' ++ '\n' ++ 'Changed in version 3.1: Added the "\',\'" option (see ' ++ 'also **PEP 378**).\n' ++ '\n' ++ '*width* is a decimal integer defining the minimum field ' ++ 'width. If not\n' ++ 'specified, then the field width will be determined by the ' ++ 'content.\n' ++ '\n' ++ 'Preceding the *width* field by a zero ("\'0\'") character ' ++ 'enables sign-\n' ++ 'aware zero-padding for numeric types. This is equivalent ' ++ 'to a *fill*\n' ++ 'character of "\'0\'" with an *alignment* type of ' ++ '"\'=\'".\n' ++ '\n' ++ 'The *precision* is a decimal number indicating how many ' ++ 'digits should\n' ++ 'be displayed after the decimal point for a floating point ' ++ 'value\n' ++ 'formatted with "\'f\'" and "\'F\'", or before and after ' ++ 'the decimal point\n' ++ 'for a floating point value formatted with "\'g\'" or ' ++ '"\'G\'". For non-\n' ++ 'number types the field indicates the maximum field size - ' ++ 'in other\n' ++ 'words, how many characters will be used from the field ' ++ 'content. The\n' ++ '*precision* is not allowed for integer values.\n' ++ '\n' ++ 'Finally, the *type* determines how the data should be ' ++ 'presented.\n' ++ '\n' ++ 'The available string presentation types are:\n' ++ '\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | Type | ' ++ 'Meaning ' ++ '|\n' ++ ' ' ++ '+===========+============================================================+\n' ++ ' | "\'s\'" | String format. This is the default ' ++ 'type for strings and |\n' ++ ' | | may be ' ++ 'omitted. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | None | The same as ' ++ '"\'s\'". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ '\n' ++ 'The available integer presentation types are:\n' ++ '\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | Type | ' ++ 'Meaning ' ++ '|\n' ++ ' ' ++ '+===========+============================================================+\n' ++ ' | "\'b\'" | Binary format. Outputs the number in ' ++ 'base 2. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'c\'" | Character. Converts the integer to the ' ++ 'corresponding |\n' ++ ' | | unicode character before ' ++ 'printing. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'d\'" | Decimal Integer. Outputs the number in ' ++ 'base 10. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'o\'" | Octal format. Outputs the number in ' ++ 'base 8. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'x\'" | Hex format. Outputs the number in base ' ++ '16, using lower- |\n' ++ ' | | case letters for the digits above ' ++ '9. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'X\'" | Hex format. Outputs the number in base ' ++ '16, using upper- |\n' ++ ' | | case letters for the digits above ' ++ '9. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'n\'" | Number. This is the same as "\'d\'", ' ++ 'except that it uses the |\n' ++ ' | | current locale setting to insert the ' ++ 'appropriate number |\n' ++ ' | | separator ' ++ 'characters. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | None | The same as ' ++ '"\'d\'". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ '\n' ++ 'In addition to the above presentation types, integers can ' ++ 'be formatted\n' ++ 'with the floating point presentation types listed below ' ++ '(except "\'n\'"\n' ++ 'and None). When doing so, "float()" is used to convert ' ++ 'the integer to\n' ++ 'a floating point number before formatting.\n' ++ '\n' ++ 'The available presentation types for floating point and ' ++ 'decimal values\n' ++ 'are:\n' ++ '\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | Type | ' ++ 'Meaning ' ++ '|\n' ++ ' ' ++ '+===========+============================================================+\n' ++ ' | "\'e\'" | Exponent notation. Prints the number ' ++ 'in scientific |\n' ++ " | | notation using the letter 'e' to " ++ 'indicate the exponent. |\n' ++ ' | | The default precision is ' ++ '"6". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'E\'" | Exponent notation. Same as "\'e\'" ' ++ 'except it uses an upper |\n' ++ " | | case 'E' as the separator " ++ 'character. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'f\'" | Fixed point. Displays the number as a ' ++ 'fixed-point number. |\n' ++ ' | | The default precision is ' ++ '"6". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'F\'" | Fixed point. Same as "\'f\'", but ' ++ 'converts "nan" to "NAN" |\n' ++ ' | | and "inf" to ' ++ '"INF". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'g\'" | General format. For a given precision ' ++ '"p >= 1", this |\n' ++ ' | | rounds the number to "p" significant ' ++ 'digits and then |\n' ++ ' | | formats the result in either fixed-point ' ++ 'format or in |\n' ++ ' | | scientific notation, depending on its ' ++ 'magnitude. The |\n' ++ ' | | precise rules are as follows: suppose ' ++ 'that the result |\n' ++ ' | | formatted with presentation type "\'e\'" ' ++ 'and precision "p-1" |\n' ++ ' | | would have exponent "exp". Then if "-4 ' ++ '<= exp < p", the |\n' ++ ' | | number is formatted with presentation ' ++ 'type "\'f\'" and |\n' ++ ' | | precision "p-1-exp". Otherwise, the ' ++ 'number is formatted |\n' ++ ' | | with presentation type "\'e\'" and ' ++ 'precision "p-1". In both |\n' ++ ' | | cases insignificant trailing zeros are ' ++ 'removed from the |\n' ++ ' | | significand, and the decimal point is ' ++ 'also removed if |\n' ++ ' | | there are no remaining digits following ' ++ 'it. Positive and |\n' ++ ' | | negative infinity, positive and negative ' ++ 'zero, and nans, |\n' ++ ' | | are formatted as "inf", "-inf", "0", ' ++ '"-0" and "nan" |\n' ++ ' | | respectively, regardless of the ' ++ 'precision. A precision of |\n' ++ ' | | "0" is treated as equivalent to a ' ++ 'precision of "1". The |\n' ++ ' | | default precision is ' ++ '"6". |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'G\'" | General format. Same as "\'g\'" except ' ++ 'switches to "\'E\'" if |\n' ++ ' | | the number gets too large. The ' ++ 'representations of infinity |\n' ++ ' | | and NaN are uppercased, ' ++ 'too. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'n\'" | Number. This is the same as "\'g\'", ' ++ 'except that it uses the |\n' ++ ' | | current locale setting to insert the ' ++ 'appropriate number |\n' ++ ' | | separator ' ++ 'characters. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | "\'%\'" | Percentage. Multiplies the number by ' ++ '100 and displays in |\n' ++ ' | | fixed ("\'f\'") format, followed by a ' ++ 'percent sign. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ ' | None | Similar to "\'g\'", except with at least ' ++ 'one digit past the |\n' ++ ' | | decimal point and a default precision of ' ++ '12. This is |\n' ++ ' | | intended to match "str()", except you ' ++ 'can add the other |\n' ++ ' | | format ' ++ 'modifiers. |\n' ++ ' ' ++ '+-----------+------------------------------------------------------------+\n' ++ '\n' ++ '\n' ++ 'Format examples\n' ++ '===============\n' ++ '\n' ++ 'This section contains examples of the new format syntax ' ++ 'and comparison\n' ++ 'with the old "%"-formatting.\n' ++ '\n' ++ 'In most of the cases the syntax is similar to the old ' ++ '"%"-formatting,\n' ++ 'with the addition of the "{}" and with ":" used instead ' ++ 'of "%". For\n' ++ 'example, "\'%03.2f\'" can be translated to ' ++ '"\'{:03.2f}\'".\n' ++ '\n' ++ 'The new format syntax also supports new and different ' ++ 'options, shown\n' ++ 'in the follow examples.\n' ++ '\n' ++ 'Accessing arguments by position:\n' ++ '\n' ++ " >>> '{0}, {1}, {2}'.format('a', 'b', 'c')\n" ++ " 'a, b, c'\n" ++ " >>> '{}, {}, {}'.format('a', 'b', 'c') # 3.1+ only\n" ++ " 'a, b, c'\n" ++ " >>> '{2}, {1}, {0}'.format('a', 'b', 'c')\n" ++ " 'c, b, a'\n" ++ " >>> '{2}, {1}, {0}'.format(*'abc') # unpacking " ++ 'argument sequence\n' ++ " 'c, b, a'\n" ++ " >>> '{0}{1}{0}'.format('abra', 'cad') # arguments' " ++ 'indices can be repeated\n' ++ " 'abracadabra'\n" ++ '\n' ++ 'Accessing arguments by name:\n' ++ '\n' ++ " >>> 'Coordinates: {latitude}, " ++ "{longitude}'.format(latitude='37.24N', " ++ "longitude='-115.81W')\n" ++ " 'Coordinates: 37.24N, -115.81W'\n" ++ " >>> coord = {'latitude': '37.24N', 'longitude': " ++ "'-115.81W'}\n" ++ " >>> 'Coordinates: {latitude}, " ++ "{longitude}'.format(**coord)\n" ++ " 'Coordinates: 37.24N, -115.81W'\n" ++ '\n' ++ "Accessing arguments' attributes:\n" ++ '\n' ++ ' >>> c = 3-5j\n' ++ " >>> ('The complex number {0} is formed from the real " ++ "part {0.real} '\n" ++ " ... 'and the imaginary part {0.imag}.').format(c)\n" ++ " 'The complex number (3-5j) is formed from the real " ++ "part 3.0 and the imaginary part -5.0.'\n" ++ ' >>> class Point:\n' ++ ' ... def __init__(self, x, y):\n' ++ ' ... self.x, self.y = x, y\n' ++ ' ... def __str__(self):\n' ++ " ... return 'Point({self.x}, " ++ "{self.y})'.format(self=self)\n" ++ ' ...\n' ++ ' >>> str(Point(4, 2))\n' ++ " 'Point(4, 2)'\n" ++ '\n' ++ "Accessing arguments' items:\n" ++ '\n' ++ ' >>> coord = (3, 5)\n' ++ " >>> 'X: {0[0]}; Y: {0[1]}'.format(coord)\n" ++ " 'X: 3; Y: 5'\n" ++ '\n' ++ 'Replacing "%s" and "%r":\n' ++ '\n' ++ ' >>> "repr() shows quotes: {!r}; str() doesn\'t: ' ++ '{!s}".format(\'test1\', \'test2\')\n' ++ ' "repr() shows quotes: \'test1\'; str() doesn\'t: ' ++ 'test2"\n' ++ '\n' ++ 'Aligning the text and specifying a width:\n' ++ '\n' ++ " >>> '{:<30}'.format('left aligned')\n" ++ " 'left aligned '\n" ++ " >>> '{:>30}'.format('right aligned')\n" ++ " ' right aligned'\n" ++ " >>> '{:^30}'.format('centered')\n" ++ " ' centered '\n" ++ " >>> '{:*^30}'.format('centered') # use '*' as a fill " ++ 'char\n' ++ " '***********centered***********'\n" ++ '\n' ++ 'Replacing "%+f", "%-f", and "% f" and specifying a sign:\n' ++ '\n' ++ " >>> '{:+f}; {:+f}'.format(3.14, -3.14) # show it " ++ 'always\n' ++ " '+3.140000; -3.140000'\n" ++ " >>> '{: f}; {: f}'.format(3.14, -3.14) # show a space " ++ 'for positive numbers\n' ++ " ' 3.140000; -3.140000'\n" ++ " >>> '{:-f}; {:-f}'.format(3.14, -3.14) # show only " ++ "the minus -- same as '{:f}; {:f}'\n" ++ " '3.140000; -3.140000'\n" ++ '\n' ++ 'Replacing "%x" and "%o" and converting the value to ' ++ 'different bases:\n' ++ '\n' ++ ' >>> # format also supports binary numbers\n' ++ ' >>> "int: {0:d}; hex: {0:x}; oct: {0:o}; bin: ' ++ '{0:b}".format(42)\n' ++ " 'int: 42; hex: 2a; oct: 52; bin: 101010'\n" ++ ' >>> # with 0x, 0o, or 0b as prefix:\n' ++ ' >>> "int: {0:d}; hex: {0:#x}; oct: {0:#o}; bin: ' ++ '{0:#b}".format(42)\n' ++ " 'int: 42; hex: 0x2a; oct: 0o52; bin: 0b101010'\n" ++ '\n' ++ 'Using the comma as a thousands separator:\n' ++ '\n' ++ " >>> '{:,}'.format(1234567890)\n" ++ " '1,234,567,890'\n" ++ '\n' ++ 'Expressing a percentage:\n' ++ '\n' ++ ' >>> points = 19\n' ++ ' >>> total = 22\n' ++ " >>> 'Correct answers: {:.2%}'.format(points/total)\n" ++ " 'Correct answers: 86.36%'\n" ++ '\n' ++ 'Using type-specific formatting:\n' ++ '\n' ++ ' >>> import datetime\n' ++ ' >>> d = datetime.datetime(2010, 7, 4, 12, 15, 58)\n' ++ " >>> '{:%Y-%m-%d %H:%M:%S}'.format(d)\n" ++ " '2010-07-04 12:15:58'\n" ++ '\n' ++ 'Nesting arguments and more complex examples:\n' ++ '\n' ++ " >>> for align, text in zip('<^>', ['left', 'center', " ++ "'right']):\n" ++ " ... '{0:{fill}{align}16}'.format(text, fill=align, " ++ 'align=align)\n' ++ ' ...\n' ++ " 'left<<<<<<<<<<<<'\n" ++ " '^^^^^center^^^^^'\n" ++ " '>>>>>>>>>>>right'\n" ++ ' >>>\n' ++ ' >>> octets = [192, 168, 0, 1]\n' ++ " >>> '{:02X}{:02X}{:02X}{:02X}'.format(*octets)\n" ++ " 'C0A80001'\n" ++ ' >>> int(_, 16)\n' ++ ' 3232235521\n' ++ ' >>>\n' ++ ' >>> width = 5\n' ++ ' >>> for num in range(5,12): #doctest: ' ++ '+NORMALIZE_WHITESPACE\n' ++ " ... for base in 'dXob':\n" ++ " ... print('{0:{width}{base}}'.format(num, " ++ "base=base, width=width), end=' ')\n" ++ ' ... print()\n' ++ ' ...\n' ++ ' 5 5 5 101\n' ++ ' 6 6 6 110\n' ++ ' 7 7 7 111\n' ++ ' 8 8 10 1000\n' ++ ' 9 9 11 1001\n' ++ ' 10 A 12 1010\n' ++ ' 11 B 13 1011\n', ++ 'function': '\n' ++ 'Function definitions\n' ++ '********************\n' ++ '\n' ++ 'A function definition defines a user-defined function object ' ++ '(see\n' ++ 'section *The standard type hierarchy*):\n' ++ '\n' ++ ' funcdef ::= [decorators] "def" funcname "(" ' ++ '[parameter_list] ")" ["->" expression] ":" suite\n' ++ ' decorators ::= decorator+\n' ++ ' decorator ::= "@" dotted_name ["(" [parameter_list ' ++ '[","]] ")"] NEWLINE\n' ++ ' dotted_name ::= identifier ("." identifier)*\n' ++ ' parameter_list ::= (defparameter ",")*\n' ++ ' | "*" [parameter] ("," defparameter)* ' ++ '["," "**" parameter]\n' ++ ' | "**" parameter\n' ++ ' | defparameter [","] )\n' ++ ' parameter ::= identifier [":" expression]\n' ++ ' defparameter ::= parameter ["=" expression]\n' ++ ' funcname ::= identifier\n' ++ '\n' ++ 'A function definition is an executable statement. Its ' ++ 'execution binds\n' ++ 'the function name in the current local namespace to a function ' ++ 'object\n' ++ '(a wrapper around the executable code for the function). ' ++ 'This\n' ++ 'function object contains a reference to the current global ' ++ 'namespace\n' ++ 'as the global namespace to be used when the function is ' ++ 'called.\n' ++ '\n' ++ 'The function definition does not execute the function body; ' ++ 'this gets\n' ++ 'executed only when the function is called. [3]\n' ++ '\n' ++ 'A function definition may be wrapped by one or more ' ++ '*decorator*\n' ++ 'expressions. Decorator expressions are evaluated when the ' ++ 'function is\n' ++ 'defined, in the scope that contains the function definition. ' ++ 'The\n' ++ 'result must be a callable, which is invoked with the function ' ++ 'object\n' ++ 'as the only argument. The returned value is bound to the ' ++ 'function name\n' ++ 'instead of the function object. Multiple decorators are ' ++ 'applied in\n' ++ 'nested fashion. For example, the following code\n' ++ '\n' ++ ' @f1(arg)\n' ++ ' @f2\n' ++ ' def func(): pass\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' def func(): pass\n' ++ ' func = f1(arg)(f2(func))\n' ++ '\n' ++ 'When one or more *parameters* have the form *parameter* "="\n' ++ '*expression*, the function is said to have "default parameter ' ++ 'values."\n' ++ 'For a parameter with a default value, the corresponding ' ++ '*argument* may\n' ++ "be omitted from a call, in which case the parameter's default " ++ 'value is\n' ++ 'substituted. If a parameter has a default value, all ' ++ 'following\n' ++ 'parameters up until the ""*"" must also have a default value ' ++ '--- this\n' ++ 'is a syntactic restriction that is not expressed by the ' ++ 'grammar.\n' ++ '\n' ++ '**Default parameter values are evaluated from left to right ' ++ 'when the\n' ++ 'function definition is executed.** This means that the ' ++ 'expression is\n' ++ 'evaluated once, when the function is defined, and that the ' ++ 'same "pre-\n' ++ 'computed" value is used for each call. This is especially ' ++ 'important\n' ++ 'to understand when a default parameter is a mutable object, ' ++ 'such as a\n' ++ 'list or a dictionary: if the function modifies the object ' ++ '(e.g. by\n' ++ 'appending an item to a list), the default value is in effect ' ++ 'modified.\n' ++ 'This is generally not what was intended. A way around this is ' ++ 'to use\n' ++ '"None" as the default, and explicitly test for it in the body ' ++ 'of the\n' ++ 'function, e.g.:\n' ++ '\n' ++ ' def whats_on_the_telly(penguin=None):\n' ++ ' if penguin is None:\n' ++ ' penguin = []\n' ++ ' penguin.append("property of the zoo")\n' ++ ' return penguin\n' ++ '\n' ++ 'Function call semantics are described in more detail in ' ++ 'section\n' ++ '*Calls*. A function call always assigns values to all ' ++ 'parameters\n' ++ 'mentioned in the parameter list, either from position ' ++ 'arguments, from\n' ++ 'keyword arguments, or from default values. If the form\n' ++ '""*identifier"" is present, it is initialized to a tuple ' ++ 'receiving any\n' ++ 'excess positional parameters, defaulting to the empty tuple. ' ++ 'If the\n' ++ 'form ""**identifier"" is present, it is initialized to a new\n' ++ 'dictionary receiving any excess keyword arguments, defaulting ' ++ 'to a new\n' ++ 'empty dictionary. Parameters after ""*"" or ""*identifier"" ' ++ 'are\n' ++ 'keyword-only parameters and may only be passed used keyword ' ++ 'arguments.\n' ++ '\n' ++ 'Parameters may have annotations of the form "": expression"" ' ++ 'following\n' ++ 'the parameter name. Any parameter may have an annotation even ' ++ 'those\n' ++ 'of the form "*identifier" or "**identifier". Functions may ' ++ 'have\n' ++ '"return" annotation of the form ""-> expression"" after the ' ++ 'parameter\n' ++ 'list. These annotations can be any valid Python expression ' ++ 'and are\n' ++ 'evaluated when the function definition is executed. ' ++ 'Annotations may\n' ++ 'be evaluated in a different order than they appear in the ' ++ 'source code.\n' ++ 'The presence of annotations does not change the semantics of ' ++ 'a\n' ++ 'function. The annotation values are available as values of a\n' ++ "dictionary keyed by the parameters' names in the " ++ '"__annotations__"\n' ++ 'attribute of the function object.\n' ++ '\n' ++ 'It is also possible to create anonymous functions (functions ' ++ 'not bound\n' ++ 'to a name), for immediate use in expressions. This uses ' ++ 'lambda\n' ++ 'expressions, described in section *Lambdas*. Note that the ' ++ 'lambda\n' ++ 'expression is merely a shorthand for a simplified function ' ++ 'definition;\n' ++ 'a function defined in a ""def"" statement can be passed around ' ++ 'or\n' ++ 'assigned to another name just like a function defined by a ' ++ 'lambda\n' ++ 'expression. The ""def"" form is actually more powerful since ' ++ 'it\n' ++ 'allows the execution of multiple statements and annotations.\n' ++ '\n' ++ "**Programmer's note:** Functions are first-class objects. A " ++ '""def""\n' ++ 'statement executed inside a function definition defines a ' ++ 'local\n' ++ 'function that can be returned or passed around. Free ' ++ 'variables used\n' ++ 'in the nested function can access the local variables of the ' ++ 'function\n' ++ 'containing the def. See section *Naming and binding* for ' ++ 'details.\n' ++ '\n' ++ 'See also: **PEP 3107** - Function Annotations\n' ++ '\n' ++ ' The original specification for function annotations.\n', ++ 'global': '\n' ++ 'The "global" statement\n' ++ '**********************\n' ++ '\n' ++ ' global_stmt ::= "global" identifier ("," identifier)*\n' ++ '\n' ++ 'The "global" statement is a declaration which holds for the ' ++ 'entire\n' ++ 'current code block. It means that the listed identifiers are to ' ++ 'be\n' ++ 'interpreted as globals. It would be impossible to assign to a ' ++ 'global\n' ++ 'variable without "global", although free variables may refer to\n' ++ 'globals without being declared global.\n' ++ '\n' ++ 'Names listed in a "global" statement must not be used in the ' ++ 'same code\n' ++ 'block textually preceding that "global" statement.\n' ++ '\n' ++ 'Names listed in a "global" statement must not be defined as ' ++ 'formal\n' ++ 'parameters or in a "for" loop control target, "class" ' ++ 'definition,\n' ++ 'function definition, or "import" statement.\n' ++ '\n' ++ '**CPython implementation detail:** The current implementation ' ++ 'does not\n' ++ 'enforce the two restrictions, but programs should not abuse ' ++ 'this\n' ++ 'freedom, as future implementations may enforce them or silently ' ++ 'change\n' ++ 'the meaning of the program.\n' ++ '\n' ++ '**Programmer\'s note:** the "global" is a directive to the ' ++ 'parser. It\n' ++ 'applies only to code parsed at the same time as the "global"\n' ++ 'statement. In particular, a "global" statement contained in a ' ++ 'string\n' ++ 'or code object supplied to the built-in "exec()" function does ' ++ 'not\n' ++ 'affect the code block *containing* the function call, and code\n' ++ 'contained in such a string is unaffected by "global" statements ' ++ 'in the\n' ++ 'code containing the function call. The same applies to the ' ++ '"eval()"\n' ++ 'and "compile()" functions.\n', ++ 'id-classes': '\n' ++ 'Reserved classes of identifiers\n' ++ '*******************************\n' ++ '\n' ++ 'Certain classes of identifiers (besides keywords) have ' ++ 'special\n' ++ 'meanings. These classes are identified by the patterns of ' ++ 'leading and\n' ++ 'trailing underscore characters:\n' ++ '\n' ++ '"_*"\n' ++ ' Not imported by "from module import *". The special ' ++ 'identifier "_"\n' ++ ' is used in the interactive interpreter to store the ' ++ 'result of the\n' ++ ' last evaluation; it is stored in the "builtins" module. ' ++ 'When not\n' ++ ' in interactive mode, "_" has no special meaning and is ' ++ 'not defined.\n' ++ ' See section *The import statement*.\n' ++ '\n' ++ ' Note: The name "_" is often used in conjunction with\n' ++ ' internationalization; refer to the documentation for ' ++ 'the\n' ++ ' "gettext" module for more information on this ' ++ 'convention.\n' ++ '\n' ++ '"__*__"\n' ++ ' System-defined names. These names are defined by the ' ++ 'interpreter\n' ++ ' and its implementation (including the standard library). ' ++ 'Current\n' ++ ' system names are discussed in the *Special method names* ' ++ 'section\n' ++ ' and elsewhere. More will likely be defined in future ' ++ 'versions of\n' ++ ' Python. *Any* use of "__*__" names, in any context, that ' ++ 'does not\n' ++ ' follow explicitly documented use, is subject to breakage ' ++ 'without\n' ++ ' warning.\n' ++ '\n' ++ '"__*"\n' ++ ' Class-private names. Names in this category, when used ' ++ 'within the\n' ++ ' context of a class definition, are re-written to use a ' ++ 'mangled form\n' ++ ' to help avoid name clashes between "private" attributes ' ++ 'of base and\n' ++ ' derived classes. See section *Identifiers (Names)*.\n', ++ 'identifiers': '\n' ++ 'Identifiers and keywords\n' ++ '************************\n' ++ '\n' ++ 'Identifiers (also referred to as *names*) are described by ' ++ 'the\n' ++ 'following lexical definitions.\n' ++ '\n' ++ 'The syntax of identifiers in Python is based on the Unicode ' ++ 'standard\n' ++ 'annex UAX-31, with elaboration and changes as defined ' ++ 'below; see also\n' ++ '**PEP 3131** for further details.\n' ++ '\n' ++ 'Within the ASCII range (U+0001..U+007F), the valid ' ++ 'characters for\n' ++ 'identifiers are the same as in Python 2.x: the uppercase ' ++ 'and lowercase\n' ++ 'letters "A" through "Z", the underscore "_" and, except for ' ++ 'the first\n' ++ 'character, the digits "0" through "9".\n' ++ '\n' ++ 'Python 3.0 introduces additional characters from outside ' ++ 'the ASCII\n' ++ 'range (see **PEP 3131**). For these characters, the ' ++ 'classification\n' ++ 'uses the version of the Unicode Character Database as ' ++ 'included in the\n' ++ '"unicodedata" module.\n' ++ '\n' ++ 'Identifiers are unlimited in length. Case is significant.\n' ++ '\n' ++ ' identifier ::= xid_start xid_continue*\n' ++ ' id_start ::= \n' ++ ' id_continue ::= \n' ++ ' xid_start ::= \n' ++ ' xid_continue ::= \n' ++ '\n' ++ 'The Unicode category codes mentioned above stand for:\n' ++ '\n' ++ '* *Lu* - uppercase letters\n' ++ '\n' ++ '* *Ll* - lowercase letters\n' ++ '\n' ++ '* *Lt* - titlecase letters\n' ++ '\n' ++ '* *Lm* - modifier letters\n' ++ '\n' ++ '* *Lo* - other letters\n' ++ '\n' ++ '* *Nl* - letter numbers\n' ++ '\n' ++ '* *Mn* - nonspacing marks\n' ++ '\n' ++ '* *Mc* - spacing combining marks\n' ++ '\n' ++ '* *Nd* - decimal numbers\n' ++ '\n' ++ '* *Pc* - connector punctuations\n' ++ '\n' ++ '* *Other_ID_Start* - explicit list of characters in ' ++ 'PropList.txt to\n' ++ ' support backwards compatibility\n' ++ '\n' ++ '* *Other_ID_Continue* - likewise\n' ++ '\n' ++ 'All identifiers are converted into the normal form NFKC ' ++ 'while parsing;\n' ++ 'comparison of identifiers is based on NFKC.\n' ++ '\n' ++ 'A non-normative HTML file listing all valid identifier ' ++ 'characters for\n' ++ 'Unicode 4.1 can be found at http://www.dcl.hpi.uni-\n' ++ 'potsdam.de/home/loewis/table-3131.html.\n' ++ '\n' ++ '\n' ++ 'Keywords\n' ++ '========\n' ++ '\n' ++ 'The following identifiers are used as reserved words, or ' ++ '*keywords* of\n' ++ 'the language, and cannot be used as ordinary identifiers. ' ++ 'They must\n' ++ 'be spelled exactly as written here:\n' ++ '\n' ++ ' False class finally is return\n' ++ ' None continue for lambda try\n' ++ ' True def from nonlocal while\n' ++ ' and del global not with\n' ++ ' as elif if or yield\n' ++ ' assert else import pass\n' ++ ' break except in raise\n' ++ '\n' ++ '\n' ++ 'Reserved classes of identifiers\n' ++ '===============================\n' ++ '\n' ++ 'Certain classes of identifiers (besides keywords) have ' ++ 'special\n' ++ 'meanings. These classes are identified by the patterns of ' ++ 'leading and\n' ++ 'trailing underscore characters:\n' ++ '\n' ++ '"_*"\n' ++ ' Not imported by "from module import *". The special ' ++ 'identifier "_"\n' ++ ' is used in the interactive interpreter to store the ' ++ 'result of the\n' ++ ' last evaluation; it is stored in the "builtins" module. ' ++ 'When not\n' ++ ' in interactive mode, "_" has no special meaning and is ' ++ 'not defined.\n' ++ ' See section *The import statement*.\n' ++ '\n' ++ ' Note: The name "_" is often used in conjunction with\n' ++ ' internationalization; refer to the documentation for ' ++ 'the\n' ++ ' "gettext" module for more information on this ' ++ 'convention.\n' ++ '\n' ++ '"__*__"\n' ++ ' System-defined names. These names are defined by the ' ++ 'interpreter\n' ++ ' and its implementation (including the standard ' ++ 'library). Current\n' ++ ' system names are discussed in the *Special method names* ' ++ 'section\n' ++ ' and elsewhere. More will likely be defined in future ' ++ 'versions of\n' ++ ' Python. *Any* use of "__*__" names, in any context, ' ++ 'that does not\n' ++ ' follow explicitly documented use, is subject to breakage ' ++ 'without\n' ++ ' warning.\n' ++ '\n' ++ '"__*"\n' ++ ' Class-private names. Names in this category, when used ' ++ 'within the\n' ++ ' context of a class definition, are re-written to use a ' ++ 'mangled form\n' ++ ' to help avoid name clashes between "private" attributes ' ++ 'of base and\n' ++ ' derived classes. See section *Identifiers (Names)*.\n', ++ 'if': '\n' ++ 'The "if" statement\n' ++ '******************\n' ++ '\n' ++ 'The "if" statement is used for conditional execution:\n' ++ '\n' ++ ' if_stmt ::= "if" expression ":" suite\n' ++ ' ( "elif" expression ":" suite )*\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'It selects exactly one of the suites by evaluating the expressions ' ++ 'one\n' ++ 'by one until one is found to be true (see section *Boolean ' ++ 'operations*\n' ++ 'for the definition of true and false); then that suite is executed\n' ++ '(and no other part of the "if" statement is executed or evaluated).\n' ++ 'If all expressions are false, the suite of the "else" clause, if\n' ++ 'present, is executed.\n', ++ 'imaginary': '\n' ++ 'Imaginary literals\n' ++ '******************\n' ++ '\n' ++ 'Imaginary literals are described by the following lexical ' ++ 'definitions:\n' ++ '\n' ++ ' imagnumber ::= (floatnumber | intpart) ("j" | "J")\n' ++ '\n' ++ 'An imaginary literal yields a complex number with a real part ' ++ 'of 0.0.\n' ++ 'Complex numbers are represented as a pair of floating point ' ++ 'numbers\n' ++ 'and have the same restrictions on their range. To create a ' ++ 'complex\n' ++ 'number with a nonzero real part, add a floating point number ' ++ 'to it,\n' ++ 'e.g., "(3+4j)". Some examples of imaginary literals:\n' ++ '\n' ++ ' 3.14j 10.j 10j .001j 1e100j 3.14e-10j\n', ++ 'import': '\n' ++ 'The "import" statement\n' ++ '**********************\n' ++ '\n' ++ ' import_stmt ::= "import" module ["as" name] ( "," module ' ++ '["as" name] )*\n' ++ ' | "from" relative_module "import" identifier ' ++ '["as" name]\n' ++ ' ( "," identifier ["as" name] )*\n' ++ ' | "from" relative_module "import" "(" ' ++ 'identifier ["as" name]\n' ++ ' ( "," identifier ["as" name] )* [","] ")"\n' ++ ' | "from" module "import" "*"\n' ++ ' module ::= (identifier ".")* identifier\n' ++ ' relative_module ::= "."* module | "."+\n' ++ ' name ::= identifier\n' ++ '\n' ++ 'The basic import statement (no "from" clause) is executed in ' ++ 'two\n' ++ 'steps:\n' ++ '\n' ++ '1. find a module, loading and initializing it if necessary\n' ++ '\n' ++ '2. define a name or names in the local namespace for the scope\n' ++ ' where the "import" statement occurs.\n' ++ '\n' ++ 'When the statement contains multiple clauses (separated by ' ++ 'commas) the\n' ++ 'two steps are carried out separately for each clause, just as ' ++ 'though\n' ++ 'the clauses had been separated out into individiual import ' ++ 'statements.\n' ++ '\n' ++ 'The details of the first step, finding and loading modules are\n' ++ 'described in greater detail in the section on the *import ' ++ 'system*,\n' ++ 'which also describes the various types of packages and modules ' ++ 'that\n' ++ 'can be imported, as well as all the hooks that can be used to\n' ++ 'customize the import system. Note that failures in this step ' ++ 'may\n' ++ 'indicate either that the module could not be located, *or* that ' ++ 'an\n' ++ 'error occurred while initializing the module, which includes ' ++ 'execution\n' ++ "of the module's code.\n" ++ '\n' ++ 'If the requested module is retrieved successfully, it will be ' ++ 'made\n' ++ 'available in the local namespace in one of three ways:\n' ++ '\n' ++ '* If the module name is followed by "as", then the name ' ++ 'following\n' ++ ' "as" is bound directly to the imported module.\n' ++ '\n' ++ '* If no other name is specified, and the module being imported ' ++ 'is a\n' ++ " top level module, the module's name is bound in the local " ++ 'namespace\n' ++ ' as a reference to the imported module\n' ++ '\n' ++ '* If the module being imported is *not* a top level module, then ' ++ 'the\n' ++ ' name of the top level package that contains the module is ' ++ 'bound in\n' ++ ' the local namespace as a reference to the top level package. ' ++ 'The\n' ++ ' imported module must be accessed using its full qualified ' ++ 'name\n' ++ ' rather than directly\n' ++ '\n' ++ 'The "from" form uses a slightly more complex process:\n' ++ '\n' ++ '1. find the module specified in the "from" clause, loading and\n' ++ ' initializing it if necessary;\n' ++ '\n' ++ '2. for each of the identifiers specified in the "import" ' ++ 'clauses:\n' ++ '\n' ++ ' 1. check if the imported module has an attribute by that ' ++ 'name\n' ++ '\n' ++ ' 2. if not, attempt to import a submodule with that name and ' ++ 'then\n' ++ ' check the imported module again for that attribute\n' ++ '\n' ++ ' 3. if the attribute is not found, "ImportError" is raised.\n' ++ '\n' ++ ' 4. otherwise, a reference to that value is stored in the ' ++ 'local\n' ++ ' namespace, using the name in the "as" clause if it is ' ++ 'present,\n' ++ ' otherwise using the attribute name\n' ++ '\n' ++ 'Examples:\n' ++ '\n' ++ ' import foo # foo imported and bound locally\n' ++ ' import foo.bar.baz # foo.bar.baz imported, foo bound ' ++ 'locally\n' ++ ' import foo.bar.baz as fbb # foo.bar.baz imported and bound ' ++ 'as fbb\n' ++ ' from foo.bar import baz # foo.bar.baz imported and bound ' ++ 'as baz\n' ++ ' from foo import attr # foo imported and foo.attr bound ' ++ 'as attr\n' ++ '\n' ++ 'If the list of identifiers is replaced by a star ("\'*\'"), all ' ++ 'public\n' ++ 'names defined in the module are bound in the local namespace for ' ++ 'the\n' ++ 'scope where the "import" statement occurs.\n' ++ '\n' ++ 'The *public names* defined by a module are determined by ' ++ 'checking the\n' ++ 'module\'s namespace for a variable named "__all__"; if defined, ' ++ 'it must\n' ++ 'be a sequence of strings which are names defined or imported by ' ++ 'that\n' ++ 'module. The names given in "__all__" are all considered public ' ++ 'and\n' ++ 'are required to exist. If "__all__" is not defined, the set of ' ++ 'public\n' ++ "names includes all names found in the module's namespace which " ++ 'do not\n' ++ 'begin with an underscore character ("\'_\'"). "__all__" should ' ++ 'contain\n' ++ 'the entire public API. It is intended to avoid accidentally ' ++ 'exporting\n' ++ 'items that are not part of the API (such as library modules ' ++ 'which were\n' ++ 'imported and used within the module).\n' ++ '\n' ++ 'The "from" form with "*" may only occur in a module scope. The ' ++ 'wild\n' ++ 'card form of import --- "from module import *" --- is only ' ++ 'allowed at\n' ++ 'the module level. Attempting to use it in class or function\n' ++ 'definitions will raise a "SyntaxError".\n' ++ '\n' ++ 'When specifying what module to import you do not have to specify ' ++ 'the\n' ++ 'absolute name of the module. When a module or package is ' ++ 'contained\n' ++ 'within another package it is possible to make a relative import ' ++ 'within\n' ++ 'the same top package without having to mention the package name. ' ++ 'By\n' ++ 'using leading dots in the specified module or package after ' ++ '"from" you\n' ++ 'can specify how high to traverse up the current package ' ++ 'hierarchy\n' ++ 'without specifying exact names. One leading dot means the ' ++ 'current\n' ++ 'package where the module making the import exists. Two dots ' ++ 'means up\n' ++ 'one package level. Three dots is up two levels, etc. So if you ' ++ 'execute\n' ++ '"from . import mod" from a module in the "pkg" package then you ' ++ 'will\n' ++ 'end up importing "pkg.mod". If you execute "from ..subpkg2 ' ++ 'import mod"\n' ++ 'from within "pkg.subpkg1" you will import "pkg.subpkg2.mod". ' ++ 'The\n' ++ 'specification for relative imports is contained within **PEP ' ++ '328**.\n' ++ '\n' ++ '"importlib.import_module()" is provided to support applications ' ++ 'that\n' ++ 'determine dynamically the modules to be loaded.\n' ++ '\n' ++ '\n' ++ 'Future statements\n' ++ '=================\n' ++ '\n' ++ 'A *future statement* is a directive to the compiler that a ' ++ 'particular\n' ++ 'module should be compiled using syntax or semantics that will ' ++ 'be\n' ++ 'available in a specified future release of Python where the ' ++ 'feature\n' ++ 'becomes standard.\n' ++ '\n' ++ 'The future statement is intended to ease migration to future ' ++ 'versions\n' ++ 'of Python that introduce incompatible changes to the language. ' ++ 'It\n' ++ 'allows use of the new features on a per-module basis before the\n' ++ 'release in which the feature becomes standard.\n' ++ '\n' ++ ' future_statement ::= "from" "__future__" "import" feature ' ++ '["as" name]\n' ++ ' ("," feature ["as" name])*\n' ++ ' | "from" "__future__" "import" "(" ' ++ 'feature ["as" name]\n' ++ ' ("," feature ["as" name])* [","] ")"\n' ++ ' feature ::= identifier\n' ++ ' name ::= identifier\n' ++ '\n' ++ 'A future statement must appear near the top of the module. The ' ++ 'only\n' ++ 'lines that can appear before a future statement are:\n' ++ '\n' ++ '* the module docstring (if any),\n' ++ '\n' ++ '* comments,\n' ++ '\n' ++ '* blank lines, and\n' ++ '\n' ++ '* other future statements.\n' ++ '\n' ++ 'The features recognized by Python 3.0 are "absolute_import",\n' ++ '"division", "generators", "unicode_literals", "print_function",\n' ++ '"nested_scopes" and "with_statement". They are all redundant ' ++ 'because\n' ++ 'they are always enabled, and only kept for backwards ' ++ 'compatibility.\n' ++ '\n' ++ 'A future statement is recognized and treated specially at ' ++ 'compile\n' ++ 'time: Changes to the semantics of core constructs are often\n' ++ 'implemented by generating different code. It may even be the ' ++ 'case\n' ++ 'that a new feature introduces new incompatible syntax (such as a ' ++ 'new\n' ++ 'reserved word), in which case the compiler may need to parse ' ++ 'the\n' ++ 'module differently. Such decisions cannot be pushed off until\n' ++ 'runtime.\n' ++ '\n' ++ 'For any given release, the compiler knows which feature names ' ++ 'have\n' ++ 'been defined, and raises a compile-time error if a future ' ++ 'statement\n' ++ 'contains a feature not known to it.\n' ++ '\n' ++ 'The direct runtime semantics are the same as for any import ' ++ 'statement:\n' ++ 'there is a standard module "__future__", described later, and it ' ++ 'will\n' ++ 'be imported in the usual way at the time the future statement ' ++ 'is\n' ++ 'executed.\n' ++ '\n' ++ 'The interesting runtime semantics depend on the specific ' ++ 'feature\n' ++ 'enabled by the future statement.\n' ++ '\n' ++ 'Note that there is nothing special about the statement:\n' ++ '\n' ++ ' import __future__ [as name]\n' ++ '\n' ++ "That is not a future statement; it's an ordinary import " ++ 'statement with\n' ++ 'no special semantics or syntax restrictions.\n' ++ '\n' ++ 'Code compiled by calls to the built-in functions "exec()" and\n' ++ '"compile()" that occur in a module "M" containing a future ' ++ 'statement\n' ++ 'will, by default, use the new syntax or semantics associated ' ++ 'with the\n' ++ 'future statement. This can be controlled by optional arguments ' ++ 'to\n' ++ '"compile()" --- see the documentation of that function for ' ++ 'details.\n' ++ '\n' ++ 'A future statement typed at an interactive interpreter prompt ' ++ 'will\n' ++ 'take effect for the rest of the interpreter session. If an\n' ++ 'interpreter is started with the *-i* option, is passed a script ' ++ 'name\n' ++ 'to execute, and the script includes a future statement, it will ' ++ 'be in\n' ++ 'effect in the interactive session started after the script is\n' ++ 'executed.\n' ++ '\n' ++ 'See also: **PEP 236** - Back to the __future__\n' ++ '\n' ++ ' The original proposal for the __future__ mechanism.\n', ++ 'in': '\n' ++ 'Comparisons\n' ++ '***********\n' ++ '\n' ++ 'Unlike C, all comparison operations in Python have the same ' ++ 'priority,\n' ++ 'which is lower than that of any arithmetic, shifting or bitwise\n' ++ 'operation. Also unlike C, expressions like "a < b < c" have the\n' ++ 'interpretation that is conventional in mathematics:\n' ++ '\n' ++ ' comparison ::= or_expr ( comp_operator or_expr )*\n' ++ ' comp_operator ::= "<" | ">" | "==" | ">=" | "<=" | "!="\n' ++ ' | "is" ["not"] | ["not"] "in"\n' ++ '\n' ++ 'Comparisons yield boolean values: "True" or "False".\n' ++ '\n' ++ 'Comparisons can be chained arbitrarily, e.g., "x < y <= z" is\n' ++ 'equivalent to "x < y and y <= z", except that "y" is evaluated only\n' ++ 'once (but in both cases "z" is not evaluated at all when "x < y" is\n' ++ 'found to be false).\n' ++ '\n' ++ 'Formally, if *a*, *b*, *c*, ..., *y*, *z* are expressions and ' ++ '*op1*,\n' ++ '*op2*, ..., *opN* are comparison operators, then "a op1 b op2 c ... ' ++ 'y\n' ++ 'opN z" is equivalent to "a op1 b and b op2 c and ... y opN z", ' ++ 'except\n' ++ 'that each expression is evaluated at most once.\n' ++ '\n' ++ 'Note that "a op1 b op2 c" doesn\'t imply any kind of comparison ' ++ 'between\n' ++ '*a* and *c*, so that, e.g., "x < y > z" is perfectly legal (though\n' ++ 'perhaps not pretty).\n' ++ '\n' ++ 'The operators "<", ">", "==", ">=", "<=", and "!=" compare the ' ++ 'values\n' ++ 'of two objects. The objects need not have the same type. If both ' ++ 'are\n' ++ 'numbers, they are converted to a common type. Otherwise, the "==" ' ++ 'and\n' ++ '"!=" operators *always* consider objects of different types to be\n' ++ 'unequal, while the "<", ">", ">=" and "<=" operators raise a\n' ++ '"TypeError" when comparing objects of different types that do not\n' ++ 'implement these operators for the given pair of types. You can\n' ++ 'control comparison behavior of objects of non-built-in types by\n' ++ 'defining rich comparison methods like "__gt__()", described in ' ++ 'section\n' ++ '*Basic customization*.\n' ++ '\n' ++ 'Comparison of objects of the same type depends on the type:\n' ++ '\n' ++ '* Numbers are compared arithmetically.\n' ++ '\n' ++ '* The values "float(\'NaN\')" and "Decimal(\'NaN\')" are special. ' ++ 'The\n' ++ ' are identical to themselves, "x is x" but are not equal to\n' ++ ' themselves, "x != x". Additionally, comparing any value to a\n' ++ ' not-a-number value will return "False". For example, both "3 <\n' ++ ' float(\'NaN\')" and "float(\'NaN\') < 3" will return "False".\n' ++ '\n' ++ '* Bytes objects are compared lexicographically using the numeric\n' ++ ' values of their elements.\n' ++ '\n' ++ '* Strings are compared lexicographically using the numeric\n' ++ ' equivalents (the result of the built-in function "ord()") of ' ++ 'their\n' ++ " characters. [3] String and bytes object can't be compared!\n" ++ '\n' ++ '* Tuples and lists are compared lexicographically using comparison\n' ++ ' of corresponding elements. This means that to compare equal, ' ++ 'each\n' ++ ' element must compare equal and the two sequences must be of the ' ++ 'same\n' ++ ' type and have the same length.\n' ++ '\n' ++ ' If not equal, the sequences are ordered the same as their first\n' ++ ' differing elements. For example, "[1,2,x] <= [1,2,y]" has the ' ++ 'same\n' ++ ' value as "x <= y". If the corresponding element does not exist, ' ++ 'the\n' ++ ' shorter sequence is ordered first (for example, "[1,2] < ' ++ '[1,2,3]").\n' ++ '\n' ++ '* Mappings (dictionaries) compare equal if and only if they have ' ++ 'the\n' ++ ' same "(key, value)" pairs. Order comparisons "(\'<\', \'<=\', ' ++ "'>=',\n" ++ ' \'>\')" raise "TypeError".\n' ++ '\n' ++ '* Sets and frozensets define comparison operators to mean subset ' ++ 'and\n' ++ ' superset tests. Those relations do not define total orderings ' ++ '(the\n' ++ ' two sets "{1,2}" and {2,3} are not equal, nor subsets of one\n' ++ ' another, nor supersets of one another). Accordingly, sets are ' ++ 'not\n' ++ ' appropriate arguments for functions which depend on total ' ++ 'ordering.\n' ++ ' For example, "min()", "max()", and "sorted()" produce undefined\n' ++ ' results given a list of sets as inputs.\n' ++ '\n' ++ '* Most other objects of built-in types compare unequal unless they\n' ++ ' are the same object; the choice whether one object is considered\n' ++ ' smaller or larger than another one is made arbitrarily but\n' ++ ' consistently within one execution of a program.\n' ++ '\n' ++ 'Comparison of objects of differing types depends on whether either ' ++ 'of\n' ++ 'the types provide explicit support for the comparison. Most ' ++ 'numeric\n' ++ 'types can be compared with one another. When cross-type comparison ' ++ 'is\n' ++ 'not supported, the comparison method returns "NotImplemented".\n' ++ '\n' ++ 'The operators "in" and "not in" test for membership. "x in s"\n' ++ 'evaluates to true if *x* is a member of *s*, and false otherwise. ' ++ '"x\n' ++ 'not in s" returns the negation of "x in s". All built-in sequences\n' ++ 'and set types support this as well as dictionary, for which "in" ' ++ 'tests\n' ++ 'whether the dictionary has a given key. For container types such as\n' ++ 'list, tuple, set, frozenset, dict, or collections.deque, the\n' ++ 'expression "x in y" is equivalent to "any(x is e or x == e for e in\n' ++ 'y)".\n' ++ '\n' ++ 'For the string and bytes types, "x in y" is true if and only if *x* ' ++ 'is\n' ++ 'a substring of *y*. An equivalent test is "y.find(x) != -1". ' ++ 'Empty\n' ++ 'strings are always considered to be a substring of any other ' ++ 'string,\n' ++ 'so """ in "abc"" will return "True".\n' ++ '\n' ++ 'For user-defined classes which define the "__contains__()" method, ' ++ '"x\n' ++ 'in y" is true if and only if "y.__contains__(x)" is true.\n' ++ '\n' ++ 'For user-defined classes which do not define "__contains__()" but ' ++ 'do\n' ++ 'define "__iter__()", "x in y" is true if some value "z" with "x == ' ++ 'z"\n' ++ 'is produced while iterating over "y". If an exception is raised\n' ++ 'during the iteration, it is as if "in" raised that exception.\n' ++ '\n' ++ 'Lastly, the old-style iteration protocol is tried: if a class ' ++ 'defines\n' ++ '"__getitem__()", "x in y" is true if and only if there is a non-\n' ++ 'negative integer index *i* such that "x == y[i]", and all lower\n' ++ 'integer indices do not raise "IndexError" exception. (If any other\n' ++ 'exception is raised, it is as if "in" raised that exception).\n' ++ '\n' ++ 'The operator "not in" is defined to have the inverse true value of\n' ++ '"in".\n' ++ '\n' ++ 'The operators "is" and "is not" test for object identity: "x is y" ' ++ 'is\n' ++ 'true if and only if *x* and *y* are the same object. "x is not y"\n' ++ 'yields the inverse truth value. [4]\n', ++ 'integers': '\n' ++ 'Integer literals\n' ++ '****************\n' ++ '\n' ++ 'Integer literals are described by the following lexical ' ++ 'definitions:\n' ++ '\n' ++ ' integer ::= decimalinteger | octinteger | hexinteger ' ++ '| bininteger\n' ++ ' decimalinteger ::= nonzerodigit digit* | "0"+\n' ++ ' nonzerodigit ::= "1"..."9"\n' ++ ' digit ::= "0"..."9"\n' ++ ' octinteger ::= "0" ("o" | "O") octdigit+\n' ++ ' hexinteger ::= "0" ("x" | "X") hexdigit+\n' ++ ' bininteger ::= "0" ("b" | "B") bindigit+\n' ++ ' octdigit ::= "0"..."7"\n' ++ ' hexdigit ::= digit | "a"..."f" | "A"..."F"\n' ++ ' bindigit ::= "0" | "1"\n' ++ '\n' ++ 'There is no limit for the length of integer literals apart ' ++ 'from what\n' ++ 'can be stored in available memory.\n' ++ '\n' ++ 'Note that leading zeros in a non-zero decimal number are not ' ++ 'allowed.\n' ++ 'This is for disambiguation with C-style octal literals, which ' ++ 'Python\n' ++ 'used before version 3.0.\n' ++ '\n' ++ 'Some examples of integer literals:\n' ++ '\n' ++ ' 7 2147483647 0o177 ' ++ '0b100110111\n' ++ ' 3 79228162514264337593543950336 0o377 ' ++ '0x100000000\n' ++ ' 79228162514264337593543950336 ' ++ '0xdeadbeef\n', ++ 'lambda': '\n' ++ 'Lambdas\n' ++ '*******\n' ++ '\n' ++ ' lambda_expr ::= "lambda" [parameter_list]: expression\n' ++ ' lambda_expr_nocond ::= "lambda" [parameter_list]: ' ++ 'expression_nocond\n' ++ '\n' ++ 'Lambda expressions (sometimes called lambda forms) are used to ' ++ 'create\n' ++ 'anonymous functions. The expression "lambda arguments: ' ++ 'expression"\n' ++ 'yields a function object. The unnamed object behaves like a ' ++ 'function\n' ++ 'object defined with\n' ++ '\n' ++ ' def (arguments):\n' ++ ' return expression\n' ++ '\n' ++ 'See section *Function definitions* for the syntax of parameter ' ++ 'lists.\n' ++ 'Note that functions created with lambda expressions cannot ' ++ 'contain\n' ++ 'statements or annotations.\n', ++ 'lists': '\n' ++ 'List displays\n' ++ '*************\n' ++ '\n' ++ 'A list display is a possibly empty series of expressions enclosed ' ++ 'in\n' ++ 'square brackets:\n' ++ '\n' ++ ' list_display ::= "[" [expression_list | comprehension] "]"\n' ++ '\n' ++ 'A list display yields a new list object, the contents being ' ++ 'specified\n' ++ 'by either a list of expressions or a comprehension. When a ' ++ 'comma-\n' ++ 'separated list of expressions is supplied, its elements are ' ++ 'evaluated\n' ++ 'from left to right and placed into the list object in that ' ++ 'order.\n' ++ 'When a comprehension is supplied, the list is constructed from ' ++ 'the\n' ++ 'elements resulting from the comprehension.\n', ++ 'naming': '\n' ++ 'Naming and binding\n' ++ '******************\n' ++ '\n' ++ '*Names* refer to objects. Names are introduced by name binding\n' ++ 'operations. Each occurrence of a name in the program text refers ' ++ 'to\n' ++ 'the *binding* of that name established in the innermost function ' ++ 'block\n' ++ 'containing the use.\n' ++ '\n' ++ 'A *block* is a piece of Python program text that is executed as ' ++ 'a\n' ++ 'unit. The following are blocks: a module, a function body, and a ' ++ 'class\n' ++ 'definition. Each command typed interactively is a block. A ' ++ 'script\n' ++ 'file (a file given as standard input to the interpreter or ' ++ 'specified\n' ++ 'as a command line argument to the interpreter) is a code block. ' ++ 'A\n' ++ 'script command (a command specified on the interpreter command ' ++ 'line\n' ++ "with the '**-c**' option) is a code block. The string argument " ++ 'passed\n' ++ 'to the built-in functions "eval()" and "exec()" is a code ' ++ 'block.\n' ++ '\n' ++ 'A code block is executed in an *execution frame*. A frame ' ++ 'contains\n' ++ 'some administrative information (used for debugging) and ' ++ 'determines\n' ++ "where and how execution continues after the code block's " ++ 'execution has\n' ++ 'completed.\n' ++ '\n' ++ 'A *scope* defines the visibility of a name within a block. If a ' ++ 'local\n' ++ 'variable is defined in a block, its scope includes that block. ' ++ 'If the\n' ++ 'definition occurs in a function block, the scope extends to any ' ++ 'blocks\n' ++ 'contained within the defining one, unless a contained block ' ++ 'introduces\n' ++ 'a different binding for the name. The scope of names defined in ' ++ 'a\n' ++ 'class block is limited to the class block; it does not extend to ' ++ 'the\n' ++ 'code blocks of methods -- this includes comprehensions and ' ++ 'generator\n' ++ 'expressions since they are implemented using a function scope. ' ++ 'This\n' ++ 'means that the following will fail:\n' ++ '\n' ++ ' class A:\n' ++ ' a = 42\n' ++ ' b = list(a + i for i in range(10))\n' ++ '\n' ++ 'When a name is used in a code block, it is resolved using the ' ++ 'nearest\n' ++ 'enclosing scope. The set of all such scopes visible to a code ' ++ 'block\n' ++ "is called the block's *environment*.\n" ++ '\n' ++ 'If a name is bound in a block, it is a local variable of that ' ++ 'block,\n' ++ 'unless declared as "nonlocal". If a name is bound at the ' ++ 'module\n' ++ 'level, it is a global variable. (The variables of the module ' ++ 'code\n' ++ 'block are local and global.) If a variable is used in a code ' ++ 'block\n' ++ 'but not defined there, it is a *free variable*.\n' ++ '\n' ++ 'When a name is not found at all, a "NameError" exception is ' ++ 'raised.\n' ++ 'If the name refers to a local variable that has not been bound, ' ++ 'an\n' ++ '"UnboundLocalError" exception is raised. "UnboundLocalError" is ' ++ 'a\n' ++ 'subclass of "NameError".\n' ++ '\n' ++ 'The following constructs bind names: formal parameters to ' ++ 'functions,\n' ++ '"import" statements, class and function definitions (these bind ' ++ 'the\n' ++ 'class or function name in the defining block), and targets that ' ++ 'are\n' ++ 'identifiers if occurring in an assignment, "for" loop header, or ' ++ 'after\n' ++ '"as" in a "with" statement or "except" clause. The "import" ' ++ 'statement\n' ++ 'of the form "from ... import *" binds all names defined in the\n' ++ 'imported module, except those beginning with an underscore. ' ++ 'This form\n' ++ 'may only be used at the module level.\n' ++ '\n' ++ 'A target occurring in a "del" statement is also considered bound ' ++ 'for\n' ++ 'this purpose (though the actual semantics are to unbind the ' ++ 'name).\n' ++ '\n' ++ 'Each assignment or import statement occurs within a block ' ++ 'defined by a\n' ++ 'class or function definition or at the module level (the ' ++ 'top-level\n' ++ 'code block).\n' ++ '\n' ++ 'If a name binding operation occurs anywhere within a code block, ' ++ 'all\n' ++ 'uses of the name within the block are treated as references to ' ++ 'the\n' ++ 'current block. This can lead to errors when a name is used ' ++ 'within a\n' ++ 'block before it is bound. This rule is subtle. Python lacks\n' ++ 'declarations and allows name binding operations to occur ' ++ 'anywhere\n' ++ 'within a code block. The local variables of a code block can ' ++ 'be\n' ++ 'determined by scanning the entire text of the block for name ' ++ 'binding\n' ++ 'operations.\n' ++ '\n' ++ 'If the "global" statement occurs within a block, all uses of the ' ++ 'name\n' ++ 'specified in the statement refer to the binding of that name in ' ++ 'the\n' ++ 'top-level namespace. Names are resolved in the top-level ' ++ 'namespace by\n' ++ 'searching the global namespace, i.e. the namespace of the ' ++ 'module\n' ++ 'containing the code block, and the builtins namespace, the ' ++ 'namespace\n' ++ 'of the module "builtins". The global namespace is searched ' ++ 'first. If\n' ++ 'the name is not found there, the builtins namespace is ' ++ 'searched. The\n' ++ 'global statement must precede all uses of the name.\n' ++ '\n' ++ 'The builtins namespace associated with the execution of a code ' ++ 'block\n' ++ 'is actually found by looking up the name "__builtins__" in its ' ++ 'global\n' ++ 'namespace; this should be a dictionary or a module (in the ' ++ 'latter case\n' ++ "the module's dictionary is used). By default, when in the " ++ '"__main__"\n' ++ 'module, "__builtins__" is the built-in module "builtins"; when ' ++ 'in any\n' ++ 'other module, "__builtins__" is an alias for the dictionary of ' ++ 'the\n' ++ '"builtins" module itself. "__builtins__" can be set to a ' ++ 'user-created\n' ++ 'dictionary to create a weak form of restricted execution.\n' ++ '\n' ++ '**CPython implementation detail:** Users should not touch\n' ++ '"__builtins__"; it is strictly an implementation detail. Users\n' ++ 'wanting to override values in the builtins namespace should ' ++ '"import"\n' ++ 'the "builtins" module and modify its attributes appropriately.\n' ++ '\n' ++ 'The namespace for a module is automatically created the first ' ++ 'time a\n' ++ 'module is imported. The main module for a script is always ' ++ 'called\n' ++ '"__main__".\n' ++ '\n' ++ 'The "global" statement has the same scope as a name binding ' ++ 'operation\n' ++ 'in the same block. If the nearest enclosing scope for a free ' ++ 'variable\n' ++ 'contains a global statement, the free variable is treated as a ' ++ 'global.\n' ++ '\n' ++ 'A class definition is an executable statement that may use and ' ++ 'define\n' ++ 'names. These references follow the normal rules for name ' ++ 'resolution.\n' ++ 'The namespace of the class definition becomes the attribute ' ++ 'dictionary\n' ++ 'of the class. Names defined at the class scope are not visible ' ++ 'in\n' ++ 'methods.\n' ++ '\n' ++ '\n' ++ 'Interaction with dynamic features\n' ++ '=================================\n' ++ '\n' ++ 'There are several cases where Python statements are illegal when ' ++ 'used\n' ++ 'in conjunction with nested scopes that contain free variables.\n' ++ '\n' ++ 'If a variable is referenced in an enclosing scope, it is illegal ' ++ 'to\n' ++ 'delete the name. An error will be reported at compile time.\n' ++ '\n' ++ 'If the wild card form of import --- "import *" --- is used in a\n' ++ 'function and the function contains or is a nested block with ' ++ 'free\n' ++ 'variables, the compiler will raise a "SyntaxError".\n' ++ '\n' ++ 'The "eval()" and "exec()" functions do not have access to the ' ++ 'full\n' ++ 'environment for resolving names. Names may be resolved in the ' ++ 'local\n' ++ 'and global namespaces of the caller. Free variables are not ' ++ 'resolved\n' ++ 'in the nearest enclosing namespace, but in the global ' ++ 'namespace. [1]\n' ++ 'The "exec()" and "eval()" functions have optional arguments to\n' ++ 'override the global and local namespace. If only one namespace ' ++ 'is\n' ++ 'specified, it is used for both.\n', ++ 'nonlocal': '\n' ++ 'The "nonlocal" statement\n' ++ '************************\n' ++ '\n' ++ ' nonlocal_stmt ::= "nonlocal" identifier ("," identifier)*\n' ++ '\n' ++ 'The "nonlocal" statement causes the listed identifiers to ' ++ 'refer to\n' ++ 'previously bound variables in the nearest enclosing scope ' ++ 'excluding\n' ++ 'globals. This is important because the default behavior for ' ++ 'binding is\n' ++ 'to search the local namespace first. The statement allows\n' ++ 'encapsulated code to rebind variables outside of the local ' ++ 'scope\n' ++ 'besides the global (module) scope.\n' ++ '\n' ++ 'Names listed in a "nonlocal" statement, unlike those listed in ' ++ 'a\n' ++ '"global" statement, must refer to pre-existing bindings in an\n' ++ 'enclosing scope (the scope in which a new binding should be ' ++ 'created\n' ++ 'cannot be determined unambiguously).\n' ++ '\n' ++ 'Names listed in a "nonlocal" statement must not collide with ' ++ 'pre-\n' ++ 'existing bindings in the local scope.\n' ++ '\n' ++ 'See also: **PEP 3104** - Access to Names in Outer Scopes\n' ++ '\n' ++ ' The specification for the "nonlocal" statement.\n', ++ 'numbers': '\n' ++ 'Numeric literals\n' ++ '****************\n' ++ '\n' ++ 'There are three types of numeric literals: integers, floating ' ++ 'point\n' ++ 'numbers, and imaginary numbers. There are no complex literals\n' ++ '(complex numbers can be formed by adding a real number and an\n' ++ 'imaginary number).\n' ++ '\n' ++ 'Note that numeric literals do not include a sign; a phrase like ' ++ '"-1"\n' ++ 'is actually an expression composed of the unary operator ' ++ '\'"-"\' and the\n' ++ 'literal "1".\n', ++ 'numeric-types': '\n' ++ 'Emulating numeric types\n' ++ '***********************\n' ++ '\n' ++ 'The following methods can be defined to emulate numeric ' ++ 'objects.\n' ++ 'Methods corresponding to operations that are not ' ++ 'supported by the\n' ++ 'particular kind of number implemented (e.g., bitwise ' ++ 'operations for\n' ++ 'non-integral numbers) should be left undefined.\n' ++ '\n' ++ 'object.__add__(self, other)\n' ++ 'object.__sub__(self, other)\n' ++ 'object.__mul__(self, other)\n' ++ 'object.__truediv__(self, other)\n' ++ 'object.__floordiv__(self, other)\n' ++ 'object.__mod__(self, other)\n' ++ 'object.__divmod__(self, other)\n' ++ 'object.__pow__(self, other[, modulo])\n' ++ 'object.__lshift__(self, other)\n' ++ 'object.__rshift__(self, other)\n' ++ 'object.__and__(self, other)\n' ++ 'object.__xor__(self, other)\n' ++ 'object.__or__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the binary ' ++ 'arithmetic\n' ++ ' operations ("+", "-", "*", "/", "//", "%", "divmod()", ' ++ '"pow()",\n' ++ ' "**", "<<", ">>", "&", "^", "|"). For instance, to ' ++ 'evaluate the\n' ++ ' expression "x + y", where *x* is an instance of a ' ++ 'class that has an\n' ++ ' "__add__()" method, "x.__add__(y)" is called. The ' ++ '"__divmod__()"\n' ++ ' method should be the equivalent to using ' ++ '"__floordiv__()" and\n' ++ ' "__mod__()"; it should not be related to ' ++ '"__truediv__()". Note\n' ++ ' that "__pow__()" should be defined to accept an ' ++ 'optional third\n' ++ ' argument if the ternary version of the built-in ' ++ '"pow()" function is\n' ++ ' to be supported.\n' ++ '\n' ++ ' If one of those methods does not support the operation ' ++ 'with the\n' ++ ' supplied arguments, it should return ' ++ '"NotImplemented".\n' ++ '\n' ++ 'object.__radd__(self, other)\n' ++ 'object.__rsub__(self, other)\n' ++ 'object.__rmul__(self, other)\n' ++ 'object.__rtruediv__(self, other)\n' ++ 'object.__rfloordiv__(self, other)\n' ++ 'object.__rmod__(self, other)\n' ++ 'object.__rdivmod__(self, other)\n' ++ 'object.__rpow__(self, other)\n' ++ 'object.__rlshift__(self, other)\n' ++ 'object.__rrshift__(self, other)\n' ++ 'object.__rand__(self, other)\n' ++ 'object.__rxor__(self, other)\n' ++ 'object.__ror__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the binary ' ++ 'arithmetic\n' ++ ' operations ("+", "-", "*", "/", "//", "%", "divmod()", ' ++ '"pow()",\n' ++ ' "**", "<<", ">>", "&", "^", "|") with reflected ' ++ '(swapped) operands.\n' ++ ' These functions are only called if the left operand ' ++ 'does not\n' ++ ' support the corresponding operation and the operands ' ++ 'are of\n' ++ ' different types. [2] For instance, to evaluate the ' ++ 'expression "x -\n' ++ ' y", where *y* is an instance of a class that has an ' ++ '"__rsub__()"\n' ++ ' method, "y.__rsub__(x)" is called if "x.__sub__(y)" ' ++ 'returns\n' ++ ' *NotImplemented*.\n' ++ '\n' ++ ' Note that ternary "pow()" will not try calling ' ++ '"__rpow__()" (the\n' ++ ' coercion rules would become too complicated).\n' ++ '\n' ++ " Note: If the right operand's type is a subclass of the " ++ 'left\n' ++ " operand's type and that subclass provides the " ++ 'reflected method\n' ++ ' for the operation, this method will be called before ' ++ 'the left\n' ++ " operand's non-reflected method. This behavior " ++ 'allows subclasses\n' ++ " to override their ancestors' operations.\n" ++ '\n' ++ 'object.__iadd__(self, other)\n' ++ 'object.__isub__(self, other)\n' ++ 'object.__imul__(self, other)\n' ++ 'object.__itruediv__(self, other)\n' ++ 'object.__ifloordiv__(self, other)\n' ++ 'object.__imod__(self, other)\n' ++ 'object.__ipow__(self, other[, modulo])\n' ++ 'object.__ilshift__(self, other)\n' ++ 'object.__irshift__(self, other)\n' ++ 'object.__iand__(self, other)\n' ++ 'object.__ixor__(self, other)\n' ++ 'object.__ior__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the augmented ' ++ 'arithmetic\n' ++ ' assignments ("+=", "-=", "*=", "/=", "//=", "%=", ' ++ '"**=", "<<=",\n' ++ ' ">>=", "&=", "^=", "|="). These methods should ' ++ 'attempt to do the\n' ++ ' operation in-place (modifying *self*) and return the ' ++ 'result (which\n' ++ ' could be, but does not have to be, *self*). If a ' ++ 'specific method\n' ++ ' is not defined, the augmented assignment falls back to ' ++ 'the normal\n' ++ ' methods. For instance, if *x* is an instance of a ' ++ 'class with an\n' ++ ' "__iadd__()" method, "x += y" is equivalent to "x = ' ++ 'x.__iadd__(y)"\n' ++ ' . Otherwise, "x.__add__(y)" and "y.__radd__(x)" are ' ++ 'considered, as\n' ++ ' with the evaluation of "x + y". In certain situations, ' ++ 'augmented\n' ++ ' assignment can result in unexpected errors (see *Why ' ++ 'does\n' ++ " a_tuple[i] += ['item'] raise an exception when the " ++ 'addition\n' ++ ' works?*), but this behavior is in fact part of the ' ++ 'data model.\n' ++ '\n' ++ 'object.__neg__(self)\n' ++ 'object.__pos__(self)\n' ++ 'object.__abs__(self)\n' ++ 'object.__invert__(self)\n' ++ '\n' ++ ' Called to implement the unary arithmetic operations ' ++ '("-", "+",\n' ++ ' "abs()" and "~").\n' ++ '\n' ++ 'object.__complex__(self)\n' ++ 'object.__int__(self)\n' ++ 'object.__float__(self)\n' ++ 'object.__round__(self[, n])\n' ++ '\n' ++ ' Called to implement the built-in functions ' ++ '"complex()", "int()",\n' ++ ' "float()" and "round()". Should return a value of the ' ++ 'appropriate\n' ++ ' type.\n' ++ '\n' ++ 'object.__index__(self)\n' ++ '\n' ++ ' Called to implement "operator.index()", and whenever ' ++ 'Python needs\n' ++ ' to losslessly convert the numeric object to an integer ' ++ 'object (such\n' ++ ' as in slicing, or in the built-in "bin()", "hex()" and ' ++ '"oct()"\n' ++ ' functions). Presence of this method indicates that the ' ++ 'numeric\n' ++ ' object is an integer type. Must return an integer.\n' ++ '\n' ++ ' Note: In order to have a coherent integer type class, ' ++ 'when\n' ++ ' "__index__()" is defined "__int__()" should also be ' ++ 'defined, and\n' ++ ' both should return the same value.\n', ++ 'objects': '\n' ++ 'Objects, values and types\n' ++ '*************************\n' ++ '\n' ++ "*Objects* are Python's abstraction for data. All data in a " ++ 'Python\n' ++ 'program is represented by objects or by relations between ' ++ 'objects. (In\n' ++ "a sense, and in conformance to Von Neumann's model of a " ++ '"stored\n' ++ 'program computer," code is also represented by objects.)\n' ++ '\n' ++ "Every object has an identity, a type and a value. An object's\n" ++ '*identity* never changes once it has been created; you may ' ++ 'think of it\n' ++ 'as the object\'s address in memory. The \'"is"\' operator ' ++ 'compares the\n' ++ 'identity of two objects; the "id()" function returns an ' ++ 'integer\n' ++ 'representing its identity.\n' ++ '\n' ++ '**CPython implementation detail:** For CPython, "id(x)" is the ' ++ 'memory\n' ++ 'address where "x" is stored.\n' ++ '\n' ++ "An object's type determines the operations that the object " ++ 'supports\n' ++ '(e.g., "does it have a length?") and also defines the possible ' ++ 'values\n' ++ 'for objects of that type. The "type()" function returns an ' ++ "object's\n" ++ 'type (which is an object itself). Like its identity, an ' ++ "object's\n" ++ '*type* is also unchangeable. [1]\n' ++ '\n' ++ 'The *value* of some objects can change. Objects whose value ' ++ 'can\n' ++ 'change are said to be *mutable*; objects whose value is ' ++ 'unchangeable\n' ++ 'once they are created are called *immutable*. (The value of an\n' ++ 'immutable container object that contains a reference to a ' ++ 'mutable\n' ++ "object can change when the latter's value is changed; however " ++ 'the\n' ++ 'container is still considered immutable, because the collection ' ++ 'of\n' ++ 'objects it contains cannot be changed. So, immutability is ' ++ 'not\n' ++ 'strictly the same as having an unchangeable value, it is more ' ++ 'subtle.)\n' ++ "An object's mutability is determined by its type; for " ++ 'instance,\n' ++ 'numbers, strings and tuples are immutable, while dictionaries ' ++ 'and\n' ++ 'lists are mutable.\n' ++ '\n' ++ 'Objects are never explicitly destroyed; however, when they ' ++ 'become\n' ++ 'unreachable they may be garbage-collected. An implementation ' ++ 'is\n' ++ 'allowed to postpone garbage collection or omit it altogether ' ++ '--- it is\n' ++ 'a matter of implementation quality how garbage collection is\n' ++ 'implemented, as long as no objects are collected that are ' ++ 'still\n' ++ 'reachable.\n' ++ '\n' ++ '**CPython implementation detail:** CPython currently uses a ' ++ 'reference-\n' ++ 'counting scheme with (optional) delayed detection of cyclically ' ++ 'linked\n' ++ 'garbage, which collects most objects as soon as they become\n' ++ 'unreachable, but is not guaranteed to collect garbage ' ++ 'containing\n' ++ 'circular references. See the documentation of the "gc" module ' ++ 'for\n' ++ 'information on controlling the collection of cyclic garbage. ' ++ 'Other\n' ++ 'implementations act differently and CPython may change. Do not ' ++ 'depend\n' ++ 'on immediate finalization of objects when they become ' ++ 'unreachable (so\n' ++ 'you should always close files explicitly).\n' ++ '\n' ++ "Note that the use of the implementation's tracing or debugging\n" ++ 'facilities may keep objects alive that would normally be ' ++ 'collectable.\n' ++ 'Also note that catching an exception with a ' ++ '\'"try"..."except"\'\n' ++ 'statement may keep objects alive.\n' ++ '\n' ++ 'Some objects contain references to "external" resources such as ' ++ 'open\n' ++ 'files or windows. It is understood that these resources are ' ++ 'freed\n' ++ 'when the object is garbage-collected, but since garbage ' ++ 'collection is\n' ++ 'not guaranteed to happen, such objects also provide an explicit ' ++ 'way to\n' ++ 'release the external resource, usually a "close()" method. ' ++ 'Programs\n' ++ 'are strongly recommended to explicitly close such objects. ' ++ 'The\n' ++ '\'"try"..."finally"\' statement and the \'"with"\' statement ' ++ 'provide\n' ++ 'convenient ways to do this.\n' ++ '\n' ++ 'Some objects contain references to other objects; these are ' ++ 'called\n' ++ '*containers*. Examples of containers are tuples, lists and\n' ++ "dictionaries. The references are part of a container's value. " ++ 'In\n' ++ 'most cases, when we talk about the value of a container, we ' ++ 'imply the\n' ++ 'values, not the identities of the contained objects; however, ' ++ 'when we\n' ++ 'talk about the mutability of a container, only the identities ' ++ 'of the\n' ++ 'immediately contained objects are implied. So, if an ' ++ 'immutable\n' ++ 'container (like a tuple) contains a reference to a mutable ' ++ 'object, its\n' ++ 'value changes if that mutable object is changed.\n' ++ '\n' ++ 'Types affect almost all aspects of object behavior. Even the\n' ++ 'importance of object identity is affected in some sense: for ' ++ 'immutable\n' ++ 'types, operations that compute new values may actually return ' ++ 'a\n' ++ 'reference to any existing object with the same type and value, ' ++ 'while\n' ++ 'for mutable objects this is not allowed. E.g., after "a = 1; b ' ++ '= 1",\n' ++ '"a" and "b" may or may not refer to the same object with the ' ++ 'value\n' ++ 'one, depending on the implementation, but after "c = []; d = ' ++ '[]", "c"\n' ++ 'and "d" are guaranteed to refer to two different, unique, ' ++ 'newly\n' ++ 'created empty lists. (Note that "c = d = []" assigns the same ' ++ 'object\n' ++ 'to both "c" and "d".)\n', ++ 'operator-summary': '\n' ++ 'Operator precedence\n' ++ '*******************\n' ++ '\n' ++ 'The following table summarizes the operator precedence ' ++ 'in Python, from\n' ++ 'lowest precedence (least binding) to highest ' ++ 'precedence (most\n' ++ 'binding). Operators in the same box have the same ' ++ 'precedence. Unless\n' ++ 'the syntax is explicitly given, operators are binary. ' ++ 'Operators in\n' ++ 'the same box group left to right (except for ' ++ 'exponentiation, which\n' ++ 'groups from right to left).\n' ++ '\n' ++ 'Note that comparisons, membership tests, and identity ' ++ 'tests, all have\n' ++ 'the same precedence and have a left-to-right chaining ' ++ 'feature as\n' ++ 'described in the *Comparisons* section.\n' ++ '\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| Operator | ' ++ 'Description |\n' ++ '+=================================================+=======================================+\n' ++ '| "lambda" | ' ++ 'Lambda expression |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "if" -- "else" | ' ++ 'Conditional expression |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "or" | ' ++ 'Boolean OR |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "and" | ' ++ 'Boolean AND |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "not" "x" | ' ++ 'Boolean NOT |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "in", "not in", "is", "is not", "<", "<=", ">", | ' ++ 'Comparisons, including membership |\n' ++ '| ">=", "!=", "==" | ' ++ 'tests and identity tests |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "|" | ' ++ 'Bitwise OR |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "^" | ' ++ 'Bitwise XOR |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "&" | ' ++ 'Bitwise AND |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "<<", ">>" | ' ++ 'Shifts |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "+", "-" | ' ++ 'Addition and subtraction |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "*", "/", "//", "%" | ' ++ 'Multiplication, division, remainder |\n' ++ '| | ' ++ '[5] |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "+x", "-x", "~x" | ' ++ 'Positive, negative, bitwise NOT |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "**" | ' ++ 'Exponentiation [6] |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "x[index]", "x[index:index]", | ' ++ 'Subscription, slicing, call, |\n' ++ '| "x(arguments...)", "x.attribute" | ' ++ 'attribute reference |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '| "(expressions...)", "[expressions...]", "{key: | ' ++ 'Binding or tuple display, list |\n' ++ '| value...}", "{expressions...}" | ' ++ 'display, dictionary display, set |\n' ++ '| | ' ++ 'display |\n' ++ '+-------------------------------------------------+---------------------------------------+\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] While "abs(x%y) < abs(y)" is true mathematically, ' ++ 'for floats\n' ++ ' it may not be true numerically due to roundoff. ' ++ 'For example, and\n' ++ ' assuming a platform on which a Python float is an ' ++ 'IEEE 754 double-\n' ++ ' precision number, in order that "-1e-100 % 1e100" ' ++ 'have the same\n' ++ ' sign as "1e100", the computed result is "-1e-100 + ' ++ '1e100", which\n' ++ ' is numerically exactly equal to "1e100". The ' ++ 'function\n' ++ ' "math.fmod()" returns a result whose sign matches ' ++ 'the sign of the\n' ++ ' first argument instead, and so returns "-1e-100" ' ++ 'in this case.\n' ++ ' Which approach is more appropriate depends on the ' ++ 'application.\n' ++ '\n' ++ '[2] If x is very close to an exact integer multiple of ' ++ "y, it's\n" ++ ' possible for "x//y" to be one larger than ' ++ '"(x-x%y)//y" due to\n' ++ ' rounding. In such cases, Python returns the ' ++ 'latter result, in\n' ++ ' order to preserve that "divmod(x,y)[0] * y + x % ' ++ 'y" be very close\n' ++ ' to "x".\n' ++ '\n' ++ '[3] While comparisons between strings make sense at ' ++ 'the byte\n' ++ ' level, they may be counter-intuitive to users. ' ++ 'For example, the\n' ++ ' strings ""\\u00C7"" and ""\\u0327\\u0043"" compare ' ++ 'differently, even\n' ++ ' though they both represent the same unicode ' ++ 'character (LATIN\n' ++ ' CAPITAL LETTER C WITH CEDILLA). To compare ' ++ 'strings in a human\n' ++ ' recognizable way, compare using ' ++ '"unicodedata.normalize()".\n' ++ '\n' ++ '[4] Due to automatic garbage-collection, free lists, ' ++ 'and the\n' ++ ' dynamic nature of descriptors, you may notice ' ++ 'seemingly unusual\n' ++ ' behaviour in certain uses of the "is" operator, ' ++ 'like those\n' ++ ' involving comparisons between instance methods, or ' ++ 'constants.\n' ++ ' Check their documentation for more info.\n' ++ '\n' ++ '[5] The "%" operator is also used for string ' ++ 'formatting; the same\n' ++ ' precedence applies.\n' ++ '\n' ++ '[6] The power operator "**" binds less tightly than an ' ++ 'arithmetic\n' ++ ' or bitwise unary operator on its right, that is, ' ++ '"2**-1" is "0.5".\n', ++ 'pass': '\n' ++ 'The "pass" statement\n' ++ '********************\n' ++ '\n' ++ ' pass_stmt ::= "pass"\n' ++ '\n' ++ '"pass" is a null operation --- when it is executed, nothing ' ++ 'happens.\n' ++ 'It is useful as a placeholder when a statement is required\n' ++ 'syntactically, but no code needs to be executed, for example:\n' ++ '\n' ++ ' def f(arg): pass # a function that does nothing (yet)\n' ++ '\n' ++ ' class C: pass # a class with no methods (yet)\n', ++ 'power': '\n' ++ 'The power operator\n' ++ '******************\n' ++ '\n' ++ 'The power operator binds more tightly than unary operators on ' ++ 'its\n' ++ 'left; it binds less tightly than unary operators on its right. ' ++ 'The\n' ++ 'syntax is:\n' ++ '\n' ++ ' power ::= primary ["**" u_expr]\n' ++ '\n' ++ 'Thus, in an unparenthesized sequence of power and unary ' ++ 'operators, the\n' ++ 'operators are evaluated from right to left (this does not ' ++ 'constrain\n' ++ 'the evaluation order for the operands): "-1**2" results in "-1".\n' ++ '\n' ++ 'The power operator has the same semantics as the built-in ' ++ '"pow()"\n' ++ 'function, when called with two arguments: it yields its left ' ++ 'argument\n' ++ 'raised to the power of its right argument. The numeric arguments ' ++ 'are\n' ++ 'first converted to a common type, and the result is of that ' ++ 'type.\n' ++ '\n' ++ 'For int operands, the result has the same type as the operands ' ++ 'unless\n' ++ 'the second argument is negative; in that case, all arguments are\n' ++ 'converted to float and a float result is delivered. For example,\n' ++ '"10**2" returns "100", but "10**-2" returns "0.01".\n' ++ '\n' ++ 'Raising "0.0" to a negative power results in a ' ++ '"ZeroDivisionError".\n' ++ 'Raising a negative number to a fractional power results in a ' ++ '"complex"\n' ++ 'number. (In earlier versions it raised a "ValueError".)\n', ++ 'raise': '\n' ++ 'The "raise" statement\n' ++ '*********************\n' ++ '\n' ++ ' raise_stmt ::= "raise" [expression ["from" expression]]\n' ++ '\n' ++ 'If no expressions are present, "raise" re-raises the last ' ++ 'exception\n' ++ 'that was active in the current scope. If no exception is active ' ++ 'in\n' ++ 'the current scope, a "RuntimeError" exception is raised ' ++ 'indicating\n' ++ 'that this is an error.\n' ++ '\n' ++ 'Otherwise, "raise" evaluates the first expression as the ' ++ 'exception\n' ++ 'object. It must be either a subclass or an instance of\n' ++ '"BaseException". If it is a class, the exception instance will ' ++ 'be\n' ++ 'obtained when needed by instantiating the class with no ' ++ 'arguments.\n' ++ '\n' ++ "The *type* of the exception is the exception instance's class, " ++ 'the\n' ++ '*value* is the instance itself.\n' ++ '\n' ++ 'A traceback object is normally created automatically when an ' ++ 'exception\n' ++ 'is raised and attached to it as the "__traceback__" attribute, ' ++ 'which\n' ++ 'is writable. You can create an exception and set your own ' ++ 'traceback in\n' ++ 'one step using the "with_traceback()" exception method (which ' ++ 'returns\n' ++ 'the same exception instance, with its traceback set to its ' ++ 'argument),\n' ++ 'like so:\n' ++ '\n' ++ ' raise Exception("foo occurred").with_traceback(tracebackobj)\n' ++ '\n' ++ 'The "from" clause is used for exception chaining: if given, the ' ++ 'second\n' ++ '*expression* must be another exception class or instance, which ' ++ 'will\n' ++ 'then be attached to the raised exception as the "__cause__" ' ++ 'attribute\n' ++ '(which is writable). If the raised exception is not handled, ' ++ 'both\n' ++ 'exceptions will be printed:\n' ++ '\n' ++ ' >>> try:\n' ++ ' ... print(1 / 0)\n' ++ ' ... except Exception as exc:\n' ++ ' ... raise RuntimeError("Something bad happened") from exc\n' ++ ' ...\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 2, in \n' ++ ' ZeroDivisionError: int division or modulo by zero\n' ++ '\n' ++ ' The above exception was the direct cause of the following ' ++ 'exception:\n' ++ '\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 4, in \n' ++ ' RuntimeError: Something bad happened\n' ++ '\n' ++ 'A similar mechanism works implicitly if an exception is raised ' ++ 'inside\n' ++ 'an exception handler: the previous exception is then attached as ' ++ 'the\n' ++ 'new exception\'s "__context__" attribute:\n' ++ '\n' ++ ' >>> try:\n' ++ ' ... print(1 / 0)\n' ++ ' ... except:\n' ++ ' ... raise RuntimeError("Something bad happened")\n' ++ ' ...\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 2, in \n' ++ ' ZeroDivisionError: int division or modulo by zero\n' ++ '\n' ++ ' During handling of the above exception, another exception ' ++ 'occurred:\n' ++ '\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 4, in \n' ++ ' RuntimeError: Something bad happened\n' ++ '\n' ++ 'Additional information on exceptions can be found in section\n' ++ '*Exceptions*, and information about handling exceptions is in ' ++ 'section\n' ++ '*The try statement*.\n', ++ 'return': '\n' ++ 'The "return" statement\n' ++ '**********************\n' ++ '\n' ++ ' return_stmt ::= "return" [expression_list]\n' ++ '\n' ++ '"return" may only occur syntactically nested in a function ' ++ 'definition,\n' ++ 'not within a nested class definition.\n' ++ '\n' ++ 'If an expression list is present, it is evaluated, else "None" ' ++ 'is\n' ++ 'substituted.\n' ++ '\n' ++ '"return" leaves the current function call with the expression ' ++ 'list (or\n' ++ '"None") as return value.\n' ++ '\n' ++ 'When "return" passes control out of a "try" statement with a ' ++ '"finally"\n' ++ 'clause, that "finally" clause is executed before really leaving ' ++ 'the\n' ++ 'function.\n' ++ '\n' ++ 'In a generator function, the "return" statement indicates that ' ++ 'the\n' ++ 'generator is done and will cause "StopIteration" to be raised. ' ++ 'The\n' ++ 'returned value (if any) is used as an argument to construct\n' ++ '"StopIteration" and becomes the "StopIteration.value" ' ++ 'attribute.\n', ++ 'sequence-types': '\n' ++ 'Emulating container types\n' ++ '*************************\n' ++ '\n' ++ 'The following methods can be defined to implement ' ++ 'container objects.\n' ++ 'Containers usually are sequences (such as lists or ' ++ 'tuples) or mappings\n' ++ '(like dictionaries), but can represent other containers ' ++ 'as well. The\n' ++ 'first set of methods is used either to emulate a ' ++ 'sequence or to\n' ++ 'emulate a mapping; the difference is that for a ' ++ 'sequence, the\n' ++ 'allowable keys should be the integers *k* for which "0 ' ++ '<= k < N" where\n' ++ '*N* is the length of the sequence, or slice objects, ' ++ 'which define a\n' ++ 'range of items. It is also recommended that mappings ' ++ 'provide the\n' ++ 'methods "keys()", "values()", "items()", "get()", ' ++ '"clear()",\n' ++ '"setdefault()", "pop()", "popitem()", "copy()", and ' ++ '"update()"\n' ++ "behaving similar to those for Python's standard " ++ 'dictionary objects.\n' ++ 'The "collections" module provides a "MutableMapping" ' ++ 'abstract base\n' ++ 'class to help create those methods from a base set of ' ++ '"__getitem__()",\n' ++ '"__setitem__()", "__delitem__()", and "keys()". Mutable ' ++ 'sequences\n' ++ 'should provide methods "append()", "count()", "index()", ' ++ '"extend()",\n' ++ '"insert()", "pop()", "remove()", "reverse()" and ' ++ '"sort()", like Python\n' ++ 'standard list objects. Finally, sequence types should ' ++ 'implement\n' ++ 'addition (meaning concatenation) and multiplication ' ++ '(meaning\n' ++ 'repetition) by defining the methods "__add__()", ' ++ '"__radd__()",\n' ++ '"__iadd__()", "__mul__()", "__rmul__()" and "__imul__()" ' ++ 'described\n' ++ 'below; they should not define other numerical ' ++ 'operators. It is\n' ++ 'recommended that both mappings and sequences implement ' ++ 'the\n' ++ '"__contains__()" method to allow efficient use of the ' ++ '"in" operator;\n' ++ 'for mappings, "in" should search the mapping\'s keys; ' ++ 'for sequences, it\n' ++ 'should search through the values. It is further ' ++ 'recommended that both\n' ++ 'mappings and sequences implement the "__iter__()" method ' ++ 'to allow\n' ++ 'efficient iteration through the container; for mappings, ' ++ '"__iter__()"\n' ++ 'should be the same as "keys()"; for sequences, it should ' ++ 'iterate\n' ++ 'through the values.\n' ++ '\n' ++ 'object.__len__(self)\n' ++ '\n' ++ ' Called to implement the built-in function "len()". ' ++ 'Should return\n' ++ ' the length of the object, an integer ">=" 0. Also, ' ++ 'an object that\n' ++ ' doesn\'t define a "__bool__()" method and whose ' ++ '"__len__()" method\n' ++ ' returns zero is considered to be false in a Boolean ' ++ 'context.\n' ++ '\n' ++ 'object.__length_hint__(self)\n' ++ '\n' ++ ' Called to implement "operator.length_hint()". Should ' ++ 'return an\n' ++ ' estimated length for the object (which may be greater ' ++ 'or less than\n' ++ ' the actual length). The length must be an integer ' ++ '">=" 0. This\n' ++ ' method is purely an optimization and is never ' ++ 'required for\n' ++ ' correctness.\n' ++ '\n' ++ ' New in version 3.4.\n' ++ '\n' ++ 'Note: Slicing is done exclusively with the following ' ++ 'three methods.\n' ++ ' A call like\n' ++ '\n' ++ ' a[1:2] = b\n' ++ '\n' ++ ' is translated to\n' ++ '\n' ++ ' a[slice(1, 2, None)] = b\n' ++ '\n' ++ ' and so forth. Missing slice items are always filled ' ++ 'in with "None".\n' ++ '\n' ++ 'object.__getitem__(self, key)\n' ++ '\n' ++ ' Called to implement evaluation of "self[key]". For ' ++ 'sequence types,\n' ++ ' the accepted keys should be integers and slice ' ++ 'objects. Note that\n' ++ ' the special interpretation of negative indexes (if ' ++ 'the class wishes\n' ++ ' to emulate a sequence type) is up to the ' ++ '"__getitem__()" method. If\n' ++ ' *key* is of an inappropriate type, "TypeError" may be ' ++ 'raised; if of\n' ++ ' a value outside the set of indexes for the sequence ' ++ '(after any\n' ++ ' special interpretation of negative values), ' ++ '"IndexError" should be\n' ++ ' raised. For mapping types, if *key* is missing (not ' ++ 'in the\n' ++ ' container), "KeyError" should be raised.\n' ++ '\n' ++ ' Note: "for" loops expect that an "IndexError" will be ' ++ 'raised for\n' ++ ' illegal indexes to allow proper detection of the ' ++ 'end of the\n' ++ ' sequence.\n' ++ '\n' ++ 'object.__setitem__(self, key, value)\n' ++ '\n' ++ ' Called to implement assignment to "self[key]". Same ' ++ 'note as for\n' ++ ' "__getitem__()". This should only be implemented for ' ++ 'mappings if\n' ++ ' the objects support changes to the values for keys, ' ++ 'or if new keys\n' ++ ' can be added, or for sequences if elements can be ' ++ 'replaced. The\n' ++ ' same exceptions should be raised for improper *key* ' ++ 'values as for\n' ++ ' the "__getitem__()" method.\n' ++ '\n' ++ 'object.__delitem__(self, key)\n' ++ '\n' ++ ' Called to implement deletion of "self[key]". Same ' ++ 'note as for\n' ++ ' "__getitem__()". This should only be implemented for ' ++ 'mappings if\n' ++ ' the objects support removal of keys, or for sequences ' ++ 'if elements\n' ++ ' can be removed from the sequence. The same ' ++ 'exceptions should be\n' ++ ' raised for improper *key* values as for the ' ++ '"__getitem__()" method.\n' ++ '\n' ++ 'object.__iter__(self)\n' ++ '\n' ++ ' This method is called when an iterator is required ' ++ 'for a container.\n' ++ ' This method should return a new iterator object that ' ++ 'can iterate\n' ++ ' over all the objects in the container. For mappings, ' ++ 'it should\n' ++ ' iterate over the keys of the container, and should ' ++ 'also be made\n' ++ ' available as the method "keys()".\n' ++ '\n' ++ ' Iterator objects also need to implement this method; ' ++ 'they are\n' ++ ' required to return themselves. For more information ' ++ 'on iterator\n' ++ ' objects, see *Iterator Types*.\n' ++ '\n' ++ 'object.__reversed__(self)\n' ++ '\n' ++ ' Called (if present) by the "reversed()" built-in to ' ++ 'implement\n' ++ ' reverse iteration. It should return a new iterator ' ++ 'object that\n' ++ ' iterates over all the objects in the container in ' ++ 'reverse order.\n' ++ '\n' ++ ' If the "__reversed__()" method is not provided, the ' ++ '"reversed()"\n' ++ ' built-in will fall back to using the sequence ' ++ 'protocol ("__len__()"\n' ++ ' and "__getitem__()"). Objects that support the ' ++ 'sequence protocol\n' ++ ' should only provide "__reversed__()" if they can ' ++ 'provide an\n' ++ ' implementation that is more efficient than the one ' ++ 'provided by\n' ++ ' "reversed()".\n' ++ '\n' ++ 'The membership test operators ("in" and "not in") are ' ++ 'normally\n' ++ 'implemented as an iteration through a sequence. ' ++ 'However, container\n' ++ 'objects can supply the following special method with a ' ++ 'more efficient\n' ++ 'implementation, which also does not require the object ' ++ 'be a sequence.\n' ++ '\n' ++ 'object.__contains__(self, item)\n' ++ '\n' ++ ' Called to implement membership test operators. ' ++ 'Should return true\n' ++ ' if *item* is in *self*, false otherwise. For mapping ' ++ 'objects, this\n' ++ ' should consider the keys of the mapping rather than ' ++ 'the values or\n' ++ ' the key-item pairs.\n' ++ '\n' ++ ' For objects that don\'t define "__contains__()", the ' ++ 'membership test\n' ++ ' first tries iteration via "__iter__()", then the old ' ++ 'sequence\n' ++ ' iteration protocol via "__getitem__()", see *this ' ++ 'section in the\n' ++ ' language reference*.\n', ++ 'shifting': '\n' ++ 'Shifting operations\n' ++ '*******************\n' ++ '\n' ++ 'The shifting operations have lower priority than the ' ++ 'arithmetic\n' ++ 'operations:\n' ++ '\n' ++ ' shift_expr ::= a_expr | shift_expr ( "<<" | ">>" ) a_expr\n' ++ '\n' ++ 'These operators accept integers as arguments. They shift the ' ++ 'first\n' ++ 'argument to the left or right by the number of bits given by ' ++ 'the\n' ++ 'second argument.\n' ++ '\n' ++ 'A right shift by *n* bits is defined as floor division by ' ++ '"pow(2,n)".\n' ++ 'A left shift by *n* bits is defined as multiplication with ' ++ '"pow(2,n)".\n' ++ '\n' ++ 'Note: In the current implementation, the right-hand operand ' ++ 'is\n' ++ ' required to be at most "sys.maxsize". If the right-hand ' ++ 'operand is\n' ++ ' larger than "sys.maxsize" an "OverflowError" exception is ' ++ 'raised.\n', ++ 'slicings': '\n' ++ 'Slicings\n' ++ '********\n' ++ '\n' ++ 'A slicing selects a range of items in a sequence object (e.g., ' ++ 'a\n' ++ 'string, tuple or list). Slicings may be used as expressions ' ++ 'or as\n' ++ 'targets in assignment or "del" statements. The syntax for a ' ++ 'slicing:\n' ++ '\n' ++ ' slicing ::= primary "[" slice_list "]"\n' ++ ' slice_list ::= slice_item ("," slice_item)* [","]\n' ++ ' slice_item ::= expression | proper_slice\n' ++ ' proper_slice ::= [lower_bound] ":" [upper_bound] [ ":" ' ++ '[stride] ]\n' ++ ' lower_bound ::= expression\n' ++ ' upper_bound ::= expression\n' ++ ' stride ::= expression\n' ++ '\n' ++ 'There is ambiguity in the formal syntax here: anything that ' ++ 'looks like\n' ++ 'an expression list also looks like a slice list, so any ' ++ 'subscription\n' ++ 'can be interpreted as a slicing. Rather than further ' ++ 'complicating the\n' ++ 'syntax, this is disambiguated by defining that in this case ' ++ 'the\n' ++ 'interpretation as a subscription takes priority over the\n' ++ 'interpretation as a slicing (this is the case if the slice ' ++ 'list\n' ++ 'contains no proper slice).\n' ++ '\n' ++ 'The semantics for a slicing are as follows. The primary must ' ++ 'evaluate\n' ++ 'to a mapping object, and it is indexed (using the same ' ++ '"__getitem__()"\n' ++ 'method as normal subscription) with a key that is constructed ' ++ 'from the\n' ++ 'slice list, as follows. If the slice list contains at least ' ++ 'one\n' ++ 'comma, the key is a tuple containing the conversion of the ' ++ 'slice\n' ++ 'items; otherwise, the conversion of the lone slice item is the ' ++ 'key.\n' ++ 'The conversion of a slice item that is an expression is that\n' ++ 'expression. The conversion of a proper slice is a slice ' ++ 'object (see\n' ++ 'section *The standard type hierarchy*) whose "start", "stop" ' ++ 'and\n' ++ '"step" attributes are the values of the expressions given as ' ++ 'lower\n' ++ 'bound, upper bound and stride, respectively, substituting ' ++ '"None" for\n' ++ 'missing expressions.\n', ++ 'specialattrs': '\n' ++ 'Special Attributes\n' ++ '******************\n' ++ '\n' ++ 'The implementation adds a few special read-only attributes ' ++ 'to several\n' ++ 'object types, where they are relevant. Some of these are ' ++ 'not reported\n' ++ 'by the "dir()" built-in function.\n' ++ '\n' ++ 'object.__dict__\n' ++ '\n' ++ ' A dictionary or other mapping object used to store an ' ++ "object's\n" ++ ' (writable) attributes.\n' ++ '\n' ++ 'instance.__class__\n' ++ '\n' ++ ' The class to which a class instance belongs.\n' ++ '\n' ++ 'class.__bases__\n' ++ '\n' ++ ' The tuple of base classes of a class object.\n' ++ '\n' ++ 'class.__name__\n' ++ '\n' ++ ' The name of the class or type.\n' ++ '\n' ++ 'class.__qualname__\n' ++ '\n' ++ ' The *qualified name* of the class or type.\n' ++ '\n' ++ ' New in version 3.3.\n' ++ '\n' ++ 'class.__mro__\n' ++ '\n' ++ ' This attribute is a tuple of classes that are ' ++ 'considered when\n' ++ ' looking for base classes during method resolution.\n' ++ '\n' ++ 'class.mro()\n' ++ '\n' ++ ' This method can be overridden by a metaclass to ' ++ 'customize the\n' ++ ' method resolution order for its instances. It is ' ++ 'called at class\n' ++ ' instantiation, and its result is stored in "__mro__".\n' ++ '\n' ++ 'class.__subclasses__()\n' ++ '\n' ++ ' Each class keeps a list of weak references to its ' ++ 'immediate\n' ++ ' subclasses. This method returns a list of all those ' ++ 'references\n' ++ ' still alive. Example:\n' ++ '\n' ++ ' >>> int.__subclasses__()\n' ++ " []\n" ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ '[1] Additional information on these special methods may be ' ++ 'found\n' ++ ' in the Python Reference Manual (*Basic ' ++ 'customization*).\n' ++ '\n' ++ '[2] As a consequence, the list "[1, 2]" is considered ' ++ 'equal to\n' ++ ' "[1.0, 2.0]", and similarly for tuples.\n' ++ '\n' ++ "[3] They must have since the parser can't tell the type of " ++ 'the\n' ++ ' operands.\n' ++ '\n' ++ '[4] Cased characters are those with general category ' ++ 'property\n' ++ ' being one of "Lu" (Letter, uppercase), "Ll" (Letter, ' ++ 'lowercase),\n' ++ ' or "Lt" (Letter, titlecase).\n' ++ '\n' ++ '[5] To format only a tuple you should therefore provide a\n' ++ ' singleton tuple whose only element is the tuple to be ' ++ 'formatted.\n', ++ 'specialnames': '\n' ++ 'Special method names\n' ++ '********************\n' ++ '\n' ++ 'A class can implement certain operations that are invoked ' ++ 'by special\n' ++ 'syntax (such as arithmetic operations or subscripting and ' ++ 'slicing) by\n' ++ "defining methods with special names. This is Python's " ++ 'approach to\n' ++ '*operator overloading*, allowing classes to define their ' ++ 'own behavior\n' ++ 'with respect to language operators. For instance, if a ' ++ 'class defines\n' ++ 'a method named "__getitem__()", and "x" is an instance of ' ++ 'this class,\n' ++ 'then "x[i]" is roughly equivalent to ' ++ '"type(x).__getitem__(x, i)".\n' ++ 'Except where mentioned, attempts to execute an operation ' ++ 'raise an\n' ++ 'exception when no appropriate method is defined ' ++ '(typically\n' ++ '"AttributeError" or "TypeError").\n' ++ '\n' ++ 'When implementing a class that emulates any built-in type, ' ++ 'it is\n' ++ 'important that the emulation only be implemented to the ' ++ 'degree that it\n' ++ 'makes sense for the object being modelled. For example, ' ++ 'some\n' ++ 'sequences may work well with retrieval of individual ' ++ 'elements, but\n' ++ 'extracting a slice may not make sense. (One example of ' ++ 'this is the\n' ++ '"NodeList" interface in the W3C\'s Document Object ' ++ 'Model.)\n' ++ '\n' ++ '\n' ++ 'Basic customization\n' ++ '===================\n' ++ '\n' ++ 'object.__new__(cls[, ...])\n' ++ '\n' ++ ' Called to create a new instance of class *cls*. ' ++ '"__new__()" is a\n' ++ ' static method (special-cased so you need not declare it ' ++ 'as such)\n' ++ ' that takes the class of which an instance was requested ' ++ 'as its\n' ++ ' first argument. The remaining arguments are those ' ++ 'passed to the\n' ++ ' object constructor expression (the call to the class). ' ++ 'The return\n' ++ ' value of "__new__()" should be the new object instance ' ++ '(usually an\n' ++ ' instance of *cls*).\n' ++ '\n' ++ ' Typical implementations create a new instance of the ' ++ 'class by\n' ++ ' invoking the superclass\'s "__new__()" method using\n' ++ ' "super(currentclass, cls).__new__(cls[, ...])" with ' ++ 'appropriate\n' ++ ' arguments and then modifying the newly-created instance ' ++ 'as\n' ++ ' necessary before returning it.\n' ++ '\n' ++ ' If "__new__()" returns an instance of *cls*, then the ' ++ 'new\n' ++ ' instance\'s "__init__()" method will be invoked like\n' ++ ' "__init__(self[, ...])", where *self* is the new ' ++ 'instance and the\n' ++ ' remaining arguments are the same as were passed to ' ++ '"__new__()".\n' ++ '\n' ++ ' If "__new__()" does not return an instance of *cls*, ' ++ 'then the new\n' ++ ' instance\'s "__init__()" method will not be invoked.\n' ++ '\n' ++ ' "__new__()" is intended mainly to allow subclasses of ' ++ 'immutable\n' ++ ' types (like int, str, or tuple) to customize instance ' ++ 'creation. It\n' ++ ' is also commonly overridden in custom metaclasses in ' ++ 'order to\n' ++ ' customize class creation.\n' ++ '\n' ++ 'object.__init__(self[, ...])\n' ++ '\n' ++ ' Called when the instance is created. The arguments are ' ++ 'those\n' ++ ' passed to the class constructor expression. If a base ' ++ 'class has an\n' ++ ' "__init__()" method, the derived class\'s "__init__()" ' ++ 'method, if\n' ++ ' any, must explicitly call it to ensure proper ' ++ 'initialization of the\n' ++ ' base class part of the instance; for example:\n' ++ ' "BaseClass.__init__(self, [args...])". As a special ' ++ 'constraint on\n' ++ ' constructors, no value may be returned; doing so will ' ++ 'cause a\n' ++ ' "TypeError" to be raised at runtime.\n' ++ '\n' ++ 'object.__del__(self)\n' ++ '\n' ++ ' Called when the instance is about to be destroyed. ' ++ 'This is also\n' ++ ' called a destructor. If a base class has a "__del__()" ' ++ 'method, the\n' ++ ' derived class\'s "__del__()" method, if any, must ' ++ 'explicitly call it\n' ++ ' to ensure proper deletion of the base class part of the ' ++ 'instance.\n' ++ ' Note that it is possible (though not recommended!) for ' ++ 'the\n' ++ ' "__del__()" method to postpone destruction of the ' ++ 'instance by\n' ++ ' creating a new reference to it. It may then be called ' ++ 'at a later\n' ++ ' time when this new reference is deleted. It is not ' ++ 'guaranteed that\n' ++ ' "__del__()" methods are called for objects that still ' ++ 'exist when\n' ++ ' the interpreter exits.\n' ++ '\n' ++ ' Note: "del x" doesn\'t directly call "x.__del__()" --- ' ++ 'the former\n' ++ ' decrements the reference count for "x" by one, and ' ++ 'the latter is\n' ++ ' only called when "x"\'s reference count reaches ' ++ 'zero. Some common\n' ++ ' situations that may prevent the reference count of an ' ++ 'object from\n' ++ ' going to zero include: circular references between ' ++ 'objects (e.g.,\n' ++ ' a doubly-linked list or a tree data structure with ' ++ 'parent and\n' ++ ' child pointers); a reference to the object on the ' ++ 'stack frame of\n' ++ ' a function that caught an exception (the traceback ' ++ 'stored in\n' ++ ' "sys.exc_info()[2]" keeps the stack frame alive); or ' ++ 'a reference\n' ++ ' to the object on the stack frame that raised an ' ++ 'unhandled\n' ++ ' exception in interactive mode (the traceback stored ' ++ 'in\n' ++ ' "sys.last_traceback" keeps the stack frame alive). ' ++ 'The first\n' ++ ' situation can only be remedied by explicitly breaking ' ++ 'the cycles;\n' ++ ' the latter two situations can be resolved by storing ' ++ '"None" in\n' ++ ' "sys.last_traceback". Circular references which are ' ++ 'garbage are\n' ++ ' detected and cleaned up when the cyclic garbage ' ++ 'collector is\n' ++ " enabled (it's on by default). Refer to the " ++ 'documentation for the\n' ++ ' "gc" module for more information about this topic.\n' ++ '\n' ++ ' Warning: Due to the precarious circumstances under ' ++ 'which\n' ++ ' "__del__()" methods are invoked, exceptions that ' ++ 'occur during\n' ++ ' their execution are ignored, and a warning is printed ' ++ 'to\n' ++ ' "sys.stderr" instead. Also, when "__del__()" is ' ++ 'invoked in\n' ++ ' response to a module being deleted (e.g., when ' ++ 'execution of the\n' ++ ' program is done), other globals referenced by the ' ++ '"__del__()"\n' ++ ' method may already have been deleted or in the ' ++ 'process of being\n' ++ ' torn down (e.g. the import machinery shutting down). ' ++ 'For this\n' ++ ' reason, "__del__()" methods should do the absolute ' ++ 'minimum needed\n' ++ ' to maintain external invariants. Starting with ' ++ 'version 1.5,\n' ++ ' Python guarantees that globals whose name begins with ' ++ 'a single\n' ++ ' underscore are deleted from their module before other ' ++ 'globals are\n' ++ ' deleted; if no other references to such globals ' ++ 'exist, this may\n' ++ ' help in assuring that imported modules are still ' ++ 'available at the\n' ++ ' time when the "__del__()" method is called.\n' ++ '\n' ++ 'object.__repr__(self)\n' ++ '\n' ++ ' Called by the "repr()" built-in function to compute the ' ++ '"official"\n' ++ ' string representation of an object. If at all ' ++ 'possible, this\n' ++ ' should look like a valid Python expression that could ' ++ 'be used to\n' ++ ' recreate an object with the same value (given an ' ++ 'appropriate\n' ++ ' environment). If this is not possible, a string of the ' ++ 'form\n' ++ ' "<...some useful description...>" should be returned. ' ++ 'The return\n' ++ ' value must be a string object. If a class defines ' ++ '"__repr__()" but\n' ++ ' not "__str__()", then "__repr__()" is also used when an ' ++ '"informal"\n' ++ ' string representation of instances of that class is ' ++ 'required.\n' ++ '\n' ++ ' This is typically used for debugging, so it is ' ++ 'important that the\n' ++ ' representation is information-rich and unambiguous.\n' ++ '\n' ++ 'object.__str__(self)\n' ++ '\n' ++ ' Called by "str(object)" and the built-in functions ' ++ '"format()" and\n' ++ ' "print()" to compute the "informal" or nicely printable ' ++ 'string\n' ++ ' representation of an object. The return value must be ' ++ 'a *string*\n' ++ ' object.\n' ++ '\n' ++ ' This method differs from "object.__repr__()" in that ' ++ 'there is no\n' ++ ' expectation that "__str__()" return a valid Python ' ++ 'expression: a\n' ++ ' more convenient or concise representation can be used.\n' ++ '\n' ++ ' The default implementation defined by the built-in type ' ++ '"object"\n' ++ ' calls "object.__repr__()".\n' ++ '\n' ++ 'object.__bytes__(self)\n' ++ '\n' ++ ' Called by "bytes()" to compute a byte-string ' ++ 'representation of an\n' ++ ' object. This should return a "bytes" object.\n' ++ '\n' ++ 'object.__format__(self, format_spec)\n' ++ '\n' ++ ' Called by the "format()" built-in function (and by ' ++ 'extension, the\n' ++ ' "str.format()" method of class "str") to produce a ' ++ '"formatted"\n' ++ ' string representation of an object. The "format_spec" ' ++ 'argument is a\n' ++ ' string that contains a description of the formatting ' ++ 'options\n' ++ ' desired. The interpretation of the "format_spec" ' ++ 'argument is up to\n' ++ ' the type implementing "__format__()", however most ' ++ 'classes will\n' ++ ' either delegate formatting to one of the built-in ' ++ 'types, or use a\n' ++ ' similar formatting option syntax.\n' ++ '\n' ++ ' See *Format Specification Mini-Language* for a ' ++ 'description of the\n' ++ ' standard formatting syntax.\n' ++ '\n' ++ ' The return value must be a string object.\n' ++ '\n' ++ ' Changed in version 3.4: The __format__ method of ' ++ '"object" itself\n' ++ ' raises a "TypeError" if passed any non-empty string.\n' ++ '\n' ++ 'object.__lt__(self, other)\n' ++ 'object.__le__(self, other)\n' ++ 'object.__eq__(self, other)\n' ++ 'object.__ne__(self, other)\n' ++ 'object.__gt__(self, other)\n' ++ 'object.__ge__(self, other)\n' ++ '\n' ++ ' These are the so-called "rich comparison" methods. The\n' ++ ' correspondence between operator symbols and method ' ++ 'names is as\n' ++ ' follows: "xy" calls\n' ++ ' "x.__gt__(y)", and "x>=y" calls "x.__ge__(y)".\n' ++ '\n' ++ ' A rich comparison method may return the singleton ' ++ '"NotImplemented"\n' ++ ' if it does not implement the operation for a given pair ' ++ 'of\n' ++ ' arguments. By convention, "False" and "True" are ' ++ 'returned for a\n' ++ ' successful comparison. However, these methods can ' ++ 'return any value,\n' ++ ' so if the comparison operator is used in a Boolean ' ++ 'context (e.g.,\n' ++ ' in the condition of an "if" statement), Python will ' ++ 'call "bool()"\n' ++ ' on the value to determine if the result is true or ' ++ 'false.\n' ++ '\n' ++ ' There are no implied relationships among the comparison ' ++ 'operators.\n' ++ ' The truth of "x==y" does not imply that "x!=y" is ' ++ 'false.\n' ++ ' Accordingly, when defining "__eq__()", one should also ' ++ 'define\n' ++ ' "__ne__()" so that the operators will behave as ' ++ 'expected. See the\n' ++ ' paragraph on "__hash__()" for some important notes on ' ++ 'creating\n' ++ ' *hashable* objects which support custom comparison ' ++ 'operations and\n' ++ ' are usable as dictionary keys.\n' ++ '\n' ++ ' There are no swapped-argument versions of these methods ' ++ '(to be used\n' ++ ' when the left argument does not support the operation ' ++ 'but the right\n' ++ ' argument does); rather, "__lt__()" and "__gt__()" are ' ++ "each other's\n" ++ ' reflection, "__le__()" and "__ge__()" are each other\'s ' ++ 'reflection,\n' ++ ' and "__eq__()" and "__ne__()" are their own ' ++ 'reflection.\n' ++ '\n' ++ ' Arguments to rich comparison methods are never ' ++ 'coerced.\n' ++ '\n' ++ ' To automatically generate ordering operations from a ' ++ 'single root\n' ++ ' operation, see "functools.total_ordering()".\n' ++ '\n' ++ 'object.__hash__(self)\n' ++ '\n' ++ ' Called by built-in function "hash()" and for operations ' ++ 'on members\n' ++ ' of hashed collections including "set", "frozenset", and ' ++ '"dict".\n' ++ ' "__hash__()" should return an integer. The only ' ++ 'required property\n' ++ ' is that objects which compare equal have the same hash ' ++ 'value; it is\n' ++ ' advised to somehow mix together (e.g. using exclusive ' ++ 'or) the hash\n' ++ ' values for the components of the object that also play ' ++ 'a part in\n' ++ ' comparison of objects.\n' ++ '\n' ++ ' Note: "hash()" truncates the value returned from an ' ++ "object's\n" ++ ' custom "__hash__()" method to the size of a ' ++ '"Py_ssize_t". This\n' ++ ' is typically 8 bytes on 64-bit builds and 4 bytes on ' ++ '32-bit\n' ++ ' builds. If an object\'s "__hash__()" must ' ++ 'interoperate on builds\n' ++ ' of different bit sizes, be sure to check the width on ' ++ 'all\n' ++ ' supported builds. An easy way to do this is with ' ++ '"python -c\n' ++ ' "import sys; print(sys.hash_info.width)""\n' ++ '\n' ++ ' If a class does not define an "__eq__()" method it ' ++ 'should not\n' ++ ' define a "__hash__()" operation either; if it defines ' ++ '"__eq__()"\n' ++ ' but not "__hash__()", its instances will not be usable ' ++ 'as items in\n' ++ ' hashable collections. If a class defines mutable ' ++ 'objects and\n' ++ ' implements an "__eq__()" method, it should not ' ++ 'implement\n' ++ ' "__hash__()", since the implementation of hashable ' ++ 'collections\n' ++ " requires that a key's hash value is immutable (if the " ++ "object's hash\n" ++ ' value changes, it will be in the wrong hash bucket).\n' ++ '\n' ++ ' User-defined classes have "__eq__()" and "__hash__()" ' ++ 'methods by\n' ++ ' default; with them, all objects compare unequal (except ' ++ 'with\n' ++ ' themselves) and "x.__hash__()" returns an appropriate ' ++ 'value such\n' ++ ' that "x == y" implies both that "x is y" and "hash(x) ' ++ '== hash(y)".\n' ++ '\n' ++ ' A class that overrides "__eq__()" and does not define ' ++ '"__hash__()"\n' ++ ' will have its "__hash__()" implicitly set to "None". ' ++ 'When the\n' ++ ' "__hash__()" method of a class is "None", instances of ' ++ 'the class\n' ++ ' will raise an appropriate "TypeError" when a program ' ++ 'attempts to\n' ++ ' retrieve their hash value, and will also be correctly ' ++ 'identified as\n' ++ ' unhashable when checking "isinstance(obj, ' ++ 'collections.Hashable").\n' ++ '\n' ++ ' If a class that overrides "__eq__()" needs to retain ' ++ 'the\n' ++ ' implementation of "__hash__()" from a parent class, the ' ++ 'interpreter\n' ++ ' must be told this explicitly by setting "__hash__ =\n' ++ ' .__hash__".\n' ++ '\n' ++ ' If a class that does not override "__eq__()" wishes to ' ++ 'suppress\n' ++ ' hash support, it should include "__hash__ = None" in ' ++ 'the class\n' ++ ' definition. A class which defines its own "__hash__()" ' ++ 'that\n' ++ ' explicitly raises a "TypeError" would be incorrectly ' ++ 'identified as\n' ++ ' hashable by an "isinstance(obj, collections.Hashable)" ' ++ 'call.\n' ++ '\n' ++ ' Note: By default, the "__hash__()" values of str, bytes ' ++ 'and\n' ++ ' datetime objects are "salted" with an unpredictable ' ++ 'random value.\n' ++ ' Although they remain constant within an individual ' ++ 'Python\n' ++ ' process, they are not predictable between repeated ' ++ 'invocations of\n' ++ ' Python.This is intended to provide protection against ' ++ 'a denial-\n' ++ ' of-service caused by carefully-chosen inputs that ' ++ 'exploit the\n' ++ ' worst case performance of a dict insertion, O(n^2) ' ++ 'complexity.\n' ++ ' See ' ++ 'http://www.ocert.org/advisories/ocert-2011-003.html for\n' ++ ' details.Changing hash values affects the iteration ' ++ 'order of\n' ++ ' dicts, sets and other mappings. Python has never ' ++ 'made guarantees\n' ++ ' about this ordering (and it typically varies between ' ++ '32-bit and\n' ++ ' 64-bit builds).See also "PYTHONHASHSEED".\n' ++ '\n' ++ ' Changed in version 3.3: Hash randomization is enabled ' ++ 'by default.\n' ++ '\n' ++ 'object.__bool__(self)\n' ++ '\n' ++ ' Called to implement truth value testing and the ' ++ 'built-in operation\n' ++ ' "bool()"; should return "False" or "True". When this ' ++ 'method is not\n' ++ ' defined, "__len__()" is called, if it is defined, and ' ++ 'the object is\n' ++ ' considered true if its result is nonzero. If a class ' ++ 'defines\n' ++ ' neither "__len__()" nor "__bool__()", all its instances ' ++ 'are\n' ++ ' considered true.\n' ++ '\n' ++ '\n' ++ 'Customizing attribute access\n' ++ '============================\n' ++ '\n' ++ 'The following methods can be defined to customize the ' ++ 'meaning of\n' ++ 'attribute access (use of, assignment to, or deletion of ' ++ '"x.name") for\n' ++ 'class instances.\n' ++ '\n' ++ 'object.__getattr__(self, name)\n' ++ '\n' ++ ' Called when an attribute lookup has not found the ' ++ 'attribute in the\n' ++ ' usual places (i.e. it is not an instance attribute nor ' ++ 'is it found\n' ++ ' in the class tree for "self"). "name" is the attribute ' ++ 'name. This\n' ++ ' method should return the (computed) attribute value or ' ++ 'raise an\n' ++ ' "AttributeError" exception.\n' ++ '\n' ++ ' Note that if the attribute is found through the normal ' ++ 'mechanism,\n' ++ ' "__getattr__()" is not called. (This is an intentional ' ++ 'asymmetry\n' ++ ' between "__getattr__()" and "__setattr__()".) This is ' ++ 'done both for\n' ++ ' efficiency reasons and because otherwise ' ++ '"__getattr__()" would have\n' ++ ' no way to access other attributes of the instance. ' ++ 'Note that at\n' ++ ' least for instance variables, you can fake total ' ++ 'control by not\n' ++ ' inserting any values in the instance attribute ' ++ 'dictionary (but\n' ++ ' instead inserting them in another object). See the\n' ++ ' "__getattribute__()" method below for a way to actually ' ++ 'get total\n' ++ ' control over attribute access.\n' ++ '\n' ++ 'object.__getattribute__(self, name)\n' ++ '\n' ++ ' Called unconditionally to implement attribute accesses ' ++ 'for\n' ++ ' instances of the class. If the class also defines ' ++ '"__getattr__()",\n' ++ ' the latter will not be called unless ' ++ '"__getattribute__()" either\n' ++ ' calls it explicitly or raises an "AttributeError". This ' ++ 'method\n' ++ ' should return the (computed) attribute value or raise ' ++ 'an\n' ++ ' "AttributeError" exception. In order to avoid infinite ' ++ 'recursion in\n' ++ ' this method, its implementation should always call the ' ++ 'base class\n' ++ ' method with the same name to access any attributes it ' ++ 'needs, for\n' ++ ' example, "object.__getattribute__(self, name)".\n' ++ '\n' ++ ' Note: This method may still be bypassed when looking up ' ++ 'special\n' ++ ' methods as the result of implicit invocation via ' ++ 'language syntax\n' ++ ' or built-in functions. See *Special method lookup*.\n' ++ '\n' ++ 'object.__setattr__(self, name, value)\n' ++ '\n' ++ ' Called when an attribute assignment is attempted. This ' ++ 'is called\n' ++ ' instead of the normal mechanism (i.e. store the value ' ++ 'in the\n' ++ ' instance dictionary). *name* is the attribute name, ' ++ '*value* is the\n' ++ ' value to be assigned to it.\n' ++ '\n' ++ ' If "__setattr__()" wants to assign to an instance ' ++ 'attribute, it\n' ++ ' should call the base class method with the same name, ' ++ 'for example,\n' ++ ' "object.__setattr__(self, name, value)".\n' ++ '\n' ++ 'object.__delattr__(self, name)\n' ++ '\n' ++ ' Like "__setattr__()" but for attribute deletion instead ' ++ 'of\n' ++ ' assignment. This should only be implemented if "del ' ++ 'obj.name" is\n' ++ ' meaningful for the object.\n' ++ '\n' ++ 'object.__dir__(self)\n' ++ '\n' ++ ' Called when "dir()" is called on the object. A sequence ' ++ 'must be\n' ++ ' returned. "dir()" converts the returned sequence to a ' ++ 'list and\n' ++ ' sorts it.\n' ++ '\n' ++ '\n' ++ 'Implementing Descriptors\n' ++ '------------------------\n' ++ '\n' ++ 'The following methods only apply when an instance of the ' ++ 'class\n' ++ 'containing the method (a so-called *descriptor* class) ' ++ 'appears in an\n' ++ '*owner* class (the descriptor must be in either the ' ++ "owner's class\n" ++ 'dictionary or in the class dictionary for one of its ' ++ 'parents). In the\n' ++ 'examples below, "the attribute" refers to the attribute ' ++ 'whose name is\n' ++ 'the key of the property in the owner class\' "__dict__".\n' ++ '\n' ++ 'object.__get__(self, instance, owner)\n' ++ '\n' ++ ' Called to get the attribute of the owner class (class ' ++ 'attribute\n' ++ ' access) or of an instance of that class (instance ' ++ 'attribute\n' ++ ' access). *owner* is always the owner class, while ' ++ '*instance* is the\n' ++ ' instance that the attribute was accessed through, or ' ++ '"None" when\n' ++ ' the attribute is accessed through the *owner*. This ' ++ 'method should\n' ++ ' return the (computed) attribute value or raise an ' ++ '"AttributeError"\n' ++ ' exception.\n' ++ '\n' ++ 'object.__set__(self, instance, value)\n' ++ '\n' ++ ' Called to set the attribute on an instance *instance* ' ++ 'of the owner\n' ++ ' class to a new value, *value*.\n' ++ '\n' ++ 'object.__delete__(self, instance)\n' ++ '\n' ++ ' Called to delete the attribute on an instance ' ++ '*instance* of the\n' ++ ' owner class.\n' ++ '\n' ++ 'The attribute "__objclass__" is interpreted by the ' ++ '"inspect" module as\n' ++ 'specifying the class where this object was defined ' ++ '(setting this\n' ++ 'appropriately can assist in runtime introspection of ' ++ 'dynamic class\n' ++ 'attributes). For callables, it may indicate that an ' ++ 'instance of the\n' ++ 'given type (or a subclass) is expected or required as the ' ++ 'first\n' ++ 'positional argument (for example, CPython sets this ' ++ 'attribute for\n' ++ 'unbound methods that are implemented in C).\n' ++ '\n' ++ '\n' ++ 'Invoking Descriptors\n' ++ '--------------------\n' ++ '\n' ++ 'In general, a descriptor is an object attribute with ' ++ '"binding\n' ++ 'behavior", one whose attribute access has been overridden ' ++ 'by methods\n' ++ 'in the descriptor protocol: "__get__()", "__set__()", ' ++ 'and\n' ++ '"__delete__()". If any of those methods are defined for an ' ++ 'object, it\n' ++ 'is said to be a descriptor.\n' ++ '\n' ++ 'The default behavior for attribute access is to get, set, ' ++ 'or delete\n' ++ "the attribute from an object's dictionary. For instance, " ++ '"a.x" has a\n' ++ 'lookup chain starting with "a.__dict__[\'x\']", then\n' ++ '"type(a).__dict__[\'x\']", and continuing through the base ' ++ 'classes of\n' ++ '"type(a)" excluding metaclasses.\n' ++ '\n' ++ 'However, if the looked-up value is an object defining one ' ++ 'of the\n' ++ 'descriptor methods, then Python may override the default ' ++ 'behavior and\n' ++ 'invoke the descriptor method instead. Where this occurs ' ++ 'in the\n' ++ 'precedence chain depends on which descriptor methods were ' ++ 'defined and\n' ++ 'how they were called.\n' ++ '\n' ++ 'The starting point for descriptor invocation is a binding, ' ++ '"a.x". How\n' ++ 'the arguments are assembled depends on "a":\n' ++ '\n' ++ 'Direct Call\n' ++ ' The simplest and least common call is when user code ' ++ 'directly\n' ++ ' invokes a descriptor method: "x.__get__(a)".\n' ++ '\n' ++ 'Instance Binding\n' ++ ' If binding to an object instance, "a.x" is transformed ' ++ 'into the\n' ++ ' call: "type(a).__dict__[\'x\'].__get__(a, type(a))".\n' ++ '\n' ++ 'Class Binding\n' ++ ' If binding to a class, "A.x" is transformed into the ' ++ 'call:\n' ++ ' "A.__dict__[\'x\'].__get__(None, A)".\n' ++ '\n' ++ 'Super Binding\n' ++ ' If "a" is an instance of "super", then the binding ' ++ '"super(B,\n' ++ ' obj).m()" searches "obj.__class__.__mro__" for the base ' ++ 'class "A"\n' ++ ' immediately preceding "B" and then invokes the ' ++ 'descriptor with the\n' ++ ' call: "A.__dict__[\'m\'].__get__(obj, obj.__class__)".\n' ++ '\n' ++ 'For instance bindings, the precedence of descriptor ' ++ 'invocation depends\n' ++ 'on the which descriptor methods are defined. A descriptor ' ++ 'can define\n' ++ 'any combination of "__get__()", "__set__()" and ' ++ '"__delete__()". If it\n' ++ 'does not define "__get__()", then accessing the attribute ' ++ 'will return\n' ++ 'the descriptor object itself unless there is a value in ' ++ "the object's\n" ++ 'instance dictionary. If the descriptor defines ' ++ '"__set__()" and/or\n' ++ '"__delete__()", it is a data descriptor; if it defines ' ++ 'neither, it is\n' ++ 'a non-data descriptor. Normally, data descriptors define ' ++ 'both\n' ++ '"__get__()" and "__set__()", while non-data descriptors ' ++ 'have just the\n' ++ '"__get__()" method. Data descriptors with "__set__()" and ' ++ '"__get__()"\n' ++ 'defined always override a redefinition in an instance ' ++ 'dictionary. In\n' ++ 'contrast, non-data descriptors can be overridden by ' ++ 'instances.\n' ++ '\n' ++ 'Python methods (including "staticmethod()" and ' ++ '"classmethod()") are\n' ++ 'implemented as non-data descriptors. Accordingly, ' ++ 'instances can\n' ++ 'redefine and override methods. This allows individual ' ++ 'instances to\n' ++ 'acquire behaviors that differ from other instances of the ' ++ 'same class.\n' ++ '\n' ++ 'The "property()" function is implemented as a data ' ++ 'descriptor.\n' ++ 'Accordingly, instances cannot override the behavior of a ' ++ 'property.\n' ++ '\n' ++ '\n' ++ '__slots__\n' ++ '---------\n' ++ '\n' ++ 'By default, instances of classes have a dictionary for ' ++ 'attribute\n' ++ 'storage. This wastes space for objects having very few ' ++ 'instance\n' ++ 'variables. The space consumption can become acute when ' ++ 'creating large\n' ++ 'numbers of instances.\n' ++ '\n' ++ 'The default can be overridden by defining *__slots__* in a ' ++ 'class\n' ++ 'definition. The *__slots__* declaration takes a sequence ' ++ 'of instance\n' ++ 'variables and reserves just enough space in each instance ' ++ 'to hold a\n' ++ 'value for each variable. Space is saved because ' ++ '*__dict__* is not\n' ++ 'created for each instance.\n' ++ '\n' ++ 'object.__slots__\n' ++ '\n' ++ ' This class variable can be assigned a string, iterable, ' ++ 'or sequence\n' ++ ' of strings with variable names used by instances. If ' ++ 'defined in a\n' ++ ' class, *__slots__* reserves space for the declared ' ++ 'variables and\n' ++ ' prevents the automatic creation of *__dict__* and ' ++ '*__weakref__* for\n' ++ ' each instance.\n' ++ '\n' ++ '\n' ++ 'Notes on using *__slots__*\n' ++ '~~~~~~~~~~~~~~~~~~~~~~~~~~\n' ++ '\n' ++ '* When inheriting from a class without *__slots__*, the ' ++ '*__dict__*\n' ++ ' attribute of that class will always be accessible, so a ' ++ '*__slots__*\n' ++ ' definition in the subclass is meaningless.\n' ++ '\n' ++ '* Without a *__dict__* variable, instances cannot be ' ++ 'assigned new\n' ++ ' variables not listed in the *__slots__* definition. ' ++ 'Attempts to\n' ++ ' assign to an unlisted variable name raises ' ++ '"AttributeError". If\n' ++ ' dynamic assignment of new variables is desired, then ' ++ 'add\n' ++ ' "\'__dict__\'" to the sequence of strings in the ' ++ '*__slots__*\n' ++ ' declaration.\n' ++ '\n' ++ '* Without a *__weakref__* variable for each instance, ' ++ 'classes\n' ++ ' defining *__slots__* do not support weak references to ' ++ 'its\n' ++ ' instances. If weak reference support is needed, then ' ++ 'add\n' ++ ' "\'__weakref__\'" to the sequence of strings in the ' ++ '*__slots__*\n' ++ ' declaration.\n' ++ '\n' ++ '* *__slots__* are implemented at the class level by ' ++ 'creating\n' ++ ' descriptors (*Implementing Descriptors*) for each ' ++ 'variable name. As\n' ++ ' a result, class attributes cannot be used to set default ' ++ 'values for\n' ++ ' instance variables defined by *__slots__*; otherwise, ' ++ 'the class\n' ++ ' attribute would overwrite the descriptor assignment.\n' ++ '\n' ++ '* The action of a *__slots__* declaration is limited to ' ++ 'the class\n' ++ ' where it is defined. As a result, subclasses will have ' ++ 'a *__dict__*\n' ++ ' unless they also define *__slots__* (which must only ' ++ 'contain names\n' ++ ' of any *additional* slots).\n' ++ '\n' ++ '* If a class defines a slot also defined in a base class, ' ++ 'the\n' ++ ' instance variable defined by the base class slot is ' ++ 'inaccessible\n' ++ ' (except by retrieving its descriptor directly from the ' ++ 'base class).\n' ++ ' This renders the meaning of the program undefined. In ' ++ 'the future, a\n' ++ ' check may be added to prevent this.\n' ++ '\n' ++ '* Nonempty *__slots__* does not work for classes derived ' ++ 'from\n' ++ ' "variable-length" built-in types such as "int", "bytes" ' ++ 'and "tuple".\n' ++ '\n' ++ '* Any non-string iterable may be assigned to *__slots__*. ' ++ 'Mappings\n' ++ ' may also be used; however, in the future, special ' ++ 'meaning may be\n' ++ ' assigned to the values corresponding to each key.\n' ++ '\n' ++ '* *__class__* assignment works only if both classes have ' ++ 'the same\n' ++ ' *__slots__*.\n' ++ '\n' ++ '\n' ++ 'Customizing class creation\n' ++ '==========================\n' ++ '\n' ++ 'By default, classes are constructed using "type()". The ' ++ 'class body is\n' ++ 'executed in a new namespace and the class name is bound ' ++ 'locally to the\n' ++ 'result of "type(name, bases, namespace)".\n' ++ '\n' ++ 'The class creation process can be customised by passing ' ++ 'the\n' ++ '"metaclass" keyword argument in the class definition line, ' ++ 'or by\n' ++ 'inheriting from an existing class that included such an ' ++ 'argument. In\n' ++ 'the following example, both "MyClass" and "MySubclass" are ' ++ 'instances\n' ++ 'of "Meta":\n' ++ '\n' ++ ' class Meta(type):\n' ++ ' pass\n' ++ '\n' ++ ' class MyClass(metaclass=Meta):\n' ++ ' pass\n' ++ '\n' ++ ' class MySubclass(MyClass):\n' ++ ' pass\n' ++ '\n' ++ 'Any other keyword arguments that are specified in the ' ++ 'class definition\n' ++ 'are passed through to all metaclass operations described ' ++ 'below.\n' ++ '\n' ++ 'When a class definition is executed, the following steps ' ++ 'occur:\n' ++ '\n' ++ '* the appropriate metaclass is determined\n' ++ '\n' ++ '* the class namespace is prepared\n' ++ '\n' ++ '* the class body is executed\n' ++ '\n' ++ '* the class object is created\n' ++ '\n' ++ '\n' ++ 'Determining the appropriate metaclass\n' ++ '-------------------------------------\n' ++ '\n' ++ 'The appropriate metaclass for a class definition is ' ++ 'determined as\n' ++ 'follows:\n' ++ '\n' ++ '* if no bases and no explicit metaclass are given, then ' ++ '"type()" is\n' ++ ' used\n' ++ '\n' ++ '* if an explicit metaclass is given and it is *not* an ' ++ 'instance of\n' ++ ' "type()", then it is used directly as the metaclass\n' ++ '\n' ++ '* if an instance of "type()" is given as the explicit ' ++ 'metaclass, or\n' ++ ' bases are defined, then the most derived metaclass is ' ++ 'used\n' ++ '\n' ++ 'The most derived metaclass is selected from the explicitly ' ++ 'specified\n' ++ 'metaclass (if any) and the metaclasses (i.e. "type(cls)") ' ++ 'of all\n' ++ 'specified base classes. The most derived metaclass is one ' ++ 'which is a\n' ++ 'subtype of *all* of these candidate metaclasses. If none ' ++ 'of the\n' ++ 'candidate metaclasses meets that criterion, then the class ' ++ 'definition\n' ++ 'will fail with "TypeError".\n' ++ '\n' ++ '\n' ++ 'Preparing the class namespace\n' ++ '-----------------------------\n' ++ '\n' ++ 'Once the appropriate metaclass has been identified, then ' ++ 'the class\n' ++ 'namespace is prepared. If the metaclass has a ' ++ '"__prepare__" attribute,\n' ++ 'it is called as "namespace = metaclass.__prepare__(name, ' ++ 'bases,\n' ++ '**kwds)" (where the additional keyword arguments, if any, ' ++ 'come from\n' ++ 'the class definition).\n' ++ '\n' ++ 'If the metaclass has no "__prepare__" attribute, then the ' ++ 'class\n' ++ 'namespace is initialised as an empty "dict()" instance.\n' ++ '\n' ++ 'See also: **PEP 3115** - Metaclasses in Python 3000\n' ++ '\n' ++ ' Introduced the "__prepare__" namespace hook\n' ++ '\n' ++ '\n' ++ 'Executing the class body\n' ++ '------------------------\n' ++ '\n' ++ 'The class body is executed (approximately) as "exec(body, ' ++ 'globals(),\n' ++ 'namespace)". The key difference from a normal call to ' ++ '"exec()" is that\n' ++ 'lexical scoping allows the class body (including any ' ++ 'methods) to\n' ++ 'reference names from the current and outer scopes when the ' ++ 'class\n' ++ 'definition occurs inside a function.\n' ++ '\n' ++ 'However, even when the class definition occurs inside the ' ++ 'function,\n' ++ 'methods defined inside the class still cannot see names ' ++ 'defined at the\n' ++ 'class scope. Class variables must be accessed through the ' ++ 'first\n' ++ 'parameter of instance or class methods, and cannot be ' ++ 'accessed at all\n' ++ 'from static methods.\n' ++ '\n' ++ '\n' ++ 'Creating the class object\n' ++ '-------------------------\n' ++ '\n' ++ 'Once the class namespace has been populated by executing ' ++ 'the class\n' ++ 'body, the class object is created by calling ' ++ '"metaclass(name, bases,\n' ++ 'namespace, **kwds)" (the additional keywords passed here ' ++ 'are the same\n' ++ 'as those passed to "__prepare__").\n' ++ '\n' ++ 'This class object is the one that will be referenced by ' ++ 'the zero-\n' ++ 'argument form of "super()". "__class__" is an implicit ' ++ 'closure\n' ++ 'reference created by the compiler if any methods in a ' ++ 'class body refer\n' ++ 'to either "__class__" or "super". This allows the zero ' ++ 'argument form\n' ++ 'of "super()" to correctly identify the class being defined ' ++ 'based on\n' ++ 'lexical scoping, while the class or instance that was used ' ++ 'to make the\n' ++ 'current call is identified based on the first argument ' ++ 'passed to the\n' ++ 'method.\n' ++ '\n' ++ 'After the class object is created, it is passed to the ' ++ 'class\n' ++ 'decorators included in the class definition (if any) and ' ++ 'the resulting\n' ++ 'object is bound in the local namespace as the defined ' ++ 'class.\n' ++ '\n' ++ 'See also: **PEP 3135** - New super\n' ++ '\n' ++ ' Describes the implicit "__class__" closure reference\n' ++ '\n' ++ '\n' ++ 'Metaclass example\n' ++ '-----------------\n' ++ '\n' ++ 'The potential uses for metaclasses are boundless. Some ' ++ 'ideas that have\n' ++ 'been explored include logging, interface checking, ' ++ 'automatic\n' ++ 'delegation, automatic property creation, proxies, ' ++ 'frameworks, and\n' ++ 'automatic resource locking/synchronization.\n' ++ '\n' ++ 'Here is an example of a metaclass that uses an\n' ++ '"collections.OrderedDict" to remember the order that class ' ++ 'variables\n' ++ 'are defined:\n' ++ '\n' ++ ' class OrderedClass(type):\n' ++ '\n' ++ ' @classmethod\n' ++ ' def __prepare__(metacls, name, bases, **kwds):\n' ++ ' return collections.OrderedDict()\n' ++ '\n' ++ ' def __new__(cls, name, bases, namespace, **kwds):\n' ++ ' result = type.__new__(cls, name, bases, ' ++ 'dict(namespace))\n' ++ ' result.members = tuple(namespace)\n' ++ ' return result\n' ++ '\n' ++ ' class A(metaclass=OrderedClass):\n' ++ ' def one(self): pass\n' ++ ' def two(self): pass\n' ++ ' def three(self): pass\n' ++ ' def four(self): pass\n' ++ '\n' ++ ' >>> A.members\n' ++ " ('__module__', 'one', 'two', 'three', 'four')\n" ++ '\n' ++ 'When the class definition for *A* gets executed, the ' ++ 'process begins\n' ++ 'with calling the metaclass\'s "__prepare__()" method which ' ++ 'returns an\n' ++ 'empty "collections.OrderedDict". That mapping records the ' ++ 'methods and\n' ++ 'attributes of *A* as they are defined within the body of ' ++ 'the class\n' ++ 'statement. Once those definitions are executed, the ' ++ 'ordered dictionary\n' ++ 'is fully populated and the metaclass\'s "__new__()" method ' ++ 'gets\n' ++ 'invoked. That method builds the new type and it saves the ' ++ 'ordered\n' ++ 'dictionary keys in an attribute called "members".\n' ++ '\n' ++ '\n' ++ 'Customizing instance and subclass checks\n' ++ '========================================\n' ++ '\n' ++ 'The following methods are used to override the default ' ++ 'behavior of the\n' ++ '"isinstance()" and "issubclass()" built-in functions.\n' ++ '\n' ++ 'In particular, the metaclass "abc.ABCMeta" implements ' ++ 'these methods in\n' ++ 'order to allow the addition of Abstract Base Classes ' ++ '(ABCs) as\n' ++ '"virtual base classes" to any class or type (including ' ++ 'built-in\n' ++ 'types), including other ABCs.\n' ++ '\n' ++ 'class.__instancecheck__(self, instance)\n' ++ '\n' ++ ' Return true if *instance* should be considered a ' ++ '(direct or\n' ++ ' indirect) instance of *class*. If defined, called to ' ++ 'implement\n' ++ ' "isinstance(instance, class)".\n' ++ '\n' ++ 'class.__subclasscheck__(self, subclass)\n' ++ '\n' ++ ' Return true if *subclass* should be considered a ' ++ '(direct or\n' ++ ' indirect) subclass of *class*. If defined, called to ' ++ 'implement\n' ++ ' "issubclass(subclass, class)".\n' ++ '\n' ++ 'Note that these methods are looked up on the type ' ++ '(metaclass) of a\n' ++ 'class. They cannot be defined as class methods in the ' ++ 'actual class.\n' ++ 'This is consistent with the lookup of special methods that ' ++ 'are called\n' ++ 'on instances, only in this case the instance is itself a ' ++ 'class.\n' ++ '\n' ++ 'See also: **PEP 3119** - Introducing Abstract Base ' ++ 'Classes\n' ++ '\n' ++ ' Includes the specification for customizing ' ++ '"isinstance()" and\n' ++ ' "issubclass()" behavior through "__instancecheck__()" ' ++ 'and\n' ++ ' "__subclasscheck__()", with motivation for this ' ++ 'functionality in\n' ++ ' the context of adding Abstract Base Classes (see the ' ++ '"abc"\n' ++ ' module) to the language.\n' ++ '\n' ++ '\n' ++ 'Emulating callable objects\n' ++ '==========================\n' ++ '\n' ++ 'object.__call__(self[, args...])\n' ++ '\n' ++ ' Called when the instance is "called" as a function; if ' ++ 'this method\n' ++ ' is defined, "x(arg1, arg2, ...)" is a shorthand for\n' ++ ' "x.__call__(arg1, arg2, ...)".\n' ++ '\n' ++ '\n' ++ 'Emulating container types\n' ++ '=========================\n' ++ '\n' ++ 'The following methods can be defined to implement ' ++ 'container objects.\n' ++ 'Containers usually are sequences (such as lists or tuples) ' ++ 'or mappings\n' ++ '(like dictionaries), but can represent other containers as ' ++ 'well. The\n' ++ 'first set of methods is used either to emulate a sequence ' ++ 'or to\n' ++ 'emulate a mapping; the difference is that for a sequence, ' ++ 'the\n' ++ 'allowable keys should be the integers *k* for which "0 <= ' ++ 'k < N" where\n' ++ '*N* is the length of the sequence, or slice objects, which ' ++ 'define a\n' ++ 'range of items. It is also recommended that mappings ' ++ 'provide the\n' ++ 'methods "keys()", "values()", "items()", "get()", ' ++ '"clear()",\n' ++ '"setdefault()", "pop()", "popitem()", "copy()", and ' ++ '"update()"\n' ++ "behaving similar to those for Python's standard dictionary " ++ 'objects.\n' ++ 'The "collections" module provides a "MutableMapping" ' ++ 'abstract base\n' ++ 'class to help create those methods from a base set of ' ++ '"__getitem__()",\n' ++ '"__setitem__()", "__delitem__()", and "keys()". Mutable ' ++ 'sequences\n' ++ 'should provide methods "append()", "count()", "index()", ' ++ '"extend()",\n' ++ '"insert()", "pop()", "remove()", "reverse()" and "sort()", ' ++ 'like Python\n' ++ 'standard list objects. Finally, sequence types should ' ++ 'implement\n' ++ 'addition (meaning concatenation) and multiplication ' ++ '(meaning\n' ++ 'repetition) by defining the methods "__add__()", ' ++ '"__radd__()",\n' ++ '"__iadd__()", "__mul__()", "__rmul__()" and "__imul__()" ' ++ 'described\n' ++ 'below; they should not define other numerical operators. ' ++ 'It is\n' ++ 'recommended that both mappings and sequences implement ' ++ 'the\n' ++ '"__contains__()" method to allow efficient use of the "in" ' ++ 'operator;\n' ++ 'for mappings, "in" should search the mapping\'s keys; for ' ++ 'sequences, it\n' ++ 'should search through the values. It is further ' ++ 'recommended that both\n' ++ 'mappings and sequences implement the "__iter__()" method ' ++ 'to allow\n' ++ 'efficient iteration through the container; for mappings, ' ++ '"__iter__()"\n' ++ 'should be the same as "keys()"; for sequences, it should ' ++ 'iterate\n' ++ 'through the values.\n' ++ '\n' ++ 'object.__len__(self)\n' ++ '\n' ++ ' Called to implement the built-in function "len()". ' ++ 'Should return\n' ++ ' the length of the object, an integer ">=" 0. Also, an ' ++ 'object that\n' ++ ' doesn\'t define a "__bool__()" method and whose ' ++ '"__len__()" method\n' ++ ' returns zero is considered to be false in a Boolean ' ++ 'context.\n' ++ '\n' ++ 'object.__length_hint__(self)\n' ++ '\n' ++ ' Called to implement "operator.length_hint()". Should ' ++ 'return an\n' ++ ' estimated length for the object (which may be greater ' ++ 'or less than\n' ++ ' the actual length). The length must be an integer ">=" ' ++ '0. This\n' ++ ' method is purely an optimization and is never required ' ++ 'for\n' ++ ' correctness.\n' ++ '\n' ++ ' New in version 3.4.\n' ++ '\n' ++ 'Note: Slicing is done exclusively with the following three ' ++ 'methods.\n' ++ ' A call like\n' ++ '\n' ++ ' a[1:2] = b\n' ++ '\n' ++ ' is translated to\n' ++ '\n' ++ ' a[slice(1, 2, None)] = b\n' ++ '\n' ++ ' and so forth. Missing slice items are always filled in ' ++ 'with "None".\n' ++ '\n' ++ 'object.__getitem__(self, key)\n' ++ '\n' ++ ' Called to implement evaluation of "self[key]". For ' ++ 'sequence types,\n' ++ ' the accepted keys should be integers and slice ' ++ 'objects. Note that\n' ++ ' the special interpretation of negative indexes (if the ' ++ 'class wishes\n' ++ ' to emulate a sequence type) is up to the ' ++ '"__getitem__()" method. If\n' ++ ' *key* is of an inappropriate type, "TypeError" may be ' ++ 'raised; if of\n' ++ ' a value outside the set of indexes for the sequence ' ++ '(after any\n' ++ ' special interpretation of negative values), ' ++ '"IndexError" should be\n' ++ ' raised. For mapping types, if *key* is missing (not in ' ++ 'the\n' ++ ' container), "KeyError" should be raised.\n' ++ '\n' ++ ' Note: "for" loops expect that an "IndexError" will be ' ++ 'raised for\n' ++ ' illegal indexes to allow proper detection of the end ' ++ 'of the\n' ++ ' sequence.\n' ++ '\n' ++ 'object.__setitem__(self, key, value)\n' ++ '\n' ++ ' Called to implement assignment to "self[key]". Same ' ++ 'note as for\n' ++ ' "__getitem__()". This should only be implemented for ' ++ 'mappings if\n' ++ ' the objects support changes to the values for keys, or ' ++ 'if new keys\n' ++ ' can be added, or for sequences if elements can be ' ++ 'replaced. The\n' ++ ' same exceptions should be raised for improper *key* ' ++ 'values as for\n' ++ ' the "__getitem__()" method.\n' ++ '\n' ++ 'object.__delitem__(self, key)\n' ++ '\n' ++ ' Called to implement deletion of "self[key]". Same note ' ++ 'as for\n' ++ ' "__getitem__()". This should only be implemented for ' ++ 'mappings if\n' ++ ' the objects support removal of keys, or for sequences ' ++ 'if elements\n' ++ ' can be removed from the sequence. The same exceptions ' ++ 'should be\n' ++ ' raised for improper *key* values as for the ' ++ '"__getitem__()" method.\n' ++ '\n' ++ 'object.__iter__(self)\n' ++ '\n' ++ ' This method is called when an iterator is required for ' ++ 'a container.\n' ++ ' This method should return a new iterator object that ' ++ 'can iterate\n' ++ ' over all the objects in the container. For mappings, ' ++ 'it should\n' ++ ' iterate over the keys of the container, and should also ' ++ 'be made\n' ++ ' available as the method "keys()".\n' ++ '\n' ++ ' Iterator objects also need to implement this method; ' ++ 'they are\n' ++ ' required to return themselves. For more information on ' ++ 'iterator\n' ++ ' objects, see *Iterator Types*.\n' ++ '\n' ++ 'object.__reversed__(self)\n' ++ '\n' ++ ' Called (if present) by the "reversed()" built-in to ' ++ 'implement\n' ++ ' reverse iteration. It should return a new iterator ' ++ 'object that\n' ++ ' iterates over all the objects in the container in ' ++ 'reverse order.\n' ++ '\n' ++ ' If the "__reversed__()" method is not provided, the ' ++ '"reversed()"\n' ++ ' built-in will fall back to using the sequence protocol ' ++ '("__len__()"\n' ++ ' and "__getitem__()"). Objects that support the ' ++ 'sequence protocol\n' ++ ' should only provide "__reversed__()" if they can ' ++ 'provide an\n' ++ ' implementation that is more efficient than the one ' ++ 'provided by\n' ++ ' "reversed()".\n' ++ '\n' ++ 'The membership test operators ("in" and "not in") are ' ++ 'normally\n' ++ 'implemented as an iteration through a sequence. However, ' ++ 'container\n' ++ 'objects can supply the following special method with a ' ++ 'more efficient\n' ++ 'implementation, which also does not require the object be ' ++ 'a sequence.\n' ++ '\n' ++ 'object.__contains__(self, item)\n' ++ '\n' ++ ' Called to implement membership test operators. Should ' ++ 'return true\n' ++ ' if *item* is in *self*, false otherwise. For mapping ' ++ 'objects, this\n' ++ ' should consider the keys of the mapping rather than the ' ++ 'values or\n' ++ ' the key-item pairs.\n' ++ '\n' ++ ' For objects that don\'t define "__contains__()", the ' ++ 'membership test\n' ++ ' first tries iteration via "__iter__()", then the old ' ++ 'sequence\n' ++ ' iteration protocol via "__getitem__()", see *this ' ++ 'section in the\n' ++ ' language reference*.\n' ++ '\n' ++ '\n' ++ 'Emulating numeric types\n' ++ '=======================\n' ++ '\n' ++ 'The following methods can be defined to emulate numeric ' ++ 'objects.\n' ++ 'Methods corresponding to operations that are not supported ' ++ 'by the\n' ++ 'particular kind of number implemented (e.g., bitwise ' ++ 'operations for\n' ++ 'non-integral numbers) should be left undefined.\n' ++ '\n' ++ 'object.__add__(self, other)\n' ++ 'object.__sub__(self, other)\n' ++ 'object.__mul__(self, other)\n' ++ 'object.__truediv__(self, other)\n' ++ 'object.__floordiv__(self, other)\n' ++ 'object.__mod__(self, other)\n' ++ 'object.__divmod__(self, other)\n' ++ 'object.__pow__(self, other[, modulo])\n' ++ 'object.__lshift__(self, other)\n' ++ 'object.__rshift__(self, other)\n' ++ 'object.__and__(self, other)\n' ++ 'object.__xor__(self, other)\n' ++ 'object.__or__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the binary ' ++ 'arithmetic\n' ++ ' operations ("+", "-", "*", "/", "//", "%", "divmod()", ' ++ '"pow()",\n' ++ ' "**", "<<", ">>", "&", "^", "|"). For instance, to ' ++ 'evaluate the\n' ++ ' expression "x + y", where *x* is an instance of a class ' ++ 'that has an\n' ++ ' "__add__()" method, "x.__add__(y)" is called. The ' ++ '"__divmod__()"\n' ++ ' method should be the equivalent to using ' ++ '"__floordiv__()" and\n' ++ ' "__mod__()"; it should not be related to ' ++ '"__truediv__()". Note\n' ++ ' that "__pow__()" should be defined to accept an ' ++ 'optional third\n' ++ ' argument if the ternary version of the built-in "pow()" ' ++ 'function is\n' ++ ' to be supported.\n' ++ '\n' ++ ' If one of those methods does not support the operation ' ++ 'with the\n' ++ ' supplied arguments, it should return "NotImplemented".\n' ++ '\n' ++ 'object.__radd__(self, other)\n' ++ 'object.__rsub__(self, other)\n' ++ 'object.__rmul__(self, other)\n' ++ 'object.__rtruediv__(self, other)\n' ++ 'object.__rfloordiv__(self, other)\n' ++ 'object.__rmod__(self, other)\n' ++ 'object.__rdivmod__(self, other)\n' ++ 'object.__rpow__(self, other)\n' ++ 'object.__rlshift__(self, other)\n' ++ 'object.__rrshift__(self, other)\n' ++ 'object.__rand__(self, other)\n' ++ 'object.__rxor__(self, other)\n' ++ 'object.__ror__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the binary ' ++ 'arithmetic\n' ++ ' operations ("+", "-", "*", "/", "//", "%", "divmod()", ' ++ '"pow()",\n' ++ ' "**", "<<", ">>", "&", "^", "|") with reflected ' ++ '(swapped) operands.\n' ++ ' These functions are only called if the left operand ' ++ 'does not\n' ++ ' support the corresponding operation and the operands ' ++ 'are of\n' ++ ' different types. [2] For instance, to evaluate the ' ++ 'expression "x -\n' ++ ' y", where *y* is an instance of a class that has an ' ++ '"__rsub__()"\n' ++ ' method, "y.__rsub__(x)" is called if "x.__sub__(y)" ' ++ 'returns\n' ++ ' *NotImplemented*.\n' ++ '\n' ++ ' Note that ternary "pow()" will not try calling ' ++ '"__rpow__()" (the\n' ++ ' coercion rules would become too complicated).\n' ++ '\n' ++ " Note: If the right operand's type is a subclass of the " ++ 'left\n' ++ " operand's type and that subclass provides the " ++ 'reflected method\n' ++ ' for the operation, this method will be called before ' ++ 'the left\n' ++ " operand's non-reflected method. This behavior allows " ++ 'subclasses\n' ++ " to override their ancestors' operations.\n" ++ '\n' ++ 'object.__iadd__(self, other)\n' ++ 'object.__isub__(self, other)\n' ++ 'object.__imul__(self, other)\n' ++ 'object.__itruediv__(self, other)\n' ++ 'object.__ifloordiv__(self, other)\n' ++ 'object.__imod__(self, other)\n' ++ 'object.__ipow__(self, other[, modulo])\n' ++ 'object.__ilshift__(self, other)\n' ++ 'object.__irshift__(self, other)\n' ++ 'object.__iand__(self, other)\n' ++ 'object.__ixor__(self, other)\n' ++ 'object.__ior__(self, other)\n' ++ '\n' ++ ' These methods are called to implement the augmented ' ++ 'arithmetic\n' ++ ' assignments ("+=", "-=", "*=", "/=", "//=", "%=", ' ++ '"**=", "<<=",\n' ++ ' ">>=", "&=", "^=", "|="). These methods should attempt ' ++ 'to do the\n' ++ ' operation in-place (modifying *self*) and return the ' ++ 'result (which\n' ++ ' could be, but does not have to be, *self*). If a ' ++ 'specific method\n' ++ ' is not defined, the augmented assignment falls back to ' ++ 'the normal\n' ++ ' methods. For instance, if *x* is an instance of a ' ++ 'class with an\n' ++ ' "__iadd__()" method, "x += y" is equivalent to "x = ' ++ 'x.__iadd__(y)"\n' ++ ' . Otherwise, "x.__add__(y)" and "y.__radd__(x)" are ' ++ 'considered, as\n' ++ ' with the evaluation of "x + y". In certain situations, ' ++ 'augmented\n' ++ ' assignment can result in unexpected errors (see *Why ' ++ 'does\n' ++ " a_tuple[i] += ['item'] raise an exception when the " ++ 'addition\n' ++ ' works?*), but this behavior is in fact part of the data ' ++ 'model.\n' ++ '\n' ++ 'object.__neg__(self)\n' ++ 'object.__pos__(self)\n' ++ 'object.__abs__(self)\n' ++ 'object.__invert__(self)\n' ++ '\n' ++ ' Called to implement the unary arithmetic operations ' ++ '("-", "+",\n' ++ ' "abs()" and "~").\n' ++ '\n' ++ 'object.__complex__(self)\n' ++ 'object.__int__(self)\n' ++ 'object.__float__(self)\n' ++ 'object.__round__(self[, n])\n' ++ '\n' ++ ' Called to implement the built-in functions "complex()", ' ++ '"int()",\n' ++ ' "float()" and "round()". Should return a value of the ' ++ 'appropriate\n' ++ ' type.\n' ++ '\n' ++ 'object.__index__(self)\n' ++ '\n' ++ ' Called to implement "operator.index()", and whenever ' ++ 'Python needs\n' ++ ' to losslessly convert the numeric object to an integer ' ++ 'object (such\n' ++ ' as in slicing, or in the built-in "bin()", "hex()" and ' ++ '"oct()"\n' ++ ' functions). Presence of this method indicates that the ' ++ 'numeric\n' ++ ' object is an integer type. Must return an integer.\n' ++ '\n' ++ ' Note: In order to have a coherent integer type class, ' ++ 'when\n' ++ ' "__index__()" is defined "__int__()" should also be ' ++ 'defined, and\n' ++ ' both should return the same value.\n' ++ '\n' ++ '\n' ++ 'With Statement Context Managers\n' ++ '===============================\n' ++ '\n' ++ 'A *context manager* is an object that defines the runtime ' ++ 'context to\n' ++ 'be established when executing a "with" statement. The ' ++ 'context manager\n' ++ 'handles the entry into, and the exit from, the desired ' ++ 'runtime context\n' ++ 'for the execution of the block of code. Context managers ' ++ 'are normally\n' ++ 'invoked using the "with" statement (described in section ' ++ '*The with\n' ++ 'statement*), but can also be used by directly invoking ' ++ 'their methods.\n' ++ '\n' ++ 'Typical uses of context managers include saving and ' ++ 'restoring various\n' ++ 'kinds of global state, locking and unlocking resources, ' ++ 'closing opened\n' ++ 'files, etc.\n' ++ '\n' ++ 'For more information on context managers, see *Context ' ++ 'Manager Types*.\n' ++ '\n' ++ 'object.__enter__(self)\n' ++ '\n' ++ ' Enter the runtime context related to this object. The ' ++ '"with"\n' ++ " statement will bind this method's return value to the " ++ 'target(s)\n' ++ ' specified in the "as" clause of the statement, if any.\n' ++ '\n' ++ 'object.__exit__(self, exc_type, exc_value, traceback)\n' ++ '\n' ++ ' Exit the runtime context related to this object. The ' ++ 'parameters\n' ++ ' describe the exception that caused the context to be ' ++ 'exited. If the\n' ++ ' context was exited without an exception, all three ' ++ 'arguments will\n' ++ ' be "None".\n' ++ '\n' ++ ' If an exception is supplied, and the method wishes to ' ++ 'suppress the\n' ++ ' exception (i.e., prevent it from being propagated), it ' ++ 'should\n' ++ ' return a true value. Otherwise, the exception will be ' ++ 'processed\n' ++ ' normally upon exit from this method.\n' ++ '\n' ++ ' Note that "__exit__()" methods should not reraise the ' ++ 'passed-in\n' ++ " exception; this is the caller's responsibility.\n" ++ '\n' ++ 'See also: **PEP 0343** - The "with" statement\n' ++ '\n' ++ ' The specification, background, and examples for the ' ++ 'Python "with"\n' ++ ' statement.\n' ++ '\n' ++ '\n' ++ 'Special method lookup\n' ++ '=====================\n' ++ '\n' ++ 'For custom classes, implicit invocations of special ' ++ 'methods are only\n' ++ "guaranteed to work correctly if defined on an object's " ++ 'type, not in\n' ++ "the object's instance dictionary. That behaviour is the " ++ 'reason why\n' ++ 'the following code raises an exception:\n' ++ '\n' ++ ' >>> class C:\n' ++ ' ... pass\n' ++ ' ...\n' ++ ' >>> c = C()\n' ++ ' >>> c.__len__ = lambda: 5\n' ++ ' >>> len(c)\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 1, in \n' ++ " TypeError: object of type 'C' has no len()\n" ++ '\n' ++ 'The rationale behind this behaviour lies with a number of ' ++ 'special\n' ++ 'methods such as "__hash__()" and "__repr__()" that are ' ++ 'implemented by\n' ++ 'all objects, including type objects. If the implicit ' ++ 'lookup of these\n' ++ 'methods used the conventional lookup process, they would ' ++ 'fail when\n' ++ 'invoked on the type object itself:\n' ++ '\n' ++ ' >>> 1 .__hash__() == hash(1)\n' ++ ' True\n' ++ ' >>> int.__hash__() == hash(int)\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 1, in \n' ++ " TypeError: descriptor '__hash__' of 'int' object needs " ++ 'an argument\n' ++ '\n' ++ 'Incorrectly attempting to invoke an unbound method of a ' ++ 'class in this\n' ++ "way is sometimes referred to as 'metaclass confusion', and " ++ 'is avoided\n' ++ 'by bypassing the instance when looking up special ' ++ 'methods:\n' ++ '\n' ++ ' >>> type(1).__hash__(1) == hash(1)\n' ++ ' True\n' ++ ' >>> type(int).__hash__(int) == hash(int)\n' ++ ' True\n' ++ '\n' ++ 'In addition to bypassing any instance attributes in the ' ++ 'interest of\n' ++ 'correctness, implicit special method lookup generally also ' ++ 'bypasses\n' ++ 'the "__getattribute__()" method even of the object\'s ' ++ 'metaclass:\n' ++ '\n' ++ ' >>> class Meta(type):\n' ++ ' ... def __getattribute__(*args):\n' ++ ' ... print("Metaclass getattribute invoked")\n' ++ ' ... return type.__getattribute__(*args)\n' ++ ' ...\n' ++ ' >>> class C(object, metaclass=Meta):\n' ++ ' ... def __len__(self):\n' ++ ' ... return 10\n' ++ ' ... def __getattribute__(*args):\n' ++ ' ... print("Class getattribute invoked")\n' ++ ' ... return object.__getattribute__(*args)\n' ++ ' ...\n' ++ ' >>> c = C()\n' ++ ' >>> c.__len__() # Explicit lookup via ' ++ 'instance\n' ++ ' Class getattribute invoked\n' ++ ' 10\n' ++ ' >>> type(c).__len__(c) # Explicit lookup via ' ++ 'type\n' ++ ' Metaclass getattribute invoked\n' ++ ' 10\n' ++ ' >>> len(c) # Implicit lookup\n' ++ ' 10\n' ++ '\n' ++ 'Bypassing the "__getattribute__()" machinery in this ' ++ 'fashion provides\n' ++ 'significant scope for speed optimisations within the ' ++ 'interpreter, at\n' ++ 'the cost of some flexibility in the handling of special ' ++ 'methods (the\n' ++ 'special method *must* be set on the class object itself in ' ++ 'order to be\n' ++ 'consistently invoked by the interpreter).\n' ++ '\n' ++ '-[ Footnotes ]-\n' ++ '\n' ++ "[1] It *is* possible in some cases to change an object's " ++ 'type,\n' ++ ' under certain controlled conditions. It generally ' ++ "isn't a good\n" ++ ' idea though, since it can lead to some very strange ' ++ 'behaviour if\n' ++ ' it is handled incorrectly.\n' ++ '\n' ++ '[2] For operands of the same type, it is assumed that if ' ++ 'the non-\n' ++ ' reflected method (such as "__add__()") fails the ' ++ 'operation is not\n' ++ ' supported, which is why the reflected method is not ' ++ 'called.\n', ++ 'string-methods': '\n' ++ 'String Methods\n' ++ '**************\n' ++ '\n' ++ 'Strings implement all of the *common* sequence ' ++ 'operations, along with\n' ++ 'the additional methods described below.\n' ++ '\n' ++ 'Strings also support two styles of string formatting, ' ++ 'one providing a\n' ++ 'large degree of flexibility and customization (see ' ++ '"str.format()",\n' ++ '*Format String Syntax* and *String Formatting*) and the ' ++ 'other based on\n' ++ 'C "printf" style formatting that handles a narrower ' ++ 'range of types and\n' ++ 'is slightly harder to use correctly, but is often faster ' ++ 'for the cases\n' ++ 'it can handle (*printf-style String Formatting*).\n' ++ '\n' ++ 'The *Text Processing Services* section of the standard ' ++ 'library covers\n' ++ 'a number of other modules that provide various text ' ++ 'related utilities\n' ++ '(including regular expression support in the "re" ' ++ 'module).\n' ++ '\n' ++ 'str.capitalize()\n' ++ '\n' ++ ' Return a copy of the string with its first character ' ++ 'capitalized\n' ++ ' and the rest lowercased.\n' ++ '\n' ++ 'str.casefold()\n' ++ '\n' ++ ' Return a casefolded copy of the string. Casefolded ' ++ 'strings may be\n' ++ ' used for caseless matching.\n' ++ '\n' ++ ' Casefolding is similar to lowercasing but more ' ++ 'aggressive because\n' ++ ' it is intended to remove all case distinctions in a ' ++ 'string. For\n' ++ ' example, the German lowercase letter "\'ß\'" is ' ++ 'equivalent to ""ss"".\n' ++ ' Since it is already lowercase, "lower()" would do ' ++ 'nothing to "\'ß\'";\n' ++ ' "casefold()" converts it to ""ss"".\n' ++ '\n' ++ ' The casefolding algorithm is described in section ' ++ '3.13 of the\n' ++ ' Unicode Standard.\n' ++ '\n' ++ ' New in version 3.3.\n' ++ '\n' ++ 'str.center(width[, fillchar])\n' ++ '\n' ++ ' Return centered in a string of length *width*. ' ++ 'Padding is done\n' ++ ' using the specified *fillchar* (default is an ASCII ' ++ 'space). The\n' ++ ' original string is returned if *width* is less than ' ++ 'or equal to\n' ++ ' "len(s)".\n' ++ '\n' ++ 'str.count(sub[, start[, end]])\n' ++ '\n' ++ ' Return the number of non-overlapping occurrences of ' ++ 'substring *sub*\n' ++ ' in the range [*start*, *end*]. Optional arguments ' ++ '*start* and\n' ++ ' *end* are interpreted as in slice notation.\n' ++ '\n' ++ 'str.encode(encoding="utf-8", errors="strict")\n' ++ '\n' ++ ' Return an encoded version of the string as a bytes ' ++ 'object. Default\n' ++ ' encoding is "\'utf-8\'". *errors* may be given to set ' ++ 'a different\n' ++ ' error handling scheme. The default for *errors* is ' ++ '"\'strict\'",\n' ++ ' meaning that encoding errors raise a "UnicodeError". ' ++ 'Other possible\n' ++ ' values are "\'ignore\'", "\'replace\'", ' ++ '"\'xmlcharrefreplace\'",\n' ++ ' "\'backslashreplace\'" and any other name registered ' ++ 'via\n' ++ ' "codecs.register_error()", see section *Codec Base ' ++ 'Classes*. For a\n' ++ ' list of possible encodings, see section *Standard ' ++ 'Encodings*.\n' ++ '\n' ++ ' Changed in version 3.1: Support for keyword arguments ' ++ 'added.\n' ++ '\n' ++ 'str.endswith(suffix[, start[, end]])\n' ++ '\n' ++ ' Return "True" if the string ends with the specified ' ++ '*suffix*,\n' ++ ' otherwise return "False". *suffix* can also be a ' ++ 'tuple of suffixes\n' ++ ' to look for. With optional *start*, test beginning ' ++ 'at that\n' ++ ' position. With optional *end*, stop comparing at ' ++ 'that position.\n' ++ '\n' ++ 'str.expandtabs(tabsize=8)\n' ++ '\n' ++ ' Return a copy of the string where all tab characters ' ++ 'are replaced\n' ++ ' by one or more spaces, depending on the current ' ++ 'column and the\n' ++ ' given tab size. Tab positions occur every *tabsize* ' ++ 'characters\n' ++ ' (default is 8, giving tab positions at columns 0, 8, ' ++ '16 and so on).\n' ++ ' To expand the string, the current column is set to ' ++ 'zero and the\n' ++ ' string is examined character by character. If the ' ++ 'character is a\n' ++ ' tab ("\\t"), one or more space characters are ' ++ 'inserted in the result\n' ++ ' until the current column is equal to the next tab ' ++ 'position. (The\n' ++ ' tab character itself is not copied.) If the ' ++ 'character is a newline\n' ++ ' ("\\n") or return ("\\r"), it is copied and the ' ++ 'current column is\n' ++ ' reset to zero. Any other character is copied ' ++ 'unchanged and the\n' ++ ' current column is incremented by one regardless of ' ++ 'how the\n' ++ ' character is represented when printed.\n' ++ '\n' ++ " >>> '01\\t012\\t0123\\t01234'.expandtabs()\n" ++ " '01 012 0123 01234'\n" ++ " >>> '01\\t012\\t0123\\t01234'.expandtabs(4)\n" ++ " '01 012 0123 01234'\n" ++ '\n' ++ 'str.find(sub[, start[, end]])\n' ++ '\n' ++ ' Return the lowest index in the string where substring ' ++ '*sub* is\n' ++ ' found, such that *sub* is contained in the slice ' ++ '"s[start:end]".\n' ++ ' Optional arguments *start* and *end* are interpreted ' ++ 'as in slice\n' ++ ' notation. Return "-1" if *sub* is not found.\n' ++ '\n' ++ ' Note: The "find()" method should be used only if you ' ++ 'need to know\n' ++ ' the position of *sub*. To check if *sub* is a ' ++ 'substring or not,\n' ++ ' use the "in" operator:\n' ++ '\n' ++ " >>> 'Py' in 'Python'\n" ++ ' True\n' ++ '\n' ++ 'str.format(*args, **kwargs)\n' ++ '\n' ++ ' Perform a string formatting operation. The string on ' ++ 'which this\n' ++ ' method is called can contain literal text or ' ++ 'replacement fields\n' ++ ' delimited by braces "{}". Each replacement field ' ++ 'contains either\n' ++ ' the numeric index of a positional argument, or the ' ++ 'name of a\n' ++ ' keyword argument. Returns a copy of the string where ' ++ 'each\n' ++ ' replacement field is replaced with the string value ' ++ 'of the\n' ++ ' corresponding argument.\n' ++ '\n' ++ ' >>> "The sum of 1 + 2 is {0}".format(1+2)\n' ++ " 'The sum of 1 + 2 is 3'\n" ++ '\n' ++ ' See *Format String Syntax* for a description of the ' ++ 'various\n' ++ ' formatting options that can be specified in format ' ++ 'strings.\n' ++ '\n' ++ 'str.format_map(mapping)\n' ++ '\n' ++ ' Similar to "str.format(**mapping)", except that ' ++ '"mapping" is used\n' ++ ' directly and not copied to a "dict". This is useful ' ++ 'if for example\n' ++ ' "mapping" is a dict subclass:\n' ++ '\n' ++ ' >>> class Default(dict):\n' ++ ' ... def __missing__(self, key):\n' ++ ' ... return key\n' ++ ' ...\n' ++ " >>> '{name} was born in " ++ "{country}'.format_map(Default(name='Guido'))\n" ++ " 'Guido was born in country'\n" ++ '\n' ++ ' New in version 3.2.\n' ++ '\n' ++ 'str.index(sub[, start[, end]])\n' ++ '\n' ++ ' Like "find()", but raise "ValueError" when the ' ++ 'substring is not\n' ++ ' found.\n' ++ '\n' ++ 'str.isalnum()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'alphanumeric and\n' ++ ' there is at least one character, false otherwise. A ' ++ 'character "c"\n' ++ ' is alphanumeric if one of the following returns ' ++ '"True":\n' ++ ' "c.isalpha()", "c.isdecimal()", "c.isdigit()", or ' ++ '"c.isnumeric()".\n' ++ '\n' ++ 'str.isalpha()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'alphabetic and\n' ++ ' there is at least one character, false otherwise. ' ++ 'Alphabetic\n' ++ ' characters are those characters defined in the ' ++ 'Unicode character\n' ++ ' database as "Letter", i.e., those with general ' ++ 'category property\n' ++ ' being one of "Lm", "Lt", "Lu", "Ll", or "Lo". Note ' ++ 'that this is\n' ++ ' different from the "Alphabetic" property defined in ' ++ 'the Unicode\n' ++ ' Standard.\n' ++ '\n' ++ 'str.isdecimal()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'decimal characters\n' ++ ' and there is at least one character, false otherwise. ' ++ 'Decimal\n' ++ ' characters are those from general category "Nd". This ' ++ 'category\n' ++ ' includes digit characters, and all characters that ' ++ 'can be used to\n' ++ ' form decimal-radix numbers, e.g. U+0660, ARABIC-INDIC ' ++ 'DIGIT ZERO.\n' ++ '\n' ++ 'str.isdigit()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'digits and there is\n' ++ ' at least one character, false otherwise. Digits ' ++ 'include decimal\n' ++ ' characters and digits that need special handling, ' ++ 'such as the\n' ++ ' compatibility superscript digits. Formally, a digit ' ++ 'is a character\n' ++ ' that has the property value Numeric_Type=Digit or\n' ++ ' Numeric_Type=Decimal.\n' ++ '\n' ++ 'str.isidentifier()\n' ++ '\n' ++ ' Return true if the string is a valid identifier ' ++ 'according to the\n' ++ ' language definition, section *Identifiers and ' ++ 'keywords*.\n' ++ '\n' ++ ' Use "keyword.iskeyword()" to test for reserved ' ++ 'identifiers such as\n' ++ ' "def" and "class".\n' ++ '\n' ++ 'str.islower()\n' ++ '\n' ++ ' Return true if all cased characters [4] in the string ' ++ 'are lowercase\n' ++ ' and there is at least one cased character, false ' ++ 'otherwise.\n' ++ '\n' ++ 'str.isnumeric()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'numeric characters,\n' ++ ' and there is at least one character, false otherwise. ' ++ 'Numeric\n' ++ ' characters include digit characters, and all ' ++ 'characters that have\n' ++ ' the Unicode numeric value property, e.g. U+2155, ' ++ 'VULGAR FRACTION\n' ++ ' ONE FIFTH. Formally, numeric characters are those ' ++ 'with the\n' ++ ' property value Numeric_Type=Digit, ' ++ 'Numeric_Type=Decimal or\n' ++ ' Numeric_Type=Numeric.\n' ++ '\n' ++ 'str.isprintable()\n' ++ '\n' ++ ' Return true if all characters in the string are ' ++ 'printable or the\n' ++ ' string is empty, false otherwise. Nonprintable ' ++ 'characters are\n' ++ ' those characters defined in the Unicode character ' ++ 'database as\n' ++ ' "Other" or "Separator", excepting the ASCII space ' ++ '(0x20) which is\n' ++ ' considered printable. (Note that printable ' ++ 'characters in this\n' ++ ' context are those which should not be escaped when ' ++ '"repr()" is\n' ++ ' invoked on a string. It has no bearing on the ' ++ 'handling of strings\n' ++ ' written to "sys.stdout" or "sys.stderr".)\n' ++ '\n' ++ 'str.isspace()\n' ++ '\n' ++ ' Return true if there are only whitespace characters ' ++ 'in the string\n' ++ ' and there is at least one character, false ' ++ 'otherwise. Whitespace\n' ++ ' characters are those characters defined in the ' ++ 'Unicode character\n' ++ ' database as "Other" or "Separator" and those with ' ++ 'bidirectional\n' ++ ' property being one of "WS", "B", or "S".\n' ++ '\n' ++ 'str.istitle()\n' ++ '\n' ++ ' Return true if the string is a titlecased string and ' ++ 'there is at\n' ++ ' least one character, for example uppercase characters ' ++ 'may only\n' ++ ' follow uncased characters and lowercase characters ' ++ 'only cased ones.\n' ++ ' Return false otherwise.\n' ++ '\n' ++ 'str.isupper()\n' ++ '\n' ++ ' Return true if all cased characters [4] in the string ' ++ 'are uppercase\n' ++ ' and there is at least one cased character, false ' ++ 'otherwise.\n' ++ '\n' ++ 'str.join(iterable)\n' ++ '\n' ++ ' Return a string which is the concatenation of the ' ++ 'strings in the\n' ++ ' *iterable* *iterable*. A "TypeError" will be raised ' ++ 'if there are\n' ++ ' any non-string values in *iterable*, including ' ++ '"bytes" objects.\n' ++ ' The separator between elements is the string ' ++ 'providing this method.\n' ++ '\n' ++ 'str.ljust(width[, fillchar])\n' ++ '\n' ++ ' Return the string left justified in a string of ' ++ 'length *width*.\n' ++ ' Padding is done using the specified *fillchar* ' ++ '(default is an ASCII\n' ++ ' space). The original string is returned if *width* is ' ++ 'less than or\n' ++ ' equal to "len(s)".\n' ++ '\n' ++ 'str.lower()\n' ++ '\n' ++ ' Return a copy of the string with all the cased ' ++ 'characters [4]\n' ++ ' converted to lowercase.\n' ++ '\n' ++ ' The lowercasing algorithm used is described in ' ++ 'section 3.13 of the\n' ++ ' Unicode Standard.\n' ++ '\n' ++ 'str.lstrip([chars])\n' ++ '\n' ++ ' Return a copy of the string with leading characters ' ++ 'removed. The\n' ++ ' *chars* argument is a string specifying the set of ' ++ 'characters to be\n' ++ ' removed. If omitted or "None", the *chars* argument ' ++ 'defaults to\n' ++ ' removing whitespace. The *chars* argument is not a ' ++ 'prefix; rather,\n' ++ ' all combinations of its values are stripped:\n' ++ '\n' ++ " >>> ' spacious '.lstrip()\n" ++ " 'spacious '\n" ++ " >>> 'www.example.com'.lstrip('cmowz.')\n" ++ " 'example.com'\n" ++ '\n' ++ 'static str.maketrans(x[, y[, z]])\n' ++ '\n' ++ ' This static method returns a translation table usable ' ++ 'for\n' ++ ' "str.translate()".\n' ++ '\n' ++ ' If there is only one argument, it must be a ' ++ 'dictionary mapping\n' ++ ' Unicode ordinals (integers) or characters (strings of ' ++ 'length 1) to\n' ++ ' Unicode ordinals, strings (of arbitrary lengths) or ' ++ 'None.\n' ++ ' Character keys will then be converted to ordinals.\n' ++ '\n' ++ ' If there are two arguments, they must be strings of ' ++ 'equal length,\n' ++ ' and in the resulting dictionary, each character in x ' ++ 'will be mapped\n' ++ ' to the character at the same position in y. If there ' ++ 'is a third\n' ++ ' argument, it must be a string, whose characters will ' ++ 'be mapped to\n' ++ ' None in the result.\n' ++ '\n' ++ 'str.partition(sep)\n' ++ '\n' ++ ' Split the string at the first occurrence of *sep*, ' ++ 'and return a\n' ++ ' 3-tuple containing the part before the separator, the ' ++ 'separator\n' ++ ' itself, and the part after the separator. If the ' ++ 'separator is not\n' ++ ' found, return a 3-tuple containing the string itself, ' ++ 'followed by\n' ++ ' two empty strings.\n' ++ '\n' ++ 'str.replace(old, new[, count])\n' ++ '\n' ++ ' Return a copy of the string with all occurrences of ' ++ 'substring *old*\n' ++ ' replaced by *new*. If the optional argument *count* ' ++ 'is given, only\n' ++ ' the first *count* occurrences are replaced.\n' ++ '\n' ++ 'str.rfind(sub[, start[, end]])\n' ++ '\n' ++ ' Return the highest index in the string where ' ++ 'substring *sub* is\n' ++ ' found, such that *sub* is contained within ' ++ '"s[start:end]".\n' ++ ' Optional arguments *start* and *end* are interpreted ' ++ 'as in slice\n' ++ ' notation. Return "-1" on failure.\n' ++ '\n' ++ 'str.rindex(sub[, start[, end]])\n' ++ '\n' ++ ' Like "rfind()" but raises "ValueError" when the ' ++ 'substring *sub* is\n' ++ ' not found.\n' ++ '\n' ++ 'str.rjust(width[, fillchar])\n' ++ '\n' ++ ' Return the string right justified in a string of ' ++ 'length *width*.\n' ++ ' Padding is done using the specified *fillchar* ' ++ '(default is an ASCII\n' ++ ' space). The original string is returned if *width* is ' ++ 'less than or\n' ++ ' equal to "len(s)".\n' ++ '\n' ++ 'str.rpartition(sep)\n' ++ '\n' ++ ' Split the string at the last occurrence of *sep*, and ' ++ 'return a\n' ++ ' 3-tuple containing the part before the separator, the ' ++ 'separator\n' ++ ' itself, and the part after the separator. If the ' ++ 'separator is not\n' ++ ' found, return a 3-tuple containing two empty strings, ' ++ 'followed by\n' ++ ' the string itself.\n' ++ '\n' ++ 'str.rsplit(sep=None, maxsplit=-1)\n' ++ '\n' ++ ' Return a list of the words in the string, using *sep* ' ++ 'as the\n' ++ ' delimiter string. If *maxsplit* is given, at most ' ++ '*maxsplit* splits\n' ++ ' are done, the *rightmost* ones. If *sep* is not ' ++ 'specified or\n' ++ ' "None", any whitespace string is a separator. Except ' ++ 'for splitting\n' ++ ' from the right, "rsplit()" behaves like "split()" ' ++ 'which is\n' ++ ' described in detail below.\n' ++ '\n' ++ 'str.rstrip([chars])\n' ++ '\n' ++ ' Return a copy of the string with trailing characters ' ++ 'removed. The\n' ++ ' *chars* argument is a string specifying the set of ' ++ 'characters to be\n' ++ ' removed. If omitted or "None", the *chars* argument ' ++ 'defaults to\n' ++ ' removing whitespace. The *chars* argument is not a ' ++ 'suffix; rather,\n' ++ ' all combinations of its values are stripped:\n' ++ '\n' ++ " >>> ' spacious '.rstrip()\n" ++ " ' spacious'\n" ++ " >>> 'mississippi'.rstrip('ipz')\n" ++ " 'mississ'\n" ++ '\n' ++ 'str.split(sep=None, maxsplit=-1)\n' ++ '\n' ++ ' Return a list of the words in the string, using *sep* ' ++ 'as the\n' ++ ' delimiter string. If *maxsplit* is given, at most ' ++ '*maxsplit*\n' ++ ' splits are done (thus, the list will have at most ' ++ '"maxsplit+1"\n' ++ ' elements). If *maxsplit* is not specified or "-1", ' ++ 'then there is\n' ++ ' no limit on the number of splits (all possible splits ' ++ 'are made).\n' ++ '\n' ++ ' If *sep* is given, consecutive delimiters are not ' ++ 'grouped together\n' ++ ' and are deemed to delimit empty strings (for ' ++ 'example,\n' ++ ' "\'1,,2\'.split(\',\')" returns "[\'1\', \'\', ' ++ '\'2\']"). The *sep* argument\n' ++ ' may consist of multiple characters (for example,\n' ++ ' "\'1<>2<>3\'.split(\'<>\')" returns "[\'1\', \'2\', ' ++ '\'3\']"). Splitting an\n' ++ ' empty string with a specified separator returns ' ++ '"[\'\']".\n' ++ '\n' ++ ' For example:\n' ++ '\n' ++ " >>> '1,2,3'.split(',')\n" ++ " ['1', '2', '3']\n" ++ " >>> '1,2,3'.split(',', maxsplit=1)\n" ++ " ['1', '2 3']\n" ++ " >>> '1,2,,3,'.split(',')\n" ++ " ['1', '2', '', '3', '']\n" ++ '\n' ++ ' If *sep* is not specified or is "None", a different ' ++ 'splitting\n' ++ ' algorithm is applied: runs of consecutive whitespace ' ++ 'are regarded\n' ++ ' as a single separator, and the result will contain no ' ++ 'empty strings\n' ++ ' at the start or end if the string has leading or ' ++ 'trailing\n' ++ ' whitespace. Consequently, splitting an empty string ' ++ 'or a string\n' ++ ' consisting of just whitespace with a "None" separator ' ++ 'returns "[]".\n' ++ '\n' ++ ' For example:\n' ++ '\n' ++ " >>> '1 2 3'.split()\n" ++ " ['1', '2', '3']\n" ++ " >>> '1 2 3'.split(maxsplit=1)\n" ++ " ['1', '2 3']\n" ++ " >>> ' 1 2 3 '.split()\n" ++ " ['1', '2', '3']\n" ++ '\n' ++ 'str.splitlines([keepends])\n' ++ '\n' ++ ' Return a list of the lines in the string, breaking at ' ++ 'line\n' ++ ' boundaries. This method uses the *universal newlines* ' ++ 'approach to\n' ++ ' splitting lines. Line breaks are not included in the ' ++ 'resulting list\n' ++ ' unless *keepends* is given and true.\n' ++ '\n' ++ ' For example:\n' ++ '\n' ++ " >>> 'ab c\\n\\nde fg\\rkl\\r\\n'.splitlines()\n" ++ " ['ab c', '', 'de fg', 'kl']``\n" ++ " >>> 'ab c\\n\\nde " ++ "fg\\rkl\\r\\n'.splitlines(keepends=True)\n" ++ " ['ab c\\n', '\\n', 'de fg\\r', 'kl\\r\\n']\n" ++ '\n' ++ ' Unlike "split()" when a delimiter string *sep* is ' ++ 'given, this\n' ++ ' method returns an empty list for the empty string, ' ++ 'and a terminal\n' ++ ' line break does not result in an extra line:\n' ++ '\n' ++ ' >>> "".splitlines()\n' ++ ' []\n' ++ ' >>> "One line\\n".splitlines()\n' ++ " ['One line']\n" ++ '\n' ++ ' For comparison, "split(\'\\n\')" gives:\n' ++ '\n' ++ " >>> ''.split('\\n')\n" ++ " ['']\n" ++ " >>> 'Two lines\\n'.split('\\n')\n" ++ " ['Two lines', '']\n" ++ '\n' ++ 'str.startswith(prefix[, start[, end]])\n' ++ '\n' ++ ' Return "True" if string starts with the *prefix*, ' ++ 'otherwise return\n' ++ ' "False". *prefix* can also be a tuple of prefixes to ' ++ 'look for.\n' ++ ' With optional *start*, test string beginning at that ' ++ 'position.\n' ++ ' With optional *end*, stop comparing string at that ' ++ 'position.\n' ++ '\n' ++ 'str.strip([chars])\n' ++ '\n' ++ ' Return a copy of the string with the leading and ' ++ 'trailing\n' ++ ' characters removed. The *chars* argument is a string ' ++ 'specifying the\n' ++ ' set of characters to be removed. If omitted or ' ++ '"None", the *chars*\n' ++ ' argument defaults to removing whitespace. The *chars* ' ++ 'argument is\n' ++ ' not a prefix or suffix; rather, all combinations of ' ++ 'its values are\n' ++ ' stripped:\n' ++ '\n' ++ " >>> ' spacious '.strip()\n" ++ " 'spacious'\n" ++ " >>> 'www.example.com'.strip('cmowz.')\n" ++ " 'example'\n" ++ '\n' ++ 'str.swapcase()\n' ++ '\n' ++ ' Return a copy of the string with uppercase characters ' ++ 'converted to\n' ++ ' lowercase and vice versa. Note that it is not ' ++ 'necessarily true that\n' ++ ' "s.swapcase().swapcase() == s".\n' ++ '\n' ++ 'str.title()\n' ++ '\n' ++ ' Return a titlecased version of the string where words ' ++ 'start with an\n' ++ ' uppercase character and the remaining characters are ' ++ 'lowercase.\n' ++ '\n' ++ ' For example:\n' ++ '\n' ++ " >>> 'Hello world'.title()\n" ++ " 'Hello World'\n" ++ '\n' ++ ' The algorithm uses a simple language-independent ' ++ 'definition of a\n' ++ ' word as groups of consecutive letters. The ' ++ 'definition works in\n' ++ ' many contexts but it means that apostrophes in ' ++ 'contractions and\n' ++ ' possessives form word boundaries, which may not be ' ++ 'the desired\n' ++ ' result:\n' ++ '\n' ++ ' >>> "they\'re bill\'s friends from the ' ++ 'UK".title()\n' ++ ' "They\'Re Bill\'S Friends From The Uk"\n' ++ '\n' ++ ' A workaround for apostrophes can be constructed using ' ++ 'regular\n' ++ ' expressions:\n' ++ '\n' ++ ' >>> import re\n' ++ ' >>> def titlecase(s):\n' ++ ' ... return re.sub(r"[A-Za-z]+(\'[A-Za-z]+)?",\n' ++ ' ... lambda mo: ' ++ 'mo.group(0)[0].upper() +\n' ++ ' ... ' ++ 'mo.group(0)[1:].lower(),\n' ++ ' ... s)\n' ++ ' ...\n' ++ ' >>> titlecase("they\'re bill\'s friends.")\n' ++ ' "They\'re Bill\'s Friends."\n' ++ '\n' ++ 'str.translate(map)\n' ++ '\n' ++ ' Return a copy of the *s* where all characters have ' ++ 'been mapped\n' ++ ' through the *map* which must be a dictionary of ' ++ 'Unicode ordinals\n' ++ ' (integers) to Unicode ordinals, strings or "None". ' ++ 'Unmapped\n' ++ ' characters are left untouched. Characters mapped to ' ++ '"None" are\n' ++ ' deleted.\n' ++ '\n' ++ ' You can use "str.maketrans()" to create a translation ' ++ 'map from\n' ++ ' character-to-character mappings in different ' ++ 'formats.\n' ++ '\n' ++ ' Note: An even more flexible approach is to create a ' ++ 'custom\n' ++ ' character mapping codec using the "codecs" module ' ++ '(see\n' ++ ' "encodings.cp1251" for an example).\n' ++ '\n' ++ 'str.upper()\n' ++ '\n' ++ ' Return a copy of the string with all the cased ' ++ 'characters [4]\n' ++ ' converted to uppercase. Note that ' ++ '"str.upper().isupper()" might be\n' ++ ' "False" if "s" contains uncased characters or if the ' ++ 'Unicode\n' ++ ' category of the resulting character(s) is not "Lu" ' ++ '(Letter,\n' ++ ' uppercase), but e.g. "Lt" (Letter, titlecase).\n' ++ '\n' ++ ' The uppercasing algorithm used is described in ' ++ 'section 3.13 of the\n' ++ ' Unicode Standard.\n' ++ '\n' ++ 'str.zfill(width)\n' ++ '\n' ++ ' Return a copy of the string left filled with ASCII ' ++ '"\'0\'" digits to\n' ++ ' make a string of length *width*. A leading sign ' ++ 'prefix ("\'+\'"/"\'-\'"\n' ++ ' is handled by inserting the padding *after* the sign ' ++ 'character\n' ++ ' rather than before. The original string is returned ' ++ 'if *width* is\n' ++ ' less than or equal to "len(s)".\n' ++ '\n' ++ ' For example:\n' ++ '\n' ++ ' >>> "42".zfill(5)\n' ++ " '00042'\n" ++ ' >>> "-42".zfill(5)\n' ++ " '-0042'\n", ++ 'strings': '\n' ++ 'String and Bytes literals\n' ++ '*************************\n' ++ '\n' ++ 'String literals are described by the following lexical ' ++ 'definitions:\n' ++ '\n' ++ ' stringliteral ::= [stringprefix](shortstring | ' ++ 'longstring)\n' ++ ' stringprefix ::= "r" | "u" | "R" | "U"\n' ++ ' shortstring ::= "\'" shortstringitem* "\'" | \'"\' ' ++ 'shortstringitem* \'"\'\n' ++ ' longstring ::= "\'\'\'" longstringitem* "\'\'\'" | ' ++ '\'"""\' longstringitem* \'"""\'\n' ++ ' shortstringitem ::= shortstringchar | stringescapeseq\n' ++ ' longstringitem ::= longstringchar | stringescapeseq\n' ++ ' shortstringchar ::= \n' ++ ' longstringchar ::= \n' ++ ' stringescapeseq ::= "\\" \n' ++ '\n' ++ ' bytesliteral ::= bytesprefix(shortbytes | longbytes)\n' ++ ' bytesprefix ::= "b" | "B" | "br" | "Br" | "bR" | "BR" | ' ++ '"rb" | "rB" | "Rb" | "RB"\n' ++ ' shortbytes ::= "\'" shortbytesitem* "\'" | \'"\' ' ++ 'shortbytesitem* \'"\'\n' ++ ' longbytes ::= "\'\'\'" longbytesitem* "\'\'\'" | ' ++ '\'"""\' longbytesitem* \'"""\'\n' ++ ' shortbytesitem ::= shortbyteschar | bytesescapeseq\n' ++ ' longbytesitem ::= longbyteschar | bytesescapeseq\n' ++ ' shortbyteschar ::= \n' ++ ' longbyteschar ::= \n' ++ ' bytesescapeseq ::= "\\" \n' ++ '\n' ++ 'One syntactic restriction not indicated by these productions is ' ++ 'that\n' ++ 'whitespace is not allowed between the "stringprefix" or ' ++ '"bytesprefix"\n' ++ 'and the rest of the literal. The source character set is ' ++ 'defined by\n' ++ 'the encoding declaration; it is UTF-8 if no encoding ' ++ 'declaration is\n' ++ 'given in the source file; see section *Encoding declarations*.\n' ++ '\n' ++ 'In plain English: Both types of literals can be enclosed in ' ++ 'matching\n' ++ 'single quotes ("\'") or double quotes ("""). They can also be ' ++ 'enclosed\n' ++ 'in matching groups of three single or double quotes (these are\n' ++ 'generally referred to as *triple-quoted strings*). The ' ++ 'backslash\n' ++ '("\\") character is used to escape characters that otherwise ' ++ 'have a\n' ++ 'special meaning, such as newline, backslash itself, or the ' ++ 'quote\n' ++ 'character.\n' ++ '\n' ++ 'Bytes literals are always prefixed with "\'b\'" or "\'B\'"; ' ++ 'they produce\n' ++ 'an instance of the "bytes" type instead of the "str" type. ' ++ 'They may\n' ++ 'only contain ASCII characters; bytes with a numeric value of ' ++ '128 or\n' ++ 'greater must be expressed with escapes.\n' ++ '\n' ++ 'As of Python 3.3 it is possible again to prefix unicode strings ' ++ 'with a\n' ++ '"u" prefix to simplify maintenance of dual 2.x and 3.x ' ++ 'codebases.\n' ++ '\n' ++ 'Both string and bytes literals may optionally be prefixed with ' ++ 'a\n' ++ 'letter "\'r\'" or "\'R\'"; such strings are called *raw ' ++ 'strings* and treat\n' ++ 'backslashes as literal characters. As a result, in string ' ++ 'literals,\n' ++ '"\'\\U\'" and "\'\\u\'" escapes in raw strings are not treated ' ++ 'specially.\n' ++ "Given that Python 2.x's raw unicode literals behave differently " ++ 'than\n' ++ 'Python 3.x\'s the "\'ur\'" syntax is not supported.\n' ++ '\n' ++ ' New in version 3.3: The "\'rb\'" prefix of raw bytes ' ++ 'literals has\n' ++ ' been added as a synonym of "\'br\'".\n' ++ '\n' ++ ' New in version 3.3: Support for the unicode legacy literal\n' ++ ' ("u\'value\'") was reintroduced to simplify the maintenance ' ++ 'of dual\n' ++ ' Python 2.x and 3.x codebases. See **PEP 414** for more ' ++ 'information.\n' ++ '\n' ++ 'In triple-quoted strings, unescaped newlines and quotes are ' ++ 'allowed\n' ++ '(and are retained), except that three unescaped quotes in a ' ++ 'row\n' ++ 'terminate the string. (A "quote" is the character used to open ' ++ 'the\n' ++ 'string, i.e. either "\'" or """.)\n' ++ '\n' ++ 'Unless an "\'r\'" or "\'R\'" prefix is present, escape ' ++ 'sequences in\n' ++ 'strings are interpreted according to rules similar to those ' ++ 'used by\n' ++ 'Standard C. The recognized escape sequences are:\n' ++ '\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| Escape Sequence | Meaning | ' ++ 'Notes |\n' ++ '+===================+===================================+=========+\n' ++ '| "\\newline" | Backslash and newline ignored ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\\\" | Backslash ("\\") ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\\'" | Single quote ("\'") ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\"" | Double quote (""") ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\a" | ASCII Bell (BEL) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\b" | ASCII Backspace (BS) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\f" | ASCII Formfeed (FF) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\n" | ASCII Linefeed (LF) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\r" | ASCII Carriage Return (CR) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\t" | ASCII Horizontal Tab (TAB) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\v" | ASCII Vertical Tab (VT) ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\ooo" | Character with octal value *ooo* | ' ++ '(1,3) |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\xhh" | Character with hex value *hh* | ' ++ '(2,3) |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '\n' ++ 'Escape sequences only recognized in string literals are:\n' ++ '\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| Escape Sequence | Meaning | ' ++ 'Notes |\n' ++ '+===================+===================================+=========+\n' ++ '| "\\N{name}" | Character named *name* in the | ' ++ '(4) |\n' ++ '| | Unicode database ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\uxxxx" | Character with 16-bit hex value | ' ++ '(5) |\n' ++ '| | *xxxx* ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '| "\\Uxxxxxxxx" | Character with 32-bit hex value | ' ++ '(6) |\n' ++ '| | *xxxxxxxx* ' ++ '| |\n' ++ '+-------------------+-----------------------------------+---------+\n' ++ '\n' ++ 'Notes:\n' ++ '\n' ++ '1. As in Standard C, up to three octal digits are accepted.\n' ++ '\n' ++ '2. Unlike in Standard C, exactly two hex digits are required.\n' ++ '\n' ++ '3. In a bytes literal, hexadecimal and octal escapes denote ' ++ 'the\n' ++ ' byte with the given value. In a string literal, these ' ++ 'escapes\n' ++ ' denote a Unicode character with the given value.\n' ++ '\n' ++ '4. Changed in version 3.3: Support for name aliases [1] has ' ++ 'been\n' ++ ' added.\n' ++ '\n' ++ '5. Individual code units which form parts of a surrogate pair ' ++ 'can\n' ++ ' be encoded using this escape sequence. Exactly four hex ' ++ 'digits are\n' ++ ' required.\n' ++ '\n' ++ '6. Any Unicode character can be encoded this way. Exactly ' ++ 'eight\n' ++ ' hex digits are required.\n' ++ '\n' ++ 'Unlike Standard C, all unrecognized escape sequences are left ' ++ 'in the\n' ++ 'string unchanged, i.e., *the backslash is left in the string*. ' ++ '(This\n' ++ 'behavior is useful when debugging: if an escape sequence is ' ++ 'mistyped,\n' ++ 'the resulting output is more easily recognized as broken.) It ' ++ 'is also\n' ++ 'important to note that the escape sequences only recognized in ' ++ 'string\n' ++ 'literals fall into the category of unrecognized escapes for ' ++ 'bytes\n' ++ 'literals.\n' ++ '\n' ++ 'Even in a raw string, string quotes can be escaped with a ' ++ 'backslash,\n' ++ 'but the backslash remains in the string; for example, "r"\\""" ' ++ 'is a\n' ++ 'valid string literal consisting of two characters: a backslash ' ++ 'and a\n' ++ 'double quote; "r"\\"" is not a valid string literal (even a raw ' ++ 'string\n' ++ 'cannot end in an odd number of backslashes). Specifically, *a ' ++ 'raw\n' ++ 'string cannot end in a single backslash* (since the backslash ' ++ 'would\n' ++ 'escape the following quote character). Note also that a ' ++ 'single\n' ++ 'backslash followed by a newline is interpreted as those two ' ++ 'characters\n' ++ 'as part of the string, *not* as a line continuation.\n', ++ 'subscriptions': '\n' ++ 'Subscriptions\n' ++ '*************\n' ++ '\n' ++ 'A subscription selects an item of a sequence (string, ' ++ 'tuple or list)\n' ++ 'or mapping (dictionary) object:\n' ++ '\n' ++ ' subscription ::= primary "[" expression_list "]"\n' ++ '\n' ++ 'The primary must evaluate to an object that supports ' ++ 'subscription\n' ++ '(lists or dictionaries for example). User-defined ' ++ 'objects can support\n' ++ 'subscription by defining a "__getitem__()" method.\n' ++ '\n' ++ 'For built-in objects, there are two types of objects that ' ++ 'support\n' ++ 'subscription:\n' ++ '\n' ++ 'If the primary is a mapping, the expression list must ' ++ 'evaluate to an\n' ++ 'object whose value is one of the keys of the mapping, and ' ++ 'the\n' ++ 'subscription selects the value in the mapping that ' ++ 'corresponds to that\n' ++ 'key. (The expression list is a tuple except if it has ' ++ 'exactly one\n' ++ 'item.)\n' ++ '\n' ++ 'If the primary is a sequence, the expression (list) must ' ++ 'evaluate to\n' ++ 'an integer or a slice (as discussed in the following ' ++ 'section).\n' ++ '\n' ++ 'The formal syntax makes no special provision for negative ' ++ 'indices in\n' ++ 'sequences; however, built-in sequences all provide a ' ++ '"__getitem__()"\n' ++ 'method that interprets negative indices by adding the ' ++ 'length of the\n' ++ 'sequence to the index (so that "x[-1]" selects the last ' ++ 'item of "x").\n' ++ 'The resulting value must be a nonnegative integer less ' ++ 'than the number\n' ++ 'of items in the sequence, and the subscription selects ' ++ 'the item whose\n' ++ 'index is that value (counting from zero). Since the ' ++ 'support for\n' ++ "negative indices and slicing occurs in the object's " ++ '"__getitem__()"\n' ++ 'method, subclasses overriding this method will need to ' ++ 'explicitly add\n' ++ 'that support.\n' ++ '\n' ++ "A string's items are characters. A character is not a " ++ 'separate data\n' ++ 'type but a string of exactly one character.\n', ++ 'truth': '\n' ++ 'Truth Value Testing\n' ++ '*******************\n' ++ '\n' ++ 'Any object can be tested for truth value, for use in an "if" or\n' ++ '"while" condition or as operand of the Boolean operations below. ' ++ 'The\n' ++ 'following values are considered false:\n' ++ '\n' ++ '* "None"\n' ++ '\n' ++ '* "False"\n' ++ '\n' ++ '* zero of any numeric type, for example, "0", "0.0", "0j".\n' ++ '\n' ++ '* any empty sequence, for example, "\'\'", "()", "[]".\n' ++ '\n' ++ '* any empty mapping, for example, "{}".\n' ++ '\n' ++ '* instances of user-defined classes, if the class defines a\n' ++ ' "__bool__()" or "__len__()" method, when that method returns ' ++ 'the\n' ++ ' integer zero or "bool" value "False". [1]\n' ++ '\n' ++ 'All other values are considered true --- so objects of many types ' ++ 'are\n' ++ 'always true.\n' ++ '\n' ++ 'Operations and built-in functions that have a Boolean result ' ++ 'always\n' ++ 'return "0" or "False" for false and "1" or "True" for true, ' ++ 'unless\n' ++ 'otherwise stated. (Important exception: the Boolean operations ' ++ '"or"\n' ++ 'and "and" always return one of their operands.)\n', ++ 'try': '\n' ++ 'The "try" statement\n' ++ '*******************\n' ++ '\n' ++ 'The "try" statement specifies exception handlers and/or cleanup ' ++ 'code\n' ++ 'for a group of statements:\n' ++ '\n' ++ ' try_stmt ::= try1_stmt | try2_stmt\n' ++ ' try1_stmt ::= "try" ":" suite\n' ++ ' ("except" [expression ["as" identifier]] ":" ' ++ 'suite)+\n' ++ ' ["else" ":" suite]\n' ++ ' ["finally" ":" suite]\n' ++ ' try2_stmt ::= "try" ":" suite\n' ++ ' "finally" ":" suite\n' ++ '\n' ++ 'The "except" clause(s) specify one or more exception handlers. When ' ++ 'no\n' ++ 'exception occurs in the "try" clause, no exception handler is\n' ++ 'executed. When an exception occurs in the "try" suite, a search for ' ++ 'an\n' ++ 'exception handler is started. This search inspects the except ' ++ 'clauses\n' ++ 'in turn until one is found that matches the exception. An ' ++ 'expression-\n' ++ 'less except clause, if present, must be last; it matches any\n' ++ 'exception. For an except clause with an expression, that ' ++ 'expression\n' ++ 'is evaluated, and the clause matches the exception if the ' ++ 'resulting\n' ++ 'object is "compatible" with the exception. An object is ' ++ 'compatible\n' ++ 'with an exception if it is the class or a base class of the ' ++ 'exception\n' ++ 'object or a tuple containing an item compatible with the ' ++ 'exception.\n' ++ '\n' ++ 'If no except clause matches the exception, the search for an ' ++ 'exception\n' ++ 'handler continues in the surrounding code and on the invocation ' ++ 'stack.\n' ++ '[1]\n' ++ '\n' ++ 'If the evaluation of an expression in the header of an except ' ++ 'clause\n' ++ 'raises an exception, the original search for a handler is canceled ' ++ 'and\n' ++ 'a search starts for the new exception in the surrounding code and ' ++ 'on\n' ++ 'the call stack (it is treated as if the entire "try" statement ' ++ 'raised\n' ++ 'the exception).\n' ++ '\n' ++ 'When a matching except clause is found, the exception is assigned ' ++ 'to\n' ++ 'the target specified after the "as" keyword in that except clause, ' ++ 'if\n' ++ "present, and the except clause's suite is executed. All except\n" ++ 'clauses must have an executable block. When the end of this block ' ++ 'is\n' ++ 'reached, execution continues normally after the entire try ' ++ 'statement.\n' ++ '(This means that if two nested handlers exist for the same ' ++ 'exception,\n' ++ 'and the exception occurs in the try clause of the inner handler, ' ++ 'the\n' ++ 'outer handler will not handle the exception.)\n' ++ '\n' ++ 'When an exception has been assigned using "as target", it is ' ++ 'cleared\n' ++ 'at the end of the except clause. This is as if\n' ++ '\n' ++ ' except E as N:\n' ++ ' foo\n' ++ '\n' ++ 'was translated to\n' ++ '\n' ++ ' except E as N:\n' ++ ' try:\n' ++ ' foo\n' ++ ' finally:\n' ++ ' del N\n' ++ '\n' ++ 'This means the exception must be assigned to a different name to ' ++ 'be\n' ++ 'able to refer to it after the except clause. Exceptions are ' ++ 'cleared\n' ++ 'because with the traceback attached to them, they form a reference\n' ++ 'cycle with the stack frame, keeping all locals in that frame alive\n' ++ 'until the next garbage collection occurs.\n' ++ '\n' ++ "Before an except clause's suite is executed, details about the\n" ++ 'exception are stored in the "sys" module and can be accessed via\n' ++ '"sys.exc_info()". "sys.exc_info()" returns a 3-tuple consisting of ' ++ 'the\n' ++ 'exception class, the exception instance and a traceback object ' ++ '(see\n' ++ 'section *The standard type hierarchy*) identifying the point in ' ++ 'the\n' ++ 'program where the exception occurred. "sys.exc_info()" values are\n' ++ 'restored to their previous values (before the call) when returning\n' ++ 'from a function that handled an exception.\n' ++ '\n' ++ 'The optional "else" clause is executed if and when control flows ' ++ 'off\n' ++ 'the end of the "try" clause. [2] Exceptions in the "else" clause ' ++ 'are\n' ++ 'not handled by the preceding "except" clauses.\n' ++ '\n' ++ 'If "finally" is present, it specifies a \'cleanup\' handler. The ' ++ '"try"\n' ++ 'clause is executed, including any "except" and "else" clauses. If ' ++ 'an\n' ++ 'exception occurs in any of the clauses and is not handled, the\n' ++ 'exception is temporarily saved. The "finally" clause is executed. ' ++ 'If\n' ++ 'there is a saved exception it is re-raised at the end of the ' ++ '"finally"\n' ++ 'clause. If the "finally" clause raises another exception, the ' ++ 'saved\n' ++ 'exception is set as the context of the new exception. If the ' ++ '"finally"\n' ++ 'clause executes a "return" or "break" statement, the saved ' ++ 'exception\n' ++ 'is discarded:\n' ++ '\n' ++ ' >>> def f():\n' ++ ' ... try:\n' ++ ' ... 1/0\n' ++ ' ... finally:\n' ++ ' ... return 42\n' ++ ' ...\n' ++ ' >>> f()\n' ++ ' 42\n' ++ '\n' ++ 'The exception information is not available to the program during\n' ++ 'execution of the "finally" clause.\n' ++ '\n' ++ 'When a "return", "break" or "continue" statement is executed in ' ++ 'the\n' ++ '"try" suite of a "try"..."finally" statement, the "finally" clause ' ++ 'is\n' ++ 'also executed \'on the way out.\' A "continue" statement is illegal ' ++ 'in\n' ++ 'the "finally" clause. (The reason is a problem with the current\n' ++ 'implementation --- this restriction may be lifted in the future).\n' ++ '\n' ++ 'The return value of a function is determined by the last "return"\n' ++ 'statement executed. Since the "finally" clause always executes, a\n' ++ '"return" statement executed in the "finally" clause will always be ' ++ 'the\n' ++ 'last one executed:\n' ++ '\n' ++ ' >>> def foo():\n' ++ ' ... try:\n' ++ " ... return 'try'\n" ++ ' ... finally:\n' ++ " ... return 'finally'\n" ++ ' ...\n' ++ ' >>> foo()\n' ++ " 'finally'\n" ++ '\n' ++ 'Additional information on exceptions can be found in section\n' ++ '*Exceptions*, and information on using the "raise" statement to\n' ++ 'generate exceptions may be found in section *The raise statement*.\n', ++ 'types': '\n' ++ 'The standard type hierarchy\n' ++ '***************************\n' ++ '\n' ++ 'Below is a list of the types that are built into Python. ' ++ 'Extension\n' ++ 'modules (written in C, Java, or other languages, depending on ' ++ 'the\n' ++ 'implementation) can define additional types. Future versions of\n' ++ 'Python may add types to the type hierarchy (e.g., rational ' ++ 'numbers,\n' ++ 'efficiently stored arrays of integers, etc.), although such ' ++ 'additions\n' ++ 'will often be provided via the standard library instead.\n' ++ '\n' ++ 'Some of the type descriptions below contain a paragraph listing\n' ++ "'special attributes.' These are attributes that provide access " ++ 'to the\n' ++ 'implementation and are not intended for general use. Their ' ++ 'definition\n' ++ 'may change in the future.\n' ++ '\n' ++ 'None\n' ++ ' This type has a single value. There is a single object with ' ++ 'this\n' ++ ' value. This object is accessed through the built-in name ' ++ '"None". It\n' ++ ' is used to signify the absence of a value in many situations, ' ++ 'e.g.,\n' ++ " it is returned from functions that don't explicitly return\n" ++ ' anything. Its truth value is false.\n' ++ '\n' ++ 'NotImplemented\n' ++ ' This type has a single value. There is a single object with ' ++ 'this\n' ++ ' value. This object is accessed through the built-in name\n' ++ ' "NotImplemented". Numeric methods and rich comparison methods ' ++ 'may\n' ++ ' return this value if they do not implement the operation for ' ++ 'the\n' ++ ' operands provided. (The interpreter will then try the ' ++ 'reflected\n' ++ ' operation, or some other fallback, depending on the ' ++ 'operator.) Its\n' ++ ' truth value is true.\n' ++ '\n' ++ 'Ellipsis\n' ++ ' This type has a single value. There is a single object with ' ++ 'this\n' ++ ' value. This object is accessed through the literal "..." or ' ++ 'the\n' ++ ' built-in name "Ellipsis". Its truth value is true.\n' ++ '\n' ++ '"numbers.Number"\n' ++ ' These are created by numeric literals and returned as results ' ++ 'by\n' ++ ' arithmetic operators and arithmetic built-in functions. ' ++ 'Numeric\n' ++ ' objects are immutable; once created their value never ' ++ 'changes.\n' ++ ' Python numbers are of course strongly related to mathematical\n' ++ ' numbers, but subject to the limitations of numerical ' ++ 'representation\n' ++ ' in computers.\n' ++ '\n' ++ ' Python distinguishes between integers, floating point numbers, ' ++ 'and\n' ++ ' complex numbers:\n' ++ '\n' ++ ' "numbers.Integral"\n' ++ ' These represent elements from the mathematical set of ' ++ 'integers\n' ++ ' (positive and negative).\n' ++ '\n' ++ ' There are two types of integers:\n' ++ '\n' ++ ' Integers ("int")\n' ++ '\n' ++ ' These represent numbers in an unlimited range, subject ' ++ 'to\n' ++ ' available (virtual) memory only. For the purpose of ' ++ 'shift\n' ++ ' and mask operations, a binary representation is assumed, ' ++ 'and\n' ++ " negative numbers are represented in a variant of 2's\n" ++ ' complement which gives the illusion of an infinite ' ++ 'string of\n' ++ ' sign bits extending to the left.\n' ++ '\n' ++ ' Booleans ("bool")\n' ++ ' These represent the truth values False and True. The ' ++ 'two\n' ++ ' objects representing the values "False" and "True" are ' ++ 'the\n' ++ ' only Boolean objects. The Boolean type is a subtype of ' ++ 'the\n' ++ ' integer type, and Boolean values behave like the values ' ++ '0 and\n' ++ ' 1, respectively, in almost all contexts, the exception ' ++ 'being\n' ++ ' that when converted to a string, the strings ""False"" ' ++ 'or\n' ++ ' ""True"" are returned, respectively.\n' ++ '\n' ++ ' The rules for integer representation are intended to give ' ++ 'the\n' ++ ' most meaningful interpretation of shift and mask ' ++ 'operations\n' ++ ' involving negative integers.\n' ++ '\n' ++ ' "numbers.Real" ("float")\n' ++ ' These represent machine-level double precision floating ' ++ 'point\n' ++ ' numbers. You are at the mercy of the underlying machine\n' ++ ' architecture (and C or Java implementation) for the ' ++ 'accepted\n' ++ ' range and handling of overflow. Python does not support ' ++ 'single-\n' ++ ' precision floating point numbers; the savings in processor ' ++ 'and\n' ++ ' memory usage that are usually the reason for using these ' ++ 'is\n' ++ ' dwarfed by the overhead of using objects in Python, so ' ++ 'there is\n' ++ ' no reason to complicate the language with two kinds of ' ++ 'floating\n' ++ ' point numbers.\n' ++ '\n' ++ ' "numbers.Complex" ("complex")\n' ++ ' These represent complex numbers as a pair of machine-level\n' ++ ' double precision floating point numbers. The same caveats ' ++ 'apply\n' ++ ' as for floating point numbers. The real and imaginary parts ' ++ 'of a\n' ++ ' complex number "z" can be retrieved through the read-only\n' ++ ' attributes "z.real" and "z.imag".\n' ++ '\n' ++ 'Sequences\n' ++ ' These represent finite ordered sets indexed by non-negative\n' ++ ' numbers. The built-in function "len()" returns the number of ' ++ 'items\n' ++ ' of a sequence. When the length of a sequence is *n*, the index ' ++ 'set\n' ++ ' contains the numbers 0, 1, ..., *n*-1. Item *i* of sequence ' ++ '*a* is\n' ++ ' selected by "a[i]".\n' ++ '\n' ++ ' Sequences also support slicing: "a[i:j]" selects all items ' ++ 'with\n' ++ ' index *k* such that *i* "<=" *k* "<" *j*. When used as an\n' ++ ' expression, a slice is a sequence of the same type. This ' ++ 'implies\n' ++ ' that the index set is renumbered so that it starts at 0.\n' ++ '\n' ++ ' Some sequences also support "extended slicing" with a third ' ++ '"step"\n' ++ ' parameter: "a[i:j:k]" selects all items of *a* with index *x* ' ++ 'where\n' ++ ' "x = i + n*k", *n* ">=" "0" and *i* "<=" *x* "<" *j*.\n' ++ '\n' ++ ' Sequences are distinguished according to their mutability:\n' ++ '\n' ++ ' Immutable sequences\n' ++ ' An object of an immutable sequence type cannot change once ' ++ 'it is\n' ++ ' created. (If the object contains references to other ' ++ 'objects,\n' ++ ' these other objects may be mutable and may be changed; ' ++ 'however,\n' ++ ' the collection of objects directly referenced by an ' ++ 'immutable\n' ++ ' object cannot change.)\n' ++ '\n' ++ ' The following types are immutable sequences:\n' ++ '\n' ++ ' Strings\n' ++ ' A string is a sequence of values that represent Unicode ' ++ 'code\n' ++ ' points. All the code points in the range "U+0000 - ' ++ 'U+10FFFF"\n' ++ " can be represented in a string. Python doesn't have a " ++ '"char"\n' ++ ' type; instead, every code point in the string is ' ++ 'represented\n' ++ ' as a string object with length "1". The built-in ' ++ 'function\n' ++ ' "ord()" converts a code point from its string form to ' ++ 'an\n' ++ ' integer in the range "0 - 10FFFF"; "chr()" converts an\n' ++ ' integer in the range "0 - 10FFFF" to the corresponding ' ++ 'length\n' ++ ' "1" string object. "str.encode()" can be used to convert ' ++ 'a\n' ++ ' "str" to "bytes" using the given text encoding, and\n' ++ ' "bytes.decode()" can be used to achieve the opposite.\n' ++ '\n' ++ ' Tuples\n' ++ ' The items of a tuple are arbitrary Python objects. ' ++ 'Tuples of\n' ++ ' two or more items are formed by comma-separated lists ' ++ 'of\n' ++ " expressions. A tuple of one item (a 'singleton') can " ++ 'be\n' ++ ' formed by affixing a comma to an expression (an ' ++ 'expression by\n' ++ ' itself does not create a tuple, since parentheses must ' ++ 'be\n' ++ ' usable for grouping of expressions). An empty tuple can ' ++ 'be\n' ++ ' formed by an empty pair of parentheses.\n' ++ '\n' ++ ' Bytes\n' ++ ' A bytes object is an immutable array. The items are ' ++ '8-bit\n' ++ ' bytes, represented by integers in the range 0 <= x < ' ++ '256.\n' ++ ' Bytes literals (like "b\'abc\'") and the built-in ' ++ 'function\n' ++ ' "bytes()" can be used to construct bytes objects. ' ++ 'Also,\n' ++ ' bytes objects can be decoded to strings via the ' ++ '"decode()"\n' ++ ' method.\n' ++ '\n' ++ ' Mutable sequences\n' ++ ' Mutable sequences can be changed after they are created. ' ++ 'The\n' ++ ' subscription and slicing notations can be used as the ' ++ 'target of\n' ++ ' assignment and "del" (delete) statements.\n' ++ '\n' ++ ' There are currently two intrinsic mutable sequence types:\n' ++ '\n' ++ ' Lists\n' ++ ' The items of a list are arbitrary Python objects. Lists ' ++ 'are\n' ++ ' formed by placing a comma-separated list of expressions ' ++ 'in\n' ++ ' square brackets. (Note that there are no special cases ' ++ 'needed\n' ++ ' to form lists of length 0 or 1.)\n' ++ '\n' ++ ' Byte Arrays\n' ++ ' A bytearray object is a mutable array. They are created ' ++ 'by\n' ++ ' the built-in "bytearray()" constructor. Aside from ' ++ 'being\n' ++ ' mutable (and hence unhashable), byte arrays otherwise ' ++ 'provide\n' ++ ' the same interface and functionality as immutable bytes\n' ++ ' objects.\n' ++ '\n' ++ ' The extension module "array" provides an additional example ' ++ 'of a\n' ++ ' mutable sequence type, as does the "collections" module.\n' ++ '\n' ++ 'Set types\n' ++ ' These represent unordered, finite sets of unique, immutable\n' ++ ' objects. As such, they cannot be indexed by any subscript. ' ++ 'However,\n' ++ ' they can be iterated over, and the built-in function "len()"\n' ++ ' returns the number of items in a set. Common uses for sets are ' ++ 'fast\n' ++ ' membership testing, removing duplicates from a sequence, and\n' ++ ' computing mathematical operations such as intersection, ' ++ 'union,\n' ++ ' difference, and symmetric difference.\n' ++ '\n' ++ ' For set elements, the same immutability rules apply as for\n' ++ ' dictionary keys. Note that numeric types obey the normal rules ' ++ 'for\n' ++ ' numeric comparison: if two numbers compare equal (e.g., "1" ' ++ 'and\n' ++ ' "1.0"), only one of them can be contained in a set.\n' ++ '\n' ++ ' There are currently two intrinsic set types:\n' ++ '\n' ++ ' Sets\n' ++ ' These represent a mutable set. They are created by the ' ++ 'built-in\n' ++ ' "set()" constructor and can be modified afterwards by ' ++ 'several\n' ++ ' methods, such as "add()".\n' ++ '\n' ++ ' Frozen sets\n' ++ ' These represent an immutable set. They are created by the\n' ++ ' built-in "frozenset()" constructor. As a frozenset is ' ++ 'immutable\n' ++ ' and *hashable*, it can be used again as an element of ' ++ 'another\n' ++ ' set, or as a dictionary key.\n' ++ '\n' ++ 'Mappings\n' ++ ' These represent finite sets of objects indexed by arbitrary ' ++ 'index\n' ++ ' sets. The subscript notation "a[k]" selects the item indexed ' ++ 'by "k"\n' ++ ' from the mapping "a"; this can be used in expressions and as ' ++ 'the\n' ++ ' target of assignments or "del" statements. The built-in ' ++ 'function\n' ++ ' "len()" returns the number of items in a mapping.\n' ++ '\n' ++ ' There is currently a single intrinsic mapping type:\n' ++ '\n' ++ ' Dictionaries\n' ++ ' These represent finite sets of objects indexed by nearly\n' ++ ' arbitrary values. The only types of values not acceptable ' ++ 'as\n' ++ ' keys are values containing lists or dictionaries or other\n' ++ ' mutable types that are compared by value rather than by ' ++ 'object\n' ++ ' identity, the reason being that the efficient ' ++ 'implementation of\n' ++ " dictionaries requires a key's hash value to remain " ++ 'constant.\n' ++ ' Numeric types used for keys obey the normal rules for ' ++ 'numeric\n' ++ ' comparison: if two numbers compare equal (e.g., "1" and ' ++ '"1.0")\n' ++ ' then they can be used interchangeably to index the same\n' ++ ' dictionary entry.\n' ++ '\n' ++ ' Dictionaries are mutable; they can be created by the ' ++ '"{...}"\n' ++ ' notation (see section *Dictionary displays*).\n' ++ '\n' ++ ' The extension modules "dbm.ndbm" and "dbm.gnu" provide\n' ++ ' additional examples of mapping types, as does the ' ++ '"collections"\n' ++ ' module.\n' ++ '\n' ++ 'Callable types\n' ++ ' These are the types to which the function call operation (see\n' ++ ' section *Calls*) can be applied:\n' ++ '\n' ++ ' User-defined functions\n' ++ ' A user-defined function object is created by a function\n' ++ ' definition (see section *Function definitions*). It should ' ++ 'be\n' ++ ' called with an argument list containing the same number of ' ++ 'items\n' ++ " as the function's formal parameter list.\n" ++ '\n' ++ ' Special attributes:\n' ++ '\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | Attribute | ' ++ 'Meaning | |\n' ++ ' ' ++ '+===========================+=================================+=============+\n' ++ ' | "__doc__" | The function\'s ' ++ 'documentation | Writable |\n' ++ ' | | string, or "None" ' ++ 'if | |\n' ++ ' | | ' ++ 'unavailable | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__name__" | The function\'s ' ++ 'name | Writable |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__qualname__" | The function\'s *qualified ' ++ 'name* | Writable |\n' ++ ' | | New in version ' ++ '3.3. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__module__" | The name of the module ' ++ 'the | Writable |\n' ++ ' | | function was defined in, ' ++ 'or | |\n' ++ ' | | "None" if ' ++ 'unavailable. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__defaults__" | A tuple containing ' ++ 'default | Writable |\n' ++ ' | | argument values for ' ++ 'those | |\n' ++ ' | | arguments that have ' ++ 'defaults, | |\n' ++ ' | | or "None" if no arguments ' ++ 'have | |\n' ++ ' | | a default ' ++ 'value | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__code__" | The code object ' ++ 'representing | Writable |\n' ++ ' | | the compiled function ' ++ 'body. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__globals__" | A reference to the ' ++ 'dictionary | Read-only |\n' ++ ' | | that holds the ' ++ "function's | |\n" ++ ' | | global variables --- the ' ++ 'global | |\n' ++ ' | | namespace of the module ' ++ 'in | |\n' ++ ' | | which the function was ' ++ 'defined. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__dict__" | The namespace ' ++ 'supporting | Writable |\n' ++ ' | | arbitrary function ' ++ 'attributes. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__closure__" | "None" or a tuple of cells ' ++ 'that | Read-only |\n' ++ ' | | contain bindings for ' ++ 'the | |\n' ++ " | | function's free " ++ 'variables. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__annotations__" | A dict containing ' ++ 'annotations | Writable |\n' ++ ' | | of parameters. The keys of ' ++ 'the | |\n' ++ ' | | dict are the parameter ' ++ 'names, | |\n' ++ ' | | and "\'return\'" for the ' ++ 'return | |\n' ++ ' | | annotation, if ' ++ 'provided. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ ' | "__kwdefaults__" | A dict containing defaults ' ++ 'for | Writable |\n' ++ ' | | keyword-only ' ++ 'parameters. | |\n' ++ ' ' ++ '+---------------------------+---------------------------------+-------------+\n' ++ '\n' ++ ' Most of the attributes labelled "Writable" check the type ' ++ 'of the\n' ++ ' assigned value.\n' ++ '\n' ++ ' Function objects also support getting and setting ' ++ 'arbitrary\n' ++ ' attributes, which can be used, for example, to attach ' ++ 'metadata\n' ++ ' to functions. Regular attribute dot-notation is used to ' ++ 'get and\n' ++ ' set such attributes. *Note that the current implementation ' ++ 'only\n' ++ ' supports function attributes on user-defined functions. ' ++ 'Function\n' ++ ' attributes on built-in functions may be supported in the\n' ++ ' future.*\n' ++ '\n' ++ " Additional information about a function's definition can " ++ 'be\n' ++ ' retrieved from its code object; see the description of ' ++ 'internal\n' ++ ' types below.\n' ++ '\n' ++ ' Instance methods\n' ++ ' An instance method object combines a class, a class ' ++ 'instance and\n' ++ ' any callable object (normally a user-defined function).\n' ++ '\n' ++ ' Special read-only attributes: "__self__" is the class ' ++ 'instance\n' ++ ' object, "__func__" is the function object; "__doc__" is ' ++ 'the\n' ++ ' method\'s documentation (same as "__func__.__doc__"); ' ++ '"__name__"\n' ++ ' is the method name (same as "__func__.__name__"); ' ++ '"__module__"\n' ++ ' is the name of the module the method was defined in, or ' ++ '"None"\n' ++ ' if unavailable.\n' ++ '\n' ++ ' Methods also support accessing (but not setting) the ' ++ 'arbitrary\n' ++ ' function attributes on the underlying function object.\n' ++ '\n' ++ ' User-defined method objects may be created when getting an\n' ++ ' attribute of a class (perhaps via an instance of that ' ++ 'class), if\n' ++ ' that attribute is a user-defined function object or a ' ++ 'class\n' ++ ' method object.\n' ++ '\n' ++ ' When an instance method object is created by retrieving a ' ++ 'user-\n' ++ ' defined function object from a class via one of its ' ++ 'instances,\n' ++ ' its "__self__" attribute is the instance, and the method ' ++ 'object\n' ++ ' is said to be bound. The new method\'s "__func__" ' ++ 'attribute is\n' ++ ' the original function object.\n' ++ '\n' ++ ' When a user-defined method object is created by retrieving\n' ++ ' another method object from a class or instance, the ' ++ 'behaviour is\n' ++ ' the same as for a function object, except that the ' ++ '"__func__"\n' ++ ' attribute of the new instance is not the original method ' ++ 'object\n' ++ ' but its "__func__" attribute.\n' ++ '\n' ++ ' When an instance method object is created by retrieving a ' ++ 'class\n' ++ ' method object from a class or instance, its "__self__" ' ++ 'attribute\n' ++ ' is the class itself, and its "__func__" attribute is the\n' ++ ' function object underlying the class method.\n' ++ '\n' ++ ' When an instance method object is called, the underlying\n' ++ ' function ("__func__") is called, inserting the class ' ++ 'instance\n' ++ ' ("__self__") in front of the argument list. For instance, ' ++ 'when\n' ++ ' "C" is a class which contains a definition for a function ' ++ '"f()",\n' ++ ' and "x" is an instance of "C", calling "x.f(1)" is ' ++ 'equivalent to\n' ++ ' calling "C.f(x, 1)".\n' ++ '\n' ++ ' When an instance method object is derived from a class ' ++ 'method\n' ++ ' object, the "class instance" stored in "__self__" will ' ++ 'actually\n' ++ ' be the class itself, so that calling either "x.f(1)" or ' ++ '"C.f(1)"\n' ++ ' is equivalent to calling "f(C,1)" where "f" is the ' ++ 'underlying\n' ++ ' function.\n' ++ '\n' ++ ' Note that the transformation from function object to ' ++ 'instance\n' ++ ' method object happens each time the attribute is retrieved ' ++ 'from\n' ++ ' the instance. In some cases, a fruitful optimization is ' ++ 'to\n' ++ ' assign the attribute to a local variable and call that ' ++ 'local\n' ++ ' variable. Also notice that this transformation only happens ' ++ 'for\n' ++ ' user-defined functions; other callable objects (and all ' ++ 'non-\n' ++ ' callable objects) are retrieved without transformation. It ' ++ 'is\n' ++ ' also important to note that user-defined functions which ' ++ 'are\n' ++ ' attributes of a class instance are not converted to bound\n' ++ ' methods; this *only* happens when the function is an ' ++ 'attribute\n' ++ ' of the class.\n' ++ '\n' ++ ' Generator functions\n' ++ ' A function or method which uses the "yield" statement (see\n' ++ ' section *The yield statement*) is called a *generator ' ++ 'function*.\n' ++ ' Such a function, when called, always returns an iterator ' ++ 'object\n' ++ ' which can be used to execute the body of the function: ' ++ 'calling\n' ++ ' the iterator\'s "iterator.__next__()" method will cause ' ++ 'the\n' ++ ' function to execute until it provides a value using the ' ++ '"yield"\n' ++ ' statement. When the function executes a "return" statement ' ++ 'or\n' ++ ' falls off the end, a "StopIteration" exception is raised ' ++ 'and the\n' ++ ' iterator will have reached the end of the set of values to ' ++ 'be\n' ++ ' returned.\n' ++ '\n' ++ ' Built-in functions\n' ++ ' A built-in function object is a wrapper around a C ' ++ 'function.\n' ++ ' Examples of built-in functions are "len()" and ' ++ '"math.sin()"\n' ++ ' ("math" is a standard built-in module). The number and type ' ++ 'of\n' ++ ' the arguments are determined by the C function. Special ' ++ 'read-\n' ++ ' only attributes: "__doc__" is the function\'s ' ++ 'documentation\n' ++ ' string, or "None" if unavailable; "__name__" is the ' ++ "function's\n" ++ ' name; "__self__" is set to "None" (but see the next item);\n' ++ ' "__module__" is the name of the module the function was ' ++ 'defined\n' ++ ' in or "None" if unavailable.\n' ++ '\n' ++ ' Built-in methods\n' ++ ' This is really a different disguise of a built-in function, ' ++ 'this\n' ++ ' time containing an object passed to the C function as an\n' ++ ' implicit extra argument. An example of a built-in method ' ++ 'is\n' ++ ' "alist.append()", assuming *alist* is a list object. In ' ++ 'this\n' ++ ' case, the special read-only attribute "__self__" is set to ' ++ 'the\n' ++ ' object denoted by *alist*.\n' ++ '\n' ++ ' Classes\n' ++ ' Classes are callable. These objects normally act as ' ++ 'factories\n' ++ ' for new instances of themselves, but variations are ' ++ 'possible for\n' ++ ' class types that override "__new__()". The arguments of ' ++ 'the\n' ++ ' call are passed to "__new__()" and, in the typical case, ' ++ 'to\n' ++ ' "__init__()" to initialize the new instance.\n' ++ '\n' ++ ' Class Instances\n' ++ ' Instances of arbitrary classes can be made callable by ' ++ 'defining\n' ++ ' a "__call__()" method in their class.\n' ++ '\n' ++ 'Modules\n' ++ ' Modules are a basic organizational unit of Python code, and ' ++ 'are\n' ++ ' created by the *import system* as invoked either by the ' ++ '"import"\n' ++ ' statement (see "import"), or by calling functions such as\n' ++ ' "importlib.import_module()" and built-in "__import__()". A ' ++ 'module\n' ++ ' object has a namespace implemented by a dictionary object ' ++ '(this is\n' ++ ' the dictionary referenced by the "__globals__" attribute of\n' ++ ' functions defined in the module). Attribute references are\n' ++ ' translated to lookups in this dictionary, e.g., "m.x" is ' ++ 'equivalent\n' ++ ' to "m.__dict__["x"]". A module object does not contain the ' ++ 'code\n' ++ " object used to initialize the module (since it isn't needed " ++ 'once\n' ++ ' the initialization is done).\n' ++ '\n' ++ " Attribute assignment updates the module's namespace " ++ 'dictionary,\n' ++ ' e.g., "m.x = 1" is equivalent to "m.__dict__["x"] = 1".\n' ++ '\n' ++ ' Special read-only attribute: "__dict__" is the module\'s ' ++ 'namespace\n' ++ ' as a dictionary object.\n' ++ '\n' ++ ' **CPython implementation detail:** Because of the way CPython\n' ++ ' clears module dictionaries, the module dictionary will be ' ++ 'cleared\n' ++ ' when the module falls out of scope even if the dictionary ' ++ 'still has\n' ++ ' live references. To avoid this, copy the dictionary or keep ' ++ 'the\n' ++ ' module around while using its dictionary directly.\n' ++ '\n' ++ ' Predefined (writable) attributes: "__name__" is the module\'s ' ++ 'name;\n' ++ ' "__doc__" is the module\'s documentation string, or "None" if\n' ++ ' unavailable; "__file__" is the pathname of the file from which ' ++ 'the\n' ++ ' module was loaded, if it was loaded from a file. The ' ++ '"__file__"\n' ++ ' attribute may be missing for certain types of modules, such as ' ++ 'C\n' ++ ' modules that are statically linked into the interpreter; for\n' ++ ' extension modules loaded dynamically from a shared library, it ' ++ 'is\n' ++ ' the pathname of the shared library file.\n' ++ '\n' ++ 'Custom classes\n' ++ ' Custom class types are typically created by class definitions ' ++ '(see\n' ++ ' section *Class definitions*). A class has a namespace ' ++ 'implemented\n' ++ ' by a dictionary object. Class attribute references are ' ++ 'translated\n' ++ ' to lookups in this dictionary, e.g., "C.x" is translated to\n' ++ ' "C.__dict__["x"]" (although there are a number of hooks which ' ++ 'allow\n' ++ ' for other means of locating attributes). When the attribute ' ++ 'name is\n' ++ ' not found there, the attribute search continues in the base\n' ++ ' classes. This search of the base classes uses the C3 method\n' ++ ' resolution order which behaves correctly even in the presence ' ++ 'of\n' ++ " 'diamond' inheritance structures where there are multiple\n" ++ ' inheritance paths leading back to a common ancestor. ' ++ 'Additional\n' ++ ' details on the C3 MRO used by Python can be found in the\n' ++ ' documentation accompanying the 2.3 release at\n' ++ ' http://www.python.org/download/releases/2.3/mro/.\n' ++ '\n' ++ ' When a class attribute reference (for class "C", say) would ' ++ 'yield a\n' ++ ' class method object, it is transformed into an instance ' ++ 'method\n' ++ ' object whose "__self__" attributes is "C". When it would ' ++ 'yield a\n' ++ ' static method object, it is transformed into the object ' ++ 'wrapped by\n' ++ ' the static method object. See section *Implementing ' ++ 'Descriptors*\n' ++ ' for another way in which attributes retrieved from a class ' ++ 'may\n' ++ ' differ from those actually contained in its "__dict__".\n' ++ '\n' ++ " Class attribute assignments update the class's dictionary, " ++ 'never\n' ++ ' the dictionary of a base class.\n' ++ '\n' ++ ' A class object can be called (see above) to yield a class ' ++ 'instance\n' ++ ' (see below).\n' ++ '\n' ++ ' Special attributes: "__name__" is the class name; "__module__" ' ++ 'is\n' ++ ' the module name in which the class was defined; "__dict__" is ' ++ 'the\n' ++ ' dictionary containing the class\'s namespace; "__bases__" is a ' ++ 'tuple\n' ++ ' (possibly empty or a singleton) containing the base classes, ' ++ 'in the\n' ++ ' order of their occurrence in the base class list; "__doc__" is ' ++ 'the\n' ++ " class's documentation string, or None if undefined.\n" ++ '\n' ++ 'Class instances\n' ++ ' A class instance is created by calling a class object (see ' ++ 'above).\n' ++ ' A class instance has a namespace implemented as a dictionary ' ++ 'which\n' ++ ' is the first place in which attribute references are ' ++ 'searched.\n' ++ " When an attribute is not found there, and the instance's class " ++ 'has\n' ++ ' an attribute by that name, the search continues with the ' ++ 'class\n' ++ ' attributes. If a class attribute is found that is a ' ++ 'user-defined\n' ++ ' function object, it is transformed into an instance method ' ++ 'object\n' ++ ' whose "__self__" attribute is the instance. Static method ' ++ 'and\n' ++ ' class method objects are also transformed; see above under\n' ++ ' "Classes". See section *Implementing Descriptors* for another ' ++ 'way\n' ++ ' in which attributes of a class retrieved via its instances ' ++ 'may\n' ++ " differ from the objects actually stored in the class's " ++ '"__dict__".\n' ++ " If no class attribute is found, and the object's class has a\n" ++ ' "__getattr__()" method, that is called to satisfy the lookup.\n' ++ '\n' ++ " Attribute assignments and deletions update the instance's\n" ++ " dictionary, never a class's dictionary. If the class has a\n" ++ ' "__setattr__()" or "__delattr__()" method, this is called ' ++ 'instead\n' ++ ' of updating the instance dictionary directly.\n' ++ '\n' ++ ' Class instances can pretend to be numbers, sequences, or ' ++ 'mappings\n' ++ ' if they have methods with certain special names. See section\n' ++ ' *Special method names*.\n' ++ '\n' ++ ' Special attributes: "__dict__" is the attribute dictionary;\n' ++ ' "__class__" is the instance\'s class.\n' ++ '\n' ++ 'I/O objects (also known as file objects)\n' ++ ' A *file object* represents an open file. Various shortcuts ' ++ 'are\n' ++ ' available to create file objects: the "open()" built-in ' ++ 'function,\n' ++ ' and also "os.popen()", "os.fdopen()", and the "makefile()" ' ++ 'method\n' ++ ' of socket objects (and perhaps by other functions or methods\n' ++ ' provided by extension modules).\n' ++ '\n' ++ ' The objects "sys.stdin", "sys.stdout" and "sys.stderr" are\n' ++ ' initialized to file objects corresponding to the ' ++ "interpreter's\n" ++ ' standard input, output and error streams; they are all open in ' ++ 'text\n' ++ ' mode and therefore follow the interface defined by the\n' ++ ' "io.TextIOBase" abstract class.\n' ++ '\n' ++ 'Internal types\n' ++ ' A few types used internally by the interpreter are exposed to ' ++ 'the\n' ++ ' user. Their definitions may change with future versions of ' ++ 'the\n' ++ ' interpreter, but they are mentioned here for completeness.\n' ++ '\n' ++ ' Code objects\n' ++ ' Code objects represent *byte-compiled* executable Python ' ++ 'code,\n' ++ ' or *bytecode*. The difference between a code object and a\n' ++ ' function object is that the function object contains an ' ++ 'explicit\n' ++ " reference to the function's globals (the module in which it " ++ 'was\n' ++ ' defined), while a code object contains no context; also ' ++ 'the\n' ++ ' default argument values are stored in the function object, ' ++ 'not\n' ++ ' in the code object (because they represent values ' ++ 'calculated at\n' ++ ' run-time). Unlike function objects, code objects are ' ++ 'immutable\n' ++ ' and contain no references (directly or indirectly) to ' ++ 'mutable\n' ++ ' objects.\n' ++ '\n' ++ ' Special read-only attributes: "co_name" gives the function ' ++ 'name;\n' ++ ' "co_argcount" is the number of positional arguments ' ++ '(including\n' ++ ' arguments with default values); "co_nlocals" is the number ' ++ 'of\n' ++ ' local variables used by the function (including ' ++ 'arguments);\n' ++ ' "co_varnames" is a tuple containing the names of the local\n' ++ ' variables (starting with the argument names); "co_cellvars" ' ++ 'is a\n' ++ ' tuple containing the names of local variables that are\n' ++ ' referenced by nested functions; "co_freevars" is a tuple\n' ++ ' containing the names of free variables; "co_code" is a ' ++ 'string\n' ++ ' representing the sequence of bytecode instructions; ' ++ '"co_consts"\n' ++ ' is a tuple containing the literals used by the bytecode;\n' ++ ' "co_names" is a tuple containing the names used by the ' ++ 'bytecode;\n' ++ ' "co_filename" is the filename from which the code was ' ++ 'compiled;\n' ++ ' "co_firstlineno" is the first line number of the function;\n' ++ ' "co_lnotab" is a string encoding the mapping from bytecode\n' ++ ' offsets to line numbers (for details see the source code of ' ++ 'the\n' ++ ' interpreter); "co_stacksize" is the required stack size\n' ++ ' (including local variables); "co_flags" is an integer ' ++ 'encoding a\n' ++ ' number of flags for the interpreter.\n' ++ '\n' ++ ' The following flag bits are defined for "co_flags": bit ' ++ '"0x04"\n' ++ ' is set if the function uses the "*arguments" syntax to ' ++ 'accept an\n' ++ ' arbitrary number of positional arguments; bit "0x08" is set ' ++ 'if\n' ++ ' the function uses the "**keywords" syntax to accept ' ++ 'arbitrary\n' ++ ' keyword arguments; bit "0x20" is set if the function is a\n' ++ ' generator.\n' ++ '\n' ++ ' Future feature declarations ("from __future__ import ' ++ 'division")\n' ++ ' also use bits in "co_flags" to indicate whether a code ' ++ 'object\n' ++ ' was compiled with a particular feature enabled: bit ' ++ '"0x2000" is\n' ++ ' set if the function was compiled with future division ' ++ 'enabled;\n' ++ ' bits "0x10" and "0x1000" were used in earlier versions of\n' ++ ' Python.\n' ++ '\n' ++ ' Other bits in "co_flags" are reserved for internal use.\n' ++ '\n' ++ ' If a code object represents a function, the first item in\n' ++ ' "co_consts" is the documentation string of the function, ' ++ 'or\n' ++ ' "None" if undefined.\n' ++ '\n' ++ ' Frame objects\n' ++ ' Frame objects represent execution frames. They may occur ' ++ 'in\n' ++ ' traceback objects (see below).\n' ++ '\n' ++ ' Special read-only attributes: "f_back" is to the previous ' ++ 'stack\n' ++ ' frame (towards the caller), or "None" if this is the ' ++ 'bottom\n' ++ ' stack frame; "f_code" is the code object being executed in ' ++ 'this\n' ++ ' frame; "f_locals" is the dictionary used to look up local\n' ++ ' variables; "f_globals" is used for global variables;\n' ++ ' "f_builtins" is used for built-in (intrinsic) names; ' ++ '"f_lasti"\n' ++ ' gives the precise instruction (this is an index into the\n' ++ ' bytecode string of the code object).\n' ++ '\n' ++ ' Special writable attributes: "f_trace", if not "None", is ' ++ 'a\n' ++ ' function called at the start of each source code line (this ' ++ 'is\n' ++ ' used by the debugger); "f_lineno" is the current line ' ++ 'number of\n' ++ ' the frame --- writing to this from within a trace function ' ++ 'jumps\n' ++ ' to the given line (only for the bottom-most frame). A ' ++ 'debugger\n' ++ ' can implement a Jump command (aka Set Next Statement) by ' ++ 'writing\n' ++ ' to f_lineno.\n' ++ '\n' ++ ' Frame objects support one method:\n' ++ '\n' ++ ' frame.clear()\n' ++ '\n' ++ ' This method clears all references to local variables ' ++ 'held by\n' ++ ' the frame. Also, if the frame belonged to a generator, ' ++ 'the\n' ++ ' generator is finalized. This helps break reference ' ++ 'cycles\n' ++ ' involving frame objects (for example when catching an\n' ++ ' exception and storing its traceback for later use).\n' ++ '\n' ++ ' "RuntimeError" is raised if the frame is currently ' ++ 'executing.\n' ++ '\n' ++ ' New in version 3.4.\n' ++ '\n' ++ ' Traceback objects\n' ++ ' Traceback objects represent a stack trace of an exception. ' ++ 'A\n' ++ ' traceback object is created when an exception occurs. When ' ++ 'the\n' ++ ' search for an exception handler unwinds the execution ' ++ 'stack, at\n' ++ ' each unwound level a traceback object is inserted in front ' ++ 'of\n' ++ ' the current traceback. When an exception handler is ' ++ 'entered,\n' ++ ' the stack trace is made available to the program. (See ' ++ 'section\n' ++ ' *The try statement*.) It is accessible as the third item of ' ++ 'the\n' ++ ' tuple returned by "sys.exc_info()". When the program ' ++ 'contains no\n' ++ ' suitable handler, the stack trace is written (nicely ' ++ 'formatted)\n' ++ ' to the standard error stream; if the interpreter is ' ++ 'interactive,\n' ++ ' it is also made available to the user as ' ++ '"sys.last_traceback".\n' ++ '\n' ++ ' Special read-only attributes: "tb_next" is the next level ' ++ 'in the\n' ++ ' stack trace (towards the frame where the exception ' ++ 'occurred), or\n' ++ ' "None" if there is no next level; "tb_frame" points to the\n' ++ ' execution frame of the current level; "tb_lineno" gives the ' ++ 'line\n' ++ ' number where the exception occurred; "tb_lasti" indicates ' ++ 'the\n' ++ ' precise instruction. The line number and last instruction ' ++ 'in\n' ++ ' the traceback may differ from the line number of its frame\n' ++ ' object if the exception occurred in a "try" statement with ' ++ 'no\n' ++ ' matching except clause or with a finally clause.\n' ++ '\n' ++ ' Slice objects\n' ++ ' Slice objects are used to represent slices for ' ++ '"__getitem__()"\n' ++ ' methods. They are also created by the built-in "slice()"\n' ++ ' function.\n' ++ '\n' ++ ' Special read-only attributes: "start" is the lower bound; ' ++ '"stop"\n' ++ ' is the upper bound; "step" is the step value; each is ' ++ '"None" if\n' ++ ' omitted. These attributes can have any type.\n' ++ '\n' ++ ' Slice objects support one method:\n' ++ '\n' ++ ' slice.indices(self, length)\n' ++ '\n' ++ ' This method takes a single integer argument *length* ' ++ 'and\n' ++ ' computes information about the slice that the slice ' ++ 'object\n' ++ ' would describe if applied to a sequence of *length* ' ++ 'items.\n' ++ ' It returns a tuple of three integers; respectively these ' ++ 'are\n' ++ ' the *start* and *stop* indices and the *step* or stride\n' ++ ' length of the slice. Missing or out-of-bounds indices ' ++ 'are\n' ++ ' handled in a manner consistent with regular slices.\n' ++ '\n' ++ ' Static method objects\n' ++ ' Static method objects provide a way of defeating the\n' ++ ' transformation of function objects to method objects ' ++ 'described\n' ++ ' above. A static method object is a wrapper around any ' ++ 'other\n' ++ ' object, usually a user-defined method object. When a ' ++ 'static\n' ++ ' method object is retrieved from a class or a class ' ++ 'instance, the\n' ++ ' object actually returned is the wrapped object, which is ' ++ 'not\n' ++ ' subject to any further transformation. Static method ' ++ 'objects are\n' ++ ' not themselves callable, although the objects they wrap ' ++ 'usually\n' ++ ' are. Static method objects are created by the built-in\n' ++ ' "staticmethod()" constructor.\n' ++ '\n' ++ ' Class method objects\n' ++ ' A class method object, like a static method object, is a ' ++ 'wrapper\n' ++ ' around another object that alters the way in which that ' ++ 'object\n' ++ ' is retrieved from classes and class instances. The ' ++ 'behaviour of\n' ++ ' class method objects upon such retrieval is described ' ++ 'above,\n' ++ ' under "User-defined methods". Class method objects are ' ++ 'created\n' ++ ' by the built-in "classmethod()" constructor.\n', ++ 'typesfunctions': '\n' ++ 'Functions\n' ++ '*********\n' ++ '\n' ++ 'Function objects are created by function definitions. ' ++ 'The only\n' ++ 'operation on a function object is to call it: ' ++ '"func(argument-list)".\n' ++ '\n' ++ 'There are really two flavors of function objects: ' ++ 'built-in functions\n' ++ 'and user-defined functions. Both support the same ' ++ 'operation (to call\n' ++ 'the function), but the implementation is different, ' ++ 'hence the\n' ++ 'different object types.\n' ++ '\n' ++ 'See *Function definitions* for more information.\n', ++ 'typesmapping': '\n' ++ 'Mapping Types --- "dict"\n' ++ '************************\n' ++ '\n' ++ 'A *mapping* object maps *hashable* values to arbitrary ' ++ 'objects.\n' ++ 'Mappings are mutable objects. There is currently only one ' ++ 'standard\n' ++ 'mapping type, the *dictionary*. (For other containers see ' ++ 'the built-\n' ++ 'in "list", "set", and "tuple" classes, and the ' ++ '"collections" module.)\n' ++ '\n' ++ "A dictionary's keys are *almost* arbitrary values. Values " ++ 'that are\n' ++ 'not *hashable*, that is, values containing lists, ' ++ 'dictionaries or\n' ++ 'other mutable types (that are compared by value rather ' ++ 'than by object\n' ++ 'identity) may not be used as keys. Numeric types used for ' ++ 'keys obey\n' ++ 'the normal rules for numeric comparison: if two numbers ' ++ 'compare equal\n' ++ '(such as "1" and "1.0") then they can be used ' ++ 'interchangeably to index\n' ++ 'the same dictionary entry. (Note however, that since ' ++ 'computers store\n' ++ 'floating-point numbers as approximations it is usually ' ++ 'unwise to use\n' ++ 'them as dictionary keys.)\n' ++ '\n' ++ 'Dictionaries can be created by placing a comma-separated ' ++ 'list of "key:\n' ++ 'value" pairs within braces, for example: "{\'jack\': 4098, ' ++ "'sjoerd':\n" ++ '4127}" or "{4098: \'jack\', 4127: \'sjoerd\'}", or by the ' ++ '"dict"\n' ++ 'constructor.\n' ++ '\n' ++ 'class class dict(**kwarg)\n' ++ 'class class dict(mapping, **kwarg)\n' ++ 'class class dict(iterable, **kwarg)\n' ++ '\n' ++ ' Return a new dictionary initialized from an optional ' ++ 'positional\n' ++ ' argument and a possibly empty set of keyword ' ++ 'arguments.\n' ++ '\n' ++ ' If no positional argument is given, an empty dictionary ' ++ 'is created.\n' ++ ' If a positional argument is given and it is a mapping ' ++ 'object, a\n' ++ ' dictionary is created with the same key-value pairs as ' ++ 'the mapping\n' ++ ' object. Otherwise, the positional argument must be an ' ++ '*iterable*\n' ++ ' object. Each item in the iterable must itself be an ' ++ 'iterable with\n' ++ ' exactly two objects. The first object of each item ' ++ 'becomes a key\n' ++ ' in the new dictionary, and the second object the ' ++ 'corresponding\n' ++ ' value. If a key occurs more than once, the last value ' ++ 'for that key\n' ++ ' becomes the corresponding value in the new dictionary.\n' ++ '\n' ++ ' If keyword arguments are given, the keyword arguments ' ++ 'and their\n' ++ ' values are added to the dictionary created from the ' ++ 'positional\n' ++ ' argument. If a key being added is already present, the ' ++ 'value from\n' ++ ' the keyword argument replaces the value from the ' ++ 'positional\n' ++ ' argument.\n' ++ '\n' ++ ' To illustrate, the following examples all return a ' ++ 'dictionary equal\n' ++ ' to "{"one": 1, "two": 2, "three": 3}":\n' ++ '\n' ++ ' >>> a = dict(one=1, two=2, three=3)\n' ++ " >>> b = {'one': 1, 'two': 2, 'three': 3}\n" ++ " >>> c = dict(zip(['one', 'two', 'three'], [1, 2, " ++ '3]))\n' ++ " >>> d = dict([('two', 2), ('one', 1), ('three', " ++ '3)])\n' ++ " >>> e = dict({'three': 3, 'one': 1, 'two': 2})\n" ++ ' >>> a == b == c == d == e\n' ++ ' True\n' ++ '\n' ++ ' Providing keyword arguments as in the first example ' ++ 'only works for\n' ++ ' keys that are valid Python identifiers. Otherwise, any ' ++ 'valid keys\n' ++ ' can be used.\n' ++ '\n' ++ ' These are the operations that dictionaries support (and ' ++ 'therefore,\n' ++ ' custom mapping types should support too):\n' ++ '\n' ++ ' len(d)\n' ++ '\n' ++ ' Return the number of items in the dictionary *d*.\n' ++ '\n' ++ ' d[key]\n' ++ '\n' ++ ' Return the item of *d* with key *key*. Raises a ' ++ '"KeyError" if\n' ++ ' *key* is not in the map.\n' ++ '\n' ++ ' If a subclass of dict defines a method ' ++ '"__missing__()", if the\n' ++ ' key *key* is not present, the "d[key]" operation ' ++ 'calls that\n' ++ ' method with the key *key* as argument. The "d[key]" ' ++ 'operation\n' ++ ' then returns or raises whatever is returned or ' ++ 'raised by the\n' ++ ' "__missing__(key)" call if the key is not present. ' ++ 'No other\n' ++ ' operations or methods invoke "__missing__()". If ' ++ '"__missing__()"\n' ++ ' is not defined, "KeyError" is raised. ' ++ '"__missing__()" must be a\n' ++ ' method; it cannot be an instance variable:\n' ++ '\n' ++ ' >>> class Counter(dict):\n' ++ ' ... def __missing__(self, key):\n' ++ ' ... return 0\n' ++ ' >>> c = Counter()\n' ++ " >>> c['red']\n" ++ ' 0\n' ++ " >>> c['red'] += 1\n" ++ " >>> c['red']\n" ++ ' 1\n' ++ '\n' ++ ' See "collections.Counter" for a complete ' ++ 'implementation\n' ++ ' including other methods helpful for accumulating and ' ++ 'managing\n' ++ ' tallies.\n' ++ '\n' ++ ' d[key] = value\n' ++ '\n' ++ ' Set "d[key]" to *value*.\n' ++ '\n' ++ ' del d[key]\n' ++ '\n' ++ ' Remove "d[key]" from *d*. Raises a "KeyError" if ' ++ '*key* is not\n' ++ ' in the map.\n' ++ '\n' ++ ' key in d\n' ++ '\n' ++ ' Return "True" if *d* has a key *key*, else "False".\n' ++ '\n' ++ ' key not in d\n' ++ '\n' ++ ' Equivalent to "not key in d".\n' ++ '\n' ++ ' iter(d)\n' ++ '\n' ++ ' Return an iterator over the keys of the dictionary. ' ++ 'This is a\n' ++ ' shortcut for "iter(d.keys())".\n' ++ '\n' ++ ' clear()\n' ++ '\n' ++ ' Remove all items from the dictionary.\n' ++ '\n' ++ ' copy()\n' ++ '\n' ++ ' Return a shallow copy of the dictionary.\n' ++ '\n' ++ ' classmethod fromkeys(seq[, value])\n' ++ '\n' ++ ' Create a new dictionary with keys from *seq* and ' ++ 'values set to\n' ++ ' *value*.\n' ++ '\n' ++ ' "fromkeys()" is a class method that returns a new ' ++ 'dictionary.\n' ++ ' *value* defaults to "None".\n' ++ '\n' ++ ' get(key[, default])\n' ++ '\n' ++ ' Return the value for *key* if *key* is in the ' ++ 'dictionary, else\n' ++ ' *default*. If *default* is not given, it defaults to ' ++ '"None", so\n' ++ ' that this method never raises a "KeyError".\n' ++ '\n' ++ ' items()\n' ++ '\n' ++ ' Return a new view of the dictionary\'s items ("(key, ' ++ 'value)"\n' ++ ' pairs). See the *documentation of view objects*.\n' ++ '\n' ++ ' keys()\n' ++ '\n' ++ " Return a new view of the dictionary's keys. See " ++ 'the\n' ++ ' *documentation of view objects*.\n' ++ '\n' ++ ' pop(key[, default])\n' ++ '\n' ++ ' If *key* is in the dictionary, remove it and return ' ++ 'its value,\n' ++ ' else return *default*. If *default* is not given ' ++ 'and *key* is\n' ++ ' not in the dictionary, a "KeyError" is raised.\n' ++ '\n' ++ ' popitem()\n' ++ '\n' ++ ' Remove and return an arbitrary "(key, value)" pair ' ++ 'from the\n' ++ ' dictionary.\n' ++ '\n' ++ ' "popitem()" is useful to destructively iterate over ' ++ 'a\n' ++ ' dictionary, as often used in set algorithms. If the ' ++ 'dictionary\n' ++ ' is empty, calling "popitem()" raises a "KeyError".\n' ++ '\n' ++ ' setdefault(key[, default])\n' ++ '\n' ++ ' If *key* is in the dictionary, return its value. If ' ++ 'not, insert\n' ++ ' *key* with a value of *default* and return ' ++ '*default*. *default*\n' ++ ' defaults to "None".\n' ++ '\n' ++ ' update([other])\n' ++ '\n' ++ ' Update the dictionary with the key/value pairs from ' ++ '*other*,\n' ++ ' overwriting existing keys. Return "None".\n' ++ '\n' ++ ' "update()" accepts either another dictionary object ' ++ 'or an\n' ++ ' iterable of key/value pairs (as tuples or other ' ++ 'iterables of\n' ++ ' length two). If keyword arguments are specified, ' ++ 'the dictionary\n' ++ ' is then updated with those key/value pairs: ' ++ '"d.update(red=1,\n' ++ ' blue=2)".\n' ++ '\n' ++ ' values()\n' ++ '\n' ++ " Return a new view of the dictionary's values. See " ++ 'the\n' ++ ' *documentation of view objects*.\n' ++ '\n' ++ 'See also: "types.MappingProxyType" can be used to create a ' ++ 'read-only\n' ++ ' view of a "dict".\n' ++ '\n' ++ '\n' ++ 'Dictionary view objects\n' ++ '=======================\n' ++ '\n' ++ 'The objects returned by "dict.keys()", "dict.values()" ' ++ 'and\n' ++ '"dict.items()" are *view objects*. They provide a dynamic ' ++ 'view on the\n' ++ "dictionary's entries, which means that when the dictionary " ++ 'changes,\n' ++ 'the view reflects these changes.\n' ++ '\n' ++ 'Dictionary views can be iterated over to yield their ' ++ 'respective data,\n' ++ 'and support membership tests:\n' ++ '\n' ++ 'len(dictview)\n' ++ '\n' ++ ' Return the number of entries in the dictionary.\n' ++ '\n' ++ 'iter(dictview)\n' ++ '\n' ++ ' Return an iterator over the keys, values or items ' ++ '(represented as\n' ++ ' tuples of "(key, value)") in the dictionary.\n' ++ '\n' ++ ' Keys and values are iterated over in an arbitrary order ' ++ 'which is\n' ++ ' non-random, varies across Python implementations, and ' ++ 'depends on\n' ++ " the dictionary's history of insertions and deletions. " ++ 'If keys,\n' ++ ' values and items views are iterated over with no ' ++ 'intervening\n' ++ ' modifications to the dictionary, the order of items ' ++ 'will directly\n' ++ ' correspond. This allows the creation of "(value, key)" ' ++ 'pairs using\n' ++ ' "zip()": "pairs = zip(d.values(), d.keys())". Another ' ++ 'way to\n' ++ ' create the same list is "pairs = [(v, k) for (k, v) in ' ++ 'd.items()]".\n' ++ '\n' ++ ' Iterating views while adding or deleting entries in the ' ++ 'dictionary\n' ++ ' may raise a "RuntimeError" or fail to iterate over all ' ++ 'entries.\n' ++ '\n' ++ 'x in dictview\n' ++ '\n' ++ ' Return "True" if *x* is in the underlying dictionary\'s ' ++ 'keys, values\n' ++ ' or items (in the latter case, *x* should be a "(key, ' ++ 'value)"\n' ++ ' tuple).\n' ++ '\n' ++ 'Keys views are set-like since their entries are unique and ' ++ 'hashable.\n' ++ 'If all values are hashable, so that "(key, value)" pairs ' ++ 'are unique\n' ++ 'and hashable, then the items view is also set-like. ' ++ '(Values views are\n' ++ 'not treated as set-like since the entries are generally ' ++ 'not unique.)\n' ++ 'For set-like views, all of the operations defined for the ' ++ 'abstract\n' ++ 'base class "collections.abc.Set" are available (for ' ++ 'example, "==",\n' ++ '"<", or "^").\n' ++ '\n' ++ 'An example of dictionary view usage:\n' ++ '\n' ++ " >>> dishes = {'eggs': 2, 'sausage': 1, 'bacon': 1, " ++ "'spam': 500}\n" ++ ' >>> keys = dishes.keys()\n' ++ ' >>> values = dishes.values()\n' ++ '\n' ++ ' >>> # iteration\n' ++ ' >>> n = 0\n' ++ ' >>> for val in values:\n' ++ ' ... n += val\n' ++ ' >>> print(n)\n' ++ ' 504\n' ++ '\n' ++ ' >>> # keys and values are iterated over in the same ' ++ 'order\n' ++ ' >>> list(keys)\n' ++ " ['eggs', 'bacon', 'sausage', 'spam']\n" ++ ' >>> list(values)\n' ++ ' [2, 1, 1, 500]\n' ++ '\n' ++ ' >>> # view objects are dynamic and reflect dict ' ++ 'changes\n' ++ " >>> del dishes['eggs']\n" ++ " >>> del dishes['sausage']\n" ++ ' >>> list(keys)\n' ++ " ['spam', 'bacon']\n" ++ '\n' ++ ' >>> # set operations\n' ++ " >>> keys & {'eggs', 'bacon', 'salad'}\n" ++ " {'bacon'}\n" ++ " >>> keys ^ {'sausage', 'juice'}\n" ++ " {'juice', 'sausage', 'bacon', 'spam'}\n", ++ 'typesmethods': '\n' ++ 'Methods\n' ++ '*******\n' ++ '\n' ++ 'Methods are functions that are called using the attribute ' ++ 'notation.\n' ++ 'There are two flavors: built-in methods (such as ' ++ '"append()" on lists)\n' ++ 'and class instance methods. Built-in methods are ' ++ 'described with the\n' ++ 'types that support them.\n' ++ '\n' ++ 'If you access a method (a function defined in a class ' ++ 'namespace)\n' ++ 'through an instance, you get a special object: a *bound ' ++ 'method* (also\n' ++ 'called *instance method*) object. When called, it will add ' ++ 'the "self"\n' ++ 'argument to the argument list. Bound methods have two ' ++ 'special read-\n' ++ 'only attributes: "m.__self__" is the object on which the ' ++ 'method\n' ++ 'operates, and "m.__func__" is the function implementing ' ++ 'the method.\n' ++ 'Calling "m(arg-1, arg-2, ..., arg-n)" is completely ' ++ 'equivalent to\n' ++ 'calling "m.__func__(m.__self__, arg-1, arg-2, ..., ' ++ 'arg-n)".\n' ++ '\n' ++ 'Like function objects, bound method objects support ' ++ 'getting arbitrary\n' ++ 'attributes. However, since method attributes are actually ' ++ 'stored on\n' ++ 'the underlying function object ("meth.__func__"), setting ' ++ 'method\n' ++ 'attributes on bound methods is disallowed. Attempting to ' ++ 'set an\n' ++ 'attribute on a method results in an "AttributeError" being ' ++ 'raised. In\n' ++ 'order to set a method attribute, you need to explicitly ' ++ 'set it on the\n' ++ 'underlying function object:\n' ++ '\n' ++ ' >>> class C:\n' ++ ' ... def method(self):\n' ++ ' ... pass\n' ++ ' ...\n' ++ ' >>> c = C()\n' ++ " >>> c.method.whoami = 'my name is method' # can't set " ++ 'on the method\n' ++ ' Traceback (most recent call last):\n' ++ ' File "", line 1, in \n' ++ " AttributeError: 'method' object has no attribute " ++ "'whoami'\n" ++ " >>> c.method.__func__.whoami = 'my name is method'\n" ++ ' >>> c.method.whoami\n' ++ " 'my name is method'\n" ++ '\n' ++ 'See *The standard type hierarchy* for more information.\n', ++ 'typesmodules': '\n' ++ 'Modules\n' ++ '*******\n' ++ '\n' ++ 'The only special operation on a module is attribute ' ++ 'access: "m.name",\n' ++ 'where *m* is a module and *name* accesses a name defined ' ++ "in *m*'s\n" ++ 'symbol table. Module attributes can be assigned to. (Note ' ++ 'that the\n' ++ '"import" statement is not, strictly speaking, an operation ' ++ 'on a module\n' ++ 'object; "import foo" does not require a module object ' ++ 'named *foo* to\n' ++ 'exist, rather it requires an (external) *definition* for a ' ++ 'module\n' ++ 'named *foo* somewhere.)\n' ++ '\n' ++ 'A special attribute of every module is "__dict__". This is ' ++ 'the\n' ++ "dictionary containing the module's symbol table. Modifying " ++ 'this\n' ++ "dictionary will actually change the module's symbol table, " ++ 'but direct\n' ++ 'assignment to the "__dict__" attribute is not possible ' ++ '(you can write\n' ++ '"m.__dict__[\'a\'] = 1", which defines "m.a" to be "1", ' ++ "but you can't\n" ++ 'write "m.__dict__ = {}"). Modifying "__dict__" directly ' ++ 'is not\n' ++ 'recommended.\n' ++ '\n' ++ 'Modules built into the interpreter are written like this: ' ++ '"". If loaded from a file, they are ' ++ 'written as\n' ++ '"".\n', ++ 'typesseq': '\n' ++ 'Sequence Types --- "list", "tuple", "range"\n' ++ '*******************************************\n' ++ '\n' ++ 'There are three basic sequence types: lists, tuples, and ' ++ 'range\n' ++ 'objects. Additional sequence types tailored for processing of ' ++ '*binary\n' ++ 'data* and *text strings* are described in dedicated sections.\n' ++ '\n' ++ '\n' ++ 'Common Sequence Operations\n' ++ '==========================\n' ++ '\n' ++ 'The operations in the following table are supported by most ' ++ 'sequence\n' ++ 'types, both mutable and immutable. The ' ++ '"collections.abc.Sequence" ABC\n' ++ 'is provided to make it easier to correctly implement these ' ++ 'operations\n' ++ 'on custom sequence types.\n' ++ '\n' ++ 'This table lists the sequence operations sorted in ascending ' ++ 'priority\n' ++ '(operations in the same box have the same priority). In the ' ++ 'table,\n' ++ '*s* and *t* are sequences of the same type, *n*, *i*, *j* and ' ++ '*k* are\n' ++ 'integers and *x* is an arbitrary object that meets any type ' ++ 'and value\n' ++ 'restrictions imposed by *s*.\n' ++ '\n' ++ 'The "in" and "not in" operations have the same priorities as ' ++ 'the\n' ++ 'comparison operations. The "+" (concatenation) and "*" ' ++ '(repetition)\n' ++ 'operations have the same priority as the corresponding ' ++ 'numeric\n' ++ 'operations.\n' ++ '\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| Operation | ' ++ 'Result | Notes |\n' ++ '+============================+==================================+============+\n' ++ '| "x in s" | "True" if an item of *s* ' ++ 'is | (1) |\n' ++ '| | equal to *x*, else ' ++ '"False" | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "x not in s" | "False" if an item of *s* ' ++ 'is | (1) |\n' ++ '| | equal to *x*, else ' ++ '"True" | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s + t" | the concatenation of *s* and ' ++ '*t* | (6)(7) |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s * n" or "n * s" | *n* shallow copies of ' ++ '*s* | (2)(7) |\n' ++ '| | ' ++ 'concatenated | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s[i]" | *i*th item of *s*, origin ' ++ '0 | (3) |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s[i:j]" | slice of *s* from *i* to ' ++ '*j* | (3)(4) |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s[i:j:k]" | slice of *s* from *i* to ' ++ '*j* | (3)(5) |\n' ++ '| | with step ' ++ '*k* | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "len(s)" | length of ' ++ '*s* | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "min(s)" | smallest item of ' ++ '*s* | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "max(s)" | largest item of ' ++ '*s* | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s.index(x[, i[, j]])" | index of the first occurrence ' ++ 'of | (8) |\n' ++ '| | *x* in *s* (at or after ' ++ 'index | |\n' ++ '| | *i* and before index ' ++ '*j*) | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '| "s.count(x)" | total number of occurrences ' ++ 'of | |\n' ++ '| | *x* in ' ++ '*s* | |\n' ++ '+----------------------------+----------------------------------+------------+\n' ++ '\n' ++ 'Sequences of the same type also support comparisons. In ' ++ 'particular,\n' ++ 'tuples and lists are compared lexicographically by comparing\n' ++ 'corresponding elements. This means that to compare equal, ' ++ 'every\n' ++ 'element must compare equal and the two sequences must be of ' ++ 'the same\n' ++ 'type and have the same length. (For full details see ' ++ '*Comparisons* in\n' ++ 'the language reference.)\n' ++ '\n' ++ 'Notes:\n' ++ '\n' ++ '1. While the "in" and "not in" operations are used only for ' ++ 'simple\n' ++ ' containment testing in the general case, some specialised ' ++ 'sequences\n' ++ ' (such as "str", "bytes" and "bytearray") also use them for\n' ++ ' subsequence testing:\n' ++ '\n' ++ ' >>> "gg" in "eggs"\n' ++ ' True\n' ++ '\n' ++ '2. Values of *n* less than "0" are treated as "0" (which ' ++ 'yields an\n' ++ ' empty sequence of the same type as *s*). Note also that ' ++ 'the copies\n' ++ ' are shallow; nested structures are not copied. This often ' ++ 'haunts\n' ++ ' new Python programmers; consider:\n' ++ '\n' ++ ' >>> lists = [[]] * 3\n' ++ ' >>> lists\n' ++ ' [[], [], []]\n' ++ ' >>> lists[0].append(3)\n' ++ ' >>> lists\n' ++ ' [[3], [3], [3]]\n' ++ '\n' ++ ' What has happened is that "[[]]" is a one-element list ' ++ 'containing\n' ++ ' an empty list, so all three elements of "[[]] * 3" are ' ++ '(pointers\n' ++ ' to) this single empty list. Modifying any of the elements ' ++ 'of\n' ++ ' "lists" modifies this single list. You can create a list ' ++ 'of\n' ++ ' different lists this way:\n' ++ '\n' ++ ' >>> lists = [[] for i in range(3)]\n' ++ ' >>> lists[0].append(3)\n' ++ ' >>> lists[1].append(5)\n' ++ ' >>> lists[2].append(7)\n' ++ ' >>> lists\n' ++ ' [[3], [5], [7]]\n' ++ '\n' ++ '3. If *i* or *j* is negative, the index is relative to the end ' ++ 'of\n' ++ ' the string: "len(s) + i" or "len(s) + j" is substituted. ' ++ 'But note\n' ++ ' that "-0" is still "0".\n' ++ '\n' ++ '4. The slice of *s* from *i* to *j* is defined as the sequence ' ++ 'of\n' ++ ' items with index *k* such that "i <= k < j". If *i* or *j* ' ++ 'is\n' ++ ' greater than "len(s)", use "len(s)". If *i* is omitted or ' ++ '"None",\n' ++ ' use "0". If *j* is omitted or "None", use "len(s)". If ' ++ '*i* is\n' ++ ' greater than or equal to *j*, the slice is empty.\n' ++ '\n' ++ '5. The slice of *s* from *i* to *j* with step *k* is defined ' ++ 'as the\n' ++ ' sequence of items with index "x = i + n*k" such that "0 <= ' ++ 'n <\n' ++ ' (j-i)/k". In other words, the indices are "i", "i+k", ' ++ '"i+2*k",\n' ++ ' "i+3*k" and so on, stopping when *j* is reached (but never\n' ++ ' including *j*). If *i* or *j* is greater than "len(s)", ' ++ 'use\n' ++ ' "len(s)". If *i* or *j* are omitted or "None", they become ' ++ '"end"\n' ++ ' values (which end depends on the sign of *k*). Note, *k* ' ++ 'cannot be\n' ++ ' zero. If *k* is "None", it is treated like "1".\n' ++ '\n' ++ '6. Concatenating immutable sequences always results in a new\n' ++ ' object. This means that building up a sequence by repeated\n' ++ ' concatenation will have a quadratic runtime cost in the ' ++ 'total\n' ++ ' sequence length. To get a linear runtime cost, you must ' ++ 'switch to\n' ++ ' one of the alternatives below:\n' ++ '\n' ++ ' * if concatenating "str" objects, you can build a list and ' ++ 'use\n' ++ ' "str.join()" at the end or else write to a "io.StringIO" ' ++ 'instance\n' ++ ' and retrieve its value when complete\n' ++ '\n' ++ ' * if concatenating "bytes" objects, you can similarly use\n' ++ ' "bytes.join()" or "io.BytesIO", or you can do in-place\n' ++ ' concatenation with a "bytearray" object. "bytearray" ' ++ 'objects are\n' ++ ' mutable and have an efficient overallocation mechanism\n' ++ '\n' ++ ' * if concatenating "tuple" objects, extend a "list" ' ++ 'instead\n' ++ '\n' ++ ' * for other types, investigate the relevant class ' ++ 'documentation\n' ++ '\n' ++ '7. Some sequence types (such as "range") only support item\n' ++ " sequences that follow specific patterns, and hence don't " ++ 'support\n' ++ ' sequence concatenation or repetition.\n' ++ '\n' ++ '8. "index" raises "ValueError" when *x* is not found in *s*. ' ++ 'When\n' ++ ' supported, the additional arguments to the index method ' ++ 'allow\n' ++ ' efficient searching of subsections of the sequence. Passing ' ++ 'the\n' ++ ' extra arguments is roughly equivalent to using ' ++ '"s[i:j].index(x)",\n' ++ ' only without copying any data and with the returned index ' ++ 'being\n' ++ ' relative to the start of the sequence rather than the start ' ++ 'of the\n' ++ ' slice.\n' ++ '\n' ++ '\n' ++ 'Immutable Sequence Types\n' ++ '========================\n' ++ '\n' ++ 'The only operation that immutable sequence types generally ' ++ 'implement\n' ++ 'that is not also implemented by mutable sequence types is ' ++ 'support for\n' ++ 'the "hash()" built-in.\n' ++ '\n' ++ 'This support allows immutable sequences, such as "tuple" ' ++ 'instances, to\n' ++ 'be used as "dict" keys and stored in "set" and "frozenset" ' ++ 'instances.\n' ++ '\n' ++ 'Attempting to hash an immutable sequence that contains ' ++ 'unhashable\n' ++ 'values will result in "TypeError".\n' ++ '\n' ++ '\n' ++ 'Mutable Sequence Types\n' ++ '======================\n' ++ '\n' ++ 'The operations in the following table are defined on mutable ' ++ 'sequence\n' ++ 'types. The "collections.abc.MutableSequence" ABC is provided ' ++ 'to make\n' ++ 'it easier to correctly implement these operations on custom ' ++ 'sequence\n' ++ 'types.\n' ++ '\n' ++ 'In the table *s* is an instance of a mutable sequence type, ' ++ '*t* is any\n' ++ 'iterable object and *x* is an arbitrary object that meets any ' ++ 'type and\n' ++ 'value restrictions imposed by *s* (for example, "bytearray" ' ++ 'only\n' ++ 'accepts integers that meet the value restriction "0 <= x <= ' ++ '255").\n' ++ '\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| Operation | ' ++ 'Result | Notes |\n' ++ '+================================+==================================+=======================+\n' ++ '| "s[i] = x" | item *i* of *s* is replaced ' ++ 'by | |\n' ++ '| | ' ++ '*x* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s[i:j] = t" | slice of *s* from *i* to ' ++ '*j* is | |\n' ++ '| | replaced by the contents of ' ++ 'the | |\n' ++ '| | iterable ' ++ '*t* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "del s[i:j]" | same as "s[i:j] = ' ++ '[]" | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s[i:j:k] = t" | the elements of "s[i:j:k]" ' ++ 'are | (1) |\n' ++ '| | replaced by those of ' ++ '*t* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "del s[i:j:k]" | removes the elements ' ++ 'of | |\n' ++ '| | "s[i:j:k]" from the ' ++ 'list | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.append(x)" | appends *x* to the end of ' ++ 'the | |\n' ++ '| | sequence (same ' ++ 'as | |\n' ++ '| | "s[len(s):len(s)] = ' ++ '[x]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.clear()" | removes all items from "s" ' ++ '(same | (5) |\n' ++ '| | as "del ' ++ 's[:]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.copy()" | creates a shallow copy of ' ++ '"s" | (5) |\n' ++ '| | (same as ' ++ '"s[:]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.extend(t)" | extends *s* with the ' ++ 'contents of | |\n' ++ '| | *t* (same as ' ++ '"s[len(s):len(s)] = | |\n' ++ '| | ' ++ 't") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.insert(i, x)" | inserts *x* into *s* at ' ++ 'the | |\n' ++ '| | index given by *i* (same ' ++ 'as | |\n' ++ '| | "s[i:i] = ' ++ '[x]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.pop([i])" | retrieves the item at *i* ' ++ 'and | (2) |\n' ++ '| | also removes it from ' ++ '*s* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.remove(x)" | remove the first item from ' ++ '*s* | (3) |\n' ++ '| | where "s[i] == ' ++ 'x" | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.reverse()" | reverses the items of *s* ' ++ 'in | (4) |\n' ++ '| | ' ++ 'place | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '\n' ++ 'Notes:\n' ++ '\n' ++ '1. *t* must have the same length as the slice it is ' ++ 'replacing.\n' ++ '\n' ++ '2. The optional argument *i* defaults to "-1", so that by ' ++ 'default\n' ++ ' the last item is removed and returned.\n' ++ '\n' ++ '3. "remove" raises "ValueError" when *x* is not found in *s*.\n' ++ '\n' ++ '4. The "reverse()" method modifies the sequence in place for\n' ++ ' economy of space when reversing a large sequence. To ' ++ 'remind users\n' ++ ' that it operates by side effect, it does not return the ' ++ 'reversed\n' ++ ' sequence.\n' ++ '\n' ++ '5. "clear()" and "copy()" are included for consistency with ' ++ 'the\n' ++ " interfaces of mutable containers that don't support " ++ 'slicing\n' ++ ' operations (such as "dict" and "set")\n' ++ '\n' ++ ' New in version 3.3: "clear()" and "copy()" methods.\n' ++ '\n' ++ '\n' ++ 'Lists\n' ++ '=====\n' ++ '\n' ++ 'Lists are mutable sequences, typically used to store ' ++ 'collections of\n' ++ 'homogeneous items (where the precise degree of similarity will ' ++ 'vary by\n' ++ 'application).\n' ++ '\n' ++ 'class class list([iterable])\n' ++ '\n' ++ ' Lists may be constructed in several ways:\n' ++ '\n' ++ ' * Using a pair of square brackets to denote the empty list: ' ++ '"[]"\n' ++ '\n' ++ ' * Using square brackets, separating items with commas: ' ++ '"[a]",\n' ++ ' "[a, b, c]"\n' ++ '\n' ++ ' * Using a list comprehension: "[x for x in iterable]"\n' ++ '\n' ++ ' * Using the type constructor: "list()" or "list(iterable)"\n' ++ '\n' ++ ' The constructor builds a list whose items are the same and ' ++ 'in the\n' ++ " same order as *iterable*'s items. *iterable* may be either " ++ 'a\n' ++ ' sequence, a container that supports iteration, or an ' ++ 'iterator\n' ++ ' object. If *iterable* is already a list, a copy is made ' ++ 'and\n' ++ ' returned, similar to "iterable[:]". For example, ' ++ '"list(\'abc\')"\n' ++ ' returns "[\'a\', \'b\', \'c\']" and "list( (1, 2, 3) )" ' ++ 'returns "[1, 2,\n' ++ ' 3]". If no argument is given, the constructor creates a new ' ++ 'empty\n' ++ ' list, "[]".\n' ++ '\n' ++ ' Many other operations also produce lists, including the ' ++ '"sorted()"\n' ++ ' built-in.\n' ++ '\n' ++ ' Lists implement all of the *common* and *mutable* sequence\n' ++ ' operations. Lists also provide the following additional ' ++ 'method:\n' ++ '\n' ++ ' sort(*, key=None, reverse=None)\n' ++ '\n' ++ ' This method sorts the list in place, using only "<" ' ++ 'comparisons\n' ++ ' between items. Exceptions are not suppressed - if any ' ++ 'comparison\n' ++ ' operations fail, the entire sort operation will fail ' ++ '(and the\n' ++ ' list will likely be left in a partially modified ' ++ 'state).\n' ++ '\n' ++ ' "sort()" accepts two arguments that can only be passed ' ++ 'by\n' ++ ' keyword (*keyword-only arguments*):\n' ++ '\n' ++ ' *key* specifies a function of one argument that is used ' ++ 'to\n' ++ ' extract a comparison key from each list element (for ' ++ 'example,\n' ++ ' "key=str.lower"). The key corresponding to each item in ' ++ 'the list\n' ++ ' is calculated once and then used for the entire sorting ' ++ 'process.\n' ++ ' The default value of "None" means that list items are ' ++ 'sorted\n' ++ ' directly without calculating a separate key value.\n' ++ '\n' ++ ' The "functools.cmp_to_key()" utility is available to ' ++ 'convert a\n' ++ ' 2.x style *cmp* function to a *key* function.\n' ++ '\n' ++ ' *reverse* is a boolean value. If set to "True", then ' ++ 'the list\n' ++ ' elements are sorted as if each comparison were ' ++ 'reversed.\n' ++ '\n' ++ ' This method modifies the sequence in place for economy ' ++ 'of space\n' ++ ' when sorting a large sequence. To remind users that it ' ++ 'operates\n' ++ ' by side effect, it does not return the sorted sequence ' ++ '(use\n' ++ ' "sorted()" to explicitly request a new sorted list ' ++ 'instance).\n' ++ '\n' ++ ' The "sort()" method is guaranteed to be stable. A sort ' ++ 'is\n' ++ ' stable if it guarantees not to change the relative order ' ++ 'of\n' ++ ' elements that compare equal --- this is helpful for ' ++ 'sorting in\n' ++ ' multiple passes (for example, sort by department, then ' ++ 'by salary\n' ++ ' grade).\n' ++ '\n' ++ ' **CPython implementation detail:** While a list is being ' ++ 'sorted,\n' ++ ' the effect of attempting to mutate, or even inspect, the ' ++ 'list is\n' ++ ' undefined. The C implementation of Python makes the ' ++ 'list appear\n' ++ ' empty for the duration, and raises "ValueError" if it ' ++ 'can detect\n' ++ ' that the list has been mutated during a sort.\n' ++ '\n' ++ '\n' ++ 'Tuples\n' ++ '======\n' ++ '\n' ++ 'Tuples are immutable sequences, typically used to store ' ++ 'collections of\n' ++ 'heterogeneous data (such as the 2-tuples produced by the ' ++ '"enumerate()"\n' ++ 'built-in). Tuples are also used for cases where an immutable ' ++ 'sequence\n' ++ 'of homogeneous data is needed (such as allowing storage in a ' ++ '"set" or\n' ++ '"dict" instance).\n' ++ '\n' ++ 'class class tuple([iterable])\n' ++ '\n' ++ ' Tuples may be constructed in a number of ways:\n' ++ '\n' ++ ' * Using a pair of parentheses to denote the empty tuple: ' ++ '"()"\n' ++ '\n' ++ ' * Using a trailing comma for a singleton tuple: "a," or ' ++ '"(a,)"\n' ++ '\n' ++ ' * Separating items with commas: "a, b, c" or "(a, b, c)"\n' ++ '\n' ++ ' * Using the "tuple()" built-in: "tuple()" or ' ++ '"tuple(iterable)"\n' ++ '\n' ++ ' The constructor builds a tuple whose items are the same and ' ++ 'in the\n' ++ " same order as *iterable*'s items. *iterable* may be either " ++ 'a\n' ++ ' sequence, a container that supports iteration, or an ' ++ 'iterator\n' ++ ' object. If *iterable* is already a tuple, it is returned\n' ++ ' unchanged. For example, "tuple(\'abc\')" returns "(\'a\', ' ++ '\'b\', \'c\')"\n' ++ ' and "tuple( [1, 2, 3] )" returns "(1, 2, 3)". If no ' ++ 'argument is\n' ++ ' given, the constructor creates a new empty tuple, "()".\n' ++ '\n' ++ ' Note that it is actually the comma which makes a tuple, not ' ++ 'the\n' ++ ' parentheses. The parentheses are optional, except in the ' ++ 'empty\n' ++ ' tuple case, or when they are needed to avoid syntactic ' ++ 'ambiguity.\n' ++ ' For example, "f(a, b, c)" is a function call with three ' ++ 'arguments,\n' ++ ' while "f((a, b, c))" is a function call with a 3-tuple as ' ++ 'the sole\n' ++ ' argument.\n' ++ '\n' ++ ' Tuples implement all of the *common* sequence operations.\n' ++ '\n' ++ 'For heterogeneous collections of data where access by name is ' ++ 'clearer\n' ++ 'than access by index, "collections.namedtuple()" may be a ' ++ 'more\n' ++ 'appropriate choice than a simple tuple object.\n' ++ '\n' ++ '\n' ++ 'Ranges\n' ++ '======\n' ++ '\n' ++ 'The "range" type represents an immutable sequence of numbers ' ++ 'and is\n' ++ 'commonly used for looping a specific number of times in "for" ' ++ 'loops.\n' ++ '\n' ++ 'class class range(stop)\n' ++ 'class class range(start, stop[, step])\n' ++ '\n' ++ ' The arguments to the range constructor must be integers ' ++ '(either\n' ++ ' built-in "int" or any object that implements the ' ++ '"__index__"\n' ++ ' special method). If the *step* argument is omitted, it ' ++ 'defaults to\n' ++ ' "1". If the *start* argument is omitted, it defaults to ' ++ '"0". If\n' ++ ' *step* is zero, "ValueError" is raised.\n' ++ '\n' ++ ' For a positive *step*, the contents of a range "r" are ' ++ 'determined\n' ++ ' by the formula "r[i] = start + step*i" where "i >= 0" and ' ++ '"r[i] <\n' ++ ' stop".\n' ++ '\n' ++ ' For a negative *step*, the contents of the range are still\n' ++ ' determined by the formula "r[i] = start + step*i", but the\n' ++ ' constraints are "i >= 0" and "r[i] > stop".\n' ++ '\n' ++ ' A range object will be empty if "r[0]" does not meet the ' ++ 'value\n' ++ ' constraint. Ranges do support negative indices, but these ' ++ 'are\n' ++ ' interpreted as indexing from the end of the sequence ' ++ 'determined by\n' ++ ' the positive indices.\n' ++ '\n' ++ ' Ranges containing absolute values larger than "sys.maxsize" ' ++ 'are\n' ++ ' permitted but some features (such as "len()") may raise\n' ++ ' "OverflowError".\n' ++ '\n' ++ ' Range examples:\n' ++ '\n' ++ ' >>> list(range(10))\n' ++ ' [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\n' ++ ' >>> list(range(1, 11))\n' ++ ' [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n' ++ ' >>> list(range(0, 30, 5))\n' ++ ' [0, 5, 10, 15, 20, 25]\n' ++ ' >>> list(range(0, 10, 3))\n' ++ ' [0, 3, 6, 9]\n' ++ ' >>> list(range(0, -10, -1))\n' ++ ' [0, -1, -2, -3, -4, -5, -6, -7, -8, -9]\n' ++ ' >>> list(range(0))\n' ++ ' []\n' ++ ' >>> list(range(1, 0))\n' ++ ' []\n' ++ '\n' ++ ' Ranges implement all of the *common* sequence operations ' ++ 'except\n' ++ ' concatenation and repetition (due to the fact that range ' ++ 'objects\n' ++ ' can only represent sequences that follow a strict pattern ' ++ 'and\n' ++ ' repetition and concatenation will usually violate that ' ++ 'pattern).\n' ++ '\n' ++ 'The advantage of the "range" type over a regular "list" or ' ++ '"tuple" is\n' ++ 'that a "range" object will always take the same (small) amount ' ++ 'of\n' ++ 'memory, no matter the size of the range it represents (as it ' ++ 'only\n' ++ 'stores the "start", "stop" and "step" values, calculating ' ++ 'individual\n' ++ 'items and subranges as needed).\n' ++ '\n' ++ 'Range objects implement the "collections.abc.Sequence" ABC, ' ++ 'and\n' ++ 'provide features such as containment tests, element index ' ++ 'lookup,\n' ++ 'slicing and support for negative indices (see *Sequence Types ' ++ '---\n' ++ 'list, tuple, range*):\n' ++ '\n' ++ '>>> r = range(0, 20, 2)\n' ++ '>>> r\n' ++ 'range(0, 20, 2)\n' ++ '>>> 11 in r\n' ++ 'False\n' ++ '>>> 10 in r\n' ++ 'True\n' ++ '>>> r.index(10)\n' ++ '5\n' ++ '>>> r[5]\n' ++ '10\n' ++ '>>> r[:5]\n' ++ 'range(0, 10, 2)\n' ++ '>>> r[-1]\n' ++ '18\n' ++ '\n' ++ 'Testing range objects for equality with "==" and "!=" compares ' ++ 'them as\n' ++ 'sequences. That is, two range objects are considered equal if ' ++ 'they\n' ++ 'represent the same sequence of values. (Note that two range ' ++ 'objects\n' ++ 'that compare equal might have different "start", "stop" and ' ++ '"step"\n' ++ 'attributes, for example "range(0) == range(2, 1, 3)" or ' ++ '"range(0, 3,\n' ++ '2) == range(0, 4, 2)".)\n' ++ '\n' ++ 'Changed in version 3.2: Implement the Sequence ABC. Support ' ++ 'slicing\n' ++ 'and negative indices. Test "int" objects for membership in ' ++ 'constant\n' ++ 'time instead of iterating through all items.\n' ++ '\n' ++ "Changed in version 3.3: Define '==' and '!=' to compare range " ++ 'objects\n' ++ 'based on the sequence of values they define (instead of ' ++ 'comparing\n' ++ 'based on object identity).\n' ++ '\n' ++ 'New in version 3.3: The "start", "stop" and "step" ' ++ 'attributes.\n', ++ 'typesseq-mutable': '\n' ++ 'Mutable Sequence Types\n' ++ '**********************\n' ++ '\n' ++ 'The operations in the following table are defined on ' ++ 'mutable sequence\n' ++ 'types. The "collections.abc.MutableSequence" ABC is ' ++ 'provided to make\n' ++ 'it easier to correctly implement these operations on ' ++ 'custom sequence\n' ++ 'types.\n' ++ '\n' ++ 'In the table *s* is an instance of a mutable sequence ' ++ 'type, *t* is any\n' ++ 'iterable object and *x* is an arbitrary object that ' ++ 'meets any type and\n' ++ 'value restrictions imposed by *s* (for example, ' ++ '"bytearray" only\n' ++ 'accepts integers that meet the value restriction "0 <= ' ++ 'x <= 255").\n' ++ '\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| Operation | ' ++ 'Result | ' ++ 'Notes |\n' ++ '+================================+==================================+=======================+\n' ++ '| "s[i] = x" | item *i* of *s* is ' ++ 'replaced by | |\n' ++ '| | ' ++ '*x* ' ++ '| |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s[i:j] = t" | slice of *s* from ' ++ '*i* to *j* is | |\n' ++ '| | replaced by the ' ++ 'contents of the | |\n' ++ '| | iterable ' ++ '*t* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "del s[i:j]" | same as "s[i:j] = ' ++ '[]" | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s[i:j:k] = t" | the elements of ' ++ '"s[i:j:k]" are | (1) |\n' ++ '| | replaced by those ' ++ 'of *t* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "del s[i:j:k]" | removes the ' ++ 'elements of | |\n' ++ '| | "s[i:j:k]" from the ' ++ 'list | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.append(x)" | appends *x* to the ' ++ 'end of the | |\n' ++ '| | sequence (same ' ++ 'as | |\n' ++ '| | "s[len(s):len(s)] = ' ++ '[x]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.clear()" | removes all items ' ++ 'from "s" (same | (5) |\n' ++ '| | as "del ' ++ 's[:]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.copy()" | creates a shallow ' ++ 'copy of "s" | (5) |\n' ++ '| | (same as ' ++ '"s[:]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.extend(t)" | extends *s* with ' ++ 'the contents of | |\n' ++ '| | *t* (same as ' ++ '"s[len(s):len(s)] = | |\n' ++ '| | ' ++ 't") ' ++ '| |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.insert(i, x)" | inserts *x* into ' ++ '*s* at the | |\n' ++ '| | index given by *i* ' ++ '(same as | |\n' ++ '| | "s[i:i] = ' ++ '[x]") | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.pop([i])" | retrieves the item ' ++ 'at *i* and | (2) |\n' ++ '| | also removes it ' ++ 'from *s* | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.remove(x)" | remove the first ' ++ 'item from *s* | (3) |\n' ++ '| | where "s[i] == ' ++ 'x" | |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '| "s.reverse()" | reverses the items ' ++ 'of *s* in | (4) |\n' ++ '| | ' ++ 'place ' ++ '| |\n' ++ '+--------------------------------+----------------------------------+-----------------------+\n' ++ '\n' ++ 'Notes:\n' ++ '\n' ++ '1. *t* must have the same length as the slice it is ' ++ 'replacing.\n' ++ '\n' ++ '2. The optional argument *i* defaults to "-1", so that ' ++ 'by default\n' ++ ' the last item is removed and returned.\n' ++ '\n' ++ '3. "remove" raises "ValueError" when *x* is not found ' ++ 'in *s*.\n' ++ '\n' ++ '4. The "reverse()" method modifies the sequence in ' ++ 'place for\n' ++ ' economy of space when reversing a large sequence. ' ++ 'To remind users\n' ++ ' that it operates by side effect, it does not return ' ++ 'the reversed\n' ++ ' sequence.\n' ++ '\n' ++ '5. "clear()" and "copy()" are included for consistency ' ++ 'with the\n' ++ " interfaces of mutable containers that don't support " ++ 'slicing\n' ++ ' operations (such as "dict" and "set")\n' ++ '\n' ++ ' New in version 3.3: "clear()" and "copy()" ' ++ 'methods.\n', ++ 'unary': '\n' ++ 'Unary arithmetic and bitwise operations\n' ++ '***************************************\n' ++ '\n' ++ 'All unary arithmetic and bitwise operations have the same ' ++ 'priority:\n' ++ '\n' ++ ' u_expr ::= power | "-" u_expr | "+" u_expr | "~" u_expr\n' ++ '\n' ++ 'The unary "-" (minus) operator yields the negation of its ' ++ 'numeric\n' ++ 'argument.\n' ++ '\n' ++ 'The unary "+" (plus) operator yields its numeric argument ' ++ 'unchanged.\n' ++ '\n' ++ 'The unary "~" (invert) operator yields the bitwise inversion of ' ++ 'its\n' ++ 'integer argument. The bitwise inversion of "x" is defined as\n' ++ '"-(x+1)". It only applies to integral numbers.\n' ++ '\n' ++ 'In all three cases, if the argument does not have the proper ' ++ 'type, a\n' ++ '"TypeError" exception is raised.\n', ++ 'while': '\n' ++ 'The "while" statement\n' ++ '*********************\n' ++ '\n' ++ 'The "while" statement is used for repeated execution as long as ' ++ 'an\n' ++ 'expression is true:\n' ++ '\n' ++ ' while_stmt ::= "while" expression ":" suite\n' ++ ' ["else" ":" suite]\n' ++ '\n' ++ 'This repeatedly tests the expression and, if it is true, executes ' ++ 'the\n' ++ 'first suite; if the expression is false (which may be the first ' ++ 'time\n' ++ 'it is tested) the suite of the "else" clause, if present, is ' ++ 'executed\n' ++ 'and the loop terminates.\n' ++ '\n' ++ 'A "break" statement executed in the first suite terminates the ' ++ 'loop\n' ++ 'without executing the "else" clause\'s suite. A "continue" ' ++ 'statement\n' ++ 'executed in the first suite skips the rest of the suite and goes ' ++ 'back\n' ++ 'to testing the expression.\n', ++ 'with': '\n' ++ 'The "with" statement\n' ++ '********************\n' ++ '\n' ++ 'The "with" statement is used to wrap the execution of a block ' ++ 'with\n' ++ 'methods defined by a context manager (see section *With Statement\n' ++ 'Context Managers*). This allows common ' ++ '"try"..."except"..."finally"\n' ++ 'usage patterns to be encapsulated for convenient reuse.\n' ++ '\n' ++ ' with_stmt ::= "with" with_item ("," with_item)* ":" suite\n' ++ ' with_item ::= expression ["as" target]\n' ++ '\n' ++ 'The execution of the "with" statement with one "item" proceeds as\n' ++ 'follows:\n' ++ '\n' ++ '1. The context expression (the expression given in the ' ++ '"with_item")\n' ++ ' is evaluated to obtain a context manager.\n' ++ '\n' ++ '2. The context manager\'s "__exit__()" is loaded for later use.\n' ++ '\n' ++ '3. The context manager\'s "__enter__()" method is invoked.\n' ++ '\n' ++ '4. If a target was included in the "with" statement, the return\n' ++ ' value from "__enter__()" is assigned to it.\n' ++ '\n' ++ ' Note: The "with" statement guarantees that if the ' ++ '"__enter__()"\n' ++ ' method returns without an error, then "__exit__()" will ' ++ 'always be\n' ++ ' called. Thus, if an error occurs during the assignment to ' ++ 'the\n' ++ ' target list, it will be treated the same as an error ' ++ 'occurring\n' ++ ' within the suite would be. See step 6 below.\n' ++ '\n' ++ '5. The suite is executed.\n' ++ '\n' ++ '6. The context manager\'s "__exit__()" method is invoked. If an\n' ++ ' exception caused the suite to be exited, its type, value, and\n' ++ ' traceback are passed as arguments to "__exit__()". Otherwise, ' ++ 'three\n' ++ ' "None" arguments are supplied.\n' ++ '\n' ++ ' If the suite was exited due to an exception, and the return ' ++ 'value\n' ++ ' from the "__exit__()" method was false, the exception is ' ++ 'reraised.\n' ++ ' If the return value was true, the exception is suppressed, and\n' ++ ' execution continues with the statement following the "with"\n' ++ ' statement.\n' ++ '\n' ++ ' If the suite was exited for any reason other than an exception, ' ++ 'the\n' ++ ' return value from "__exit__()" is ignored, and execution ' ++ 'proceeds\n' ++ ' at the normal location for the kind of exit that was taken.\n' ++ '\n' ++ 'With more than one item, the context managers are processed as if\n' ++ 'multiple "with" statements were nested:\n' ++ '\n' ++ ' with A() as a, B() as b:\n' ++ ' suite\n' ++ '\n' ++ 'is equivalent to\n' ++ '\n' ++ ' with A() as a:\n' ++ ' with B() as b:\n' ++ ' suite\n' ++ '\n' ++ 'Changed in version 3.1: Support for multiple context expressions.\n' ++ '\n' ++ 'See also: **PEP 0343** - The "with" statement\n' ++ '\n' ++ ' The specification, background, and examples for the Python ' ++ '"with"\n' ++ ' statement.\n', ++ 'yield': '\n' ++ 'The "yield" statement\n' ++ '*********************\n' ++ '\n' ++ ' yield_stmt ::= yield_expression\n' ++ '\n' ++ 'A "yield" statement is semantically equivalent to a *yield\n' ++ 'expression*. The yield statement can be used to omit the ' ++ 'parentheses\n' ++ 'that would otherwise be required in the equivalent yield ' ++ 'expression\n' ++ 'statement. For example, the yield statements\n' ++ '\n' ++ ' yield \n' ++ ' yield from \n' ++ '\n' ++ 'are equivalent to the yield expression statements\n' ++ '\n' ++ ' (yield )\n' ++ ' (yield from )\n' ++ '\n' ++ 'Yield expressions and statements are only used when defining a\n' ++ '*generator* function, and are only used in the body of the ' ++ 'generator\n' ++ 'function. Using yield in a function definition is sufficient to ' ++ 'cause\n' ++ 'that definition to create a generator function instead of a ' ++ 'normal\n' ++ 'function.\n' ++ '\n' ++ 'For full details of "yield" semantics, refer to the *Yield\n' ++ 'expressions* section.\n'} +diff -r 8711a0951384 Lib/sre_parse.py +--- a/Lib/sre_parse.py ++++ b/Lib/sre_parse.py +@@ -94,33 +94,45 @@ + self.data = data + self.width = None + def dump(self, level=0): +- nl = 1 ++ nl = True + seqtypes = (tuple, list) + for op, av in self.data: +- print(level*" " + op, end=' '); nl = 0 +- if op == "in": ++ print(level*" " + op, end='') ++ if op == IN: + # member sublanguage +- print(); nl = 1 ++ print() + for op, a in av: + print((level+1)*" " + op, a) +- elif op == "branch": +- print(); nl = 1 +- i = 0 +- for a in av[1]: +- if i > 0: ++ elif op == BRANCH: ++ print() ++ for i, a in enumerate(av[1]): ++ if i: + print(level*" " + "or") +- a.dump(level+1); nl = 1 +- i = i + 1 ++ a.dump(level+1) ++ elif op == GROUPREF_EXISTS: ++ condgroup, item_yes, item_no = av ++ print('', condgroup) ++ item_yes.dump(level+1) ++ if item_no: ++ print(level*" " + "else") ++ item_no.dump(level+1) + elif isinstance(av, seqtypes): ++ nl = False + for a in av: + if isinstance(a, SubPattern): +- if not nl: print() +- a.dump(level+1); nl = 1 ++ if not nl: ++ print() ++ a.dump(level+1) ++ nl = True + else: +- print(a, end=' ') ; nl = 0 ++ if not nl: ++ print(' ', end='') ++ print(a, end='') ++ nl = False ++ if not nl: ++ print() + else: +- print(av, end=' ') ; nl = 0 +- if not nl: print() ++ print('', av) + def __repr__(self): + return repr(self.data) + def __len__(self): +diff -r 8711a0951384 Lib/subprocess.py +--- a/Lib/subprocess.py ++++ b/Lib/subprocess.py +@@ -837,7 +837,8 @@ + if p2cwrite != -1: + self.stdin = io.open(p2cwrite, 'wb', bufsize) + if universal_newlines: +- self.stdin = io.TextIOWrapper(self.stdin, write_through=True) ++ self.stdin = io.TextIOWrapper(self.stdin, write_through=True, ++ line_buffering=(bufsize == 1)) + if c2pread != -1: + self.stdout = io.open(c2pread, 'rb', bufsize) + if universal_newlines: +diff -r 8711a0951384 Lib/tempfile.py +--- a/Lib/tempfile.py ++++ b/Lib/tempfile.py +@@ -1,10 +1,10 @@ + """Temporary files. + + This module provides generic, low- and high-level interfaces for +-creating temporary files and directories. The interfaces listed +-as "safe" just below can be used without fear of race conditions. +-Those listed as "unsafe" cannot, and are provided for backward +-compatibility only. ++creating temporary files and directories. All of the interfaces ++provided by this module can be used without fear of race conditions ++except for 'mktemp'. 'mktemp' is subject to race conditions and ++should not be used; it is provided for backward compatibility only. + + This module also provides some data items to the user: + +@@ -518,7 +518,7 @@ + else: + # Setting newline="\n" avoids newline translation; + # this is important because otherwise on Windows we'd +- # hget double newline translation upon rollover(). ++ # get double newline translation upon rollover(). + self._file = _io.StringIO(newline="\n") + self._max_size = max_size + self._rolled = False +@@ -663,11 +663,6 @@ + in it are removed. + """ + +- # Handle mkdtemp raising an exception +- name = None +- _finalizer = None +- _closed = False +- + def __init__(self, suffix="", prefix=template, dir=None): + self.name = mkdtemp(suffix, prefix, dir) + self._finalizer = _weakref.finalize( +@@ -675,10 +670,9 @@ + warn_message="Implicitly cleaning up {!r}".format(self)) + + @classmethod +- def _cleanup(cls, name, warn_message=None): ++ def _cleanup(cls, name, warn_message): + _shutil.rmtree(name) +- if warn_message is not None: +- _warnings.warn(warn_message, ResourceWarning) ++ _warnings.warn(warn_message, ResourceWarning) + + + def __repr__(self): +@@ -691,8 +685,5 @@ + self.cleanup() + + def cleanup(self): +- if self._finalizer is not None: +- self._finalizer.detach() +- if self.name is not None and not self._closed: ++ if self._finalizer.detach(): + _shutil.rmtree(self.name) +- self._closed = True +diff -r 8711a0951384 Lib/test/string_tests.py +--- a/Lib/test/string_tests.py ++++ b/Lib/test/string_tests.py +@@ -1,5 +1,5 @@ + """ +-Common tests shared by test_str, test_unicode, test_userstring and test_string. ++Common tests shared by test_unicode, test_userstring and test_string. + """ + + import unittest, string, sys, struct +@@ -79,11 +79,9 @@ + def checkraises(self, exc, obj, methodname, *args): + obj = self.fixtype(obj) + args = self.fixtype(args) +- self.assertRaises( +- exc, +- getattr(obj, methodname), +- *args +- ) ++ with self.assertRaises(exc) as cm: ++ getattr(obj, methodname)(*args) ++ self.assertNotEqual(str(cm.exception), '') + + # call obj.method(*args) without any checks + def checkcall(self, obj, methodname, *args): +@@ -1119,8 +1117,7 @@ + def test_join(self): + # join now works with any sequence type + # moved here, because the argument order is +- # different in string.join (see the test in +- # test.test_string.StringTest.test_join) ++ # different in string.join + self.checkequal('a b c d', ' ', 'join', ['a', 'b', 'c', 'd']) + self.checkequal('abcd', '', 'join', ('a', 'b', 'c', 'd')) + self.checkequal('bd', '', 'join', ('', 'b', '', 'd')) +@@ -1140,6 +1137,7 @@ + self.checkequal('a b c', ' ', 'join', BadSeq2()) + + self.checkraises(TypeError, ' ', 'join') ++ self.checkraises(TypeError, ' ', 'join', None) + self.checkraises(TypeError, ' ', 'join', 7) + self.checkraises(TypeError, ' ', 'join', [1, 2, bytes()]) + try: +diff -r 8711a0951384 Lib/test/test_asyncio/test_base_events.py +--- a/Lib/test/test_asyncio/test_base_events.py ++++ b/Lib/test/test_asyncio/test_base_events.py +@@ -2,6 +2,7 @@ + + import errno + import logging ++import math + import socket + import sys + import time +@@ -73,13 +74,6 @@ + self.assertFalse(self.loop._scheduled) + self.assertIn(h, self.loop._ready) + +- def test__add_callback_timer(self): +- h = asyncio.TimerHandle(time.monotonic()+10, lambda: False, (), +- self.loop) +- +- self.loop._add_callback(h) +- self.assertIn(h, self.loop._scheduled) +- + def test__add_callback_cancelled_handle(self): + h = asyncio.Handle(lambda: False, (), self.loop) + h.cancel() +@@ -283,6 +277,82 @@ + self.assertTrue(processed) + self.assertEqual([handle], list(self.loop._ready)) + ++ def test__run_once_cancelled_event_cleanup(self): ++ self.loop._process_events = mock.Mock() ++ ++ self.assertTrue( ++ 0 < base_events._MIN_CANCELLED_TIMER_HANDLES_FRACTION < 1.0) ++ ++ def cb(): ++ pass ++ ++ # Set up one "blocking" event that will not be cancelled to ++ # ensure later cancelled events do not make it to the head ++ # of the queue and get cleaned. ++ not_cancelled_count = 1 ++ self.loop.call_later(3000, cb) ++ ++ # Add less than threshold (base_events._MIN_SCHEDULED_TIMER_HANDLES) ++ # cancelled handles, ensure they aren't removed ++ ++ cancelled_count = 2 ++ for x in range(2): ++ h = self.loop.call_later(3600, cb) ++ h.cancel() ++ ++ # Add some cancelled events that will be at head and removed ++ cancelled_count += 2 ++ for x in range(2): ++ h = self.loop.call_later(100, cb) ++ h.cancel() ++ ++ # This test is invalid if _MIN_SCHEDULED_TIMER_HANDLES is too low ++ self.assertLessEqual(cancelled_count + not_cancelled_count, ++ base_events._MIN_SCHEDULED_TIMER_HANDLES) ++ ++ self.assertEqual(self.loop._timer_cancelled_count, cancelled_count) ++ ++ self.loop._run_once() ++ ++ cancelled_count -= 2 ++ ++ self.assertEqual(self.loop._timer_cancelled_count, cancelled_count) ++ ++ self.assertEqual(len(self.loop._scheduled), ++ cancelled_count + not_cancelled_count) ++ ++ # Need enough events to pass _MIN_CANCELLED_TIMER_HANDLES_FRACTION ++ # so that deletion of cancelled events will occur on next _run_once ++ add_cancel_count = int(math.ceil( ++ base_events._MIN_SCHEDULED_TIMER_HANDLES * ++ base_events._MIN_CANCELLED_TIMER_HANDLES_FRACTION)) + 1 ++ ++ add_not_cancel_count = max(base_events._MIN_SCHEDULED_TIMER_HANDLES - ++ add_cancel_count, 0) ++ ++ # Add some events that will not be cancelled ++ not_cancelled_count += add_not_cancel_count ++ for x in range(add_not_cancel_count): ++ self.loop.call_later(3600, cb) ++ ++ # Add enough cancelled events ++ cancelled_count += add_cancel_count ++ for x in range(add_cancel_count): ++ h = self.loop.call_later(3600, cb) ++ h.cancel() ++ ++ # Ensure all handles are still scheduled ++ self.assertEqual(len(self.loop._scheduled), ++ cancelled_count + not_cancelled_count) ++ ++ self.loop._run_once() ++ ++ # Ensure cancelled events were removed ++ self.assertEqual(len(self.loop._scheduled), not_cancelled_count) ++ ++ # Ensure only uncancelled events remain scheduled ++ self.assertTrue(all([not x._cancelled for x in self.loop._scheduled])) ++ + def test_run_until_complete_type_error(self): + self.assertRaises(TypeError, + self.loop.run_until_complete, 'blah') +diff -r 8711a0951384 Lib/test/test_asyncio/test_events.py +--- a/Lib/test/test_asyncio/test_events.py ++++ b/Lib/test/test_asyncio/test_events.py +@@ -1890,9 +1890,17 @@ + + # cancelled handle + h.cancel() +- self.assertEqual(repr(h), +- '' +- % (filename, lineno, create_filename, create_lineno)) ++ self.assertEqual( ++ repr(h), ++ '' ++ % (filename, lineno, create_filename, create_lineno)) ++ ++ # double cancellation won't overwrite _repr ++ h.cancel() ++ self.assertEqual( ++ repr(h), ++ '' ++ % (filename, lineno, create_filename, create_lineno)) + + def test_handle_source_traceback(self): + loop = asyncio.get_event_loop_policy().new_event_loop() +diff -r 8711a0951384 Lib/test/test_asyncio/test_tasks.py +--- a/Lib/test/test_asyncio/test_tasks.py ++++ b/Lib/test/test_asyncio/test_tasks.py +@@ -1,5 +1,6 @@ + """Tests for tasks.py.""" + ++import os + import re + import sys + import types +@@ -1768,25 +1769,31 @@ + self.assertEqual(fut.result(), [3, 1, exc, exc2]) + + def test_env_var_debug(self): ++ aio_path = os.path.dirname(os.path.dirname(asyncio.__file__)) ++ + code = '\n'.join(( + 'import asyncio.coroutines', + 'print(asyncio.coroutines._DEBUG)')) + + # Test with -E to not fail if the unit test was run with + # PYTHONASYNCIODEBUG set to a non-empty string +- sts, stdout, stderr = assert_python_ok('-E', '-c', code) ++ sts, stdout, stderr = assert_python_ok('-E', '-c', code, ++ PYTHONPATH=aio_path) + self.assertEqual(stdout.rstrip(), b'False') + + sts, stdout, stderr = assert_python_ok('-c', code, +- PYTHONASYNCIODEBUG='') ++ PYTHONASYNCIODEBUG='', ++ PYTHONPATH=aio_path) + self.assertEqual(stdout.rstrip(), b'False') + + sts, stdout, stderr = assert_python_ok('-c', code, +- PYTHONASYNCIODEBUG='1') ++ PYTHONASYNCIODEBUG='1', ++ PYTHONPATH=aio_path) + self.assertEqual(stdout.rstrip(), b'True') + + sts, stdout, stderr = assert_python_ok('-E', '-c', code, +- PYTHONASYNCIODEBUG='1') ++ PYTHONASYNCIODEBUG='1', ++ PYTHONPATH=aio_path) + self.assertEqual(stdout.rstrip(), b'False') + + +diff -r 8711a0951384 Lib/test/test_bytes.py +--- a/Lib/test/test_bytes.py ++++ b/Lib/test/test_bytes.py +@@ -298,6 +298,7 @@ + seq = [b"abc"] * 1000 + expected = b"abc" + b".:abc" * 999 + self.assertEqual(dot_join(seq), expected) ++ self.assertRaises(TypeError, self.type2test(b" ").join, None) + # Error handling and cleanup when some item in the middle of the + # sequence has the wrong type. + with self.assertRaises(TypeError): +diff -r 8711a0951384 Lib/test/test_faulthandler.py +--- a/Lib/test/test_faulthandler.py ++++ b/Lib/test/test_faulthandler.py +@@ -220,7 +220,7 @@ + """ + not_expected = 'Fatal Python error' + stderr, exitcode = self.get_output(code) +- stder = '\n'.join(stderr) ++ stderr = '\n'.join(stderr) + self.assertTrue(not_expected not in stderr, + "%r is present in %r" % (not_expected, stderr)) + self.assertNotEqual(exitcode, 0) +diff -r 8711a0951384 Lib/test/test_macpath.py +--- a/Lib/test/test_macpath.py ++++ b/Lib/test/test_macpath.py +@@ -49,16 +49,40 @@ + def test_join(self): + join = macpath.join + self.assertEqual(join('a', 'b'), ':a:b') ++ self.assertEqual(join(':a', 'b'), ':a:b') ++ self.assertEqual(join(':a:', 'b'), ':a:b') ++ self.assertEqual(join(':a::', 'b'), ':a::b') ++ self.assertEqual(join(':a', '::b'), ':a::b') ++ self.assertEqual(join('a', ':'), ':a:') ++ self.assertEqual(join('a:', ':'), 'a:') ++ self.assertEqual(join('a', ''), ':a:') ++ self.assertEqual(join('a:', ''), 'a:') ++ self.assertEqual(join('', ''), '') + self.assertEqual(join('', 'a:b'), 'a:b') ++ self.assertEqual(join('', 'a', 'b'), ':a:b') + self.assertEqual(join('a:b', 'c'), 'a:b:c') + self.assertEqual(join('a:b', ':c'), 'a:b:c') + self.assertEqual(join('a', ':b', ':c'), ':a:b:c') ++ self.assertEqual(join('a', 'b:'), 'b:') ++ self.assertEqual(join('a:', 'b:'), 'b:') + + self.assertEqual(join(b'a', b'b'), b':a:b') ++ self.assertEqual(join(b':a', b'b'), b':a:b') ++ self.assertEqual(join(b':a:', b'b'), b':a:b') ++ self.assertEqual(join(b':a::', b'b'), b':a::b') ++ self.assertEqual(join(b':a', b'::b'), b':a::b') ++ self.assertEqual(join(b'a', b':'), b':a:') ++ self.assertEqual(join(b'a:', b':'), b'a:') ++ self.assertEqual(join(b'a', b''), b':a:') ++ self.assertEqual(join(b'a:', b''), b'a:') ++ self.assertEqual(join(b'', b''), b'') + self.assertEqual(join(b'', b'a:b'), b'a:b') ++ self.assertEqual(join(b'', b'a', b'b'), b':a:b') + self.assertEqual(join(b'a:b', b'c'), b'a:b:c') + self.assertEqual(join(b'a:b', b':c'), b'a:b:c') + self.assertEqual(join(b'a', b':b', b':c'), b':a:b:c') ++ self.assertEqual(join(b'a', b'b:'), b'b:') ++ self.assertEqual(join(b'a:', b'b:'), b'b:') + + def test_splitext(self): + splitext = macpath.splitext +diff -r 8711a0951384 Lib/test/test_re.py +--- a/Lib/test/test_re.py ++++ b/Lib/test/test_re.py +@@ -766,8 +766,8 @@ + self.assertTrue(re.match((r"[\x%02xz]" % i).encode(), bytes([i]))) + self.assertTrue(re.match(br"[\u]", b'u')) + self.assertTrue(re.match(br"[\U]", b'U')) +- self.assertRaises(re.error, re.match, br"[\911]", "") +- self.assertRaises(re.error, re.match, br"[\x1z]", "") ++ self.assertRaises(re.error, re.match, br"[\911]", b"") ++ self.assertRaises(re.error, re.match, br"[\x1z]", b"") + + def test_bug_113254(self): + self.assertEqual(re.match(r'(a)|(b)', 'b').start(1), -1) +@@ -1203,16 +1203,33 @@ + self.assertEqual(m.group(2), "y") + + def test_debug_flag(self): ++ pat = r'(\.)(?:[ch]|py)(?(1)$|: )' + with captured_stdout() as out: +- re.compile('foo', re.DEBUG) +- self.assertEqual(out.getvalue().splitlines(), +- ['literal 102 ', 'literal 111 ', 'literal 111 ']) ++ re.compile(pat, re.DEBUG) ++ dump = '''\ ++subpattern 1 ++ literal 46 ++subpattern None ++ branch ++ in ++ literal 99 ++ literal 104 ++ or ++ literal 112 ++ literal 121 ++subpattern None ++ groupref_exists 1 ++ at at_end ++ else ++ literal 58 ++ literal 32 ++''' ++ self.assertEqual(out.getvalue(), dump) + # Debug output is output again even a second time (bypassing + # the cache -- issue #20426). + with captured_stdout() as out: +- re.compile('foo', re.DEBUG) +- self.assertEqual(out.getvalue().splitlines(), +- ['literal 102 ', 'literal 111 ', 'literal 111 ']) ++ re.compile(pat, re.DEBUG) ++ self.assertEqual(out.getvalue(), dump) + + def test_keyword_parameters(self): + # Issue #20283: Accepting the string keyword parameter. +diff -r 8711a0951384 Lib/test/test_statistics.py +--- a/Lib/test/test_statistics.py ++++ b/Lib/test/test_statistics.py +@@ -991,14 +991,14 @@ + result = statistics._sum([1, 2, inf, 3, -inf, 4]) + self.assertTrue(math.isnan(result)) + +- def test_decimal_mismatched_infs_to_nan(self): ++ def test_decimal_extendedcontext_mismatched_infs_to_nan(self): + # Test adding Decimal INFs with opposite sign returns NAN. + inf = Decimal('inf') + data = [1, 2, inf, 3, -inf, 4] + with decimal.localcontext(decimal.ExtendedContext): + self.assertTrue(math.isnan(statistics._sum(data))) + +- def test_decimal_mismatched_infs_to_nan(self): ++ def test_decimal_basiccontext_mismatched_infs_to_nan(self): + # Test adding Decimal INFs with opposite sign raises InvalidOperation. + inf = Decimal('inf') + data = [1, 2, inf, 3, -inf, 4] +diff -r 8711a0951384 Lib/test/test_subprocess.py +--- a/Lib/test/test_subprocess.py ++++ b/Lib/test/test_subprocess.py +@@ -1008,6 +1008,39 @@ + p = subprocess.Popen([sys.executable, "-c", "pass"], bufsize=None) + self.assertEqual(p.wait(), 0) + ++ def _test_bufsize_equal_one(self, line, expected, universal_newlines): ++ # subprocess may deadlock with bufsize=1, see issue #21332 ++ with subprocess.Popen([sys.executable, "-c", "import sys;" ++ "sys.stdout.write(sys.stdin.readline());" ++ "sys.stdout.flush()"], ++ stdin=subprocess.PIPE, ++ stdout=subprocess.PIPE, ++ stderr=subprocess.DEVNULL, ++ bufsize=1, ++ universal_newlines=universal_newlines) as p: ++ p.stdin.write(line) # expect that it flushes the line in text mode ++ os.close(p.stdin.fileno()) # close it without flushing the buffer ++ read_line = p.stdout.readline() ++ try: ++ p.stdin.close() ++ except OSError: ++ pass ++ p.stdin = None ++ self.assertEqual(p.returncode, 0) ++ self.assertEqual(read_line, expected) ++ ++ def test_bufsize_equal_one_text_mode(self): ++ # line is flushed in text mode with bufsize=1. ++ # we should get the full line in return ++ line = "line\n" ++ self._test_bufsize_equal_one(line, line, universal_newlines=True) ++ ++ def test_bufsize_equal_one_binary_mode(self): ++ # line is not flushed in binary mode with bufsize=1. ++ # we should get empty response ++ line = b'line' + os.linesep.encode() # assume ascii-based locale ++ self._test_bufsize_equal_one(line, b'', universal_newlines=False) ++ + def test_leaking_fds_on_error(self): + # see bug #5179: Popen leaks file descriptors to PIPEs if + # the child fails to execute; this will eventually exhaust +diff -r 8711a0951384 Lib/test/test_tempfile.py +--- a/Lib/test/test_tempfile.py ++++ b/Lib/test/test_tempfile.py +@@ -1211,6 +1211,30 @@ + self.assertNotIn("Exception ", err) + self.assertIn("ResourceWarning: Implicitly cleaning up", err) + ++ def test_exit_on_shutdown(self): ++ # Issue #22427 ++ with self.do_create() as dir: ++ code = """if True: ++ import sys ++ import tempfile ++ import warnings ++ ++ def generator(): ++ with tempfile.TemporaryDirectory(dir={dir!r}) as tmp: ++ yield tmp ++ g = generator() ++ sys.stdout.buffer.write(next(g).encode()) ++ ++ warnings.filterwarnings("always", category=ResourceWarning) ++ """.format(dir=dir) ++ rc, out, err = script_helper.assert_python_ok("-c", code) ++ tmp_name = out.decode().strip() ++ self.assertFalse(os.path.exists(tmp_name), ++ "TemporaryDirectory %s exists after cleanup" % tmp_name) ++ err = err.decode('utf-8', 'backslashreplace') ++ self.assertNotIn("Exception ", err) ++ self.assertIn("ResourceWarning: Implicitly cleaning up", err) ++ + def test_warnings_on_cleanup(self): + # ResourceWarning will be triggered by __del__ + with self.do_create() as dir: +diff -r 8711a0951384 Lib/test/test_threading.py +--- a/Lib/test/test_threading.py ++++ b/Lib/test/test_threading.py +@@ -4,7 +4,7 @@ + + import test.support + from test.support import verbose, strip_python_stderr, import_module, cpython_only +-from test.script_helper import assert_python_ok ++from test.script_helper import assert_python_ok, assert_python_failure + + import random + import re +@@ -15,7 +15,6 @@ + import unittest + import weakref + import os +-from test.script_helper import assert_python_ok, assert_python_failure + import subprocess + + from test import lock_tests +@@ -962,6 +961,88 @@ + self.assertEqual(p.returncode, 0, "Unexpected error: " + stderr.decode()) + self.assertEqual(data, expected_output) + ++ def test_print_exception(self): ++ script = r"""if True: ++ import threading ++ import time ++ ++ running = False ++ def run(): ++ global running ++ running = True ++ while running: ++ time.sleep(0.01) ++ 1/0 ++ t = threading.Thread(target=run) ++ t.start() ++ while not running: ++ time.sleep(0.01) ++ running = False ++ t.join() ++ """ ++ rc, out, err = assert_python_ok("-c", script) ++ self.assertEqual(out, b'') ++ err = err.decode() ++ self.assertIn("Exception in thread", err) ++ self.assertIn("Traceback (most recent call last):", err) ++ self.assertIn("ZeroDivisionError", err) ++ self.assertNotIn("Unhandled exception", err) ++ ++ def test_print_exception_stderr_is_none_1(self): ++ script = r"""if True: ++ import sys ++ import threading ++ import time ++ ++ running = False ++ def run(): ++ global running ++ running = True ++ while running: ++ time.sleep(0.01) ++ 1/0 ++ t = threading.Thread(target=run) ++ t.start() ++ while not running: ++ time.sleep(0.01) ++ sys.stderr = None ++ running = False ++ t.join() ++ """ ++ rc, out, err = assert_python_ok("-c", script) ++ self.assertEqual(out, b'') ++ err = err.decode() ++ self.assertIn("Exception in thread", err) ++ self.assertIn("Traceback (most recent call last):", err) ++ self.assertIn("ZeroDivisionError", err) ++ self.assertNotIn("Unhandled exception", err) ++ ++ def test_print_exception_stderr_is_none_2(self): ++ script = r"""if True: ++ import sys ++ import threading ++ import time ++ ++ running = False ++ def run(): ++ global running ++ running = True ++ while running: ++ time.sleep(0.01) ++ 1/0 ++ sys.stderr = None ++ t = threading.Thread(target=run) ++ t.start() ++ while not running: ++ time.sleep(0.01) ++ running = False ++ t.join() ++ """ ++ rc, out, err = assert_python_ok("-c", script) ++ self.assertEqual(out, b'') ++ self.assertNotIn("Unhandled exception", err.decode()) ++ ++ + class TimerTests(BaseTestCase): + + def setUp(self): +diff -r 8711a0951384 Lib/test/test_userstring.py +--- a/Lib/test/test_userstring.py ++++ b/Lib/test/test_userstring.py +@@ -28,14 +28,12 @@ + realresult + ) + +- def checkraises(self, exc, object, methodname, *args): +- object = self.fixtype(object) ++ def checkraises(self, exc, obj, methodname, *args): ++ obj = self.fixtype(obj) + # we don't fix the arguments, because UserString can't cope with it +- self.assertRaises( +- exc, +- getattr(object, methodname), +- *args +- ) ++ with self.assertRaises(exc) as cm: ++ getattr(obj, methodname)(*args) ++ self.assertNotEqual(str(cm.exception), '') + + def checkcall(self, object, methodname, *args): + object = self.fixtype(object) +diff -r 8711a0951384 Lib/test/test_zipfile.py +--- a/Lib/test/test_zipfile.py ++++ b/Lib/test/test_zipfile.py +@@ -462,7 +462,9 @@ + + def setUp(self): + self._limit = zipfile.ZIP64_LIMIT +- zipfile.ZIP64_LIMIT = 5 ++ self._filecount_limit = zipfile.ZIP_FILECOUNT_LIMIT ++ zipfile.ZIP64_LIMIT = 1000 ++ zipfile.ZIP_FILECOUNT_LIMIT = 9 + + # Make a source file with some lines + with open(TESTFN, "wb") as fp: +@@ -529,8 +531,67 @@ + for f in get_files(self): + self.zip_test(f, self.compression) + ++ def test_too_many_files(self): ++ # This test checks that more than 64k files can be added to an archive, ++ # and that the resulting archive can be read properly by ZipFile ++ zipf = zipfile.ZipFile(TESTFN, "w", self.compression, ++ allowZip64=True) ++ zipf.debug = 100 ++ numfiles = 15 ++ for i in range(numfiles): ++ zipf.writestr("foo%08d" % i, "%d" % (i**3 % 57)) ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ zipf.close() ++ ++ zipf2 = zipfile.ZipFile(TESTFN, "r", self.compression) ++ self.assertEqual(len(zipf2.namelist()), numfiles) ++ for i in range(numfiles): ++ content = zipf2.read("foo%08d" % i).decode('ascii') ++ self.assertEqual(content, "%d" % (i**3 % 57)) ++ zipf2.close() ++ ++ def test_too_many_files_append(self): ++ zipf = zipfile.ZipFile(TESTFN, "w", self.compression, ++ allowZip64=False) ++ zipf.debug = 100 ++ numfiles = 9 ++ for i in range(numfiles): ++ zipf.writestr("foo%08d" % i, "%d" % (i**3 % 57)) ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ with self.assertRaises(zipfile.LargeZipFile): ++ zipf.writestr("foo%08d" % numfiles, b'') ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ zipf.close() ++ ++ zipf = zipfile.ZipFile(TESTFN, "a", self.compression, ++ allowZip64=False) ++ zipf.debug = 100 ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ with self.assertRaises(zipfile.LargeZipFile): ++ zipf.writestr("foo%08d" % numfiles, b'') ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ zipf.close() ++ ++ zipf = zipfile.ZipFile(TESTFN, "a", self.compression, ++ allowZip64=True) ++ zipf.debug = 100 ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ numfiles2 = 15 ++ for i in range(numfiles, numfiles2): ++ zipf.writestr("foo%08d" % i, "%d" % (i**3 % 57)) ++ self.assertEqual(len(zipf.namelist()), numfiles2) ++ zipf.close() ++ ++ zipf2 = zipfile.ZipFile(TESTFN, "r", self.compression) ++ self.assertEqual(len(zipf2.namelist()), numfiles2) ++ for i in range(numfiles2): ++ content = zipf2.read("foo%08d" % i).decode('ascii') ++ self.assertEqual(content, "%d" % (i**3 % 57)) ++ zipf2.close() ++ + def tearDown(self): + zipfile.ZIP64_LIMIT = self._limit ++ zipfile.ZIP_FILECOUNT_LIMIT = self._filecount_limit + unlink(TESTFN) + unlink(TESTFN2) + +@@ -1635,11 +1696,48 @@ + os.mkdir(os.path.join(TESTFN2, "a")) + self.test_extract_dir() + +- def test_store_dir(self): ++ def test_write_dir(self): ++ dirpath = os.path.join(TESTFN2, "x") ++ os.mkdir(dirpath) ++ mode = os.stat(dirpath).st_mode & 0xFFFF ++ with zipfile.ZipFile(TESTFN, "w") as zipf: ++ zipf.write(dirpath) ++ zinfo = zipf.filelist[0] ++ self.assertTrue(zinfo.filename.endswith("/x/")) ++ self.assertEqual(zinfo.external_attr, (mode << 16) | 0x10) ++ zipf.write(dirpath, "y") ++ zinfo = zipf.filelist[1] ++ self.assertTrue(zinfo.filename, "y/") ++ self.assertEqual(zinfo.external_attr, (mode << 16) | 0x10) ++ with zipfile.ZipFile(TESTFN, "r") as zipf: ++ zinfo = zipf.filelist[0] ++ self.assertTrue(zinfo.filename.endswith("/x/")) ++ self.assertEqual(zinfo.external_attr, (mode << 16) | 0x10) ++ zinfo = zipf.filelist[1] ++ self.assertTrue(zinfo.filename, "y/") ++ self.assertEqual(zinfo.external_attr, (mode << 16) | 0x10) ++ target = os.path.join(TESTFN2, "target") ++ os.mkdir(target) ++ zipf.extractall(target) ++ self.assertTrue(os.path.isdir(os.path.join(target, "y"))) ++ self.assertEqual(len(os.listdir(target)), 2) ++ ++ def test_writestr_dir(self): + os.mkdir(os.path.join(TESTFN2, "x")) +- zipf = zipfile.ZipFile(TESTFN, "w") +- zipf.write(os.path.join(TESTFN2, "x"), "x") +- self.assertTrue(zipf.filelist[0].filename.endswith("x/")) ++ with zipfile.ZipFile(TESTFN, "w") as zipf: ++ zipf.writestr("x/", b'') ++ zinfo = zipf.filelist[0] ++ self.assertEqual(zinfo.filename, "x/") ++ self.assertEqual(zinfo.external_attr, (0o40775 << 16) | 0x10) ++ with zipfile.ZipFile(TESTFN, "r") as zipf: ++ zinfo = zipf.filelist[0] ++ self.assertTrue(zinfo.filename.endswith("x/")) ++ self.assertEqual(zinfo.external_attr, (0o40775 << 16) | 0x10) ++ target = os.path.join(TESTFN2, "target") ++ os.mkdir(target) ++ zipf.extractall(target) ++ self.assertTrue(os.path.isdir(os.path.join(target, "x"))) ++ self.assertEqual(os.listdir(target), ["x"]) + + def tearDown(self): + rmtree(TESTFN2) +diff -r 8711a0951384 Lib/test/test_zipfile64.py +--- a/Lib/test/test_zipfile64.py ++++ b/Lib/test/test_zipfile64.py +@@ -18,7 +18,7 @@ + from io import StringIO + from tempfile import TemporaryFile + +-from test.support import TESTFN, run_unittest, requires_zlib ++from test.support import TESTFN, requires_zlib + + TESTFN2 = TESTFN + "2" + +@@ -92,7 +92,7 @@ + def testMoreThan64kFiles(self): + # This test checks that more than 64k files can be added to an archive, + # and that the resulting archive can be read properly by ZipFile +- zipf = zipfile.ZipFile(TESTFN, mode="w", allowZip64=False) ++ zipf = zipfile.ZipFile(TESTFN, mode="w", allowZip64=True) + zipf.debug = 100 + numfiles = (1 << 16) * 3//2 + for i in range(numfiles): +@@ -105,14 +105,47 @@ + for i in range(numfiles): + content = zipf2.read("foo%08d" % i).decode('ascii') + self.assertEqual(content, "%d" % (i**3 % 57)) ++ zipf2.close() ++ ++ def testMoreThan64kFilesAppend(self): ++ zipf = zipfile.ZipFile(TESTFN, mode="w", allowZip64=False) ++ zipf.debug = 100 ++ numfiles = (1 << 16) - 1 ++ for i in range(numfiles): ++ zipf.writestr("foo%08d" % i, "%d" % (i**3 % 57)) ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ with self.assertRaises(zipfile.LargeZipFile): ++ zipf.writestr("foo%08d" % numfiles, b'') ++ self.assertEqual(len(zipf.namelist()), numfiles) + zipf.close() + ++ zipf = zipfile.ZipFile(TESTFN, mode="a", allowZip64=False) ++ zipf.debug = 100 ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ with self.assertRaises(zipfile.LargeZipFile): ++ zipf.writestr("foo%08d" % numfiles, b'') ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ zipf.close() ++ ++ zipf = zipfile.ZipFile(TESTFN, mode="a", allowZip64=True) ++ zipf.debug = 100 ++ self.assertEqual(len(zipf.namelist()), numfiles) ++ numfiles2 = (1 << 16) * 3//2 ++ for i in range(numfiles, numfiles2): ++ zipf.writestr("foo%08d" % i, "%d" % (i**3 % 57)) ++ self.assertEqual(len(zipf.namelist()), numfiles2) ++ zipf.close() ++ ++ zipf2 = zipfile.ZipFile(TESTFN, mode="r") ++ self.assertEqual(len(zipf2.namelist()), numfiles2) ++ for i in range(numfiles2): ++ content = zipf2.read("foo%08d" % i).decode('ascii') ++ self.assertEqual(content, "%d" % (i**3 % 57)) ++ zipf2.close() ++ + def tearDown(self): + support.unlink(TESTFN) + support.unlink(TESTFN2) + +-def test_main(): +- run_unittest(TestsWithSourceFile, OtherTests) +- + if __name__ == "__main__": +- test_main() ++ unittest.main() +diff -r 8711a0951384 Lib/threading.py +--- a/Lib/threading.py ++++ b/Lib/threading.py +@@ -248,7 +248,7 @@ + + def _is_owned(self): + # Return True if lock is owned by current_thread. +- # This method is called only if __lock doesn't have _is_owned(). ++ # This method is called only if _lock doesn't have _is_owned(). + if self._lock.acquire(0): + self._lock.release() + return False +@@ -749,12 +749,12 @@ + + """ + +- __initialized = False ++ _initialized = False + # Need to store a reference to sys.exc_info for printing + # out exceptions when a thread tries to use a global var. during interp. + # shutdown and thus raises an exception about trying to perform some + # operation on/with a NoneType +- __exc_info = _sys.exc_info ++ _exc_info = _sys.exc_info + # Keep sys.exc_clear too to clear the exception just before + # allowing .join() to return. + #XXX __exc_clear = _sys.exc_clear +@@ -926,10 +926,10 @@ + # shutdown) use self._stderr. Otherwise still use sys (as in + # _sys) in case sys.stderr was redefined since the creation of + # self. +- if _sys: +- _sys.stderr.write("Exception in thread %s:\n%s\n" % +- (self.name, _format_exc())) +- else: ++ if _sys and _sys.stderr is not None: ++ print("Exception in thread %s:\n%s" % ++ (self.name, _format_exc()), file=self._stderr) ++ elif self._stderr is not None: + # Do the best job possible w/o a huge amt. of code to + # approximate a traceback (code ideas from + # Lib/traceback.py) +@@ -957,7 +957,7 @@ + # test_threading.test_no_refcycle_through_target when + # the exception keeps the target alive past when we + # assert that it's dead. +- #XXX self.__exc_clear() ++ #XXX self._exc_clear() + pass + finally: + with _active_limbo_lock: +diff -r 8711a0951384 Lib/zipfile.py +--- a/Lib/zipfile.py ++++ b/Lib/zipfile.py +@@ -50,7 +50,7 @@ + + + ZIP64_LIMIT = (1 << 31) - 1 +-ZIP_FILECOUNT_LIMIT = 1 << 16 ++ZIP_FILECOUNT_LIMIT = (1 << 16) - 1 + ZIP_MAX_COMMENT = (1 << 16) - 1 + + # constants for Zip file compression methods +@@ -1304,13 +1304,17 @@ + raise RuntimeError( + "Attempt to write ZIP archive that was already closed") + _check_compression(zinfo.compress_type) +- if zinfo.file_size > ZIP64_LIMIT: +- if not self._allowZip64: +- raise LargeZipFile("Filesize would require ZIP64 extensions") +- if zinfo.header_offset > ZIP64_LIMIT: +- if not self._allowZip64: +- raise LargeZipFile( +- "Zipfile size would require ZIP64 extensions") ++ if not self._allowZip64: ++ requires_zip64 = None ++ if len(self.filelist) >= ZIP_FILECOUNT_LIMIT: ++ requires_zip64 = "Files count" ++ elif zinfo.file_size > ZIP64_LIMIT: ++ requires_zip64 = "Filesize" ++ elif zinfo.header_offset > ZIP64_LIMIT: ++ requires_zip64 = "Zipfile size" ++ if requires_zip64: ++ raise LargeZipFile(requires_zip64 + ++ " would require ZIP64 extensions") + + def write(self, filename, arcname=None, compress_type=None): + """Put the bytes from filename into the archive under the name +@@ -1352,6 +1356,7 @@ + zinfo.file_size = 0 + zinfo.compress_size = 0 + zinfo.CRC = 0 ++ zinfo.external_attr |= 0x10 # MS-DOS directory flag + self.filelist.append(zinfo) + self.NameToInfo[zinfo.filename] = zinfo + self.fp.write(zinfo.FileHeader(False)) +@@ -1412,7 +1417,11 @@ + zinfo = ZipInfo(filename=zinfo_or_arcname, + date_time=time.localtime(time.time())[:6]) + zinfo.compress_type = self.compression +- zinfo.external_attr = 0o600 << 16 ++ if zinfo.filename[-1] == '/': ++ zinfo.external_attr = 0o40775 << 16 # drwxrwxr-x ++ zinfo.external_attr |= 0x10 # MS-DOS directory flag ++ else: ++ zinfo.external_attr = 0o600 << 16 # ?rw------- + else: + zinfo = zinfo_or_arcname + +@@ -1464,10 +1473,8 @@ + + try: + if self.mode in ("w", "a") and self._didModify: # write ending records +- count = 0 + pos1 = self.fp.tell() + for zinfo in self.filelist: # write central directory +- count = count + 1 + dt = zinfo.date_time + dosdate = (dt[0] - 1980) << 9 | dt[1] << 5 | dt[2] + dostime = dt[3] << 11 | dt[4] << 5 | (dt[5] // 2) +@@ -1531,13 +1538,21 @@ + + pos2 = self.fp.tell() + # Write end-of-zip-archive record +- centDirCount = count ++ centDirCount = len(self.filelist) + centDirSize = pos2 - pos1 + centDirOffset = pos1 +- if (centDirCount >= ZIP_FILECOUNT_LIMIT or +- centDirOffset > ZIP64_LIMIT or +- centDirSize > ZIP64_LIMIT): ++ requires_zip64 = None ++ if centDirCount > ZIP_FILECOUNT_LIMIT: ++ requires_zip64 = "Files count" ++ elif centDirOffset > ZIP64_LIMIT: ++ requires_zip64 = "Central directory offset" ++ elif centDirSize > ZIP64_LIMIT: ++ requires_zip64 = "Central directory size" ++ if requires_zip64: + # Need to write the ZIP64 end-of-archive records ++ if not self._allowZip64: ++ raise LargeZipFile(requires_zip64 + ++ " would require ZIP64 extensions") + zip64endrec = struct.pack( + structEndArchive64, stringEndArchive64, + 44, 45, 45, 0, 0, centDirCount, centDirCount, +diff -r 8711a0951384 Mac/PythonLauncher/Makefile.in +--- a/Mac/PythonLauncher/Makefile.in ++++ b/Mac/PythonLauncher/Makefile.in +@@ -53,8 +53,6 @@ + --resource=$(srcdir)/factorySettings.plist \ + --plist Info.plist \ + build +- find "Python Launcher.app" -name '.svn' -print0 | xargs -0 rm -r +- + + FileSettings.o: $(srcdir)/FileSettings.m + $(CC) $(CFLAGS) -o $@ -c $(srcdir)/FileSettings.m +diff -r 8711a0951384 Misc/ACKS +--- a/Misc/ACKS ++++ b/Misc/ACKS +@@ -237,6 +237,7 @@ + Jerry Chen + Michael Chermside + Ingrid Cheung ++Terry Chia + Albert Chin-A-Young + Adal Chiriliuc + Matt Chisholm +@@ -278,6 +279,7 @@ + Garrett Cooper + Greg Copeland + Aldo Cortesi ++Ian Cordasco + David Costanzo + Scott Cotton + Greg Couch +@@ -296,6 +298,7 @@ + Joaquin Cuenca Abela + John Cugini + Tom Culliton ++Raúl Cumplido + Antonio Cuni + Brian Curtin + Lisandro Dalcin +@@ -409,6 +412,7 @@ + John Feuerstein + Carl Feynman + Vincent Fiack ++Anastasia Filatova + Tomer Filiba + Jeffrey Finkelstein + Russell Finn +@@ -585,6 +589,7 @@ + Nadav Horesh + Alon Horev + Jan Hosang ++Jonathan Hosmer + Alan Hourihane + Ken Howard + Brad Howes +@@ -1005,6 +1010,7 @@ + Todd R. Palmer + Juan David Ibáñez Palomar + Jan Palus ++Yongzhi Pan + Martin Panter + Mathias Panzenböck + M. Papillon +diff -r 8711a0951384 Misc/NEWS +--- a/Misc/NEWS ++++ b/Misc/NEWS +@@ -2,6 +2,30 @@ + Python News + +++++++++++ + ++ ++What's New in Python 3.4.3? ++=========================== ++ ++Core and Builtins ++----------------- ++ ++- Issue #22519: Fix overflow checking in PyBytes_Repr. ++ ++- Issue #22518: Fix integer overflow issues in latin-1 encoding. ++ ++Library ++------- ++ ++- Issue #22448: Improve canceled timer handles cleanup to prevent ++ unbound memory usage. Patch by Joshua Moore-Oliva. ++ ++Build ++----- ++ ++- Issue #16537: Check whether self.extensions is empty in setup.py. Patch by ++ Jonathan Hosmer. ++ ++ + What's New in Python 3.4.2? + =========================== + +@@ -10,6 +34,42 @@ + Core and Builtins + ----------------- + ++Library ++------- ++ ++- Issue #10510: distutils register and upload methods now use HTML standards ++ compliant CRLF line endings. ++ ++- Issue #9850: Fixed macpath.join() for empty first component. Patch by ++ Oleg Oshmyan. ++ ++- Issue #22427: TemporaryDirectory no longer attempts to clean up twice when ++ used in the with statement in generator. ++ ++- Issue #20912: Now directories added to ZIP file have correct Unix and MS-DOS ++ directory attributes. ++ ++- Issue #21866: ZipFile.close() no longer writes ZIP64 central directory ++ records if allowZip64 is false. ++ ++- Issue #22415: Fixed debugging output of the GROUPREF_EXISTS opcode in the re ++ module. Removed trailing spaces in debugging output. ++ ++- Issue #22423: Unhandled exception in thread no longer causes unhandled ++ AttributeError when sys.stderr is None. ++ ++- Issue #21332: Ensure that ``bufsize=1`` in subprocess.Popen() selects ++ line buffering, rather than block buffering. Patch by Akira Li. ++ ++ ++What's New in Python 3.4.2rc1? ++============================== ++ ++Release date: 2014-09-22 ++ ++Core and Builtins ++----------------- ++ + - Issue #22258: Fix the the internal function set_inheritable() on Illumos. + This platform exposes the function ``ioctl(FIOCLEX)``, but calling it fails + with errno is ENOTTY: "Inappropriate ioctl for device". set_inheritable() +@@ -83,7 +143,7 @@ + selection or control(command) '-' or '+' or control-mousewheel. + Original patch by Lita Cho. + +-_ Issue #21597: The separator between the turtledemo text pane and the drawing ++- Issue #21597: The separator between the turtledemo text pane and the drawing + canvas can now be grabbed and dragged with a mouse. The code text pane can + be widened to easily view or copy the full width of the text. The canvas + can be widened on small screens. Original patches by Jan Kanis and Lita Cho. +diff -r 8711a0951384 Modules/_io/fileio.c +--- a/Modules/_io/fileio.c ++++ b/Modules/_io/fileio.c +@@ -1124,7 +1124,8 @@ + "This is needed for lower-level file interfaces, such the fcntl module."); + + PyDoc_STRVAR(seek_doc, +-"seek(offset: int[, whence: int]) -> None. Move to new file position.\n" ++"seek(offset: int[, whence: int]) -> int. Move to new file position and\n" ++"return the file position.\n" + "\n" + "Argument offset is a byte count. Optional argument whence defaults to\n" + "0 (offset from start of file, offset should be >= 0); other values are 1\n" +@@ -1136,9 +1137,10 @@ + + #ifdef HAVE_FTRUNCATE + PyDoc_STRVAR(truncate_doc, +-"truncate([size: int]) -> None. Truncate the file to at most size bytes.\n" ++"truncate([size: int]) -> int. Truncate the file to at most size bytes\n" ++"and return the truncated size.\n" + "\n" +-"Size defaults to the current file position, as returned by tell()." ++"Size defaults to the current file position, as returned by tell().\n" + "The current file position is changed to the value of size."); + #endif + +diff -r 8711a0951384 Objects/bytesobject.c +--- a/Objects/bytesobject.c ++++ b/Objects/bytesobject.c +@@ -594,7 +594,7 @@ + { + PyBytesObject* op = (PyBytesObject*) obj; + Py_ssize_t i, length = Py_SIZE(op); +- size_t newsize, squotes, dquotes; ++ Py_ssize_t newsize, squotes, dquotes; + PyObject *v; + unsigned char quote, *s, *p; + +@@ -603,28 +603,27 @@ + newsize = 3; /* b'' */ + s = (unsigned char*)op->ob_sval; + for (i = 0; i < length; i++) { ++ Py_ssize_t incr = 1; + switch(s[i]) { +- case '\'': squotes++; newsize++; break; +- case '"': dquotes++; newsize++; break; ++ case '\'': squotes++; break; ++ case '"': dquotes++; break; + case '\\': case '\t': case '\n': case '\r': +- newsize += 2; break; /* \C */ ++ incr = 2; break; /* \C */ + default: + if (s[i] < ' ' || s[i] >= 0x7f) +- newsize += 4; /* \xHH */ +- else +- newsize++; ++ incr = 4; /* \xHH */ + } ++ if (newsize > PY_SSIZE_T_MAX - incr) ++ goto overflow; ++ newsize += incr; + } + quote = '\''; + if (smartquotes && squotes && !dquotes) + quote = '"'; +- if (squotes && quote == '\'') ++ if (squotes && quote == '\'') { ++ if (newsize > PY_SSIZE_T_MAX - squotes) ++ goto overflow; + newsize += squotes; +- +- if (newsize > (PY_SSIZE_T_MAX - sizeof(PyUnicodeObject) - 1)) { +- PyErr_SetString(PyExc_OverflowError, +- "bytes object is too large to make repr"); +- return NULL; + } + + v = PyUnicode_New(newsize, 127); +@@ -656,6 +655,11 @@ + *p++ = quote; + assert(_PyUnicode_CheckConsistency(v, 1)); + return v; ++ ++ overflow: ++ PyErr_SetString(PyExc_OverflowError, ++ "bytes object is too large to make repr"); ++ return NULL; + } + + static PyObject * +diff -r 8711a0951384 Objects/unicodeobject.c +--- a/Objects/unicodeobject.c ++++ b/Objects/unicodeobject.c +@@ -4093,16 +4093,21 @@ + have+the replacement+the rest of the string (starting + at the new input position), so we won't have to check space + when there are no errors in the rest of the string) */ +- requiredsize = *outpos + repwlen + insize-newpos; ++ requiredsize = *outpos; ++ if (requiredsize > PY_SSIZE_T_MAX - repwlen) ++ goto overflow; ++ requiredsize += repwlen; ++ if (requiredsize > PY_SSIZE_T_MAX - (insize - newpos)) ++ goto overflow; ++ requiredsize += insize - newpos; + if (requiredsize > outsize) { +- if (requiredsize < 2*outsize) ++ if (outsize <= PY_SSIZE_T_MAX/2 && requiredsize < 2*outsize) + requiredsize = 2*outsize; + if (unicode_resize(output, requiredsize) < 0) + goto onError; + } + wcsncpy(_PyUnicode_WSTR(*output) + *outpos, repwstr, repwlen); + *outpos += repwlen; +- + *endinpos = newpos; + *inptr = *input + newpos; + +@@ -4110,6 +4115,10 @@ + Py_XDECREF(restuple); + return 0; + ++ overflow: ++ PyErr_SetString(PyExc_OverflowError, ++ "decoded result is too long for a Python string"); ++ + onError: + Py_XDECREF(restuple); + return -1; +@@ -6502,7 +6511,7 @@ + Py_ssize_t collstart = pos; + Py_ssize_t collend = pos; + /* find all unecodable characters */ +- while ((collend < size) && (PyUnicode_READ(kind, data, collend)>=limit)) ++ while ((collend < size) && (PyUnicode_READ(kind, data, collend) >= limit)) + ++collend; + /* cache callback name lookup (if not done yet, i.e. it's the first error) */ + if (known_errorHandler==-1) { +@@ -6522,36 +6531,43 @@ + raise_encode_exception(&exc, encoding, unicode, collstart, collend, reason); + goto onError; + case 2: /* replace */ +- while (collstart++ PY_SSIZE_T_MAX - incr) ++ goto overflow; ++ requiredsize += incr; + } +- requiredsize = respos+repsize+(size-collend); ++ if (requiredsize > PY_SSIZE_T_MAX - (size - collend)) ++ goto overflow; ++ requiredsize += size - collend; + if (requiredsize > ressize) { +- if (requiredsize<2*ressize) ++ if (ressize <= PY_SSIZE_T_MAX/2 && requiredsize < 2*ressize) + requiredsize = 2*ressize; + if (_PyBytes_Resize(&res, requiredsize)) + goto onError; +@@ -6577,6 +6593,10 @@ + if (repsize > 1) { + /* Make room for all additional bytes. */ + respos = str - PyBytes_AS_STRING(res); ++ if (ressize > PY_SSIZE_T_MAX - repsize - 1) { ++ Py_DECREF(repunicode); ++ goto overflow; ++ } + if (_PyBytes_Resize(&res, ressize+repsize-1)) { + Py_DECREF(repunicode); + goto onError; +@@ -6595,9 +6615,15 @@ + we won't have to check space for encodable characters) */ + respos = str - PyBytes_AS_STRING(res); + repsize = PyUnicode_GET_LENGTH(repunicode); +- requiredsize = respos+repsize+(size-collend); ++ requiredsize = respos; ++ if (requiredsize > PY_SSIZE_T_MAX - repsize) ++ goto overflow; ++ requiredsize += repsize; ++ if (requiredsize > PY_SSIZE_T_MAX - (size - collend)) ++ goto overflow; ++ requiredsize += size - collend; + if (requiredsize > ressize) { +- if (requiredsize<2*ressize) ++ if (ressize <= PY_SSIZE_T_MAX/2 && requiredsize < 2*ressize) + requiredsize = 2*ressize; + if (_PyBytes_Resize(&res, requiredsize)) { + Py_DECREF(repunicode); +@@ -6635,6 +6661,10 @@ + Py_XDECREF(exc); + return res; + ++ overflow: ++ PyErr_SetString(PyExc_OverflowError, ++ "encoded result is too long for a Python string"); ++ + onError: + Py_XDECREF(res); + Py_XDECREF(errorHandler); +diff -r 8711a0951384 Python/codecs.c +--- a/Python/codecs.c ++++ b/Python/codecs.c +@@ -890,8 +890,10 @@ + ressize += 1+1+2; + } + res = PyUnicode_New(ressize, 127); +- if (res==NULL) ++ if (res == NULL) { ++ Py_DECREF(object); + return NULL; ++ } + for (i = start, outp = PyUnicode_1BYTE_DATA(res); + i < end; ++i) { + c = PyUnicode_READ_CHAR(object, i); +diff -r 8711a0951384 setup.py +--- a/setup.py ++++ b/setup.py +@@ -252,7 +252,9 @@ + + build_ext.build_extensions(self) + +- longest = max([len(e.name) for e in self.extensions]) ++ longest = 0 ++ if self.extensions: ++ longest = max([len(e.name) for e in self.extensions]) + if self.failed: + longest = max(longest, max([len(name) for name in self.failed])) + --- python3.4-3.4.2~rc1.orig/debian/patches/hurd-disable-nonworking-constants.diff +++ python3.4-3.4.2~rc1/debian/patches/hurd-disable-nonworking-constants.diff @@ -0,0 +1,38 @@ +# DP: Comment out constant exposed on the API which are not implemented on +# DP: GNU/Hurd. They would not work at runtime anyway. + +Index: b/Modules/socketmodule.c +=================================================================== +--- a/Modules/socketmodule.c ++++ b/Modules/socketmodule.c +@@ -6136,9 +6136,11 @@ PyInit__socket(void) + #ifdef SO_OOBINLINE + PyModule_AddIntMacro(m, SO_OOBINLINE); + #endif ++#ifndef __GNU__ + #ifdef SO_REUSEPORT + PyModule_AddIntMacro(m, SO_REUSEPORT); + #endif ++#endif + #ifdef SO_SNDBUF + PyModule_AddIntMacro(m, SO_SNDBUF); + #endif +Index: b/Modules/posixmodule.c +=================================================================== +--- a/Modules/posixmodule.c ++++ b/Modules/posixmodule.c +@@ -11724,12 +11724,14 @@ all_ins(PyObject *m) + #ifdef O_LARGEFILE + if (PyModule_AddIntMacro(m, O_LARGEFILE)) return -1; + #endif ++#ifndef __GNU__ + #ifdef O_SHLOCK + if (PyModule_AddIntMacro(m, O_SHLOCK)) return -1; + #endif + #ifdef O_EXLOCK + if (PyModule_AddIntMacro(m, O_EXLOCK)) return -1; + #endif ++#endif + #ifdef O_EXEC + if (PyModule_AddIntMacro(m, O_EXEC)) return -1; + #endif --- python3.4-3.4.2~rc1.orig/debian/patches/issue21264.diff +++ python3.4-3.4.2~rc1/debian/patches/issue21264.diff @@ -0,0 +1,28 @@ +# DP: Fix issue #21264, test_compileall test failures in the installed location + +--- a/Lib/test/test_compileall.py ++++ b/Lib/test/test_compileall.py +@@ -187,19 +187,19 @@ + os.utime(pycpath, (time.time()-60,)*2) + mtime = os.stat(pycpath).st_mtime + # Without force, no recompilation +- self.assertRunOK(PYTHONPATH=self.directory) ++ self.assertRunOK(self.directory) + mtime2 = os.stat(pycpath).st_mtime + self.assertEqual(mtime, mtime2) + # Now force it. +- self.assertRunOK('-f', PYTHONPATH=self.directory) ++ self.assertRunOK('-f', self.directory) + mtime2 = os.stat(pycpath).st_mtime + self.assertNotEqual(mtime, mtime2) + + def test_no_args_respects_quiet_flag(self): + script_helper.make_script(self.directory, 'baz', '') +- noisy = self.assertRunOK(PYTHONPATH=self.directory) ++ noisy = self.assertRunOK(self.directory) + self.assertIn(b'Listing ', noisy) +- quiet = self.assertRunOK('-q', PYTHONPATH=self.directory) ++ quiet = self.assertRunOK('-q', self.directory) + self.assertNotIn(b'Listing ', quiet) + + # Ensure that the default behavior of compileall's CLI is to create --- python3.4-3.4.2~rc1.orig/debian/patches/langpack-gettext.diff +++ python3.4-3.4.2~rc1/debian/patches/langpack-gettext.diff @@ -0,0 +1,36 @@ +# DP: Description: support alternative gettext tree in +# DP: /usr/share/locale-langpack; if a file is present in both trees, +# DP: prefer the newer one +# DP: Upstream status: Ubuntu-Specific + +Index: b/Lib/gettext.py +=================================================================== +--- a/Lib/gettext.py ++++ b/Lib/gettext.py +@@ -378,11 +378,26 @@ + if lang == 'C': + break + mofile = os.path.join(localedir, lang, 'LC_MESSAGES', '%s.mo' % domain) ++ mofile_lp = os.path.join("/usr/share/locale-langpack", lang, ++ 'LC_MESSAGES', '%s.mo' % domain) ++ ++ # first look into the standard locale dir, then into the ++ # langpack locale dir ++ ++ # standard mo file + if os.path.exists(mofile): + if all: + result.append(mofile) + else: + return mofile ++ ++ # langpack mofile -> use it ++ if os.path.exists(mofile_lp): ++ if all: ++ result.append(mofile_lp) ++ else: ++ return mofile_lp ++ + return result + + --- python3.4-3.4.2~rc1.orig/debian/patches/lib-argparse.diff +++ python3.4-3.4.2~rc1/debian/patches/lib-argparse.diff @@ -0,0 +1,22 @@ +# DP: argparse.py: Make the gettext import conditional + +--- a/Lib/argparse.py ++++ b/Lib/argparse.py +@@ -90,7 +90,16 @@ + import sys as _sys + import textwrap as _textwrap + +-from gettext import gettext as _, ngettext ++try: ++ from gettext import gettext as _, ngettext ++except ImportError: ++ def _(message): ++ return message ++ def ngettext(singular,plural,n): ++ if n == 1: ++ return singular ++ else: ++ return plural + + + SUPPRESS = '==SUPPRESS==' --- python3.4-3.4.2~rc1.orig/debian/patches/lib2to3-no-pickled-grammar.diff +++ python3.4-3.4.2~rc1/debian/patches/lib2to3-no-pickled-grammar.diff @@ -0,0 +1,14 @@ +--- a/Lib/lib2to3/pgen2/driver.py ++++ b/Lib/lib2to3/pgen2/driver.py +@@ -119,7 +119,10 @@ + if force or not _newer(gp, gt): + logger.info("Generating grammar tables from %s", gt) + g = pgen.generate_grammar(gt) +- if save: ++ # the pickle files mismatch, when built on different architectures. ++ # don't save these for now. An alternative solution might be to ++ # include the multiarch triplet into the file name ++ if False: + logger.info("Writing grammar tables to %s", gp) + try: + g.dump(gp) --- python3.4-3.4.2~rc1.orig/debian/patches/libffi-shared.diff +++ python3.4-3.4.2~rc1/debian/patches/libffi-shared.diff @@ -0,0 +1,13 @@ +Index: b/setup.py +=================================================================== +--- a/setup.py ++++ b/setup.py +@@ -1954,7 +1954,7 @@ class PyBuildExt(build_ext): + break + ffi_lib = None + if ffi_inc is not None: +- for lib_name in ('ffi_convenience', 'ffi_pic', 'ffi'): ++ for lib_name in ('ffi', 'ffi_convenience', 'ffi_pic', 'ffi'): + if (self.compiler.find_library_file(lib_dirs, lib_name)): + ffi_lib = lib_name + break --- python3.4-3.4.2~rc1.orig/debian/patches/link-opt.diff +++ python3.4-3.4.2~rc1/debian/patches/link-opt.diff @@ -0,0 +1,26 @@ +# DP: Call the linker with -O1 -Bsymbolic-functions + +Index: b/configure.ac +=================================================================== +--- a/configure.ac ++++ b/configure.ac +@@ -2056,8 +2056,8 @@ then + fi + ;; + Linux*|GNU*|QNX*) +- LDSHARED='$(CC) -shared' +- LDCXXSHARED='$(CXX) -shared';; ++ LDSHARED='$(CC) -shared -Wl,-O1 -Wl,-Bsymbolic-functions' ++ LDCXXSHARED='$(CXX) -shared -Wl,-O1 -Wl,-Bsymbolic-functions';; + BSD/OS*/4*) + LDSHARED="gcc -shared" + LDCXXSHARED="g++ -shared";; +@@ -2155,7 +2155,7 @@ then + LINKFORSHARED="-Wl,-E -Wl,+s";; + # LINKFORSHARED="-Wl,-E -Wl,+s -Wl,+b\$(BINLIBDEST)/lib-dynload";; + BSD/OS/4*) LINKFORSHARED="-Xlinker -export-dynamic";; +- Linux*|GNU*) LINKFORSHARED="-Xlinker -export-dynamic";; ++ Linux*|GNU*) LINKFORSHARED="-Xlinker -export-dynamic -Wl,-O1 -Wl,-Bsymbolic-functions";; + # -u libsys_s pulls in all symbols in libsys + Darwin/*) + LINKFORSHARED="$extra_undefs -framework CoreFoundation" --- python3.4-3.4.2~rc1.orig/debian/patches/link-timemodule.diff +++ python3.4-3.4.2~rc1/debian/patches/link-timemodule.diff @@ -0,0 +1,13 @@ +Index: b/Modules/Setup.dist +=================================================================== +--- a/Modules/Setup.dist ++++ b/Modules/Setup.dist +@@ -171,7 +171,7 @@ + #cmath cmathmodule.c _math.c # -lm # complex math library functions + #math mathmodule.c _math.c # -lm # math library functions, e.g. sin() + #_struct _struct.c # binary structure packing/unpacking +-#time timemodule.c # -lm # time operations and variables ++#time timemodule.c -lrt # -lm # time operations and variables + #_weakref _weakref.c # basic weak reference support + #_testcapi _testcapimodule.c # Python C API test module + #_random _randommodule.c # Random number generator --- python3.4-3.4.2~rc1.orig/debian/patches/locale-module.diff +++ python3.4-3.4.2~rc1/debian/patches/locale-module.diff @@ -0,0 +1,19 @@ +# DP: * Lib/locale.py: +# DP: - Don't map 'utf8', 'utf-8' to 'utf', which is not a known encoding +# DP: for glibc. + +Index: b/Lib/locale.py +=================================================================== +--- a/Lib/locale.py ++++ b/Lib/locale.py +@@ -1222,8 +1222,8 @@ + 'turkish': 'tr_TR.ISO8859-9', + 'uk': 'uk_UA.KOI8-U', + 'uk_ua': 'uk_UA.KOI8-U', +- 'univ': 'en_US.utf', +- 'universal': 'en_US.utf', ++ 'univ': 'en_US.UTF-8', ++ 'universal': 'en_US.UTF-8', + 'universal.utf8@ucs4': 'en_US.UTF-8', + 'ur': 'ur_PK.CP1256', + 'ur_in': 'ur_IN.UTF-8', --- python3.4-3.4.2~rc1.orig/debian/patches/lto-link-flags.diff +++ python3.4-3.4.2~rc1/debian/patches/lto-link-flags.diff @@ -0,0 +1,22 @@ +Index: b/Makefile.pre.in +=================================================================== +--- a/Makefile.pre.in ++++ b/Makefile.pre.in +@@ -133,7 +133,7 @@ CONFINCLUDEPY= $(CONFINCLUDEDIR)/python$ + SHLIB_SUFFIX= @SHLIB_SUFFIX@ + EXT_SUFFIX= @EXT_SUFFIX@ + LDSHARED= @LDSHARED@ $(PY_LDFLAGS) +-BLDSHARED= @BLDSHARED@ $(PY_LDFLAGS) ++BLDSHARED= @BLDSHARED@ $(PY_LDFLAGS) $(PY_CFLAGS) + LDCXXSHARED= @LDCXXSHARED@ + DESTSHARED= $(BINLIBDEST)/lib-dynload + +@@ -547,7 +547,7 @@ clinic: $(BUILDPYTHON) + + # Build the interpreter + $(BUILDPYTHON): Modules/python.o $(LIBRARY) $(LDLIBRARY) $(PY3LIBRARY) +- $(LINKCC) $(PY_LDFLAGS) $(LINKFORSHARED) -o $@ Modules/python.o $(BLDLIBRARY) $(LIBS) $(MODLIBS) $(SYSLIBS) $(LDLAST) ++ $(LINKCC) $(PY_LDFLAGS) $(PY_CFLAGS) $(LINKFORSHARED) -o $@ Modules/python.o $(BLDLIBRARY) $(LIBS) $(MODLIBS) $(SYSLIBS) $(LDLAST) + + platform: $(BUILDPYTHON) pybuilddir.txt + $(RUNSHARED) $(PYTHON_FOR_BUILD) -c 'import sys ; from sysconfig import get_platform ; print(get_platform()+"-"+sys.version[0:3])' >platform --- python3.4-3.4.2~rc1.orig/debian/patches/makesetup-bashism.diff +++ python3.4-3.4.2~rc1/debian/patches/makesetup-bashism.diff @@ -0,0 +1,15 @@ +# DP: Fix bashism in makesetup shell script + +Index: b/Modules/makesetup +=================================================================== +--- a/Modules/makesetup ++++ b/Modules/makesetup +@@ -277,7 +277,7 @@ sed -e 's/[ ]*#.*//' -e '/^[ ]*$/d' | + -) ;; + *) sedf="@sed.in.$$" + trap 'rm -f $sedf' 0 1 2 3 +- echo "1i\\" >$sedf ++ printf "1i\\" >$sedf + str="# Generated automatically from $makepre by makesetup." + echo "$str" >>$sedf + echo "s%_MODOBJS_%$OBJS%" >>$sedf --- python3.4-3.4.2~rc1.orig/debian/patches/multiarch-extname.diff +++ python3.4-3.4.2~rc1/debian/patches/multiarch-extname.diff @@ -0,0 +1,84 @@ +Index: b/Lib/distutils/dir_util.py +=================================================================== +--- a/Lib/distutils/dir_util.py ++++ b/Lib/distutils/dir_util.py +@@ -96,6 +96,9 @@ def create_tree(base_dir, files, mode=0o + for dir in sorted(need_dir): + mkpath(dir, mode, verbose=verbose, dry_run=dry_run) + ++import sysconfig ++_multiarch = None ++ + def copy_tree(src, dst, preserve_mode=1, preserve_times=1, + preserve_symlinks=0, update=0, verbose=1, dry_run=0): + """Copy an entire directory tree 'src' to a new location 'dst'. +@@ -131,6 +134,9 @@ def copy_tree(src, dst, preserve_mode=1, + raise DistutilsFileError( + "error listing files in '%s': %s" % (src, e.strerror)) + ++ ext_suffix = sysconfig.get_config_var ('EXT_SUFFIX') ++ new_suffix = "%s-%s%s" % (ext_suffix[:-3], _multiarch, ext_suffix[-3:]) ++ + if not dry_run: + mkpath(dst, verbose=verbose) + +@@ -139,6 +145,9 @@ def copy_tree(src, dst, preserve_mode=1, + for n in names: + src_name = os.path.join(src, n) + dst_name = os.path.join(dst, n) ++ if _multiarch and n.endswith(ext_suffix) and not n.endswith(new_suffix): ++ dst_name = os.path.join(dst, n.replace(ext_suffix, new_suffix)) ++ log.info("renaming extension %s -> %s", n, n.replace(ext_suffix, new_suffix)) + + if n.startswith('.nfs'): + # skip NFS rename files +Index: b/Lib/distutils/command/install_lib.py +=================================================================== +--- a/Lib/distutils/command/install_lib.py ++++ b/Lib/distutils/command/install_lib.py +@@ -56,6 +56,7 @@ class install_lib(Command): + self.compile = None + self.optimize = None + self.skip_build = None ++ self.multiarch = None # if we should rename the extensions + + def finalize_options(self): + # Get all the information we need to install pure Python modules +@@ -68,6 +69,7 @@ class install_lib(Command): + ('compile', 'compile'), + ('optimize', 'optimize'), + ('skip_build', 'skip_build'), ++ ('multiarch', 'multiarch'), + ) + + if self.compile is None: +@@ -108,6 +110,8 @@ class install_lib(Command): + + def install(self): + if os.path.isdir(self.build_dir): ++ import distutils.dir_util ++ distutils.dir_util._multiarch = self.multiarch + outfiles = self.copy_tree(self.build_dir, self.install_dir) + else: + self.warn("'%s' does not exist -- no Python modules to install" % +Index: b/Lib/distutils/command/install.py +=================================================================== +--- a/Lib/distutils/command/install.py ++++ b/Lib/distutils/command/install.py +@@ -192,6 +192,7 @@ class install(Command): + + # enable custom installation, known values: deb + self.install_layout = None ++ self.multiarch = None + + self.compile = None + self.optimize = None +@@ -449,6 +450,8 @@ class install(Command): + self.install_platbase = self.exec_prefix + if self.install_layout: + if self.install_layout.lower() in ['deb']: ++ import sysconfig ++ self.multiarch = sysconfig.get_config_var('MULTIARCH') + self.select_scheme("deb_system") + elif self.install_layout.lower() in ['unix']: + self.select_scheme("unix_prefix") --- python3.4-3.4.2~rc1.orig/debian/patches/multiarch.diff +++ python3.4-3.4.2~rc1/debian/patches/multiarch.diff @@ -0,0 +1,162 @@ +Index: b/Lib/sysconfig.py +=================================================================== +--- a/Lib/sysconfig.py ++++ b/Lib/sysconfig.py +@@ -339,6 +339,8 @@ def get_makefile_filename(): + config_dir_name = 'config-%s%s' % (_PY_VERSION_SHORT, sys.abiflags) + else: + config_dir_name = 'config' ++ if hasattr(sys.implementation, '_multiarch'): ++ config_dir_name += '-%s' % sys.implementation._multiarch + return os.path.join(get_path('stdlib'), config_dir_name, 'Makefile') + + def _generate_posix_vars(): +@@ -545,6 +547,12 @@ def get_config_vars(*args): + # the init-function. + _CONFIG_VARS['userbase'] = _getuserbase() + ++ multiarch = get_config_var('MULTIARCH') ++ if multiarch: ++ _CONFIG_VARS['multiarchsubdir'] = '/' + multiarch ++ else: ++ _CONFIG_VARS['multiarchsubdir'] = '' ++ + # Always convert srcdir to an absolute path + srcdir = _CONFIG_VARS.get('srcdir', _PROJECT_BASE) + if os.name == 'posix': +Index: b/Lib/distutils/sysconfig.py +=================================================================== +--- a/Lib/distutils/sysconfig.py ++++ b/Lib/distutils/sysconfig.py +@@ -111,6 +111,9 @@ def get_python_inc(plat_specific=0, pref + incdir = os.path.join(get_config_var('srcdir'), 'Include') + return os.path.normpath(incdir) + python_dir = 'python' + get_python_version() + build_flags ++ if not python_build and plat_specific: ++ import sysconfig ++ return sysconfig.get_path('platinclude') + return os.path.join(prefix, "include", python_dir) + elif os.name == "nt": + return os.path.join(prefix, "include") +@@ -269,6 +272,8 @@ def get_makefile_filename(): + return os.path.join(_sys_home or project_base, "Makefile") + lib_dir = get_python_lib(plat_specific=0, standard_lib=1) + config_file = 'config-{}{}'.format(get_python_version(), build_flags) ++ if hasattr(sys.implementation, '_multiarch'): ++ config_file += '-%s' % sys.implementation._multiarch + return os.path.join(lib_dir, config_file, 'Makefile') + + +Index: b/Makefile.pre.in +=================================================================== +--- a/Makefile.pre.in ++++ b/Makefile.pre.in +@@ -739,6 +739,7 @@ Modules/signalmodule.o: $(srcdir)/Module + + Python/dynload_shlib.o: $(srcdir)/Python/dynload_shlib.c Makefile + $(CC) -c $(PY_CORE_CFLAGS) \ ++ $(if $(MULTIARCH),-DMULTIARCH='"$(MULTIARCH)"') \ + -DSOABI='"$(SOABI)"' \ + -o $@ $(srcdir)/Python/dynload_shlib.c + +@@ -750,6 +751,7 @@ Python/dynload_hpux.o: $(srcdir)/Python/ + Python/sysmodule.o: $(srcdir)/Python/sysmodule.c Makefile + $(CC) -c $(PY_CORE_CFLAGS) \ + -DABIFLAGS='"$(ABIFLAGS)"' \ ++ -DMULTIARCH='"$(MULTIARCH)"' \ + -o $@ $(srcdir)/Python/sysmodule.c + + $(IO_OBJS): $(IO_H) +@@ -1131,7 +1133,7 @@ maninstall: altmaninstall + (cd $(DESTDIR)$(MANDIR)/man1; $(LN) -s python$(VERSION).1 python3.1) + + # Install the library +-PLATDIR= plat-$(MACHDEP) ++PLATDIR= plat-$(MULTIARCH) + EXTRAPLATDIR= @EXTRAPLATDIR@ + MACHDEPS= $(PLATDIR) $(EXTRAPLATDIR) + XMLLIBSUBDIRS= xml xml/dom xml/etree xml/parsers xml/sax +@@ -1272,6 +1274,10 @@ libinstall: build_all $(srcdir)/Lib/$(PL + $(srcdir)/Lib/$(PLATDIR): + mkdir $(srcdir)/Lib/$(PLATDIR) + cp $(srcdir)/Lib/plat-generic/regen $(srcdir)/Lib/$(PLATDIR)/regen ++ if [ -n "$(MULTIARCH)" ]; then \ ++ cp -p $(srcdir)/Lib/plat-linux/*.py $(srcdir)/Lib/$(PLATDIR)/.; \ ++ rm -f $(srcdir)/Lib/$(PLATDIR)/IN.py; \ ++ fi + export PATH; PATH="`pwd`:$$PATH"; \ + export PYTHONPATH; PYTHONPATH="`pwd`/Lib"; \ + export DYLD_FRAMEWORK_PATH; DYLD_FRAMEWORK_PATH="`pwd`"; \ +@@ -1319,10 +1325,10 @@ inclinstall: + + # Install the library and miscellaneous stuff needed for extending/embedding + # This goes into $(exec_prefix) +-LIBPL= $(LIBDEST)/config-$(LDVERSION) ++LIBPL= $(LIBDEST)/config-$(LDVERSION)-$(MULTIARCH) + + # pkgconfig directory +-LIBPC= $(LIBDIR)/pkgconfig ++LIBPC= $(LIBDIR)/$(MULTIARCH)/pkgconfig + + libainstall: all python-config + @for i in $(LIBDIR) $(LIBPL) $(LIBPC); \ +Index: b/Python/dynload_shlib.c +=================================================================== +--- a/Python/dynload_shlib.c ++++ b/Python/dynload_shlib.c +@@ -36,6 +36,9 @@ const char *_PyImport_DynLoadFiletab[] = + #ifdef __CYGWIN__ + ".dll", + #else /* !__CYGWIN__ */ ++#ifdef MULTIARCH ++ "." SOABI "-" MULTIARCH ".so", ++#endif + "." SOABI ".so", + ".abi" PYTHON_ABI_STRING ".so", + ".so", +Index: b/Modules/Setup.dist +=================================================================== +--- a/Modules/Setup.dist ++++ b/Modules/Setup.dist +@@ -91,7 +91,7 @@ SITEPATH= + TESTPATH= + + # Path components for machine- or system-dependent modules and shared libraries +-MACHDEPPATH=:plat-$(MACHDEP) ++MACHDEPPATH=:plat-$(MULTIARCH) + EXTRAMACHDEPPATH= + + COREPYTHONPATH=$(DESTPATH)$(SITEPATH)$(TESTPATH)$(MACHDEPPATH)$(EXTRAMACHDEPPATH) +Index: b/Python/sysmodule.c +=================================================================== +--- a/Python/sysmodule.c ++++ b/Python/sysmodule.c +@@ -1603,6 +1603,15 @@ make_impl_info(PyObject *version_info) + if (res < 0) + goto error; + ++ /* For Debian multiarch support. */ ++ value = PyUnicode_FromString(MULTIARCH); ++ if (value == NULL) ++ goto error; ++ res = PyDict_SetItemString(impl_info, "_multiarch", value); ++ Py_DECREF(value); ++ if (res < 0) ++ goto error; ++ + /* dict ready */ + + ns = _PyNamespace_New(impl_info); +Index: b/configure.ac +=================================================================== +--- a/configure.ac ++++ b/configure.ac +@@ -4115,7 +4115,7 @@ AC_MSG_RESULT($LDVERSION) + + dnl define LIBPL after ABIFLAGS and LDVERSION is defined. + AC_SUBST(PY_ENABLE_SHARED) +-LIBPL="${prefix}/lib/python${VERSION}/config-${LDVERSION}" ++LIBPL="${prefix}/lib/python${VERSION}/config-${LDVERSION}-${MULTIARCH}" + AC_SUBST(LIBPL) + + # Check whether right shifting a negative integer extends the sign bit --- python3.4-3.4.2~rc1.orig/debian/patches/no-large-file-support.diff +++ python3.4-3.4.2~rc1/debian/patches/no-large-file-support.diff @@ -0,0 +1,14 @@ +# DP: disable large file support for GNU/Hurd + +--- a/configure.ac ++++ b/configure.ac +@@ -1402,6 +1402,9 @@ + use_lfs=no + fi + ++# Don't use largefile support anyway. ++use_lfs=no ++ + if test "$use_lfs" = "yes"; then + # Two defines needed to enable largefile support on various platforms + # These may affect some typedefs --- python3.4-3.4.2~rc1.orig/debian/patches/no-zip-on-sys.path.diff +++ python3.4-3.4.2~rc1/debian/patches/no-zip-on-sys.path.diff @@ -0,0 +1,124 @@ +# DP: Do not add /usr/lib/pythonXY.zip on sys.path. + +Index: b/Modules/getpath.c +=================================================================== +--- a/Modules/getpath.c ++++ b/Modules/getpath.c +@@ -470,7 +470,9 @@ calculate_path(void) + wchar_t *path = NULL; + wchar_t *prog = Py_GetProgramName(); + wchar_t argv0_path[MAXPATHLEN+1]; ++#ifdef WITH_ZIP_PATH + wchar_t zip_path[MAXPATHLEN+1]; ++#endif + int pfound, efound; /* 1 if found; -1 if found build directory */ + wchar_t *buf; + size_t bufsz; +@@ -675,6 +677,7 @@ calculate_path(void) + else + reduce(prefix); + ++#ifdef WITH_ZIP_PATH + wcsncpy(zip_path, prefix, MAXPATHLEN); + zip_path[MAXPATHLEN] = L'\0'; + if (pfound > 0) { /* Use the reduced prefix returned by Py_GetPrefix() */ +@@ -687,6 +690,7 @@ calculate_path(void) + bufsz = wcslen(zip_path); /* Replace "00" with version */ + zip_path[bufsz - 6] = VERSION[0]; + zip_path[bufsz - 5] = VERSION[2]; ++#endif + + efound = search_for_exec_prefix(argv0_path, home, + _exec_prefix, lib_python); +@@ -732,7 +736,9 @@ calculate_path(void) + defpath = delim + 1; + } + ++#ifdef WITH_ZIP_PATH + bufsz += wcslen(zip_path) + 1; ++#endif + bufsz += wcslen(exec_prefix) + 1; + /* When running from the build directory, add room for the Modules + * subdirectory too. +@@ -754,9 +760,11 @@ calculate_path(void) + else + buf[0] = '\0'; + ++#ifdef WITH_ZIP_PATH + /* Next is the default zip path */ + wcscat(buf, zip_path); + wcscat(buf, delimiter); ++#endif + + /* Next goes merge of compile-time $PYTHONPATH with + * dynamically located prefix. +Index: b/Lib/test/test_cmd_line_script.py +=================================================================== +--- a/Lib/test/test_cmd_line_script.py ++++ b/Lib/test/test_cmd_line_script.py +@@ -256,11 +256,6 @@ class CmdLineTest(unittest.TestCase): + script_dir, '', + importlib.machinery.SourcelessFileLoader) + +- def test_directory_error(self): +- with temp_dir() as script_dir: +- msg = "can't find '__main__' module in %r" % script_dir +- self._check_import_error(script_dir, msg) +- + def test_zipfile(self): + with temp_dir() as script_dir: + script_name = _make_test_script(script_dir, '__main__') +@@ -276,13 +271,6 @@ class CmdLineTest(unittest.TestCase): + self._check_script(zip_name, run_name, zip_name, zip_name, '', + zipimport.zipimporter) + +- def test_zipfile_error(self): +- with temp_dir() as script_dir: +- script_name = _make_test_script(script_dir, 'not_main') +- zip_name, run_name = make_zip_script(script_dir, 'test_zip', script_name) +- msg = "can't find '__main__' module in %r" % zip_name +- self._check_import_error(zip_name, msg) +- + def test_module_in_package(self): + with temp_dir() as script_dir: + pkg_dir = os.path.join(script_dir, 'test_pkg') +Index: b/Lib/test/test_zipimport_support.py +=================================================================== +--- a/Lib/test/test_zipimport_support.py ++++ b/Lib/test/test_zipimport_support.py +@@ -185,35 +185,6 @@ class ZipSupportTests(unittest.TestCase) + finally: + del sys.modules["test_zipped_doctest"] + +- def test_doctest_main_issue4197(self): +- test_src = textwrap.dedent("""\ +- class Test: +- ">>> 'line 2'" +- pass +- +- import doctest +- doctest.testmod() +- """) +- pattern = 'File "%s", line 2, in %s' +- with temp_dir() as d: +- script_name = make_script(d, 'script', test_src) +- rc, out, err = assert_python_ok(script_name) +- expected = pattern % (script_name, "__main__.Test") +- if verbose: +- print ("Expected line", expected) +- print ("Got stdout:") +- print (ascii(out)) +- self.assertIn(expected.encode('utf-8'), out) +- zip_name, run_name = make_zip_script(d, "test_zip", +- script_name, '__main__.py') +- rc, out, err = assert_python_ok(zip_name) +- expected = pattern % (run_name, "__main__.Test") +- if verbose: +- print ("Expected line", expected) +- print ("Got stdout:") +- print (ascii(out)) +- self.assertIn(expected.encode('utf-8'), out) +- + def test_pdb_issue4201(self): + test_src = textwrap.dedent("""\ + def f(): --- python3.4-3.4.2~rc1.orig/debian/patches/platform-lsbrelease.diff +++ python3.4-3.4.2~rc1/debian/patches/platform-lsbrelease.diff @@ -0,0 +1,77 @@ +# DP: Use /etc/lsb-release to identify the platform. + +Index: b/Lib/platform.py +=================================================================== +--- a/Lib/platform.py ++++ b/Lib/platform.py +@@ -265,7 +265,7 @@ + _supported_dists = ( + 'SuSE', 'debian', 'fedora', 'redhat', 'centos', + 'mandrake', 'mandriva', 'rocks', 'slackware', 'yellowdog', 'gentoo', +- 'UnitedLinux', 'turbolinux', 'arch', 'mageia') ++ 'UnitedLinux', 'turbolinux', 'arch', 'mageia', 'Ubuntu') + + def _parse_release_file(firstline): + +@@ -294,6 +294,10 @@ + id = l[1] + return '', version, id + ++_distributor_id_file_re = re.compile("(?:DISTRIB_ID\s*=)\s*(.*)", re.I) ++_release_file_re = re.compile("(?:DISTRIB_RELEASE\s*=)\s*(.*)", re.I) ++_codename_file_re = re.compile("(?:DISTRIB_CODENAME\s*=)\s*(.*)", re.I) ++ + def linux_distribution(distname='', version='', id='', + + supported_dists=_supported_dists, +@@ -318,6 +322,25 @@ + args given as parameters. + + """ ++ # check for the Debian/Ubuntu /etc/lsb-release file first, needed so ++ # that the distribution doesn't get identified as Debian. ++ try: ++ with open("/etc/lsb-release", "r") as etclsbrel: ++ for line in etclsbrel: ++ m = _distributor_id_file_re.search(line) ++ if m: ++ _u_distname = m.group(1).strip() ++ m = _release_file_re.search(line) ++ if m: ++ _u_version = m.group(1).strip() ++ m = _codename_file_re.search(line) ++ if m: ++ _u_id = m.group(1).strip() ++ if _u_distname and _u_version: ++ return (_u_distname, _u_version, _u_id) ++ except (EnvironmentError, UnboundLocalError): ++ pass ++ + try: + etc = os.listdir(_UNIXCONFDIR) + except OSError: +Index: b/Lib/test/test_platform.py +=================================================================== +--- a/Lib/test/test_platform.py ++++ b/Lib/test/test_platform.py +@@ -297,20 +297,6 @@ + returncode = ret >> 8 + self.assertEqual(returncode, len(data)) + +- def test_linux_distribution_encoding(self): +- # Issue #17429 +- with tempfile.TemporaryDirectory() as tempdir: +- filename = os.path.join(tempdir, 'fedora-release') +- with open(filename, 'w', encoding='utf-8') as f: +- f.write('Fedora release 19 (Schr\xf6dinger\u2019s Cat)\n') +- +- with mock.patch('platform._UNIXCONFDIR', tempdir): +- distname, version, distid = platform.linux_distribution() +- +- self.assertEqual(distname, 'Fedora') +- self.assertEqual(version, '19') +- self.assertEqual(distid, 'Schr\xf6dinger\u2019s Cat') +- + def test_main(): + support.run_unittest( + PlatformTest --- python3.4-3.4.2~rc1.orig/debian/patches/profiled-build.diff +++ python3.4-3.4.2~rc1/debian/patches/profiled-build.diff @@ -0,0 +1,24 @@ +# DP: Ignore errors in the profile task. + +Index: b/Makefile.pre.in +=================================================================== +--- a/Makefile.pre.in ++++ b/Makefile.pre.in +@@ -483,7 +483,16 @@ build_all_generate_profile: + + run_profile_task: + : # FIXME: can't run for a cross build +- $(RUNSHARED) ./$(BUILDPYTHON) $(PROFILE_TASK) ++ task="$(PROFILE_TASK)"; \ ++ case "$$task" in \ ++ *-s\ *) \ ++ $(RUNSHARED) ./$(BUILDPYTHON) $$task; \ ++ while [ -f $(srcdir)/build/pynexttest ]; do \ ++ $(RUNSHARED) ./$(BUILDPYTHON) $$task; \ ++ done;; \ ++ *) \ ++ $(RUNSHARED) ./$(BUILDPYTHON) $$task; \ ++ esac + + build_all_use_profile: + $(MAKE) all CFLAGS="$(CFLAGS) -fprofile-use -fprofile-correction" --- python3.4-3.4.2~rc1.orig/debian/patches/revert-r83234.diff +++ python3.4-3.4.2~rc1/debian/patches/revert-r83234.diff @@ -0,0 +1,227 @@ +--- a/Doc/conf.py ++++ b/Doc/conf.py +@@ -13,7 +13,7 @@ + # --------------------- + + extensions = ['sphinx.ext.refcounting', 'sphinx.ext.coverage', +- 'sphinx.ext.doctest', 'pyspecific'] ++ 'sphinx.ext.doctest'] + templates_path = ['tools/sphinxext'] + + # General substitutions. +--- a/Doc/tools/sphinxext/pyspecific.py ++++ b/Doc/tools/sphinxext/pyspecific.py +@@ -84,32 +84,6 @@ + return [pnode] + + +-# Support for documenting decorators +- +-from sphinx import addnodes +-from sphinx.domains.python import PyModulelevel, PyClassmember +- +-class PyDecoratorMixin(object): +- def handle_signature(self, sig, signode): +- ret = super(PyDecoratorMixin, self).handle_signature(sig, signode) +- signode.insert(0, addnodes.desc_addname('@', '@')) +- return ret +- +- def needs_arglist(self): +- return False +- +-class PyDecoratorFunction(PyDecoratorMixin, PyModulelevel): +- def run(self): +- # a decorator function is a function after all +- self.name = 'py:function' +- return PyModulelevel.run(self) +- +-class PyDecoratorMethod(PyDecoratorMixin, PyClassmember): +- def run(self): +- self.name = 'py:method' +- return PyClassmember.run(self) +- +- + # Support for documenting version of removal in deprecations + + from sphinx.locale import versionlabels +@@ -227,6 +201,7 @@ + # Support for documenting Opcodes + + import re ++from sphinx import addnodes + + opcode_sig_re = re.compile(r'(\w+(?:\+\d)?)(?:\s*$(.*)$)?') + +@@ -280,5 +255,3 @@ + app.add_description_unit('pdbcommand', 'pdbcmd', '%s (pdb command)', + parse_pdb_command) + app.add_description_unit('2to3fixer', '2to3fixer', '%s (2to3 fixer)') +- app.add_directive_to_domain('py', 'decorator', PyDecoratorFunction) +- app.add_directive_to_domain('py', 'decoratormethod', PyDecoratorMethod) +--- a/Doc/library/contextlib.rst ++++ b/Doc/library/contextlib.rst +@@ -15,7 +15,7 @@ + Functions provided: + + +-.. decorator:: contextmanager ++.. function:: contextmanager(func) + + This function is a :term:`decorator` that can be used to define a factory + function for :keyword:`with` statement context managers, without needing to +--- a/Doc/library/abc.rst ++++ b/Doc/library/abc.rst +@@ -126,7 +126,7 @@ + + It also provides the following decorators: + +-.. decorator:: abstractmethod(function) ++.. function:: abstractmethod(function) + + A decorator indicating abstract methods. + +--- a/Doc/library/unittest.rst ++++ b/Doc/library/unittest.rst +@@ -666,20 +666,20 @@ + + The following decorators implement test skipping and expected failures: + +-.. decorator:: skip(reason) ++.. function:: skip(reason) + + Unconditionally skip the decorated test. *reason* should describe why the + test is being skipped. + +-.. decorator:: skipIf(condition, reason) ++.. function:: skipIf(condition, reason) + + Skip the decorated test if *condition* is true. + +-.. decorator:: skipUnless(condition, reason) ++.. function:: skipUnless(condition, reason) + + Skip the decorated test unless *condition* is true. + +-.. decorator:: expectedFailure ++.. function:: expectedFailure + + Mark the test as an expected failure. If the test fails when run, the test + is not counted as a failure. +@@ -973,11 +973,11 @@ + :attr:`exception` attribute. This can be useful if the intention + is to perform additional checks on the exception raised:: + +- with self.assertRaises(SomeException) as cm: +- do_something() ++ with self.assertRaises(SomeException) as cm: ++ do_something() + +- the_exception = cm.exception +- self.assertEqual(the_exception.error_code, 3) ++ the_exception = cm.exception ++ self.assertEqual(the_exception.error_code, 3) + + .. versionchanged:: 3.1 + Added the ability to use :meth:`assertRaises` as a context manager. +--- a/Doc/library/importlib.rst ++++ b/Doc/library/importlib.rst +@@ -469,7 +469,7 @@ + This module contains the various objects that help in the construction of + an :term:`importer`. + +-.. decorator:: module_for_loader ++.. function:: module_for_loader(method) + + A :term:`decorator` for a :term:`loader` method, + to handle selecting the proper +@@ -494,7 +494,7 @@ + Use of this decorator handles all the details of which module object a + loader should initialize as specified by :pep:`302`. + +-.. decorator:: set_loader ++.. function:: set_loader(fxn) + + A :term:`decorator` for a :term:`loader` method, + to set the :attr:`__loader__` +@@ -502,7 +502,7 @@ + does nothing. It is assumed that the first positional argument to the + wrapped method is what :attr:`__loader__` should be set to. + +-.. decorator:: set_package ++.. function:: set_package(fxn) + + A :term:`decorator` for a :term:`loader` to set the :attr:`__package__` + attribute on the module returned by the loader. If :attr:`__package__` is +--- a/Doc/library/functools.rst ++++ b/Doc/library/functools.rst +@@ -111,7 +111,7 @@ + + .. versionadded:: 3.2 + +-.. decorator:: total_ordering ++.. function:: total_ordering(cls) + + Given a class defining one or more rich comparison ordering methods, this + class decorator supplies the rest. This simplifies the effort involved +@@ -217,7 +217,7 @@ + Missing attributes no longer trigger an :exc:`AttributeError`. + + +-.. decorator:: wraps(wrapped, assigned=WRAPPER_ASSIGNMENTS, updated=WRAPPER_UPDATES) ++.. function:: wraps(wrapped, assigned=WRAPPER_ASSIGNMENTS, updated=WRAPPER_UPDATES) + + This is a convenience function for invoking ``partial(update_wrapper, + wrapped=wrapped, assigned=assigned, updated=updated)`` as a function decorator +--- a/Doc/documenting/markup.rst ++++ b/Doc/documenting/markup.rst +@@ -177,37 +177,6 @@ + are modified), side effects, and possible exceptions. A small example may be + provided. + +-.. describe:: decorator +- +- Describes a decorator function. The signature should *not* represent the +- signature of the actual function, but the usage as a decorator. For example, +- given the functions +- +- .. code-block:: python +- +- def removename(func): +- func.__name__ = '' +- return func +- +- def setnewname(name): +- def decorator(func): +- func.__name__ = name +- return func +- return decorator +- +- the descriptions should look like this:: +- +- .. decorator:: removename +- +- Remove name of the decorated function. +- +- .. decorator:: setnewname(name) +- +- Set name of the decorated function to *name*. +- +- There is no ``deco`` role to link to a decorator that is marked up with +- this directive; rather, use the ``:func:`` role. +- + .. describe:: class + + Describes a class. The signature can include parentheses with parameters +@@ -225,12 +194,6 @@ + parameter. The description should include similar information to that + described for ``function``. + +-.. describe:: decoratormethod +- +- Same as ``decorator``, but for decorators that are methods. +- +- Refer to a decorator method using the ``:meth:`` role. +- + .. describe:: opcode + + Describes a Python :term:`bytecode` instruction. --- python3.4-3.4.2~rc1.orig/debian/patches/revert-r83274.diff +++ python3.4-3.4.2~rc1/debian/patches/revert-r83274.diff @@ -0,0 +1,12 @@ +--- a/Doc/conf.py ++++ b/Doc/conf.py +@@ -65,9 +65,6 @@ + # Options for HTML output + # ----------------------- + +-html_theme = 'default' +-html_theme_options = {'collapsiblesidebar': True} +- + # If not '', a 'Last updated on:' timestamp is inserted at every page bottom, + # using the given strftime format. + html_last_updated_fmt = '%b %d, %Y' --- python3.4-3.4.2~rc1.orig/debian/patches/series.in +++ python3.4-3.4.2~rc1/debian/patches/series.in @@ -0,0 +1,46 @@ +hg-updates.diff +deb-setup.diff +deb-locations.diff +site-locations.diff +distutils-install-layout.diff +locale-module.diff +distutils-link.diff +distutils-sysconfig.diff +tkinter-import.diff +gdbm-import.diff +link-opt.diff +setup-modules.diff +platform-lsbrelease.diff +bdist-wininst-notfound.diff +no-zip-on-sys.path.diff +profiled-build.diff +makesetup-bashism.diff +hurd-disable-nonworking-constants.diff +enable-fpectl.diff +#if defined (Ubuntu) +langpack-gettext.diff +#endif +#if defined (arch_os_hurd) +no-large-file-support.diff +#endif +#ifdef OLD_SPHINX +doc-build.diff +revert-r83234.diff +revert-r83274.diff +#endif +disable-sem-check.diff +lib-argparse.diff +ctypes-arm.diff +link-timemodule.diff +lto-link-flags.diff +libffi-shared.diff +multiarch.diff +distutils-init.diff +lib2to3-no-pickled-grammar.diff +ext-no-libpython-link.diff +test-no-random-order.diff +multiarch-extname.diff +tempfile-minimal.diff +disable-some-tests.diff +issue21264.diff +ensurepip-wheels.diff --- python3.4-3.4.2~rc1.orig/debian/patches/setup-modules.diff +++ python3.4-3.4.2~rc1/debian/patches/setup-modules.diff @@ -0,0 +1,52 @@ +# DP: Modules/Setup.dist: patches to build some extensions statically + +Index: b/Modules/Setup.dist +=================================================================== +--- a/Modules/Setup.dist ++++ b/Modules/Setup.dist +@@ -175,7 +175,7 @@ + #_weakref _weakref.c # basic weak reference support + #_testcapi _testcapimodule.c # Python C API test module + #_random _randommodule.c # Random number generator +-#_elementtree -I$(srcdir)/Modules/expat -DHAVE_EXPAT_CONFIG_H -DUSE_PYEXPAT_CAPI _elementtree.c # elementtree accelerator ++#_elementtree _elementtree.c -lexpat # elementtree accelerator + #_pickle _pickle.c # pickle accelerator + #_datetime _datetimemodule.c # datetime accelerator + #_bisect _bisectmodule.c # Bisection algorithms +@@ -204,10 +204,7 @@ + + # Socket module helper for SSL support; you must comment out the other + # socket line above, and possibly edit the SSL variable: +-#SSL=/usr/local/ssl +-#_ssl _ssl.c \ +-# -DUSE_SSL -I$(SSL)/include -I$(SSL)/include/openssl \ +-# -L$(SSL)/lib -lssl -lcrypto ++#_ssl _ssl.c -lssl -lcrypto + + # The crypt module is now disabled by default because it breaks builds + # on many systems (where -lcrypt is needed), e.g. Linux (I believe). +@@ -249,6 +246,7 @@ + #_sha256 sha256module.c + #_sha512 sha512module.c + ++#_hashlib _hashopenssl.c -lssl -lcrypto + + # The _tkinter module. + # +@@ -337,6 +335,7 @@ + # Fred Drake's interface to the Python parser + #parser parsermodule.c + ++#_ctypes _ctypes/_ctypes.c _ctypes/callbacks.c _ctypes/callproc.c _ctypes/stgdict.c _ctypes/cfield.c _ctypes/malloc_closure.c -lffi + + # Lee Busby's SIGFPE modules. + # The library to link fpectl with is platform specific. +@@ -371,7 +370,7 @@ + # + # More information on Expat can be found at www.libexpat.org. + # +-#pyexpat expat/xmlparse.c expat/xmlrole.c expat/xmltok.c pyexpat.c -I$(srcdir)/Modules/expat -DHAVE_EXPAT_CONFIG_H -DUSE_PYEXPAT_CAPI ++#pyexpat pyexpat.c -lexpat + + # Hye-Shik Chang's CJKCodecs + --- python3.4-3.4.2~rc1.orig/debian/patches/site-locations.diff +++ python3.4-3.4.2~rc1/debian/patches/site-locations.diff @@ -0,0 +1,51 @@ +# DP: Set site-packages/dist-packages + +Index: b/Lib/site.py +=================================================================== +--- a/Lib/site.py ++++ b/Lib/site.py +@@ -7,12 +7,18 @@ + This will append site-specific paths to the module search path. On + Unix (including Mac OSX), it starts with sys.prefix and + sys.exec_prefix (if different) and appends +-lib/python/site-packages as well as lib/site-python. ++lib/python3/dist-packages as well as lib/site-python. + On other platforms (such as Windows), it tries each of the + prefixes directly, as well as with lib/site-packages appended. The + resulting directories, if they exist, are appended to sys.path, and + also inspected for path configuration files. + ++For Debian and derivatives, this sys.path is augmented with directories ++for packages distributed within the distribution. Local addons go ++into /usr/local/lib/python/dist-packages, Debian addons ++install into /usr/lib/python3/dist-packages. ++/usr/lib/python/site-packages is not used. ++ + If a file named "pyvenv.cfg" exists one directory above sys.executable, + sys.prefix and sys.exec_prefix are set to that directory and + it is also checked for site-packages and site-python (sys.base_prefix and +@@ -304,10 +310,21 @@ + seen.add(prefix) + + if os.sep == '/': ++ if 'VIRTUAL_ENV' in os.environ or sys.base_prefix != sys.prefix: ++ sitepackages.append(os.path.join(prefix, "lib", ++ "python" + sys.version[:3], ++ "site-packages")) ++ sitepackages.append(os.path.join(prefix, "local/lib", ++ "python" + sys.version[:3], ++ "dist-packages")) ++ sitepackages.append(os.path.join(prefix, "lib", ++ "python3", ++ "dist-packages")) ++ # this one is deprecated for Debian + sitepackages.append(os.path.join(prefix, "lib", +- "python" + sys.version[:3], +- "site-packages")) +- sitepackages.append(os.path.join(prefix, "lib", "site-python")) ++ "python" + sys.version[:3], ++ "dist-packages")) ++ sitepackages.append(os.path.join(prefix, "lib", "dist-python")) + else: + sitepackages.append(prefix) + sitepackages.append(os.path.join(prefix, "lib", "site-packages")) --- python3.4-3.4.2~rc1.orig/debian/patches/sysconfig-debian-schemes.diff +++ python3.4-3.4.2~rc1/debian/patches/sysconfig-debian-schemes.diff @@ -0,0 +1,67 @@ +# DP: Add schemes 'deb_system' and 'posix_local', make the latter the default + +--- a/Lib/sysconfig.py ++++ b/Lib/sysconfig.py +@@ -32,6 +32,30 @@ + 'scripts': '{base}/bin', + 'data': '{base}', + }, ++ 'deb_system': { ++ 'stdlib': '{installed_base}/lib/python{py_version_short}', ++ 'platstdlib': '{platbase}/lib/python{py_version_short}', ++ 'purelib': '{base}/lib/python3/dist-packages', ++ 'platlib': '{platbase}/lib/python3/dist-packages', ++ 'include': ++ '{installed_base}/include/python{py_version_short}{abiflags}', ++ 'platinclude': ++ '{installed_platbase}/include/python{py_version_short}{abiflags}', ++ 'scripts': '{base}/bin', ++ 'data': '{base}', ++ }, ++ 'posix_local': { ++ 'stdlib': '{installed_base}/lib/python{py_version_short}', ++ 'platstdlib': '{platbase}/lib/python{py_version_short}', ++ 'purelib': '{base}/local/lib/python{py_version_short}/dist-packages', ++ 'platlib': '{platbase}/local/lib/python{py_version_short}/dist-packages', ++ 'include': ++ '{installed_base}/local/include/python{py_version_short}{abiflags}', ++ 'platinclude': ++ '{installed_platbase}/local/include/python{py_version_short}{abiflags}', ++ 'scripts': '{base}/local/bin', ++ 'data': '{base}', ++ }, + 'posix_home': { + 'stdlib': '{installed_base}/lib/python', + 'platstdlib': '{base}/lib/python', +@@ -162,7 +186,7 @@ + _PYTHON_BUILD = is_python_build(True) + + if _PYTHON_BUILD: +- for scheme in ('posix_prefix', 'posix_home'): ++ for scheme in ('posix_prefix', 'posix_home', 'posix_local', 'deb_system'): + _INSTALL_SCHEMES[scheme]['include'] = '{srcdir}/Include' + _INSTALL_SCHEMES[scheme]['platinclude'] = '{projectbase}/.' + +@@ -200,7 +224,12 @@ + def _get_default_scheme(): + if os.name == 'posix': + # the default scheme for posix is posix_prefix +- return 'posix_prefix' ++ if 'real_prefix' in sys.__dict__ or 'VIRTUAL_ENV' in os.environ: ++ # virtual environments ++ return 'posix_prefix' ++ else: ++ # Debian default ++ return 'posix_local' + return os.name + + +@@ -485,7 +514,7 @@ + else: + inc_dir = _sys_home or _PROJECT_BASE + else: +- inc_dir = get_path('platinclude') ++ inc_dir = get_path('platinclude', 'posix_prefix') + return os.path.join(inc_dir, 'pyconfig.h') + + --- python3.4-3.4.2~rc1.orig/debian/patches/sysconfigdata.diff +++ python3.4-3.4.2~rc1/debian/patches/sysconfigdata.diff @@ -0,0 +1,76 @@ +# DP: Issue #15298: Generate _sysconfigdata.py in the build dir, not the source dir. + +diff -r 2ecdda96f970 Lib/sysconfig.py +--- a/Lib/sysconfig.py Tue Jul 10 18:27:54 2012 +0200 ++++ b/Lib/sysconfig.py Tue Jul 10 22:06:43 2012 +0200 +@@ -390,7 +390,7 @@ + if _PYTHON_BUILD: + vars['LDSHARED'] = vars['BLDSHARED'] + +- destfile = os.path.join(os.path.dirname(__file__), '_sysconfigdata.py') ++ destfile = '_sysconfigdata.py' + with open(destfile, 'w', encoding='utf8') as f: + f.write('# system configuration generated and used by' + ' the sysconfig module\n') +diff -r 2ecdda96f970 Makefile.pre.in +--- a/Makefile.pre.in Tue Jul 10 18:27:54 2012 +0200 ++++ b/Makefile.pre.in Tue Jul 10 22:06:43 2012 +0200 +@@ -410,7 +410,7 @@ + Objects/unicodectype.o \ + Objects/weakrefobject.o + +-SYSCONFIGDATA=$(srcdir)/Lib/_sysconfigdata.py ++SYSCONFIGDATA=_sysconfigdata.py + + ########################################################################## + # objects that get linked into the Python library +@@ -472,6 +472,9 @@ + # Generate the sysconfig build-time data + $(SYSCONFIGDATA): $(BUILDPYTHON) + $(RUNSHARED) $(PYTHON_FOR_BUILD) -S -m sysconfig --generate-posix-vars ++ $(RUNSHARED) $(PYTHON_FOR_BUILD) -S -c 'import os,sys ; from distutils.util import get_platform ; d=os.path.join("build", "lib."+get_platform()+"-"+sys.version[0:3]+("-pydebug" if hasattr(sys, "gettotalrefcount") else "")); print(d, end="")' > pybuilddir.txt ++ mkdir -p `cat pybuilddir.txt` ++ cp $(SYSCONFIGDATA) `cat pybuilddir.txt`/. + + # Build the shared modules + sharedmods: $(BUILDPYTHON) $(SYSCONFIGDATA) +@@ -1036,7 +1039,7 @@ + else true; \ + fi; \ + done +- @for i in $(srcdir)/Lib/*.py ; \ ++ @for i in $(srcdir)/Lib/*.py $(SYSCONFIGDATA); \ + do \ + if test -x $$i; then \ + $(INSTALL_SCRIPT) $$i $(DESTDIR)$(LIBDEST); \ +diff -r 2ecdda96f970 setup.py +--- a/setup.py Tue Jul 10 18:27:54 2012 +0200 ++++ b/setup.py Tue Jul 10 22:06:43 2012 +0200 +@@ -33,10 +33,6 @@ + # This global variable is used to hold the list of modules to be disabled. + disabled_module_list = [] + +-# File which contains the directory for shared mods (for sys.path fixup +-# when running from the build dir, see Modules/getpath.c) +-_BUILDDIR_COOKIE = "pybuilddir.txt" +- + def add_dir_to_list(dirlist, dir): + """Add the directory 'dir' to the list 'dirlist' (after any relative + directories) if: +@@ -250,12 +246,9 @@ + args['compiler_so'] = compiler + ' ' + ccshared + ' ' + cflags + self.compiler.set_executables(**args) + +- # Not only do we write the builddir cookie, but we manually install +- # the shared modules directory if it isn't already in sys.path. +- # Otherwise trying to import the extensions after building them +- # will fail. +- with open(_BUILDDIR_COOKIE, "wb") as f: +- f.write(self.build_lib.encode('utf-8', 'surrogateescape')) ++ # We manually install the shared modules directory if it isn't ++ # already in sys.path. Otherwise trying to import the ++ # extensions after building them will fail. + abs_build_lib = os.path.join(os.getcwd(), self.build_lib) + if abs_build_lib not in sys.path: + sys.path.append(abs_build_lib) + --- python3.4-3.4.2~rc1.orig/debian/patches/tempfile-minimal.diff +++ python3.4-3.4.2~rc1/debian/patches/tempfile-minimal.diff @@ -0,0 +1,169 @@ +# DP: Avoid shutil import when it is not available. + +Index: b/Lib/tempfile.py +=================================================================== +--- a/Lib/tempfile.py ++++ b/Lib/tempfile.py +@@ -31,7 +31,146 @@ import functools as _functools + import warnings as _warnings + import io as _io + import os as _os +-import shutil as _shutil ++try: ++ import shutil as _shutil ++ _rmtree = _shutil.rmtree ++except ImportError: ++ import sys as _sys ++ import stat as _stat ++ # version vulnerable to race conditions ++ def _rmtree_unsafe(path, onerror): ++ try: ++ if _os.path.islink(path): ++ # symlinks to directories are forbidden, see bug #1669 ++ raise OSError("Cannot call rmtree on a symbolic link") ++ except OSError: ++ onerror(_os.path.islink, path, _sys.exc_info()) ++ # can't continue even if onerror hook returns ++ return ++ names = [] ++ try: ++ names = _os.listdir(path) ++ except OSError: ++ onerror(_os.listdir, path, _sys.exc_info()) ++ for name in names: ++ fullname = _os.path.join(path, name) ++ try: ++ mode = _os.lstat(fullname).st_mode ++ except OSError: ++ mode = 0 ++ if _stat.S_ISDIR(mode): ++ _rmtree_unsafe(fullname, onerror) ++ else: ++ try: ++ _os.unlink(fullname) ++ except OSError: ++ onerror(_os.unlink, fullname, _sys.exc_info()) ++ try: ++ _os.rmdir(path) ++ except OSError: ++ onerror(_os.rmdir, path, _sys.exc_info()) ++ ++ # Version using fd-based APIs to protect against races ++ def _rmtree_safe_fd(topfd, path, onerror): ++ names = [] ++ try: ++ names = _os.listdir(topfd) ++ except OSError as err: ++ err.filename = path ++ onerror(_os.listdir, path, _sys.exc_info()) ++ for name in names: ++ fullname = _os.path.join(path, name) ++ try: ++ orig_st = _os.stat(name, dir_fd=topfd, follow_symlinks=False) ++ mode = orig_st.st_mode ++ except OSError: ++ mode = 0 ++ if _stat.S_ISDIR(mode): ++ try: ++ dirfd = _os.open(name, _os.O_RDONLY, dir_fd=topfd) ++ except OSError: ++ onerror(_os.open, fullname, _sys.exc_info()) ++ else: ++ try: ++ if _os.path.samestat(orig_st, _os.fstat(dirfd)): ++ _rmtree_safe_fd(dirfd, fullname, onerror) ++ try: ++ _os.rmdir(name, dir_fd=topfd) ++ except OSError: ++ onerror(_os.rmdir, fullname, _sys.exc_info()) ++ else: ++ try: ++ # This can only happen if someone replaces ++ # a directory with a symlink after the call to ++ # stat.S_ISDIR above. ++ raise OSError("Cannot call rmtree on a symbolic " ++ "link") ++ except OSError: ++ onerror(_os.path.islink, fullname, _sys.exc_info()) ++ finally: ++ _os.close(dirfd) ++ else: ++ try: ++ _os.unlink(name, dir_fd=topfd) ++ except OSError: ++ onerror(_os.unlink, fullname, _sys.exc_info()) ++ ++ _use_fd_functions = ({_os.open, _os.stat, _os.unlink, _os.rmdir} <= ++ _os.supports_dir_fd and ++ _os.listdir in _os.supports_fd and ++ _os.stat in _os.supports_follow_symlinks) ++ ++ def _rmtree(path, ignore_errors=False, onerror=None): ++ """Recursively delete a directory tree. ++ ++ If ignore_errors is set, errors are ignored; otherwise, if onerror ++ is set, it is called to handle the error with arguments (func, ++ path, exc_info) where func is platform and implementation dependent; ++ path is the argument to that function that caused it to fail; and ++ exc_info is a tuple returned by sys.exc_info(). If ignore_errors ++ is false and onerror is None, an exception is raised. ++ ++ """ ++ if ignore_errors: ++ def onerror(*args): ++ pass ++ elif onerror is None: ++ def onerror(*args): ++ raise ++ if _use_fd_functions: ++ # While the unsafe rmtree works fine on bytes, the fd based does not. ++ if isinstance(path, bytes): ++ path = _os.fsdecode(path) ++ # Note: To guard against symlink races, we use the standard ++ # lstat()/open()/fstat() trick. ++ try: ++ orig_st = _os.lstat(path) ++ except Exception: ++ onerror(_os.lstat, path, _sys.exc_info()) ++ return ++ try: ++ fd = _os.open(path, _os.O_RDONLY) ++ except Exception: ++ onerror(_os.lstat, path, _sys.exc_info()) ++ return ++ try: ++ if _os.path.samestat(orig_st, _os.fstat(fd)): ++ _rmtree_safe_fd(fd, path, onerror) ++ try: ++ _os.rmdir(path) ++ except OSError: ++ onerror(_os.rmdir, path, _sys.exc_info()) ++ else: ++ try: ++ # symlinks to directories are forbidden, see bug #1669 ++ raise OSError("Cannot call rmtree on a symbolic link") ++ except OSError: ++ onerror(_os.path.islink, path, _sys.exc_info()) ++ finally: ++ _os.close(fd) ++ else: ++ return _rmtree_unsafe(path, onerror) ++ + import errno as _errno + from random import Random as _Random + import weakref as _weakref +@@ -671,7 +810,7 @@ class TemporaryDirectory(object): + + @classmethod + def _cleanup(cls, name, warn_message): +- _shutil.rmtree(name) ++ _rmtree(name) + _warnings.warn(warn_message, ResourceWarning) + + +@@ -686,4 +825,4 @@ class TemporaryDirectory(object): + + def cleanup(self): + if self._finalizer.detach(): +- _shutil.rmtree(self.name) ++ _rmtree(self.name) --- python3.4-3.4.2~rc1.orig/debian/patches/test-no-random-order.diff +++ python3.4-3.4.2~rc1/debian/patches/test-no-random-order.diff @@ -0,0 +1,14 @@ +# DP: Don't run the test suite in random order. + +Index: b/Tools/scripts/run_tests.py +=================================================================== +--- a/Tools/scripts/run_tests.py ++++ b/Tools/scripts/run_tests.py +@@ -39,7 +39,6 @@ def main(regrtest_args): + args.extend(['-W', 'error::BytesWarning']) + + args.extend(['-m', 'test', # Run the test suite +- '-r', # Randomize test order + '-w', # Re-run failed tests in verbose mode + ]) + if sys.platform == 'win32': --- python3.4-3.4.2~rc1.orig/debian/patches/tkinter-import.diff +++ python3.4-3.4.2~rc1/debian/patches/tkinter-import.diff @@ -0,0 +1,18 @@ +# DP: suggest installation of python-tk package on failing _tkinter import + +Index: b/Lib/tkinter/__init__.py +=================================================================== +--- a/Lib/tkinter/__init__.py ++++ b/Lib/tkinter/__init__.py +@@ -35,7 +35,10 @@ + # Attempt to configure Tcl/Tk without requiring PATH + from tkinter import _fix + +-import _tkinter # If this fails your Python may not be configured for Tk ++try: ++ import _tkinter ++except ImportError as msg: ++ raise ImportError(str(msg) + ', please install the python3-tk package') + TclError = _tkinter.TclError + from tkinter.constants import * + import re --- python3.4-3.4.2~rc1.orig/debian/pdb.1.in +++ python3.4-3.4.2~rc1/debian/pdb.1.in @@ -0,0 +1,16 @@ +.TH PDB@VER@ 1 +.SH NAME +pdb@VER@ \- the Python debugger +.SH SYNOPSIS +.PP +.B pdb@VER@ +.I script [...] +.SH DESCRIPTION +.PP +See /usr/lib/python@VER@/pdb.doc for more information on the use +of pdb. When the debugger is started, help is available via the +help command. +.SH SEE ALSO +python@VER@(1). Chapter 9 of the Python Library Reference +(The Python Debugger). Available in the python@VER@-doc package at +/usr/share/doc/python@VER@/html/lib/module-pdb.html. --- python3.4-3.4.2~rc1.orig/debian/pydoc.1.in +++ python3.4-3.4.2~rc1/debian/pydoc.1.in @@ -0,0 +1,53 @@ +.TH PYDOC@VER@ 1 +.SH NAME +pydoc@VER@ \- the Python documentation tool +.SH SYNOPSIS +.PP +.B pydoc@VER@ +.I name +.PP +.B pydoc@VER@ -k +.I keyword +.PP +.B pydoc@VER@ -p +.I port +.PP +.B pydoc@VER@ -g +.PP +.B pydoc@VER@ -w +.I module [...] +.SH DESCRIPTION +.PP +.B pydoc@VER@ +.I name +Show text documentation on something. +.I name +may be the name of a +Python keyword, topic, function, module, or package, or a dotted +reference to a class or function within a module or module in a +package. If +.I name +contains a '/', it is used as the path to a +Python source file to document. If name is 'keywords', 'topics', +or 'modules', a listing of these things is displayed. +.PP +.B pydoc@VER@ -k +.I keyword +Search for a keyword in the synopsis lines of all available modules. +.PP +.B pydoc@VER@ -p +.I port +Start an HTTP server on the given port on the local machine. +.PP +.B pydoc@VER@ -g +Pop up a graphical interface for finding and serving documentation. +.PP +.B pydoc@VER@ -w +.I name [...] +Write out the HTML documentation for a module to a file in the current +directory. If +.I name +contains a '/', it is treated as a filename; if +it names a directory, documentation is written for all the contents. +.SH AUTHOR +Moshe Zadka, based on "pydoc --help" --- python3.4-3.4.2~rc1.orig/debian/pygettext.1 +++ python3.4-3.4.2~rc1/debian/pygettext.1 @@ -0,0 +1,108 @@ +.TH PYGETTEXT 1 "" "pygettext 1.4" +.SH NAME +pygettext \- Python equivalent of xgettext(1) +.SH SYNOPSIS +.B pygettext +[\fIOPTIONS\fR] \fIINPUTFILE \fR... +.SH DESCRIPTION +pygettext is deprecated. The current version of xgettext supports +many languages, including Python. + +pygettext uses Python's standard tokenize module to scan Python +source code, generating .pot files identical to what GNU xgettext generates +for C and C++ code. From there, the standard GNU tools can be used. +.PP +pygettext searches only for _() by default, even though GNU xgettext +recognizes the following keywords: gettext, dgettext, dcgettext, +and gettext_noop. See the \fB\-k\fR/\fB\--keyword\fR flag below for how to +augment this. +.PP +.SH OPTIONS +.TP +\fB\-a\fR, \fB\-\-extract\-all\fR +Extract all strings. +.TP +\fB\-d\fR, \fB\-\-default\-domain\fR=\fINAME\fR +Rename the default output file from messages.pot to name.pot. +.TP +\fB\-E\fR, \fB\-\-escape\fR +Replace non-ASCII characters with octal escape sequences. +.TP +\fB\-D\fR, \fB\-\-docstrings\fR +Extract module, class, method, and function docstrings. +These do not need to be wrapped in _() markers, and in fact cannot +be for Python to consider them docstrings. (See also the \fB\-X\fR option). +.TP +\fB\-h\fR, \fB\-\-help\fR +Print this help message and exit. +.TP +\fB\-k\fR, \fB\-\-keyword\fR=\fIWORD\fR +Keywords to look for in addition to the default set, which are: _ +.IP +You can have multiple \fB\-k\fR flags on the command line. +.TP +\fB\-K\fR, \fB\-\-no\-default\-keywords\fR +Disable the default set of keywords (see above). +Any keywords explicitly added with the \fB\-k\fR/\fB\--keyword\fR option +are still recognized. +.TP +\fB\-\-no\-location\fR +Do not write filename/lineno location comments. +.TP +\fB\-n\fR, \fB\-\-add\-location\fR +Write filename/lineno location comments indicating where each +extracted string is found in the source. These lines appear before +each msgid. The style of comments is controlled by the +\fB\-S\fR/\fB\--style\fR option. This is the default. +.TP +\fB\-o\fR, \fB\-\-output\fR=\fIFILENAME\fR +Rename the default output file from messages.pot to FILENAME. +If FILENAME is `-' then the output is sent to standard out. +.TP +\fB\-p\fR, \fB\-\-output\-dir\fR=\fIDIR\fR +Output files will be placed in directory DIR. +.TP +\fB\-S\fR, \fB\-\-style\fR=\fISTYLENAME\fR +Specify which style to use for location comments. +Two styles are supported: +.RS +.IP \(bu 4 +Solaris # File: filename, line: line-number +.IP \(bu 4 +GNU #: filename:line +.RE +.IP +The style name is case insensitive. +GNU style is the default. +.TP +\fB\-v\fR, \fB\-\-verbose\fR +Print the names of the files being processed. +.TP +\fB\-V\fR, \fB\-\-version\fR +Print the version of pygettext and exit. +.TP +\fB\-w\fR, \fB\-\-width\fR=\fICOLUMNS\fR +Set width of output to columns. +.TP +\fB\-x\fR, \fB\-\-exclude\-file\fR=\fIFILENAME\fR +Specify a file that contains a list of strings that are not be +extracted from the input files. Each string to be excluded must +appear on a line by itself in the file. +.TP +\fB\-X\fR, \fB\-\-no\-docstrings\fR=\fIFILENAME\fR +Specify a file that contains a list of files (one per line) that +should not have their docstrings extracted. This is only useful in +conjunction with the \fB\-D\fR option above. +.PP +If `INPUTFILE' is -, standard input is read. +.SH BUGS +pygettext attempts to be option and feature compatible with GNU xgettext +where ever possible. However some options are still missing or are not fully +implemented. Also, xgettext's use of command line switches with option +arguments is broken, and in these cases, pygettext just defines additional +switches. +.SH AUTHOR +pygettext is written by Barry Warsaw . +.PP +Joonas Paalasmaa put this manual page together +based on "pygettext --help". --- python3.4-3.4.2~rc1.orig/debian/pyhtml2devhelp.py +++ python3.4-3.4.2~rc1/debian/pyhtml2devhelp.py @@ -0,0 +1,273 @@ +#! /usr/bin/python3 + +from html.parser import HTMLParser +import formatter +import os, sys, re + +class PyHTMLParser(HTMLParser): + pages_to_include = set(('whatsnew/index.html', 'tutorial/index.html', 'using/index.html', + 'reference/index.html', 'library/index.html', 'howto/index.html', + 'extending/index.html', 'c-api/index.html', 'install/index.html', + 'distutils/index.html')) + + def __init__(self, formatter, basedir, fn, indent, parents=set()): + HTMLParser.__init__(self, formatter) + self.basedir = basedir + self.dir, self.fn = os.path.split(fn) + self.data = '' + self.parents = parents + self.link = {} + self.indent = indent + self.last_indent = indent - 1 + self.sub_indent = 0 + self.sub_count = 0 + self.next_link = False + + def process_link(self): + new_href = os.path.join(self.dir, self.link['href']) + text = self.link['text'] + indent = self.indent + self.sub_indent + if self.last_indent == indent: + print('%s' % (' ' * self.last_indent)) + self.sub_count -= 1 + print('%s_{' % (' ' * indent, new_href, text))
+ self.sub_count += 1
+ self.last_indent = self.indent + self.sub_indent
+
+ def handle_starttag(self, tag, attrs):
+ if tag == 'a':
+ self.start_a(attrs)
+ elif tag == 'li':
+ self.start_li(attrs)
+
+ def handle_endtag(self, tag):
+ if tag == 'a':
+ self.end_a()
+ elif tag == 'li':
+ self.end_li()
+
+ def start_li(self, attrs):
+ self.sub_indent += 1
+ self.next_link = True
+
+ def end_li(self):
+ indent = self.indent + self.sub_indent
+ if self.sub_count > 0:
+ print('%s}' % (' ' * self.last_indent)) + self.sub_count -= 1 + self.last_indent -= 1 + self.sub_indent -= 1 + + def start_a(self, attrs): + self.link = {} + for attr in attrs: + self.link[attr[0]] = attr[1] + self.data = '' + + def end_a(self): + process = False + text = self.data.replace('\t', '').replace('\n', ' ').replace('&', '&').replace('<', '<').replace('>', '>') + self.link['text'] = text + # handle a tag without href attribute + try: + href = self.link['href'] + except KeyError: + return + + abs_href = os.path.join(self.basedir, href) + if abs_href in self.parents: + return + if href.startswith('..') or href.startswith('http:') \ + or href.startswith('mailto:') or href.startswith('news:'): + return + if href in ('', 'about.html', 'modindex.html', 'genindex.html', 'glossary.html', + 'search.html', 'contents.html', 'download.html', 'bugs.html', + 'license.html', 'copyright.html'): + return + + if 'class' in self.link: + if self.link['class'] in ('biglink'): + process = True + if self.link['class'] in ('reference external'): + if self.next_link: + process = True + next_link = False + + if process == True: + self.process_link() + if href in self.pages_to_include: + self.parse_file(os.path.join(self.dir, href)) + + def finish(self): + if self.sub_count > 0: + print('%s' % (' ' * self.last_indent)) + + def handle_data(self, data): + self.data += data + + def parse_file(self, href): + # TODO basedir bestimmen + parent = os.path.join(self.basedir, self.fn) + self.parents.add(parent) + parser = PyHTMLParser(formatter.NullFormatter(), + self.basedir, href, self.indent + 1, + self.parents) + text = open(self.basedir + '/' + href, encoding='latin_1').read() + parser.feed(text) + parser.finish() + parser.close() + if parent in self.parents: + self.parents.remove(parent) + +class PyIdxHTMLParser(HTMLParser): + def __init__(self, formatter, basedir, fn, indent): + HTMLParser.__init__(self, formatter) + self.basedir = basedir + self.dir, self.fn = os.path.split(fn) + self.data = '' + self.link = {} + self.indent = indent + self.active = False + self.indented = False + self.nolink = False + self.header = '' + self.last_letter = 'Z' + self.last_text = '' + + def process_link(self): + new_href = os.path.join(self.dir, self.link['href']) + text = self.link['text'] + if not self.active: + return + if text.startswith('['): + return + if self.link.get('rel', None) in ('prev', 'parent', 'next', 'contents', 'index'): + return + if self.indented: + text = self.last_text + ' ' + text + else: + # Save it in case we need it again + self.last_text = re.sub(' $[\w\-\.\s]+$', '', text) + indent = self.indent + print('%s' % (' ' * indent, new_href, text)) + + def handle_starttag(self, tag, attrs): + if tag == 'a': + self.start_a(attrs) + elif tag == 'dl': + self.start_dl(attrs) + elif tag == 'dt': + self.start_dt(attrs) + elif tag == 'h2': + self.start_h2(attrs) + elif tag == 'td': + self.start_td(attrs) + elif tag == 'table': + self.start_table(attrs) + + def handle_endtag(self, tag): + if tag == 'a': + self.end_a() + elif tag == 'dl': + self.end_dl() + elif tag == 'dt': + self.end_dt() + elif tag == 'h2': + self.end_h2() + elif tag == 'td': + self.end_td() + elif tag == 'table': + self.end_table() + + def start_dl(self, attrs): + if self.last_text: + # Looks like we found the second part to a command + self.indented = True + + def end_dl(self): + self.indented = False + + def start_dt(self, attrs): + self.data = '' + self.nolink = True + + def end_dt(self): + if not self.active: + return + if self.nolink == True: + # Looks like we found the first part to a command + self.last_text = re.sub(' $[\w\-\.\s]+$', '', self.data) + self.nolink = False + + def start_h2(self, attrs): + for k, v in attrs: + if k == 'id': + self.header = v + if v == '_': + self.active = True + + def end_h2(self): + pass + + def start_td(self, attrs): + self.indented = False + self.last_text = '' + + def end_td(self): + pass + + def start_table(self, attrs): + pass + + def end_table(self): + if self.header == self.last_letter: + self.active = False + + def start_a(self, attrs): + self.nolink = False + self.link = {} + for attr in attrs: + self.link[attr[0]] = attr[1] + self.data = '' + + def end_a(self): + text = self.data.replace('\t', '').replace('\n', ' ') + text = text.replace("Whats ", "What's ") + self.link['text'] = text + # handle a tag without href attribute + try: + href = self.link['href'] + except KeyError: + return + self.process_link() + + def handle_data(self, data): + self.data += data + + def handle_entityref(self, name): + self.data += '&%s;' % name + +def main(): + base = sys.argv[1] + fn = sys.argv[2] + version = sys.argv[3] + + parser = PyHTMLParser(formatter.NullFormatter(), base, fn, indent=0) + print('') + print('' % (version, version, version)) + print('') + parser.parse_file(fn) + print('') + + print('') + + fn = 'genindex-all.html' + parser = PyIdxHTMLParser(formatter.NullFormatter(), base, fn, indent=1) + text = open(base + '/' + fn, encoding='latin_1').read() + parser.feed(text) + parser.close() + + print('') + print('') + +main() --- python3.4-3.4.2~rc1.orig/debian/pylogo.xpm +++ python3.4-3.4.2~rc1/debian/pylogo.xpm @@ -0,0 +1,351 @@ +/* XPM */ +static char * pylogo_xpm[] = { +"32 32 316 2", +" c None", +". c #8DB0CE", +"+ c #6396BF", +"@ c #4985B7", +"# c #4181B5", +"$ c #417EB2", +"% c #417EB1", +"& c #4D83B0", +"* c #6290B6", +"= c #94B2CA", +"- c #70A1C8", +"; c #3D83BC", +"> c #3881BD", +", c #387DB6", +"' c #387CB5", +") c #387BB3", +"! c #3779B0", +"~ c #3778AE", +"{ c #3776AB", +"] c #3776AA", +"^ c #3775A9", +"/ c #4A7FAC", +"( c #709FC5", +"_ c #3A83BE", +": c #5795C7", +"< c #94B9DB", +"[ c #73A4CE", +"} c #3D80B7", +"| c #387CB4", +"1 c #377AB2", +"2 c #377AB0", +"3 c #3777AC", +"4 c #3774A7", +"5 c #3773A5", +"6 c #3C73A5", +"7 c #4586BB", +"8 c #4489C1", +"9 c #A7C7E1", +"0 c #F7F9FD", +"a c #E1E9F1", +"b c #4C89BC", +"c c #3779AF", +"d c #3778AD", +"e c #3873A5", +"f c #4B7CA4", +"g c #3982BE", +"h c #4389C1", +"i c #A6C6E1", +"j c #F6F9FC", +"k c #D6E4F0", +"l c #4A88BB", +"m c #3773A6", +"n c #366F9F", +"o c #366E9D", +"p c #376E9C", +"q c #4A8BC0", +"r c #79A7CD", +"s c #548EBD", +"t c #387AB0", +"u c #3773A4", +"v c #366D9C", +"w c #387FBA", +"x c #387DB7", +"y c #387BB4", +"z c #3775A8", +"A c #366FA0", +"B c #4981AF", +"C c #427BAA", +"D c #3772A4", +"E c #376B97", +"F c #77A3C8", +"G c #4586BC", +"H c #3882BE", +"I c #3B76A7", +"J c #3B76A6", +"K c #366E9E", +"L c #376B98", +"M c #376B96", +"N c #5681A3", +"O c #F5EEB8", +"P c #FFED60", +"Q c #FFE85B", +"R c #FFE659", +"S c #FDE55F", +"T c #5592C4", +"U c #3A83BF", +"V c #3882BD", +"W c #387FB9", +"X c #3779AE", +"Y c #366F9E", +"Z c #366C98", +"` c #376A94", +" . c #5D85A7", +".. c #F5EDB7", +"+. c #FFEA5D", +"@. c #FFE75A", +"#. c #FFE354", +"$. c #FDDD56", +"%. c #669DC8", +"&. c #3885C3", +"*. c #3884C2", +"=. c #387EB8", +"-. c #387CB6", +";. c #377AB1", +">. c #3772A3", +",. c #366D9B", +"'. c #F5EBB5", +"). c #FFE557", +"!. c #FFE455", +"~. c #FFDF50", +"{. c #FFDB4C", +"]. c #FAD862", +"^. c #8EB4D2", +"/. c #3C86C1", +"(. c #3883C0", +"_. c #3882BF", +":. c #3881BC", +"<. c #3880BB", +"[. c #3775AA", +"}. c #F5EAB3", +"|. c #FFE051", +"1. c #FFDE4F", +"2. c #FFDA4A", +"3. c #FED446", +"4. c #F5DF9D", +"5. c #77A5CA", +"6. c #3885C2", +"7. c #387BB2", +"8. c #6B8EA8", +"9. c #F8E7A1", +"0. c #FFE153", +"a. c #FFDD4E", +"b. c #FFDB4B", +"c. c #FFD746", +"d. c #FFD645", +"e. c #FFD342", +"f. c #F6DB8D", +"g. c #508DBE", +"h. c #3771A3", +"i. c #376A95", +"j. c #3D6F97", +"k. c #C3CBC2", +"l. c #FBD964", +"m. c #FFDC4D", +"n. c #FFD544", +"o. c #FFD040", +"p. c #F9CF58", +"q. c #3F83BB", +"r. c #376B95", +"s. c #3A6C95", +"t. c #4E7BA0", +"u. c #91AABC", +"v. c #F6E4A3", +"w. c #FFDA4B", +"x. c #FFD646", +"y. c #FFD443", +"z. c #FFD241", +"A. c #FFCE3D", +"B. c #FFCC3B", +"C. c #FCC83E", +"D. c #3880BC", +"E. c #3C79AC", +"F. c #5F8DB4", +"G. c #7AA0C0", +"H. c #82A6C3", +"I. c #82A3BF", +"J. c #82A2BE", +"K. c #82A1BB", +"L. c #82A1B9", +"M. c #8BA4B5", +"N. c #C1C5AE", +"O. c #F2E19F", +"P. c #FDD74C", +"Q. c #FFD94A", +"R. c #FFD343", +"S. c #FFCE3E", +"T. c #FFCB39", +"U. c #FFC937", +"V. c #FEC636", +"W. c #3D79AB", +"X. c #9DB6C6", +"Y. c #D0CFA2", +"Z. c #EFE598", +"`. c #F8EE9B", +" + c #F8EB97", +".+ c #F8E996", +"++ c #F8E894", +"@+ c #FAE489", +"#+ c #FCDB64", +"$+ c #FFDA4D", +"%+ c #FFCF3E", +"&+ c #FFCB3A", +"*+ c #FFC734", +"=+ c #FFC532", +"-+ c #3F82B7", +";+ c #387EB9", +">+ c #9EB9D0", +",+ c #F2E287", +"'+ c #FDEB69", +")+ c #FEEC60", +"!+ c #FFEB5E", +"~+ c #FFE254", +"{+ c #FFE152", +"]+ c #FFD747", +"^+ c #FFC633", +"/+ c #FCC235", +"(+ c #578FBE", +"_+ c #6996BC", +":+ c #DED9A8", +"<+ c #FEEC62", +"[+ c #FFE658", +"}+ c #FFDF51", +"|+ c #FFDE50", +"1+ c #FFD03F", +"2+ c #FFCD3C", +"3+ c #FFC431", +"4+ c #FFBF2C", +"5+ c #FAC244", +"6+ c #85AACA", +"7+ c #A1BBD2", +"8+ c #F7E47C", +"9+ c #FFE456", +"0+ c #FFC735", +"a+ c #FFBC29", +"b+ c #F7D280", +"c+ c #9DBAD2", +"d+ c #3B7CB2", +"e+ c #ABC2D6", +"f+ c #FDEB7B", +"g+ c #FFC12E", +"h+ c #FDBD30", +"i+ c #F4DEA8", +"j+ c #5F91BA", +"k+ c #ABC1D4", +"l+ c #FDEE7E", +"m+ c #FFE253", +"n+ c #FFCC3C", +"o+ c #FFBA27", +"p+ c #FAC75B", +"q+ c #4A82B0", +"r+ c #3877AB", +"s+ c #3774A6", +"t+ c #AAC0D4", +"u+ c #FDEE7D", +"v+ c #FFEC5F", +"w+ c #FFE255", +"x+ c #FFD848", +"y+ c #FFD444", +"z+ c #FFCF3F", +"A+ c #FFBC2A", +"B+ c #FFBB28", +"C+ c #FDBA32", +"D+ c #447AA8", +"E+ c #4379A7", +"F+ c #FFE95C", +"G+ c #FFE558", +"H+ c #FFE355", +"I+ c #FED84B", +"J+ c #FCD149", +"K+ c #FBCE47", +"L+ c #FBCD46", +"M+ c #FBC840", +"N+ c #FBC63E", +"O+ c #FBC037", +"P+ c #FAC448", +"Q+ c #FDD44C", +"R+ c #FCD14E", +"S+ c #FFC836", +"T+ c #FFC22F", +"U+ c #FFC02D", +"V+ c #FFE052", +"W+ c #FFC636", +"X+ c #FFCF5C", +"Y+ c #FFD573", +"Z+ c #FFC33E", +"`+ c #FEBD2D", +" @ c #FFDB4D", +".@ c #FFD949", +"+@ c #FFD545", +"@@ c #FFD140", +"#@ c #FFCB48", +"$@ c #FFF7E4", +"%@ c #FFFCF6", +"&@ c #FFE09D", +"*@ c #FFBA2E", +"=@ c #FDBE2F", +"-@ c #FFD748", +";@ c #FFCA38", +">@ c #FFC844", +",@ c #FFF2D7", +"'@ c #FFF9EC", +")@ c #FFDB94", +"!@ c #FFB92D", +"~@ c #FAC54D", +"{@ c #FDD54E", +"]@ c #FFBD2D", +"^@ c #FFC858", +"/@ c #FFD174", +"(@ c #FFBF3E", +"_@ c #FCBD3C", +":@ c #FAD66A", +"<@ c #FECD3F", +"[@ c #FFC330", +"}@ c #FFBD2A", +"|@ c #FFB724", +"1@ c #FFB521", +"2@ c #FFB526", +"3@ c #FBC457", +"4@ c #F7E09E", +"5@ c #F8D781", +"6@ c #FAC349", +"7@ c #FCC134", +"8@ c #FEBE2C", +"9@ c #FBBE3F", +"0@ c #F7CF79", +"a@ c #F5D795", +" . + @ # $ % % & * = ", +" - ; > > , ' ) ! ~ { ] ^ / ", +" ( _ : < [ } | 1 2 ~ 3 4 5 5 6 ", +" 7 8 9 0 a b 2 c d 3 { 5 5 5 e f ", +" g h i j k l c ~ { { m 5 5 n o p ", +" > > q r s t c c d 4 5 u n v v v ", +" w x ' y 2 c d d z 5 u A v v v v ", +" B C 5 D v v v v E ", +" F G H H H x ' ) c c c d I J 5 K v v L M N O P Q R S ", +" T U H V V W ' ) c c X ~ 5 5 5 Y v v Z ` ` ...+.@.#.#.$. ", +" %.&.*.> w W =.-.;.c 3 { ^ 5 5 >.o v ,.E ` ` .'.).!.#.~.{.]. ", +"^./.(._.:.<., ' ) ;.X d [.5 5 >.K v ,.E ` ` ` .}.#.|.1.{.2.3.4.", +"5.6.(.H H x ' 7.c c 3 3 4 5 D K v v ,.` ` ` ` 8.9.0.a.b.c.d.e.f.", +"g._.> <.w ' ' | 2 3 { z 5 5 h.v v v i.` ` ` j.k.l.m.{.d.n.e.o.p.", +"q.> > :.-.' 1 c c c ] 5 5 >.v v ,.r.` ` s.t.u.v.{.w.x.y.z.A.B.C.", +"D.D.w -.' 1 c c c E.F.G.H.I.J.J.K.L.L.L.M.N.O.P.Q.c.R.S.B.T.U.V.", +"D.D.=.' ' 1 c c W.X.Y.Z.`.`.`.`.`. +.+++@+#+$+Q.d.R.%+B.&+*+=+=+", +"-+;+-.' ;.2 c c >+,+'+)+P P P !+Q R ~+{+1.{.]+d.y.%+B.&+^+=+=+/+", +"(+' ' ;.c X X _+:+<+P P P P !+R [+~+}+|+{.]+n.R.1+2+&+^+=+3+4+5+", +"6+' ) ! ~ { { 7+8+P P P P !+R 9+#.{+{.w.]+y.z.S.&+0+=+=+3+4+a+b+", +"c+d+7.! d 3 z e+f+P P P !+R 9+#.{+m.{.]+y.1+B.&+0+=+=+g+4+a+h+i+", +" j+c d 3 { 4 k+l+P P !+@.9+m+1.m.{.]+y.1+n+B.*+=+=+g+a+a+o+p+ ", +" q+r+{ s+m t+u+v+@.R w+{+}+{.x+d.y+z+n+B.0+=+=+g+A+a+B+C+ ", +" * D+E+E+ +.F+G+H+}+}+{.I+J+K+L+M+M+M+M+N+O+O+O+O+P+ ", +" ).).#.{+a.{.x+Q+R+ ", +" #.m+1.a.{.x+y.o.2+B.S+=+=+T+U+O+ ", +" 0.V+{.{.x+n.o.2+B.B.W+X+Y+Z+a+`+ ", +" @{..@+@n.@@B.B.S+^+#@$@%@&@*@=@ ", +" ].-@x.y.o.%+;@S+=+=+>@,@'@)@!@~@ ", +" {@z.z+2+U.=+=+=+T+]@^@/@(@_@ ", +" :@<@U.=+=+[@4+}@|@1@2@3@ ", +" 4@5@6@7@8@a+a+9@0@a@ "}; --- python3.4-3.4.2~rc1.orig/debian/pymindeps.py +++ python3.4-3.4.2~rc1/debian/pymindeps.py @@ -0,0 +1,178 @@ +#! /usr/bin/python3 + +# Matthias Klose +# Modified to only exclude module imports from a given module. + +# Copyright 2004 Toby Dickenson +# +# Permission is hereby granted, free of charge, to any person obtaining +# a copy of this software and associated documentation files (the +# "Software"), to deal in the Software without restriction, including +# without limitation the rights to use, copy, modify, merge, publish, +# distribute, sublicense, and/or sell copies of the Software, and to +# permit persons to whom the Software is furnished to do so, subject +# to the following conditions: +# +# The above copyright notice and this permission notice shall be included +# in all copies or substantial portions of the Software. +# +# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY +# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, +# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE +# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + +import os, sys, pprint +import modulefinder +import imp + +class mymf(modulefinder.ModuleFinder): + def __init__(self,*args,**kwargs): + self._depgraph = {} + self._types = {} + self._last_caller = None + modulefinder.ModuleFinder.__init__(self, *args, **kwargs) + + def import_hook(self, name, caller=None, fromlist=None, level=-1): + old_last_caller = self._last_caller + try: + self._last_caller = caller + return modulefinder.ModuleFinder.import_hook(self, name, caller, + fromlist, level) + finally: + self._last_caller = old_last_caller + + def import_module(self, partnam, fqname, parent): + m = modulefinder.ModuleFinder.import_module(self, + partnam, fqname, parent) + if m is not None and self._last_caller: + caller = self._last_caller.__name__ + if '.' in caller: + caller = caller[:caller.index('.')] + callee = m.__name__ + if '.' in callee: + callee = callee[:callee.index('.')] + #print "XXX last_caller", caller, "MOD", callee + #self._depgraph.setdefault(self._last_caller.__name__,{})[r.__name__] = 1 + #if caller in ('pdb', 'doctest') or callee in ('pdb', 'doctest'): + # print caller, "-->", callee + if caller != callee: + self._depgraph.setdefault(caller,{})[callee] = 1 + return m + + def find_module(self, name, path, parent=None): + if parent is not None: + # assert path is not None + fullname = parent.__name__+'.'+name + elif name == "__init__": + fullname = os.path.basename(path[0]) + else: + fullname = name + if self._last_caller: + caller = self._last_caller.__name__ + if fullname in excluded_imports.get(caller, []): + #self.msgout(3, "find_module -> Excluded", fullname) + raise ImportError(name) + + if fullname in self.excludes: + #self.msgout(3, "find_module -> Excluded", fullname) + raise ImportError(name) + + if path is None: + if name in sys.builtin_module_names: + return (None, None, ("", "", imp.C_BUILTIN)) + + path = self.path + return imp.find_module(name, path) + + def load_module(self, fqname, fp, pathname, file_info): + suffix, mode, type = file_info + m = modulefinder.ModuleFinder.load_module(self, fqname, + fp, pathname, file_info) + if m is not None: + self._types[m.__name__] = type + return m + + def load_package(self, fqname, pathname): + m = modulefinder.ModuleFinder.load_package(self, fqname,pathname) + if m is not None: + self._types[m.__name__] = imp.PKG_DIRECTORY + return m + +def reduce_depgraph(dg): + pass + +# guarded imports, which don't need to be included in python-minimal +excluded_imports = { + 'argparse': set(('gettext',)), + 'codecs': set(('encodings',)), + 'collections': set(('cPickle', 'pickle', 'doctest')), + 'copy': set(('reprlib',)), + #'functools': set(('_dummy_thread',)), + 'hashlib': set(('logging', '_hashlib')), + #'hashlib': set(('_hashlib', '_md5', '_sha', '_sha256','_sha512',)), + 'heapq': set(('doctest',)), + #'io': set(('_dummy_thread',)), + 'logging': set(('multiprocessing',)), + 'os': set(('nt', 'ntpath', 'os2', 'os2emxpath', 'mac', 'macpath', + 'riscos', 'riscospath', 'riscosenviron')), + 'optparse': set(('gettext',)), + 'pickle': set(('argparse', 'doctest', 'pprint')), + 'platform': set(('plistlib', 'tempfile')), + 'reprlib': set(('_dummy_thread',)), + #'socket': set(('_ssl',)), + '_sitebuiltins': set(('pydoc',)), + 'subprocess': set(('dummy_threading',)), + 'sysconfig': set(('pprint','_osx_support')), + 'tempfile': set(('_dummy_thread', 'shutil')), + } + +def main(argv): + # Parse command line + import getopt + try: + opts, args = getopt.getopt(sys.argv[1:], "dmp:qx:") + except getopt.error as msg: + print(msg) + return + + # Process options + debug = 1 + domods = 0 + addpath = [] + exclude = [] + for o, a in opts: + if o == '-d': + debug = debug + 1 + if o == '-m': + domods = 1 + if o == '-p': + addpath = addpath + a.split(os.pathsep) + if o == '-q': + debug = 0 + if o == '-x': + exclude.append(a) + + path = sys.path[:] + path = addpath + path + + if debug > 1: + print(("version:", sys.version)) + print("path:") + for item in path: + print((" ", repr(item))) + + #exclude = ['__builtin__', 'sys', 'os'] + exclude = [] + mf = mymf(path, debug, exclude) + for arg in args: + mf.run_script(arg) + + depgraph = reduce_depgraph(mf._depgraph) + + pprint.pprint({'depgraph':mf._depgraph, 'types':mf._types}) + +if __name__=='__main__': + main(sys.argv[1:]) --- python3.4-3.4.2~rc1.orig/debian/pysetup3.1 +++ python3.4-3.4.2~rc1/debian/pysetup3.1 @@ -0,0 +1,42 @@ +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.4. +.TH PYSETUP3.3 "1" "January 2012" "pysetup3.3 3.3" "User Commands" +.SH NAME +pysetup3.3 \- pysetup tool +.SH SYNOPSIS +.B pysetup +[\fIoptions\fR] \fIaction \fR[\fIaction_options\fR] +.SH DESCRIPTION +.SS "Actions:" +.IP +run: Run one or several commands +metadata: Display the metadata of a project +install: Install a project +remove: Remove a project +search: Search for a project in the indexes +list: List installed projects +graph: Display a graph +create: Create a project +generate\-setup: Generate a backward\-compatible setup.py +.PP +To get more help on an action, use: +.IP +pysetup action \fB\-\-help\fR +.SS "Global options:" +.TP +\fB\-\-verbose\fR (\fB\-v\fR) +run verbosely (default) +.TP +\fB\-\-quiet\fR (\fB\-q\fR) +run quietly (turns verbosity off) +.TP +\fB\-\-dry\-run\fR (\fB\-n\fR) +don't actually do anything +.TP +\fB\-\-help\fR (\fB\-h\fR) +show detailed help message +.TP +\fB\-\-no\-user\-cfg\fR +ignore pydistutils.cfg in your home directory +.TP +\fB\-\-version\fR +Display the version --- python3.4-3.4.2~rc1.orig/debian/python3-config.1 +++ python3.4-3.4.2~rc1/debian/python3-config.1 @@ -0,0 +1,102 @@ +.TH PYTHON\-CONFIG 1 "November 27, 2011" +.SH NAME +python\-config \- output build options for python C/C++ extensions or embedding +.SH SYNOPSIS +.BI "python\-config" +[ +.BI "\-\-prefix" +] +[ +.BI "\-\-exec\-prefix" +] +[ +.BI "\-\-includes" +] +[ +.BI "\-\-libs" +] +[ +.BI "\-\-cflags" +] +[ +.BI "\-\-ldflags" +] +[ +.BI "\-\-extension\-suffix" +] +[ +.BI "\-\-abiflags" +] +[ +.BI "\-\-help" +] +.SH DESCRIPTION +.B python\-config +helps compiling and linking programs, which embed the Python interpreter, or +extension modules that can be loaded dynamically (at run time) into +the interpreter. +.SH OPTIONS +.TP +.BI "\-\-abiflags" +print the the ABI flags as specified by PEP 3149. +.TP +.BI "\-\-cflags" +print the C compiler flags. +.TP +.BI "\-\-ldflags" +print the flags that should be passed to the linker. +.TP +.BI "\-\-includes" +similar to \fI\-\-cflags\fP but only with \-I options (path to python header files). +.TP +.BI "\-\-libs" +similar to \fI\-\-ldflags\fP but only with \-l options (used libraries). +.TP +.BI "\-\-prefix" +prints the prefix (base directory) under which python can be found. +.TP +.BI "\-\-exec\-prefix" +print the prefix used for executable program directories (such as bin, sbin, etc). +.TP +.BI "\-\-extension\-suffix" +print the extension suffix used for binary extensions. +.TP +.BI "\-\-help" +print the usage message. +.PP + +.SH EXAMPLES +To build the singe\-file c program \fIprog\fP against the python library, use +.PP +.RS +gcc $(python\-config \-\-cflags \-\-ldflags) progr.cpp \-o progr.cpp +.RE +.PP +The same in a makefile: +.PP +.RS +CFLAGS+=$(shell python\-config \-\-cflags) +.RE +.RS +LDFLAGS+=$(shell python\-config \-\-ldflags) +.RE +.RS +all: progr +.RE + +To build a dynamically loadable python module, use +.PP +.RS +gcc $(python\-config \-\-cflags \-\-ldflags) \-shared \-fPIC progr.cpp \-o progr.so +.RE + +.SH "SEE ALSO" +python (1) +.br +http://docs.python.org/extending/extending.html +.br +/usr/share/doc/python/faq/extending.html + +.SH AUTHORS +This manual page was written by Johann Felix Soden +for the Debian project (and may be used by others). --- python3.4-3.4.2~rc1.orig/debian/pyvenv3.1 +++ python3.4-3.4.2~rc1/debian/pyvenv3.1 @@ -0,0 +1,34 @@ +.\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.40.10. +.TH PYVENV-3.3 "1" "June 2012" "pyvenv-3.3 3.3" "User Commands" +.SH NAME +pyvenv-3.3 \- create virtual python environments +.SH DESCRIPTION +usage: venv [\-h] [\-\-system\-site\-packages] [\-\-symlinks] [\-\-clear] [\-\-upgrade] +.IP +ENV_DIR [ENV_DIR ...] +.PP +Creates virtual Python environments in one or more target directories. +.SS "positional arguments:" +.TP +ENV_DIR +A directory to create the environment in. +.SS "optional arguments:" +.TP +\fB\-h\fR, \fB\-\-help\fR +show this help message and exit +.TP +\fB\-\-system\-site\-packages\fR +Give the virtual environment access to the system +site\-packages dir. +.TP +\fB\-\-symlinks\fR +Attempt to symlink rather than copy. +.TP +\fB\-\-clear\fR +Delete the environment directory if it already exists. +If not specified and the directory exists, an error is +raised. +.TP +\fB\-\-upgrade\fR +Upgrade the environment directory to use this version +of Python, assuming Python has been upgraded in\-place. --- python3.4-3.4.2~rc1.orig/debian/rules +++ python3.4-3.4.2~rc1/debian/rules @@ -0,0 +1,1435 @@ +#!/usr/bin/make -f + +unexport LANG LC_ALL LC_CTYPE LC_COLLATE LC_TIME LC_NUMERIC LC_MESSAGES +unexport CFLAGS CXXFLAGS LDFLAGS CPPFLAGS + +export SHELL = /bin/bash + +# Uncomment this to turn on verbose mode. +#export DH_VERBOSE=1 + +vafilt = $(subst $(2)=,,$(filter $(2)=%,$(1))) +DPKG_VARS := $(shell dpkg-architecture) +DEB_BUILD_ARCH ?= $(call vafilt,$(DPKG_VARS),DEB_BUILD_ARCH) +DEB_BUILD_GNU_TYPE ?= $(call vafilt,$(DPKG_VARS),DEB_BUILD_GNU_TYPE) +DEB_HOST_ARCH ?= $(call vafilt,$(DPKG_VARS),DEB_HOST_ARCH) +DEB_HOST_ARCH_ENDIAN ?= $(call vafilt,$(DPKG_VARS),DEB_HOST_ARCH_ENDIAN) +DEB_HOST_ARCH_OS ?= $(call vafilt,$(DPKG_VARS),DEB_HOST_ARCH_OS) +DEB_HOST_GNU_TYPE ?= $(call vafilt,$(DPKG_VARS),DEB_HOST_GNU_TYPE) +DEB_HOST_MULTIARCH ?= $(call vafilt,$(DPKG_VARS),DEB_HOST_MULTIARCH) + +CHANGELOG_VARS := $(shell dpkg-parsechangelog | \ + sed -n 's/ /_/g;/^[^_]/s/^$[^:]*$:_$.*$/\1=\2/p') +PKGSOURCE := $(call vafilt,$(CHANGELOG_VARS),Source) +PKGVERSION := $(call vafilt,$(CHANGELOG_VARS),Version) + +on_buildd := $(shell [ -f /CurrentlyBuilding -o "$$LOGNAME" = buildd -o "$$USER" = buildd ] && echo yes) + +ifneq (,$(findstring nocheck, $(DEB_BUILD_OPTIONS))) + WITHOUT_CHECK := yes +endif +WITHOUT_BENCH := +ifneq (,$(findstring nobench, $(DEB_BUILD_OPTIONS))) + WITHOUT_BENCH := yes +endif +ifeq ($(on_buildd),yes) + ifneq (,$(filter $(DEB_HOST_ARCH), armel hppa mips mipsel mips64 mips64el s390 hurd-i386 kfreebsd-amd64 kfreebsd-i386)) + WITHOUT_CHECK := yes + endif + ifneq (,$(filter $(DEB_HOST_ARCH), armel hppa mips mipsel mips64 mips64el s390 hurd-i386 kfreebsd-amd64 kfreebsd-i386)) + WITHOUT_BENCH := yes + WITHOUT_STONE := yes + endif +endif +ifneq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + WITHOUT_BENCH := yes + WITHOUT_CHECK := yes + WITHOUT_STONE := yes +endif + +COMMA = , +ifneq (,$(filter parallel=%,$(subst $(COMMA), ,$(DEB_BUILD_OPTIONS)))) + NJOBS := -j $(subst parallel=,,$(filter parallel=%,$(subst $(COMMA), ,$(DEB_BUILD_OPTIONS)))) +endif + +distribution := $(shell lsb_release -is) +distrelease := $(shell lsb_release -cs) + +VER=3.4 +SVER=3.4.2~rc1 +NVER=3.5 +PVER=python3.4 +PRIORITY=$(shell echo $(VER) | tr -d '.')0 + +PREVVER := $(shell awk '/^python/ && NR > 1 {print substr($$2,2,length($$2)-2); exit}' debian/changelog) + +# default versions are built from the python-defaults source package +# keep the definition to adjust package priorities. +DEFAULT_VERSION = no +STATIC_PYTHON=yes + +MIN_MODS := $(shell awk '/^ / && $$2 == "module" { print $$1 }' \ + debian/PVER-minimal.README.Debian.in) +MIN_EXTS := $(shell awk '/^ / && $$2 ~ /^extension/ { print $$1 }' \ + debian/PVER-minimal.README.Debian.in) +MIN_BUILTINS := $(shell awk '/^ / && $$2 == "builtin" { print $$1 }' \ + debian/PVER-minimal.README.Debian.in) +MIN_PACKAGES := $(shell awk '/^ / && $$2 == "package" { print $$1 }' \ + debian/PVER-minimal.README.Debian.in) +MIN_ENCODINGS := $(foreach i, \ + $(filter-out \ + big5% bz2% cp932.py cp949.py cp950.py euc_% \ + gb% iso2022% johab.py shift_jis% , \ + $(shell cd Lib/encodings && echo *.py)), \ + encodings/$(i)) \ + codecs.py stringprep.py + +with_tk := no +with_interp := static +#with_interp := shared + +PY_INTERPRETER = /usr/bin/python$(VER) + +ifeq ($(DEFAULT_VERSION),yes) + PY_PRIO = standard + #PYSTDDEP = , python (>= $(VER)) +else + PY_PRIO = optional +endif +ifeq ($(distribution),Ubuntu) + PY_MINPRIO = required + PY_MINPRIO = optional + with_fpectl = yes + #with_udeb = yes +else + PY_MINPRIO = $(PY_PRIO) + with_fpectl = yes +endif +ifeq (,$(filter $(distrelease),lenny etch squeeze wheezy lucid maverick natty oneiric)) + bd_qual = :any +endif +ifeq (,$(filter $(distrelease),lenny etch squeeze wheezy lucid maverick natty oneiric)) + ma_filter = cat +else + ma_filter = grep -v '^Multi-Arch:' +endif +ifneq (,$(filter $(distrelease),sid experimental)) + bd_gcc = gcc (>= 4:4.9.1-1), +endif +ifeq (,$(filter $(distrelease),lenny etch squeeze wheezy lucid maverick natty oneiric precise quantal raring saucy trusty)) + bd_dpkgdev = dpkg-dev (>= 1.17.11), +endif + +CC=$(DEB_HOST_GNU_TYPE)-gcc +CXX=$(DEB_HOST_GNU_TYPE)-g++ + +AR=$(DEB_HOST_GNU_TYPE)-ar +RANLIB=$(DEB_HOST_GNU_TYPE)-ranlib + +DPKG_CPPFLAGS:= $(shell dpkg-buildflags --get CPPFLAGS) +DPKG_CFLAGS := $(shell dpkg-buildflags --get CFLAGS) +DPKG_LDFLAGS := $(shell dpkg-buildflags --get LDFLAGS) +OPT_CFLAGS := $(filter-out -O%,$(DPKG_CFLAGS)) # default is -O3 +DEBUG_CFLAGS := $(patsubst -O%,-O0,$(DPKG_CFLAGS)) + +# on alpha, use -O2 only, use -mieee +ifeq ($(DEB_HOST_ARCH),alpha) + OPT_CFLAGS += -mieee + DEBUG_CFLAGS += -mieee + EXTRA_OPT_FLAGS += -O2 +endif +ifeq ($(DEB_HOST_ARCH),m68k) + EXTRA_OPT_FLAGS += -O2 +endif + +ifeq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + ifeq ($(DEB_HOST_ARCH_OS),linux) + ifneq (,$(findstring $(DEB_HOST_ARCH), amd64 armel armhf i386 powerpc ppc64 ppc64el)) + with_pgo := yes + endif + endif +endif + +ifneq (,$(findstring $(DEB_HOST_ARCH), amd64 armel armhf i386 powerpc ppc64 ppc64el)) + with_lto := yes +endif + +ifneq (,$(findstring noopt, $(DEB_BUILD_OPTIONS))) + OPT_CFLAGS := $(filter-out -O%, $(OPT_CFLAGS)) + EXTRA_OPT_CFLAGS = -O0 + with_pgo = + with_lto = +endif + +ifeq ($(with_lto),yes) + LTO_CFLAGS = -g -flto -fuse-linker-plugin + with_fat_lto := $(shell dpkg --compare-versions $$($(CC) --version \ + | sed -n '/^$(CC)/s,.* ,,p') ge 4.9 && echo yes) + ifeq ($(with_fat_lto),yes) + LTO_CFLAGS += -ffat-lto-objects + endif + EXTRA_OPT_CFLAGS += $(LTO_CFLAGS) + AR=$(DEB_HOST_GNU_TYPE)-gcc-ar + RANLIB=$(DEB_HOST_GNU_TYPE)-gcc-ranlib +endif + +make_build_target = $(if $(with_pgo),profile-opt) + +buildd_static := $(CURDIR)/build-static +buildd_shared := $(CURDIR)/build-shared +buildd_debug := $(CURDIR)/build-debug +buildd_shdebug := $(CURDIR)/build-shdebug + +d := debian/tmp +scriptdir = usr/share/lib/python$(VER) +scriptdir = usr/share/python$(VER) +scriptdir = usr/lib/python$(VER) + +# package names and directories +p_base := $(PVER) +p_min := $(PVER)-minimal +p_lib := lib$(PVER) +p_tk := $(PVER)-tk +p_dev := $(PVER)-dev +p_exam := $(PVER)-examples +p_idle := idle-$(PVER) +p_doc := $(PVER)-doc +p_dbg := $(PVER)-dbg +p_udeb := $(PVER)-udeb +p_venv := $(PVER)-venv + +p_lbase := lib$(PVER)-stdlib +p_lmin := lib$(PVER)-minimal +p_ldev := lib$(PVER)-dev +p_ldbg := lib$(PVER)-dbg +p_ltst := lib$(PVER)-testsuite + +d_base := debian/$(p_base) +d_min := debian/$(p_min) +d_lib := debian/$(p_lib) +d_tk := debian/$(p_tk) +d_dev := debian/$(p_dev) +d_exam := debian/$(p_exam) +d_idle := debian/$(p_idle) +d_doc := debian/$(p_doc) +d_dbg := debian/$(p_dbg) +d_udeb := debian/$(p_udeb) +d_venv := debian/$(p_venv) + +d_lbase := debian/$(p_lbase) +d_lmin := debian/$(p_lmin) +d_ldev := debian/$(p_ldev) +d_ldbg := debian/$(p_ldbg) +d_ltst := debian/$(p_ltst) + +build-arch: stamps/stamp-build +build-indep: stamps/stamp-build-doc +build: build-arch +stamps/stamp-build: stamps/stamp-build-static stamps/stamp-mincheck \ + stamps/stamp-build-shared stamps/stamp-build-debug \ + stamps/stamp-build-shared-debug \ + stamps/stamp-check stamps/stamp-pystone stamps/stamp-pybench + touch $@ + +PROFILE_EXCLUDES = test_compiler test_distutils test_subprocess \ + test_multiprocessing test_socketserver \ + test_thread test_threaded_import test_threadedtempfile \ + test_threading test_threading_local test_threadsignals \ + test_concurrent_futures test_ctypes \ + test_dbm_dumb test_dbm_ndbm test_pydoc test_sundry \ + test_signal test_ioctl test_gdb test_ensurepip test_venv + +# FIXME: these fail in the profile build +PROFILE_EXCLUDES += \ + test_cmd_line_script test_zipimport_support + +# FIXME: update profiled-build.diff to support --next +# --next=20 +PROFILE_TASK = ../Lib/test/regrtest.py \ + -s \ + -j 1 -unone,decimal \ + -x $(sort $(TEST_EXCLUDES) $(PROFILE_EXCLUDES)) + +stamps/stamp-build-static: stamps/stamp-configure-static + dh_testdir + $(MAKE) $(NJOBS) -C $(buildd_static) \ + EXTRA_CFLAGS="$(EXTRA_OPT_CFLAGS)" \ + PROFILE_TASK='$(PROFILE_TASK)' $(make_build_target) + + : # check that things are correctly built +ifeq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + ifneq (,$(filter $(DEB_HOST_ARCH_OS), linux)) + cd $(buildd_static) && ./python -c 'from _multiprocessing import SemLock' + endif +endif + + touch stamps/stamp-build-static + +run-profile-task: + $(MAKE) -C $(buildd_static) \ + PROFILE_TASK='$(PROFILE_TASK)' run_profile_task + +stamps/stamp-build-shared: stamps/stamp-configure-shared + dh_testdir + $(MAKE) $(NJOBS) -C $(buildd_shared) \ + EXTRA_CFLAGS="$(EXTRA_OPT_CFLAGS)" + : # build a static library with PIC objects + $(MAKE) $(NJOBS) -C $(buildd_shared) \ + EXTRA_CFLAGS="$(EXTRA_OPT_CFLAGS)" \ + LIBRARY=libpython$(VER)m-pic.a libpython$(VER)m-pic.a + touch stamps/stamp-build-shared + +stamps/stamp-build-debug: stamps/stamp-configure-debug + dh_testdir + $(MAKE) $(NJOBS) -C $(buildd_debug) \ + EXTRA_CFLAGS="$(DEBUG_CFLAGS)" + touch stamps/stamp-build-debug + +stamps/stamp-build-shared-debug: stamps/stamp-configure-shared-debug + dh_testdir + : # build the shared debug library + $(MAKE) $(NJOBS) -C $(buildd_shdebug) \ + EXTRA_CFLAGS="$(DEBUG_CFLAGS)" \ + libpython$(VER)dm.so pybuilddir.txt + touch stamps/stamp-build-shared-debug + +common_configure_args = \ + --prefix=/usr \ + --enable-ipv6 \ + --enable-loadable-sqlite-extensions \ + --with-dbmliborder=bdb:gdbm \ + --with-computed-gotos \ + --without-ensurepip \ + --with-system-expat \ + --with-system-libmpdec \ + +ifneq (,$(filter $(DEB_HOST_ARCH), avr32 or1k)) + common_configure_args += --without-ffi +else + common_configure_args += --with-system-ffi +endif + +ifeq ($(with_fpectl),yes) + common_configure_args += \ + --with-fpectl +endif + +ifneq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + common_configure_args += --host=$(DEB_HOST_GNU_TYPE) --build=$(DEB_BUILD_GNU_TYPE) + config_site = ac_cv_file__dev_ptmx=yes ac_cv_file__dev_ptc=yes + ifeq (,$(filter $(DEB_HOST_ARCH),arm m68k)) + ifeq ($(DEB_HOST_ARCH_ENDIAN),little) + config_site += ac_cv_little_endian_double=yes + else + config_site += ac_cv_big_endian_double=yes + endif + endif +endif + +stamps/stamp-configure-shared: stamps/stamp-patch + rm -rf $(buildd_shared) + mkdir -p $(buildd_shared) + cd $(buildd_shared) && \ + CC="$(CC)" CXX="$(CXX)" AR="$(AR)" RANLIB="$(RANLIB)" CFLAGS="$(OPT_CFLAGS)" \ + CPPFLAGS="$(DPKG_CPPFLAGS)" LDFLAGS="$(DPKG_LDFLAGS)" \ + $(config_site) \ + ../configure \ + --enable-shared \ + $(common_configure_args) + + $(call __post_configure,$(buildd_shared)) + + @echo XXXXXXX pyconfig.h + -cat $(buildd_shared)/pyconfig.h + + touch $@ + +stamps/stamp-configure-static: stamps/stamp-patch + rm -rf $(buildd_static) + mkdir -p $(buildd_static) + cd $(buildd_static) && \ + CC="$(CC)" CXX="$(CXX)" AR="$(AR)" RANLIB="$(RANLIB)" CFLAGS="$(OPT_CFLAGS)" \ + CPPFLAGS="$(DPKG_CPPFLAGS)" LDFLAGS="$(DPKG_LDFLAGS)" \ + $(config_site) \ + ../configure \ + $(common_configure_args) + + $(call __post_configure,$(buildd_static)) + touch $@ + +stamps/stamp-configure-debug: stamps/stamp-patch + rm -rf $(buildd_debug) + mkdir -p $(buildd_debug) + cd $(buildd_debug) && \ + CC="$(CC)" CXX="$(CXX)" AR="$(AR)" RANLIB="$(RANLIB)" CFLAGS="$(DEBUG_CFLAGS)" \ + CPPFLAGS="$(DPKG_CPPFLAGS)" LDFLAGS="$(DPKG_LDFLAGS)" \ + $(config_site) \ + ../configure \ + $(common_configure_args) \ + --with-pydebug + + $(call __post_configure,$(buildd_debug)) + touch $@ + +stamps/stamp-configure-shared-debug: stamps/stamp-patch + rm -rf $(buildd_shdebug) + mkdir -p $(buildd_shdebug) + cd $(buildd_shdebug) && \ + CC="$(CC)" CXX="$(CXX)" AR="$(AR)" RANLIB="$(RANLIB)" CFLAGS="$(DEBUG_CFLAGS)" \ + CPPFLAGS="$(DPKG_CPPFLAGS)" LDFLAGS="$(DPKG_LDFLAGS)" \ + $(config_site) \ + ../configure \ + $(common_configure_args) \ + --enable-shared \ + --with-pydebug + + $(call __post_configure,$(buildd_shdebug)) + touch $@ + +define __post_configure + egrep \ + "^#($$(awk -v ORS='|' '$$2 ~ /^extension$$/ {print $$1}' debian/PVER-minimal.README.Debian.in)XX)" \ + Modules/Setup.dist \ + | sed -e 's/^#//' -e 's/-Wl,-Bdynamic//;s/-Wl,-Bstatic//' \ + >> $(1)/Modules/Setup.local + + : # unconditionally run makesetup + cd $(1) && \ + ../Modules/makesetup -c ../Modules/config.c.in -s Modules \ + Modules/Setup.config Modules/Setup.local Modules/Setup + mv $(1)/config.c $(1)/Modules/ + + : # and fix the timestamps + $(MAKE) -C $(1) Makefile Modules/config.c +endef + +stamps/stamp-mincheck: stamps/stamp-build-static debian/PVER-minimal.README.Debian.in +ifeq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + for m in $(MIN_MODS) $(MIN_PACKAGES) $(MIN_EXTS) $(MIN_BUILTINS); do \ + echo "import $$m"; \ + done > $(buildd_static)/minmods.py + cd $(buildd_static) && ./python ../debian/pymindeps.py minmods.py \ + > mindeps.txt + -if [ -x /usr/bin/dot ]; then \ + cd $(buildd_static) && ./python ../debian/depgraph.py \ + < mindeps.txt > mindeps.dot; \ + dot -Tpng -o mindeps.png mindeps.dot; \ + else true; fi + cd $(buildd_static) && ./python ../debian/mincheck.py \ + minmods.py mindeps.txt +endif + touch stamps/stamp-mincheck + +TEST_RESOURCES = all +ifeq ($(on_buildd),yes) + TEST_RESOURCES := $(TEST_RESOURCES),-network,-urlfetch +endif +TESTOPTS = -j 1 -w -u$(TEST_RESOURCES) +TEST_EXCLUDES = +TEST_EXCLUDES += test_ensurepip test_venv +ifeq ($(on_buildd),yes) + TEST_EXCLUDES += test_tcl test_codecmaps_cn test_codecmaps_hk \ + test_codecmaps_jp test_codecmaps_kr test_codecmaps_tw \ + test_normalization test_ossaudiodev +endif +ifeq (,$(wildcard /dev/dsp)) + TEST_EXCLUDES += test_linuxaudiodev test_ossaudiodev +endif +ifneq (,$(filter $(DEB_HOST_ARCH), hppa)) + TEST_EXCLUDES += test_fork1 test_multiprocessing test_socketserver test_threading test_wait3 test_wait4 test_gdb +endif +# hangs on Aarch64, see LP: #1264354 +ifneq (,$(filter $(DEB_HOST_ARCH),arm64)) + TEST_EXCLUDES += test_faulthandler +endif +ifneq (,$(filter $(DEB_HOST_ARCH), arm avr32)) + TEST_EXCLUDES += test_ctypes +endif +ifneq (,$(filter $(DEB_HOST_ARCH), arm armel avr32 m68k)) + ifeq ($(on_buildd),yes) + TEST_EXCLUDES += test_compiler + endif +endif +ifneq (,$(filter $(DEB_HOST_ARCH), sparc sparc64)) + TEST_EXCLUDES += test_gdb +endif + +# FIXME: re-enable once fixed, see #708652 +ifneq (,$(filter $(DEB_HOST_ARCH_OS), hurd)) + TEST_EXCLUDES += test_asyncore test_curses test_exceptions \ + test_faulthandler test_imaplib test_io test_logging test_mmap \ + test_random test_signal test_socket test_socketserver test_ssl \ + test_threading test_pydoc test_runpy test_telnetlib test_tk +endif + +# FIXME: re-enable once fixed, see #708653 +ifneq (,$(filter $(DEB_HOST_ARCH_OS), kfreebsd)) + TEST_EXCLUDES += test_io test_signal test_socket test_socketserver \ + test_threading test_threadsignals test_threaded_import \ + test_time test_pty test_curses +endif + +# for debug builds only +TEST_EXCLUDES += test_gdb + +ifneq (,$(TEST_EXCLUDES)) + TESTOPTS += -x $(sort $(TEST_EXCLUDES)) +endif + +ifneq (,$(wildcard /usr/bin/localedef)) + SET_LOCPATH = LOCPATH=$(CURDIR)/locales +endif + +stamps/stamp-check: +ifeq ($(WITHOUT_CHECK),yes) + echo "check run disabled for this build" > $(buildd_static)/test_results +else + : # build locales needed by the testsuite + rm -rf locales + mkdir locales + if which localedef >/dev/null 2>&1; then \ + sh debian/locale-gen; \ + fi + + @echo ========== test environment ============ + @env + @echo ======================================== + + ifeq (,$(findstring $(DEB_HOST_ARCH), alpha)) + ( \ + echo '#! /bin/sh'; \ + echo 'set -x'; \ + echo 'export $(SET_LOCPATH)'; \ + echo '$(buildd_static)/python $(CURDIR)/debian/script.py test_results '\''make test TESTOPTS="$(filter-out test_gdb,$(TESTOPTS))"'\'; \ + echo 'echo DONE'; \ + ) > $(buildd_debug)/run_tests + chmod 755 $(buildd_debug)/run_tests + @echo "BEGIN test debug" + -tmphome=$$(mktemp -d); export HOME=$$tmphome; \ + cd $(buildd_debug) && time xvfb-run -a -e xvfb-run.log ./run_tests; \ + rm -rf $$tmphome + @echo "END test debug" + endif + + ( \ + echo '#! /bin/sh'; \ + echo 'set -x'; \ + echo 'export $(SET_LOCPATH)'; \ + echo '$(buildd_static)/python $(CURDIR)/debian/script.py test_results '\''make test EXTRA_CFLAGS="$(EXTRA_OPT_CFLAGS)" TESTOPTS="$(TESTOPTS)"'\'; \ + echo 'echo DONE'; \ + ) > $(buildd_static)/run_tests + chmod 755 $(buildd_static)/run_tests + @echo "BEGIN test static" + -tmphome=$$(mktemp -d); export HOME=$$tmphome; \ + cd $(buildd_static) && time xvfb-run -a -e xvfb-run.log ./run_tests; \ + rm -rf $$tmphome + @echo "END test static" + + ( \ + echo '#! /bin/sh'; \ + echo 'set -x'; \ + echo 'export $(SET_LOCPATH)'; \ + echo '$(buildd_static)/python $(CURDIR)/debian/script.py test_results '\''make test EXTRA_CFLAGS="$(EXTRA_OPT_CFLAGS)" TESTOPTS="$(TESTOPTS)"'\'; \ + echo 'echo DONE'; \ + ) > $(buildd_shared)/run_tests + chmod 755 $(buildd_shared)/run_tests + @echo "BEGIN test shared" + -tmphome=$$(mktemp -d); export HOME=$$tmphome; \ + cd $(buildd_shared) && time xvfb-run -a -e xvfb-run.log ./run_tests; \ + rm -rf $$tmphome + @echo "END test shared" +endif + cp -p $(buildd_static)/test_results debian/ + touch stamps/stamp-check + +stamps/stamp-pystone: +ifeq ($(WITHOUT_STONE),yes) + @echo "pystone run disabled for this build" +else + @echo "BEGIN pystone static" + cd $(buildd_static) && ./python ../Lib/test/pystone.py + cd $(buildd_static) && ./python ../Lib/test/pystone.py + @echo "END pystone static" + @echo "BEGIN pystone shared" + cd $(buildd_shared) \ + && LD_LIBRARY_PATH=. ./python ../Lib/test/pystone.py + cd $(buildd_shared) \ + && LD_LIBRARY_PATH=. ./python ../Lib/test/pystone.py + @echo "END pystone shared" + @echo "BEGIN pystone debug" + cd $(buildd_debug) && ./python ../Lib/test/pystone.py + cd $(buildd_debug) && ./python ../Lib/test/pystone.py + @echo "END pystone debug" +endif + touch stamps/stamp-pystone + +stamps/stamp-pybench: + echo "pybench run disabled for this build" > $(buildd_static)/pybench.log + +#ifeq (,$(filter $(DEB_HOST_ARCH), arm armel avr32 hppa mips mipsel mips64 mips64el m68k)) + pybench_options = -C 2 -n 5 -w 4 +#endif + +stamps/stamp-pybenchx: +ifeq ($(WITHOUT_BENCH),yes) + echo "pybench run disabled for this build" > $(buildd_static)/pybench.log +else + @echo "BEGIN pybench static" + cd $(buildd_static) \ + && time ./python ../Tools/pybench/pybench.py -f run1.pybench $(pybench_options) + cd $(buildd_static) \ + && ./python ../Tools/pybench/pybench.py -f run2.pybench -c run1.pybench $(pybench_options) + @echo "END pybench static" + @echo "BEGIN pybench shared" + cd $(buildd_shared) \ + && LD_LIBRARY_PATH=. ./python ../Tools/pybench/pybench.py -f run1.pybench $(pybench_options) + cd $(buildd_shared) \ + && LD_LIBRARY_PATH=. ./python ../Tools/pybench/pybench.py -f run2.pybench -c run1.pybench $(pybench_options) + @echo "END pybench shared" + @echo "BEGIN shared/static comparision" + $(buildd_static)/python Tools/pybench/pybench.py \ + -s $(buildd_static)/run2.pybench -c $(buildd_shared)/run2.pybench \ + | tee $(buildd_static)/pybench.log + @echo "END shared/static comparision" +endif + touch stamps/stamp-pybench + +minimal-test: + rm -rf mintest + mkdir -p mintest/lib mintest/dynlib mintest/testlib mintest/all-lib + cp -p $(buildd_static)/python mintest/ + cp -p $(foreach i,$(MIN_MODS),Lib/$(i).py) \ + mintest/lib/ + cp -a $(foreach i,$(MIN_PACKAGES),Lib/$(i)) \ + mintest/lib/ + cp -p $(wildcard $(foreach i,$(MIN_EXTS),$(buildd_static)/build/lib*/$(i).*.so)) \ + mintest/dynlib/ + cp -p Lib/unittest.py mintest/lib/ + cp -pr Lib/test mintest/lib/ + cp -pr Lib mintest/all-lib + cp -p $(buildd_static)/build/lib*/*.so mintest/all-lib/ + ( \ + echo "import sys"; \ + echo "sys.path = ["; \ + echo " '$(CURDIR)/mintest/lib',"; \ + echo " '$(CURDIR)/mintest/dynlib',"; \ + echo "]"; \ + cat Lib/test/regrtest.py; \ + ) > mintest/lib/test/mintest.py + cd mintest && ./python -E -S lib/test/mintest.py \ + -x test_codecencodings_cn test_codecencodings_hk \ + test_codecencodings_jp test_codecencodings_kr \ + test_codecencodings_tw test_codecs test_multibytecodec \ + +stamps/stamp-doc-html: + dh_testdir + $(MAKE) -C Doc html + touch stamps/stamp-doc-html + +build-doc: stamps/stamp-patch stamps/stamp-build-doc +stamps/stamp-build-doc: stamps/stamp-doc-html + touch stamps/stamp-build-doc + +control-file: + sed -e "s/@PVER@/$(PVER)/g" \ + -e "s/@VER@/$(VER)/g" \ + -e "s/@PYSTDDEP@/$(PYSTDDEP)/g" \ + -e "s/@PRIO@/$(PY_PRIO)/g" \ + -e "s/@MINPRIO@/$(PY_MINPRIO)/g" \ + -e "s/@bd_qual@/$(bd_qual)/g" \ + -e "s/@bd_gcc@/$(bd_gcc)/g" \ + -e "s/@bd_dpkgdev@/$(bd_dpkgdev)/g" \ + debian/control.in \ + $(if $(with_udeb),debian/control.udeb) \ + | $(ma_filter) \ + > debian/control.tmp +ifeq ($(distribution),Ubuntu) + ifneq (,$(findstring ubuntu, $(PKGVERSION))) + m='Ubuntu Core Developers '; \ + sed -i "/^Maintainer:/s/$.*$/Maintainer: $$m\nXSBC-Original-\1/" \ + debian/control.tmp + endif +endif + [ -e debian/control ] \ + && cmp -s debian/control debian/control.tmp \ + && rm -f debian/control.tmp && exit 0; \ + mv debian/control.tmp debian/control + + + +clean: control-file + dh_testdir + dh_testroot + $(MAKE) -f debian/rules unpatch + rm -rf stamps .pc + rm -f debian/test_results + + $(MAKE) -C Doc clean + sed 's/^@/#/' Makefile.pre.in | $(MAKE) -f - srcdir=. distclean + rm -rf $(buildd_static) $(buildd_shared) $(buildd_debug) $(buildd_shdebug) + find -name '*.py[co]' | xargs -r rm -f + rm -f Lib/lib2to3/*.pickle + rm -f Lib/dist-packages + rm -rf Lib/plat-$(DEB_HOST_MULTIARCH) + rm -rf locales + rm -rf $(d)-dbg + + for f in debian/*.in; do \ + f2=`echo $$f | sed "s,PVER,$(PVER),g;s/@VER@/$(VER)/g;s,\.in$$,,"`; \ + if [ $$f2 != debian/control ] && [ $$f2 != debian/source.lintian-overrides ]; then \ + rm -f $$f2; \ + fi; \ + done + + dh_clean + +stamps/stamp-control: + : # We have to prepare the various control files + + for f in debian/*.in; do \ + f2=`echo $$f | sed "s,PVER,$(PVER),g;s/@VER@/$(VER)/g;s,\.in$$,,"`; \ + if [ $$f2 != debian/control ]; then \ + sed -e "s/@PVER@/$(PVER)/g;s/@VER@/$(VER)/g;s/@SVER@/$(SVER)/g" \ + -e "s/@PRIORITY@/$(PRIORITY)/g" \ + -e "s,@SCRIPTDIR@,/$(scriptdir),g" \ + -e "s,@INFO@,$(info_docs),g" \ + -e "s,@HOST_QUAL@,:$(DEB_HOST_ARCH),g" \ + <$$f >$$f2; \ + fi; \ + done + +2to3-man: + help2man --no-info --version-string=$(VER) --no-discard-stderr \ + --name 'Python2 to Python3 converter' \ + 2to3-$(VER) > debian/2to3-3.1 + help2man --no-info --version-string=$(VER) --no-discard-stderr \ + --name 'pysetup tool' \ + pysetup$(VER) > debian/pysetup3.1 + help2man --no-info --version-string=$(VER) --no-discard-stderr \ + --name 'create virtual python environments' \ + pyvenv-$(VER) > debian/pyvenv3.1 + +install: build-arch stamps/stamp-install +stamps/stamp-install: stamps/stamp-build control-file stamps/stamp-control + dh_testdir + dh_testroot + dh_clean -k + dh_installdirs + + : # make install into tmp and subsequently move the files into + : # their packages' directories. + install -d $(d)/usr +ifeq ($(with_interp),static) + $(MAKE) -C $(buildd_static) install prefix=$(CURDIR)/$(d)/usr + sed -e '/^OPT/s,-O3,-O2,' \ + -e 's/$(LTO_CFLAGS)//g' \ + -e 's,^RUNSHARED *=.*,RUNSHARED=,' \ + -e '/BLDLIBRARY/s/-L\. //' \ + $(buildd_shared)/$(shell cat $(buildd_shared)/pybuilddir.txt)/_sysconfigdata.py \ + > $(d)/$(scriptdir)/_sysconfigdata.py +else + $(MAKE) -C $(buildd_shared) install prefix=$(CURDIR)/$(d)/usr +endif + mkdir -p $(d)/usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)m + mv $(d)/usr/include/$(PVER)m/pyconfig.h \ + $(d)/usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)m/. + rm -f $(d)/$(scriptdir)/lib-dynload/*.py + sed -i 's/ -O3 / -O2 /g;s/$(LTO_CFLAGS)//g;s/-fprofile-use *-fprofile-correction//g' \ + $(d)/$(scriptdir)/_sysconfigdata.py + mv $(d)/$(scriptdir)/_sysconfigdata.py \ + $(d)/$(scriptdir)/plat-$(DEB_HOST_MULTIARCH)/_sysconfigdata_m.py + cp -p debian/_sysconfigdata.py $(d)/$(scriptdir)/ + + -find $(d)/usr/lib/python$(VER) -name '*_failed*.so' + find $(d)/usr/lib/python$(VER) -name '*_failed*.so' | xargs -r rm -f + + for i in $(d)/$(scriptdir)/lib-dynload/*.so; do \ + b=$$(basename $$i .cpython-34m.so); \ + d=$${b}.cpython-34m-$(DEB_HOST_MULTIARCH).so; \ + mv $$i $(d)/$(scriptdir)/lib-dynload/$$d; \ + done + + mv $(d)/usr/lib/libpython*.a $(d)/usr/lib/$(DEB_HOST_MULTIARCH)/ + + mkdir -p $(d)/usr/lib/python3 + mv $(d)/usr/lib/python$(VER)/site-packages \ + $(d)/usr/lib/python3/dist-packages + rm -f $(d)/usr/lib/python3/dist-packages/README + + : # remove files, which are not packaged + rm -rf $(d)/usr/lib/python$(VER)/ctypes/macholib + rm -f $(d)/$(scriptdir)/plat-*/regen + rm -f $(d)/$(scriptdir)/lib2to3/*.pickle + rm -f $(d)/usr/share/man/man1/python3.1 + + : # cannot build it, zlib maintainer won't provide a mingw build + find $(d) -name 'wininst*.exe' | xargs -r rm -f + + : # fix some file permissions + chmod a-x $(d)/$(scriptdir)/{runpy,fractions,lib2to3/refactor,tkinter/tix}.py + chmod a-x $(d)/$(scriptdir)/test/test_pathlib.py + +# : # move manpages to new names +# if [ -d $(d)/usr/man/man1 ]; then \ +# mkdir -p $(d)/usr/share/man +# mv $(d)/usr/man/man1/* $(d)/usr/share/man/man1/; \ +# rm -rf $(d)/usr/man/; \ +# fi + + mkdir -p $(d)/usr/share/man/man1 + cp -p Misc/python.man $(d)/usr/share/man/man1/python$(VER).1 + ln -sf python$(VER).1 $(d)/usr/share/man/man1/python$(VER)m.1 + cp -p debian/pydoc.1 $(d)/usr/share/man/man1/pydoc$(VER).1 + + : # Symlinks to /usr/bin for some tools + ln -sf ../lib/python$(VER)/pdb.py $(d)/usr/bin/pdb$(VER) + cp -p debian/pdb.1 $(d)/usr/share/man/man1/pdb$(VER).1 + cp -p debian/2to3-3.1 $(d)/usr/share/man/man1/2to3-$(VER).1 + cp -p debian/pysetup3.1 $(d)/usr/share/man/man1/pysetup$(VER).1 + cp -p debian/pyvenv3.1 $(d)/usr/share/man/man1/pyvenv-$(VER).1 + + : # versioned install only + rm -f $(d)/usr/bin/{2to3,idle3,pydoc3,pysetup3,python3,python3-config} + rm -f $(d)/usr/lib/*/pkgconfig/python3.pc + + dh_installdirs -p$(p_lib) \ + usr/lib/$(DEB_HOST_MULTIARCH) \ + $(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH) \ + usr/share/doc + : # install the shared library + cp -p $(buildd_shared)/libpython$(VER)m.so.1.0 \ + $(d_lib)/usr/lib/$(DEB_HOST_MULTIARCH)/ + dh_link -p$(p_lib) \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so.1.0 \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so.1 \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so.1 \ + /$(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so.1 \ + /$(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/libpython$(VER).so + + ln -sf $(p_base) $(d_lib)/usr/share/doc/$(p_lib) + + ln -sf libpython$(VER)m.so.1 $(d)/usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.so + +ifeq ($(with_interp),shared) + : # install the statically linked runtime + install -m755 $(buildd_static)/python $(d)/usr/bin/python$(VER)-static +endif + + cp -p Tools/i18n/pygettext.py $(d)/usr/bin/pygettext$(VER) + cp -p debian/pygettext.1 $(d)/usr/share/man/man1/pygettext$(VER).1 + + : # install the Makefile of the shared python build + sed -e '/^OPT/s,-O3,-O2,' \ + -e 's/$(LTO_CFLAGS)//g' \ + -e 's,^RUNSHARED *=.*,RUNSHARED=,' \ + -e '/BLDLIBRARY/s/-L\. //' \ + $(buildd_shared)/Makefile \ + > $(d)/$(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/Makefile + + : # Move the minimal libraries into $(p_lmin). + dh_installdirs -p$(p_lmin) \ + etc/$(PVER) \ + usr/bin \ + usr/share/man/man1 \ + $(scriptdir)/lib-dynload + -cd $(d); for i in $(MIN_EXTS); do \ + test -e $(scriptdir)/lib-dynload/$$i.*.so \ + && echo $(scriptdir)/lib-dynload/$$i.*.so; \ + done + + DH_COMPAT=2 dh_movefiles -p$(p_lmin) --sourcedir=$(d) \ + $(foreach i,$(MIN_MODS),$(scriptdir)/$(i).py) \ + $(foreach i,$(MIN_PACKAGES),$(scriptdir)/$(i)) \ + $(foreach i,$(MIN_ENCODINGS),$(scriptdir)/$(i)) \ + $(scriptdir)/site.py \ + $(scriptdir)/_sysconfigdata.py \ + $(scriptdir)/plat-$(DEB_HOST_MULTIARCH)/_sysconfigdata_m.py \ + `cd $(d); for i in $(MIN_EXTS); do \ + test -e $(scriptdir)/lib-dynload/$$i.*.so \ + && echo $(scriptdir)/lib-dynload/$$i.*.so; \ + done` + ls -l $(d_lmin)/$(scriptdir)/lib-dynload/*.so + + : # Move the binary into $(p_min). + dh_installdirs -p$(p_min) \ + usr/bin \ + usr/share/man/man1 + DH_COMPAT=2 dh_movefiles -p$(p_min) --sourcedir=$(d) \ + usr/bin/python$(VER) \ + usr/bin/python$(VER)m \ + usr/share/man/man1/python$(VER).1 \ + usr/share/man/man1/python$(VER)m.1 + + rv=0; \ + for i in $(MIN_EXTS); do \ + if [ -f $(d)/$(scriptdir)/lib-dynload/$$i.so ]; then \ + echo >&2 "extension $$i not mentioned in Setup.dist"; \ + rv=1; \ + fi; \ + done; \ + exit $$rv; + + : # Install sitecustomize.py + cp -p debian/sitecustomize.py $(d_lmin)/etc/$(PVER)/ + dh_link -p$(p_lmin) \ + /etc/$(PVER)/sitecustomize.py /$(scriptdir)/sitecustomize.py + + : # Move the static library and the header files into $(p_dev). +# mv $(d)/usr/share/include/python$(VER)/* $(d)/usr/include/python$(VER)/. +# rm -rf $(d)/usr/share/include + + cp $(d)/usr/bin/$(PVER)m-config $(d)/usr/bin/$(DEB_HOST_MULTIARCH)-$(PVER)m-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config $(d)/usr/bin/$(DEB_HOST_MULTIARCH)-$(PVER)-config + + dh_installdirs -p$(p_ldev) \ + usr/bin \ + $(scriptdir) \ + usr/include \ + usr/share/man/man1 + + DH_COMPAT=2 dh_movefiles -p$(p_ldev) --sourcedir=$(d) \ + usr/bin/$(DEB_HOST_MULTIARCH)-$(PVER)*-config \ + usr/lib/python$(VER)/config-$(VER)m-$(DEB_HOST_MULTIARCH) \ + usr/include \ + usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.{a,so} \ + usr/lib/$(DEB_HOST_MULTIARCH)/pkgconfig/python-$(VER)*.pc \ + usr/lib/python$(VER)/distutils/command/wininst-*.exe + + sed 's/@subdir@/$(PVER)m/;s/@header@/pyconfig.h/' \ + debian/multiarch.h.in > $(d_ldev)/usr/include/$(PVER)m/pyconfig.h + + sed -i '/^Cflags:/s,$$, -I$${includedir}/$(DEB_HOST_MULTIARCH)/python$(VER)m,' \ + $(d_ldev)/usr/lib/$(DEB_HOST_MULTIARCH)/pkgconfig/python-$(VER).pc + + dh_link -p$(p_ldev) \ + /usr/lib/$(PVER)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/libpython$(VER)m.a \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)m.a + + cp -p $(buildd_shared)/libpython$(VER)m-pic.a \ + $(d_ldev)/usr/lib/python$(VER)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/ + + : # symlinks for the "old" include directory name + ln -sf python$(VER)m $(d_ldev)/usr/include/python$(VER) + + dh_installdirs -p$(p_dev) \ + usr/share/doc/python$(VER) \ + usr/share/man/man1 \ + $(scriptdir) \ + $(scriptdir)/doc/html + cp -p Misc/HISTORY Misc/README.valgrind Misc/gdbinit \ + debian/README.maintainers \ + debian/test_results $(buildd_static)/pybench.log \ + $(d_dev)/usr/share/doc/python$(VER)/ + + DH_COMPAT=2 dh_movefiles -p$(p_dev) --sourcedir=$(d) \ + usr/bin/python$(VER)*-config + + : # in $(p_ldev), prefix python-config with triplets + cp -p debian/python3-config.1 \ + $(d_ldev)/usr/share/man/man1/$(DEB_HOST_MULTIARCH)-$(PVER)m-config.1 + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config.1.gz \ + $(d_ldev)/usr/share/man/man1/$(DEB_HOST_MULTIARCH)-$(PVER)-config.1.gz +ifneq ($(DEB_HOST_MULTIARCH),$(DEB_HOST_GNU_TYPE)) + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config \ + $(d_ldev)/usr/bin/$(DEB_HOST_GNU_TYPE)-$(PVER)m-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config \ + $(d_ldev)/usr/bin/$(DEB_HOST_GNU_TYPE)-$(PVER)-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config.1.gz \ + $(d_ldev)/usr/share/man/man1/$(DEB_HOST_GNU_TYPE)-$(PVER)-config.1.gz + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config.1.gz \ + $(d_ldev)/usr/share/man/man1/$(DEB_HOST_GNU_TYPE)-$(PVER)m-config.1.gz +endif + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config $(d_dev)/usr/bin/$(PVER)m-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config.1.gz $(d_dev)/usr/share/man/man1/$(PVER)m-config.1.gz + + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config $(d_dev)/usr/bin/$(PVER)-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config.1.gz $(d_dev)/usr/share/man/man1/$(PVER)-config.1.gz + +ifeq ($(with_tk),yes) + : # Move the Tkinter files into $(p_tk). + dh_installdirs -p$(p_tk) \ + $(scriptdir) \ + usr/lib/python$(VER)/lib-dynload + DH_COMPAT=2 dh_movefiles -p$(p_tk) --sourcedir=$(d) \ + usr/lib/python$(VER)/lib-dynload/_tkinter*.so +endif + + : # The test framework into $(p_lbase) + DH_COMPAT=2 dh_movefiles -p$(p_lbase) --sourcedir=$(d) \ + $(scriptdir)/test/{regrtest.py,support,__init__.py,pystone.py} + + : # The complete testsuite into $(p_lbase) + DH_COMPAT=2 dh_movefiles -p$(p_ltst) --sourcedir=$(d) \ + $(scriptdir)/test \ + $(scriptdir)/ctypes/test \ + $(scriptdir)/distutils/tests \ + $(scriptdir)/lib2to3/tests \ + $(scriptdir)/sqlite3/test \ + $(scriptdir)/idlelib/idle_test \ + $(scriptdir)/tkinter/test \ + $(scriptdir)/unittest/test + : # test_ctypes fails with test_macholib.py installed + rm -f $(d_ltst)/$(scriptdir)/ctypes/test/test_macholib.py + : # test_bdist_wininst fails, '*.exe' files are not installed + rm -f $(d_ltst)/$(scriptdir)/distutils/tests/test_bdist_wininst.py + + : # fixed upstream ... + chmod -x $(d_ltst)/$(scriptdir)/test/{test_dbm_gnu,test_dbm_ndbm}.py + + : # Move the demos and tools into $(p_exam)'s doc directory + dh_installdirs -p$(p_exam) \ + usr/share/doc/python$(VER)/examples + DH_COMPAT=2 dh_movefiles -p$(p_exam) --sourcedir=$(d) \ + $(scriptdir)/turtledemo + + cp -rp Tools/* $(d_exam)/usr/share/doc/python$(VER)/examples/ + rm -rf $(d_exam)/usr/share/doc/python$(VER)/examples/Tools/{buildbot,msi} + : # XXX: We don't need rgb.txt, we'll use our own: + rm -rf $(d_exam)/usr/share/doc/python$(VER)/examples/Tools/pynche/X + + : # IDLE + mv $(d)/usr/bin/idle$(VER) $(d)/usr/bin/idle-python$(VER) + rm -f $(d)/usr/lib/python$(VER)/idlelib/idle.bat + dh_installdirs -p$(p_idle) \ + usr/bin \ + usr/share/man/man1 + DH_COMPAT=2 dh_movefiles -p$(p_idle) --sourcedir=$(d) \ + usr/bin/idle-python$(VER) + cp -p debian/idle-$(PVER).1 $(d_idle)/usr/share/man/man1/ + + : # Replace all '#!' calls to python with $(PY_INTERPRETER) + : # and make them executable + for i in `find debian -mindepth 3 -type f ! -name '*.dpatch'`; do \ + sed '1s,#!.*python[^ ]*$.*$,#! $(PY_INTERPRETER)\1,' \ + $$i > $$i.temp; \ + if cmp --quiet $$i $$i.temp; then \ + rm -f $$i.temp; \ + else \ + mv -f $$i.temp $$i; \ + chmod 755 $$i; \ + echo "fixed interpreter: $$i"; \ + fi; \ + done + + : # Move the docs into $(p_base)'s /usr/share/doc/$(PVER) directory, + : # all other packages only have a copyright file. + dh_installdocs -p$(p_base) \ + README Misc/NEWS Misc/ACKS + ln -sf NEWS.gz $(d_base)/usr/share/doc/$(p_base)/changelog.gz + dh_installdocs --all -N$(p_base) -N$(p_dev) -N$(p_dbg) -N$(p_lib) debian/README.Debian + + : # IDLE has its own changelogs, docs... + dh_installchangelogs -p$(p_idle) Lib/idlelib/ChangeLog + dh_installdocs -p$(p_idle) Lib/idlelib/{NEWS,README,TODO,extend}.txt + + mkdir -p $(d_idle)/usr/share/applications + cp -p debian/idle.desktop \ + $(d_idle)/usr/share/applications/idle-$(PVER).desktop + + : # those packages have own README.Debian's + install -m 644 -p debian/README.$(p_base) \ + $(d_base)/usr/share/doc/$(PVER)/README.Debian + install -m 644 -p debian/README.$(p_idle) \ + $(d_idle)/usr/share/doc/$(p_idle)/README.Debian +ifeq ($(with_tk),yes) + cp -p debian/README.Tk $(d_tk)/usr/share/doc/$(p_tk)/ +endif + + : # pyvenv and ensurepip files into $(p_venv) + dh_installdirs -p$(p_venv) \ + usr/bin \ + usr/share/man/man1 \ + usr/lib/python$(VER) + dh_movefiles -p$(p_venv) \ + usr/bin/pyvenv-$(VER) \ + usr/share/man/man1/pyvenv-$(VER).1 \ + usr/lib/python$(VER)/ensurepip + + : # library files into $(p_lbase) + dh_installdirs -p$(p_lbase) \ + usr/lib + dh_movefiles -p$(p_lbase) \ + usr/lib/python$(VER) + + : # The rest goes into $(p_base) + mkdir -p $(d)/usr/lib/python3/dist-packages + (cd $(d) && tar cf - .) | (cd $(d_base) && tar xpf -) + rm -f $(d_base)/usr/bin/python + rm -f $(d_base)/usr/bin/pyvenv + + : # Install menu icon + dh_installdirs -p$(p_base) usr/share/pixmaps + cp -p debian/pylogo.xpm $(d_base)/usr/share/pixmaps/$(PVER).xpm + + : # generate binfmt file + mkdir -p $(d_min)/usr/share/binfmts +ifeq ($(DEB_HOST_GNU_TYPE),$(DEB_BUILD_GNU_TYPE)) + $(buildd_static)/python debian/mkbinfmt.py $(PVER) \ + > $(d_min)/usr/share/binfmts/$(PVER) +else + $(PVER) debian/mkbinfmt.py $(PVER) > $(d_min)/usr/share/binfmts/$(PVER) +endif + + : # desktop entry + mkdir -p $(d_base)/usr/share/applications + cp -p debian/$(PVER).desktop \ + $(d_base)/usr/share/applications/$(PVER).desktop + + : # remove some things + -find debian -name .cvsignore | xargs rm -f + -find debian -name '*.py[co]' | xargs rm -f + + : # remove empty directories, when all components are in place + -find debian ! -name lib-dynload ! -name dist-packages -type d -empty -delete + + : # install debug package + rm -rf $(d)-dbg + $(MAKE) -C $(buildd_debug) install DESTDIR=$(CURDIR)/$(d)-dbg + : # install the Makefile of the shared python debug build + sed -e '/^OPT/s,-O3,-O2,' \ + -e 's/$(LTO_CFLAGS)//g' \ + -e 's,^RUNSHARED *=.*,RUNSHARED=,' \ + -e '/BLDLIBRARY/s/-L\. //' \ + $(buildd_shdebug)/Makefile \ + > $(d)-dbg/$(scriptdir)/config-$(VER)dm-$(DEB_HOST_MULTIARCH)/Makefile + sed -e 's,^RUNSHARED *=.*,RUNSHARED=,' \ + -e '/BLDLIBRARY/s/-L\. //' \ + $(buildd_shdebug)/$(shell cat $(buildd_shdebug)/pybuilddir.txt)/_sysconfigdata.py \ + > $(d)-dbg/$(scriptdir)/_sysconfigdata.py + rm -f $(d)-dbg/$(scriptdir)/lib-dynload/_sysconfigdata.py + sed -i 's/ -O3 / -O2 /g;s/$(LTO_CFLAGS)//g;s/-fprofile-use *-fprofile-correction//g' \ + $(d)-dbg/$(scriptdir)/_sysconfigdata.py + mv $(d)-dbg/$(scriptdir)/_sysconfigdata.py \ + $(d)-dbg/$(scriptdir)/plat-$(DEB_HOST_MULTIARCH)/_sysconfigdata_dm.py + + mv $(d)-dbg/usr/lib/libpython*.a $(d)-dbg/usr/lib/$(DEB_HOST_MULTIARCH)/ + + for i in $(d)-dbg/$(scriptdir)/lib-dynload/*.so; do \ + b=$$(basename $$i .cpython-34dm.so); \ + d=$${b}.cpython-34dm-$(DEB_HOST_MULTIARCH).so; \ + mv $$i $(d)-dbg/$(scriptdir)/lib-dynload/$$d; \ + done + + dh_installdirs -p$(p_ldbg) \ + usr/bin \ + usr/share/man/man1 \ + $(scriptdir)/lib-dynload \ + $(scriptdir)/plat-$(DEB_HOST_MULTIARCH) \ + usr/include/$(PVER)dm \ + usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)dm \ + usr/lib/$(DEB_HOST_MULTIARCH)/pkgconfig + + cp -p $(d)-dbg/$(scriptdir)/lib-dynload/*.so \ + $(d_ldbg)/$(scriptdir)/lib-dynload/ + cp -p $(d)-dbg/$(scriptdir)/plat-$(DEB_HOST_MULTIARCH)/_sysconfigdata_dm.py \ + $(d_ldbg)/$(scriptdir)/plat-$(DEB_HOST_MULTIARCH)/ + cp -p $(buildd_shdebug)/libpython$(VER)dm.so.1.0 \ + $(d_ldbg)/usr/lib/$(DEB_HOST_MULTIARCH)/ + dh_link -p$(p_ldbg) \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so.1.0 \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so.1 \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so.1 \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so + sed -e '/^Libs:/s,-lpython$(VER),-lpython$(VER)dm,' \ + -e '/^Cflags:/s,$$, -I$${includedir}/$(DEB_HOST_MULTIARCH)/python$(VER)dm,' \ + $(d)-dbg/usr/lib/$(DEB_HOST_MULTIARCH)/pkgconfig/python-$(VER).pc \ + > $(d_ldbg)/usr/lib/$(DEB_HOST_MULTIARCH)/pkgconfig/python-$(VER)-dbg.pc + + dh_installdirs -p$(p_dbg) \ + usr/bin \ + usr/share/man/man1 \ + usr/share/doc/$(p_base) + cp -p Misc/SpecialBuilds.txt $(d_dbg)/usr/share/doc/$(p_base)/ + cp -p debian/$(PVER)-dbg.README.Debian \ + $(d_dbg)/usr/share/doc/$(p_base)/README.debug + cp -p $(buildd_debug)/python $(d_dbg)/usr/bin/$(PVER)dm + ln -sf python$(VER)dm $(d_dbg)/usr/bin/$(PVER)-dbg + +ifneq ($(with_tk),yes) + rm -f $(d_ldbg)/$(scriptdir)/lib-dynload/_tkinter*.so + rm -f $(d_ldbg)/usr/lib/debug/$(scriptdir)/lib-dynload/_tkinter*.so +endif +ifneq ($(with_gdbm),yes) + rm -f $(d_ldbg)/$(scriptdir)/lib-dynload/_gdbm*.so + rm -f $(d_ldbg)/usr/lib/debug/$(scriptdir)/lib-dynload/_gdbm*.so +endif + + cp -a $(d)-dbg/$(scriptdir)/config-$(VER)dm-$(DEB_HOST_MULTIARCH) \ + $(d_ldbg)/$(scriptdir)/ + dh_link -p$(p_ldbg) \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so \ + /$(scriptdir)/config-$(VER)dm-$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.so \ + /$(scriptdir)/config-$(VER)dm-$(DEB_HOST_MULTIARCH)/libpython$(VER).so \ + /$(scriptdir)/config-$(VER)dm-$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.a \ + /usr/lib/$(DEB_HOST_MULTIARCH)/libpython$(VER)dm.a + + for i in $(d_ldev)/usr/include/$(PVER)m/*; do \ + i=$$(basename $$i); \ + case $$i in pyconfig.h) continue; esac; \ + ln -sf ../$(PVER)m/$$i $(d_ldbg)/usr/include/$(PVER)dm/$$i; \ + done + cp -p $(buildd_debug)/pyconfig.h $(d_ldbg)/usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)dm/ + sed 's/@subdir@/$(PVER)dm/;s/@header@/pyconfig.h/' \ + debian/multiarch.h.in > $(d_ldbg)/usr/include/$(PVER)dm/pyconfig.h + + ln -sf $(PVER).1.gz $(d_dbg)/usr/share/man/man1/$(PVER)-dbg.1.gz + + : # in $(p_ldbg), prefix python-config with triplets + cp $(d)-dbg/usr/bin/$(PVER)dm-config \ + $(d_ldbg)/usr/bin/$(DEB_HOST_MULTIARCH)-$(PVER)dm-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config \ + $(d_ldbg)/usr/bin/$(DEB_HOST_MULTIARCH)-$(PVER)-dbg-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config.1.gz \ + $(d_ldbg)/usr/share/man/man1/$(DEB_HOST_MULTIARCH)-$(PVER)dm-config.1.gz + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)m-config.1.gz \ + $(d_ldbg)/usr/share/man/man1/$(DEB_HOST_MULTIARCH)-$(PVER)-dbg-config.1.gz +ifneq ($(DEB_HOST_MULTIARCH),$(DEB_HOST_GNU_TYPE)) + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config \ + $(d_ldbg)/usr/bin/$(DEB_HOST_GNU_TYPE)-$(PVER)dm-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-config.1.gz \ + $(d_ldbg)/usr/share/man/man1/$(DEB_HOST_GNU_TYPE)-$(PVER)dm-config.1.gz + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config \ + $(d_ldbg)/usr/bin/$(DEB_HOST_GNU_TYPE)-$(PVER)-dbg-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config.1.gz \ + $(d_ldbg)/usr/share/man/man1/$(DEB_HOST_GNU_TYPE)-$(PVER)-dbg-config.1.gz +endif + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config $(d_dbg)/usr/bin/$(PVER)dm-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)dm-config.1.gz $(d_dbg)/usr/share/man/man1/$(PVER)dm-config.1.gz + + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-dbg-config $(d_dbg)/usr/bin/$(PVER)-dbg-config + ln -sf $(DEB_HOST_MULTIARCH)-$(PVER)-dbg-config.1.gz $(d_dbg)/usr/share/man/man1/$(PVER)-dbg-config.1.gz + + : # symlinks for the "old" include / config directory names + ln -sf $(PVER)-config.1.gz $(d_dbg)/usr/share/man/man1/$(PVER)-dbg-config.1.gz + ln -sf $(PVER).1.gz $(d_dbg)/usr/share/man/man1/$(PVER)dm.1.gz + ln -sf $(PVER)-config.1.gz $(d_dbg)/usr/share/man/man1/$(PVER)dm-config.1.gz + +ifeq ($(with_udeb),yes) + : # Copy the most important files from $(p_min) into $(p_udeb). + dh_installdirs -p$(p_udeb) \ + etc/$(PVER) \ + usr/bin \ + usr/include/$(PVER)mu \ + $(scriptdir)/lib-dynload \ + $(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH) + cp -p $(d_min)/usr/bin/python$(VER) $(d_udeb)/usr/bin/ + ln -sf python$(VER)mu $(d_udeb)/usr/bin/python$(VER) + ln -sf python$(VER) $(d_udeb)/usr/bin/python3 + cp -p $(foreach i,$(MIN_MODS),$(d_min)/$(scriptdir)/$(i).py) \ + $(d_udeb)/$(scriptdir)/ + cp -a $(foreach i,$(MIN_PACKAGES),$(d_min)/$(scriptdir)/$(i)) \ + $(d_udeb)/$(scriptdir)/ + cp -p $(foreach i,$(MIN_ENCODINGS),$(d_min)/$(scriptdir)/$(i)) \ + $(d_udeb)/$(scriptdir)/ + cp -p $(d_min)/$(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/Makefile \ + $(d_udeb)/$(scriptdir)/config-$(VER)m-$(DEB_HOST_MULTIARCH)/ + cp -p $(d_min)/usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)m/pyconfig.h \ + $(d_udeb)/usr/include/$(DEB_HOST_MULTIARCH)/$(PVER)m/ + cp -p $(d_min)/$(scriptdir)/site.py $(d_udeb)/$(scriptdir)/ + cp -p debian/sitecustomize.py $(d_udeb)/etc/$(PVER)/ + dh_link -p$(p_udeb) /etc/$(PVER)/sitecustomize.py \ + /$(scriptdir)/sitecustomize.py +endif + + for i in debian/*.overrides; do \ + b=$$(basename $$i .overrides); \ + install -D -m 644 $$i debian/$$b/usr/share/lintian/overrides/$$b; \ + done + + touch stamps/stamp-install + +# Build architecture-independent files here. +binary-indep: build-indep install stamps/stamp-control + dh_testdir -i + dh_testroot -i + + : # $(p_doc) package + dh_installdirs -p$(p_doc) \ + usr/share/doc/$(p_base) \ + usr/share/doc/$(p_doc) + dh_installdocs -p$(p_doc) + cp -a Doc/build/html $(d_doc)/usr/share/doc/$(p_base)/ + rm -f $(d_doc)/usr/share/doc/$(p_base)/html/_static/jquery.js + dh_link -p$(p_doc) \ + /usr/share/doc/$(p_base)/html /usr/share/doc/$(p_doc)/html \ + /usr/share/javascript/jquery/jquery.js /usr/share/doc/$(p_base)/html/_static/jquery.js \ + /usr/share/javascript/underscore/underscore.js /usr/share/doc/$(p_base)/html/_static/underscore.js + + : # devhelp docs + cd $(buildd_static) && ./python ../debian/pyhtml2devhelp.py \ + ../$(d_doc)/usr/share/doc/$(p_base)/html index.html $(VER) \ + > ../$(d_doc)/usr/share/doc/$(p_base)/html/$(PVER).devhelp + gzip -9v $(d_doc)/usr/share/doc/$(p_base)/html/$(PVER).devhelp + dh_link -p$(p_doc) \ + /usr/share/doc/$(p_base)/html /usr/share/devhelp/books/$(PVER) + + for i in $(p_ltst); do \ + rm -rf debian/$$i/usr/share/doc/$$i; \ + ln -s $(p_base) debian/$$i/usr/share/doc/$$i; \ + done + + dh_installdebconf -i $(dh_args) + dh_installexamples -i $(dh_args) + dh_installmenu -i $(dh_args) + -dh_icons -i $(dh_args) || dh_iconcache -i $(dh_args) + dh_installchangelogs -i $(dh_args) + dh_link -i $(dh_args) + dh_compress -i $(dh_args) -X.py -X.cls -X.css -X.txt -X.json -X.js -Xobjects.inv -Xgdbinit + dh_fixperms -i $(dh_args) + + : # make python scripts starting with '#!' executable + for i in `find debian -mindepth 3 -type f ! -name '*.dpatch' ! -perm 755`; do \ + if head -1 $$i | grep -q '^#!'; then \ + chmod 755 $$i; \ + echo "make executable: $$i"; \ + fi; \ + done + -find $(d_doc) -name '*.txt' -perm 755 -exec chmod 644 {} \; + + dh_installdeb -i $(dh_args) + dh_gencontrol -i $(dh_args) + dh_md5sums -i $(dh_args) + dh_builddeb -i $(dh_args) + +# Build architecture-dependent files here. +binary-arch: build-arch install + dh_testdir -a + dh_testroot -a +# dh_installdebconf -a + dh_installexamples -a + dh_installmenu -a + -dh_icons -a || dh_iconcache -a +# dh_installmime -a + dh_installchangelogs -a + for i in $(p_dev) $(p_dbg) $(p_venv); do \ + rm -rf debian/$$i/usr/share/doc/$$i; \ + ln -s $(p_base) debian/$$i/usr/share/doc/$$i; \ + done + for i in $(p_lbase); do \ + rm -rf debian/$$i/usr/share/doc/$$i; \ + ln -s $(p_lmin) debian/$$i/usr/share/doc/$$i; \ + done + for i in $(p_ldev) $(p_ldbg) $(p_lib); do \ + rm -rf debian/$$i/usr/share/doc/$$i; \ + ln -s $(p_lbase) debian/$$i/usr/share/doc/$$i; \ + done + -find debian ! -perm -200 -print -exec chmod +w {} \; +ifneq ($(with_tk),yes) + rm -f $(d_lbase)/$(scriptdir)/lib-dynload/_tkinter*.so +endif +ifneq ($(with_gdbm),yes) + rm -f $(d_lbase)/$(scriptdir)/lib-dynload/_gdbm*.so +endif + + dh_strip -a -N$(p_dbg) -Xdebug -Xdbg --dbg-package=$(p_dbg) + cp Tools/gdb/libpython.py $(d_dbg)/usr/lib/debug/usr/bin/$(PVER)m-gdb.py + ln -sf $(PVER)m-gdb.py $(d_dbg)/usr/lib/debug/usr/bin/$(PVER)-gdb.py + ln -sf $(PVER)m-gdb.py $(d_dbg)/usr/lib/debug/usr/bin/$(PVER)dm-gdb.py + ln -sf $(PVER)m-gdb.py $(d_dbg)/usr/lib/debug/usr/bin/$(PVER)-dbg-gdb.py + ln -sf ../bin/$(PVER)m-gdb.py \ + $(d_dbg)/usr/lib/debug/usr/lib/lib$(PVER)m.so.1.0-gdb.py + ln -sf ../bin/$(PVER)m-gdb.py \ + $(d_dbg)/usr/lib/lib$(PVER)dm.so.1.0-gdb.py + dh_link -a + dh_compress -a -X.py + dh_fixperms -a + chmod 644 $(d_lmin)/$(scriptdir)/token.py + + : # make python scripts starting with '#!' executable + for i in `find debian -mindepth 3 -type f ! -name '*.dpatch' ! -perm 755`; do \ + if head -1 $$i | grep -q '^#!'; then \ + chmod 755 $$i; \ + echo "make executable: $$i"; \ + fi; \ + done + + dh_makeshlibs -p$(p_lib) -V '$(p_lib)' + dh_makeshlibs -p$(p_ldbg) -V '$(p_ldbg)' +# don't include the following symbols, found in extensions +# which either can be built as builtin or extension. + sed -ri \ + -e '/^ (PyInit_|_add_one_to_index|asdl_)/d' \ + -e '/^ (PyExpat_XML_|PyExpat_Xml)/d' \ + -e '/^ (ffi_type_|_ctypes_)/d' \ + $(d_lib)/DEBIAN/symbols $(d_ldbg)/DEBIAN/symbols + dh_installdeb -a + dh_shlibdeps -a + dep=`sed -n '/^shlibs:Depends/s/.*$libc6[^,]*$.*/\1/p' $(d_min).substvars`; \ + echo "shlibs:Pre-Depends=$$dep" >> $(d_min).substvars + sed -i '/^shlibs:Depends/s/libc6[^,]*[, ]*//' $(d_min).substvars + dh_gencontrol -a + dh_md5sums -a + dh_builddeb -a + +# rules to patch the unpacked files in the source directory +# --------------------------------------------------------------------------- +# various rules to unpack addons and (un)apply patches. +# - patch / apply-patches +# - unpatch / reverse-patches + +patchdir = debian/patches + +old_sphinx := $(shell dpkg --compare-versions $$(dpkg -l python-sphinx | awk '/^ii *python-sphinx/ {print $$3}') lt 1 && echo yes || echo no) + +$(patchdir)/series: $(patchdir)/series.in + cpp -E \ + -D$(distribution) \ + $(if $(filter $(old_sphinx),yes),-DOLD_SPHINX) \ + -Darch_os_$(DEB_HOST_ARCH_OS) -Darch_$(DEB_HOST_ARCH) \ + -o - $(patchdir)/series.in \ + | egrep -v '^(#.*|$$)' > $(patchdir)/series + +patch-stamp: stamps/stamp-patch +patch: stamps/stamp-patch +stamps/stamp-patch: $(patchdir)/series + dh_testdir + uname -a + @echo USER=$$USER, LOGNAME=$$LOGNAME + QUILT_PATCHES=$(patchdir) quilt push -a || test $$? = 2 + rm -rf autom4te.cache configure + autoconf + mkdir -p stamps + echo ""; echo "Patches applied in this version:" > stamps/pxx + for i in $$(cat $(patchdir)/series); do \ + echo ""; echo "$$i:"; \ + sed -n 's/^# *DP: */ /p' $(patchdir)/$$i; \ + done >> stamps/pxx + + touch Parser/acceler.c Parser/grammar1.c Parser/listnode.c \ + Parser/node.c Parser/parser.c Parser/bitset.c Parser/metagrammar.c \ + Parser/firstsets.c Parser/grammar.c Parser/pgen.c + touch Objects/obmalloc.c Python/dynamic_annotations.c \ + Python/mysnprintf.c Python/pyctype.c Parser/tokenizer_pgen.c \ + Parser/printgrammar.c Parser/parsetok_pgen.c Parser/pgenmain.c + @sleep 1 + touch Grammar/Grammar + @sleep 1 + touch Include/graminit.h + @sleep 1 + touch Python/graminit.c + + ln -sf site-packages Lib/dist-packages + + mv stamps/pxx $@ + +reverse-patches: unpatch +unpatch: + QUILT_PATCHES=$(patchdir) quilt pop -a -R || test $$? = 2 + rm -f stamps/stamp-patch $(patchdir)/series + rm -rf configure autom4te.cache + +update-patches: $(patchdir)/series + export QUILT_PATCHES=$(patchdir); \ + export QUILT_REFRESH_ARGS="--no-timestamps --no-index -pab"; \ + export QUILT_DIFF_ARGS="--no-timestamps --no-index -pab"; \ + while quilt push; do quilt refresh; done + +binary: binary-indep binary-arch + +.PHONY: control-file configure build clean binary-indep binary-arch binary install + +# Local Variables: +# mode: makefile +# end: --- python3.4-3.4.2~rc1.orig/debian/script.py +++ python3.4-3.4.2~rc1/debian/script.py @@ -0,0 +1,61 @@ +#! /usr/bin/python3 + +# Copyright (C) 2012 Colin Watson . +# +# Permission is hereby granted, free of charge, to any person obtaining +# a copy of this software and associated documentation files (the +# "Software"), to deal in the Software without restriction, including +# without limitation the rights to use, copy, modify, merge, publish, +# distribute, sublicense, and/or sell copies of the Software, and to +# permit persons to whom the Software is furnished to do so, subject +# to the following conditions: +# +# The above copyright notice and this permission notice shall be included +# in all copies or substantial portions of the Software. +# +# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. +# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY +# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, +# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE +# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + +"""Trivial script(1) workalike, but without reading from standard input.""" + +import os +import pty +import select +import sys + +filename = sys.argv[1] +command = sys.argv[2] + +pid, master = pty.fork() +if pid == 0: # child + os.execlp("sh", "sh", "-c", command) + +# parent +with open(filename, "wb") as logfile: + try: + while True: + rfds, _, _ = select.select([master], [], []) + if master in rfds: + data = os.read(master, 65536) + os.write(1, data) + logfile.write(data) + logfile.flush() + except (IOError, OSError): + pass + +pid, status = os.wait() +returncode = 0 +if os.WIFSIGNALED(status): + returncode = -os.WTERMSIG(status) +elif os.WIFEXITED(status): + returncode = os.WEXITSTATUS(status) +else: + # Should never happen + raise RuntimeError("Unknown child exit status!") +os.close(master) +sys.exit(returncode) --- python3.4-3.4.2~rc1.orig/debian/sitecustomize.py.in +++ python3.4-3.4.2~rc1/debian/sitecustomize.py.in @@ -0,0 +1,7 @@ +# install the apport exception handler if available +try: + import apport_python_hook +except ImportError: + pass +else: + apport_python_hook.install() --- python3.4-3.4.2~rc1.orig/debian/source.lintian-overrides +++ python3.4-3.4.2~rc1/debian/source.lintian-overrides @@ -0,0 +1,2 @@ +# generated during the build +python3.4 source: quilt-build-dep-but-no-series-file --- python3.4-3.4.2~rc1.orig/debian/source.lintian-overrides.in +++ python3.4-3.4.2~rc1/debian/source.lintian-overrides.in @@ -0,0 +1,2 @@ +# generated during the build +@PVER@ source: quilt-build-dep-but-no-series-file --- python3.4-3.4.2~rc1.orig/debian/source/format +++ python3.4-3.4.2~rc1/debian/source/format @@ -0,0 +1 @@ +1.0 --- python3.4-3.4.2~rc1.orig/debian/tests/control +++ python3.4-3.4.2~rc1/debian/tests/control @@ -0,0 +1,19 @@ +Tests: testsuite +Depends: build-essential, locales, python3.4-dev, libpython3.4-testsuite, python3-gdbm +# need to turn off apport +Restrictions: needs-root + +Tests: testsuite-dbg +Depends: build-essential, locales, python3.4-dev, python3.4-dbg, libpython3.4-testsuite, python3-gdbm-dbg, gdb +# need to turn off apport +Restrictions: needs-root + +Tests: failing-tests +Depends: build-essential, python3.4-dev, libpython3.4-testsuite, python3-gdbm +# need to turn off apport +Restrictions: needs-root allow-stderr + +Tests: failing-tests-dbg +Depends: build-essential, python3.4-dev, python3.4-dbg, libpython3.4-testsuite, python3-gdbm-dbg, gdb +# need to turn off apport +Restrictions: needs-root allow-stderr --- python3.4-3.4.2~rc1.orig/debian/tests/failing-tests +++ python3.4-3.4.2~rc1/debian/tests/failing-tests @@ -0,0 +1,94 @@ +#!/bin/sh + +set -e + +if [ "$(whoami)" = root ]; then + if [ -n "$SUDO_USER" ] && getent passwd "$SUDO_USER" > /dev/null; then + su_user="$SUDO_USER" + else + su_user=nobody + fi + + if [ -e /etc/default/apport ]; then + # stop apport + stop apport 2>/dev/null || true + sed -i '/^enabled=/s/=.*/=0/' /etc/default/apport 2>/dev/null + + if status apport | grep -q start; then + echo >&2 "apport is running. needs to be disabled before running the tests" + exit 1 + fi + fi +fi + +tmphome=$ADTTMP/home +mkdir -p $tmphome +if [ -n "$su_user" ]; then + chmod go+rx $ADTTMP + chown $su_user:nogroup $tmphome +fi +ls -la $ADTTMP + +# no root access needed after this point + +debian_dir=$(dirname $(dirname $0)) + +export LOCPATH=$(pwd)/locales +sh $debian_dir/locale-gen + +export LANG=C + +TESTPYTHON="python3.4 -W default -bb -E -R -m test" +TESTOPTS="-j 1 -w -uall,-network,-urlfetch,-gui" +TESTEXCLUSIONS= + +# test_dbm: Fails from time to time ... +TESTEXCLUSIONS="$TESTEXCLUSIONS test_dbm" + +# test_ensurepip: not yet installed, http://bugs.debian.org/732703 +# ... and then test_venv fails too +TESTEXCLUSIONS="$TESTEXCLUSIONS test_ensurepip test_venv " + +# test_zipfile: Issue 17753, requires write access to test and email.test +TESTEXCLUSIONS="$TESTEXCLUSIONS test_zipfile" + +if [ "$su_user" = nobody ]; then + log=/dev/null +else + log=testsuite.log +fi + +script=$debian_dir/script.py +echo "Running the failing tests with the standard interpreter:" +progressions= +for tst in $TESTEXCLUSIONS; do + if [ -f "$script" ]; then + cmd="HOME=$tmphome python3.4 $script \"$log\" \"$TESTPYTHON $TESTOPTS $tst\"" + else + cmd="HOME=$tmphome $TESTPYTHON $TESTOPTS $tst" + fi + + echo "Running $tst ..." + if [ "$(whoami)" = root ]; then + echo "su -s /bin/sh -c $cmd $su_user" + if su -s /bin/sh -c "$cmd" $su_user; then + progressions="$progressions $tst" + else + : + fi + else + echo "$cmd" + if eval $cmd; then + progressions="$progressions $tst" + else + : + fi + fi +done + +if [ -n "$progressions" ]; then + echo "Tests run: $TESTEXCLUSIONS" + echo "Progressions:$progressions" +fi + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/tests/failing-tests-dbg +++ python3.4-3.4.2~rc1/debian/tests/failing-tests-dbg @@ -0,0 +1,94 @@ +#!/bin/sh + +set -e + +if [ "$(whoami)" = root ]; then + if [ -n "$SUDO_USER" ] && getent passwd "$SUDO_USER" > /dev/null; then + su_user="$SUDO_USER" + else + su_user=nobody + fi + + if [ -e /etc/default/apport ]; then + # stop apport + stop apport 2>/dev/null || true + sed -i '/^enabled=/s/=.*/=0/' /etc/default/apport 2>/dev/null + + if status apport | grep -q start; then + echo >&2 "apport is running. needs to be disabled before running the tests" + exit 1 + fi + fi +fi + +tmphome=$ADTTMP/home +mkdir -p $tmphome +if [ -n "$su_user" ]; then + chmod go+rx $ADTTMP + chown $su_user:nogroup $tmphome +fi +ls -la $ADTTMP + +# no root access needed after this point + +debian_dir=$(dirname $(dirname $0)) + +export LOCPATH=$(pwd)/locales +sh $debian_dir/locale-gen + +export LANG=C + +TESTPYTHON="python3.4dm -W default -bb -E -R -m test" +TESTOPTS="-j 1 -w -uall,-network,-urlfetch,-gui" +TESTEXCLUSIONS= + +# test_dbm: Fails from time to time ... +TESTEXCLUSIONS="$TESTEXCLUSIONS test_dbm" + +# test_ensurepip: not yet installed, http://bugs.debian.org/732703 +# ... and then test_venv fails too +TESTEXCLUSIONS="$TESTEXCLUSIONS test_ensurepip test_venv " + +# test_zipfile: Issue 17753, requires write access to test and email.test +TESTEXCLUSIONS="$TESTEXCLUSIONS test_zipfile" + +if [ "$su_user" = nobody ]; then + log=/dev/null +else + log=testsuite-dbg.log +fi + +script=$debian_dir/script.py +echo "Running the failing tests with the debug enabled interpreter:" +progressions= +for tst in $TESTEXCLUSIONS; do + if [ -f "$script" ]; then + cmd="HOME=$tmphome python3.4 $script \"$log\" \"$TESTPYTHON $TESTOPTS $tst\"" + else + cmd="HOME=$tmphome $TESTPYTHON $TESTOPTS $tst" + fi + + echo "Running $tst ..." + if [ "$(whoami)" = root ]; then + echo "su -s /bin/sh -c $cmd $su_user" + if su -s /bin/sh -c "$cmd" $su_user; then + progressions="$progressions $tst" + else + : + fi + else + echo "$cmd" + if eval $cmd; then + progressions="$progressions $tst" + else + : + fi + fi +done + +if [ -n "$progressions" ]; then + echo "Tests run: $TESTEXCLUSIONS" + echo "Progressions:$progressions" +fi + +exit 0 --- python3.4-3.4.2~rc1.orig/debian/tests/testsuite +++ python3.4-3.4.2~rc1/debian/tests/testsuite @@ -0,0 +1,87 @@ +#!/bin/sh + +set -e + +if [ "$(whoami)" = root ]; then + if [ -n "$SUDO_USER" ] && getent passwd "$SUDO_USER" > /dev/null; then + su_user="$SUDO_USER" + else + su_user=nobody + fi + + if [ -e /etc/default/apport ]; then + # stop apport + stop apport 2>/dev/null || true + sed -i '/^enabled=/s/=.*/=0/' /etc/default/apport 2>/dev/null + + if status apport | grep -q start; then + echo >&2 "apport is running. needs to be disabled before running the tests" + exit 1 + fi + fi +fi +tmphome=$ADTTMP/home +mkdir -p $tmphome +if [ -n "$su_user" ]; then + chmod go+rx $ADTTMP + chown $su_user:nogroup $tmphome +fi +ls -la $ADTTMP + +tmphome=$ADTTMP/home +mkdir -p $tmphome +if [ -n "$su_user" ]; then + chown $su_user $tmphome +fi + +# no root access needed after this point + +debian_dir=$(dirname $(dirname $0)) + +export LOCPATH=$(pwd)/locales +sh $debian_dir/locale-gen + +export LANG=C + +TESTPYTHON="python3.4 -W default -bb -E -R -m test" +TESTOPTS="-j 1 -w -uall,-network,-urlfetch,-gui" +TESTEXCLUSIONS="-x" + +# test_dbm: Fails from time to time ... +TESTEXCLUSIONS="$TESTEXCLUSIONS test_dbm" + +# test_ensurepip: not yet installed, http://bugs.debian.org/732703 +# ... and then test_venv fails too +TESTEXCLUSIONS="$TESTEXCLUSIONS test_ensurepip test_venv " + +# test_gdb: not run for the optimized build +TESTEXCLUSIONS="$TESTEXCLUSIONS test_gdb" + +# test_zipfile: Issue 17753, requires write access to test and email.test +TESTEXCLUSIONS="$TESTEXCLUSIONS test_zipfile" + +if [ "$su_user" = nobody ]; then + log=/dev/null +else + log=testsuite.log +fi + +# several tests fail with configured proxy; we don't need internet access, so +# unset proxy variables +EXTRAENV="env -u https_proxy -u http_proxy -u no_proxy HOME=$tmphome" + +script=$debian_dir/script.py +if [ -f "$script" ]; then + cmd="$EXTRAENV python3.4 $script \"$log\" \"$TESTPYTHON $TESTOPTS $TESTEXCLUSIONS\"" +else + cmd="$EXTRAENV $TESTPYTHON $TESTOPTS $TESTEXCLUSIONS" +fi + +echo "Running the python testsuite with the standard interpreter:" +if [ "$(whoami)" = root ]; then + echo "su -s /bin/sh -c $cmd $su_user" + su -s /bin/sh -c "$cmd" $su_user +else + echo "$cmd" + eval $cmd +fi --- python3.4-3.4.2~rc1.orig/debian/tests/testsuite-dbg +++ python3.4-3.4.2~rc1/debian/tests/testsuite-dbg @@ -0,0 +1,79 @@ +#!/bin/sh + +set -e + +if [ "$(whoami)" = root ]; then + if [ -n "$SUDO_USER" ] && getent passwd "$SUDO_USER" > /dev/null; then + su_user="$SUDO_USER" + else + su_user=nobody + fi + + if [ -e /etc/default/apport ]; then + # stop apport + stop apport 2>/dev/null || true + sed -i '/^enabled=/s/=.*/=0/' /etc/default/apport 2>/dev/null + + if status apport | grep -q start; then + echo >&2 "apport is running. needs to be disabled before running the tests" + exit 1 + fi + fi +fi + +tmphome=$ADTTMP/home +mkdir -p $tmphome +if [ -n "$su_user" ]; then + chmod go+rx $ADTTMP + chown $su_user:nogroup $tmphome +fi +ls -la $ADTTMP + +# no root access needed after this point + +debian_dir=$(dirname $(dirname $0)) + +export LOCPATH=$(pwd)/locales +sh $debian_dir/locale-gen + +export LANG=C + +TESTPYTHON="python3.4dm -W default -bb -E -R -m test" +TESTOPTS="-j 1 -w -uall,-network,-urlfetch,-gui" +TESTEXCLUSIONS="-x" + +# test_dbm: Fails from time to time ... +TESTEXCLUSIONS="$TESTEXCLUSIONS test_dbm" + +# test_ensurepip: not yet installed, http://bugs.debian.org/732703 +# ... and then test_venv fails too +TESTEXCLUSIONS="$TESTEXCLUSIONS test_ensurepip test_venv " + +# test_zipfile: Issue 17753, requires write access to test and email.test +TESTEXCLUSIONS="$TESTEXCLUSIONS test_zipfile" + +if [ "$su_user" = nobody ]; then + log=/dev/null +else + log=testsuite-dbg.log +fi + +# several tests fail with configured proxy; we don't need internet access, so +# unset proxy variables +EXTRAENV="env -u https_proxy -u http_proxy -u no_proxy HOME=$tmphome" + +script=$debian_dir/script.py +if [ -f "$script" ]; then + cmd="$EXTRAENV python3.4 $script \"$log\" \"$TESTPYTHON $TESTOPTS $TESTEXCLUSIONS\"" +else + cmd="$EXTRAENV $TESTPYTHON $TESTOPTS $TESTEXCLUSIONS" +fi + +echo "Running the python testsuite with the debug enabled interpreter:" +if [ "$(whoami)" = root ]; then + echo "su -s /bin/sh -c $cmd $su_user" + su -s /bin/sh -c "$cmd" $su_user +else + echo "$cmd" + eval $cmd +fi --- python3.4-3.4.2~rc1.orig/debian/watch +++ python3.4-3.4.2~rc1/debian/watch @@ -0,0 +1,3 @@ +version=3 +opts=dversionmangle=s/.*\+//,uversionmangle=s/([abcr]+[1-9])$/~$1/ \ + http://www.python.org/ftp/python/3\.4(\.\d)?/Python-(3\.4[.\dabcr]*)\.tgz