mirror of
https://github.com/python/cpython.git
synced 2025-11-01 14:11:41 +00:00
svn+ssh://pythondev@svn.python.org/python/branches/p3yk
................
r55837 | guido.van.rossum | 2007-06-08 16:04:42 -0700 (Fri, 08 Jun 2007) | 2 lines
PEP 3119 -- the abc module.
................
r55838 | guido.van.rossum | 2007-06-08 17:38:55 -0700 (Fri, 08 Jun 2007) | 2 lines
Implement part of PEP 3119 -- One Trick Ponies.
................
r55847 | guido.van.rossum | 2007-06-09 08:28:06 -0700 (Sat, 09 Jun 2007) | 2 lines
Different way to do one trick ponies, allowing registration (per PEP strawman).
................
r55849 | guido.van.rossum | 2007-06-09 18:06:38 -0700 (Sat, 09 Jun 2007) | 3 lines
Make sure that the magic looking for __hash__ (etc.) doesn't apply to
real subclasses of Hashable.
................
r55852 | guido.van.rossum | 2007-06-10 08:29:51 -0700 (Sun, 10 Jun 2007) | 2 lines
Add some more examples, e.g. generators and dict views.
................
r55853 | guido.van.rossum | 2007-06-10 08:31:59 -0700 (Sun, 10 Jun 2007) | 2 lines
keys() and items() *are* containers -- just values() isn't.
................
r55864 | georg.brandl | 2007-06-10 15:29:40 -0700 (Sun, 10 Jun 2007) | 2 lines
PEP 3127: new octal literals, binary literals.
................
r55865 | georg.brandl | 2007-06-10 15:31:37 -0700 (Sun, 10 Jun 2007) | 2 lines
Some octal literal fixes in Tools.
................
r55866 | georg.brandl | 2007-06-10 15:37:43 -0700 (Sun, 10 Jun 2007) | 2 lines
Tokenizer changes for PEP 3127.
................
r55867 | georg.brandl | 2007-06-10 15:37:55 -0700 (Sun, 10 Jun 2007) | 2 lines
Some docs for PEP 3127.
................
r55868 | georg.brandl | 2007-06-10 15:44:39 -0700 (Sun, 10 Jun 2007) | 2 lines
Missed a place in intobject.c. Is that used anymore anyway?
................
r55871 | neal.norwitz | 2007-06-10 18:31:49 -0700 (Sun, 10 Jun 2007) | 182 lines
Merged revisions 55729-55868 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r55731 | neal.norwitz | 2007-06-01 00:29:12 -0700 (Fri, 01 Jun 2007) | 7 lines
SF 1668596/1720897: distutils now copies data files
even if package_dir is empty.
This needs to be backported. I'm too tired tonight. It would be great
if someone backports this if the buildbots are ok with it. Otherwise,
I will try to get to it tomorrow.
........
r55732 | georg.brandl | 2007-06-01 04:33:33 -0700 (Fri, 01 Jun 2007) | 2 lines
Bug #1722484: remove docstrings again when running with -OO.
........
r55735 | georg.brandl | 2007-06-01 12:20:27 -0700 (Fri, 01 Jun 2007) | 2 lines
Fix wrong issue number.
........
r55739 | brett.cannon | 2007-06-01 20:02:29 -0700 (Fri, 01 Jun 2007) | 3 lines
Have configure raise an error when building on AtheOS. Code specific to AtheOS
will be removed in Python 2.7.
........
r55746 | neal.norwitz | 2007-06-02 11:33:53 -0700 (Sat, 02 Jun 2007) | 1 line
Update expected birthday of 2.6
........
r55751 | neal.norwitz | 2007-06-03 13:32:50 -0700 (Sun, 03 Jun 2007) | 10 lines
Backout the original 'fix' to 1721309 which had no effect.
Different versions of Berkeley DB handle this differently.
The comments and bug report should have the details. Memory is allocated
in 4.4 (and presumably earlier), but not in 4.5. Thus
4.5 has the free error, but not earlier versions.
Mostly update comments, plus make the free conditional.
This fix was already applied to the 2.5 branch.
........
r55752 | brett.cannon | 2007-06-03 16:13:41 -0700 (Sun, 03 Jun 2007) | 6 lines
Make _strptime.TimeRE().pattern() use ``\s+`` for matching whitespace instead
of ``\s*``. This prevents patterns from "stealing" bits from other patterns in
order to make a match work.
Closes bug #1730389. Will be backported.
........
r55766 | hyeshik.chang | 2007-06-05 11:16:52 -0700 (Tue, 05 Jun 2007) | 4 lines
Fix build on FreeBSD. Bluetooth HCI API in FreeBSD is quite different
from Linux's. Just fix the build for now but the code doesn't
support the complete capability of HCI on FreeBSD yet.
........
r55770 | hyeshik.chang | 2007-06-05 11:58:51 -0700 (Tue, 05 Jun 2007) | 4 lines
Bug #1728403: Fix a bug that CJKCodecs StreamReader hangs when it
reads a file that ends with incomplete sequence and sizehint argument
for .read() is specified.
........
r55775 | hyeshik.chang | 2007-06-05 12:28:15 -0700 (Tue, 05 Jun 2007) | 2 lines
Fix for Windows: close a temporary file before trying to delete it.
........
r55783 | guido.van.rossum | 2007-06-05 14:24:47 -0700 (Tue, 05 Jun 2007) | 2 lines
Patch by Tim Delany (missing DECREF). SF #1731330.
........
r55785 | collin.winter | 2007-06-05 17:17:35 -0700 (Tue, 05 Jun 2007) | 3 lines
Patch #1731049: make threading.py use a proper "raise" when checking internal state, rather than assert statements (which get stripped out by -O).
........
r55786 | facundo.batista | 2007-06-06 08:13:37 -0700 (Wed, 06 Jun 2007) | 4 lines
FTP.ntransfercmd method now uses create_connection when passive,
using the timeout received in connection time.
........
r55792 | facundo.batista | 2007-06-06 10:15:23 -0700 (Wed, 06 Jun 2007) | 7 lines
Added an optional timeout parameter to function urllib2.urlopen,
with tests in test_urllib2net.py (must have network resource
enabled to execute them). Also modified test_urllib2.py because
testing mock classes must take it into acount. Docs are also
updated.
........
r55793 | thomas.heller | 2007-06-06 13:19:19 -0700 (Wed, 06 Jun 2007) | 1 line
Build _ctypes and _ctypes_test in the ReleaseAMD64 configuration.
........
r55802 | georg.brandl | 2007-06-07 06:23:24 -0700 (Thu, 07 Jun 2007) | 3 lines
Disallow function calls like foo(None=1).
Backport from py3k rev. 55708 by Guido.
........
r55804 | georg.brandl | 2007-06-07 06:30:24 -0700 (Thu, 07 Jun 2007) | 2 lines
Make reindent.py executable.
........
r55805 | georg.brandl | 2007-06-07 06:34:10 -0700 (Thu, 07 Jun 2007) | 2 lines
Patch #1667860: Fix UnboundLocalError in urllib2.
........
r55821 | kristjan.jonsson | 2007-06-07 16:53:49 -0700 (Thu, 07 Jun 2007) | 1 line
Fixing changes to getbuildinfo.c that broke linux builds
........
r55828 | thomas.heller | 2007-06-08 09:10:27 -0700 (Fri, 08 Jun 2007) | 1 line
Make this test work with older Python releases where struct has no 't' format character.
........
r55829 | martin.v.loewis | 2007-06-08 10:29:20 -0700 (Fri, 08 Jun 2007) | 3 lines
Bug #1733488: Fix compilation of bufferobject.c on AIX.
Will backport to 2.5.
........
r55831 | thomas.heller | 2007-06-08 11:20:09 -0700 (Fri, 08 Jun 2007) | 2 lines
[ 1715718 ] x64 clean compile patch for _ctypes, by Kristj?n Valur
with small modifications.
........
r55832 | thomas.heller | 2007-06-08 12:01:06 -0700 (Fri, 08 Jun 2007) | 1 line
Fix gcc warnings intruduced by passing Py_ssize_t to PyErr_Format calls.
........
r55833 | thomas.heller | 2007-06-08 12:08:31 -0700 (Fri, 08 Jun 2007) | 2 lines
Fix wrong documentation, and correct the punktuation.
Closes [1700455].
........
r55834 | thomas.heller | 2007-06-08 12:14:23 -0700 (Fri, 08 Jun 2007) | 1 line
Fix warnings by using proper function prototype.
........
r55839 | neal.norwitz | 2007-06-08 20:36:34 -0700 (Fri, 08 Jun 2007) | 7 lines
Prevent expandtabs() on string and unicode objects from causing a segfault when
a large width is passed on 32-bit platforms. Found by Google.
It would be good for people to review this especially carefully and verify
I don't have an off by one error and there is no other way to cause overflow.
........
r55841 | neal.norwitz | 2007-06-08 21:48:22 -0700 (Fri, 08 Jun 2007) | 1 line
Use macro version of GET_SIZE to avoid Coverity warning (#150) about a possible error.
........
r55842 | martin.v.loewis | 2007-06-09 00:42:52 -0700 (Sat, 09 Jun 2007) | 3 lines
Patch #1733960: Allow T_LONGLONG to accept ints.
Will backport to 2.5.
........
r55843 | martin.v.loewis | 2007-06-09 00:58:05 -0700 (Sat, 09 Jun 2007) | 2 lines
Fix Windows build.
........
r55845 | martin.v.loewis | 2007-06-09 03:10:26 -0700 (Sat, 09 Jun 2007) | 2 lines
Provide LLONG_MAX for S390.
........
r55854 | thomas.heller | 2007-06-10 08:59:17 -0700 (Sun, 10 Jun 2007) | 4 lines
First version of build scripts for Windows/AMD64 (no external
components are built yet, and 'kill_python' is disabled).
........
r55855 | thomas.heller | 2007-06-10 10:55:51 -0700 (Sun, 10 Jun 2007) | 3 lines
For now, disable the _bsddb, _sqlite3, _ssl, _testcapi, _tkinter
modules in the ReleaseAMD64 configuration because they do not compile.
........
r55856 | thomas.heller | 2007-06-10 11:27:54 -0700 (Sun, 10 Jun 2007) | 1 line
Need to set the environment variables, otherwise devenv.com is not found.
........
r55860 | thomas.heller | 2007-06-10 14:01:17 -0700 (Sun, 10 Jun 2007) | 1 line
Revert commit 55855.
........
................
r55880 | neal.norwitz | 2007-06-10 22:07:36 -0700 (Sun, 10 Jun 2007) | 5 lines
Fix the refleak counter on test_collections. The ABC metaclass creates
a registry which must be cleared on each run. Otherwise, there *seem*
to be refleaks when there really aren't any. (The class is held within
the registry even though it's no longer needed.)
................
r55884 | neal.norwitz | 2007-06-10 22:46:33 -0700 (Sun, 10 Jun 2007) | 1 line
These tests have been removed, so they are no longer needed here
................
r55886 | georg.brandl | 2007-06-11 00:26:37 -0700 (Mon, 11 Jun 2007) | 3 lines
Optimize access to True and False in the compiler (if True)
and the peepholer (LOAD_NAME True).
................
r55905 | georg.brandl | 2007-06-11 10:02:26 -0700 (Mon, 11 Jun 2007) | 5 lines
Remove __oct__ and __hex__ and use __index__ for converting
non-ints before formatting in a base.
Add a bin() builtin.
................
r55906 | georg.brandl | 2007-06-11 10:04:44 -0700 (Mon, 11 Jun 2007) | 2 lines
int(x, 0) does not "guess".
................
r55907 | georg.brandl | 2007-06-11 10:05:47 -0700 (Mon, 11 Jun 2007) | 2 lines
Add a comment to explain that nb_oct and nb_hex are nonfunctional.
................
r55908 | guido.van.rossum | 2007-06-11 10:49:18 -0700 (Mon, 11 Jun 2007) | 2 lines
Get rid of unused imports and comment.
................
r55910 | guido.van.rossum | 2007-06-11 13:05:17 -0700 (Mon, 11 Jun 2007) | 2 lines
_Abstract.__new__ now requires either no arguments or __init__ overridden.
................
r55911 | guido.van.rossum | 2007-06-11 13:07:49 -0700 (Mon, 11 Jun 2007) | 7 lines
Move the collections ABCs to a separate file, _abcoll.py, in order to avoid
needing to import _collections.so during the bootstrap (this will become
apparent in the next submit of os.py).
Add (plain and mutable) ABCs for Set, Mapping, Sequence.
................
r55912 | guido.van.rossum | 2007-06-11 13:09:31 -0700 (Mon, 11 Jun 2007) | 2 lines
Rewrite the _Environ class to use the new collections ABCs.
................
r55913 | guido.van.rossum | 2007-06-11 13:59:45 -0700 (Mon, 11 Jun 2007) | 72 lines
Merged revisions 55869-55912 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r55869 | neal.norwitz | 2007-06-10 17:42:11 -0700 (Sun, 10 Jun 2007) | 1 line
Add Atul Varma for patch # 1667860
........
r55870 | neal.norwitz | 2007-06-10 18:22:03 -0700 (Sun, 10 Jun 2007) | 1 line
Ignore valgrind problems on Ubuntu from ld
........
r55872 | neal.norwitz | 2007-06-10 18:48:46 -0700 (Sun, 10 Jun 2007) | 2 lines
Ignore config.status.lineno which seems new (new autoconf?)
........
r55873 | neal.norwitz | 2007-06-10 19:14:39 -0700 (Sun, 10 Jun 2007) | 1 line
Prevent these tests from running on Win64 since they don\'t apply there either
........
r55874 | neal.norwitz | 2007-06-10 19:16:10 -0700 (Sun, 10 Jun 2007) | 5 lines
Fix a bug when there was a newline in the string expandtabs was called on.
This also catches another condition that can overflow.
Will backport.
........
r55879 | neal.norwitz | 2007-06-10 21:52:37 -0700 (Sun, 10 Jun 2007) | 1 line
Prevent hang if the port cannot be opened.
........
r55881 | neal.norwitz | 2007-06-10 22:28:45 -0700 (Sun, 10 Jun 2007) | 4 lines
Add all of the distuils modules that don't seem to have explicit tests. :-(
Move an import in mworkscompiler so that this module can be imported on
any platform. Hopefully this works on all platforms.
........
r55882 | neal.norwitz | 2007-06-10 22:35:10 -0700 (Sun, 10 Jun 2007) | 4 lines
SF #1734732, lower case the module names per PEP 8.
Will backport.
........
r55885 | neal.norwitz | 2007-06-10 23:16:48 -0700 (Sun, 10 Jun 2007) | 4 lines
Not sure why this only fails sometimes on Unix machines. Better
to disable it and only import msvccompiler on Windows since that's
the only place it can work anyways.
........
r55887 | neal.norwitz | 2007-06-11 00:29:43 -0700 (Mon, 11 Jun 2007) | 4 lines
Bug #1734723: Fix repr.Repr() so it doesn't ignore the maxtuple attribute.
Will backport
........
r55889 | neal.norwitz | 2007-06-11 00:36:24 -0700 (Mon, 11 Jun 2007) | 1 line
Reflow long line
........
r55896 | thomas.heller | 2007-06-11 08:58:33 -0700 (Mon, 11 Jun 2007) | 3 lines
Use "O&" in calls to PyArg_Parse when we need a 'void*' instead of "k"
or "K" codes.
........
r55901 | facundo.batista | 2007-06-11 09:27:08 -0700 (Mon, 11 Jun 2007) | 5 lines
Added versionchanged flag to all the methods which received
a new optional timeout parameter, and a versionadded flag to
the socket.create_connection function.
........
................
r55914 | guido.van.rossum | 2007-06-11 14:19:50 -0700 (Mon, 11 Jun 2007) | 3 lines
New super() implementation, for PEP 3135 (though the PEP is not yet updated
to this design, and small tweaks may still be made later).
................
r55923 | guido.van.rossum | 2007-06-11 21:15:24 -0700 (Mon, 11 Jun 2007) | 4 lines
I'm guessing this module broke when Neal ripped out the types module --
it used 'list' both as a local variable and as the built-in list type.
Renamed the local variable since that was easier.
................
r55924 | guido.van.rossum | 2007-06-11 21:20:05 -0700 (Mon, 11 Jun 2007) | 5 lines
Change all occurrences of super(<thisclass>, <firstarg>) to super().
Seems to have worked, all the tests still pass.
Exception: test_descr and test_descrtut, which have tons of these
and are there to test the various usages.
................
r55939 | collin.winter | 2007-06-12 13:57:33 -0700 (Tue, 12 Jun 2007) | 1 line
Patch #1735485: remove StandardError from the exception hierarchy.
................
r55954 | neal.norwitz | 2007-06-12 21:56:32 -0700 (Tue, 12 Jun 2007) | 51 lines
Merged revisions 55913-55950 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r55926 | marc-andre.lemburg | 2007-06-12 02:09:58 -0700 (Tue, 12 Jun 2007) | 3 lines
Apply patch #1734945 to support TurboLinux as distribution.
........
r55927 | marc-andre.lemburg | 2007-06-12 02:26:49 -0700 (Tue, 12 Jun 2007) | 3 lines
Add patch #1726668: Windows Vista support.
........
r55929 | thomas.heller | 2007-06-12 08:36:22 -0700 (Tue, 12 Jun 2007) | 1 line
Checkout, but do not yet try to build, exernal sources.
........
r55930 | thomas.heller | 2007-06-12 09:08:27 -0700 (Tue, 12 Jun 2007) | 6 lines
Add bufferoverflowU.lib to the libraries needed by _ssl (is this the
right thing to do?).
Set the /XP64 /RETAIL build enviroment in the makefile when building
ReleaseAMD64.
........
r55931 | thomas.heller | 2007-06-12 09:23:19 -0700 (Tue, 12 Jun 2007) | 5 lines
Revert this change, since it breaks the win32 build:
Add bufferoverflowU.lib to the libraries needed by _ssl (is this the
right thing to do?).
........
r55934 | thomas.heller | 2007-06-12 10:28:31 -0700 (Tue, 12 Jun 2007) | 3 lines
Specify the bufferoverflowU.lib to the makefile on the command line
(for ReleaseAMD64 builds).
........
r55937 | thomas.heller | 2007-06-12 12:02:59 -0700 (Tue, 12 Jun 2007) | 3 lines
Add bufferoverflowU.lib to PCBuild\_bsddb.vcproj.
Build sqlite3.dll and bsddb.
........
r55938 | thomas.heller | 2007-06-12 12:56:12 -0700 (Tue, 12 Jun 2007) | 2 lines
Don't rebuild Berkeley DB if not needed (this was committed by accident).
........
r55948 | martin.v.loewis | 2007-06-12 20:42:19 -0700 (Tue, 12 Jun 2007) | 3 lines
Provide PY_LLONG_MAX on all systems having long long.
Will backport to 2.5.
........
................
r55959 | guido.van.rossum | 2007-06-13 09:22:41 -0700 (Wed, 13 Jun 2007) | 2 lines
Fix a compilation warning.
................
849 lines
27 KiB
Python
849 lines
27 KiB
Python
# Python test set -- part 1, grammar.
|
|
# This just tests whether the parser accepts them all.
|
|
|
|
# NOTE: When you run this test as a script from the command line, you
|
|
# get warnings about certain hex/oct constants. Since those are
|
|
# issued by the parser, you can't suppress them by adding a
|
|
# filterwarnings() call to this module. Therefore, to shut up the
|
|
# regression test, the filterwarnings() call has been added to
|
|
# regrtest.py.
|
|
|
|
from test.test_support import run_unittest, check_syntax_error
|
|
import unittest
|
|
import sys
|
|
# testing import *
|
|
from sys import *
|
|
|
|
class TokenTests(unittest.TestCase):
|
|
|
|
def testBackslash(self):
|
|
# Backslash means line continuation:
|
|
x = 1 \
|
|
+ 1
|
|
self.assertEquals(x, 2, 'backslash for line continuation')
|
|
|
|
# Backslash does not means continuation in comments :\
|
|
x = 0
|
|
self.assertEquals(x, 0, 'backslash ending comment')
|
|
|
|
def testPlainIntegers(self):
|
|
self.assertEquals(type(000), type(0))
|
|
self.assertEquals(0xff, 255)
|
|
self.assertEquals(0o377, 255)
|
|
self.assertEquals(2147483647, 0o17777777777)
|
|
self.assertEquals(0b1001, 9)
|
|
from sys import maxint
|
|
if maxint == 2147483647:
|
|
self.assertEquals(-2147483647-1, -0o20000000000)
|
|
# XXX -2147483648
|
|
self.assert_(0o37777777777 > 0)
|
|
self.assert_(0xffffffff > 0)
|
|
self.assert_(0b1111111111111111111111111111111 > 0)
|
|
for s in ('2147483648', '0o40000000000', '0x100000000',
|
|
'0b10000000000000000000000000000000'):
|
|
try:
|
|
x = eval(s)
|
|
except OverflowError:
|
|
self.fail("OverflowError on huge integer literal %r" % s)
|
|
elif maxint == 9223372036854775807:
|
|
self.assertEquals(-9223372036854775807-1, -0o1000000000000000000000)
|
|
self.assert_(0o1777777777777777777777 > 0)
|
|
self.assert_(0xffffffffffffffff > 0)
|
|
self.assert_(0b11111111111111111111111111111111111111111111111111111111111111 > 0)
|
|
for s in '9223372036854775808', '0o2000000000000000000000', \
|
|
'0x10000000000000000', \
|
|
'0b100000000000000000000000000000000000000000000000000000000000000':
|
|
try:
|
|
x = eval(s)
|
|
except OverflowError:
|
|
self.fail("OverflowError on huge integer literal %r" % s)
|
|
else:
|
|
self.fail('Weird maxint value %r' % maxint)
|
|
|
|
def testLongIntegers(self):
|
|
x = 0
|
|
x = 0xffffffffffffffff
|
|
x = 0Xffffffffffffffff
|
|
x = 0o77777777777777777
|
|
x = 0O77777777777777777
|
|
x = 123456789012345678901234567890
|
|
x = 0b100000000000000000000000000000000000000000000000000000000000000000000
|
|
x = 0B111111111111111111111111111111111111111111111111111111111111111111111
|
|
|
|
def testFloats(self):
|
|
x = 3.14
|
|
x = 314.
|
|
x = 0.314
|
|
# XXX x = 000.314
|
|
x = .314
|
|
x = 3e14
|
|
x = 3E14
|
|
x = 3e-14
|
|
x = 3e+14
|
|
x = 3.e14
|
|
x = .3e14
|
|
x = 3.1e4
|
|
|
|
def testStringLiterals(self):
|
|
x = ''; y = ""; self.assert_(len(x) == 0 and x == y)
|
|
x = '\''; y = "'"; self.assert_(len(x) == 1 and x == y and ord(x) == 39)
|
|
x = '"'; y = "\""; self.assert_(len(x) == 1 and x == y and ord(x) == 34)
|
|
x = "doesn't \"shrink\" does it"
|
|
y = 'doesn\'t "shrink" does it'
|
|
self.assert_(len(x) == 24 and x == y)
|
|
x = "does \"shrink\" doesn't it"
|
|
y = 'does "shrink" doesn\'t it'
|
|
self.assert_(len(x) == 24 and x == y)
|
|
x = """
|
|
The "quick"
|
|
brown fox
|
|
jumps over
|
|
the 'lazy' dog.
|
|
"""
|
|
y = '\nThe "quick"\nbrown fox\njumps over\nthe \'lazy\' dog.\n'
|
|
self.assertEquals(x, y)
|
|
y = '''
|
|
The "quick"
|
|
brown fox
|
|
jumps over
|
|
the 'lazy' dog.
|
|
'''
|
|
self.assertEquals(x, y)
|
|
y = "\n\
|
|
The \"quick\"\n\
|
|
brown fox\n\
|
|
jumps over\n\
|
|
the 'lazy' dog.\n\
|
|
"
|
|
self.assertEquals(x, y)
|
|
y = '\n\
|
|
The \"quick\"\n\
|
|
brown fox\n\
|
|
jumps over\n\
|
|
the \'lazy\' dog.\n\
|
|
'
|
|
self.assertEquals(x, y)
|
|
|
|
def testEllipsis(self):
|
|
x = ...
|
|
self.assert_(x is Ellipsis)
|
|
self.assertRaises(SyntaxError, eval, ".. .")
|
|
|
|
class GrammarTests(unittest.TestCase):
|
|
|
|
# single_input: NEWLINE | simple_stmt | compound_stmt NEWLINE
|
|
# XXX can't test in a script -- this rule is only used when interactive
|
|
|
|
# file_input: (NEWLINE | stmt)* ENDMARKER
|
|
# Being tested as this very moment this very module
|
|
|
|
# expr_input: testlist NEWLINE
|
|
# XXX Hard to test -- used only in calls to input()
|
|
|
|
def testEvalInput(self):
|
|
# testlist ENDMARKER
|
|
x = eval('1, 0 or 1')
|
|
|
|
def testFuncdef(self):
|
|
### [decorators] 'def' NAME parameters ['->' test] ':' suite
|
|
### decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE
|
|
### decorators: decorator+
|
|
### parameters: '(' [typedargslist] ')'
|
|
### typedargslist: ((tfpdef ['=' test] ',')*
|
|
### ('*' [tfpdef] (',' tfpdef ['=' test])* [',' '**' tfpdef] | '**' tfpdef)
|
|
### | tfpdef ['=' test] (',' tfpdef ['=' test])* [','])
|
|
### tfpdef: NAME [':' test]
|
|
### varargslist: ((vfpdef ['=' test] ',')*
|
|
### ('*' [vfpdef] (',' vfpdef ['=' test])* [',' '**' vfpdef] | '**' vfpdef)
|
|
### | vfpdef ['=' test] (',' vfpdef ['=' test])* [','])
|
|
### vfpdef: NAME
|
|
def f1(): pass
|
|
f1()
|
|
f1(*())
|
|
f1(*(), **{})
|
|
def f2(one_argument): pass
|
|
def f3(two, arguments): pass
|
|
self.assertEquals(f2.__code__.co_varnames, ('one_argument',))
|
|
self.assertEquals(f3.__code__.co_varnames, ('two', 'arguments'))
|
|
def a1(one_arg,): pass
|
|
def a2(two, args,): pass
|
|
def v0(*rest): pass
|
|
def v1(a, *rest): pass
|
|
def v2(a, b, *rest): pass
|
|
|
|
f1()
|
|
f2(1)
|
|
f2(1,)
|
|
f3(1, 2)
|
|
f3(1, 2,)
|
|
v0()
|
|
v0(1)
|
|
v0(1,)
|
|
v0(1,2)
|
|
v0(1,2,3,4,5,6,7,8,9,0)
|
|
v1(1)
|
|
v1(1,)
|
|
v1(1,2)
|
|
v1(1,2,3)
|
|
v1(1,2,3,4,5,6,7,8,9,0)
|
|
v2(1,2)
|
|
v2(1,2,3)
|
|
v2(1,2,3,4)
|
|
v2(1,2,3,4,5,6,7,8,9,0)
|
|
|
|
def d01(a=1): pass
|
|
d01()
|
|
d01(1)
|
|
d01(*(1,))
|
|
d01(**{'a':2})
|
|
def d11(a, b=1): pass
|
|
d11(1)
|
|
d11(1, 2)
|
|
d11(1, **{'b':2})
|
|
def d21(a, b, c=1): pass
|
|
d21(1, 2)
|
|
d21(1, 2, 3)
|
|
d21(*(1, 2, 3))
|
|
d21(1, *(2, 3))
|
|
d21(1, 2, *(3,))
|
|
d21(1, 2, **{'c':3})
|
|
def d02(a=1, b=2): pass
|
|
d02()
|
|
d02(1)
|
|
d02(1, 2)
|
|
d02(*(1, 2))
|
|
d02(1, *(2,))
|
|
d02(1, **{'b':2})
|
|
d02(**{'a': 1, 'b': 2})
|
|
def d12(a, b=1, c=2): pass
|
|
d12(1)
|
|
d12(1, 2)
|
|
d12(1, 2, 3)
|
|
def d22(a, b, c=1, d=2): pass
|
|
d22(1, 2)
|
|
d22(1, 2, 3)
|
|
d22(1, 2, 3, 4)
|
|
def d01v(a=1, *rest): pass
|
|
d01v()
|
|
d01v(1)
|
|
d01v(1, 2)
|
|
d01v(*(1, 2, 3, 4))
|
|
d01v(*(1,))
|
|
d01v(**{'a':2})
|
|
def d11v(a, b=1, *rest): pass
|
|
d11v(1)
|
|
d11v(1, 2)
|
|
d11v(1, 2, 3)
|
|
def d21v(a, b, c=1, *rest): pass
|
|
d21v(1, 2)
|
|
d21v(1, 2, 3)
|
|
d21v(1, 2, 3, 4)
|
|
d21v(*(1, 2, 3, 4))
|
|
d21v(1, 2, **{'c': 3})
|
|
def d02v(a=1, b=2, *rest): pass
|
|
d02v()
|
|
d02v(1)
|
|
d02v(1, 2)
|
|
d02v(1, 2, 3)
|
|
d02v(1, *(2, 3, 4))
|
|
d02v(**{'a': 1, 'b': 2})
|
|
def d12v(a, b=1, c=2, *rest): pass
|
|
d12v(1)
|
|
d12v(1, 2)
|
|
d12v(1, 2, 3)
|
|
d12v(1, 2, 3, 4)
|
|
d12v(*(1, 2, 3, 4))
|
|
d12v(1, 2, *(3, 4, 5))
|
|
d12v(1, *(2,), **{'c': 3})
|
|
def d22v(a, b, c=1, d=2, *rest): pass
|
|
d22v(1, 2)
|
|
d22v(1, 2, 3)
|
|
d22v(1, 2, 3, 4)
|
|
d22v(1, 2, 3, 4, 5)
|
|
d22v(*(1, 2, 3, 4))
|
|
d22v(1, 2, *(3, 4, 5))
|
|
d22v(1, *(2, 3), **{'d': 4})
|
|
# keyword only argument tests
|
|
def pos0key1(*, key): return key
|
|
pos0key1(key=100)
|
|
def pos2key2(p1, p2, *, k1, k2=100): return p1,p2,k1,k2
|
|
pos2key2(1, 2, k1=100)
|
|
pos2key2(1, 2, k1=100, k2=200)
|
|
pos2key2(1, 2, k2=100, k1=200)
|
|
def pos2key2dict(p1, p2, *, k1=100, k2, **kwarg): return p1,p2,k1,k2,kwarg
|
|
pos2key2dict(1,2,k2=100,tokwarg1=100,tokwarg2=200)
|
|
pos2key2dict(1,2,tokwarg1=100,tokwarg2=200, k2=100)
|
|
|
|
# argument annotation tests
|
|
def f(x) -> list: pass
|
|
self.assertEquals(f.__annotations__, {'return': list})
|
|
def f(x:int): pass
|
|
self.assertEquals(f.__annotations__, {'x': int})
|
|
def f(*x:str): pass
|
|
self.assertEquals(f.__annotations__, {'x': str})
|
|
def f(**x:float): pass
|
|
self.assertEquals(f.__annotations__, {'x': float})
|
|
def f(x, y:1+2): pass
|
|
self.assertEquals(f.__annotations__, {'y': 3})
|
|
def f(a, b:1, c:2, d): pass
|
|
self.assertEquals(f.__annotations__, {'b': 1, 'c': 2})
|
|
def f(a, b:1, c:2, d, e:3=4, f=5, *g:6): pass
|
|
self.assertEquals(f.__annotations__,
|
|
{'b': 1, 'c': 2, 'e': 3, 'g': 6})
|
|
def f(a, b:1, c:2, d, e:3=4, f=5, *g:6, h:7, i=8, j:9=10,
|
|
**k:11) -> 12: pass
|
|
self.assertEquals(f.__annotations__,
|
|
{'b': 1, 'c': 2, 'e': 3, 'g': 6, 'h': 7, 'j': 9,
|
|
'k': 11, 'return': 12})
|
|
# Check for SF Bug #1697248 - mixing decorators and a return annotation
|
|
def null(x): return x
|
|
@null
|
|
def f(x) -> list: pass
|
|
self.assertEquals(f.__annotations__, {'return': list})
|
|
|
|
# test MAKE_CLOSURE with a variety of oparg's
|
|
closure = 1
|
|
def f(): return closure
|
|
def f(x=1): return closure
|
|
def f(*, k=1): return closure
|
|
def f() -> int: return closure
|
|
|
|
def testLambdef(self):
|
|
### lambdef: 'lambda' [varargslist] ':' test
|
|
l1 = lambda : 0
|
|
self.assertEquals(l1(), 0)
|
|
l2 = lambda : a[d] # XXX just testing the expression
|
|
l3 = lambda : [2 < x for x in [-1, 3, 0]]
|
|
self.assertEquals(l3(), [0, 1, 0])
|
|
l4 = lambda x = lambda y = lambda z=1 : z : y() : x()
|
|
self.assertEquals(l4(), 1)
|
|
l5 = lambda x, y, z=2: x + y + z
|
|
self.assertEquals(l5(1, 2), 5)
|
|
self.assertEquals(l5(1, 2, 3), 6)
|
|
check_syntax_error(self, "lambda x: x = 2")
|
|
l6 = lambda x, y, *, k=20: x+y+k
|
|
self.assertEquals(l6(1,2), 1+2+20)
|
|
self.assertEquals(l6(1,2,k=10), 1+2+10)
|
|
|
|
|
|
### stmt: simple_stmt | compound_stmt
|
|
# Tested below
|
|
|
|
def testSimpleStmt(self):
|
|
### simple_stmt: small_stmt (';' small_stmt)* [';']
|
|
x = 1; pass; del x
|
|
def foo():
|
|
# verify statments that end with semi-colons
|
|
x = 1; pass; del x;
|
|
foo()
|
|
|
|
### small_stmt: expr_stmt | pass_stmt | del_stmt | flow_stmt | import_stmt | global_stmt | access_stmt
|
|
# Tested below
|
|
|
|
def testExprStmt(self):
|
|
# (exprlist '=')* exprlist
|
|
1
|
|
1, 2, 3
|
|
x = 1
|
|
x = 1, 2, 3
|
|
x = y = z = 1, 2, 3
|
|
x, y, z = 1, 2, 3
|
|
abc = a, b, c = x, y, z = xyz = 1, 2, (3, 4)
|
|
|
|
check_syntax_error(self, "x + 1 = 1")
|
|
check_syntax_error(self, "a + 1 = b + 2")
|
|
|
|
def testDelStmt(self):
|
|
# 'del' exprlist
|
|
abc = [1,2,3]
|
|
x, y, z = abc
|
|
xyz = x, y, z
|
|
|
|
del abc
|
|
del x, y, (z, xyz)
|
|
|
|
def testPassStmt(self):
|
|
# 'pass'
|
|
pass
|
|
|
|
# flow_stmt: break_stmt | continue_stmt | return_stmt | raise_stmt
|
|
# Tested below
|
|
|
|
def testBreakStmt(self):
|
|
# 'break'
|
|
while 1: break
|
|
|
|
def testContinueStmt(self):
|
|
# 'continue'
|
|
i = 1
|
|
while i: i = 0; continue
|
|
|
|
msg = ""
|
|
while not msg:
|
|
msg = "ok"
|
|
try:
|
|
continue
|
|
msg = "continue failed to continue inside try"
|
|
except:
|
|
msg = "continue inside try called except block"
|
|
if msg != "ok":
|
|
self.fail(msg)
|
|
|
|
msg = ""
|
|
while not msg:
|
|
msg = "finally block not called"
|
|
try:
|
|
continue
|
|
finally:
|
|
msg = "ok"
|
|
if msg != "ok":
|
|
self.fail(msg)
|
|
|
|
def test_break_continue_loop(self):
|
|
# This test warrants an explanation. It is a test specifically for SF bugs
|
|
# #463359 and #462937. The bug is that a 'break' statement executed or
|
|
# exception raised inside a try/except inside a loop, *after* a continue
|
|
# statement has been executed in that loop, will cause the wrong number of
|
|
# arguments to be popped off the stack and the instruction pointer reset to
|
|
# a very small number (usually 0.) Because of this, the following test
|
|
# *must* written as a function, and the tracking vars *must* be function
|
|
# arguments with default values. Otherwise, the test will loop and loop.
|
|
|
|
def test_inner(extra_burning_oil = 1, count=0):
|
|
big_hippo = 2
|
|
while big_hippo:
|
|
count += 1
|
|
try:
|
|
if extra_burning_oil and big_hippo == 1:
|
|
extra_burning_oil -= 1
|
|
break
|
|
big_hippo -= 1
|
|
continue
|
|
except:
|
|
raise
|
|
if count > 2 or big_hippo != 1:
|
|
self.fail("continue then break in try/except in loop broken!")
|
|
test_inner()
|
|
|
|
def testReturn(self):
|
|
# 'return' [testlist]
|
|
def g1(): return
|
|
def g2(): return 1
|
|
g1()
|
|
x = g2()
|
|
check_syntax_error(self, "class foo:return 1")
|
|
|
|
def testYield(self):
|
|
check_syntax_error(self, "class foo:yield 1")
|
|
|
|
def testRaise(self):
|
|
# 'raise' test [',' test]
|
|
try: raise RuntimeError, 'just testing'
|
|
except RuntimeError: pass
|
|
try: raise KeyboardInterrupt
|
|
except KeyboardInterrupt: pass
|
|
|
|
def testImport(self):
|
|
# 'import' dotted_as_names
|
|
import sys
|
|
import time, sys
|
|
# 'from' dotted_name 'import' ('*' | '(' import_as_names ')' | import_as_names)
|
|
from time import time
|
|
from time import (time)
|
|
# not testable inside a function, but already done at top of the module
|
|
# from sys import *
|
|
from sys import path, argv
|
|
from sys import (path, argv)
|
|
from sys import (path, argv,)
|
|
|
|
def testGlobal(self):
|
|
# 'global' NAME (',' NAME)*
|
|
global a
|
|
global a, b
|
|
global one, two, three, four, five, six, seven, eight, nine, ten
|
|
|
|
def testAssert(self):
|
|
# assert_stmt: 'assert' test [',' test]
|
|
assert 1
|
|
assert 1, 1
|
|
assert lambda x:x
|
|
assert 1, lambda x:x+1
|
|
try:
|
|
assert 0, "msg"
|
|
except AssertionError as e:
|
|
self.assertEquals(e.args[0], "msg")
|
|
else:
|
|
if __debug__:
|
|
self.fail("AssertionError not raised by assert 0")
|
|
|
|
### compound_stmt: if_stmt | while_stmt | for_stmt | try_stmt | funcdef | classdef
|
|
# Tested below
|
|
|
|
def testIf(self):
|
|
# 'if' test ':' suite ('elif' test ':' suite)* ['else' ':' suite]
|
|
if 1: pass
|
|
if 1: pass
|
|
else: pass
|
|
if 0: pass
|
|
elif 0: pass
|
|
if 0: pass
|
|
elif 0: pass
|
|
elif 0: pass
|
|
elif 0: pass
|
|
else: pass
|
|
|
|
def testWhile(self):
|
|
# 'while' test ':' suite ['else' ':' suite]
|
|
while 0: pass
|
|
while 0: pass
|
|
else: pass
|
|
|
|
def testFor(self):
|
|
# 'for' exprlist 'in' exprlist ':' suite ['else' ':' suite]
|
|
for i in 1, 2, 3: pass
|
|
for i, j, k in (): pass
|
|
else: pass
|
|
class Squares:
|
|
def __init__(self, max):
|
|
self.max = max
|
|
self.sofar = []
|
|
def __len__(self): return len(self.sofar)
|
|
def __getitem__(self, i):
|
|
if not 0 <= i < self.max: raise IndexError
|
|
n = len(self.sofar)
|
|
while n <= i:
|
|
self.sofar.append(n*n)
|
|
n = n+1
|
|
return self.sofar[i]
|
|
n = 0
|
|
for x in Squares(10): n = n+x
|
|
if n != 285:
|
|
self.fail('for over growing sequence')
|
|
|
|
result = []
|
|
for x, in [(1,), (2,), (3,)]:
|
|
result.append(x)
|
|
self.assertEqual(result, [1, 2, 3])
|
|
|
|
def testTry(self):
|
|
### try_stmt: 'try' ':' suite (except_clause ':' suite)+ ['else' ':' suite]
|
|
### | 'try' ':' suite 'finally' ':' suite
|
|
### except_clause: 'except' [expr ['as' expr]]
|
|
try:
|
|
1/0
|
|
except ZeroDivisionError:
|
|
pass
|
|
else:
|
|
pass
|
|
try: 1/0
|
|
except EOFError: pass
|
|
except TypeError as msg: pass
|
|
except RuntimeError as msg: pass
|
|
except: pass
|
|
else: pass
|
|
try: 1/0
|
|
except (EOFError, TypeError, ZeroDivisionError): pass
|
|
try: 1/0
|
|
except (EOFError, TypeError, ZeroDivisionError) as msg: pass
|
|
try: pass
|
|
finally: pass
|
|
|
|
def testSuite(self):
|
|
# simple_stmt | NEWLINE INDENT NEWLINE* (stmt NEWLINE*)+ DEDENT
|
|
if 1: pass
|
|
if 1:
|
|
pass
|
|
if 1:
|
|
#
|
|
#
|
|
#
|
|
pass
|
|
pass
|
|
#
|
|
pass
|
|
#
|
|
|
|
def testTest(self):
|
|
### and_test ('or' and_test)*
|
|
### and_test: not_test ('and' not_test)*
|
|
### not_test: 'not' not_test | comparison
|
|
if not 1: pass
|
|
if 1 and 1: pass
|
|
if 1 or 1: pass
|
|
if not not not 1: pass
|
|
if not 1 and 1 and 1: pass
|
|
if 1 and 1 or 1 and 1 and 1 or not 1 and 1: pass
|
|
|
|
def testComparison(self):
|
|
### comparison: expr (comp_op expr)*
|
|
### comp_op: '<'|'>'|'=='|'>='|'<='|'!='|'in'|'not' 'in'|'is'|'is' 'not'
|
|
if 1: pass
|
|
x = (1 == 1)
|
|
if 1 == 1: pass
|
|
if 1 != 1: pass
|
|
if 1 < 1: pass
|
|
if 1 > 1: pass
|
|
if 1 <= 1: pass
|
|
if 1 >= 1: pass
|
|
if 1 is 1: pass
|
|
if 1 is not 1: pass
|
|
if 1 in (): pass
|
|
if 1 not in (): pass
|
|
if 1 < 1 > 1 == 1 >= 1 <= 1 != 1 in 1 not in 1 is 1 is not 1: pass
|
|
|
|
def testBinaryMaskOps(self):
|
|
x = 1 & 1
|
|
x = 1 ^ 1
|
|
x = 1 | 1
|
|
|
|
def testShiftOps(self):
|
|
x = 1 << 1
|
|
x = 1 >> 1
|
|
x = 1 << 1 >> 1
|
|
|
|
def testAdditiveOps(self):
|
|
x = 1
|
|
x = 1 + 1
|
|
x = 1 - 1 - 1
|
|
x = 1 - 1 + 1 - 1 + 1
|
|
|
|
def testMultiplicativeOps(self):
|
|
x = 1 * 1
|
|
x = 1 / 1
|
|
x = 1 % 1
|
|
x = 1 / 1 * 1 % 1
|
|
|
|
def testUnaryOps(self):
|
|
x = +1
|
|
x = -1
|
|
x = ~1
|
|
x = ~1 ^ 1 & 1 | 1 & 1 ^ -1
|
|
x = -1*1/1 + 1*1 - ---1*1
|
|
|
|
def testSelectors(self):
|
|
### trailer: '(' [testlist] ')' | '[' subscript ']' | '.' NAME
|
|
### subscript: expr | [expr] ':' [expr]
|
|
|
|
import sys, time
|
|
c = sys.path[0]
|
|
x = time.time()
|
|
x = sys.modules['time'].time()
|
|
a = '01234'
|
|
c = a[0]
|
|
c = a[-1]
|
|
s = a[0:5]
|
|
s = a[:5]
|
|
s = a[0:]
|
|
s = a[:]
|
|
s = a[-5:]
|
|
s = a[:-1]
|
|
s = a[-4:-3]
|
|
# A rough test of SF bug 1333982. http://python.org/sf/1333982
|
|
# The testing here is fairly incomplete.
|
|
# Test cases should include: commas with 1 and 2 colons
|
|
d = {}
|
|
d[1] = 1
|
|
d[1,] = 2
|
|
d[1,2] = 3
|
|
d[1,2,3] = 4
|
|
L = list(d)
|
|
L.sort(key=lambda x: x if isinstance(x, tuple) else ())
|
|
self.assertEquals(str(L), '[1, (1,), (1, 2), (1, 2, 3)]')
|
|
|
|
def testAtoms(self):
|
|
### atom: '(' [testlist] ')' | '[' [testlist] ']' | '{' [dictsetmaker] '}' | NAME | NUMBER | STRING
|
|
### dictsetmaker: (test ':' test (',' test ':' test)* [',']) | (test (',' test)* [','])
|
|
|
|
x = (1)
|
|
x = (1 or 2 or 3)
|
|
x = (1 or 2 or 3, 2, 3)
|
|
|
|
x = []
|
|
x = [1]
|
|
x = [1 or 2 or 3]
|
|
x = [1 or 2 or 3, 2, 3]
|
|
x = []
|
|
|
|
x = {}
|
|
x = {'one': 1}
|
|
x = {'one': 1,}
|
|
x = {'one' or 'two': 1 or 2}
|
|
x = {'one': 1, 'two': 2}
|
|
x = {'one': 1, 'two': 2,}
|
|
x = {'one': 1, 'two': 2, 'three': 3, 'four': 4, 'five': 5, 'six': 6}
|
|
|
|
x = {'one'}
|
|
x = {'one', 1,}
|
|
x = {'one', 'two', 'three'}
|
|
x = {2, 3, 4,}
|
|
|
|
x = x
|
|
x = 'x'
|
|
x = 123
|
|
|
|
### exprlist: expr (',' expr)* [',']
|
|
### testlist: test (',' test)* [',']
|
|
# These have been exercised enough above
|
|
|
|
def testClassdef(self):
|
|
# 'class' NAME ['(' [testlist] ')'] ':' suite
|
|
class B: pass
|
|
class B2(): pass
|
|
class C1(B): pass
|
|
class C2(B): pass
|
|
class D(C1, C2, B): pass
|
|
class C:
|
|
def meth1(self): pass
|
|
def meth2(self, arg): pass
|
|
def meth3(self, a1, a2): pass
|
|
|
|
def testListcomps(self):
|
|
# list comprehension tests
|
|
nums = [1, 2, 3, 4, 5]
|
|
strs = ["Apple", "Banana", "Coconut"]
|
|
spcs = [" Apple", " Banana ", "Coco nut "]
|
|
|
|
self.assertEqual([s.strip() for s in spcs], ['Apple', 'Banana', 'Coco nut'])
|
|
self.assertEqual([3 * x for x in nums], [3, 6, 9, 12, 15])
|
|
self.assertEqual([x for x in nums if x > 2], [3, 4, 5])
|
|
self.assertEqual([(i, s) for i in nums for s in strs],
|
|
[(1, 'Apple'), (1, 'Banana'), (1, 'Coconut'),
|
|
(2, 'Apple'), (2, 'Banana'), (2, 'Coconut'),
|
|
(3, 'Apple'), (3, 'Banana'), (3, 'Coconut'),
|
|
(4, 'Apple'), (4, 'Banana'), (4, 'Coconut'),
|
|
(5, 'Apple'), (5, 'Banana'), (5, 'Coconut')])
|
|
self.assertEqual([(i, s) for i in nums for s in [f for f in strs if "n" in f]],
|
|
[(1, 'Banana'), (1, 'Coconut'), (2, 'Banana'), (2, 'Coconut'),
|
|
(3, 'Banana'), (3, 'Coconut'), (4, 'Banana'), (4, 'Coconut'),
|
|
(5, 'Banana'), (5, 'Coconut')])
|
|
self.assertEqual([(lambda a:[a**i for i in range(a+1)])(j) for j in range(5)],
|
|
[[1], [1, 1], [1, 2, 4], [1, 3, 9, 27], [1, 4, 16, 64, 256]])
|
|
|
|
def test_in_func(l):
|
|
return [0 < x < 3 for x in l if x > 2]
|
|
|
|
self.assertEqual(test_in_func(nums), [False, False, False])
|
|
|
|
def test_nested_front():
|
|
self.assertEqual([[y for y in [x, x + 1]] for x in [1,3,5]],
|
|
[[1, 2], [3, 4], [5, 6]])
|
|
|
|
test_nested_front()
|
|
|
|
check_syntax_error(self, "[i, s for i in nums for s in strs]")
|
|
check_syntax_error(self, "[x if y]")
|
|
|
|
suppliers = [
|
|
(1, "Boeing"),
|
|
(2, "Ford"),
|
|
(3, "Macdonalds")
|
|
]
|
|
|
|
parts = [
|
|
(10, "Airliner"),
|
|
(20, "Engine"),
|
|
(30, "Cheeseburger")
|
|
]
|
|
|
|
suppart = [
|
|
(1, 10), (1, 20), (2, 20), (3, 30)
|
|
]
|
|
|
|
x = [
|
|
(sname, pname)
|
|
for (sno, sname) in suppliers
|
|
for (pno, pname) in parts
|
|
for (sp_sno, sp_pno) in suppart
|
|
if sno == sp_sno and pno == sp_pno
|
|
]
|
|
|
|
self.assertEqual(x, [('Boeing', 'Airliner'), ('Boeing', 'Engine'), ('Ford', 'Engine'),
|
|
('Macdonalds', 'Cheeseburger')])
|
|
|
|
def testGenexps(self):
|
|
# generator expression tests
|
|
g = ([x for x in range(10)] for x in range(1))
|
|
self.assertEqual(next(g), [x for x in range(10)])
|
|
try:
|
|
next(g)
|
|
self.fail('should produce StopIteration exception')
|
|
except StopIteration:
|
|
pass
|
|
|
|
a = 1
|
|
try:
|
|
g = (a for d in a)
|
|
next(g)
|
|
self.fail('should produce TypeError')
|
|
except TypeError:
|
|
pass
|
|
|
|
self.assertEqual(list((x, y) for x in 'abcd' for y in 'abcd'), [(x, y) for x in 'abcd' for y in 'abcd'])
|
|
self.assertEqual(list((x, y) for x in 'ab' for y in 'xy'), [(x, y) for x in 'ab' for y in 'xy'])
|
|
|
|
a = [x for x in range(10)]
|
|
b = (x for x in (y for y in a))
|
|
self.assertEqual(sum(b), sum([x for x in range(10)]))
|
|
|
|
self.assertEqual(sum(x**2 for x in range(10)), sum([x**2 for x in range(10)]))
|
|
self.assertEqual(sum(x*x for x in range(10) if x%2), sum([x*x for x in range(10) if x%2]))
|
|
self.assertEqual(sum(x for x in (y for y in range(10))), sum([x for x in range(10)]))
|
|
self.assertEqual(sum(x for x in (y for y in (z for z in range(10)))), sum([x for x in range(10)]))
|
|
self.assertEqual(sum(x for x in [y for y in (z for z in range(10))]), sum([x for x in range(10)]))
|
|
self.assertEqual(sum(x for x in (y for y in (z for z in range(10) if True)) if True), sum([x for x in range(10)]))
|
|
self.assertEqual(sum(x for x in (y for y in (z for z in range(10) if True) if False) if True), 0)
|
|
check_syntax_error(self, "foo(x for x in range(10), 100)")
|
|
check_syntax_error(self, "foo(100, x for x in range(10))")
|
|
|
|
def testComprehensionSpecials(self):
|
|
# test for outmost iterable precomputation
|
|
x = 10; g = (i for i in range(x)); x = 5
|
|
self.assertEqual(len(list(g)), 10)
|
|
|
|
# This should hold, since we're only precomputing outmost iterable.
|
|
x = 10; t = False; g = ((i,j) for i in range(x) if t for j in range(x))
|
|
x = 5; t = True;
|
|
self.assertEqual([(i,j) for i in range(10) for j in range(5)], list(g))
|
|
|
|
# Grammar allows multiple adjacent 'if's in listcomps and genexps,
|
|
# even though it's silly. Make sure it works (ifelse broke this.)
|
|
self.assertEqual([ x for x in range(10) if x % 2 if x % 3 ], [1, 5, 7])
|
|
self.assertEqual(list(x for x in range(10) if x % 2 if x % 3), [1, 5, 7])
|
|
|
|
# verify unpacking single element tuples in listcomp/genexp.
|
|
self.assertEqual([x for x, in [(4,), (5,), (6,)]], [4, 5, 6])
|
|
self.assertEqual(list(x for x, in [(7,), (8,), (9,)]), [7, 8, 9])
|
|
|
|
def testIfElseExpr(self):
|
|
# Test ifelse expressions in various cases
|
|
def _checkeval(msg, ret):
|
|
"helper to check that evaluation of expressions is done correctly"
|
|
print(x)
|
|
return ret
|
|
|
|
# the next line is not allowed anymore
|
|
#self.assertEqual([ x() for x in lambda: True, lambda: False if x() ], [True])
|
|
self.assertEqual([ x() for x in (lambda: True, lambda: False) if x() ], [True])
|
|
self.assertEqual([ x(False) for x in (lambda x: False if x else True, lambda x: True if x else False) if x(False) ], [True])
|
|
self.assertEqual((5 if 1 else _checkeval("check 1", 0)), 5)
|
|
self.assertEqual((_checkeval("check 2", 0) if 0 else 5), 5)
|
|
self.assertEqual((5 and 6 if 0 else 1), 1)
|
|
self.assertEqual(((5 and 6) if 0 else 1), 1)
|
|
self.assertEqual((5 and (6 if 1 else 1)), 6)
|
|
self.assertEqual((0 or _checkeval("check 3", 2) if 0 else 3), 3)
|
|
self.assertEqual((1 or _checkeval("check 4", 2) if 1 else _checkeval("check 5", 3)), 1)
|
|
self.assertEqual((0 or 5 if 1 else _checkeval("check 6", 3)), 5)
|
|
self.assertEqual((not 5 if 1 else 1), False)
|
|
self.assertEqual((not 5 if 0 else 1), 1)
|
|
self.assertEqual((6 + 1 if 1 else 2), 7)
|
|
self.assertEqual((6 - 1 if 1 else 2), 5)
|
|
self.assertEqual((6 * 2 if 1 else 4), 12)
|
|
self.assertEqual((6 / 2 if 1 else 3), 3)
|
|
self.assertEqual((6 < 4 if 0 else 2), 2)
|
|
|
|
|
|
def test_main():
|
|
run_unittest(TokenTests, GrammarTests)
|
|
|
|
if __name__ == '__main__':
|
|
test_main()
|