mirror of
https://github.com/python/cpython.git
synced 2025-11-01 14:11:41 +00:00
Merged revisions 51434-53004 via svnmerge from svn+ssh://pythondev@svn.python.org/python/trunk ........ r51434 | neal.norwitz | 2006-08-21 20:20:10 +0200 (Mon, 21 Aug 2006) | 1 line Fix a couple of ssize-t issues reported by Alexander Belopolsky on python-dev ........ r51439 | neal.norwitz | 2006-08-21 21:47:08 +0200 (Mon, 21 Aug 2006) | 6 lines Patch #1542451: disallow continue anywhere under a finally I'm undecided if this should be backported to 2.5 or 2.5.1. Armin suggested to wait (I'm of the same opinion). Thomas W thinks it's fine to go in 2.5. ........ r51443 | neal.norwitz | 2006-08-21 22:16:24 +0200 (Mon, 21 Aug 2006) | 4 lines Handle a few more error conditions. Klocwork 301 and 302. Will backport. ........ r51450 | neal.norwitz | 2006-08-22 00:21:19 +0200 (Tue, 22 Aug 2006) | 5 lines Patch #1541585: fix buffer overrun when performing repr() on a unicode string in a build with wide unicode (UCS-4) support. This code could be improved, so add an XXX comment. ........ r51456 | neal.norwitz | 2006-08-22 01:44:48 +0200 (Tue, 22 Aug 2006) | 1 line Try to get the windows bots working again with the new peephole.c ........ r51461 | anthony.baxter | 2006-08-22 09:36:59 +0200 (Tue, 22 Aug 2006) | 1 line patch for documentation for recent uuid changes (from ping) ........ r51473 | neal.norwitz | 2006-08-22 15:56:56 +0200 (Tue, 22 Aug 2006) | 1 line Alexander Belopolsky pointed out that pos is a size_t ........ r51489 | jeremy.hylton | 2006-08-22 22:46:00 +0200 (Tue, 22 Aug 2006) | 2 lines Expose column offset information in parse trees. ........ r51497 | andrew.kuchling | 2006-08-23 01:13:43 +0200 (Wed, 23 Aug 2006) | 1 line Move functional howto into trunk ........ r51515 | jeremy.hylton | 2006-08-23 20:37:43 +0200 (Wed, 23 Aug 2006) | 2 lines Baby steps towards better tests for tokenize ........ r51525 | alex.martelli | 2006-08-23 22:42:02 +0200 (Wed, 23 Aug 2006) | 6 lines x**2 should about equal x*x (including for a float x such that the result is inf) but didn't; added a test to test_float to verify that, and ignored the ERANGE value for errno in the pow operation to make the new test pass (with help from Marilyn Davis at the Google Python Sprint -- thanks!). ........ r51526 | jeremy.hylton | 2006-08-23 23:14:03 +0200 (Wed, 23 Aug 2006) | 20 lines Bug fixes large and small for tokenize. Small: Always generate a NL or NEWLINE token following a COMMENT token. The old code did not generate an NL token if the comment was on a line by itself. Large: The output of untokenize() will now match the input exactly if it is passed the full token sequence. The old, crufty output is still generated if a limited input sequence is provided, where limited means that it does not include position information for tokens. Remaining bug: There is no CONTINUATION token (\) so there is no way for untokenize() to handle such code. Also, expanded the number of doctests in hopes of eventually removing the old-style tests that compare against a golden file. Bug fix candidate for Python 2.5.1. (Sigh.) ........ r51527 | jeremy.hylton | 2006-08-23 23:26:46 +0200 (Wed, 23 Aug 2006) | 5 lines Replace dead code with an assert. Now that COMMENT tokens are reliably followed by NL or NEWLINE, there is never a need to add extra newlines in untokenize. ........ r51530 | alex.martelli | 2006-08-24 00:17:59 +0200 (Thu, 24 Aug 2006) | 7 lines Reverting the patch that tried to fix the issue whereby x**2 raises OverflowError while x*x succeeds and produces infinity; apparently these inconsistencies cannot be fixed across ``all'' platforms and there's a widespread feeling that therefore ``every'' platform should keep suffering forevermore. Ah well. ........ r51565 | thomas.wouters | 2006-08-24 20:40:20 +0200 (Thu, 24 Aug 2006) | 6 lines Fix SF bug #1545837: array.array borks on deepcopy. array.__deepcopy__() needs to take an argument, even if it doesn't actually use it. Will backport to 2.5 and 2.4 (if applicable.) ........ r51580 | martin.v.loewis | 2006-08-25 02:03:34 +0200 (Fri, 25 Aug 2006) | 3 lines Patch #1545507: Exclude ctypes package in Win64 MSI file. Will backport to 2.5. ........ r51589 | neal.norwitz | 2006-08-25 03:52:49 +0200 (Fri, 25 Aug 2006) | 1 line importing types is not necessary if we use isinstance ........ r51604 | thomas.heller | 2006-08-25 09:27:33 +0200 (Fri, 25 Aug 2006) | 3 lines Port _ctypes.pyd to win64 on AMD64. ........ r51605 | thomas.heller | 2006-08-25 09:34:51 +0200 (Fri, 25 Aug 2006) | 3 lines Add missing file for _ctypes.pyd port to win64 on AMD64. ........ r51606 | thomas.heller | 2006-08-25 11:26:33 +0200 (Fri, 25 Aug 2006) | 6 lines Build _ctypes.pyd for win AMD64 into the MSVC project file. Since MSVC doesn't know about .asm files, a helper batch file is needed to find ml64.exe in predefined locations. The helper script hardcodes the path to the MS Platform SDK. ........ r51608 | armin.rigo | 2006-08-25 14:44:28 +0200 (Fri, 25 Aug 2006) | 4 lines The regular expression engine in '_sre' can segfault when interpreting bogus bytecode. It is unclear whether this is a real bug or a "won't fix" case like bogus_code_obj.py. ........ r51617 | tim.peters | 2006-08-26 00:05:39 +0200 (Sat, 26 Aug 2006) | 2 lines Whitespace normalization. ........ r51618 | tim.peters | 2006-08-26 00:06:44 +0200 (Sat, 26 Aug 2006) | 2 lines Add missing svn:eol-style property to text files. ........ r51619 | tim.peters | 2006-08-26 00:26:21 +0200 (Sat, 26 Aug 2006) | 3 lines A new test here relied on preserving invisible trailing whitespace in expected output. Stop that. ........ r51624 | jack.diederich | 2006-08-26 20:42:06 +0200 (Sat, 26 Aug 2006) | 4 lines - Move functions common to all path modules into genericpath.py and have the OS speicifc path modules import them. - Have os2emxpath import common functions fron ntpath instead of using copies ........ r51642 | neal.norwitz | 2006-08-29 07:40:58 +0200 (Tue, 29 Aug 2006) | 1 line Fix a couple of typos. ........ r51647 | marc-andre.lemburg | 2006-08-29 12:34:12 +0200 (Tue, 29 Aug 2006) | 5 lines Fix a buglet in the error reporting (SF bug report #1546372). This should probably go into Python 2.5 or 2.5.1 as well. ........ r51663 | armin.rigo | 2006-08-31 10:51:06 +0200 (Thu, 31 Aug 2006) | 3 lines Doc fix: hashlib objects don't always return a digest of 16 bytes. Backport candidate for 2.5. ........ r51664 | nick.coghlan | 2006-08-31 14:00:43 +0200 (Thu, 31 Aug 2006) | 1 line Fix the wrongheaded implementation of context management in the decimal module and add unit tests. (python-dev discussion is ongoing regarding what we do about Python 2.5) ........ r51665 | nick.coghlan | 2006-08-31 14:51:25 +0200 (Thu, 31 Aug 2006) | 1 line Remove the old decimal context management tests from test_contextlib (guess who didn't run the test suite before committing...) ........ r51669 | brett.cannon | 2006-08-31 20:54:26 +0200 (Thu, 31 Aug 2006) | 4 lines Make sure memory is properly cleaned up in file_init. Backport candidate. ........ r51671 | brett.cannon | 2006-08-31 23:47:52 +0200 (Thu, 31 Aug 2006) | 2 lines Fix comment about indentation level in C files. ........ r51674 | brett.cannon | 2006-09-01 00:42:37 +0200 (Fri, 01 Sep 2006) | 3 lines Have pre-existing C files use 8 spaces indents (to match old PEP 7 style), but have all new files use 4 spaces (to match current PEP 7 style). ........ r51676 | fred.drake | 2006-09-01 05:57:19 +0200 (Fri, 01 Sep 2006) | 3 lines - SF patch #1550263: Enhance and correct unittest docs - various minor cleanups for improved consistency ........ r51677 | georg.brandl | 2006-09-02 00:30:52 +0200 (Sat, 02 Sep 2006) | 2 lines evalfile() should be execfile(). ........ r51681 | neal.norwitz | 2006-09-02 04:43:17 +0200 (Sat, 02 Sep 2006) | 1 line SF #1547931, fix typo (missing and). Will backport to 2.5 ........ r51683 | neal.norwitz | 2006-09-02 04:50:35 +0200 (Sat, 02 Sep 2006) | 1 line Bug #1548092: fix curses.tparm seg fault on invalid input. Needs backport to 2.5.1 and earlier. ........ r51684 | neal.norwitz | 2006-09-02 04:58:13 +0200 (Sat, 02 Sep 2006) | 4 lines Bug #1550714: fix SystemError from itertools.tee on negative value for n. Needs backport to 2.5.1 and earlier. ........ r51685 | nick.coghlan | 2006-09-02 05:54:17 +0200 (Sat, 02 Sep 2006) | 1 line Make decimal.ContextManager a private implementation detail of decimal.localcontext() ........ r51686 | nick.coghlan | 2006-09-02 06:04:18 +0200 (Sat, 02 Sep 2006) | 1 line Further corrections to the decimal module context management documentation ........ r51688 | raymond.hettinger | 2006-09-02 19:07:23 +0200 (Sat, 02 Sep 2006) | 1 line Fix documentation nits for decimal context managers. ........ r51690 | neal.norwitz | 2006-09-02 20:51:34 +0200 (Sat, 02 Sep 2006) | 1 line Add missing word in comment ........ r51691 | neal.norwitz | 2006-09-02 21:40:19 +0200 (Sat, 02 Sep 2006) | 7 lines Hmm, this test has failed at least twice recently on the OpenBSD and Debian sparc buildbots. Since this goes through a lot of tests and hits the disk a lot it could be slow (especially if NFS is involved). I'm not sure if that's the problem, but printing periodic msgs shouldn't hurt. The code was stolen from test_compiler. ........ r51693 | nick.coghlan | 2006-09-03 03:02:00 +0200 (Sun, 03 Sep 2006) | 1 line Fix final documentation nits before backporting decimal module fixes to 2.5 ........ r51694 | nick.coghlan | 2006-09-03 03:06:07 +0200 (Sun, 03 Sep 2006) | 1 line Typo fix for decimal docs ........ r51697 | nick.coghlan | 2006-09-03 03:20:46 +0200 (Sun, 03 Sep 2006) | 1 line NEWS entry on trunk for decimal module changes ........ r51704 | raymond.hettinger | 2006-09-04 17:32:48 +0200 (Mon, 04 Sep 2006) | 1 line Fix endcase for str.rpartition() ........ r51716 | tim.peters | 2006-09-05 04:18:09 +0200 (Tue, 05 Sep 2006) | 12 lines "Conceptual" merge of rev 51711 from the 2.5 branch. i_divmod(): As discussed on Python-Dev, changed the overflow checking to live happily with recent gcc optimizations that assume signed integer arithmetic never overflows. This differs from the corresponding change on the 2.5 and 2.4 branches, using a less obscure approach, but one that /may/ tickle platform idiocies in their definitions of LONG_MIN. The 2.4 + 2.5 change avoided introducing a dependence on LONG_MIN, at the cost of substantially goofier code. ........ r51717 | tim.peters | 2006-09-05 04:21:19 +0200 (Tue, 05 Sep 2006) | 2 lines Whitespace normalization. ........ r51719 | tim.peters | 2006-09-05 04:22:17 +0200 (Tue, 05 Sep 2006) | 2 lines Add missing svn:eol-style property to text files. ........ r51720 | neal.norwitz | 2006-09-05 04:24:03 +0200 (Tue, 05 Sep 2006) | 2 lines Fix SF bug #1546288, crash in dict_equal. ........ r51721 | neal.norwitz | 2006-09-05 04:25:41 +0200 (Tue, 05 Sep 2006) | 1 line Fix SF #1552093, eval docstring typo (3 ps in mapping) ........ r51724 | neal.norwitz | 2006-09-05 04:35:08 +0200 (Tue, 05 Sep 2006) | 1 line This was found by Guido AFAIK on p3yk (sic) branch. ........ r51725 | neal.norwitz | 2006-09-05 04:36:20 +0200 (Tue, 05 Sep 2006) | 1 line Add a NEWS entry for str.rpartition() change ........ r51728 | neal.norwitz | 2006-09-05 04:57:01 +0200 (Tue, 05 Sep 2006) | 1 line Patch #1540470, for OpenBSD 4.0. Backport candidate for 2.[34]. ........ r51729 | neal.norwitz | 2006-09-05 05:53:08 +0200 (Tue, 05 Sep 2006) | 12 lines Bug #1520864 (again): unpacking singleton tuples in list comprehensions and generator expressions (x for x, in ... ) works again. Sigh, I only fixed for loops the first time, not list comps and genexprs too. I couldn't find any more unpacking cases where there is a similar bug lurking. This code should be refactored to eliminate the duplication. I'm sure the listcomp/genexpr code can be refactored. I'm not sure if the for loop can re-use any of the same code though. Will backport to 2.5 (the only place it matters). ........ r51731 | neal.norwitz | 2006-09-05 05:58:26 +0200 (Tue, 05 Sep 2006) | 1 line Add a comment about some refactoring. (There's probably more that should be done.) I will reformat this file in the next checkin due to the inconsistent tabs/spaces. ........ r51732 | neal.norwitz | 2006-09-05 06:00:12 +0200 (Tue, 05 Sep 2006) | 1 line M-x untabify ........ r51737 | hyeshik.chang | 2006-09-05 14:07:09 +0200 (Tue, 05 Sep 2006) | 7 lines Fix a few bugs on cjkcodecs found by Oren Tirosh: - gbk and gb18030 codec now handle U+30FB KATAKANA MIDDLE DOT correctly. - iso2022_jp_2 codec now encodes into G0 for KS X 1001, GB2312 codepoints to conform the standard. - iso2022_jp_3 and iso2022_jp_2004 codec can encode JIS X 2013:2 codepoints now. ........ r51738 | hyeshik.chang | 2006-09-05 14:14:57 +0200 (Tue, 05 Sep 2006) | 2 lines Fix a typo: 2013 -> 0213 ........ r51740 | georg.brandl | 2006-09-05 14:44:58 +0200 (Tue, 05 Sep 2006) | 3 lines Bug #1552618: change docs of dict.has_key() to reflect recommendation to use "in". ........ r51742 | andrew.kuchling | 2006-09-05 15:02:40 +0200 (Tue, 05 Sep 2006) | 1 line Rearrange example a bit, and show rpartition() when separator is not found ........ r51744 | andrew.kuchling | 2006-09-05 15:15:41 +0200 (Tue, 05 Sep 2006) | 1 line [Bug #1525469] SimpleXMLRPCServer still uses the sys.exc_{value,type} module-level globals instead of calling sys.exc_info(). Reported by Russell Warren ........ r51745 | andrew.kuchling | 2006-09-05 15:19:18 +0200 (Tue, 05 Sep 2006) | 3 lines [Bug #1526834] Fix crash in pdb when you do 'b f('; the function name was placed into a regex pattern and the unbalanced paren caused re.compile() to report an error ........ r51751 | kristjan.jonsson | 2006-09-05 19:58:12 +0200 (Tue, 05 Sep 2006) | 6 lines Update the PCBuild8 solution. Facilitate cross-compilation by having binaries in separate Win32 and x64 directories. Rationalized configs by making proper use of platforms/configurations. Remove pythoncore_pgo project. Add new PGIRelease and PGORelease configurations to perform Profile Guided Optimisation. Removed I64 support, but this can be easily added by copying the x64 platform settings. ........ r51758 | gustavo.niemeyer | 2006-09-06 03:58:52 +0200 (Wed, 06 Sep 2006) | 3 lines Fixing #1531862: Do not close standard file descriptors in the subprocess module. ........ r51760 | neal.norwitz | 2006-09-06 05:58:34 +0200 (Wed, 06 Sep 2006) | 1 line Revert 51758 because it broke all the buildbots ........ r51762 | georg.brandl | 2006-09-06 08:03:59 +0200 (Wed, 06 Sep 2006) | 3 lines Bug #1551427: fix a wrong NULL pointer check in the win32 version of os.urandom(). ........ r51765 | georg.brandl | 2006-09-06 08:09:31 +0200 (Wed, 06 Sep 2006) | 3 lines Bug #1550983: emit better error messages for erroneous relative imports (if not in package and if beyond toplevel package). ........ r51767 | neal.norwitz | 2006-09-06 08:28:06 +0200 (Wed, 06 Sep 2006) | 1 line with and as are now keywords. There are some generated files I can't recreate. ........ r51770 | georg.brandl | 2006-09-06 08:50:05 +0200 (Wed, 06 Sep 2006) | 5 lines Bug #1542051: Exceptions now correctly call PyObject_GC_UnTrack. Also make sure that every exception class has __module__ set to 'exceptions'. ........ r51785 | georg.brandl | 2006-09-06 22:05:58 +0200 (Wed, 06 Sep 2006) | 2 lines Fix missing import of the types module in logging.config. ........ r51789 | marc-andre.lemburg | 2006-09-06 22:40:22 +0200 (Wed, 06 Sep 2006) | 3 lines Add news item for bug fix of SF bug report #1546372. ........ r51797 | gustavo.niemeyer | 2006-09-07 02:48:33 +0200 (Thu, 07 Sep 2006) | 3 lines Fixed subprocess bug #1531862 again, after removing tests offending buildbot ........ r51798 | raymond.hettinger | 2006-09-07 04:42:48 +0200 (Thu, 07 Sep 2006) | 1 line Fix refcounts and add error checks. ........ r51803 | nick.coghlan | 2006-09-07 12:50:34 +0200 (Thu, 07 Sep 2006) | 1 line Fix the speed regression in inspect.py by adding another cache to speed up getmodule(). Patch #1553314 ........ r51805 | ronald.oussoren | 2006-09-07 14:03:10 +0200 (Thu, 07 Sep 2006) | 2 lines Fix a glaring error and update some version numbers. ........ r51814 | andrew.kuchling | 2006-09-07 15:56:23 +0200 (Thu, 07 Sep 2006) | 1 line Typo fix ........ r51815 | andrew.kuchling | 2006-09-07 15:59:38 +0200 (Thu, 07 Sep 2006) | 8 lines [Bug #1552726] Avoid repeatedly polling in interactive mode -- only put a timeout on the select() if an input hook has been defined. Patch by Richard Boulton. This select() code is only executed with readline 2.1, or if READLINE_CALLBACKS is defined. Backport candidate for 2.5, 2.4, probably earlier versions too. ........ r51816 | armin.rigo | 2006-09-07 17:06:00 +0200 (Thu, 07 Sep 2006) | 2 lines Add a warning notice on top of the generated grammar.txt. ........ r51819 | thomas.heller | 2006-09-07 20:56:28 +0200 (Thu, 07 Sep 2006) | 5 lines Anonymous structure fields that have a bit-width specified did not work, and they gave a strange error message from PyArg_ParseTuple: function takes exactly 2 arguments (3 given). With tests. ........ r51820 | thomas.heller | 2006-09-07 21:09:54 +0200 (Thu, 07 Sep 2006) | 4 lines The cast function did not accept c_char_p or c_wchar_p instances as first argument, and failed with a 'bad argument to internal function' error message. ........ r51827 | nick.coghlan | 2006-09-08 12:04:38 +0200 (Fri, 08 Sep 2006) | 1 line Add missing NEWS entry for rev 51803 ........ r51828 | andrew.kuchling | 2006-09-08 15:25:23 +0200 (Fri, 08 Sep 2006) | 1 line Add missing word ........ r51829 | andrew.kuchling | 2006-09-08 15:35:49 +0200 (Fri, 08 Sep 2006) | 1 line Explain SQLite a bit more clearly ........ r51830 | andrew.kuchling | 2006-09-08 15:36:36 +0200 (Fri, 08 Sep 2006) | 1 line Explain SQLite a bit more clearly ........ r51832 | andrew.kuchling | 2006-09-08 16:02:45 +0200 (Fri, 08 Sep 2006) | 1 line Use native SQLite types ........ r51833 | andrew.kuchling | 2006-09-08 16:03:01 +0200 (Fri, 08 Sep 2006) | 1 line Use native SQLite types ........ r51835 | andrew.kuchling | 2006-09-08 16:05:10 +0200 (Fri, 08 Sep 2006) | 1 line Fix typo in example ........ r51837 | brett.cannon | 2006-09-09 09:11:46 +0200 (Sat, 09 Sep 2006) | 6 lines Remove the __unicode__ method from exceptions. Allows unicode() to be called on exception classes. Would require introducing a tp_unicode slot to make it work otherwise. Fixes bug #1551432 and will be backported. ........ r51854 | neal.norwitz | 2006-09-11 06:24:09 +0200 (Mon, 11 Sep 2006) | 8 lines Forward port of 51850 from release25-maint branch. As mentioned on python-dev, reverting patch #1504333 because it introduced an infinite loop in rev 47154. This patch also adds a test to prevent the regression. ........ r51855 | neal.norwitz | 2006-09-11 06:28:16 +0200 (Mon, 11 Sep 2006) | 5 lines Properly handle a NULL returned from PyArena_New(). (Also fix some whitespace) Klocwork #364. ........ r51856 | neal.norwitz | 2006-09-11 06:32:57 +0200 (Mon, 11 Sep 2006) | 1 line Add a "crasher" taken from the sgml bug report referenced in the comment ........ r51858 | georg.brandl | 2006-09-11 11:38:35 +0200 (Mon, 11 Sep 2006) | 12 lines Forward-port of rev. 51857: Building with HP's cc on HP-UX turned up a couple of problems. _PyGILState_NoteThreadState was declared as static inconsistently. Make it static as it's not necessary outside of this module. Some tests failed because errno was reset to 0. (I think the tests that failed were at least: test_fcntl and test_mailbox). Ensure that errno doesn't change after a call to Py_END_ALLOW_THREADS. This only affected debug builds. ........ r51865 | martin.v.loewis | 2006-09-12 21:49:20 +0200 (Tue, 12 Sep 2006) | 2 lines Forward-port 51862: Add sgml_input.html. ........ r51866 | andrew.kuchling | 2006-09-12 22:50:23 +0200 (Tue, 12 Sep 2006) | 1 line Markup typo fix ........ r51867 | andrew.kuchling | 2006-09-12 23:09:02 +0200 (Tue, 12 Sep 2006) | 1 line Some editing, markup fixes ........ r51868 | andrew.kuchling | 2006-09-12 23:21:51 +0200 (Tue, 12 Sep 2006) | 1 line More wordsmithing ........ r51877 | andrew.kuchling | 2006-09-14 13:22:18 +0200 (Thu, 14 Sep 2006) | 1 line Make --help mention that -v can be supplied multiple times ........ r51878 | andrew.kuchling | 2006-09-14 13:28:50 +0200 (Thu, 14 Sep 2006) | 1 line Rewrite help message to remove some of the parentheticals. (There were a lot of them.) ........ r51883 | ka-ping.yee | 2006-09-15 02:34:19 +0200 (Fri, 15 Sep 2006) | 2 lines Fix grammar errors and improve clarity. ........ r51885 | georg.brandl | 2006-09-15 07:22:24 +0200 (Fri, 15 Sep 2006) | 3 lines Correct elementtree module index entry. ........ r51889 | fred.drake | 2006-09-15 17:18:04 +0200 (Fri, 15 Sep 2006) | 4 lines - fix module name in links in formatted documentation - minor markup cleanup (forward-ported from release25-maint revision 51888) ........ r51891 | fred.drake | 2006-09-15 18:11:27 +0200 (Fri, 15 Sep 2006) | 3 lines revise explanation of returns_unicode to reflect bool values and to include the default value (merged from release25-maint revision 51890) ........ r51897 | martin.v.loewis | 2006-09-16 19:36:37 +0200 (Sat, 16 Sep 2006) | 2 lines Patch #1557515: Add RLIMIT_SBSIZE. ........ r51903 | ronald.oussoren | 2006-09-17 20:42:53 +0200 (Sun, 17 Sep 2006) | 2 lines Port of revision 51902 in release25-maint to the trunk ........ r51904 | ronald.oussoren | 2006-09-17 21:23:27 +0200 (Sun, 17 Sep 2006) | 3 lines Tweak Mac/Makefile in to ensure that pythonw gets rebuild when the major version of python changes (2.5 -> 2.6). Bug #1552935. ........ r51913 | guido.van.rossum | 2006-09-18 23:36:16 +0200 (Mon, 18 Sep 2006) | 2 lines Make this thing executable. ........ r51920 | gregory.p.smith | 2006-09-19 19:35:04 +0200 (Tue, 19 Sep 2006) | 5 lines Fixes a bug with bsddb.DB.stat where the flags and txn keyword arguments are transposed. (reported by Louis Zechtzer) ..already committed to release24-maint ..needs committing to release25-maint ........ r51926 | brett.cannon | 2006-09-20 20:34:28 +0200 (Wed, 20 Sep 2006) | 3 lines Accidentally didn't commit Misc/NEWS entry on when __unicode__() was removed from exceptions. ........ r51927 | brett.cannon | 2006-09-20 20:43:13 +0200 (Wed, 20 Sep 2006) | 6 lines Allow exceptions to be directly sliced again (e.g., ``BaseException(1,2,3)[0:2]``). Discovered in Python 2.5.0 by Thomas Heller and reported to python-dev. This should be backported to 2.5 . ........ r51928 | brett.cannon | 2006-09-20 21:28:35 +0200 (Wed, 20 Sep 2006) | 2 lines Make python.vim output more deterministic. ........ r51949 | walter.doerwald | 2006-09-21 17:09:55 +0200 (Thu, 21 Sep 2006) | 2 lines Fix typo. ........ r51950 | jack.diederich | 2006-09-21 19:50:26 +0200 (Thu, 21 Sep 2006) | 5 lines * regression bug, count_next was coercing a Py_ssize_t to an unsigned Py_size_t which breaks negative counts * added test for negative numbers will backport to 2.5.1 ........ r51953 | jack.diederich | 2006-09-21 22:34:49 +0200 (Thu, 21 Sep 2006) | 1 line added itertools.count(-n) fix ........ r51971 | neal.norwitz | 2006-09-22 10:16:26 +0200 (Fri, 22 Sep 2006) | 10 lines Fix %zd string formatting on Mac OS X so it prints negative numbers. In addition to testing positive numbers, verify negative numbers work in configure. In order to avoid compiler warnings on OS X 10.4, also change the order of the check for the format character to use (PY_FORMAT_SIZE_T) in the sprintf format for Py_ssize_t. This patch changes PY_FORMAT_SIZE_T from "" to "l" if it wasn't defined at configure time. Need to verify the buildbot results. Backport candidate (if everyone thinks this patch can't be improved). ........ r51972 | neal.norwitz | 2006-09-22 10:18:10 +0200 (Fri, 22 Sep 2006) | 7 lines Bug #1557232: fix seg fault with def f((((x)))) and def f(((x),)). These tests should be improved. Hopefully this fixes variations when flipping back and forth between fpdef and fplist. Backport candidate. ........ r51975 | neal.norwitz | 2006-09-22 10:47:23 +0200 (Fri, 22 Sep 2006) | 4 lines Mostly revert this file to the same version as before. Only force setting of PY_FORMAT_SIZE_T to "l" for Mac OSX. I don't know a better define to use. This should get rid of the warnings on other platforms and Mac too. ........ r51986 | fred.drake | 2006-09-23 02:26:31 +0200 (Sat, 23 Sep 2006) | 1 line add boilerplate "What's New" document so the docs will build ........ r51987 | neal.norwitz | 2006-09-23 06:11:38 +0200 (Sat, 23 Sep 2006) | 1 line Remove extra semi-colons reported by Johnny Lee on python-dev. Backport if anyone cares. ........ r51989 | neal.norwitz | 2006-09-23 20:11:58 +0200 (Sat, 23 Sep 2006) | 1 line SF Bug #1563963, add missing word and cleanup first sentance ........ r51990 | brett.cannon | 2006-09-23 21:53:20 +0200 (Sat, 23 Sep 2006) | 3 lines Make output on test_strptime() be more verbose in face of failure. This is in hopes that more information will help debug the failing test on HPPA Ubuntu. ........ r51991 | georg.brandl | 2006-09-24 12:36:01 +0200 (Sun, 24 Sep 2006) | 2 lines Fix webbrowser.BackgroundBrowser on Windows. ........ r51993 | georg.brandl | 2006-09-24 14:35:36 +0200 (Sun, 24 Sep 2006) | 4 lines Fix a bug in the parser's future statement handling that led to "with" not being recognized as a keyword after, e.g., this statement: from __future__ import division, with_statement ........ r51995 | georg.brandl | 2006-09-24 14:50:24 +0200 (Sun, 24 Sep 2006) | 4 lines Fix a bug in traceback.format_exception_only() that led to an error being raised when print_exc() was called without an exception set. In version 2.4, this printed "None", restored that behavior. ........ r52000 | armin.rigo | 2006-09-25 17:16:26 +0200 (Mon, 25 Sep 2006) | 2 lines Another crasher. ........ r52011 | brett.cannon | 2006-09-27 01:38:24 +0200 (Wed, 27 Sep 2006) | 2 lines Make the error message for when the time data and format do not match clearer. ........ r52014 | andrew.kuchling | 2006-09-27 18:37:30 +0200 (Wed, 27 Sep 2006) | 1 line Add news item for rev. 51815 ........ r52018 | andrew.kuchling | 2006-09-27 21:23:05 +0200 (Wed, 27 Sep 2006) | 1 line Make examples do error checking on Py_InitModule ........ r52032 | brett.cannon | 2006-09-29 00:10:14 +0200 (Fri, 29 Sep 2006) | 2 lines Very minor grammatical fix in a comment. ........ r52048 | george.yoshida | 2006-09-30 07:14:02 +0200 (Sat, 30 Sep 2006) | 4 lines SF bug #1567976 : fix typo Will backport to 2.5. ........ r52051 | gregory.p.smith | 2006-09-30 08:08:20 +0200 (Sat, 30 Sep 2006) | 2 lines wording change ........ r52053 | georg.brandl | 2006-09-30 09:24:48 +0200 (Sat, 30 Sep 2006) | 2 lines Bug #1567375: a minor logical glitch in example description. ........ r52056 | georg.brandl | 2006-09-30 09:31:57 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1565661: in webbrowser, split() the command for the default GNOME browser in case it is a command with args. ........ r52058 | georg.brandl | 2006-09-30 10:43:30 +0200 (Sat, 30 Sep 2006) | 4 lines Patch #1567691: super() and new.instancemethod() now don't accept keyword arguments any more (previously they accepted them, but didn't use them). ........ r52061 | georg.brandl | 2006-09-30 11:03:42 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1566800: make sure that EnvironmentError can be called with any number of arguments, as was the case in Python 2.4. ........ r52063 | georg.brandl | 2006-09-30 11:06:45 +0200 (Sat, 30 Sep 2006) | 2 lines Bug #1566663: remove obsolete example from datetime docs. ........ r52065 | georg.brandl | 2006-09-30 11:13:21 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1566602: correct failure of posixpath unittest when $HOME ends with a slash. ........ r52068 | georg.brandl | 2006-09-30 12:58:01 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1457823: cgi.(Sv)FormContentDict's constructor now takes keep_blank_values and strict_parsing keyword arguments. ........ r52069 | georg.brandl | 2006-09-30 13:06:47 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1560617: in pyclbr, return full module name not only for classes, but also for functions. ........ r52072 | georg.brandl | 2006-09-30 13:17:34 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1556784: allow format strings longer than 127 characters in datetime's strftime function. ........ r52075 | georg.brandl | 2006-09-30 13:22:28 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1446043: correctly raise a LookupError if an encoding name given to encodings.search_function() contains a dot. ........ r52078 | georg.brandl | 2006-09-30 14:02:57 +0200 (Sat, 30 Sep 2006) | 3 lines Bug #1546052: clarify that PyString_FromString(AndSize) copies the string pointed to by its parameter. ........ r52080 | georg.brandl | 2006-09-30 14:16:03 +0200 (Sat, 30 Sep 2006) | 3 lines Convert test_import to unittest. ........ r52083 | kurt.kaiser | 2006-10-01 23:16:45 +0200 (Sun, 01 Oct 2006) | 5 lines Some syntax errors were being caught by tokenize during the tabnanny check, resulting in obscure error messages. Do the syntax check first. Bug 1562716, 1562719 ........ r52084 | kurt.kaiser | 2006-10-01 23:54:37 +0200 (Sun, 01 Oct 2006) | 3 lines Add comment explaining that error msgs may be due to user code when running w/o subprocess. ........ r52086 | martin.v.loewis | 2006-10-02 16:55:51 +0200 (Mon, 02 Oct 2006) | 3 lines Fix test for uintptr_t. Fixes #1568842. Will backport. ........ r52089 | martin.v.loewis | 2006-10-02 17:20:37 +0200 (Mon, 02 Oct 2006) | 3 lines Guard uintptr_t test with HAVE_STDINT_H, test for stdint.h. Will backport. ........ r52100 | vinay.sajip | 2006-10-03 20:02:37 +0200 (Tue, 03 Oct 2006) | 1 line Documentation omitted the additional parameter to LogRecord.__init__ which was added in 2.5. (See SF #1569622). ........ r52101 | vinay.sajip | 2006-10-03 20:20:26 +0200 (Tue, 03 Oct 2006) | 1 line Documentation clarified to mention optional parameters. ........ r52102 | vinay.sajip | 2006-10-03 20:21:56 +0200 (Tue, 03 Oct 2006) | 1 line Modified LogRecord.__init__ to make the func parameter optional. (See SF #1569622). ........ r52121 | brett.cannon | 2006-10-03 23:58:55 +0200 (Tue, 03 Oct 2006) | 2 lines Fix minor typo in a comment. ........ r52123 | brett.cannon | 2006-10-04 01:23:14 +0200 (Wed, 04 Oct 2006) | 2 lines Convert test_imp over to unittest. ........ r52128 | barry.warsaw | 2006-10-04 04:06:36 +0200 (Wed, 04 Oct 2006) | 3 lines decode_rfc2231(): As Christian Robottom Reis points out, it makes no sense to test for parts > 3 when we use .split(..., 2). ........ r52129 | jeremy.hylton | 2006-10-04 04:24:52 +0200 (Wed, 04 Oct 2006) | 9 lines Fix for SF bug 1569998: break permitted inside try. The compiler was checking that there was something on the fblock stack, but not that there was a loop on the stack. Fixed that and added a test for the specific syntax error. Bug fix candidate. ........ r52130 | martin.v.loewis | 2006-10-04 07:47:34 +0200 (Wed, 04 Oct 2006) | 4 lines Fix integer negation and absolute value to not rely on undefined behaviour of the C compiler anymore. Will backport to 2.5 and 2.4. ........ r52135 | martin.v.loewis | 2006-10-04 11:21:20 +0200 (Wed, 04 Oct 2006) | 1 line Forward port r52134: Add uuids for 2.4.4. ........ r52137 | armin.rigo | 2006-10-04 12:23:57 +0200 (Wed, 04 Oct 2006) | 3 lines Compilation problem caused by conflicting typedefs for uint32_t (unsigned long vs. unsigned int). ........ r52139 | armin.rigo | 2006-10-04 14:17:45 +0200 (Wed, 04 Oct 2006) | 23 lines Forward-port of r52136,52138: a review of overflow-detecting code. * unified the way intobject, longobject and mystrtoul handle values around -sys.maxint-1. * in general, trying to entierely avoid overflows in any computation involving signed ints or longs is extremely involved. Fixed a few simple cases where a compiler might be too clever (but that's all guesswork). * more overflow checks against bad data in marshal.c. * 2.5 specific: fixed a number of places that were still confusing int and Py_ssize_t. Some of them could potentially have caused "real-world" breakage. * list.pop(x): fixing overflow issues on x was messy. I just reverted to PyArg_ParseTuple("n"), which does the right thing. (An obscure test was trying to give a Decimal to list.pop()... doesn't make sense any more IMHO) * trying to write a few tests... ........ r52147 | andrew.kuchling | 2006-10-04 15:42:43 +0200 (Wed, 04 Oct 2006) | 6 lines Cause a PyObject_Malloc() failure to trigger a MemoryError, and then add 'if (PyErr_Occurred())' checks to various places so that NULL is returned properly. 2.4 backport candidate. ........ r52148 | martin.v.loewis | 2006-10-04 17:25:28 +0200 (Wed, 04 Oct 2006) | 1 line Add MSVC8 project files to create wininst-8.exe. ........ r52196 | brett.cannon | 2006-10-06 00:02:31 +0200 (Fri, 06 Oct 2006) | 7 lines Clarify what "re-initialization" means for init_builtin() and init_dynamic(). Also remove warning about re-initialization as possibly raising an execption as both call _PyImport_FindExtension() which pulls any module that was already imported from the Python process' extension cache and just copies the __dict__ into the module stored in sys.modules. ........ r52200 | fred.drake | 2006-10-06 02:03:45 +0200 (Fri, 06 Oct 2006) | 3 lines - update links - remove Sleepycat name now that they have been bought ........ r52204 | andrew.kuchling | 2006-10-06 12:41:01 +0200 (Fri, 06 Oct 2006) | 1 line Case fix ........ r52208 | georg.brandl | 2006-10-06 14:46:08 +0200 (Fri, 06 Oct 2006) | 3 lines Fix name. ........ r52211 | andrew.kuchling | 2006-10-06 15:18:26 +0200 (Fri, 06 Oct 2006) | 1 line [Bug #1545341] Allow 'classifier' parameter to be a tuple as well as a list. Will backport. ........ r52212 | armin.rigo | 2006-10-06 18:33:22 +0200 (Fri, 06 Oct 2006) | 4 lines A very minor bug fix: this code looks like it is designed to accept any hue value and do the modulo itself, except it doesn't quite do it in all cases. At least, the "cannot get here" comment was wrong. ........ r52213 | andrew.kuchling | 2006-10-06 20:51:55 +0200 (Fri, 06 Oct 2006) | 1 line Comment grammar ........ r52218 | skip.montanaro | 2006-10-07 13:05:02 +0200 (Sat, 07 Oct 2006) | 6 lines Note that the excel_tab class is registered as the "excel-tab" dialect. Fixes 1572471. Make a similar change for the excel class and clean up references to the Dialects and Formatting Parameters section in a few places. ........ r52221 | georg.brandl | 2006-10-08 09:11:54 +0200 (Sun, 08 Oct 2006) | 3 lines Add missing NEWS entry for rev. 52129. ........ r52223 | hyeshik.chang | 2006-10-08 15:48:34 +0200 (Sun, 08 Oct 2006) | 3 lines Bug #1572832: fix a bug in ISO-2022 codecs which may cause segfault when encoding non-BMP unicode characters. (Submitted by Ray Chason) ........ r52227 | ronald.oussoren | 2006-10-08 19:37:58 +0200 (Sun, 08 Oct 2006) | 4 lines Add version number to the link to the python documentation in /Developer/Documentation/Python, better for users that install multiple versions of python. ........ r52229 | ronald.oussoren | 2006-10-08 19:40:02 +0200 (Sun, 08 Oct 2006) | 2 lines Fix for bug #1570284 ........ r52233 | ronald.oussoren | 2006-10-08 19:49:52 +0200 (Sun, 08 Oct 2006) | 6 lines MacOSX: distutils changes the values of BASECFLAGS and LDFLAGS when using a universal build of python on OSX 10.3 to ensure that those flags can be used to compile code (the universal build uses compiler flags that aren't supported on 10.3). This patches gives the same treatment to CFLAGS, PY_CFLAGS and BLDSHARED. ........ r52236 | ronald.oussoren | 2006-10-08 19:51:46 +0200 (Sun, 08 Oct 2006) | 5 lines MacOSX: The universal build requires that users have the MacOSX10.4u SDK installed to build extensions. This patch makes distutils emit a warning when the compiler should use an SDK but that SDK is not installed, hopefully reducing some confusion. ........ r52238 | ronald.oussoren | 2006-10-08 20:18:26 +0200 (Sun, 08 Oct 2006) | 3 lines MacOSX: add more logic to recognize the correct startup file to patch to the shell profile patching post-install script. ........ r52242 | andrew.kuchling | 2006-10-09 19:10:12 +0200 (Mon, 09 Oct 2006) | 1 line Add news item for rev. 52211 change ........ r52245 | andrew.kuchling | 2006-10-09 20:05:19 +0200 (Mon, 09 Oct 2006) | 1 line Fix wording in comment ........ r52251 | georg.brandl | 2006-10-09 21:03:06 +0200 (Mon, 09 Oct 2006) | 2 lines Patch #1572724: fix typo ('=' instead of '==') in _msi.c. ........ r52255 | barry.warsaw | 2006-10-09 21:43:24 +0200 (Mon, 09 Oct 2006) | 2 lines List gc.get_count() in the module docstring. ........ r52257 | martin.v.loewis | 2006-10-09 22:44:25 +0200 (Mon, 09 Oct 2006) | 1 line Bug #1565150: Fix subsecond processing for os.utime on Windows. ........ r52268 | ronald.oussoren | 2006-10-10 09:55:06 +0200 (Tue, 10 Oct 2006) | 2 lines MacOSX: fix permission problem in the generated installer ........ r52293 | georg.brandl | 2006-10-12 09:38:04 +0200 (Thu, 12 Oct 2006) | 2 lines Bug #1575746: fix typo in property() docs. ........ r52295 | georg.brandl | 2006-10-12 09:57:21 +0200 (Thu, 12 Oct 2006) | 3 lines Bug #813342: Start the IDLE subprocess with -Qnew if the parent is started with that option. ........ r52297 | georg.brandl | 2006-10-12 10:22:53 +0200 (Thu, 12 Oct 2006) | 2 lines Bug #1565919: document set types in the Language Reference. ........ r52299 | georg.brandl | 2006-10-12 11:20:33 +0200 (Thu, 12 Oct 2006) | 3 lines Bug #1550524: better heuristics to find correct class definition in inspect.findsource(). ........ r52301 | georg.brandl | 2006-10-12 11:47:12 +0200 (Thu, 12 Oct 2006) | 4 lines Bug #1548891: The cStringIO.StringIO() constructor now encodes unicode arguments with the system default encoding just like the write() method does, instead of converting it to a raw buffer. ........ r52303 | georg.brandl | 2006-10-12 13:14:40 +0200 (Thu, 12 Oct 2006) | 2 lines Bug #1546628: add a note about urlparse.urljoin() and absolute paths. ........ r52305 | georg.brandl | 2006-10-12 13:27:59 +0200 (Thu, 12 Oct 2006) | 3 lines Bug #1545497: when given an explicit base, int() did ignore NULs embedded in the string to convert. ........ r52307 | georg.brandl | 2006-10-12 13:41:11 +0200 (Thu, 12 Oct 2006) | 3 lines Add a note to fpectl docs that it's not built by default (bug #1556261). ........ r52309 | georg.brandl | 2006-10-12 13:46:57 +0200 (Thu, 12 Oct 2006) | 3 lines Bug #1560114: the Mac filesystem does have accurate information about the case of filenames. ........ r52311 | georg.brandl | 2006-10-12 13:59:27 +0200 (Thu, 12 Oct 2006) | 2 lines Small grammar fix, thanks Sjoerd. ........ r52313 | georg.brandl | 2006-10-12 14:03:07 +0200 (Thu, 12 Oct 2006) | 2 lines Fix tarfile depending on buggy int('1\0', base) behavior. ........ r52315 | georg.brandl | 2006-10-12 14:33:07 +0200 (Thu, 12 Oct 2006) | 2 lines Bug #1283491: follow docstring convention wrt. keyword-able args in sum(). ........ r52316 | georg.brandl | 2006-10-12 15:08:16 +0200 (Thu, 12 Oct 2006) | 3 lines Bug #1560179: speed up posixpath.(dir|base)name ........ r52327 | brett.cannon | 2006-10-14 08:36:45 +0200 (Sat, 14 Oct 2006) | 3 lines Clean up the language of a sentence relating to the connect() function and user-defined datatypes. ........ r52332 | neal.norwitz | 2006-10-14 23:33:38 +0200 (Sat, 14 Oct 2006) | 3 lines Update the peephole optimizer to remove more dead code (jumps after returns) and inline jumps to returns. ........ r52333 | martin.v.loewis | 2006-10-15 09:54:40 +0200 (Sun, 15 Oct 2006) | 4 lines Patch #1576954: Update VC6 build directory; remove redundant files in VC7. Will backport to 2.5. ........ r52335 | martin.v.loewis | 2006-10-15 10:43:33 +0200 (Sun, 15 Oct 2006) | 1 line Patch #1576166: Support os.utime for directories on Windows NT+. ........ r52336 | martin.v.loewis | 2006-10-15 10:51:22 +0200 (Sun, 15 Oct 2006) | 2 lines Patch #1577551: Add ctypes and ET build support for VC6. Will backport to 2.5. ........ r52338 | martin.v.loewis | 2006-10-15 11:35:51 +0200 (Sun, 15 Oct 2006) | 1 line Loosen the test for equal time stamps. ........ r52339 | martin.v.loewis | 2006-10-15 11:43:39 +0200 (Sun, 15 Oct 2006) | 2 lines Bug #1567666: Emulate GetFileAttributesExA for Win95. Will backport to 2.5. ........ r52341 | martin.v.loewis | 2006-10-15 13:02:07 +0200 (Sun, 15 Oct 2006) | 2 lines Round to int, because some systems support sub-second time stamps in stat, but not in utime. Also be consistent with modifying only mtime, not atime. ........ r52342 | martin.v.loewis | 2006-10-15 13:57:40 +0200 (Sun, 15 Oct 2006) | 2 lines Set the eol-style for project files to "CRLF". ........ r52343 | martin.v.loewis | 2006-10-15 13:59:56 +0200 (Sun, 15 Oct 2006) | 3 lines Drop binary property on dsp files, set eol-style to CRLF instead. ........ r52344 | martin.v.loewis | 2006-10-15 14:01:43 +0200 (Sun, 15 Oct 2006) | 2 lines Remove binary property, set eol-style to CRLF instead. ........ r52346 | martin.v.loewis | 2006-10-15 16:30:38 +0200 (Sun, 15 Oct 2006) | 2 lines Mention the bdist_msi module. Will backport to 2.5. ........ r52354 | brett.cannon | 2006-10-16 05:09:52 +0200 (Mon, 16 Oct 2006) | 3 lines Fix turtle so that you can launch the demo2 function on its own instead of only when the module is launched as a script. ........ r52356 | martin.v.loewis | 2006-10-17 17:18:06 +0200 (Tue, 17 Oct 2006) | 2 lines Patch #1457736: Update VC6 to use current PCbuild settings. Will backport to 2.5. ........ r52360 | martin.v.loewis | 2006-10-17 20:09:55 +0200 (Tue, 17 Oct 2006) | 2 lines Remove obsolete file. Will backport. ........ r52363 | martin.v.loewis | 2006-10-17 20:59:23 +0200 (Tue, 17 Oct 2006) | 4 lines Forward-port r52358: - Bug #1578513: Cross compilation was broken by a change to configure. Repair so that it's back to how it was in 2.4.3. ........ r52365 | thomas.heller | 2006-10-17 21:30:48 +0200 (Tue, 17 Oct 2006) | 6 lines ctypes callback functions only support 'fundamental' result types. Check this and raise an error when something else is used - before this change ctypes would hang or crash when such a callback was called. This is a partial fix for #1574584. Will backport to release25-maint. ........ r52377 | tim.peters | 2006-10-18 07:06:06 +0200 (Wed, 18 Oct 2006) | 2 lines newIobject(): repaired incorrect cast to quiet MSVC warning. ........ r52378 | tim.peters | 2006-10-18 07:09:12 +0200 (Wed, 18 Oct 2006) | 2 lines Whitespace normalization. ........ r52379 | tim.peters | 2006-10-18 07:10:28 +0200 (Wed, 18 Oct 2006) | 2 lines Add missing svn:eol-style to text files. ........ r52387 | martin.v.loewis | 2006-10-19 12:58:46 +0200 (Thu, 19 Oct 2006) | 3 lines Add check for the PyArg_ParseTuple format, and declare it if it is supported. ........ r52388 | martin.v.loewis | 2006-10-19 13:00:37 +0200 (Thu, 19 Oct 2006) | 3 lines Fix various minor errors in passing arguments to PyArg_ParseTuple. ........ r52389 | martin.v.loewis | 2006-10-19 18:01:37 +0200 (Thu, 19 Oct 2006) | 2 lines Restore CFLAGS after checking for __attribute__ ........ r52390 | andrew.kuchling | 2006-10-19 23:55:55 +0200 (Thu, 19 Oct 2006) | 1 line [Bug #1576348] Fix typo in example ........ r52414 | walter.doerwald | 2006-10-22 10:59:41 +0200 (Sun, 22 Oct 2006) | 2 lines Port test___future__ to unittest. ........ r52415 | ronald.oussoren | 2006-10-22 12:45:18 +0200 (Sun, 22 Oct 2006) | 3 lines Patch #1580674: with this patch os.readlink uses the filesystem encoding to decode unicode objects and returns an unicode object when the argument is one. ........ r52416 | martin.v.loewis | 2006-10-22 12:46:18 +0200 (Sun, 22 Oct 2006) | 3 lines Patch #1580872: Remove duplicate declaration of PyCallable_Check. Will backport to 2.5. ........ r52418 | martin.v.loewis | 2006-10-22 12:55:15 +0200 (Sun, 22 Oct 2006) | 4 lines - Patch #1560695: Add .note.GNU-stack to ctypes' sysv.S so that ctypes isn't considered as requiring executable stacks. Will backport to 2.5. ........ r52420 | martin.v.loewis | 2006-10-22 15:45:13 +0200 (Sun, 22 Oct 2006) | 3 lines Remove passwd.adjunct.byname from list of maps for test_nis. Will backport to 2.5. ........ r52431 | georg.brandl | 2006-10-24 18:54:16 +0200 (Tue, 24 Oct 2006) | 2 lines Patch [ 1583506 ] tarfile.py: 100-char filenames are truncated ........ r52446 | andrew.kuchling | 2006-10-26 21:10:46 +0200 (Thu, 26 Oct 2006) | 1 line [Bug #1579796] Wrong syntax for PyDateTime_IMPORT in documentation. Reported by David Faure. ........ r52449 | andrew.kuchling | 2006-10-26 21:16:46 +0200 (Thu, 26 Oct 2006) | 1 line Typo fix ........ r52452 | martin.v.loewis | 2006-10-27 08:16:31 +0200 (Fri, 27 Oct 2006) | 3 lines Patch #1549049: Rewrite type conversion in structmember. Fixes #1545696 and #1566140. Will backport to 2.5. ........ r52454 | martin.v.loewis | 2006-10-27 08:42:27 +0200 (Fri, 27 Oct 2006) | 2 lines Check for values.h. Will backport. ........ r52456 | martin.v.loewis | 2006-10-27 09:06:52 +0200 (Fri, 27 Oct 2006) | 2 lines Get DBL_MAX from float.h not values.h. Will backport. ........ r52458 | martin.v.loewis | 2006-10-27 09:13:28 +0200 (Fri, 27 Oct 2006) | 2 lines Patch #1567274: Support SMTP over TLS. ........ r52459 | andrew.kuchling | 2006-10-27 13:33:29 +0200 (Fri, 27 Oct 2006) | 1 line Set svn:keywords property ........ r52460 | andrew.kuchling | 2006-10-27 13:36:41 +0200 (Fri, 27 Oct 2006) | 1 line Add item ........ r52461 | andrew.kuchling | 2006-10-27 13:37:01 +0200 (Fri, 27 Oct 2006) | 1 line Some wording changes and markup fixes ........ r52462 | andrew.kuchling | 2006-10-27 14:18:38 +0200 (Fri, 27 Oct 2006) | 1 line [Bug #1585690] Note that line_num was added in Python 2.5 ........ r52464 | andrew.kuchling | 2006-10-27 14:50:38 +0200 (Fri, 27 Oct 2006) | 1 line [Bug #1583946] Reword description of server and issuer ........ r52466 | andrew.kuchling | 2006-10-27 15:06:25 +0200 (Fri, 27 Oct 2006) | 1 line [Bug #1562583] Mention the set_reuse_addr() method ........ r52469 | andrew.kuchling | 2006-10-27 15:22:46 +0200 (Fri, 27 Oct 2006) | 4 lines [Bug #1542016] Report PCALL_POP value. This makes the return value of sys.callstats() match its docstring. Backport candidate. Though it's an API change, this is a pretty obscure portion of the API. ........ r52473 | andrew.kuchling | 2006-10-27 16:53:41 +0200 (Fri, 27 Oct 2006) | 1 line Point users to the subprocess module in the docs for os.system, os.spawn*, os.popen2, and the popen2 and commands modules ........ r52476 | andrew.kuchling | 2006-10-27 18:39:10 +0200 (Fri, 27 Oct 2006) | 1 line [Bug #1576241] Let functools.wraps work with built-in functions ........ r52478 | andrew.kuchling | 2006-10-27 18:55:34 +0200 (Fri, 27 Oct 2006) | 1 line [Bug #1575506] The _singlefileMailbox class was using the wrong file object in its flush() method, causing an error ........ r52480 | andrew.kuchling | 2006-10-27 19:06:16 +0200 (Fri, 27 Oct 2006) | 1 line Clarify docstring ........ r52481 | andrew.kuchling | 2006-10-27 19:11:23 +0200 (Fri, 27 Oct 2006) | 5 lines [Patch #1574068 by Scott Dial] urllib and urllib2 were using base64.encodestring() for encoding authentication data. encodestring() can include newlines for very long input, which produced broken HTTP headers. ........ r52483 | andrew.kuchling | 2006-10-27 20:13:46 +0200 (Fri, 27 Oct 2006) | 1 line Check db_setup_debug for a few print statements; change sqlite_setup_debug to False ........ r52484 | andrew.kuchling | 2006-10-27 20:15:02 +0200 (Fri, 27 Oct 2006) | 1 line [Patch #1503717] Tiny patch from Chris AtLee to stop a lengthy line from being printed ........ r52485 | thomas.heller | 2006-10-27 20:31:36 +0200 (Fri, 27 Oct 2006) | 5 lines WindowsError.str should display the windows error code, not the posix error code; with test. Fixes #1576174. Will backport to release25-maint. ........ r52487 | thomas.heller | 2006-10-27 21:05:53 +0200 (Fri, 27 Oct 2006) | 4 lines Modulefinder now handles absolute and relative imports, including tests. Will backport to release25-maint. ........ r52488 | georg.brandl | 2006-10-27 22:39:43 +0200 (Fri, 27 Oct 2006) | 2 lines Patch #1552024: add decorator support to unparse.py demo script. ........ r52492 | walter.doerwald | 2006-10-28 12:47:12 +0200 (Sat, 28 Oct 2006) | 2 lines Port test_bufio to unittest. ........ r52493 | georg.brandl | 2006-10-28 15:10:17 +0200 (Sat, 28 Oct 2006) | 6 lines Convert test_global, test_scope and test_grammar to unittest. I tried to enclose all tests which must be run at the toplevel (instead of inside a method) in exec statements. ........ r52494 | georg.brandl | 2006-10-28 15:11:41 +0200 (Sat, 28 Oct 2006) | 3 lines Update outstanding bugs test file. ........ r52495 | georg.brandl | 2006-10-28 15:51:49 +0200 (Sat, 28 Oct 2006) | 3 lines Convert test_math to unittest. ........ r52496 | georg.brandl | 2006-10-28 15:56:58 +0200 (Sat, 28 Oct 2006) | 3 lines Convert test_opcodes to unittest. ........ r52497 | georg.brandl | 2006-10-28 18:04:04 +0200 (Sat, 28 Oct 2006) | 2 lines Fix nth() itertool recipe. ........ r52500 | georg.brandl | 2006-10-28 22:25:09 +0200 (Sat, 28 Oct 2006) | 2 lines make test_grammar pass with python -O ........ r52501 | neal.norwitz | 2006-10-28 23:15:30 +0200 (Sat, 28 Oct 2006) | 6 lines Add some asserts. In sysmodule, I think these were to try to silence some warnings from Klokwork. They verify the assumptions of the format of svn version output. The assert in the thread module helped debug a problem on HP-UX. ........ r52502 | neal.norwitz | 2006-10-28 23:16:54 +0200 (Sat, 28 Oct 2006) | 5 lines Fix warnings with HP's C compiler. It doesn't recognize that infinite loops are, um, infinite. These conditions should not be able to happen. Will backport. ........ r52503 | neal.norwitz | 2006-10-28 23:17:51 +0200 (Sat, 28 Oct 2006) | 5 lines Fix crash in test on HP-UX. Apparently, it's not possible to delete a lock if it's held (even by the current thread). Will backport. ........ r52504 | neal.norwitz | 2006-10-28 23:19:07 +0200 (Sat, 28 Oct 2006) | 6 lines Fix bug #1565514, SystemError not raised on too many nested blocks. It seems like this should be a different error than SystemError, but I don't have any great ideas and SystemError was raised in 2.4 and earlier. Will backport. ........ r52505 | neal.norwitz | 2006-10-28 23:20:12 +0200 (Sat, 28 Oct 2006) | 4 lines Prevent crash if alloc of garbage fails. Found by Typo.pl. Will backport. ........ r52506 | neal.norwitz | 2006-10-28 23:21:00 +0200 (Sat, 28 Oct 2006) | 4 lines Don't inline Py_ADDRESS_IN_RANGE with gcc 4+ either. Will backport. ........ r52513 | neal.norwitz | 2006-10-28 23:56:49 +0200 (Sat, 28 Oct 2006) | 2 lines Fix test_modulefinder so it doesn't fail when run after test_distutils. ........ r52514 | neal.norwitz | 2006-10-29 00:12:26 +0200 (Sun, 29 Oct 2006) | 4 lines From SF 1557890, fix problem of using wrong type in example. Will backport. ........ r52517 | georg.brandl | 2006-10-29 09:39:22 +0100 (Sun, 29 Oct 2006) | 4 lines Fix codecs.EncodedFile which did not use file_encoding in 2.5.0, and fix all codecs file wrappers to work correctly with the "with" statement (bug #1586513). ........ r52519 | georg.brandl | 2006-10-29 09:47:08 +0100 (Sun, 29 Oct 2006) | 3 lines Clean up a leftover from old listcomp generation code. ........ r52520 | georg.brandl | 2006-10-29 09:53:06 +0100 (Sun, 29 Oct 2006) | 4 lines Bug #1586448: the compiler module now emits the same bytecode for list comprehensions as the builtin compiler, using the LIST_APPEND opcode. ........ r52521 | georg.brandl | 2006-10-29 10:01:01 +0100 (Sun, 29 Oct 2006) | 3 lines Remove trailing comma. ........ r52522 | georg.brandl | 2006-10-29 10:05:04 +0100 (Sun, 29 Oct 2006) | 3 lines Bug #1357915: allow all sequence types for shell arguments in subprocess. ........ r52524 | georg.brandl | 2006-10-29 10:16:12 +0100 (Sun, 29 Oct 2006) | 3 lines Patch #1583880: fix tarfile's problems with long names and posix/ GNU modes. ........ r52526 | georg.brandl | 2006-10-29 10:18:00 +0100 (Sun, 29 Oct 2006) | 3 lines Test assert if __debug__ is true. ........ r52527 | georg.brandl | 2006-10-29 10:32:16 +0100 (Sun, 29 Oct 2006) | 2 lines Fix the new EncodedFile test to work with big endian platforms. ........ r52529 | georg.brandl | 2006-10-29 15:39:09 +0100 (Sun, 29 Oct 2006) | 2 lines Bug #1586613: fix zlib and bz2 codecs' incremental en/decoders. ........ r52532 | georg.brandl | 2006-10-29 19:01:08 +0100 (Sun, 29 Oct 2006) | 2 lines Bug #1586773: extend hashlib docstring. ........ r52534 | neal.norwitz | 2006-10-29 19:30:10 +0100 (Sun, 29 Oct 2006) | 4 lines Update comments, remove commented out code. Move assembler structure next to assembler code to make it easier to move it to a separate file. ........ r52535 | georg.brandl | 2006-10-29 19:31:42 +0100 (Sun, 29 Oct 2006) | 3 lines Bug #1576657: when setting a KeyError for a tuple key, make sure that the tuple isn't used as the "exception arguments tuple". ........ r52537 | georg.brandl | 2006-10-29 20:13:40 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_mmap to unittest. ........ r52538 | georg.brandl | 2006-10-29 20:20:45 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_poll to unittest. ........ r52539 | georg.brandl | 2006-10-29 20:24:43 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_nis to unittest. ........ r52540 | georg.brandl | 2006-10-29 20:35:03 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_types to unittest. ........ r52541 | georg.brandl | 2006-10-29 20:51:16 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_cookie to unittest. ........ r52542 | georg.brandl | 2006-10-29 21:09:12 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_cgi to unittest. ........ r52543 | georg.brandl | 2006-10-29 21:24:01 +0100 (Sun, 29 Oct 2006) | 3 lines Completely convert test_httplib to unittest. ........ r52544 | georg.brandl | 2006-10-29 21:28:26 +0100 (Sun, 29 Oct 2006) | 2 lines Convert test_MimeWriter to unittest. ........ r52545 | georg.brandl | 2006-10-29 21:31:17 +0100 (Sun, 29 Oct 2006) | 3 lines Convert test_openpty to unittest. ........ r52546 | georg.brandl | 2006-10-29 21:35:12 +0100 (Sun, 29 Oct 2006) | 3 lines Remove leftover test output file. ........ r52547 | georg.brandl | 2006-10-29 22:54:18 +0100 (Sun, 29 Oct 2006) | 3 lines Move the check for openpty to the beginning. ........ r52548 | walter.doerwald | 2006-10-29 23:06:28 +0100 (Sun, 29 Oct 2006) | 2 lines Add tests for basic argument errors. ........ r52549 | walter.doerwald | 2006-10-30 00:02:27 +0100 (Mon, 30 Oct 2006) | 3 lines Add tests for incremental codecs with an errors argument. ........ r52550 | neal.norwitz | 2006-10-30 00:39:03 +0100 (Mon, 30 Oct 2006) | 1 line Fix refleak ........ r52552 | neal.norwitz | 2006-10-30 00:58:36 +0100 (Mon, 30 Oct 2006) | 1 line I'm assuming this is correct, it fixes the tests so they pass again ........ r52555 | vinay.sajip | 2006-10-31 18:32:37 +0100 (Tue, 31 Oct 2006) | 1 line Change to improve speed of _fixupChildren ........ r52556 | vinay.sajip | 2006-10-31 18:34:31 +0100 (Tue, 31 Oct 2006) | 1 line Added relativeCreated to Formatter doc (has been in the system for a long time - was unaccountably left out of the docs and not noticed until now). ........ r52588 | thomas.heller | 2006-11-02 20:48:24 +0100 (Thu, 02 Nov 2006) | 5 lines Replace the XXX marker in the 'Arrays and pointers' reference manual section with a link to the tutorial sections. Will backport to release25-maint. ........ r52592 | thomas.heller | 2006-11-02 21:22:29 +0100 (Thu, 02 Nov 2006) | 6 lines Fix a code example by adding a missing import. Fixes #1557890. Will backport to release25-maint. ........ r52598 | tim.peters | 2006-11-03 03:32:46 +0100 (Fri, 03 Nov 2006) | 2 lines Whitespace normalization. ........ r52619 | martin.v.loewis | 2006-11-04 19:14:06 +0100 (Sat, 04 Nov 2006) | 4 lines - Patch #1060577: Extract list of RPM files from spec file in bdist_rpm Will backport to 2.5. ........ r52621 | neal.norwitz | 2006-11-04 20:25:22 +0100 (Sat, 04 Nov 2006) | 4 lines Bug #1588287: fix invalid assertion for `1,2` in debug builds. Will backport ........ r52630 | andrew.kuchling | 2006-11-05 22:04:37 +0100 (Sun, 05 Nov 2006) | 1 line Update link ........ r52631 | skip.montanaro | 2006-11-06 15:34:52 +0100 (Mon, 06 Nov 2006) | 1 line note that user can control directory location even if default dir is used ........ r52644 | ronald.oussoren | 2006-11-07 16:53:38 +0100 (Tue, 07 Nov 2006) | 2 lines Fix a number of typos in strings and comments (sf#1589070) ........ r52647 | ronald.oussoren | 2006-11-07 17:00:34 +0100 (Tue, 07 Nov 2006) | 2 lines Whitespace changes to make the source more compliant with PEP8 (SF#1589070) ........ r52651 | thomas.heller | 2006-11-07 19:01:18 +0100 (Tue, 07 Nov 2006) | 3 lines Fix markup. Will backport to release25-maint. ........ r52653 | thomas.heller | 2006-11-07 19:20:47 +0100 (Tue, 07 Nov 2006) | 3 lines Fix grammatical error as well. Will backport to release25-maint. ........ r52657 | andrew.kuchling | 2006-11-07 21:39:16 +0100 (Tue, 07 Nov 2006) | 1 line Add missing word ........ r52662 | martin.v.loewis | 2006-11-08 07:46:37 +0100 (Wed, 08 Nov 2006) | 4 lines Correctly forward exception in instance_contains(). Fixes #1591996. Patch contributed by Neal Norwitz. Will backport. ........ r52664 | martin.v.loewis | 2006-11-08 07:48:36 +0100 (Wed, 08 Nov 2006) | 2 lines News entry for 52662. ........ r52665 | martin.v.loewis | 2006-11-08 08:35:55 +0100 (Wed, 08 Nov 2006) | 2 lines Patch #1351744: Add askyesnocancel helper for tkMessageBox. ........ r52666 | georg.brandl | 2006-11-08 08:45:59 +0100 (Wed, 08 Nov 2006) | 2 lines Patch #1592072: fix docs for return value of PyErr_CheckSignals. ........ r52668 | georg.brandl | 2006-11-08 11:04:29 +0100 (Wed, 08 Nov 2006) | 3 lines Bug #1592533: rename variable in heapq doc example, to avoid shadowing "sorted". ........ r52671 | andrew.kuchling | 2006-11-08 14:35:34 +0100 (Wed, 08 Nov 2006) | 1 line Add section on the functional module ........ r52672 | andrew.kuchling | 2006-11-08 15:14:30 +0100 (Wed, 08 Nov 2006) | 1 line Add section on operator module; make a few edits ........ r52673 | andrew.kuchling | 2006-11-08 15:24:03 +0100 (Wed, 08 Nov 2006) | 1 line Add table of contents; this required fixing a few headings. Some more smalle edits. ........ r52674 | andrew.kuchling | 2006-11-08 15:30:14 +0100 (Wed, 08 Nov 2006) | 1 line More edits ........ r52686 | martin.v.loewis | 2006-11-09 12:06:03 +0100 (Thu, 09 Nov 2006) | 3 lines Patch #838546: Make terminal become controlling in pty.fork(). Will backport to 2.5. ........ r52688 | martin.v.loewis | 2006-11-09 12:27:32 +0100 (Thu, 09 Nov 2006) | 2 lines Patch #1592250: Add elidge argument to Tkinter.Text.search. ........ r52690 | andrew.kuchling | 2006-11-09 14:27:07 +0100 (Thu, 09 Nov 2006) | 7 lines [Bug #1569790] mailbox.Maildir.get_folder() loses factory information Both the Maildir and MH classes had this bug; the patch fixes both classes and adds a test. Will backport to 25-maint. ........ r52692 | andrew.kuchling | 2006-11-09 14:51:14 +0100 (Thu, 09 Nov 2006) | 1 line [Patch #1514544 by David Watson] use fsync() to ensure data is really on disk ........ r52695 | walter.doerwald | 2006-11-09 17:23:26 +0100 (Thu, 09 Nov 2006) | 2 lines Replace C++ comment with C comment (fixes SF bug #1593525). ........ r52712 | andrew.kuchling | 2006-11-09 22:16:46 +0100 (Thu, 09 Nov 2006) | 11 lines [Patch #1514543] mailbox (Maildir): avoid losing messages on name clash Two changes: Where possible, use link()/remove() to move files into a directory; this makes it easier to avoid overwriting an existing file. Use _create_carefully() to create files in tmp/, which uses O_EXCL. Backport candidate. ........ r52716 | phillip.eby | 2006-11-10 01:33:36 +0100 (Fri, 10 Nov 2006) | 4 lines Fix SF#1566719: not creating site-packages (or other target directory) when installing .egg-info for a project that contains no modules or packages, while using --root (as in bdist_rpm). ........ r52719 | andrew.kuchling | 2006-11-10 14:14:01 +0100 (Fri, 10 Nov 2006) | 1 line Reword entry ........ r52725 | andrew.kuchling | 2006-11-10 15:39:01 +0100 (Fri, 10 Nov 2006) | 1 line [Feature request #1542920] Link to wsgi.org ........ r52731 | georg.brandl | 2006-11-11 19:29:11 +0100 (Sat, 11 Nov 2006) | 2 lines Bug #1594742: wrong word in stringobject doc. ........ r52733 | georg.brandl | 2006-11-11 19:32:47 +0100 (Sat, 11 Nov 2006) | 2 lines Bug #1594758: wording improvement for dict.update() docs. ........ r52736 | martin.v.loewis | 2006-11-12 11:32:47 +0100 (Sun, 12 Nov 2006) | 3 lines Patch #1065257: Support passing open files as body in HTTPConnection.request(). ........ r52737 | martin.v.loewis | 2006-11-12 11:41:39 +0100 (Sun, 12 Nov 2006) | 2 lines Patch #1355023: support whence argument for GzipFile.seek. ........ r52738 | martin.v.loewis | 2006-11-12 19:24:26 +0100 (Sun, 12 Nov 2006) | 2 lines Bug #1067760: Deprecate passing floats to file.seek. ........ r52739 | martin.v.loewis | 2006-11-12 19:48:13 +0100 (Sun, 12 Nov 2006) | 3 lines Patch #1359217: Ignore 2xx response before 150 response. Will backport to 2.5. ........ r52741 | martin.v.loewis | 2006-11-12 19:56:03 +0100 (Sun, 12 Nov 2006) | 4 lines Patch #1360200: Use unmangled_version RPM spec field to deal with file name mangling. Will backport to 2.5. ........ r52753 | walter.doerwald | 2006-11-15 17:23:46 +0100 (Wed, 15 Nov 2006) | 2 lines Fix typo. ........ r52754 | georg.brandl | 2006-11-15 18:42:03 +0100 (Wed, 15 Nov 2006) | 2 lines Bug #1594809: add a note to README regarding PYTHONPATH and make install. ........ r52762 | georg.brandl | 2006-11-16 16:05:14 +0100 (Thu, 16 Nov 2006) | 2 lines Bug #1597576: mention that the new base64 api has been introduced in py2.4. ........ r52764 | georg.brandl | 2006-11-16 17:50:59 +0100 (Thu, 16 Nov 2006) | 3 lines Bug #1597824: return the registered function from atexit.register() to facilitate usage as a decorator. ........ r52765 | georg.brandl | 2006-11-16 18:08:45 +0100 (Thu, 16 Nov 2006) | 4 lines Bug #1588217: don't parse "= " as a soft line break in binascii's a2b_qp() function, instead leave it in the string as quopri.decode() does. ........ r52776 | andrew.kuchling | 2006-11-17 14:30:25 +0100 (Fri, 17 Nov 2006) | 17 lines Remove file-locking in MH.pack() method. This change looks massive but it's mostly a re-indenting after removing some try...finally blocks. Also adds a test case that does a pack() while the mailbox is locked; this test would have turned up bugs in the original code on some platforms. In both nmh and GNU Mailutils' implementation of MH-format mailboxes, no locking is done of individual message files when renaming them. The original mailbox.py code did do locking, which meant that message files had to be opened. This code was buggy on certain platforms (found through reading the code); there were code paths that closed the file object and then called _unlock_file() on it. Will backport to 25-maint once I see how the buildbots react to this patch. ........ r52780 | martin.v.loewis | 2006-11-18 19:00:23 +0100 (Sat, 18 Nov 2006) | 5 lines Patch #1538878: Don't make tkSimpleDialog dialogs transient if the parent window is withdrawn. This mirrors what dialog.tcl does. Will backport to 2.5. ........ r52782 | martin.v.loewis | 2006-11-18 19:05:35 +0100 (Sat, 18 Nov 2006) | 4 lines Patch #1594554: Always close a tkSimpleDialog on ok(), even if an exception occurs. Will backport to 2.5. ........ r52784 | martin.v.loewis | 2006-11-18 19:42:11 +0100 (Sat, 18 Nov 2006) | 3 lines Patch #1472877: Fix Tix subwidget name resolution. Will backport to 2.5. ........ r52786 | andrew.kuchling | 2006-11-18 23:17:33 +0100 (Sat, 18 Nov 2006) | 1 line Expand checking in test_sha ........ r52787 | georg.brandl | 2006-11-19 09:48:30 +0100 (Sun, 19 Nov 2006) | 3 lines Patch [ 1586791 ] better error msgs for some TypeErrors ........ r52788 | martin.v.loewis | 2006-11-19 11:41:41 +0100 (Sun, 19 Nov 2006) | 4 lines Make cStringIO.truncate raise IOError for negative arguments (even for -1). Fixes the last bit of #1359365. ........ r52789 | andrew.kuchling | 2006-11-19 19:40:01 +0100 (Sun, 19 Nov 2006) | 1 line Add a test case of data w/ bytes > 127 ........ r52790 | martin.v.loewis | 2006-11-19 19:51:54 +0100 (Sun, 19 Nov 2006) | 3 lines Patch #1070046: Marshal new-style objects like InstanceType in xmlrpclib. ........ r52792 | neal.norwitz | 2006-11-19 22:26:53 +0100 (Sun, 19 Nov 2006) | 4 lines Speed up function calls into the math module by using METH_O. There should be no functional changes. However, the error msgs are slightly different. Also verified that the module dict is not NULL on init. ........ r52794 | george.yoshida | 2006-11-20 03:24:48 +0100 (Mon, 20 Nov 2006) | 2 lines markup fix ........ r52795 | georg.brandl | 2006-11-20 08:12:58 +0100 (Mon, 20 Nov 2006) | 3 lines Further markup fix. ........ r52800 | andrew.kuchling | 2006-11-20 14:39:37 +0100 (Mon, 20 Nov 2006) | 2 lines Jython compatibility fix: if uu.decode() opened its output file, be sure to close it. ........ r52811 | neal.norwitz | 2006-11-21 06:26:22 +0100 (Tue, 21 Nov 2006) | 9 lines Bug #1599782: Fix segfault on bsddb.db.DB().type(). The problem is that _DB_get_type() can't be called without the GIL because it calls a bunch of PyErr_* APIs when an error occurs. There were no other cases in this file that it was called without the GIL. Removing the BEGIN/END THREAD around _DB_get_type() made everything work. Will backport. ........ r52814 | neal.norwitz | 2006-11-21 06:51:51 +0100 (Tue, 21 Nov 2006) | 1 line Oops, convert tabs to spaces ........ r52815 | neal.norwitz | 2006-11-21 07:23:44 +0100 (Tue, 21 Nov 2006) | 1 line Fix SF #1599879, socket.gethostname should ref getfqdn directly. ........ r52817 | martin.v.loewis | 2006-11-21 19:20:25 +0100 (Tue, 21 Nov 2006) | 4 lines Conditionalize definition of _CRT_SECURE_NO_DEPRECATE and _CRT_NONSTDC_NO_DEPRECATE. Will backport. ........ r52821 | martin.v.loewis | 2006-11-22 09:50:02 +0100 (Wed, 22 Nov 2006) | 4 lines Patch #1362975: Rework CodeContext indentation algorithm to avoid hard-coding pixel widths. Also make the text's scrollbar a child of the text frame, not the top widget. ........ r52826 | walter.doerwald | 2006-11-23 06:03:56 +0100 (Thu, 23 Nov 2006) | 3 lines Change decode() so that it works with a buffer (i.e. unicode(..., 'utf-8-sig')) SF bug #1601501. ........ r52833 | georg.brandl | 2006-11-23 10:55:07 +0100 (Thu, 23 Nov 2006) | 2 lines Bug #1601630: little improvement to getopt docs ........ r52835 | michael.hudson | 2006-11-23 14:54:04 +0100 (Thu, 23 Nov 2006) | 3 lines a test for an error condition not covered by existing tests (noticed this when writing the equivalent code for pypy) ........ r52839 | raymond.hettinger | 2006-11-23 22:06:03 +0100 (Thu, 23 Nov 2006) | 1 line Fix and/add typo ........ r52840 | raymond.hettinger | 2006-11-23 22:35:19 +0100 (Thu, 23 Nov 2006) | 1 line ... and the number of the counting shall be three. ........ r52841 | thomas.heller | 2006-11-24 19:45:39 +0100 (Fri, 24 Nov 2006) | 1 line Fix bug #1598620: A ctypes structure cannot contain itself. ........ r52843 | martin.v.loewis | 2006-11-25 16:39:19 +0100 (Sat, 25 Nov 2006) | 3 lines Disable _XOPEN_SOURCE on NetBSD 1.x. Will backport to 2.5 ........ r52845 | georg.brandl | 2006-11-26 20:27:47 +0100 (Sun, 26 Nov 2006) | 2 lines Bug #1603321: make pstats.Stats accept Unicode file paths. ........ r52850 | georg.brandl | 2006-11-27 19:46:21 +0100 (Mon, 27 Nov 2006) | 2 lines Bug #1603789: grammatical error in Tkinter docs. ........ r52855 | thomas.heller | 2006-11-28 21:21:54 +0100 (Tue, 28 Nov 2006) | 7 lines Fix #1563807: _ctypes built on AIX fails with ld ffi error. The contents of ffi_darwin.c must be compiled unless __APPLE__ is defined and __ppc__ is not. Will backport. ........ r52862 | armin.rigo | 2006-11-29 22:59:22 +0100 (Wed, 29 Nov 2006) | 3 lines Forgot a case where the locals can now be a general mapping instead of just a dictionary. (backporting...) ........ r52872 | guido.van.rossum | 2006-11-30 20:23:13 +0100 (Thu, 30 Nov 2006) | 2 lines Update version. ........ r52890 | walter.doerwald | 2006-12-01 17:59:47 +0100 (Fri, 01 Dec 2006) | 3 lines Move xdrlib tests from the module into a separate test script, port the tests to unittest and add a few new tests. ........ r52900 | raymond.hettinger | 2006-12-02 03:00:39 +0100 (Sat, 02 Dec 2006) | 1 line Add name to credits (for untokenize). ........ r52905 | martin.v.loewis | 2006-12-03 10:54:46 +0100 (Sun, 03 Dec 2006) | 2 lines Move IDLE news into NEWS.txt. ........ r52906 | martin.v.loewis | 2006-12-03 12:23:45 +0100 (Sun, 03 Dec 2006) | 4 lines Patch #1544279: Improve thread-safety of the socket module by moving the sock_addr_t storage out of the socket object. Will backport to 2.5. ........ r52908 | martin.v.loewis | 2006-12-03 13:01:53 +0100 (Sun, 03 Dec 2006) | 3 lines Patch #1371075: Make ConfigParser accept optional dict type for ordering, sorting, etc. ........ r52910 | matthias.klose | 2006-12-03 18:16:41 +0100 (Sun, 03 Dec 2006) | 2 lines - Fix build failure on kfreebsd and on the hurd. ........ r52915 | george.yoshida | 2006-12-04 12:41:54 +0100 (Mon, 04 Dec 2006) | 2 lines fix a versionchanged tag ........ r52917 | george.yoshida | 2006-12-05 06:39:50 +0100 (Tue, 05 Dec 2006) | 3 lines Fix pickle doc typo Patch #1608758 ........ r52938 | georg.brandl | 2006-12-06 23:21:18 +0100 (Wed, 06 Dec 2006) | 2 lines Patch #1610437: fix a tarfile bug with long filename headers. ........ r52945 | brett.cannon | 2006-12-07 00:38:48 +0100 (Thu, 07 Dec 2006) | 3 lines Fix a bad assumption that all objects assigned to '__loader__' on a module will have a '_files' attribute. ........ r52951 | georg.brandl | 2006-12-07 10:30:06 +0100 (Thu, 07 Dec 2006) | 3 lines RFE #1592899: mention string.maketrans() in docs for str.translate, remove reference to the old regex module in the former's doc. ........ r52962 | raymond.hettinger | 2006-12-08 04:17:18 +0100 (Fri, 08 Dec 2006) | 1 line Eliminate two redundant calls to PyObject_Hash(). ........ r52963 | raymond.hettinger | 2006-12-08 05:24:33 +0100 (Fri, 08 Dec 2006) | 3 lines Port Armin's fix for a dict resize vulnerability (svn revision 46589, sf bug 1456209). ........ r52964 | raymond.hettinger | 2006-12-08 05:57:50 +0100 (Fri, 08 Dec 2006) | 4 lines Port Georg's dictobject.c fix keys that were tuples got unpacked on the way to setting a KeyError (svn revision 52535, sf bug 1576657). ........ r52966 | raymond.hettinger | 2006-12-08 18:35:25 +0100 (Fri, 08 Dec 2006) | 2 lines Add test for SF bug 1576657 ........ r52970 | georg.brandl | 2006-12-08 21:46:11 +0100 (Fri, 08 Dec 2006) | 3 lines #1577756: svnversion doesn't react to LANG=C, use LC_ALL=C to force English output. ........ r52972 | georg.brandl | 2006-12-09 10:08:29 +0100 (Sat, 09 Dec 2006) | 3 lines Patch #1608267: fix a race condition in os.makedirs() is the directory to be created is already there. ........ r52975 | matthias.klose | 2006-12-09 13:15:27 +0100 (Sat, 09 Dec 2006) | 2 lines - Fix the build of the library reference in info format. ........ r52994 | neal.norwitz | 2006-12-11 02:01:06 +0100 (Mon, 11 Dec 2006) | 1 line Fix a typo ........ r52996 | georg.brandl | 2006-12-11 08:56:33 +0100 (Mon, 11 Dec 2006) | 2 lines Move errno imports back to individual functions. ........ r52998 | vinay.sajip | 2006-12-11 15:07:16 +0100 (Mon, 11 Dec 2006) | 1 line Patch by Jeremy Katz (SF #1609407) ........ r53000 | vinay.sajip | 2006-12-11 15:26:23 +0100 (Mon, 11 Dec 2006) | 1 line Patch by "cuppatea" (SF #1503765) ........
4112 lines
114 KiB
Python
4112 lines
114 KiB
Python
# Test enhancements related to descriptors and new-style classes
|
|
|
|
from test.test_support import verify, vereq, verbose, TestFailed, TESTFN, get_original_stdout
|
|
from copy import deepcopy
|
|
import warnings
|
|
|
|
warnings.filterwarnings("ignore",
|
|
r'complex divmod\(\), // and % are deprecated$',
|
|
DeprecationWarning, r'(<string>|%s)$' % __name__)
|
|
|
|
def veris(a, b):
|
|
if a is not b:
|
|
raise TestFailed, "%r is %r" % (a, b)
|
|
|
|
def testunop(a, res, expr="len(a)", meth="__len__"):
|
|
if verbose: print "checking", expr
|
|
dict = {'a': a}
|
|
vereq(eval(expr, dict), res)
|
|
t = type(a)
|
|
m = getattr(t, meth)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
vereq(m, t.__dict__[meth])
|
|
vereq(m(a), res)
|
|
bm = getattr(a, meth)
|
|
vereq(bm(), res)
|
|
|
|
def testbinop(a, b, res, expr="a+b", meth="__add__"):
|
|
if verbose: print "checking", expr
|
|
dict = {'a': a, 'b': b}
|
|
|
|
vereq(eval(expr, dict), res)
|
|
t = type(a)
|
|
m = getattr(t, meth)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
vereq(m, t.__dict__[meth])
|
|
vereq(m(a, b), res)
|
|
bm = getattr(a, meth)
|
|
vereq(bm(b), res)
|
|
|
|
def testternop(a, b, c, res, expr="a[b:c]", meth="__getslice__"):
|
|
if verbose: print "checking", expr
|
|
dict = {'a': a, 'b': b, 'c': c}
|
|
vereq(eval(expr, dict), res)
|
|
t = type(a)
|
|
m = getattr(t, meth)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
vereq(m, t.__dict__[meth])
|
|
vereq(m(a, b, c), res)
|
|
bm = getattr(a, meth)
|
|
vereq(bm(b, c), res)
|
|
|
|
def testsetop(a, b, res, stmt="a+=b", meth="__iadd__"):
|
|
if verbose: print "checking", stmt
|
|
dict = {'a': deepcopy(a), 'b': b}
|
|
exec(stmt, dict)
|
|
vereq(dict['a'], res)
|
|
t = type(a)
|
|
m = getattr(t, meth)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
vereq(m, t.__dict__[meth])
|
|
dict['a'] = deepcopy(a)
|
|
m(dict['a'], b)
|
|
vereq(dict['a'], res)
|
|
dict['a'] = deepcopy(a)
|
|
bm = getattr(dict['a'], meth)
|
|
bm(b)
|
|
vereq(dict['a'], res)
|
|
|
|
def testset2op(a, b, c, res, stmt="a[b]=c", meth="__setitem__"):
|
|
if verbose: print "checking", stmt
|
|
dict = {'a': deepcopy(a), 'b': b, 'c': c}
|
|
exec(stmt, dict)
|
|
vereq(dict['a'], res)
|
|
t = type(a)
|
|
m = getattr(t, meth)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
vereq(m, t.__dict__[meth])
|
|
dict['a'] = deepcopy(a)
|
|
m(dict['a'], b, c)
|
|
vereq(dict['a'], res)
|
|
dict['a'] = deepcopy(a)
|
|
bm = getattr(dict['a'], meth)
|
|
bm(b, c)
|
|
vereq(dict['a'], res)
|
|
|
|
def testset3op(a, b, c, d, res, stmt="a[b:c]=d", meth="__setslice__"):
|
|
if verbose: print "checking", stmt
|
|
dict = {'a': deepcopy(a), 'b': b, 'c': c, 'd': d}
|
|
exec(stmt, dict)
|
|
vereq(dict['a'], res)
|
|
t = type(a)
|
|
while meth not in t.__dict__:
|
|
t = t.__bases__[0]
|
|
m = getattr(t, meth)
|
|
vereq(m, t.__dict__[meth])
|
|
dict['a'] = deepcopy(a)
|
|
m(dict['a'], b, c, d)
|
|
vereq(dict['a'], res)
|
|
dict['a'] = deepcopy(a)
|
|
bm = getattr(dict['a'], meth)
|
|
bm(b, c, d)
|
|
vereq(dict['a'], res)
|
|
|
|
def class_docstrings():
|
|
class Classic:
|
|
"A classic docstring."
|
|
vereq(Classic.__doc__, "A classic docstring.")
|
|
vereq(Classic.__dict__['__doc__'], "A classic docstring.")
|
|
|
|
class Classic2:
|
|
pass
|
|
verify(Classic2.__doc__ is None)
|
|
|
|
class NewStatic(object):
|
|
"Another docstring."
|
|
vereq(NewStatic.__doc__, "Another docstring.")
|
|
vereq(NewStatic.__dict__['__doc__'], "Another docstring.")
|
|
|
|
class NewStatic2(object):
|
|
pass
|
|
verify(NewStatic2.__doc__ is None)
|
|
|
|
class NewDynamic(object):
|
|
"Another docstring."
|
|
vereq(NewDynamic.__doc__, "Another docstring.")
|
|
vereq(NewDynamic.__dict__['__doc__'], "Another docstring.")
|
|
|
|
class NewDynamic2(object):
|
|
pass
|
|
verify(NewDynamic2.__doc__ is None)
|
|
|
|
def lists():
|
|
if verbose: print "Testing list operations..."
|
|
testbinop([1], [2], [1,2], "a+b", "__add__")
|
|
testbinop([1,2,3], 2, 1, "b in a", "__contains__")
|
|
testbinop([1,2,3], 4, 0, "b in a", "__contains__")
|
|
testbinop([1,2,3], 1, 2, "a[b]", "__getitem__")
|
|
testternop([1,2,3], 0, 2, [1,2], "a[b:c]", "__getslice__")
|
|
testsetop([1], [2], [1,2], "a+=b", "__iadd__")
|
|
testsetop([1,2], 3, [1,2,1,2,1,2], "a*=b", "__imul__")
|
|
testunop([1,2,3], 3, "len(a)", "__len__")
|
|
testbinop([1,2], 3, [1,2,1,2,1,2], "a*b", "__mul__")
|
|
testbinop([1,2], 3, [1,2,1,2,1,2], "b*a", "__rmul__")
|
|
testset2op([1,2], 1, 3, [1,3], "a[b]=c", "__setitem__")
|
|
testset3op([1,2,3,4], 1, 3, [5,6], [1,5,6,4], "a[b:c]=d", "__setslice__")
|
|
|
|
def dicts():
|
|
if verbose: print "Testing dict operations..."
|
|
##testbinop({1:2}, {2:1}, -1, "cmp(a,b)", "__cmp__")
|
|
testbinop({1:2,3:4}, 1, 1, "b in a", "__contains__")
|
|
testbinop({1:2,3:4}, 2, 0, "b in a", "__contains__")
|
|
testbinop({1:2,3:4}, 1, 2, "a[b]", "__getitem__")
|
|
d = {1:2,3:4}
|
|
l1 = []
|
|
for i in d.keys(): l1.append(i)
|
|
l = []
|
|
for i in iter(d): l.append(i)
|
|
vereq(l, l1)
|
|
l = []
|
|
for i in d.__iter__(): l.append(i)
|
|
vereq(l, l1)
|
|
l = []
|
|
for i in dict.__iter__(d): l.append(i)
|
|
vereq(l, l1)
|
|
d = {1:2, 3:4}
|
|
testunop(d, 2, "len(a)", "__len__")
|
|
vereq(eval(repr(d), {}), d)
|
|
vereq(eval(d.__repr__(), {}), d)
|
|
testset2op({1:2,3:4}, 2, 3, {1:2,2:3,3:4}, "a[b]=c", "__setitem__")
|
|
|
|
def dict_constructor():
|
|
if verbose:
|
|
print "Testing dict constructor ..."
|
|
d = dict()
|
|
vereq(d, {})
|
|
d = dict({})
|
|
vereq(d, {})
|
|
d = dict({1: 2, 'a': 'b'})
|
|
vereq(d, {1: 2, 'a': 'b'})
|
|
vereq(d, dict(d.items()))
|
|
vereq(d, dict(d.iteritems()))
|
|
d = dict({'one':1, 'two':2})
|
|
vereq(d, dict(one=1, two=2))
|
|
vereq(d, dict(**d))
|
|
vereq(d, dict({"one": 1}, two=2))
|
|
vereq(d, dict([("two", 2)], one=1))
|
|
vereq(d, dict([("one", 100), ("two", 200)], **d))
|
|
verify(d is not dict(**d))
|
|
for badarg in 0, 0L, 0j, "0", [0], (0,):
|
|
try:
|
|
dict(badarg)
|
|
except TypeError:
|
|
pass
|
|
except ValueError:
|
|
if badarg == "0":
|
|
# It's a sequence, and its elements are also sequences (gotta
|
|
# love strings <wink>), but they aren't of length 2, so this
|
|
# one seemed better as a ValueError than a TypeError.
|
|
pass
|
|
else:
|
|
raise TestFailed("no TypeError from dict(%r)" % badarg)
|
|
else:
|
|
raise TestFailed("no TypeError from dict(%r)" % badarg)
|
|
|
|
try:
|
|
dict({}, {})
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("no TypeError from dict({}, {})")
|
|
|
|
class Mapping:
|
|
# Lacks a .keys() method; will be added later.
|
|
dict = {1:2, 3:4, 'a':1j}
|
|
|
|
try:
|
|
dict(Mapping())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("no TypeError from dict(incomplete mapping)")
|
|
|
|
Mapping.keys = lambda self: self.dict.keys()
|
|
Mapping.__getitem__ = lambda self, i: self.dict[i]
|
|
d = dict(Mapping())
|
|
vereq(d, Mapping.dict)
|
|
|
|
# Init from sequence of iterable objects, each producing a 2-sequence.
|
|
class AddressBookEntry:
|
|
def __init__(self, first, last):
|
|
self.first = first
|
|
self.last = last
|
|
def __iter__(self):
|
|
return iter([self.first, self.last])
|
|
|
|
d = dict([AddressBookEntry('Tim', 'Warsaw'),
|
|
AddressBookEntry('Barry', 'Peters'),
|
|
AddressBookEntry('Tim', 'Peters'),
|
|
AddressBookEntry('Barry', 'Warsaw')])
|
|
vereq(d, {'Barry': 'Warsaw', 'Tim': 'Peters'})
|
|
|
|
d = dict(zip(range(4), range(1, 5)))
|
|
vereq(d, dict([(i, i+1) for i in range(4)]))
|
|
|
|
# Bad sequence lengths.
|
|
for bad in [('tooshort',)], [('too', 'long', 'by 1')]:
|
|
try:
|
|
dict(bad)
|
|
except ValueError:
|
|
pass
|
|
else:
|
|
raise TestFailed("no ValueError from dict(%r)" % bad)
|
|
|
|
def test_dir():
|
|
if verbose:
|
|
print "Testing dir() ..."
|
|
junk = 12
|
|
vereq(dir(), ['junk'])
|
|
del junk
|
|
|
|
# Just make sure these don't blow up!
|
|
for arg in 2, 2L, 2j, 2e0, [2], "2", u"2", (2,), {2:2}, type, test_dir:
|
|
dir(arg)
|
|
|
|
# Test dir on custom classes. Since these have object as a
|
|
# base class, a lot of stuff gets sucked in.
|
|
def interesting(strings):
|
|
return [s for s in strings if not s.startswith('_')]
|
|
|
|
class C(object):
|
|
Cdata = 1
|
|
def Cmethod(self): pass
|
|
|
|
cstuff = ['Cdata', 'Cmethod']
|
|
vereq(interesting(dir(C)), cstuff)
|
|
|
|
c = C()
|
|
vereq(interesting(dir(c)), cstuff)
|
|
verify('im_self' in dir(C.Cmethod))
|
|
|
|
c.cdata = 2
|
|
c.cmethod = lambda self: 0
|
|
vereq(interesting(dir(c)), cstuff + ['cdata', 'cmethod'])
|
|
verify('im_self' in dir(c.Cmethod))
|
|
|
|
class A(C):
|
|
Adata = 1
|
|
def Amethod(self): pass
|
|
|
|
astuff = ['Adata', 'Amethod'] + cstuff
|
|
vereq(interesting(dir(A)), astuff)
|
|
verify('im_self' in dir(A.Amethod))
|
|
a = A()
|
|
vereq(interesting(dir(a)), astuff)
|
|
a.adata = 42
|
|
a.amethod = lambda self: 3
|
|
vereq(interesting(dir(a)), astuff + ['adata', 'amethod'])
|
|
verify('im_self' in dir(a.Amethod))
|
|
|
|
# Try a module subclass.
|
|
import sys
|
|
class M(type(sys)):
|
|
pass
|
|
minstance = M("m")
|
|
minstance.b = 2
|
|
minstance.a = 1
|
|
names = [x for x in dir(minstance) if x not in ["__name__", "__doc__"]]
|
|
vereq(names, ['a', 'b'])
|
|
|
|
class M2(M):
|
|
def getdict(self):
|
|
return "Not a dict!"
|
|
__dict__ = property(getdict)
|
|
|
|
m2instance = M2("m2")
|
|
m2instance.b = 2
|
|
m2instance.a = 1
|
|
vereq(m2instance.__dict__, "Not a dict!")
|
|
try:
|
|
dir(m2instance)
|
|
except TypeError:
|
|
pass
|
|
|
|
# Two essentially featureless objects, just inheriting stuff from
|
|
# object.
|
|
vereq(dir(None), dir(Ellipsis))
|
|
|
|
# Nasty test case for proxied objects
|
|
class Wrapper(object):
|
|
def __init__(self, obj):
|
|
self.__obj = obj
|
|
def __repr__(self):
|
|
return "Wrapper(%s)" % repr(self.__obj)
|
|
def __getitem__(self, key):
|
|
return Wrapper(self.__obj[key])
|
|
def __len__(self):
|
|
return len(self.__obj)
|
|
def __getattr__(self, name):
|
|
return Wrapper(getattr(self.__obj, name))
|
|
|
|
class C(object):
|
|
def __getclass(self):
|
|
return Wrapper(type(self))
|
|
__class__ = property(__getclass)
|
|
|
|
dir(C()) # This used to segfault
|
|
|
|
binops = {
|
|
'add': '+',
|
|
'sub': '-',
|
|
'mul': '*',
|
|
'div': '/',
|
|
'mod': '%',
|
|
'divmod': 'divmod',
|
|
'pow': '**',
|
|
'lshift': '<<',
|
|
'rshift': '>>',
|
|
'and': '&',
|
|
'xor': '^',
|
|
'or': '|',
|
|
'cmp': 'cmp',
|
|
'lt': '<',
|
|
'le': '<=',
|
|
'eq': '==',
|
|
'ne': '!=',
|
|
'gt': '>',
|
|
'ge': '>=',
|
|
}
|
|
|
|
for name, expr in binops.items():
|
|
if expr.islower():
|
|
expr = expr + "(a, b)"
|
|
else:
|
|
expr = 'a %s b' % expr
|
|
binops[name] = expr
|
|
|
|
unops = {
|
|
'pos': '+',
|
|
'neg': '-',
|
|
'abs': 'abs',
|
|
'invert': '~',
|
|
'int': 'int',
|
|
'long': 'long',
|
|
'float': 'float',
|
|
'oct': 'oct',
|
|
'hex': 'hex',
|
|
}
|
|
|
|
for name, expr in unops.items():
|
|
if expr.islower():
|
|
expr = expr + "(a)"
|
|
else:
|
|
expr = '%s a' % expr
|
|
unops[name] = expr
|
|
|
|
def numops(a, b, skip=[]):
|
|
dict = {'a': a, 'b': b}
|
|
for name, expr in binops.items():
|
|
if name not in skip:
|
|
name = "__%s__" % name
|
|
if hasattr(a, name):
|
|
res = eval(expr, dict)
|
|
testbinop(a, b, res, expr, name)
|
|
for name, expr in unops.items():
|
|
if name not in skip:
|
|
name = "__%s__" % name
|
|
if hasattr(a, name):
|
|
res = eval(expr, dict)
|
|
testunop(a, res, expr, name)
|
|
|
|
def ints():
|
|
if verbose: print "Testing int operations..."
|
|
numops(100, 3)
|
|
# The following crashes in Python 2.2
|
|
vereq((1).__bool__(), True)
|
|
vereq((0).__bool__(), False)
|
|
# This returns 'NotImplemented' in Python 2.2
|
|
class C(int):
|
|
def __add__(self, other):
|
|
return NotImplemented
|
|
vereq(C(5L), 5)
|
|
try:
|
|
C() + ""
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "NotImplemented should have caused TypeError"
|
|
import sys
|
|
try:
|
|
C(sys.maxint+1)
|
|
except OverflowError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "should have raised OverflowError"
|
|
|
|
def longs():
|
|
if verbose: print "Testing long operations..."
|
|
numops(100L, 3L)
|
|
|
|
def floats():
|
|
if verbose: print "Testing float operations..."
|
|
numops(100.0, 3.0)
|
|
|
|
def complexes():
|
|
if verbose: print "Testing complex operations..."
|
|
numops(100.0j, 3.0j, skip=['lt', 'le', 'gt', 'ge', 'int', 'long', 'float'])
|
|
class Number(complex):
|
|
__slots__ = ['prec']
|
|
def __new__(cls, *args, **kwds):
|
|
result = complex.__new__(cls, *args)
|
|
result.prec = kwds.get('prec', 12)
|
|
return result
|
|
def __repr__(self):
|
|
prec = self.prec
|
|
if self.imag == 0.0:
|
|
return "%.*g" % (prec, self.real)
|
|
if self.real == 0.0:
|
|
return "%.*gj" % (prec, self.imag)
|
|
return "(%.*g+%.*gj)" % (prec, self.real, prec, self.imag)
|
|
__str__ = __repr__
|
|
|
|
a = Number(3.14, prec=6)
|
|
vereq(repr(a), "3.14")
|
|
vereq(a.prec, 6)
|
|
|
|
a = Number(a, prec=2)
|
|
vereq(repr(a), "3.1")
|
|
vereq(a.prec, 2)
|
|
|
|
a = Number(234.5)
|
|
vereq(repr(a), "234.5")
|
|
vereq(a.prec, 12)
|
|
|
|
def spamlists():
|
|
if verbose: print "Testing spamlist operations..."
|
|
import copy, xxsubtype as spam
|
|
def spamlist(l, memo=None):
|
|
import xxsubtype as spam
|
|
return spam.spamlist(l)
|
|
# This is an ugly hack:
|
|
copy._deepcopy_dispatch[spam.spamlist] = spamlist
|
|
|
|
testbinop(spamlist([1]), spamlist([2]), spamlist([1,2]), "a+b", "__add__")
|
|
testbinop(spamlist([1,2,3]), 2, 1, "b in a", "__contains__")
|
|
testbinop(spamlist([1,2,3]), 4, 0, "b in a", "__contains__")
|
|
testbinop(spamlist([1,2,3]), 1, 2, "a[b]", "__getitem__")
|
|
testternop(spamlist([1,2,3]), 0, 2, spamlist([1,2]),
|
|
"a[b:c]", "__getslice__")
|
|
testsetop(spamlist([1]), spamlist([2]), spamlist([1,2]),
|
|
"a+=b", "__iadd__")
|
|
testsetop(spamlist([1,2]), 3, spamlist([1,2,1,2,1,2]), "a*=b", "__imul__")
|
|
testunop(spamlist([1,2,3]), 3, "len(a)", "__len__")
|
|
testbinop(spamlist([1,2]), 3, spamlist([1,2,1,2,1,2]), "a*b", "__mul__")
|
|
testbinop(spamlist([1,2]), 3, spamlist([1,2,1,2,1,2]), "b*a", "__rmul__")
|
|
testset2op(spamlist([1,2]), 1, 3, spamlist([1,3]), "a[b]=c", "__setitem__")
|
|
testset3op(spamlist([1,2,3,4]), 1, 3, spamlist([5,6]),
|
|
spamlist([1,5,6,4]), "a[b:c]=d", "__setslice__")
|
|
# Test subclassing
|
|
class C(spam.spamlist):
|
|
def foo(self): return 1
|
|
a = C()
|
|
vereq(a, [])
|
|
vereq(a.foo(), 1)
|
|
a.append(100)
|
|
vereq(a, [100])
|
|
vereq(a.getstate(), 0)
|
|
a.setstate(42)
|
|
vereq(a.getstate(), 42)
|
|
|
|
def spamdicts():
|
|
if verbose: print "Testing spamdict operations..."
|
|
import copy, xxsubtype as spam
|
|
def spamdict(d, memo=None):
|
|
import xxsubtype as spam
|
|
sd = spam.spamdict()
|
|
for k, v in d.items(): sd[k] = v
|
|
return sd
|
|
# This is an ugly hack:
|
|
copy._deepcopy_dispatch[spam.spamdict] = spamdict
|
|
|
|
##testbinop(spamdict({1:2}), spamdict({2:1}), -1, "cmp(a,b)", "__cmp__")
|
|
testbinop(spamdict({1:2,3:4}), 1, 1, "b in a", "__contains__")
|
|
testbinop(spamdict({1:2,3:4}), 2, 0, "b in a", "__contains__")
|
|
testbinop(spamdict({1:2,3:4}), 1, 2, "a[b]", "__getitem__")
|
|
d = spamdict({1:2,3:4})
|
|
l1 = []
|
|
for i in d.keys(): l1.append(i)
|
|
l = []
|
|
for i in iter(d): l.append(i)
|
|
vereq(l, l1)
|
|
l = []
|
|
for i in d.__iter__(): l.append(i)
|
|
vereq(l, l1)
|
|
l = []
|
|
for i in type(spamdict({})).__iter__(d): l.append(i)
|
|
vereq(l, l1)
|
|
straightd = {1:2, 3:4}
|
|
spamd = spamdict(straightd)
|
|
testunop(spamd, 2, "len(a)", "__len__")
|
|
testunop(spamd, repr(straightd), "repr(a)", "__repr__")
|
|
testset2op(spamdict({1:2,3:4}), 2, 3, spamdict({1:2,2:3,3:4}),
|
|
"a[b]=c", "__setitem__")
|
|
# Test subclassing
|
|
class C(spam.spamdict):
|
|
def foo(self): return 1
|
|
a = C()
|
|
vereq(a.items(), [])
|
|
vereq(a.foo(), 1)
|
|
a['foo'] = 'bar'
|
|
vereq(a.items(), [('foo', 'bar')])
|
|
vereq(a.getstate(), 0)
|
|
a.setstate(100)
|
|
vereq(a.getstate(), 100)
|
|
|
|
def pydicts():
|
|
if verbose: print "Testing Python subclass of dict..."
|
|
verify(issubclass(dict, dict))
|
|
verify(isinstance({}, dict))
|
|
d = dict()
|
|
vereq(d, {})
|
|
verify(d.__class__ is dict)
|
|
verify(isinstance(d, dict))
|
|
class C(dict):
|
|
state = -1
|
|
def __init__(self, *a, **kw):
|
|
if a:
|
|
vereq(len(a), 1)
|
|
self.state = a[0]
|
|
if kw:
|
|
for k, v in kw.items(): self[v] = k
|
|
def __getitem__(self, key):
|
|
return self.get(key, 0)
|
|
def __setitem__(self, key, value):
|
|
verify(isinstance(key, type(0)))
|
|
dict.__setitem__(self, key, value)
|
|
def setstate(self, state):
|
|
self.state = state
|
|
def getstate(self):
|
|
return self.state
|
|
verify(issubclass(C, dict))
|
|
a1 = C(12)
|
|
vereq(a1.state, 12)
|
|
a2 = C(foo=1, bar=2)
|
|
vereq(a2[1] == 'foo' and a2[2], 'bar')
|
|
a = C()
|
|
vereq(a.state, -1)
|
|
vereq(a.getstate(), -1)
|
|
a.setstate(0)
|
|
vereq(a.state, 0)
|
|
vereq(a.getstate(), 0)
|
|
a.setstate(10)
|
|
vereq(a.state, 10)
|
|
vereq(a.getstate(), 10)
|
|
vereq(a[42], 0)
|
|
a[42] = 24
|
|
vereq(a[42], 24)
|
|
if verbose: print "pydict stress test ..."
|
|
N = 50
|
|
for i in range(N):
|
|
a[i] = C()
|
|
for j in range(N):
|
|
a[i][j] = i*j
|
|
for i in range(N):
|
|
for j in range(N):
|
|
vereq(a[i][j], i*j)
|
|
|
|
def pylists():
|
|
if verbose: print "Testing Python subclass of list..."
|
|
class C(list):
|
|
def __getitem__(self, i):
|
|
return list.__getitem__(self, i) + 100
|
|
def __getslice__(self, i, j):
|
|
return (i, j)
|
|
a = C()
|
|
a.extend([0,1,2])
|
|
vereq(a[0], 100)
|
|
vereq(a[1], 101)
|
|
vereq(a[2], 102)
|
|
vereq(a[100:200], (100,200))
|
|
|
|
def metaclass():
|
|
if verbose: print "Testing __metaclass__..."
|
|
class C:
|
|
__metaclass__ = type
|
|
def __init__(self):
|
|
self.__state = 0
|
|
def getstate(self):
|
|
return self.__state
|
|
def setstate(self, state):
|
|
self.__state = state
|
|
a = C()
|
|
vereq(a.getstate(), 0)
|
|
a.setstate(10)
|
|
vereq(a.getstate(), 10)
|
|
class D:
|
|
class __metaclass__(type):
|
|
def myself(cls): return cls
|
|
vereq(D.myself(), D)
|
|
d = D()
|
|
verify(d.__class__ is D)
|
|
class M1(type):
|
|
def __new__(cls, name, bases, dict):
|
|
dict['__spam__'] = 1
|
|
return type.__new__(cls, name, bases, dict)
|
|
class C:
|
|
__metaclass__ = M1
|
|
vereq(C.__spam__, 1)
|
|
c = C()
|
|
vereq(c.__spam__, 1)
|
|
|
|
class _instance(object):
|
|
pass
|
|
class M2(object):
|
|
@staticmethod
|
|
def __new__(cls, name, bases, dict):
|
|
self = object.__new__(cls)
|
|
self.name = name
|
|
self.bases = bases
|
|
self.dict = dict
|
|
return self
|
|
def __call__(self):
|
|
it = _instance()
|
|
# Early binding of methods
|
|
for key in self.dict:
|
|
if key.startswith("__"):
|
|
continue
|
|
setattr(it, key, self.dict[key].__get__(it, self))
|
|
return it
|
|
class C:
|
|
__metaclass__ = M2
|
|
def spam(self):
|
|
return 42
|
|
vereq(C.name, 'C')
|
|
vereq(C.bases, ())
|
|
verify('spam' in C.dict)
|
|
c = C()
|
|
vereq(c.spam(), 42)
|
|
|
|
# More metaclass examples
|
|
|
|
class autosuper(type):
|
|
# Automatically add __super to the class
|
|
# This trick only works for dynamic classes
|
|
def __new__(metaclass, name, bases, dict):
|
|
cls = super(autosuper, metaclass).__new__(metaclass,
|
|
name, bases, dict)
|
|
# Name mangling for __super removes leading underscores
|
|
while name[:1] == "_":
|
|
name = name[1:]
|
|
if name:
|
|
name = "_%s__super" % name
|
|
else:
|
|
name = "__super"
|
|
setattr(cls, name, super(cls))
|
|
return cls
|
|
class A:
|
|
__metaclass__ = autosuper
|
|
def meth(self):
|
|
return "A"
|
|
class B(A):
|
|
def meth(self):
|
|
return "B" + self.__super.meth()
|
|
class C(A):
|
|
def meth(self):
|
|
return "C" + self.__super.meth()
|
|
class D(C, B):
|
|
def meth(self):
|
|
return "D" + self.__super.meth()
|
|
vereq(D().meth(), "DCBA")
|
|
class E(B, C):
|
|
def meth(self):
|
|
return "E" + self.__super.meth()
|
|
vereq(E().meth(), "EBCA")
|
|
|
|
class autoproperty(type):
|
|
# Automatically create property attributes when methods
|
|
# named _get_x and/or _set_x are found
|
|
def __new__(metaclass, name, bases, dict):
|
|
hits = {}
|
|
for key, val in dict.iteritems():
|
|
if key.startswith("_get_"):
|
|
key = key[5:]
|
|
get, set = hits.get(key, (None, None))
|
|
get = val
|
|
hits[key] = get, set
|
|
elif key.startswith("_set_"):
|
|
key = key[5:]
|
|
get, set = hits.get(key, (None, None))
|
|
set = val
|
|
hits[key] = get, set
|
|
for key, (get, set) in hits.iteritems():
|
|
dict[key] = property(get, set)
|
|
return super(autoproperty, metaclass).__new__(metaclass,
|
|
name, bases, dict)
|
|
class A:
|
|
__metaclass__ = autoproperty
|
|
def _get_x(self):
|
|
return -self.__x
|
|
def _set_x(self, x):
|
|
self.__x = -x
|
|
a = A()
|
|
verify(not hasattr(a, "x"))
|
|
a.x = 12
|
|
vereq(a.x, 12)
|
|
vereq(a._A__x, -12)
|
|
|
|
class multimetaclass(autoproperty, autosuper):
|
|
# Merge of multiple cooperating metaclasses
|
|
pass
|
|
class A:
|
|
__metaclass__ = multimetaclass
|
|
def _get_x(self):
|
|
return "A"
|
|
class B(A):
|
|
def _get_x(self):
|
|
return "B" + self.__super._get_x()
|
|
class C(A):
|
|
def _get_x(self):
|
|
return "C" + self.__super._get_x()
|
|
class D(C, B):
|
|
def _get_x(self):
|
|
return "D" + self.__super._get_x()
|
|
vereq(D().x, "DCBA")
|
|
|
|
# Make sure type(x) doesn't call x.__class__.__init__
|
|
class T(type):
|
|
counter = 0
|
|
def __init__(self, *args):
|
|
T.counter += 1
|
|
class C:
|
|
__metaclass__ = T
|
|
vereq(T.counter, 1)
|
|
a = C()
|
|
vereq(type(a), C)
|
|
vereq(T.counter, 1)
|
|
|
|
class C(object): pass
|
|
c = C()
|
|
try: c()
|
|
except TypeError: pass
|
|
else: raise TestFailed, "calling object w/o call method should raise TypeError"
|
|
|
|
def pymods():
|
|
if verbose: print "Testing Python subclass of module..."
|
|
log = []
|
|
import sys
|
|
MT = type(sys)
|
|
class MM(MT):
|
|
def __init__(self, name):
|
|
MT.__init__(self, name)
|
|
def __getattribute__(self, name):
|
|
log.append(("getattr", name))
|
|
return MT.__getattribute__(self, name)
|
|
def __setattr__(self, name, value):
|
|
log.append(("setattr", name, value))
|
|
MT.__setattr__(self, name, value)
|
|
def __delattr__(self, name):
|
|
log.append(("delattr", name))
|
|
MT.__delattr__(self, name)
|
|
a = MM("a")
|
|
a.foo = 12
|
|
x = a.foo
|
|
del a.foo
|
|
vereq(log, [("setattr", "foo", 12),
|
|
("getattr", "foo"),
|
|
("delattr", "foo")])
|
|
|
|
def multi():
|
|
if verbose: print "Testing multiple inheritance..."
|
|
class C(object):
|
|
def __init__(self):
|
|
self.__state = 0
|
|
def getstate(self):
|
|
return self.__state
|
|
def setstate(self, state):
|
|
self.__state = state
|
|
a = C()
|
|
vereq(a.getstate(), 0)
|
|
a.setstate(10)
|
|
vereq(a.getstate(), 10)
|
|
class D(dict, C):
|
|
def __init__(self):
|
|
type({}).__init__(self)
|
|
C.__init__(self)
|
|
d = D()
|
|
vereq(d.keys(), [])
|
|
d["hello"] = "world"
|
|
vereq(d.items(), [("hello", "world")])
|
|
vereq(d["hello"], "world")
|
|
vereq(d.getstate(), 0)
|
|
d.setstate(10)
|
|
vereq(d.getstate(), 10)
|
|
vereq(D.__mro__, (D, dict, C, object))
|
|
|
|
# SF bug #442833
|
|
class Node(object):
|
|
def __int__(self):
|
|
return int(self.foo())
|
|
def foo(self):
|
|
return "23"
|
|
class Frag(Node, list):
|
|
def foo(self):
|
|
return "42"
|
|
vereq(Node().__int__(), 23)
|
|
vereq(int(Node()), 23)
|
|
vereq(Frag().__int__(), 42)
|
|
vereq(int(Frag()), 42)
|
|
|
|
def diamond():
|
|
if verbose: print "Testing multiple inheritance special cases..."
|
|
class A(object):
|
|
def spam(self): return "A"
|
|
vereq(A().spam(), "A")
|
|
class B(A):
|
|
def boo(self): return "B"
|
|
def spam(self): return "B"
|
|
vereq(B().spam(), "B")
|
|
vereq(B().boo(), "B")
|
|
class C(A):
|
|
def boo(self): return "C"
|
|
vereq(C().spam(), "A")
|
|
vereq(C().boo(), "C")
|
|
class D(B, C): pass
|
|
vereq(D().spam(), "B")
|
|
vereq(D().boo(), "B")
|
|
vereq(D.__mro__, (D, B, C, A, object))
|
|
class E(C, B): pass
|
|
vereq(E().spam(), "B")
|
|
vereq(E().boo(), "C")
|
|
vereq(E.__mro__, (E, C, B, A, object))
|
|
# MRO order disagreement
|
|
try:
|
|
class F(D, E): pass
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "expected MRO order disagreement (F)"
|
|
try:
|
|
class G(E, D): pass
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "expected MRO order disagreement (G)"
|
|
|
|
|
|
# see thread python-dev/2002-October/029035.html
|
|
def ex5():
|
|
if verbose: print "Testing ex5 from C3 switch discussion..."
|
|
class A(object): pass
|
|
class B(object): pass
|
|
class C(object): pass
|
|
class X(A): pass
|
|
class Y(A): pass
|
|
class Z(X,B,Y,C): pass
|
|
vereq(Z.__mro__, (Z, X, B, Y, A, C, object))
|
|
|
|
# see "A Monotonic Superclass Linearization for Dylan",
|
|
# by Kim Barrett et al. (OOPSLA 1996)
|
|
def monotonicity():
|
|
if verbose: print "Testing MRO monotonicity..."
|
|
class Boat(object): pass
|
|
class DayBoat(Boat): pass
|
|
class WheelBoat(Boat): pass
|
|
class EngineLess(DayBoat): pass
|
|
class SmallMultihull(DayBoat): pass
|
|
class PedalWheelBoat(EngineLess,WheelBoat): pass
|
|
class SmallCatamaran(SmallMultihull): pass
|
|
class Pedalo(PedalWheelBoat,SmallCatamaran): pass
|
|
|
|
vereq(PedalWheelBoat.__mro__,
|
|
(PedalWheelBoat, EngineLess, DayBoat, WheelBoat, Boat,
|
|
object))
|
|
vereq(SmallCatamaran.__mro__,
|
|
(SmallCatamaran, SmallMultihull, DayBoat, Boat, object))
|
|
|
|
vereq(Pedalo.__mro__,
|
|
(Pedalo, PedalWheelBoat, EngineLess, SmallCatamaran,
|
|
SmallMultihull, DayBoat, WheelBoat, Boat, object))
|
|
|
|
# see "A Monotonic Superclass Linearization for Dylan",
|
|
# by Kim Barrett et al. (OOPSLA 1996)
|
|
def consistency_with_epg():
|
|
if verbose: print "Testing consistentcy with EPG..."
|
|
class Pane(object): pass
|
|
class ScrollingMixin(object): pass
|
|
class EditingMixin(object): pass
|
|
class ScrollablePane(Pane,ScrollingMixin): pass
|
|
class EditablePane(Pane,EditingMixin): pass
|
|
class EditableScrollablePane(ScrollablePane,EditablePane): pass
|
|
|
|
vereq(EditableScrollablePane.__mro__,
|
|
(EditableScrollablePane, ScrollablePane, EditablePane,
|
|
Pane, ScrollingMixin, EditingMixin, object))
|
|
|
|
mro_err_msg = """Cannot create a consistent method resolution
|
|
order (MRO) for bases """
|
|
|
|
def mro_disagreement():
|
|
if verbose: print "Testing error messages for MRO disagreement..."
|
|
def raises(exc, expected, callable, *args):
|
|
try:
|
|
callable(*args)
|
|
except exc, msg:
|
|
if not str(msg).startswith(expected):
|
|
raise TestFailed, "Message %r, expected %r" % (str(msg),
|
|
expected)
|
|
else:
|
|
raise TestFailed, "Expected %s" % exc
|
|
class A(object): pass
|
|
class B(A): pass
|
|
class C(object): pass
|
|
# Test some very simple errors
|
|
raises(TypeError, "duplicate base class A",
|
|
type, "X", (A, A), {})
|
|
raises(TypeError, mro_err_msg,
|
|
type, "X", (A, B), {})
|
|
raises(TypeError, mro_err_msg,
|
|
type, "X", (A, C, B), {})
|
|
# Test a slightly more complex error
|
|
class GridLayout(object): pass
|
|
class HorizontalGrid(GridLayout): pass
|
|
class VerticalGrid(GridLayout): pass
|
|
class HVGrid(HorizontalGrid, VerticalGrid): pass
|
|
class VHGrid(VerticalGrid, HorizontalGrid): pass
|
|
raises(TypeError, mro_err_msg,
|
|
type, "ConfusedGrid", (HVGrid, VHGrid), {})
|
|
|
|
def objects():
|
|
if verbose: print "Testing object class..."
|
|
a = object()
|
|
vereq(a.__class__, object)
|
|
vereq(type(a), object)
|
|
b = object()
|
|
verify(a is not b)
|
|
verify(not hasattr(a, "foo"))
|
|
try:
|
|
a.foo = 12
|
|
except (AttributeError, TypeError):
|
|
pass
|
|
else:
|
|
verify(0, "object() should not allow setting a foo attribute")
|
|
verify(not hasattr(object(), "__dict__"))
|
|
|
|
class Cdict(object):
|
|
pass
|
|
x = Cdict()
|
|
vereq(x.__dict__, {})
|
|
x.foo = 1
|
|
vereq(x.foo, 1)
|
|
vereq(x.__dict__, {'foo': 1})
|
|
|
|
def slots():
|
|
if verbose: print "Testing __slots__..."
|
|
class C0(object):
|
|
__slots__ = []
|
|
x = C0()
|
|
verify(not hasattr(x, "__dict__"))
|
|
verify(not hasattr(x, "foo"))
|
|
|
|
class C1(object):
|
|
__slots__ = ['a']
|
|
x = C1()
|
|
verify(not hasattr(x, "__dict__"))
|
|
verify(not hasattr(x, "a"))
|
|
x.a = 1
|
|
vereq(x.a, 1)
|
|
x.a = None
|
|
veris(x.a, None)
|
|
del x.a
|
|
verify(not hasattr(x, "a"))
|
|
|
|
class C3(object):
|
|
__slots__ = ['a', 'b', 'c']
|
|
x = C3()
|
|
verify(not hasattr(x, "__dict__"))
|
|
verify(not hasattr(x, 'a'))
|
|
verify(not hasattr(x, 'b'))
|
|
verify(not hasattr(x, 'c'))
|
|
x.a = 1
|
|
x.b = 2
|
|
x.c = 3
|
|
vereq(x.a, 1)
|
|
vereq(x.b, 2)
|
|
vereq(x.c, 3)
|
|
|
|
class C4(object):
|
|
"""Validate name mangling"""
|
|
__slots__ = ['__a']
|
|
def __init__(self, value):
|
|
self.__a = value
|
|
def get(self):
|
|
return self.__a
|
|
x = C4(5)
|
|
verify(not hasattr(x, '__dict__'))
|
|
verify(not hasattr(x, '__a'))
|
|
vereq(x.get(), 5)
|
|
try:
|
|
x.__a = 6
|
|
except AttributeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "Double underscored names not mangled"
|
|
|
|
# Make sure slot names are proper identifiers
|
|
try:
|
|
class C(object):
|
|
__slots__ = [None]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "[None] slots not caught"
|
|
try:
|
|
class C(object):
|
|
__slots__ = ["foo bar"]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "['foo bar'] slots not caught"
|
|
try:
|
|
class C(object):
|
|
__slots__ = ["foo\0bar"]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "['foo\\0bar'] slots not caught"
|
|
try:
|
|
class C(object):
|
|
__slots__ = ["1"]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "['1'] slots not caught"
|
|
try:
|
|
class C(object):
|
|
__slots__ = [""]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "[''] slots not caught"
|
|
class C(object):
|
|
__slots__ = ["a", "a_b", "_a", "A0123456789Z"]
|
|
|
|
# Test leaks
|
|
class Counted(object):
|
|
counter = 0 # counts the number of instances alive
|
|
def __init__(self):
|
|
Counted.counter += 1
|
|
def __del__(self):
|
|
Counted.counter -= 1
|
|
class C(object):
|
|
__slots__ = ['a', 'b', 'c']
|
|
x = C()
|
|
x.a = Counted()
|
|
x.b = Counted()
|
|
x.c = Counted()
|
|
vereq(Counted.counter, 3)
|
|
del x
|
|
vereq(Counted.counter, 0)
|
|
class D(C):
|
|
pass
|
|
x = D()
|
|
x.a = Counted()
|
|
x.z = Counted()
|
|
vereq(Counted.counter, 2)
|
|
del x
|
|
vereq(Counted.counter, 0)
|
|
class E(D):
|
|
__slots__ = ['e']
|
|
x = E()
|
|
x.a = Counted()
|
|
x.z = Counted()
|
|
x.e = Counted()
|
|
vereq(Counted.counter, 3)
|
|
del x
|
|
vereq(Counted.counter, 0)
|
|
|
|
# Test cyclical leaks [SF bug 519621]
|
|
class F(object):
|
|
__slots__ = ['a', 'b']
|
|
log = []
|
|
s = F()
|
|
s.a = [Counted(), s]
|
|
vereq(Counted.counter, 1)
|
|
s = None
|
|
import gc
|
|
gc.collect()
|
|
vereq(Counted.counter, 0)
|
|
|
|
# Test lookup leaks [SF bug 572567]
|
|
import sys,gc
|
|
class G(object):
|
|
def __cmp__(self, other):
|
|
return 0
|
|
g = G()
|
|
orig_objects = len(gc.get_objects())
|
|
for i in xrange(10):
|
|
g==g
|
|
new_objects = len(gc.get_objects())
|
|
vereq(orig_objects, new_objects)
|
|
class H(object):
|
|
__slots__ = ['a', 'b']
|
|
def __init__(self):
|
|
self.a = 1
|
|
self.b = 2
|
|
def __del__(self):
|
|
assert self.a == 1
|
|
assert self.b == 2
|
|
|
|
save_stderr = sys.stderr
|
|
sys.stderr = sys.stdout
|
|
h = H()
|
|
try:
|
|
del h
|
|
finally:
|
|
sys.stderr = save_stderr
|
|
|
|
def slotspecials():
|
|
if verbose: print "Testing __dict__ and __weakref__ in __slots__..."
|
|
|
|
class D(object):
|
|
__slots__ = ["__dict__"]
|
|
a = D()
|
|
verify(hasattr(a, "__dict__"))
|
|
verify(not hasattr(a, "__weakref__"))
|
|
a.foo = 42
|
|
vereq(a.__dict__, {"foo": 42})
|
|
|
|
class W(object):
|
|
__slots__ = ["__weakref__"]
|
|
a = W()
|
|
verify(hasattr(a, "__weakref__"))
|
|
verify(not hasattr(a, "__dict__"))
|
|
try:
|
|
a.foo = 42
|
|
except AttributeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't be allowed to set a.foo"
|
|
|
|
class C1(W, D):
|
|
__slots__ = []
|
|
a = C1()
|
|
verify(hasattr(a, "__dict__"))
|
|
verify(hasattr(a, "__weakref__"))
|
|
a.foo = 42
|
|
vereq(a.__dict__, {"foo": 42})
|
|
|
|
class C2(D, W):
|
|
__slots__ = []
|
|
a = C2()
|
|
verify(hasattr(a, "__dict__"))
|
|
verify(hasattr(a, "__weakref__"))
|
|
a.foo = 42
|
|
vereq(a.__dict__, {"foo": 42})
|
|
|
|
# MRO order disagreement
|
|
#
|
|
# class C3(C1, C2):
|
|
# __slots__ = []
|
|
#
|
|
# class C4(C2, C1):
|
|
# __slots__ = []
|
|
|
|
def dynamics():
|
|
if verbose: print "Testing class attribute propagation..."
|
|
class D(object):
|
|
pass
|
|
class E(D):
|
|
pass
|
|
class F(D):
|
|
pass
|
|
D.foo = 1
|
|
vereq(D.foo, 1)
|
|
# Test that dynamic attributes are inherited
|
|
vereq(E.foo, 1)
|
|
vereq(F.foo, 1)
|
|
# Test dynamic instances
|
|
class C(object):
|
|
pass
|
|
a = C()
|
|
verify(not hasattr(a, "foobar"))
|
|
C.foobar = 2
|
|
vereq(a.foobar, 2)
|
|
C.method = lambda self: 42
|
|
vereq(a.method(), 42)
|
|
C.__repr__ = lambda self: "C()"
|
|
vereq(repr(a), "C()")
|
|
C.__int__ = lambda self: 100
|
|
vereq(int(a), 100)
|
|
vereq(a.foobar, 2)
|
|
verify(not hasattr(a, "spam"))
|
|
def mygetattr(self, name):
|
|
if name == "spam":
|
|
return "spam"
|
|
raise AttributeError
|
|
C.__getattr__ = mygetattr
|
|
vereq(a.spam, "spam")
|
|
a.new = 12
|
|
vereq(a.new, 12)
|
|
def mysetattr(self, name, value):
|
|
if name == "spam":
|
|
raise AttributeError
|
|
return object.__setattr__(self, name, value)
|
|
C.__setattr__ = mysetattr
|
|
try:
|
|
a.spam = "not spam"
|
|
except AttributeError:
|
|
pass
|
|
else:
|
|
verify(0, "expected AttributeError")
|
|
vereq(a.spam, "spam")
|
|
class D(C):
|
|
pass
|
|
d = D()
|
|
d.foo = 1
|
|
vereq(d.foo, 1)
|
|
|
|
# Test handling of int*seq and seq*int
|
|
class I(int):
|
|
pass
|
|
vereq("a"*I(2), "aa")
|
|
vereq(I(2)*"a", "aa")
|
|
vereq(2*I(3), 6)
|
|
vereq(I(3)*2, 6)
|
|
vereq(I(3)*I(2), 6)
|
|
|
|
# Test handling of long*seq and seq*long
|
|
class L(long):
|
|
pass
|
|
vereq("a"*L(2L), "aa")
|
|
vereq(L(2L)*"a", "aa")
|
|
vereq(2*L(3), 6)
|
|
vereq(L(3)*2, 6)
|
|
vereq(L(3)*L(2), 6)
|
|
|
|
# Test comparison of classes with dynamic metaclasses
|
|
class dynamicmetaclass(type):
|
|
pass
|
|
class someclass:
|
|
__metaclass__ = dynamicmetaclass
|
|
verify(someclass != object)
|
|
|
|
def errors():
|
|
if verbose: print "Testing errors..."
|
|
|
|
try:
|
|
class C(list, dict):
|
|
pass
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
verify(0, "inheritance from both list and dict should be illegal")
|
|
|
|
try:
|
|
class C(object, None):
|
|
pass
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
verify(0, "inheritance from non-type should be illegal")
|
|
class Classic:
|
|
pass
|
|
|
|
try:
|
|
class C(type(len)):
|
|
pass
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
verify(0, "inheritance from CFunction should be illegal")
|
|
|
|
try:
|
|
class C(object):
|
|
__slots__ = 1
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
verify(0, "__slots__ = 1 should be illegal")
|
|
|
|
try:
|
|
class C(object):
|
|
__slots__ = [1]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
verify(0, "__slots__ = [1] should be illegal")
|
|
|
|
def classmethods():
|
|
if verbose: print "Testing class methods..."
|
|
class C(object):
|
|
def foo(*a): return a
|
|
goo = classmethod(foo)
|
|
c = C()
|
|
vereq(C.goo(1), (C, 1))
|
|
vereq(c.goo(1), (C, 1))
|
|
vereq(c.foo(1), (c, 1))
|
|
class D(C):
|
|
pass
|
|
d = D()
|
|
vereq(D.goo(1), (D, 1))
|
|
vereq(d.goo(1), (D, 1))
|
|
vereq(d.foo(1), (d, 1))
|
|
vereq(D.foo(d, 1), (d, 1))
|
|
# Test for a specific crash (SF bug 528132)
|
|
def f(cls, arg): return (cls, arg)
|
|
ff = classmethod(f)
|
|
vereq(ff.__get__(0, int)(42), (int, 42))
|
|
vereq(ff.__get__(0)(42), (int, 42))
|
|
|
|
# Test super() with classmethods (SF bug 535444)
|
|
veris(C.goo.im_self, C)
|
|
veris(D.goo.im_self, D)
|
|
veris(super(D,D).goo.im_self, D)
|
|
veris(super(D,d).goo.im_self, D)
|
|
vereq(super(D,D).goo(), (D,))
|
|
vereq(super(D,d).goo(), (D,))
|
|
|
|
# Verify that argument is checked for callability (SF bug 753451)
|
|
try:
|
|
classmethod(1).__get__(1)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "classmethod should check for callability"
|
|
|
|
# Verify that classmethod() doesn't allow keyword args
|
|
try:
|
|
classmethod(f, kw=1)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "classmethod shouldn't accept keyword args"
|
|
|
|
def classmethods_in_c():
|
|
if verbose: print "Testing C-based class methods..."
|
|
import xxsubtype as spam
|
|
a = (1, 2, 3)
|
|
d = {'abc': 123}
|
|
x, a1, d1 = spam.spamlist.classmeth(*a, **d)
|
|
veris(x, spam.spamlist)
|
|
vereq(a, a1)
|
|
vereq(d, d1)
|
|
x, a1, d1 = spam.spamlist().classmeth(*a, **d)
|
|
veris(x, spam.spamlist)
|
|
vereq(a, a1)
|
|
vereq(d, d1)
|
|
|
|
def staticmethods():
|
|
if verbose: print "Testing static methods..."
|
|
class C(object):
|
|
def foo(*a): return a
|
|
goo = staticmethod(foo)
|
|
c = C()
|
|
vereq(C.goo(1), (1,))
|
|
vereq(c.goo(1), (1,))
|
|
vereq(c.foo(1), (c, 1,))
|
|
class D(C):
|
|
pass
|
|
d = D()
|
|
vereq(D.goo(1), (1,))
|
|
vereq(d.goo(1), (1,))
|
|
vereq(d.foo(1), (d, 1))
|
|
vereq(D.foo(d, 1), (d, 1))
|
|
|
|
def staticmethods_in_c():
|
|
if verbose: print "Testing C-based static methods..."
|
|
import xxsubtype as spam
|
|
a = (1, 2, 3)
|
|
d = {"abc": 123}
|
|
x, a1, d1 = spam.spamlist.staticmeth(*a, **d)
|
|
veris(x, None)
|
|
vereq(a, a1)
|
|
vereq(d, d1)
|
|
x, a1, d2 = spam.spamlist().staticmeth(*a, **d)
|
|
veris(x, None)
|
|
vereq(a, a1)
|
|
vereq(d, d1)
|
|
|
|
def classic():
|
|
if verbose: print "Testing classic classes..."
|
|
class C:
|
|
def foo(*a): return a
|
|
goo = classmethod(foo)
|
|
c = C()
|
|
vereq(C.goo(1), (C, 1))
|
|
vereq(c.goo(1), (C, 1))
|
|
vereq(c.foo(1), (c, 1))
|
|
class D(C):
|
|
pass
|
|
d = D()
|
|
vereq(D.goo(1), (D, 1))
|
|
vereq(d.goo(1), (D, 1))
|
|
vereq(d.foo(1), (d, 1))
|
|
vereq(D.foo(d, 1), (d, 1))
|
|
class E: # *not* subclassing from C
|
|
foo = C.foo
|
|
vereq(E().foo, C.foo) # i.e., unbound
|
|
verify(repr(C.foo.__get__(C())).startswith("<bound method "))
|
|
|
|
def compattr():
|
|
if verbose: print "Testing computed attributes..."
|
|
class C(object):
|
|
class computed_attribute(object):
|
|
def __init__(self, get, set=None, delete=None):
|
|
self.__get = get
|
|
self.__set = set
|
|
self.__delete = delete
|
|
def __get__(self, obj, type=None):
|
|
return self.__get(obj)
|
|
def __set__(self, obj, value):
|
|
return self.__set(obj, value)
|
|
def __delete__(self, obj):
|
|
return self.__delete(obj)
|
|
def __init__(self):
|
|
self.__x = 0
|
|
def __get_x(self):
|
|
x = self.__x
|
|
self.__x = x+1
|
|
return x
|
|
def __set_x(self, x):
|
|
self.__x = x
|
|
def __delete_x(self):
|
|
del self.__x
|
|
x = computed_attribute(__get_x, __set_x, __delete_x)
|
|
a = C()
|
|
vereq(a.x, 0)
|
|
vereq(a.x, 1)
|
|
a.x = 10
|
|
vereq(a.x, 10)
|
|
vereq(a.x, 11)
|
|
del a.x
|
|
vereq(hasattr(a, 'x'), 0)
|
|
|
|
def newslot():
|
|
if verbose: print "Testing __new__ slot override..."
|
|
class C(list):
|
|
def __new__(cls):
|
|
self = list.__new__(cls)
|
|
self.foo = 1
|
|
return self
|
|
def __init__(self):
|
|
self.foo = self.foo + 2
|
|
a = C()
|
|
vereq(a.foo, 3)
|
|
verify(a.__class__ is C)
|
|
class D(C):
|
|
pass
|
|
b = D()
|
|
vereq(b.foo, 3)
|
|
verify(b.__class__ is D)
|
|
|
|
def altmro():
|
|
if verbose: print "Testing mro() and overriding it..."
|
|
class A(object):
|
|
def f(self): return "A"
|
|
class B(A):
|
|
pass
|
|
class C(A):
|
|
def f(self): return "C"
|
|
class D(B, C):
|
|
pass
|
|
vereq(D.mro(), [D, B, C, A, object])
|
|
vereq(D.__mro__, (D, B, C, A, object))
|
|
vereq(D().f(), "C")
|
|
|
|
class PerverseMetaType(type):
|
|
def mro(cls):
|
|
L = type.mro(cls)
|
|
L.reverse()
|
|
return L
|
|
class X(D,B,C,A):
|
|
__metaclass__ = PerverseMetaType
|
|
vereq(X.__mro__, (object, A, C, B, D, X))
|
|
vereq(X().f(), "A")
|
|
|
|
try:
|
|
class X(object):
|
|
class __metaclass__(type):
|
|
def mro(self):
|
|
return [self, dict, object]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "devious mro() return not caught"
|
|
|
|
try:
|
|
class X(object):
|
|
class __metaclass__(type):
|
|
def mro(self):
|
|
return [1]
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "non-class mro() return not caught"
|
|
|
|
try:
|
|
class X(object):
|
|
class __metaclass__(type):
|
|
def mro(self):
|
|
return 1
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "non-sequence mro() return not caught"
|
|
|
|
|
|
def overloading():
|
|
if verbose: print "Testing operator overloading..."
|
|
|
|
class B(object):
|
|
"Intermediate class because object doesn't have a __setattr__"
|
|
|
|
class C(B):
|
|
|
|
def __getattr__(self, name):
|
|
if name == "foo":
|
|
return ("getattr", name)
|
|
else:
|
|
raise AttributeError
|
|
def __setattr__(self, name, value):
|
|
if name == "foo":
|
|
self.setattr = (name, value)
|
|
else:
|
|
return B.__setattr__(self, name, value)
|
|
def __delattr__(self, name):
|
|
if name == "foo":
|
|
self.delattr = name
|
|
else:
|
|
return B.__delattr__(self, name)
|
|
|
|
def __getitem__(self, key):
|
|
return ("getitem", key)
|
|
def __setitem__(self, key, value):
|
|
self.setitem = (key, value)
|
|
def __delitem__(self, key):
|
|
self.delitem = key
|
|
|
|
def __getslice__(self, i, j):
|
|
return ("getslice", i, j)
|
|
def __setslice__(self, i, j, value):
|
|
self.setslice = (i, j, value)
|
|
def __delslice__(self, i, j):
|
|
self.delslice = (i, j)
|
|
|
|
a = C()
|
|
vereq(a.foo, ("getattr", "foo"))
|
|
a.foo = 12
|
|
vereq(a.setattr, ("foo", 12))
|
|
del a.foo
|
|
vereq(a.delattr, "foo")
|
|
|
|
vereq(a[12], ("getitem", 12))
|
|
a[12] = 21
|
|
vereq(a.setitem, (12, 21))
|
|
del a[12]
|
|
vereq(a.delitem, 12)
|
|
|
|
vereq(a[0:10], ("getslice", 0, 10))
|
|
a[0:10] = "foo"
|
|
vereq(a.setslice, (0, 10, "foo"))
|
|
del a[0:10]
|
|
vereq(a.delslice, (0, 10))
|
|
|
|
def methods():
|
|
if verbose: print "Testing methods..."
|
|
class C(object):
|
|
def __init__(self, x):
|
|
self.x = x
|
|
def foo(self):
|
|
return self.x
|
|
c1 = C(1)
|
|
vereq(c1.foo(), 1)
|
|
class D(C):
|
|
boo = C.foo
|
|
goo = c1.foo
|
|
d2 = D(2)
|
|
vereq(d2.foo(), 2)
|
|
vereq(d2.boo(), 2)
|
|
vereq(d2.goo(), 1)
|
|
class E(object):
|
|
foo = C.foo
|
|
vereq(E().foo, C.foo) # i.e., unbound
|
|
verify(repr(C.foo.__get__(C(1))).startswith("<bound method "))
|
|
|
|
def specials():
|
|
# Test operators like __hash__ for which a built-in default exists
|
|
if verbose: print "Testing special operators..."
|
|
# Test the default behavior for static classes
|
|
class C(object):
|
|
def __getitem__(self, i):
|
|
if 0 <= i < 10: return i
|
|
raise IndexError
|
|
c1 = C()
|
|
c2 = C()
|
|
verify(not not c1)
|
|
verify(id(c1) != id(c2))
|
|
hash(c1)
|
|
hash(c2)
|
|
##vereq(cmp(c1, c2), cmp(id(c1), id(c2)))
|
|
vereq(c1, c1)
|
|
verify(c1 != c2)
|
|
verify(not c1 != c1)
|
|
verify(not c1 == c2)
|
|
# Note that the module name appears in str/repr, and that varies
|
|
# depending on whether this test is run standalone or from a framework.
|
|
verify(str(c1).find('C object at ') >= 0)
|
|
vereq(str(c1), repr(c1))
|
|
verify(-1 not in c1)
|
|
for i in range(10):
|
|
verify(i in c1)
|
|
verify(10 not in c1)
|
|
# Test the default behavior for dynamic classes
|
|
class D(object):
|
|
def __getitem__(self, i):
|
|
if 0 <= i < 10: return i
|
|
raise IndexError
|
|
d1 = D()
|
|
d2 = D()
|
|
verify(not not d1)
|
|
verify(id(d1) != id(d2))
|
|
hash(d1)
|
|
hash(d2)
|
|
##vereq(cmp(d1, d2), cmp(id(d1), id(d2)))
|
|
vereq(d1, d1)
|
|
verify(d1 != d2)
|
|
verify(not d1 != d1)
|
|
verify(not d1 == d2)
|
|
# Note that the module name appears in str/repr, and that varies
|
|
# depending on whether this test is run standalone or from a framework.
|
|
verify(str(d1).find('D object at ') >= 0)
|
|
vereq(str(d1), repr(d1))
|
|
verify(-1 not in d1)
|
|
for i in range(10):
|
|
verify(i in d1)
|
|
verify(10 not in d1)
|
|
# Test overridden behavior for static classes
|
|
class Proxy(object):
|
|
def __init__(self, x):
|
|
self.x = x
|
|
def __bool__(self):
|
|
return not not self.x
|
|
def __hash__(self):
|
|
return hash(self.x)
|
|
def __eq__(self, other):
|
|
return self.x == other
|
|
def __ne__(self, other):
|
|
return self.x != other
|
|
def __cmp__(self, other):
|
|
return cmp(self.x, other.x)
|
|
def __str__(self):
|
|
return "Proxy:%s" % self.x
|
|
def __repr__(self):
|
|
return "Proxy(%r)" % self.x
|
|
def __contains__(self, value):
|
|
return value in self.x
|
|
p0 = Proxy(0)
|
|
p1 = Proxy(1)
|
|
p_1 = Proxy(-1)
|
|
verify(not p0)
|
|
verify(not not p1)
|
|
vereq(hash(p0), hash(0))
|
|
vereq(p0, p0)
|
|
verify(p0 != p1)
|
|
verify(not p0 != p0)
|
|
vereq(not p0, p1)
|
|
vereq(cmp(p0, p1), -1)
|
|
vereq(cmp(p0, p0), 0)
|
|
vereq(cmp(p0, p_1), 1)
|
|
vereq(str(p0), "Proxy:0")
|
|
vereq(repr(p0), "Proxy(0)")
|
|
p10 = Proxy(range(10))
|
|
verify(-1 not in p10)
|
|
for i in range(10):
|
|
verify(i in p10)
|
|
verify(10 not in p10)
|
|
# Test overridden behavior for dynamic classes
|
|
class DProxy(object):
|
|
def __init__(self, x):
|
|
self.x = x
|
|
def __bool__(self):
|
|
return not not self.x
|
|
def __hash__(self):
|
|
return hash(self.x)
|
|
def __eq__(self, other):
|
|
return self.x == other
|
|
def __ne__(self, other):
|
|
return self.x != other
|
|
def __cmp__(self, other):
|
|
return cmp(self.x, other.x)
|
|
def __str__(self):
|
|
return "DProxy:%s" % self.x
|
|
def __repr__(self):
|
|
return "DProxy(%r)" % self.x
|
|
def __contains__(self, value):
|
|
return value in self.x
|
|
p0 = DProxy(0)
|
|
p1 = DProxy(1)
|
|
p_1 = DProxy(-1)
|
|
verify(not p0)
|
|
verify(not not p1)
|
|
vereq(hash(p0), hash(0))
|
|
vereq(p0, p0)
|
|
verify(p0 != p1)
|
|
verify(not p0 != p0)
|
|
vereq(not p0, p1)
|
|
vereq(cmp(p0, p1), -1)
|
|
vereq(cmp(p0, p0), 0)
|
|
vereq(cmp(p0, p_1), 1)
|
|
vereq(str(p0), "DProxy:0")
|
|
vereq(repr(p0), "DProxy(0)")
|
|
p10 = DProxy(range(10))
|
|
verify(-1 not in p10)
|
|
for i in range(10):
|
|
verify(i in p10)
|
|
verify(10 not in p10)
|
|
## # Safety test for __cmp__
|
|
## def unsafecmp(a, b):
|
|
## try:
|
|
## a.__class__.__cmp__(a, b)
|
|
## except TypeError:
|
|
## pass
|
|
## else:
|
|
## raise TestFailed, "shouldn't allow %s.__cmp__(%r, %r)" % (
|
|
## a.__class__, a, b)
|
|
## unsafecmp(u"123", "123")
|
|
## unsafecmp("123", u"123")
|
|
## unsafecmp(1, 1.0)
|
|
## unsafecmp(1.0, 1)
|
|
## unsafecmp(1, 1L)
|
|
## unsafecmp(1L, 1)
|
|
|
|
class Letter(str):
|
|
def __new__(cls, letter):
|
|
if letter == 'EPS':
|
|
return str.__new__(cls)
|
|
return str.__new__(cls, letter)
|
|
def __str__(self):
|
|
if not self:
|
|
return 'EPS'
|
|
return self
|
|
|
|
# sys.stdout needs to be the original to trigger the recursion bug
|
|
import sys
|
|
test_stdout = sys.stdout
|
|
sys.stdout = get_original_stdout()
|
|
try:
|
|
# nothing should actually be printed, this should raise an exception
|
|
print Letter('w')
|
|
except RuntimeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "expected a RuntimeError for print recursion"
|
|
sys.stdout = test_stdout
|
|
|
|
def weakrefs():
|
|
if verbose: print "Testing weak references..."
|
|
import weakref
|
|
class C(object):
|
|
pass
|
|
c = C()
|
|
r = weakref.ref(c)
|
|
verify(r() is c)
|
|
del c
|
|
verify(r() is None)
|
|
del r
|
|
class NoWeak(object):
|
|
__slots__ = ['foo']
|
|
no = NoWeak()
|
|
try:
|
|
weakref.ref(no)
|
|
except TypeError, msg:
|
|
verify(str(msg).find("weak reference") >= 0)
|
|
else:
|
|
verify(0, "weakref.ref(no) should be illegal")
|
|
class Weak(object):
|
|
__slots__ = ['foo', '__weakref__']
|
|
yes = Weak()
|
|
r = weakref.ref(yes)
|
|
verify(r() is yes)
|
|
del yes
|
|
verify(r() is None)
|
|
del r
|
|
|
|
def properties():
|
|
if verbose: print "Testing property..."
|
|
class C(object):
|
|
def getx(self):
|
|
return self.__x
|
|
def setx(self, value):
|
|
self.__x = value
|
|
def delx(self):
|
|
del self.__x
|
|
x = property(getx, setx, delx, doc="I'm the x property.")
|
|
a = C()
|
|
verify(not hasattr(a, "x"))
|
|
a.x = 42
|
|
vereq(a._C__x, 42)
|
|
vereq(a.x, 42)
|
|
del a.x
|
|
verify(not hasattr(a, "x"))
|
|
verify(not hasattr(a, "_C__x"))
|
|
C.x.__set__(a, 100)
|
|
vereq(C.x.__get__(a), 100)
|
|
C.x.__delete__(a)
|
|
verify(not hasattr(a, "x"))
|
|
|
|
raw = C.__dict__['x']
|
|
verify(isinstance(raw, property))
|
|
|
|
attrs = dir(raw)
|
|
verify("__doc__" in attrs)
|
|
verify("fget" in attrs)
|
|
verify("fset" in attrs)
|
|
verify("fdel" in attrs)
|
|
|
|
vereq(raw.__doc__, "I'm the x property.")
|
|
verify(raw.fget is C.__dict__['getx'])
|
|
verify(raw.fset is C.__dict__['setx'])
|
|
verify(raw.fdel is C.__dict__['delx'])
|
|
|
|
for attr in "__doc__", "fget", "fset", "fdel":
|
|
try:
|
|
setattr(raw, attr, 42)
|
|
except TypeError, msg:
|
|
if str(msg).find('readonly') < 0:
|
|
raise TestFailed("when setting readonly attr %r on a "
|
|
"property, got unexpected TypeError "
|
|
"msg %r" % (attr, str(msg)))
|
|
else:
|
|
raise TestFailed("expected TypeError from trying to set "
|
|
"readonly %r attr on a property" % attr)
|
|
|
|
class D(object):
|
|
__getitem__ = property(lambda s: 1/0)
|
|
|
|
d = D()
|
|
try:
|
|
for i in d:
|
|
str(i)
|
|
except ZeroDivisionError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "expected ZeroDivisionError from bad property"
|
|
|
|
class E(object):
|
|
def getter(self):
|
|
"getter method"
|
|
return 0
|
|
def setter(self, value):
|
|
"setter method"
|
|
pass
|
|
prop = property(getter)
|
|
vereq(prop.__doc__, "getter method")
|
|
prop2 = property(fset=setter)
|
|
vereq(prop2.__doc__, None)
|
|
|
|
# this segfaulted in 2.5b2
|
|
try:
|
|
import _testcapi
|
|
except ImportError:
|
|
pass
|
|
else:
|
|
class X(object):
|
|
p = property(_testcapi.test_with_docstring)
|
|
|
|
|
|
def supers():
|
|
if verbose: print "Testing super..."
|
|
|
|
class A(object):
|
|
def meth(self, a):
|
|
return "A(%r)" % a
|
|
|
|
vereq(A().meth(1), "A(1)")
|
|
|
|
class B(A):
|
|
def __init__(self):
|
|
self.__super = super(B, self)
|
|
def meth(self, a):
|
|
return "B(%r)" % a + self.__super.meth(a)
|
|
|
|
vereq(B().meth(2), "B(2)A(2)")
|
|
|
|
class C(A):
|
|
def meth(self, a):
|
|
return "C(%r)" % a + self.__super.meth(a)
|
|
C._C__super = super(C)
|
|
|
|
vereq(C().meth(3), "C(3)A(3)")
|
|
|
|
class D(C, B):
|
|
def meth(self, a):
|
|
return "D(%r)" % a + super(D, self).meth(a)
|
|
|
|
vereq(D().meth(4), "D(4)C(4)B(4)A(4)")
|
|
|
|
# Test for subclassing super
|
|
|
|
class mysuper(super):
|
|
def __init__(self, *args):
|
|
return super(mysuper, self).__init__(*args)
|
|
|
|
class E(D):
|
|
def meth(self, a):
|
|
return "E(%r)" % a + mysuper(E, self).meth(a)
|
|
|
|
vereq(E().meth(5), "E(5)D(5)C(5)B(5)A(5)")
|
|
|
|
class F(E):
|
|
def meth(self, a):
|
|
s = self.__super # == mysuper(F, self)
|
|
return "F(%r)[%s]" % (a, s.__class__.__name__) + s.meth(a)
|
|
F._F__super = mysuper(F)
|
|
|
|
vereq(F().meth(6), "F(6)[mysuper]E(6)D(6)C(6)B(6)A(6)")
|
|
|
|
# Make sure certain errors are raised
|
|
|
|
try:
|
|
super(D, 42)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow super(D, 42)"
|
|
|
|
try:
|
|
super(D, C())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow super(D, C())"
|
|
|
|
try:
|
|
super(D).__get__(12)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow super(D).__get__(12)"
|
|
|
|
try:
|
|
super(D).__get__(C())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow super(D).__get__(C())"
|
|
|
|
# Make sure data descriptors can be overridden and accessed via super
|
|
# (new feature in Python 2.3)
|
|
|
|
class DDbase(object):
|
|
def getx(self): return 42
|
|
x = property(getx)
|
|
|
|
class DDsub(DDbase):
|
|
def getx(self): return "hello"
|
|
x = property(getx)
|
|
|
|
dd = DDsub()
|
|
vereq(dd.x, "hello")
|
|
vereq(super(DDsub, dd).x, 42)
|
|
|
|
# Ensure that super() lookup of descriptor from classmethod
|
|
# works (SF ID# 743627)
|
|
|
|
class Base(object):
|
|
aProp = property(lambda self: "foo")
|
|
|
|
class Sub(Base):
|
|
@classmethod
|
|
def test(klass):
|
|
return super(Sub,klass).aProp
|
|
|
|
veris(Sub.test(), Base.aProp)
|
|
|
|
# Verify that super() doesn't allow keyword args
|
|
try:
|
|
super(Base, kw=1)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "super shouldn't accept keyword args"
|
|
|
|
def inherits():
|
|
if verbose: print "Testing inheritance from basic types..."
|
|
|
|
class hexint(int):
|
|
def __repr__(self):
|
|
return hex(self)
|
|
def __add__(self, other):
|
|
return hexint(int.__add__(self, other))
|
|
# (Note that overriding __radd__ doesn't work,
|
|
# because the int type gets first dibs.)
|
|
vereq(repr(hexint(7) + 9), "0x10")
|
|
vereq(repr(hexint(1000) + 7), "0x3ef")
|
|
a = hexint(12345)
|
|
vereq(a, 12345)
|
|
vereq(int(a), 12345)
|
|
verify(int(a).__class__ is int)
|
|
vereq(hash(a), hash(12345))
|
|
verify((+a).__class__ is int)
|
|
verify((a >> 0).__class__ is int)
|
|
verify((a << 0).__class__ is int)
|
|
verify((hexint(0) << 12).__class__ is int)
|
|
verify((hexint(0) >> 12).__class__ is int)
|
|
|
|
class octlong(long):
|
|
__slots__ = []
|
|
def __str__(self):
|
|
s = oct(self)
|
|
if s[-1] == 'L':
|
|
s = s[:-1]
|
|
return s
|
|
def __add__(self, other):
|
|
return self.__class__(super(octlong, self).__add__(other))
|
|
__radd__ = __add__
|
|
vereq(str(octlong(3) + 5), "010")
|
|
# (Note that overriding __radd__ here only seems to work
|
|
# because the example uses a short int left argument.)
|
|
vereq(str(5 + octlong(3000)), "05675")
|
|
a = octlong(12345)
|
|
vereq(a, 12345L)
|
|
vereq(long(a), 12345L)
|
|
vereq(hash(a), hash(12345L))
|
|
verify(long(a).__class__ is long)
|
|
verify((+a).__class__ is long)
|
|
verify((-a).__class__ is long)
|
|
verify((-octlong(0)).__class__ is long)
|
|
verify((a >> 0).__class__ is long)
|
|
verify((a << 0).__class__ is long)
|
|
verify((a - 0).__class__ is long)
|
|
verify((a * 1).__class__ is long)
|
|
verify((a ** 1).__class__ is long)
|
|
verify((a // 1).__class__ is long)
|
|
verify((1 * a).__class__ is long)
|
|
verify((a | 0).__class__ is long)
|
|
verify((a ^ 0).__class__ is long)
|
|
verify((a & -1L).__class__ is long)
|
|
verify((octlong(0) << 12).__class__ is long)
|
|
verify((octlong(0) >> 12).__class__ is long)
|
|
verify(abs(octlong(0)).__class__ is long)
|
|
|
|
# Because octlong overrides __add__, we can't check the absence of +0
|
|
# optimizations using octlong.
|
|
class longclone(long):
|
|
pass
|
|
a = longclone(1)
|
|
verify((a + 0).__class__ is long)
|
|
verify((0 + a).__class__ is long)
|
|
|
|
# Check that negative clones don't segfault
|
|
a = longclone(-1)
|
|
vereq(a.__dict__, {})
|
|
vereq(long(a), -1) # verify PyNumber_Long() copies the sign bit
|
|
|
|
class precfloat(float):
|
|
__slots__ = ['prec']
|
|
def __init__(self, value=0.0, prec=12):
|
|
self.prec = int(prec)
|
|
float.__init__(value)
|
|
def __repr__(self):
|
|
return "%.*g" % (self.prec, self)
|
|
vereq(repr(precfloat(1.1)), "1.1")
|
|
a = precfloat(12345)
|
|
vereq(a, 12345.0)
|
|
vereq(float(a), 12345.0)
|
|
verify(float(a).__class__ is float)
|
|
vereq(hash(a), hash(12345.0))
|
|
verify((+a).__class__ is float)
|
|
|
|
class madcomplex(complex):
|
|
def __repr__(self):
|
|
return "%.17gj%+.17g" % (self.imag, self.real)
|
|
a = madcomplex(-3, 4)
|
|
vereq(repr(a), "4j-3")
|
|
base = complex(-3, 4)
|
|
veris(base.__class__, complex)
|
|
vereq(a, base)
|
|
vereq(complex(a), base)
|
|
veris(complex(a).__class__, complex)
|
|
a = madcomplex(a) # just trying another form of the constructor
|
|
vereq(repr(a), "4j-3")
|
|
vereq(a, base)
|
|
vereq(complex(a), base)
|
|
veris(complex(a).__class__, complex)
|
|
vereq(hash(a), hash(base))
|
|
veris((+a).__class__, complex)
|
|
veris((a + 0).__class__, complex)
|
|
vereq(a + 0, base)
|
|
veris((a - 0).__class__, complex)
|
|
vereq(a - 0, base)
|
|
veris((a * 1).__class__, complex)
|
|
vereq(a * 1, base)
|
|
veris((a / 1).__class__, complex)
|
|
vereq(a / 1, base)
|
|
|
|
class madtuple(tuple):
|
|
_rev = None
|
|
def rev(self):
|
|
if self._rev is not None:
|
|
return self._rev
|
|
L = list(self)
|
|
L.reverse()
|
|
self._rev = self.__class__(L)
|
|
return self._rev
|
|
a = madtuple((1,2,3,4,5,6,7,8,9,0))
|
|
vereq(a, (1,2,3,4,5,6,7,8,9,0))
|
|
vereq(a.rev(), madtuple((0,9,8,7,6,5,4,3,2,1)))
|
|
vereq(a.rev().rev(), madtuple((1,2,3,4,5,6,7,8,9,0)))
|
|
for i in range(512):
|
|
t = madtuple(range(i))
|
|
u = t.rev()
|
|
v = u.rev()
|
|
vereq(v, t)
|
|
a = madtuple((1,2,3,4,5))
|
|
vereq(tuple(a), (1,2,3,4,5))
|
|
verify(tuple(a).__class__ is tuple)
|
|
vereq(hash(a), hash((1,2,3,4,5)))
|
|
verify(a[:].__class__ is tuple)
|
|
verify((a * 1).__class__ is tuple)
|
|
verify((a * 0).__class__ is tuple)
|
|
verify((a + ()).__class__ is tuple)
|
|
a = madtuple(())
|
|
vereq(tuple(a), ())
|
|
verify(tuple(a).__class__ is tuple)
|
|
verify((a + a).__class__ is tuple)
|
|
verify((a * 0).__class__ is tuple)
|
|
verify((a * 1).__class__ is tuple)
|
|
verify((a * 2).__class__ is tuple)
|
|
verify(a[:].__class__ is tuple)
|
|
|
|
class madstring(str):
|
|
_rev = None
|
|
def rev(self):
|
|
if self._rev is not None:
|
|
return self._rev
|
|
L = list(self)
|
|
L.reverse()
|
|
self._rev = self.__class__("".join(L))
|
|
return self._rev
|
|
s = madstring("abcdefghijklmnopqrstuvwxyz")
|
|
vereq(s, "abcdefghijklmnopqrstuvwxyz")
|
|
vereq(s.rev(), madstring("zyxwvutsrqponmlkjihgfedcba"))
|
|
vereq(s.rev().rev(), madstring("abcdefghijklmnopqrstuvwxyz"))
|
|
for i in range(256):
|
|
s = madstring("".join(map(chr, range(i))))
|
|
t = s.rev()
|
|
u = t.rev()
|
|
vereq(u, s)
|
|
s = madstring("12345")
|
|
vereq(str(s), "12345")
|
|
verify(str(s).__class__ is str)
|
|
|
|
base = "\x00" * 5
|
|
s = madstring(base)
|
|
vereq(s, base)
|
|
vereq(str(s), base)
|
|
verify(str(s).__class__ is str)
|
|
vereq(hash(s), hash(base))
|
|
vereq({s: 1}[base], 1)
|
|
vereq({base: 1}[s], 1)
|
|
verify((s + "").__class__ is str)
|
|
vereq(s + "", base)
|
|
verify(("" + s).__class__ is str)
|
|
vereq("" + s, base)
|
|
verify((s * 0).__class__ is str)
|
|
vereq(s * 0, "")
|
|
verify((s * 1).__class__ is str)
|
|
vereq(s * 1, base)
|
|
verify((s * 2).__class__ is str)
|
|
vereq(s * 2, base + base)
|
|
verify(s[:].__class__ is str)
|
|
vereq(s[:], base)
|
|
verify(s[0:0].__class__ is str)
|
|
vereq(s[0:0], "")
|
|
verify(s.strip().__class__ is str)
|
|
vereq(s.strip(), base)
|
|
verify(s.lstrip().__class__ is str)
|
|
vereq(s.lstrip(), base)
|
|
verify(s.rstrip().__class__ is str)
|
|
vereq(s.rstrip(), base)
|
|
identitytab = ''.join([chr(i) for i in range(256)])
|
|
verify(s.translate(identitytab).__class__ is str)
|
|
vereq(s.translate(identitytab), base)
|
|
verify(s.translate(identitytab, "x").__class__ is str)
|
|
vereq(s.translate(identitytab, "x"), base)
|
|
vereq(s.translate(identitytab, "\x00"), "")
|
|
verify(s.replace("x", "x").__class__ is str)
|
|
vereq(s.replace("x", "x"), base)
|
|
verify(s.ljust(len(s)).__class__ is str)
|
|
vereq(s.ljust(len(s)), base)
|
|
verify(s.rjust(len(s)).__class__ is str)
|
|
vereq(s.rjust(len(s)), base)
|
|
verify(s.center(len(s)).__class__ is str)
|
|
vereq(s.center(len(s)), base)
|
|
verify(s.lower().__class__ is str)
|
|
vereq(s.lower(), base)
|
|
|
|
class madunicode(unicode):
|
|
_rev = None
|
|
def rev(self):
|
|
if self._rev is not None:
|
|
return self._rev
|
|
L = list(self)
|
|
L.reverse()
|
|
self._rev = self.__class__(u"".join(L))
|
|
return self._rev
|
|
u = madunicode("ABCDEF")
|
|
vereq(u, u"ABCDEF")
|
|
vereq(u.rev(), madunicode(u"FEDCBA"))
|
|
vereq(u.rev().rev(), madunicode(u"ABCDEF"))
|
|
base = u"12345"
|
|
u = madunicode(base)
|
|
vereq(unicode(u), base)
|
|
verify(unicode(u).__class__ is unicode)
|
|
vereq(hash(u), hash(base))
|
|
vereq({u: 1}[base], 1)
|
|
vereq({base: 1}[u], 1)
|
|
verify(u.strip().__class__ is unicode)
|
|
vereq(u.strip(), base)
|
|
verify(u.lstrip().__class__ is unicode)
|
|
vereq(u.lstrip(), base)
|
|
verify(u.rstrip().__class__ is unicode)
|
|
vereq(u.rstrip(), base)
|
|
verify(u.replace(u"x", u"x").__class__ is unicode)
|
|
vereq(u.replace(u"x", u"x"), base)
|
|
verify(u.replace(u"xy", u"xy").__class__ is unicode)
|
|
vereq(u.replace(u"xy", u"xy"), base)
|
|
verify(u.center(len(u)).__class__ is unicode)
|
|
vereq(u.center(len(u)), base)
|
|
verify(u.ljust(len(u)).__class__ is unicode)
|
|
vereq(u.ljust(len(u)), base)
|
|
verify(u.rjust(len(u)).__class__ is unicode)
|
|
vereq(u.rjust(len(u)), base)
|
|
verify(u.lower().__class__ is unicode)
|
|
vereq(u.lower(), base)
|
|
verify(u.upper().__class__ is unicode)
|
|
vereq(u.upper(), base)
|
|
verify(u.capitalize().__class__ is unicode)
|
|
vereq(u.capitalize(), base)
|
|
verify(u.title().__class__ is unicode)
|
|
vereq(u.title(), base)
|
|
verify((u + u"").__class__ is unicode)
|
|
vereq(u + u"", base)
|
|
verify((u"" + u).__class__ is unicode)
|
|
vereq(u"" + u, base)
|
|
verify((u * 0).__class__ is unicode)
|
|
vereq(u * 0, u"")
|
|
verify((u * 1).__class__ is unicode)
|
|
vereq(u * 1, base)
|
|
verify((u * 2).__class__ is unicode)
|
|
vereq(u * 2, base + base)
|
|
verify(u[:].__class__ is unicode)
|
|
vereq(u[:], base)
|
|
verify(u[0:0].__class__ is unicode)
|
|
vereq(u[0:0], u"")
|
|
|
|
class sublist(list):
|
|
pass
|
|
a = sublist(range(5))
|
|
vereq(a, range(5))
|
|
a.append("hello")
|
|
vereq(a, range(5) + ["hello"])
|
|
a[5] = 5
|
|
vereq(a, range(6))
|
|
a.extend(range(6, 20))
|
|
vereq(a, range(20))
|
|
a[-5:] = []
|
|
vereq(a, range(15))
|
|
del a[10:15]
|
|
vereq(len(a), 10)
|
|
vereq(a, range(10))
|
|
vereq(list(a), range(10))
|
|
vereq(a[0], 0)
|
|
vereq(a[9], 9)
|
|
vereq(a[-10], 0)
|
|
vereq(a[-1], 9)
|
|
vereq(a[:5], range(5))
|
|
|
|
class CountedInput(file):
|
|
"""Counts lines read by self.readline().
|
|
|
|
self.lineno is the 0-based ordinal of the last line read, up to
|
|
a maximum of one greater than the number of lines in the file.
|
|
|
|
self.ateof is true if and only if the final "" line has been read,
|
|
at which point self.lineno stops incrementing, and further calls
|
|
to readline() continue to return "".
|
|
"""
|
|
|
|
lineno = 0
|
|
ateof = 0
|
|
def readline(self):
|
|
if self.ateof:
|
|
return ""
|
|
s = file.readline(self)
|
|
# Next line works too.
|
|
# s = super(CountedInput, self).readline()
|
|
self.lineno += 1
|
|
if s == "":
|
|
self.ateof = 1
|
|
return s
|
|
|
|
f = open(name=TESTFN, mode='w')
|
|
lines = ['a\n', 'b\n', 'c\n']
|
|
try:
|
|
f.writelines(lines)
|
|
f.close()
|
|
f = CountedInput(TESTFN)
|
|
for (i, expected) in zip(range(1, 5) + [4], lines + 2 * [""]):
|
|
got = f.readline()
|
|
vereq(expected, got)
|
|
vereq(f.lineno, i)
|
|
vereq(f.ateof, (i > len(lines)))
|
|
f.close()
|
|
finally:
|
|
try:
|
|
f.close()
|
|
except:
|
|
pass
|
|
try:
|
|
import os
|
|
os.unlink(TESTFN)
|
|
except:
|
|
pass
|
|
|
|
def keywords():
|
|
if verbose:
|
|
print "Testing keyword args to basic type constructors ..."
|
|
vereq(int(x=1), 1)
|
|
vereq(float(x=2), 2.0)
|
|
vereq(long(x=3), 3L)
|
|
vereq(complex(imag=42, real=666), complex(666, 42))
|
|
vereq(str(object=500), '500')
|
|
vereq(unicode(string='abc', errors='strict'), u'abc')
|
|
vereq(tuple(sequence=range(3)), (0, 1, 2))
|
|
vereq(list(sequence=(0, 1, 2)), range(3))
|
|
# note: as of Python 2.3, dict() no longer has an "items" keyword arg
|
|
|
|
for constructor in (int, float, long, complex, str, unicode,
|
|
tuple, list, file):
|
|
try:
|
|
constructor(bogus_keyword_arg=1)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("expected TypeError from bogus keyword "
|
|
"argument to %r" % constructor)
|
|
|
|
def restricted():
|
|
# XXX This test is disabled because rexec is not deemed safe
|
|
return
|
|
import rexec
|
|
if verbose:
|
|
print "Testing interaction with restricted execution ..."
|
|
|
|
sandbox = rexec.RExec()
|
|
|
|
code1 = """f = open(%r, 'w')""" % TESTFN
|
|
code2 = """f = open(%r, 'w')""" % TESTFN
|
|
code3 = """\
|
|
f = open(%r)
|
|
t = type(f) # a sneaky way to get the file() constructor
|
|
f.close()
|
|
f = t(%r, 'w') # rexec can't catch this by itself
|
|
""" % (TESTFN, TESTFN)
|
|
|
|
f = open(TESTFN, 'w') # Create the file so code3 can find it.
|
|
f.close()
|
|
|
|
try:
|
|
for code in code1, code2, code3:
|
|
try:
|
|
sandbox.r_exec(code)
|
|
except IOError, msg:
|
|
if str(msg).find("restricted") >= 0:
|
|
outcome = "OK"
|
|
else:
|
|
outcome = "got an exception, but not an expected one"
|
|
else:
|
|
outcome = "expected a restricted-execution exception"
|
|
|
|
if outcome != "OK":
|
|
raise TestFailed("%s, in %r" % (outcome, code))
|
|
|
|
finally:
|
|
try:
|
|
import os
|
|
os.unlink(TESTFN)
|
|
except:
|
|
pass
|
|
|
|
def str_subclass_as_dict_key():
|
|
if verbose:
|
|
print "Testing a str subclass used as dict key .."
|
|
|
|
class cistr(str):
|
|
"""Sublcass of str that computes __eq__ case-insensitively.
|
|
|
|
Also computes a hash code of the string in canonical form.
|
|
"""
|
|
|
|
def __init__(self, value):
|
|
self.canonical = value.lower()
|
|
self.hashcode = hash(self.canonical)
|
|
|
|
def __eq__(self, other):
|
|
if not isinstance(other, cistr):
|
|
other = cistr(other)
|
|
return self.canonical == other.canonical
|
|
|
|
def __hash__(self):
|
|
return self.hashcode
|
|
|
|
vereq(cistr('ABC'), 'abc')
|
|
vereq('aBc', cistr('ABC'))
|
|
vereq(str(cistr('ABC')), 'ABC')
|
|
|
|
d = {cistr('one'): 1, cistr('two'): 2, cistr('tHree'): 3}
|
|
vereq(d[cistr('one')], 1)
|
|
vereq(d[cistr('tWo')], 2)
|
|
vereq(d[cistr('THrEE')], 3)
|
|
verify(cistr('ONe') in d)
|
|
vereq(d.get(cistr('thrEE')), 3)
|
|
|
|
def classic_comparisons():
|
|
if verbose: print "Testing classic comparisons..."
|
|
class classic:
|
|
pass
|
|
for base in (classic, int, object):
|
|
if verbose: print " (base = %s)" % base
|
|
class C(base):
|
|
def __init__(self, value):
|
|
self.value = int(value)
|
|
def __eq__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value == other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value == other
|
|
return NotImplemented
|
|
def __ne__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value != other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value != other
|
|
return NotImplemented
|
|
def __lt__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value < other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value < other
|
|
return NotImplemented
|
|
def __le__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value <= other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value <= other
|
|
return NotImplemented
|
|
def __gt__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value > other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value > other
|
|
return NotImplemented
|
|
def __ge__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value >= other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value >= other
|
|
return NotImplemented
|
|
|
|
c1 = C(1)
|
|
c2 = C(2)
|
|
c3 = C(3)
|
|
vereq(c1, 1)
|
|
c = {1: c1, 2: c2, 3: c3}
|
|
for x in 1, 2, 3:
|
|
for y in 1, 2, 3:
|
|
##verify(cmp(c[x], c[y]) == cmp(x, y), "x=%d, y=%d" % (x, y))
|
|
for op in "<", "<=", "==", "!=", ">", ">=":
|
|
verify(eval("c[x] %s c[y]" % op) == eval("x %s y" % op),
|
|
"x=%d, y=%d" % (x, y))
|
|
##verify(cmp(c[x], y) == cmp(x, y), "x=%d, y=%d" % (x, y))
|
|
##verify(cmp(x, c[y]) == cmp(x, y), "x=%d, y=%d" % (x, y))
|
|
|
|
def rich_comparisons():
|
|
if verbose:
|
|
print "Testing rich comparisons..."
|
|
class Z(complex):
|
|
pass
|
|
z = Z(1)
|
|
vereq(z, 1+0j)
|
|
vereq(1+0j, z)
|
|
class ZZ(complex):
|
|
def __eq__(self, other):
|
|
try:
|
|
return abs(self - other) <= 1e-6
|
|
except:
|
|
return NotImplemented
|
|
zz = ZZ(1.0000003)
|
|
vereq(zz, 1+0j)
|
|
vereq(1+0j, zz)
|
|
|
|
class classic:
|
|
pass
|
|
for base in (classic, int, object, list):
|
|
if verbose: print " (base = %s)" % base
|
|
class C(base):
|
|
def __init__(self, value):
|
|
self.value = int(value)
|
|
def __cmp__(self, other):
|
|
raise TestFailed, "shouldn't call __cmp__"
|
|
def __eq__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value == other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value == other
|
|
return NotImplemented
|
|
def __ne__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value != other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value != other
|
|
return NotImplemented
|
|
def __lt__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value < other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value < other
|
|
return NotImplemented
|
|
def __le__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value <= other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value <= other
|
|
return NotImplemented
|
|
def __gt__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value > other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value > other
|
|
return NotImplemented
|
|
def __ge__(self, other):
|
|
if isinstance(other, C):
|
|
return self.value >= other.value
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
return self.value >= other
|
|
return NotImplemented
|
|
c1 = C(1)
|
|
c2 = C(2)
|
|
c3 = C(3)
|
|
vereq(c1, 1)
|
|
c = {1: c1, 2: c2, 3: c3}
|
|
for x in 1, 2, 3:
|
|
for y in 1, 2, 3:
|
|
for op in "<", "<=", "==", "!=", ">", ">=":
|
|
verify(eval("c[x] %s c[y]" % op) == eval("x %s y" % op),
|
|
"x=%d, y=%d" % (x, y))
|
|
verify(eval("c[x] %s y" % op) == eval("x %s y" % op),
|
|
"x=%d, y=%d" % (x, y))
|
|
verify(eval("x %s c[y]" % op) == eval("x %s y" % op),
|
|
"x=%d, y=%d" % (x, y))
|
|
|
|
def descrdoc():
|
|
if verbose: print "Testing descriptor doc strings..."
|
|
def check(descr, what):
|
|
vereq(descr.__doc__, what)
|
|
check(file.closed, "True if the file is closed") # getset descriptor
|
|
check(file.name, "file name") # member descriptor
|
|
|
|
def setclass():
|
|
if verbose: print "Testing __class__ assignment..."
|
|
class C(object): pass
|
|
class D(object): pass
|
|
class E(object): pass
|
|
class F(D, E): pass
|
|
for cls in C, D, E, F:
|
|
for cls2 in C, D, E, F:
|
|
x = cls()
|
|
x.__class__ = cls2
|
|
verify(x.__class__ is cls2)
|
|
x.__class__ = cls
|
|
verify(x.__class__ is cls)
|
|
def cant(x, C):
|
|
try:
|
|
x.__class__ = C
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow %r.__class__ = %r" % (x, C)
|
|
try:
|
|
delattr(x, "__class__")
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow del %r.__class__" % x
|
|
cant(C(), list)
|
|
cant(list(), C)
|
|
cant(C(), 1)
|
|
cant(C(), object)
|
|
cant(object(), list)
|
|
cant(list(), object)
|
|
class Int(int): __slots__ = []
|
|
cant(2, Int)
|
|
cant(Int(), int)
|
|
cant(True, int)
|
|
cant(2, bool)
|
|
o = object()
|
|
cant(o, type(1))
|
|
cant(o, type(None))
|
|
del o
|
|
|
|
def setdict():
|
|
if verbose: print "Testing __dict__ assignment..."
|
|
class C(object): pass
|
|
a = C()
|
|
a.__dict__ = {'b': 1}
|
|
vereq(a.b, 1)
|
|
def cant(x, dict):
|
|
try:
|
|
x.__dict__ = dict
|
|
except (AttributeError, TypeError):
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't allow %r.__dict__ = %r" % (x, dict)
|
|
cant(a, None)
|
|
cant(a, [])
|
|
cant(a, 1)
|
|
del a.__dict__ # Deleting __dict__ is allowed
|
|
# Classes don't allow __dict__ assignment
|
|
cant(C, {})
|
|
|
|
def pickles():
|
|
if verbose:
|
|
print "Testing pickling and copying new-style classes and objects..."
|
|
import pickle
|
|
try:
|
|
import cPickle
|
|
except ImportError:
|
|
cPickle = None
|
|
|
|
def sorteditems(d):
|
|
L = d.items()
|
|
L.sort()
|
|
return L
|
|
|
|
global C
|
|
class C(object):
|
|
def __init__(self, a, b):
|
|
super(C, self).__init__()
|
|
self.a = a
|
|
self.b = b
|
|
def __repr__(self):
|
|
return "C(%r, %r)" % (self.a, self.b)
|
|
|
|
global C1
|
|
class C1(list):
|
|
def __new__(cls, a, b):
|
|
return super(C1, cls).__new__(cls)
|
|
def __getnewargs__(self):
|
|
return (self.a, self.b)
|
|
def __init__(self, a, b):
|
|
self.a = a
|
|
self.b = b
|
|
def __repr__(self):
|
|
return "C1(%r, %r)<%r>" % (self.a, self.b, list(self))
|
|
|
|
global C2
|
|
class C2(int):
|
|
def __new__(cls, a, b, val=0):
|
|
return super(C2, cls).__new__(cls, val)
|
|
def __getnewargs__(self):
|
|
return (self.a, self.b, int(self))
|
|
def __init__(self, a, b, val=0):
|
|
self.a = a
|
|
self.b = b
|
|
def __repr__(self):
|
|
return "C2(%r, %r)<%r>" % (self.a, self.b, int(self))
|
|
|
|
global C3
|
|
class C3(object):
|
|
def __init__(self, foo):
|
|
self.foo = foo
|
|
def __getstate__(self):
|
|
return self.foo
|
|
def __setstate__(self, foo):
|
|
self.foo = foo
|
|
|
|
global C4classic, C4
|
|
class C4classic: # classic
|
|
pass
|
|
class C4(C4classic, object): # mixed inheritance
|
|
pass
|
|
|
|
for p in pickle, cPickle:
|
|
if p is None:
|
|
continue # cPickle not found -- skip it
|
|
for bin in 0, 1:
|
|
if verbose:
|
|
print p.__name__, ["text", "binary"][bin]
|
|
|
|
for cls in C, C1, C2:
|
|
s = p.dumps(cls, bin)
|
|
cls2 = p.loads(s)
|
|
verify(cls2 is cls)
|
|
|
|
a = C1(1, 2); a.append(42); a.append(24)
|
|
b = C2("hello", "world", 42)
|
|
s = p.dumps((a, b), bin)
|
|
x, y = p.loads(s)
|
|
vereq(x.__class__, a.__class__)
|
|
vereq(sorteditems(x.__dict__), sorteditems(a.__dict__))
|
|
vereq(y.__class__, b.__class__)
|
|
vereq(sorteditems(y.__dict__), sorteditems(b.__dict__))
|
|
vereq(repr(x), repr(a))
|
|
vereq(repr(y), repr(b))
|
|
if verbose:
|
|
print "a = x =", a
|
|
print "b = y =", b
|
|
# Test for __getstate__ and __setstate__ on new style class
|
|
u = C3(42)
|
|
s = p.dumps(u, bin)
|
|
v = p.loads(s)
|
|
veris(u.__class__, v.__class__)
|
|
vereq(u.foo, v.foo)
|
|
# Test for picklability of hybrid class
|
|
u = C4()
|
|
u.foo = 42
|
|
s = p.dumps(u, bin)
|
|
v = p.loads(s)
|
|
veris(u.__class__, v.__class__)
|
|
vereq(u.foo, v.foo)
|
|
|
|
# Testing copy.deepcopy()
|
|
if verbose:
|
|
print "deepcopy"
|
|
import copy
|
|
for cls in C, C1, C2:
|
|
cls2 = copy.deepcopy(cls)
|
|
verify(cls2 is cls)
|
|
|
|
a = C1(1, 2); a.append(42); a.append(24)
|
|
b = C2("hello", "world", 42)
|
|
x, y = copy.deepcopy((a, b))
|
|
vereq(x.__class__, a.__class__)
|
|
vereq(sorteditems(x.__dict__), sorteditems(a.__dict__))
|
|
vereq(y.__class__, b.__class__)
|
|
vereq(sorteditems(y.__dict__), sorteditems(b.__dict__))
|
|
vereq(repr(x), repr(a))
|
|
vereq(repr(y), repr(b))
|
|
if verbose:
|
|
print "a = x =", a
|
|
print "b = y =", b
|
|
|
|
def pickleslots():
|
|
if verbose: print "Testing pickling of classes with __slots__ ..."
|
|
import pickle, pickle as cPickle
|
|
# Pickling of classes with __slots__ but without __getstate__ should fail
|
|
global B, C, D, E
|
|
class B(object):
|
|
pass
|
|
for base in [object, B]:
|
|
class C(base):
|
|
__slots__ = ['a']
|
|
class D(C):
|
|
pass
|
|
try:
|
|
pickle.dumps(C())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "should fail: pickle C instance - %s" % base
|
|
try:
|
|
cPickle.dumps(C())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "should fail: cPickle C instance - %s" % base
|
|
try:
|
|
pickle.dumps(C())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "should fail: pickle D instance - %s" % base
|
|
try:
|
|
cPickle.dumps(D())
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "should fail: cPickle D instance - %s" % base
|
|
# Give C a nice generic __getstate__ and __setstate__
|
|
class C(base):
|
|
__slots__ = ['a']
|
|
def __getstate__(self):
|
|
try:
|
|
d = self.__dict__.copy()
|
|
except AttributeError:
|
|
d = {}
|
|
for cls in self.__class__.__mro__:
|
|
for sn in cls.__dict__.get('__slots__', ()):
|
|
try:
|
|
d[sn] = getattr(self, sn)
|
|
except AttributeError:
|
|
pass
|
|
return d
|
|
def __setstate__(self, d):
|
|
for k, v in d.items():
|
|
setattr(self, k, v)
|
|
class D(C):
|
|
pass
|
|
# Now it should work
|
|
x = C()
|
|
y = pickle.loads(pickle.dumps(x))
|
|
vereq(hasattr(y, 'a'), 0)
|
|
y = cPickle.loads(cPickle.dumps(x))
|
|
vereq(hasattr(y, 'a'), 0)
|
|
x.a = 42
|
|
y = pickle.loads(pickle.dumps(x))
|
|
vereq(y.a, 42)
|
|
y = cPickle.loads(cPickle.dumps(x))
|
|
vereq(y.a, 42)
|
|
x = D()
|
|
x.a = 42
|
|
x.b = 100
|
|
y = pickle.loads(pickle.dumps(x))
|
|
vereq(y.a + y.b, 142)
|
|
y = cPickle.loads(cPickle.dumps(x))
|
|
vereq(y.a + y.b, 142)
|
|
# A subclass that adds a slot should also work
|
|
class E(C):
|
|
__slots__ = ['b']
|
|
x = E()
|
|
x.a = 42
|
|
x.b = "foo"
|
|
y = pickle.loads(pickle.dumps(x))
|
|
vereq(y.a, x.a)
|
|
vereq(y.b, x.b)
|
|
y = cPickle.loads(cPickle.dumps(x))
|
|
vereq(y.a, x.a)
|
|
vereq(y.b, x.b)
|
|
|
|
def copies():
|
|
if verbose: print "Testing copy.copy() and copy.deepcopy()..."
|
|
import copy
|
|
class C(object):
|
|
pass
|
|
|
|
a = C()
|
|
a.foo = 12
|
|
b = copy.copy(a)
|
|
vereq(b.__dict__, a.__dict__)
|
|
|
|
a.bar = [1,2,3]
|
|
c = copy.copy(a)
|
|
vereq(c.bar, a.bar)
|
|
verify(c.bar is a.bar)
|
|
|
|
d = copy.deepcopy(a)
|
|
vereq(d.__dict__, a.__dict__)
|
|
a.bar.append(4)
|
|
vereq(d.bar, [1,2,3])
|
|
|
|
def binopoverride():
|
|
if verbose: print "Testing overrides of binary operations..."
|
|
class I(int):
|
|
def __repr__(self):
|
|
return "I(%r)" % int(self)
|
|
def __add__(self, other):
|
|
return I(int(self) + int(other))
|
|
__radd__ = __add__
|
|
def __pow__(self, other, mod=None):
|
|
if mod is None:
|
|
return I(pow(int(self), int(other)))
|
|
else:
|
|
return I(pow(int(self), int(other), int(mod)))
|
|
def __rpow__(self, other, mod=None):
|
|
if mod is None:
|
|
return I(pow(int(other), int(self), mod))
|
|
else:
|
|
return I(pow(int(other), int(self), int(mod)))
|
|
|
|
vereq(repr(I(1) + I(2)), "I(3)")
|
|
vereq(repr(I(1) + 2), "I(3)")
|
|
vereq(repr(1 + I(2)), "I(3)")
|
|
vereq(repr(I(2) ** I(3)), "I(8)")
|
|
vereq(repr(2 ** I(3)), "I(8)")
|
|
vereq(repr(I(2) ** 3), "I(8)")
|
|
vereq(repr(pow(I(2), I(3), I(5))), "I(3)")
|
|
class S(str):
|
|
def __eq__(self, other):
|
|
return self.lower() == other.lower()
|
|
|
|
def subclasspropagation():
|
|
if verbose: print "Testing propagation of slot functions to subclasses..."
|
|
class A(object):
|
|
pass
|
|
class B(A):
|
|
pass
|
|
class C(A):
|
|
pass
|
|
class D(B, C):
|
|
pass
|
|
d = D()
|
|
orig_hash = hash(d) # related to id(d) in platform-dependent ways
|
|
A.__hash__ = lambda self: 42
|
|
vereq(hash(d), 42)
|
|
C.__hash__ = lambda self: 314
|
|
vereq(hash(d), 314)
|
|
B.__hash__ = lambda self: 144
|
|
vereq(hash(d), 144)
|
|
D.__hash__ = lambda self: 100
|
|
vereq(hash(d), 100)
|
|
del D.__hash__
|
|
vereq(hash(d), 144)
|
|
del B.__hash__
|
|
vereq(hash(d), 314)
|
|
del C.__hash__
|
|
vereq(hash(d), 42)
|
|
del A.__hash__
|
|
vereq(hash(d), orig_hash)
|
|
d.foo = 42
|
|
d.bar = 42
|
|
vereq(d.foo, 42)
|
|
vereq(d.bar, 42)
|
|
def __getattribute__(self, name):
|
|
if name == "foo":
|
|
return 24
|
|
return object.__getattribute__(self, name)
|
|
A.__getattribute__ = __getattribute__
|
|
vereq(d.foo, 24)
|
|
vereq(d.bar, 42)
|
|
def __getattr__(self, name):
|
|
if name in ("spam", "foo", "bar"):
|
|
return "hello"
|
|
raise AttributeError, name
|
|
B.__getattr__ = __getattr__
|
|
vereq(d.spam, "hello")
|
|
vereq(d.foo, 24)
|
|
vereq(d.bar, 42)
|
|
del A.__getattribute__
|
|
vereq(d.foo, 42)
|
|
del d.foo
|
|
vereq(d.foo, "hello")
|
|
vereq(d.bar, 42)
|
|
del B.__getattr__
|
|
try:
|
|
d.foo
|
|
except AttributeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "d.foo should be undefined now"
|
|
|
|
# Test a nasty bug in recurse_down_subclasses()
|
|
import gc
|
|
class A(object):
|
|
pass
|
|
class B(A):
|
|
pass
|
|
del B
|
|
gc.collect()
|
|
A.__setitem__ = lambda *a: None # crash
|
|
|
|
def buffer_inherit():
|
|
import binascii
|
|
# SF bug [#470040] ParseTuple t# vs subclasses.
|
|
if verbose:
|
|
print "Testing that buffer interface is inherited ..."
|
|
|
|
class MyStr(str):
|
|
pass
|
|
base = 'abc'
|
|
m = MyStr(base)
|
|
# b2a_hex uses the buffer interface to get its argument's value, via
|
|
# PyArg_ParseTuple 't#' code.
|
|
vereq(binascii.b2a_hex(m), binascii.b2a_hex(base))
|
|
|
|
# It's not clear that unicode will continue to support the character
|
|
# buffer interface, and this test will fail if that's taken away.
|
|
class MyUni(unicode):
|
|
pass
|
|
base = u'abc'
|
|
m = MyUni(base)
|
|
vereq(binascii.b2a_hex(m), binascii.b2a_hex(base))
|
|
|
|
class MyInt(int):
|
|
pass
|
|
m = MyInt(42)
|
|
try:
|
|
binascii.b2a_hex(m)
|
|
raise TestFailed('subclass of int should not have a buffer interface')
|
|
except TypeError:
|
|
pass
|
|
|
|
def str_of_str_subclass():
|
|
import binascii
|
|
import cStringIO
|
|
|
|
if verbose:
|
|
print "Testing __str__ defined in subclass of str ..."
|
|
|
|
class octetstring(str):
|
|
def __str__(self):
|
|
return binascii.b2a_hex(self)
|
|
def __repr__(self):
|
|
return self + " repr"
|
|
|
|
o = octetstring('A')
|
|
vereq(type(o), octetstring)
|
|
vereq(type(str(o)), str)
|
|
vereq(type(repr(o)), str)
|
|
vereq(ord(o), 0x41)
|
|
vereq(str(o), '41')
|
|
vereq(repr(o), 'A repr')
|
|
vereq(o.__str__(), '41')
|
|
vereq(o.__repr__(), 'A repr')
|
|
|
|
capture = cStringIO.StringIO()
|
|
# Calling str() or not exercises different internal paths.
|
|
print >> capture, o
|
|
print >> capture, str(o)
|
|
vereq(capture.getvalue(), '41\n41\n')
|
|
capture.close()
|
|
|
|
def kwdargs():
|
|
if verbose: print "Testing keyword arguments to __init__, __call__..."
|
|
def f(a): return a
|
|
vereq(f.__call__(a=42), 42)
|
|
a = []
|
|
list.__init__(a, sequence=[0, 1, 2])
|
|
vereq(a, [0, 1, 2])
|
|
|
|
def recursive__call__():
|
|
if verbose: print ("Testing recursive __call__() by setting to instance of "
|
|
"class ...")
|
|
class A(object):
|
|
pass
|
|
|
|
A.__call__ = A()
|
|
try:
|
|
A()()
|
|
except RuntimeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("Recursion limit should have been reached for "
|
|
"__call__()")
|
|
|
|
def delhook():
|
|
if verbose: print "Testing __del__ hook..."
|
|
log = []
|
|
class C(object):
|
|
def __del__(self):
|
|
log.append(1)
|
|
c = C()
|
|
vereq(log, [])
|
|
del c
|
|
vereq(log, [1])
|
|
|
|
class D(object): pass
|
|
d = D()
|
|
try: del d[0]
|
|
except TypeError: pass
|
|
else: raise TestFailed, "invalid del() didn't raise TypeError"
|
|
|
|
def hashinherit():
|
|
if verbose: print "Testing hash of mutable subclasses..."
|
|
|
|
class mydict(dict):
|
|
pass
|
|
d = mydict()
|
|
try:
|
|
hash(d)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "hash() of dict subclass should fail"
|
|
|
|
class mylist(list):
|
|
pass
|
|
d = mylist()
|
|
try:
|
|
hash(d)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "hash() of list subclass should fail"
|
|
|
|
def strops():
|
|
try: 'a' + 5
|
|
except TypeError: pass
|
|
else: raise TestFailed, "'' + 5 doesn't raise TypeError"
|
|
|
|
try: ''.split('')
|
|
except ValueError: pass
|
|
else: raise TestFailed, "''.split('') doesn't raise ValueError"
|
|
|
|
try: ''.join([0])
|
|
except TypeError: pass
|
|
else: raise TestFailed, "''.join([0]) doesn't raise TypeError"
|
|
|
|
try: ''.rindex('5')
|
|
except ValueError: pass
|
|
else: raise TestFailed, "''.rindex('5') doesn't raise ValueError"
|
|
|
|
try: '%(n)s' % None
|
|
except TypeError: pass
|
|
else: raise TestFailed, "'%(n)s' % None doesn't raise TypeError"
|
|
|
|
try: '%(n' % {}
|
|
except ValueError: pass
|
|
else: raise TestFailed, "'%(n' % {} '' doesn't raise ValueError"
|
|
|
|
try: '%*s' % ('abc')
|
|
except TypeError: pass
|
|
else: raise TestFailed, "'%*s' % ('abc') doesn't raise TypeError"
|
|
|
|
try: '%*.*s' % ('abc', 5)
|
|
except TypeError: pass
|
|
else: raise TestFailed, "'%*.*s' % ('abc', 5) doesn't raise TypeError"
|
|
|
|
try: '%s' % (1, 2)
|
|
except TypeError: pass
|
|
else: raise TestFailed, "'%s' % (1, 2) doesn't raise TypeError"
|
|
|
|
try: '%' % None
|
|
except ValueError: pass
|
|
else: raise TestFailed, "'%' % None doesn't raise ValueError"
|
|
|
|
vereq('534253'.isdigit(), 1)
|
|
vereq('534253x'.isdigit(), 0)
|
|
vereq('%c' % 5, '\x05')
|
|
vereq('%c' % '5', '5')
|
|
|
|
def deepcopyrecursive():
|
|
if verbose: print "Testing deepcopy of recursive objects..."
|
|
class Node:
|
|
pass
|
|
a = Node()
|
|
b = Node()
|
|
a.b = b
|
|
b.a = a
|
|
z = deepcopy(a) # This blew up before
|
|
|
|
def modules():
|
|
if verbose: print "Testing uninitialized module objects..."
|
|
from types import ModuleType as M
|
|
m = M.__new__(M)
|
|
str(m)
|
|
vereq(hasattr(m, "__name__"), 0)
|
|
vereq(hasattr(m, "__file__"), 0)
|
|
vereq(hasattr(m, "foo"), 0)
|
|
vereq(m.__dict__, None)
|
|
m.foo = 1
|
|
vereq(m.__dict__, {"foo": 1})
|
|
|
|
def dictproxyiterkeys():
|
|
class C(object):
|
|
def meth(self):
|
|
pass
|
|
if verbose: print "Testing dict-proxy iterkeys..."
|
|
keys = [ key for key in C.__dict__.iterkeys() ]
|
|
keys.sort()
|
|
vereq(keys, ['__dict__', '__doc__', '__module__', '__weakref__', 'meth'])
|
|
|
|
def dictproxyitervalues():
|
|
class C(object):
|
|
def meth(self):
|
|
pass
|
|
if verbose: print "Testing dict-proxy itervalues..."
|
|
values = [ values for values in C.__dict__.itervalues() ]
|
|
vereq(len(values), 5)
|
|
|
|
def dictproxyiteritems():
|
|
class C(object):
|
|
def meth(self):
|
|
pass
|
|
if verbose: print "Testing dict-proxy iteritems..."
|
|
keys = [ key for (key, value) in C.__dict__.iteritems() ]
|
|
keys.sort()
|
|
vereq(keys, ['__dict__', '__doc__', '__module__', '__weakref__', 'meth'])
|
|
|
|
def funnynew():
|
|
if verbose: print "Testing __new__ returning something unexpected..."
|
|
class C(object):
|
|
def __new__(cls, arg):
|
|
if isinstance(arg, str): return [1, 2, 3]
|
|
elif isinstance(arg, int): return object.__new__(D)
|
|
else: return object.__new__(cls)
|
|
class D(C):
|
|
def __init__(self, arg):
|
|
self.foo = arg
|
|
vereq(C("1"), [1, 2, 3])
|
|
vereq(D("1"), [1, 2, 3])
|
|
d = D(None)
|
|
veris(d.foo, None)
|
|
d = C(1)
|
|
vereq(isinstance(d, D), True)
|
|
vereq(d.foo, 1)
|
|
d = D(1)
|
|
vereq(isinstance(d, D), True)
|
|
vereq(d.foo, 1)
|
|
|
|
def imulbug():
|
|
# SF bug 544647
|
|
if verbose: print "Testing for __imul__ problems..."
|
|
class C(object):
|
|
def __imul__(self, other):
|
|
return (self, other)
|
|
x = C()
|
|
y = x
|
|
y *= 1.0
|
|
vereq(y, (x, 1.0))
|
|
y = x
|
|
y *= 2
|
|
vereq(y, (x, 2))
|
|
y = x
|
|
y *= 3L
|
|
vereq(y, (x, 3L))
|
|
y = x
|
|
y *= 1L<<100
|
|
vereq(y, (x, 1L<<100))
|
|
y = x
|
|
y *= None
|
|
vereq(y, (x, None))
|
|
y = x
|
|
y *= "foo"
|
|
vereq(y, (x, "foo"))
|
|
|
|
def docdescriptor():
|
|
# SF bug 542984
|
|
if verbose: print "Testing __doc__ descriptor..."
|
|
class DocDescr(object):
|
|
def __get__(self, object, otype):
|
|
if object:
|
|
object = object.__class__.__name__ + ' instance'
|
|
if otype:
|
|
otype = otype.__name__
|
|
return 'object=%s; type=%s' % (object, otype)
|
|
class OldClass:
|
|
__doc__ = DocDescr()
|
|
class NewClass(object):
|
|
__doc__ = DocDescr()
|
|
vereq(OldClass.__doc__, 'object=None; type=OldClass')
|
|
vereq(OldClass().__doc__, 'object=OldClass instance; type=OldClass')
|
|
vereq(NewClass.__doc__, 'object=None; type=NewClass')
|
|
vereq(NewClass().__doc__, 'object=NewClass instance; type=NewClass')
|
|
|
|
def copy_setstate():
|
|
if verbose:
|
|
print "Testing that copy.*copy() correctly uses __setstate__..."
|
|
import copy
|
|
class C(object):
|
|
def __init__(self, foo=None):
|
|
self.foo = foo
|
|
self.__foo = foo
|
|
def setfoo(self, foo=None):
|
|
self.foo = foo
|
|
def getfoo(self):
|
|
return self.__foo
|
|
def __getstate__(self):
|
|
return [self.foo]
|
|
def __setstate__(self, lst):
|
|
assert len(lst) == 1
|
|
self.__foo = self.foo = lst[0]
|
|
a = C(42)
|
|
a.setfoo(24)
|
|
vereq(a.foo, 24)
|
|
vereq(a.getfoo(), 42)
|
|
b = copy.copy(a)
|
|
vereq(b.foo, 24)
|
|
vereq(b.getfoo(), 24)
|
|
b = copy.deepcopy(a)
|
|
vereq(b.foo, 24)
|
|
vereq(b.getfoo(), 24)
|
|
|
|
def slices():
|
|
if verbose:
|
|
print "Testing cases with slices and overridden __getitem__ ..."
|
|
# Strings
|
|
vereq("hello"[:4], "hell")
|
|
vereq("hello"[slice(4)], "hell")
|
|
vereq(str.__getitem__("hello", slice(4)), "hell")
|
|
class S(str):
|
|
def __getitem__(self, x):
|
|
return str.__getitem__(self, x)
|
|
vereq(S("hello")[:4], "hell")
|
|
vereq(S("hello")[slice(4)], "hell")
|
|
vereq(S("hello").__getitem__(slice(4)), "hell")
|
|
# Tuples
|
|
vereq((1,2,3)[:2], (1,2))
|
|
vereq((1,2,3)[slice(2)], (1,2))
|
|
vereq(tuple.__getitem__((1,2,3), slice(2)), (1,2))
|
|
class T(tuple):
|
|
def __getitem__(self, x):
|
|
return tuple.__getitem__(self, x)
|
|
vereq(T((1,2,3))[:2], (1,2))
|
|
vereq(T((1,2,3))[slice(2)], (1,2))
|
|
vereq(T((1,2,3)).__getitem__(slice(2)), (1,2))
|
|
# Lists
|
|
vereq([1,2,3][:2], [1,2])
|
|
vereq([1,2,3][slice(2)], [1,2])
|
|
vereq(list.__getitem__([1,2,3], slice(2)), [1,2])
|
|
class L(list):
|
|
def __getitem__(self, x):
|
|
return list.__getitem__(self, x)
|
|
vereq(L([1,2,3])[:2], [1,2])
|
|
vereq(L([1,2,3])[slice(2)], [1,2])
|
|
vereq(L([1,2,3]).__getitem__(slice(2)), [1,2])
|
|
# Now do lists and __setitem__
|
|
a = L([1,2,3])
|
|
a[slice(1, 3)] = [3,2]
|
|
vereq(a, [1,3,2])
|
|
a[slice(0, 2, 1)] = [3,1]
|
|
vereq(a, [3,1,2])
|
|
a.__setitem__(slice(1, 3), [2,1])
|
|
vereq(a, [3,2,1])
|
|
a.__setitem__(slice(0, 2, 1), [2,3])
|
|
vereq(a, [2,3,1])
|
|
|
|
def subtype_resurrection():
|
|
if verbose:
|
|
print "Testing resurrection of new-style instance..."
|
|
|
|
class C(object):
|
|
container = []
|
|
|
|
def __del__(self):
|
|
# resurrect the instance
|
|
C.container.append(self)
|
|
|
|
c = C()
|
|
c.attr = 42
|
|
# The most interesting thing here is whether this blows up, due to flawed
|
|
# GC tracking logic in typeobject.c's call_finalizer() (a 2.2.1 bug).
|
|
del c
|
|
|
|
# If that didn't blow up, it's also interesting to see whether clearing
|
|
# the last container slot works: that will attempt to delete c again,
|
|
# which will cause c to get appended back to the container again "during"
|
|
# the del.
|
|
del C.container[-1]
|
|
vereq(len(C.container), 1)
|
|
vereq(C.container[-1].attr, 42)
|
|
|
|
# Make c mortal again, so that the test framework with -l doesn't report
|
|
# it as a leak.
|
|
del C.__del__
|
|
|
|
def slottrash():
|
|
# Deallocating deeply nested slotted trash caused stack overflows
|
|
if verbose:
|
|
print "Testing slot trash..."
|
|
class trash(object):
|
|
__slots__ = ['x']
|
|
def __init__(self, x):
|
|
self.x = x
|
|
o = None
|
|
for i in xrange(50000):
|
|
o = trash(o)
|
|
del o
|
|
|
|
def slotmultipleinheritance():
|
|
# SF bug 575229, multiple inheritance w/ slots dumps core
|
|
class A(object):
|
|
__slots__=()
|
|
class B(object):
|
|
pass
|
|
class C(A,B) :
|
|
__slots__=()
|
|
vereq(C.__basicsize__, B.__basicsize__)
|
|
verify(hasattr(C, '__dict__'))
|
|
verify(hasattr(C, '__weakref__'))
|
|
C().x = 2
|
|
|
|
def testrmul():
|
|
# SF patch 592646
|
|
if verbose:
|
|
print "Testing correct invocation of __rmul__..."
|
|
class C(object):
|
|
def __mul__(self, other):
|
|
return "mul"
|
|
def __rmul__(self, other):
|
|
return "rmul"
|
|
a = C()
|
|
vereq(a*2, "mul")
|
|
vereq(a*2.2, "mul")
|
|
vereq(2*a, "rmul")
|
|
vereq(2.2*a, "rmul")
|
|
|
|
def testipow():
|
|
# [SF bug 620179]
|
|
if verbose:
|
|
print "Testing correct invocation of __ipow__..."
|
|
class C(object):
|
|
def __ipow__(self, other):
|
|
pass
|
|
a = C()
|
|
a **= 2
|
|
|
|
def do_this_first():
|
|
if verbose:
|
|
print "Testing SF bug 551412 ..."
|
|
# This dumps core when SF bug 551412 isn't fixed --
|
|
# but only when test_descr.py is run separately.
|
|
# (That can't be helped -- as soon as PyType_Ready()
|
|
# is called for PyLong_Type, the bug is gone.)
|
|
class UserLong(object):
|
|
def __pow__(self, *args):
|
|
pass
|
|
try:
|
|
pow(0L, UserLong(), 0L)
|
|
except:
|
|
pass
|
|
|
|
if verbose:
|
|
print "Testing SF bug 570483..."
|
|
# Another segfault only when run early
|
|
# (before PyType_Ready(tuple) is called)
|
|
type.mro(tuple)
|
|
|
|
def test_mutable_bases():
|
|
if verbose:
|
|
print "Testing mutable bases..."
|
|
# stuff that should work:
|
|
class C(object):
|
|
pass
|
|
class C2(object):
|
|
def __getattribute__(self, attr):
|
|
if attr == 'a':
|
|
return 2
|
|
else:
|
|
return super(C2, self).__getattribute__(attr)
|
|
def meth(self):
|
|
return 1
|
|
class D(C):
|
|
pass
|
|
class E(D):
|
|
pass
|
|
d = D()
|
|
e = E()
|
|
D.__bases__ = (C,)
|
|
D.__bases__ = (C2,)
|
|
vereq(d.meth(), 1)
|
|
vereq(e.meth(), 1)
|
|
vereq(d.a, 2)
|
|
vereq(e.a, 2)
|
|
vereq(C2.__subclasses__(), [D])
|
|
|
|
# stuff that shouldn't:
|
|
class L(list):
|
|
pass
|
|
|
|
try:
|
|
L.__bases__ = (dict,)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't turn list subclass into dict subclass"
|
|
|
|
try:
|
|
list.__bases__ = (dict,)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't be able to assign to list.__bases__"
|
|
|
|
try:
|
|
D.__bases__ = (C2, list)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
assert 0, "best_base calculation found wanting"
|
|
|
|
try:
|
|
del D.__bases__
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't be able to delete .__bases__"
|
|
|
|
try:
|
|
D.__bases__ = ()
|
|
except TypeError, msg:
|
|
if str(msg) == "a new-style class can't have only classic bases":
|
|
raise TestFailed, "wrong error message for .__bases__ = ()"
|
|
else:
|
|
raise TestFailed, "shouldn't be able to set .__bases__ to ()"
|
|
|
|
try:
|
|
D.__bases__ = (D,)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
# actually, we'll have crashed by here...
|
|
raise TestFailed, "shouldn't be able to create inheritance cycles"
|
|
|
|
try:
|
|
D.__bases__ = (C, C)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "didn't detect repeated base classes"
|
|
|
|
try:
|
|
D.__bases__ = (E,)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't be able to create inheritance cycles"
|
|
|
|
def test_mutable_bases_with_failing_mro():
|
|
if verbose:
|
|
print "Testing mutable bases with failing mro..."
|
|
class WorkOnce(type):
|
|
def __new__(self, name, bases, ns):
|
|
self.flag = 0
|
|
return super(WorkOnce, self).__new__(WorkOnce, name, bases, ns)
|
|
def mro(self):
|
|
if self.flag > 0:
|
|
raise RuntimeError, "bozo"
|
|
else:
|
|
self.flag += 1
|
|
return type.mro(self)
|
|
|
|
class WorkAlways(type):
|
|
def mro(self):
|
|
# this is here to make sure that .mro()s aren't called
|
|
# with an exception set (which was possible at one point).
|
|
# An error message will be printed in a debug build.
|
|
# What's a good way to test for this?
|
|
return type.mro(self)
|
|
|
|
class C(object):
|
|
pass
|
|
|
|
class C2(object):
|
|
pass
|
|
|
|
class D(C):
|
|
pass
|
|
|
|
class E(D):
|
|
pass
|
|
|
|
class F(D):
|
|
__metaclass__ = WorkOnce
|
|
|
|
class G(D):
|
|
__metaclass__ = WorkAlways
|
|
|
|
# Immediate subclasses have their mro's adjusted in alphabetical
|
|
# order, so E's will get adjusted before adjusting F's fails. We
|
|
# check here that E's gets restored.
|
|
|
|
E_mro_before = E.__mro__
|
|
D_mro_before = D.__mro__
|
|
|
|
try:
|
|
D.__bases__ = (C2,)
|
|
except RuntimeError:
|
|
vereq(E.__mro__, E_mro_before)
|
|
vereq(D.__mro__, D_mro_before)
|
|
else:
|
|
raise TestFailed, "exception not propagated"
|
|
|
|
def test_mutable_bases_catch_mro_conflict():
|
|
if verbose:
|
|
print "Testing mutable bases catch mro conflict..."
|
|
class A(object):
|
|
pass
|
|
|
|
class B(object):
|
|
pass
|
|
|
|
class C(A, B):
|
|
pass
|
|
|
|
class D(A, B):
|
|
pass
|
|
|
|
class E(C, D):
|
|
pass
|
|
|
|
try:
|
|
C.__bases__ = (B, A)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "didn't catch MRO conflict"
|
|
|
|
def mutable_names():
|
|
if verbose:
|
|
print "Testing mutable names..."
|
|
class C(object):
|
|
pass
|
|
|
|
# C.__module__ could be 'test_descr' or '__main__'
|
|
mod = C.__module__
|
|
|
|
C.__name__ = 'D'
|
|
vereq((C.__module__, C.__name__), (mod, 'D'))
|
|
|
|
C.__name__ = 'D.E'
|
|
vereq((C.__module__, C.__name__), (mod, 'D.E'))
|
|
|
|
def subclass_right_op():
|
|
if verbose:
|
|
print "Testing correct dispatch of subclass overloading __r<op>__..."
|
|
|
|
# This code tests various cases where right-dispatch of a subclass
|
|
# should be preferred over left-dispatch of a base class.
|
|
|
|
# Case 1: subclass of int; this tests code in abstract.c::binary_op1()
|
|
|
|
class B(int):
|
|
def __floordiv__(self, other):
|
|
return "B.__floordiv__"
|
|
def __rfloordiv__(self, other):
|
|
return "B.__rfloordiv__"
|
|
|
|
vereq(B(1) // 1, "B.__floordiv__")
|
|
vereq(1 // B(1), "B.__rfloordiv__")
|
|
|
|
# Case 2: subclass of object; this is just the baseline for case 3
|
|
|
|
class C(object):
|
|
def __floordiv__(self, other):
|
|
return "C.__floordiv__"
|
|
def __rfloordiv__(self, other):
|
|
return "C.__rfloordiv__"
|
|
|
|
vereq(C() // 1, "C.__floordiv__")
|
|
vereq(1 // C(), "C.__rfloordiv__")
|
|
|
|
# Case 3: subclass of new-style class; here it gets interesting
|
|
|
|
class D(C):
|
|
def __floordiv__(self, other):
|
|
return "D.__floordiv__"
|
|
def __rfloordiv__(self, other):
|
|
return "D.__rfloordiv__"
|
|
|
|
vereq(D() // C(), "D.__floordiv__")
|
|
vereq(C() // D(), "D.__rfloordiv__")
|
|
|
|
# Case 4: this didn't work right in 2.2.2 and 2.3a1
|
|
|
|
class E(C):
|
|
pass
|
|
|
|
vereq(E.__rfloordiv__, C.__rfloordiv__)
|
|
|
|
vereq(E() // 1, "C.__floordiv__")
|
|
vereq(1 // E(), "C.__rfloordiv__")
|
|
vereq(E() // C(), "C.__floordiv__")
|
|
vereq(C() // E(), "C.__floordiv__") # This one would fail
|
|
|
|
def dict_type_with_metaclass():
|
|
if verbose:
|
|
print "Testing type of __dict__ when __metaclass__ set..."
|
|
|
|
class B(object):
|
|
pass
|
|
class M(type):
|
|
pass
|
|
class C:
|
|
# In 2.3a1, C.__dict__ was a real dict rather than a dict proxy
|
|
__metaclass__ = M
|
|
veris(type(C.__dict__), type(B.__dict__))
|
|
|
|
def meth_class_get():
|
|
# Full coverage of descrobject.c::classmethod_get()
|
|
if verbose:
|
|
print "Testing __get__ method of METH_CLASS C methods..."
|
|
# Baseline
|
|
arg = [1, 2, 3]
|
|
res = {1: None, 2: None, 3: None}
|
|
vereq(dict.fromkeys(arg), res)
|
|
vereq({}.fromkeys(arg), res)
|
|
# Now get the descriptor
|
|
descr = dict.__dict__["fromkeys"]
|
|
# More baseline using the descriptor directly
|
|
vereq(descr.__get__(None, dict)(arg), res)
|
|
vereq(descr.__get__({})(arg), res)
|
|
# Now check various error cases
|
|
try:
|
|
descr.__get__(None, None)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't have allowed descr.__get__(None, None)"
|
|
try:
|
|
descr.__get__(42)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't have allowed descr.__get__(42)"
|
|
try:
|
|
descr.__get__(None, 42)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't have allowed descr.__get__(None, 42)"
|
|
try:
|
|
descr.__get__(None, int)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "shouldn't have allowed descr.__get__(None, int)"
|
|
|
|
def isinst_isclass():
|
|
if verbose:
|
|
print "Testing proxy isinstance() and isclass()..."
|
|
class Proxy(object):
|
|
def __init__(self, obj):
|
|
self.__obj = obj
|
|
def __getattribute__(self, name):
|
|
if name.startswith("_Proxy__"):
|
|
return object.__getattribute__(self, name)
|
|
else:
|
|
return getattr(self.__obj, name)
|
|
# Test with a classic class
|
|
class C:
|
|
pass
|
|
a = C()
|
|
pa = Proxy(a)
|
|
verify(isinstance(a, C)) # Baseline
|
|
verify(isinstance(pa, C)) # Test
|
|
# Test with a classic subclass
|
|
class D(C):
|
|
pass
|
|
a = D()
|
|
pa = Proxy(a)
|
|
verify(isinstance(a, C)) # Baseline
|
|
verify(isinstance(pa, C)) # Test
|
|
# Test with a new-style class
|
|
class C(object):
|
|
pass
|
|
a = C()
|
|
pa = Proxy(a)
|
|
verify(isinstance(a, C)) # Baseline
|
|
verify(isinstance(pa, C)) # Test
|
|
# Test with a new-style subclass
|
|
class D(C):
|
|
pass
|
|
a = D()
|
|
pa = Proxy(a)
|
|
verify(isinstance(a, C)) # Baseline
|
|
verify(isinstance(pa, C)) # Test
|
|
|
|
def proxysuper():
|
|
if verbose:
|
|
print "Testing super() for a proxy object..."
|
|
class Proxy(object):
|
|
def __init__(self, obj):
|
|
self.__obj = obj
|
|
def __getattribute__(self, name):
|
|
if name.startswith("_Proxy__"):
|
|
return object.__getattribute__(self, name)
|
|
else:
|
|
return getattr(self.__obj, name)
|
|
|
|
class B(object):
|
|
def f(self):
|
|
return "B.f"
|
|
|
|
class C(B):
|
|
def f(self):
|
|
return super(C, self).f() + "->C.f"
|
|
|
|
obj = C()
|
|
p = Proxy(obj)
|
|
vereq(C.__dict__["f"](p), "B.f->C.f")
|
|
|
|
def carloverre():
|
|
if verbose:
|
|
print "Testing prohibition of Carlo Verre's hack..."
|
|
try:
|
|
object.__setattr__(str, "foo", 42)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "Carlo Verre __setattr__ suceeded!"
|
|
try:
|
|
object.__delattr__(str, "lower")
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "Carlo Verre __delattr__ succeeded!"
|
|
|
|
def weakref_segfault():
|
|
# SF 742911
|
|
if verbose:
|
|
print "Testing weakref segfault..."
|
|
|
|
import weakref
|
|
|
|
class Provoker:
|
|
def __init__(self, referrent):
|
|
self.ref = weakref.ref(referrent)
|
|
|
|
def __del__(self):
|
|
x = self.ref()
|
|
|
|
class Oops(object):
|
|
pass
|
|
|
|
o = Oops()
|
|
o.whatever = Provoker(o)
|
|
del o
|
|
|
|
def wrapper_segfault():
|
|
# SF 927248: deeply nested wrappers could cause stack overflow
|
|
f = lambda:None
|
|
for i in xrange(1000000):
|
|
f = f.__call__
|
|
f = None
|
|
|
|
# Fix SF #762455, segfault when sys.stdout is changed in getattr
|
|
def filefault():
|
|
if verbose:
|
|
print "Testing sys.stdout is changed in getattr..."
|
|
import sys
|
|
class StdoutGuard:
|
|
def __getattr__(self, attr):
|
|
sys.stdout = sys.__stdout__
|
|
raise RuntimeError("Premature access to sys.stdout.%s" % attr)
|
|
sys.stdout = StdoutGuard()
|
|
try:
|
|
print "Oops!"
|
|
except RuntimeError:
|
|
pass
|
|
|
|
def vicious_descriptor_nonsense():
|
|
# A potential segfault spotted by Thomas Wouters in mail to
|
|
# python-dev 2003-04-17, turned into an example & fixed by Michael
|
|
# Hudson just less than four months later...
|
|
if verbose:
|
|
print "Testing vicious_descriptor_nonsense..."
|
|
|
|
class Evil(object):
|
|
def __hash__(self):
|
|
return hash('attr')
|
|
def __eq__(self, other):
|
|
del C.attr
|
|
return 0
|
|
|
|
class Descr(object):
|
|
def __get__(self, ob, type=None):
|
|
return 1
|
|
|
|
class C(object):
|
|
attr = Descr()
|
|
|
|
c = C()
|
|
c.__dict__[Evil()] = 0
|
|
|
|
vereq(c.attr, 1)
|
|
# this makes a crash more likely:
|
|
import gc; gc.collect()
|
|
vereq(hasattr(c, 'attr'), False)
|
|
|
|
def test_init():
|
|
# SF 1155938
|
|
class Foo(object):
|
|
def __init__(self):
|
|
return 10
|
|
try:
|
|
Foo()
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed, "did not test __init__() for None return"
|
|
|
|
def methodwrapper():
|
|
# <type 'method-wrapper'> did not support any reflection before 2.5
|
|
if verbose:
|
|
print "Testing method-wrapper objects..."
|
|
|
|
return # XXX should methods really support __eq__?
|
|
|
|
l = []
|
|
vereq(l.__add__, l.__add__)
|
|
vereq(l.__add__, [].__add__)
|
|
verify(l.__add__ != [5].__add__)
|
|
verify(l.__add__ != l.__mul__)
|
|
verify(l.__add__.__name__ == '__add__')
|
|
verify(l.__add__.__self__ is l)
|
|
verify(l.__add__.__objclass__ is list)
|
|
vereq(l.__add__.__doc__, list.__add__.__doc__)
|
|
try:
|
|
hash(l.__add__)
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("no TypeError from hash([].__add__)")
|
|
|
|
t = ()
|
|
t += (7,)
|
|
vereq(t.__add__, (7,).__add__)
|
|
vereq(hash(t.__add__), hash((7,).__add__))
|
|
|
|
def notimplemented():
|
|
# all binary methods should be able to return a NotImplemented
|
|
if verbose:
|
|
print "Testing NotImplemented..."
|
|
|
|
import sys
|
|
import types
|
|
import operator
|
|
|
|
def specialmethod(self, other):
|
|
return NotImplemented
|
|
|
|
def check(expr, x, y):
|
|
try:
|
|
exec(expr, {'x': x, 'y': y, 'operator': operator})
|
|
except TypeError:
|
|
pass
|
|
else:
|
|
raise TestFailed("no TypeError from %r" % (expr,))
|
|
|
|
N1 = sys.maxint + 1L # might trigger OverflowErrors instead of TypeErrors
|
|
N2 = sys.maxint # if sizeof(int) < sizeof(long), might trigger
|
|
# ValueErrors instead of TypeErrors
|
|
for metaclass in [type, types.ClassType]:
|
|
for name, expr, iexpr in [
|
|
('__add__', 'x + y', 'x += y'),
|
|
('__sub__', 'x - y', 'x -= y'),
|
|
('__mul__', 'x * y', 'x *= y'),
|
|
('__truediv__', 'x / y', None),
|
|
('__floordiv__', 'x // y', None),
|
|
('__mod__', 'x % y', 'x %= y'),
|
|
('__divmod__', 'divmod(x, y)', None),
|
|
('__pow__', 'x ** y', 'x **= y'),
|
|
('__lshift__', 'x << y', 'x <<= y'),
|
|
('__rshift__', 'x >> y', 'x >>= y'),
|
|
('__and__', 'x & y', 'x &= y'),
|
|
('__or__', 'x | y', 'x |= y'),
|
|
('__xor__', 'x ^ y', 'x ^= y'),
|
|
]:
|
|
rname = '__r' + name[2:]
|
|
A = metaclass('A', (), {name: specialmethod})
|
|
B = metaclass('B', (), {rname: specialmethod})
|
|
a = A()
|
|
b = B()
|
|
check(expr, a, a)
|
|
check(expr, a, b)
|
|
check(expr, b, a)
|
|
check(expr, b, b)
|
|
check(expr, a, N1)
|
|
check(expr, a, N2)
|
|
check(expr, N1, b)
|
|
check(expr, N2, b)
|
|
if iexpr:
|
|
check(iexpr, a, a)
|
|
check(iexpr, a, b)
|
|
check(iexpr, b, a)
|
|
check(iexpr, b, b)
|
|
check(iexpr, a, N1)
|
|
check(iexpr, a, N2)
|
|
iname = '__i' + name[2:]
|
|
C = metaclass('C', (), {iname: specialmethod})
|
|
c = C()
|
|
check(iexpr, c, a)
|
|
check(iexpr, c, b)
|
|
check(iexpr, c, N1)
|
|
check(iexpr, c, N2)
|
|
|
|
def test_main():
|
|
weakref_segfault() # Must be first, somehow
|
|
wrapper_segfault()
|
|
do_this_first()
|
|
class_docstrings()
|
|
lists()
|
|
dicts()
|
|
dict_constructor()
|
|
test_dir()
|
|
ints()
|
|
longs()
|
|
floats()
|
|
complexes()
|
|
spamlists()
|
|
spamdicts()
|
|
pydicts()
|
|
pylists()
|
|
metaclass()
|
|
pymods()
|
|
multi()
|
|
mro_disagreement()
|
|
diamond()
|
|
ex5()
|
|
monotonicity()
|
|
consistency_with_epg()
|
|
objects()
|
|
slots()
|
|
slotspecials()
|
|
dynamics()
|
|
errors()
|
|
classmethods()
|
|
classmethods_in_c()
|
|
staticmethods()
|
|
staticmethods_in_c()
|
|
classic()
|
|
compattr()
|
|
newslot()
|
|
altmro()
|
|
overloading()
|
|
methods()
|
|
specials()
|
|
weakrefs()
|
|
properties()
|
|
supers()
|
|
inherits()
|
|
keywords()
|
|
restricted()
|
|
str_subclass_as_dict_key()
|
|
classic_comparisons()
|
|
rich_comparisons()
|
|
descrdoc()
|
|
setclass()
|
|
setdict()
|
|
pickles()
|
|
copies()
|
|
binopoverride()
|
|
subclasspropagation()
|
|
buffer_inherit()
|
|
str_of_str_subclass()
|
|
kwdargs()
|
|
recursive__call__()
|
|
delhook()
|
|
hashinherit()
|
|
strops()
|
|
deepcopyrecursive()
|
|
modules()
|
|
dictproxyiterkeys()
|
|
dictproxyitervalues()
|
|
dictproxyiteritems()
|
|
pickleslots()
|
|
funnynew()
|
|
imulbug()
|
|
docdescriptor()
|
|
copy_setstate()
|
|
slices()
|
|
subtype_resurrection()
|
|
slottrash()
|
|
slotmultipleinheritance()
|
|
testrmul()
|
|
testipow()
|
|
test_mutable_bases()
|
|
test_mutable_bases_with_failing_mro()
|
|
test_mutable_bases_catch_mro_conflict()
|
|
mutable_names()
|
|
subclass_right_op()
|
|
dict_type_with_metaclass()
|
|
meth_class_get()
|
|
isinst_isclass()
|
|
proxysuper()
|
|
carloverre()
|
|
filefault()
|
|
vicious_descriptor_nonsense()
|
|
test_init()
|
|
methodwrapper()
|
|
notimplemented()
|
|
|
|
if verbose: print "All OK"
|
|
|
|
if __name__ == "__main__":
|
|
test_main()
|