2001-09-28 20:49:48 -03:00
|
|
|
# Test enhancements related to descriptors and new-style classes
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2003-01-13 16:13:12 -04:00
|
|
|
from test.test_support import verify, vereq, verbose, TestFailed, TESTFN, get_original_stdout
|
2001-08-02 01:15:00 -03:00
|
|
|
from copy import deepcopy
|
2002-04-15 22:59:17 -03:00
|
|
|
import warnings
|
|
|
|
|
|
|
|
warnings.filterwarnings("ignore",
|
|
|
|
r'complex divmod\(\), // and % are deprecated$',
|
2002-06-03 16:45:32 -03:00
|
|
|
DeprecationWarning, r'(<string>|%s)$' % __name__)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-10-11 15:33:53 -03:00
|
|
|
def veris(a, b):
|
|
|
|
if a is not b:
|
|
|
|
raise TestFailed, "%r is %r" % (a, b)
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def testunop(a, res, expr="len(a)", meth="__len__"):
|
|
|
|
if verbose: print "checking", expr
|
|
|
|
dict = {'a': a}
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(eval(expr, dict), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
|
|
|
m = getattr(t, meth)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
|
|
|
vereq(m(a), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
bm = getattr(a, meth)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(bm(), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def testbinop(a, b, res, expr="a+b", meth="__add__"):
|
|
|
|
if verbose: print "checking", expr
|
|
|
|
dict = {'a': a, 'b': b}
|
2001-12-06 02:23:26 -04:00
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(eval(expr, dict), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
|
|
|
m = getattr(t, meth)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
|
|
|
vereq(m(a, b), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
bm = getattr(a, meth)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(bm(b), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def testternop(a, b, c, res, expr="a[b:c]", meth="__getslice__"):
|
|
|
|
if verbose: print "checking", expr
|
|
|
|
dict = {'a': a, 'b': b, 'c': c}
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(eval(expr, dict), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
|
|
|
m = getattr(t, meth)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
|
|
|
vereq(m(a, b, c), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
bm = getattr(a, meth)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(bm(b, c), res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def testsetop(a, b, res, stmt="a+=b", meth="__iadd__"):
|
|
|
|
if verbose: print "checking", stmt
|
|
|
|
dict = {'a': deepcopy(a), 'b': b}
|
|
|
|
exec stmt in dict
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
|
|
|
m = getattr(t, meth)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
m(dict['a'], b)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
bm = getattr(dict['a'], meth)
|
|
|
|
bm(b)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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 in dict
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
|
|
|
m = getattr(t, meth)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
m(dict['a'], b, c)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
bm = getattr(dict['a'], meth)
|
|
|
|
bm(b, c)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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 in dict
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
t = type(a)
|
2001-10-15 18:05:10 -03:00
|
|
|
while meth not in t.__dict__:
|
|
|
|
t = t.__bases__[0]
|
2001-08-02 01:15:00 -03:00
|
|
|
m = getattr(t, meth)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m, t.__dict__[meth])
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
m(dict['a'], b, c, d)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
dict['a'] = deepcopy(a)
|
|
|
|
bm = getattr(dict['a'], meth)
|
|
|
|
bm(b, c, d)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dict['a'], res)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-10-04 02:27:00 -03:00
|
|
|
def class_docstrings():
|
|
|
|
class Classic:
|
|
|
|
"A classic docstring."
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(Classic.__doc__, "A classic docstring.")
|
|
|
|
vereq(Classic.__dict__['__doc__'], "A classic docstring.")
|
2001-10-04 02:27:00 -03:00
|
|
|
|
|
|
|
class Classic2:
|
|
|
|
pass
|
|
|
|
verify(Classic2.__doc__ is None)
|
|
|
|
|
2001-10-04 02:48:13 -03:00
|
|
|
class NewStatic(object):
|
2001-10-04 02:27:00 -03:00
|
|
|
"Another docstring."
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(NewStatic.__doc__, "Another docstring.")
|
|
|
|
vereq(NewStatic.__dict__['__doc__'], "Another docstring.")
|
2001-10-04 02:27:00 -03:00
|
|
|
|
2001-10-04 02:48:13 -03:00
|
|
|
class NewStatic2(object):
|
2001-10-04 02:27:00 -03:00
|
|
|
pass
|
|
|
|
verify(NewStatic2.__doc__ is None)
|
|
|
|
|
2001-10-04 02:48:13 -03:00
|
|
|
class NewDynamic(object):
|
2001-10-04 02:27:00 -03:00
|
|
|
"Another docstring."
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(NewDynamic.__doc__, "Another docstring.")
|
|
|
|
vereq(NewDynamic.__dict__['__doc__'], "Another docstring.")
|
2001-10-04 02:27:00 -03:00
|
|
|
|
2001-10-04 02:48:13 -03:00
|
|
|
class NewDynamic2(object):
|
2001-10-04 02:27:00 -03:00
|
|
|
pass
|
|
|
|
verify(NewDynamic2.__doc__ is None)
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
l = []
|
|
|
|
for i in d.__iter__(): l.append(i)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
l = []
|
2001-10-29 18:25:45 -04:00
|
|
|
for i in dict.__iter__(d): l.append(i)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
d = {1:2, 3:4}
|
|
|
|
testunop(d, 2, "len(a)", "__len__")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(eval(repr(d), {}), d)
|
|
|
|
vereq(eval(d.__repr__(), {}), d)
|
2001-08-02 01:15:00 -03:00
|
|
|
testset2op({1:2,3:4}, 2, 3, {1:2,2:3,3:4}, "a[b]=c", "__setitem__")
|
|
|
|
|
2001-09-02 05:22:48 -03:00
|
|
|
def dict_constructor():
|
|
|
|
if verbose:
|
2001-10-29 18:25:45 -04:00
|
|
|
print "Testing dict constructor ..."
|
|
|
|
d = dict()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d, {})
|
2001-10-29 18:25:45 -04:00
|
|
|
d = dict({})
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d, {})
|
2001-10-29 18:25:45 -04:00
|
|
|
d = dict({1: 2, 'a': 'b'})
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d, {1: 2, 'a': 'b'})
|
2001-10-29 18:25:45 -04:00
|
|
|
vereq(d, dict(d.items()))
|
2002-11-23 05:45:04 -04:00
|
|
|
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))
|
2001-09-02 05:22:48 -03:00
|
|
|
for badarg in 0, 0L, 0j, "0", [0], (0,):
|
|
|
|
try:
|
2001-10-29 18:25:45 -04:00
|
|
|
dict(badarg)
|
2001-09-02 05:22:48 -03:00
|
|
|
except TypeError:
|
|
|
|
pass
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
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:
|
2001-10-29 18:25:45 -04:00
|
|
|
raise TestFailed("no TypeError from dict(%r)" % badarg)
|
2001-09-02 05:22:48 -03:00
|
|
|
else:
|
2001-10-29 18:25:45 -04:00
|
|
|
raise TestFailed("no TypeError from dict(%r)" % badarg)
|
2001-09-02 05:22:48 -03:00
|
|
|
|
|
|
|
try:
|
2001-10-29 18:25:45 -04:00
|
|
|
dict({}, {})
|
2001-09-02 05:22:48 -03:00
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2001-10-29 18:25:45 -04:00
|
|
|
raise TestFailed("no TypeError from dict({}, {})")
|
2001-09-02 05:22:48 -03:00
|
|
|
|
|
|
|
class Mapping:
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
# Lacks a .keys() method; will be added later.
|
2001-09-02 05:22:48 -03:00
|
|
|
dict = {1:2, 3:4, 'a':1j}
|
|
|
|
|
|
|
|
try:
|
2001-10-29 18:25:45 -04:00
|
|
|
dict(Mapping())
|
2001-09-02 05:22:48 -03:00
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2001-10-29 18:25:45 -04:00
|
|
|
raise TestFailed("no TypeError from dict(incomplete mapping)")
|
2001-09-02 05:22:48 -03:00
|
|
|
|
|
|
|
Mapping.keys = lambda self: self.dict.keys()
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
Mapping.__getitem__ = lambda self, i: self.dict[i]
|
2002-11-23 05:45:04 -04:00
|
|
|
d = dict(Mapping())
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d, Mapping.dict)
|
2001-09-02 05:22:48 -03:00
|
|
|
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
# 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])
|
|
|
|
|
2001-10-29 18:25:45 -04:00
|
|
|
d = dict([AddressBookEntry('Tim', 'Warsaw'),
|
2001-10-30 01:41:07 -04:00
|
|
|
AddressBookEntry('Barry', 'Peters'),
|
|
|
|
AddressBookEntry('Tim', 'Peters'),
|
|
|
|
AddressBookEntry('Barry', 'Warsaw')])
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
vereq(d, {'Barry': 'Warsaw', 'Tim': 'Peters'})
|
|
|
|
|
2001-10-29 18:25:45 -04:00
|
|
|
d = dict(zip(range(4), range(1, 5)))
|
|
|
|
vereq(d, dict([(i, i+1) for i in range(4)]))
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
|
|
|
|
# Bad sequence lengths.
|
2001-10-26 17:57:38 -03:00
|
|
|
for bad in [('tooshort',)], [('too', 'long', 'by 1')]:
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
try:
|
2001-10-29 18:25:45 -04:00
|
|
|
dict(bad)
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
except ValueError:
|
|
|
|
pass
|
|
|
|
else:
|
2001-10-29 18:25:45 -04:00
|
|
|
raise TestFailed("no ValueError from dict(%r)" % bad)
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
|
2001-09-03 02:47:38 -03:00
|
|
|
def test_dir():
|
|
|
|
if verbose:
|
|
|
|
print "Testing dir() ..."
|
|
|
|
junk = 12
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(dir(), ['junk'])
|
2001-09-03 02:47:38 -03:00
|
|
|
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)
|
|
|
|
|
2006-04-15 06:04:57 -03:00
|
|
|
# Test dir on custom classes. Since these have object as a
|
|
|
|
# base class, a lot of stuff gets sucked in.
|
2001-09-03 22:20:04 -03:00
|
|
|
def interesting(strings):
|
|
|
|
return [s for s in strings if not s.startswith('_')]
|
2001-09-03 02:47:38 -03:00
|
|
|
|
|
|
|
class C(object):
|
|
|
|
Cdata = 1
|
|
|
|
def Cmethod(self): pass
|
2001-09-03 22:20:04 -03:00
|
|
|
|
|
|
|
cstuff = ['Cdata', 'Cmethod']
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(C)), cstuff)
|
2001-09-03 22:20:04 -03:00
|
|
|
|
|
|
|
c = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(c)), cstuff)
|
2001-09-16 23:38:46 -03:00
|
|
|
verify('im_self' in dir(C.Cmethod))
|
2001-09-03 22:20:04 -03:00
|
|
|
|
|
|
|
c.cdata = 2
|
|
|
|
c.cmethod = lambda self: 0
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(c)), cstuff + ['cdata', 'cmethod'])
|
2001-09-16 23:38:46 -03:00
|
|
|
verify('im_self' in dir(c.Cmethod))
|
2001-09-03 22:20:04 -03:00
|
|
|
|
2001-09-03 02:47:38 -03:00
|
|
|
class A(C):
|
|
|
|
Adata = 1
|
|
|
|
def Amethod(self): pass
|
2001-09-03 22:20:04 -03:00
|
|
|
|
|
|
|
astuff = ['Adata', 'Amethod'] + cstuff
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(A)), astuff)
|
2001-09-16 23:38:46 -03:00
|
|
|
verify('im_self' in dir(A.Amethod))
|
2001-09-03 22:20:04 -03:00
|
|
|
a = A()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(a)), astuff)
|
2001-09-03 22:20:04 -03:00
|
|
|
a.adata = 42
|
|
|
|
a.amethod = lambda self: 3
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(interesting(dir(a)), astuff + ['adata', 'amethod'])
|
2001-09-16 23:38:46 -03:00
|
|
|
verify('im_self' in dir(a.Amethod))
|
2001-09-03 02:47:38 -03:00
|
|
|
|
2001-09-10 20:12:14 -03:00
|
|
|
# Try a module subclass.
|
|
|
|
import sys
|
|
|
|
class M(type(sys)):
|
|
|
|
pass
|
2002-06-04 03:10:37 -03:00
|
|
|
minstance = M("m")
|
2001-09-10 20:12:14 -03:00
|
|
|
minstance.b = 2
|
|
|
|
minstance.a = 1
|
2002-06-04 03:10:37 -03:00
|
|
|
names = [x for x in dir(minstance) if x not in ["__name__", "__doc__"]]
|
|
|
|
vereq(names, ['a', 'b'])
|
2001-09-10 20:12:14 -03:00
|
|
|
|
|
|
|
class M2(M):
|
|
|
|
def getdict(self):
|
|
|
|
return "Not a dict!"
|
|
|
|
__dict__ = property(getdict)
|
|
|
|
|
2002-06-04 03:10:37 -03:00
|
|
|
m2instance = M2("m2")
|
2001-09-10 20:12:14 -03:00
|
|
|
m2instance.b = 2
|
|
|
|
m2instance.a = 1
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(m2instance.__dict__, "Not a dict!")
|
2001-09-10 20:12:14 -03:00
|
|
|
try:
|
|
|
|
dir(m2instance)
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
|
2001-10-30 01:45:26 -04:00
|
|
|
# Two essentially featureless objects, just inheriting stuff from
|
|
|
|
# object.
|
|
|
|
vereq(dir(None), dir(Ellipsis))
|
|
|
|
|
2002-05-13 15:29:46 -03:00
|
|
|
# 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
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
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():
|
2001-10-09 08:07:24 -03:00
|
|
|
if name not in skip:
|
|
|
|
name = "__%s__" % name
|
|
|
|
if hasattr(a, name):
|
|
|
|
res = eval(expr, dict)
|
|
|
|
testunop(a, res, expr, name)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def ints():
|
|
|
|
if verbose: print "Testing int operations..."
|
|
|
|
numops(100, 3)
|
2002-03-10 20:07:13 -04:00
|
|
|
# The following crashes in Python 2.2
|
|
|
|
vereq((1).__nonzero__(), 1)
|
|
|
|
vereq((0).__nonzero__(), 0)
|
2002-03-11 09:21:25 -04:00
|
|
|
# This returns 'NotImplemented' in Python 2.2
|
|
|
|
class C(int):
|
|
|
|
def __add__(self, other):
|
|
|
|
return NotImplemented
|
2003-02-09 22:12:43 -04:00
|
|
|
vereq(C(5L), 5)
|
2002-03-11 09:21:25 -04:00
|
|
|
try:
|
|
|
|
C() + ""
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2002-03-11 10:44:12 -04:00
|
|
|
raise TestFailed, "NotImplemented should have caused TypeError"
|
2003-02-09 22:12:43 -04:00
|
|
|
import sys
|
|
|
|
try:
|
|
|
|
C(sys.maxint+1)
|
|
|
|
except OverflowError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "should have raised OverflowError"
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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..."
|
2001-10-09 08:07:24 -03:00
|
|
|
numops(100.0j, 3.0j, skip=['lt', 'le', 'gt', 'ge', 'int', 'long', 'float'])
|
2001-08-02 01:15:00 -03:00
|
|
|
class Number(complex):
|
|
|
|
__slots__ = ['prec']
|
2001-09-13 16:18:27 -03:00
|
|
|
def __new__(cls, *args, **kwds):
|
|
|
|
result = complex.__new__(cls, *args)
|
|
|
|
result.prec = kwds.get('prec', 12)
|
|
|
|
return result
|
2001-08-02 01:15:00 -03:00
|
|
|
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__
|
2001-09-13 16:18:27 -03:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
a = Number(3.14, prec=6)
|
2004-02-12 13:35:32 -04:00
|
|
|
vereq(repr(a), "3.14")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.prec, 6)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-09-13 16:18:27 -03:00
|
|
|
a = Number(a, prec=2)
|
2004-02-12 13:35:32 -04:00
|
|
|
vereq(repr(a), "3.1")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.prec, 2)
|
2001-09-13 16:18:27 -03:00
|
|
|
|
|
|
|
a = Number(234.5)
|
2004-02-12 13:35:32 -04:00
|
|
|
vereq(repr(a), "234.5")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.prec, 12)
|
2001-09-13 16:18:27 -03:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, [])
|
|
|
|
vereq(a.foo(), 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.append(100)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, [100])
|
|
|
|
vereq(a.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(42)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 42)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
l = []
|
|
|
|
for i in d.__iter__(): l.append(i)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
l = []
|
|
|
|
for i in type(spamdict({})).__iter__(d): l.append(i)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(l, l1)
|
2001-08-02 01:15:00 -03:00
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.items(), [])
|
|
|
|
vereq(a.foo(), 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
a['foo'] = 'bar'
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.items(), [('foo', 'bar')])
|
|
|
|
vereq(a.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(100)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 100)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def pydicts():
|
|
|
|
if verbose: print "Testing Python subclass of dict..."
|
2001-10-29 18:25:45 -04:00
|
|
|
verify(issubclass(dict, dict))
|
|
|
|
verify(isinstance({}, dict))
|
|
|
|
d = dict()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d, {})
|
2001-10-29 18:25:45 -04:00
|
|
|
verify(d.__class__ is dict)
|
|
|
|
verify(isinstance(d, dict))
|
|
|
|
class C(dict):
|
2001-08-02 01:15:00 -03:00
|
|
|
state = -1
|
|
|
|
def __init__(self, *a, **kw):
|
|
|
|
if a:
|
2001-11-24 17:07:01 -04:00
|
|
|
vereq(len(a), 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
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):
|
2001-11-24 17:07:01 -04:00
|
|
|
verify(isinstance(key, type(0)))
|
2001-10-29 18:25:45 -04:00
|
|
|
dict.__setitem__(self, key, value)
|
2001-08-02 01:15:00 -03:00
|
|
|
def setstate(self, state):
|
|
|
|
self.state = state
|
|
|
|
def getstate(self):
|
|
|
|
return self.state
|
2001-10-29 18:25:45 -04:00
|
|
|
verify(issubclass(C, dict))
|
2001-08-02 01:15:00 -03:00
|
|
|
a1 = C(12)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a1.state, 12)
|
2001-08-02 01:15:00 -03:00
|
|
|
a2 = C(foo=1, bar=2)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a2[1] == 'foo' and a2[2], 'bar')
|
2001-08-02 01:15:00 -03:00
|
|
|
a = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.state, -1)
|
|
|
|
vereq(a.getstate(), -1)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(0)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.state, 0)
|
|
|
|
vereq(a.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(10)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.state, 10)
|
|
|
|
vereq(a.getstate(), 10)
|
|
|
|
vereq(a[42], 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a[42] = 24
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a[42], 24)
|
2001-08-02 01:15:00 -03:00
|
|
|
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):
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a[i][j], i*j)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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])
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a[0], 100)
|
|
|
|
vereq(a[1], 101)
|
|
|
|
vereq(a[2], 102)
|
|
|
|
vereq(a[100:200], (100,200))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(10)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 10)
|
2001-08-02 01:15:00 -03:00
|
|
|
class D:
|
|
|
|
class __metaclass__(type):
|
|
|
|
def myself(cls): return cls
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D.myself(), D)
|
2001-08-17 08:43:17 -03:00
|
|
|
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
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.__spam__, 1)
|
2001-08-17 08:43:17 -03:00
|
|
|
c = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c.__spam__, 1)
|
2001-08-30 17:52:40 -03:00
|
|
|
|
2001-08-17 08:43:17 -03:00
|
|
|
class _instance(object):
|
|
|
|
pass
|
|
|
|
class M2(object):
|
2005-01-15 20:25:31 -04:00
|
|
|
@staticmethod
|
2001-08-17 08:43:17 -03:00
|
|
|
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()
|
2001-08-17 08:55:58 -03:00
|
|
|
# Early binding of methods
|
|
|
|
for key in self.dict:
|
|
|
|
if key.startswith("__"):
|
|
|
|
continue
|
|
|
|
setattr(it, key, self.dict[key].__get__(it, self))
|
2001-08-17 08:43:17 -03:00
|
|
|
return it
|
|
|
|
class C:
|
|
|
|
__metaclass__ = M2
|
|
|
|
def spam(self):
|
|
|
|
return 42
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.name, 'C')
|
|
|
|
vereq(C.bases, ())
|
2001-08-17 08:43:17 -03:00
|
|
|
verify('spam' in C.dict)
|
|
|
|
c = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c.spam(), 42)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-08-30 17:52:40 -03:00
|
|
|
# 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)
|
2001-08-31 01:35:14 -03:00
|
|
|
# Name mangling for __super removes leading underscores
|
2001-08-30 17:52:40 -03:00
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D().meth(), "DCBA")
|
2001-08-30 17:52:40 -03:00
|
|
|
class E(B, C):
|
|
|
|
def meth(self):
|
|
|
|
return "E" + self.__super.meth()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(E().meth(), "EBCA")
|
2001-08-30 17:52:40 -03:00
|
|
|
|
2001-09-06 18:56:42 -03:00
|
|
|
class autoproperty(type):
|
|
|
|
# Automatically create property attributes when methods
|
2001-08-30 17:52:40 -03:00
|
|
|
# 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():
|
2001-09-06 18:56:42 -03:00
|
|
|
dict[key] = property(get, set)
|
|
|
|
return super(autoproperty, metaclass).__new__(metaclass,
|
2001-08-30 17:52:40 -03:00
|
|
|
name, bases, dict)
|
|
|
|
class A:
|
2001-09-06 18:56:42 -03:00
|
|
|
__metaclass__ = autoproperty
|
2001-08-30 17:52:40 -03:00
|
|
|
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
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.x, 12)
|
|
|
|
vereq(a._A__x, -12)
|
2001-08-30 17:52:40 -03:00
|
|
|
|
2001-09-06 18:56:42 -03:00
|
|
|
class multimetaclass(autoproperty, autosuper):
|
2001-08-30 17:52:40 -03:00
|
|
|
# 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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D().x, "DCBA")
|
2001-08-30 17:52:40 -03:00
|
|
|
|
2001-10-18 12:49:21 -03:00
|
|
|
# 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)
|
|
|
|
|
2001-12-11 00:37:34 -04:00
|
|
|
class C(object): pass
|
|
|
|
c = C()
|
|
|
|
try: c()
|
|
|
|
except TypeError: pass
|
2002-04-01 14:59:20 -04:00
|
|
|
else: raise TestFailed, "calling object w/o call method should raise TypeError"
|
2001-12-11 00:37:34 -04:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def pymods():
|
|
|
|
if verbose: print "Testing Python subclass of module..."
|
|
|
|
log = []
|
2001-08-12 02:24:18 -03:00
|
|
|
import sys
|
|
|
|
MT = type(sys)
|
2001-08-02 01:15:00 -03:00
|
|
|
class MM(MT):
|
2002-06-04 03:10:37 -03:00
|
|
|
def __init__(self, name):
|
|
|
|
MT.__init__(self, name)
|
2001-09-21 16:29:08 -03:00
|
|
|
def __getattribute__(self, name):
|
2001-08-02 01:15:00 -03:00
|
|
|
log.append(("getattr", name))
|
2001-09-21 16:29:08 -03:00
|
|
|
return MT.__getattribute__(self, name)
|
2001-08-02 01:15:00 -03:00
|
|
|
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)
|
2002-06-04 03:10:37 -03:00
|
|
|
a = MM("a")
|
2001-08-02 01:15:00 -03:00
|
|
|
a.foo = 12
|
|
|
|
x = a.foo
|
|
|
|
del a.foo
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(log, [("setattr", "foo", 12),
|
|
|
|
("getattr", "foo"),
|
|
|
|
("delattr", "foo")])
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.setstate(10)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.getstate(), 10)
|
2001-10-29 18:25:45 -04:00
|
|
|
class D(dict, C):
|
2001-08-02 01:15:00 -03:00
|
|
|
def __init__(self):
|
|
|
|
type({}).__init__(self)
|
|
|
|
C.__init__(self)
|
|
|
|
d = D()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.keys(), [])
|
2001-08-02 01:15:00 -03:00
|
|
|
d["hello"] = "world"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.items(), [("hello", "world")])
|
|
|
|
vereq(d["hello"], "world")
|
|
|
|
vereq(d.getstate(), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
d.setstate(10)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.getstate(), 10)
|
2001-10-29 18:25:45 -04:00
|
|
|
vereq(D.__mro__, (D, dict, C, object))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-08-10 18:28:46 -03:00
|
|
|
# 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"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(Node().__int__(), 23)
|
|
|
|
vereq(int(Node()), 23)
|
|
|
|
vereq(Frag().__int__(), 42)
|
|
|
|
vereq(int(Frag()), 42)
|
2001-08-10 18:28:46 -03:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def diamond():
|
|
|
|
if verbose: print "Testing multiple inheritance special cases..."
|
|
|
|
class A(object):
|
|
|
|
def spam(self): return "A"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(A().spam(), "A")
|
2001-08-02 01:15:00 -03:00
|
|
|
class B(A):
|
|
|
|
def boo(self): return "B"
|
|
|
|
def spam(self): return "B"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(B().spam(), "B")
|
|
|
|
vereq(B().boo(), "B")
|
2001-08-02 01:15:00 -03:00
|
|
|
class C(A):
|
|
|
|
def boo(self): return "C"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C().spam(), "A")
|
|
|
|
vereq(C().boo(), "C")
|
2001-08-02 01:15:00 -03:00
|
|
|
class D(B, C): pass
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D().spam(), "B")
|
|
|
|
vereq(D().boo(), "B")
|
|
|
|
vereq(D.__mro__, (D, B, C, A, object))
|
2001-08-02 01:15:00 -03:00
|
|
|
class E(C, B): pass
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(E().spam(), "B")
|
|
|
|
vereq(E().boo(), "C")
|
|
|
|
vereq(E.__mro__, (E, C, B, A, object))
|
2002-11-14 15:50:14 -04:00
|
|
|
# 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))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2003-04-06 16:13:41 -03:00
|
|
|
mro_err_msg = """Cannot create a consistent method resolution
|
|
|
|
order (MRO) for bases """
|
2003-03-12 00:25:42 -04:00
|
|
|
|
2002-11-25 17:38:52 -04:00
|
|
|
def mro_disagreement():
|
|
|
|
if verbose: print "Testing error messages for MRO disagreement..."
|
|
|
|
def raises(exc, expected, callable, *args):
|
|
|
|
try:
|
|
|
|
callable(*args)
|
|
|
|
except exc, msg:
|
2002-11-27 00:00:59 -04:00
|
|
|
if not str(msg).startswith(expected):
|
2002-11-25 17:38:52 -04:00
|
|
|
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), {})
|
2003-03-12 00:25:42 -04:00
|
|
|
raises(TypeError, mro_err_msg,
|
2002-11-25 17:38:52 -04:00
|
|
|
type, "X", (A, B), {})
|
2003-03-12 00:25:42 -04:00
|
|
|
raises(TypeError, mro_err_msg,
|
2002-11-25 17:38:52 -04:00
|
|
|
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
|
2003-03-12 00:25:42 -04:00
|
|
|
raises(TypeError, mro_err_msg,
|
2002-11-25 17:38:52 -04:00
|
|
|
type, "ConfusedGrid", (HVGrid, VHGrid), {})
|
|
|
|
|
2001-08-09 16:45:21 -03:00
|
|
|
def objects():
|
|
|
|
if verbose: print "Testing object class..."
|
|
|
|
a = object()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.__class__, object)
|
|
|
|
vereq(type(a), object)
|
2001-08-09 16:45:21 -03:00
|
|
|
b = object()
|
|
|
|
verify(a is not b)
|
|
|
|
verify(not hasattr(a, "foo"))
|
|
|
|
try:
|
|
|
|
a.foo = 12
|
2001-08-10 16:42:38 -03:00
|
|
|
except (AttributeError, TypeError):
|
2001-08-09 16:45:21 -03:00
|
|
|
pass
|
|
|
|
else:
|
|
|
|
verify(0, "object() should not allow setting a foo attribute")
|
|
|
|
verify(not hasattr(object(), "__dict__"))
|
|
|
|
|
|
|
|
class Cdict(object):
|
|
|
|
pass
|
|
|
|
x = Cdict()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(x.__dict__, {})
|
2001-08-09 16:45:21 -03:00
|
|
|
x.foo = 1
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(x.foo, 1)
|
|
|
|
vereq(x.__dict__, {'foo': 1})
|
2001-08-09 16:45:21 -03:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
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__"))
|
2001-12-04 12:23:42 -04:00
|
|
|
verify(not hasattr(x, "a"))
|
2001-08-02 01:15:00 -03:00
|
|
|
x.a = 1
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(x.a, 1)
|
2001-12-04 12:23:42 -04:00
|
|
|
x.a = None
|
|
|
|
veris(x.a, None)
|
2001-08-02 01:15:00 -03:00
|
|
|
del x.a
|
2001-12-04 12:23:42 -04:00
|
|
|
verify(not hasattr(x, "a"))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
class C3(object):
|
|
|
|
__slots__ = ['a', 'b', 'c']
|
|
|
|
x = C3()
|
|
|
|
verify(not hasattr(x, "__dict__"))
|
2001-12-04 12:23:42 -04:00
|
|
|
verify(not hasattr(x, 'a'))
|
|
|
|
verify(not hasattr(x, 'b'))
|
|
|
|
verify(not hasattr(x, 'c'))
|
2001-08-02 01:15:00 -03:00
|
|
|
x.a = 1
|
|
|
|
x.b = 2
|
|
|
|
x.c = 3
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(x.a, 1)
|
|
|
|
vereq(x.b, 2)
|
|
|
|
vereq(x.c, 3)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2002-06-20 19:23:15 -03:00
|
|
|
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"
|
|
|
|
|
2002-06-04 16:52:53 -03:00
|
|
|
# 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"]
|
|
|
|
|
2001-12-05 18:45:48 -04:00
|
|
|
# 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)
|
|
|
|
|
2002-06-04 16:52:53 -03:00
|
|
|
# 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)
|
|
|
|
|
2002-06-24 10:08:16 -03:00
|
|
|
# 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)
|
2003-06-16 19:51:22 -03:00
|
|
|
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
|
2002-06-24 10:08:16 -03:00
|
|
|
|
2002-08-13 15:26:26 -03:00
|
|
|
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})
|
|
|
|
|
2002-11-14 15:50:14 -04:00
|
|
|
# MRO order disagreement
|
|
|
|
#
|
|
|
|
# class C3(C1, C2):
|
|
|
|
# __slots__ = []
|
|
|
|
#
|
|
|
|
# class C4(C2, C1):
|
|
|
|
# __slots__ = []
|
2002-08-13 15:26:26 -03:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def dynamics():
|
2001-10-15 18:05:10 -03:00
|
|
|
if verbose: print "Testing class attribute propagation..."
|
2001-08-02 01:15:00 -03:00
|
|
|
class D(object):
|
|
|
|
pass
|
2001-10-15 18:05:10 -03:00
|
|
|
class E(D):
|
2001-08-02 01:15:00 -03:00
|
|
|
pass
|
2001-10-15 18:05:10 -03:00
|
|
|
class F(D):
|
2001-08-02 01:15:00 -03:00
|
|
|
pass
|
|
|
|
D.foo = 1
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D.foo, 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
# Test that dynamic attributes are inherited
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(E.foo, 1)
|
|
|
|
vereq(F.foo, 1)
|
2001-08-12 00:38:18 -03:00
|
|
|
# Test dynamic instances
|
|
|
|
class C(object):
|
2001-10-15 18:05:10 -03:00
|
|
|
pass
|
2001-08-12 00:38:18 -03:00
|
|
|
a = C()
|
2001-08-12 02:24:18 -03:00
|
|
|
verify(not hasattr(a, "foobar"))
|
2001-08-12 00:38:18 -03:00
|
|
|
C.foobar = 2
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.foobar, 2)
|
2001-08-12 00:38:18 -03:00
|
|
|
C.method = lambda self: 42
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.method(), 42)
|
2001-08-12 00:38:18 -03:00
|
|
|
C.__repr__ = lambda self: "C()"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(repr(a), "C()")
|
2001-08-12 02:24:18 -03:00
|
|
|
C.__int__ = lambda self: 100
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(int(a), 100)
|
|
|
|
vereq(a.foobar, 2)
|
2001-08-12 02:24:18 -03:00
|
|
|
verify(not hasattr(a, "spam"))
|
|
|
|
def mygetattr(self, name):
|
|
|
|
if name == "spam":
|
|
|
|
return "spam"
|
2001-09-21 18:24:49 -03:00
|
|
|
raise AttributeError
|
|
|
|
C.__getattr__ = mygetattr
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.spam, "spam")
|
2001-08-12 02:24:18 -03:00
|
|
|
a.new = 12
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.new, 12)
|
2001-08-12 02:24:18 -03:00
|
|
|
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")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.spam, "spam")
|
2001-08-14 17:00:33 -03:00
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
d = D()
|
|
|
|
d.foo = 1
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.foo, 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-09-15 00:14:32 -03:00
|
|
|
# Test handling of int*seq and seq*int
|
|
|
|
class I(int):
|
2001-10-15 18:05:10 -03:00
|
|
|
pass
|
2001-10-08 13:35:45 -03:00
|
|
|
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)
|
2001-09-15 00:14:32 -03:00
|
|
|
|
|
|
|
# Test handling of long*seq and seq*long
|
|
|
|
class L(long):
|
2001-10-15 18:05:10 -03:00
|
|
|
pass
|
2001-10-08 13:35:45 -03:00
|
|
|
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)
|
2001-09-15 00:14:32 -03:00
|
|
|
|
2001-09-24 15:47:40 -03:00
|
|
|
# Test comparison of classes with dynamic metaclasses
|
|
|
|
class dynamicmetaclass(type):
|
2001-10-15 18:05:10 -03:00
|
|
|
pass
|
2001-09-24 15:47:40 -03:00
|
|
|
class someclass:
|
|
|
|
__metaclass__ = dynamicmetaclass
|
|
|
|
verify(someclass != object)
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def errors():
|
|
|
|
if verbose: print "Testing errors..."
|
|
|
|
|
|
|
|
try:
|
2001-10-29 18:25:45 -04:00
|
|
|
class C(list, dict):
|
2001-08-02 01:15:00 -03:00
|
|
|
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:
|
2001-08-29 12:48:43 -03:00
|
|
|
class C(type(len)):
|
2001-08-02 01:15:00 -03:00
|
|
|
pass
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2001-08-29 12:48:43 -03:00
|
|
|
verify(0, "inheritance from CFunction should be illegal")
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.goo(1), (C, 1))
|
|
|
|
vereq(c.goo(1), (C, 1))
|
|
|
|
vereq(c.foo(1), (c, 1))
|
2001-08-02 01:15:00 -03:00
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
d = D()
|
2001-10-08 13:35:45 -03:00
|
|
|
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))
|
2002-03-17 23:09:06 -04:00
|
|
|
# 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))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2002-04-02 13:53:47 -04:00
|
|
|
# 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,))
|
|
|
|
|
2003-06-17 22:13:41 -03:00
|
|
|
# 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"
|
|
|
|
|
2006-02-21 18:17:46 -04:00
|
|
|
# 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"
|
|
|
|
|
2002-03-28 11:49:54 -04:00
|
|
|
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)
|
2002-12-09 18:56:13 -04:00
|
|
|
veris(x, spam.spamlist)
|
|
|
|
vereq(a, a1)
|
2002-03-28 11:49:54 -04:00
|
|
|
vereq(d, d1)
|
|
|
|
x, a1, d1 = spam.spamlist().classmeth(*a, **d)
|
2002-12-09 18:56:13 -04:00
|
|
|
veris(x, spam.spamlist)
|
|
|
|
vereq(a, a1)
|
2002-03-28 11:49:54 -04:00
|
|
|
vereq(d, d1)
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def staticmethods():
|
|
|
|
if verbose: print "Testing static methods..."
|
|
|
|
class C(object):
|
|
|
|
def foo(*a): return a
|
|
|
|
goo = staticmethod(foo)
|
|
|
|
c = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.goo(1), (1,))
|
|
|
|
vereq(c.goo(1), (1,))
|
|
|
|
vereq(c.foo(1), (c, 1,))
|
2001-08-02 01:15:00 -03:00
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
d = D()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D.goo(1), (1,))
|
|
|
|
vereq(d.goo(1), (1,))
|
|
|
|
vereq(d.foo(1), (d, 1))
|
|
|
|
vereq(D.foo(d, 1), (d, 1))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2002-03-28 11:49:54 -04:00
|
|
|
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)
|
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def classic():
|
|
|
|
if verbose: print "Testing classic classes..."
|
|
|
|
class C:
|
|
|
|
def foo(*a): return a
|
|
|
|
goo = classmethod(foo)
|
|
|
|
c = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.goo(1), (C, 1))
|
|
|
|
vereq(c.goo(1), (C, 1))
|
|
|
|
vereq(c.foo(1), (c, 1))
|
2001-08-02 01:15:00 -03:00
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
d = D()
|
2001-10-08 13:35:45 -03:00
|
|
|
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))
|
2001-08-17 10:40:47 -03:00
|
|
|
class E: # *not* subclassing from C
|
|
|
|
foo = C.foo
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(E().foo, C.foo) # i.e., unbound
|
2001-08-17 10:58:31 -03:00
|
|
|
verify(repr(C.foo.__get__(C())).startswith("<bound method "))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
def compattr():
|
|
|
|
if verbose: print "Testing computed attributes..."
|
|
|
|
class C(object):
|
|
|
|
class computed_attribute(object):
|
2002-08-01 11:39:25 -03:00
|
|
|
def __init__(self, get, set=None, delete=None):
|
2001-08-02 01:15:00 -03:00
|
|
|
self.__get = get
|
|
|
|
self.__set = set
|
2002-08-01 11:39:25 -03:00
|
|
|
self.__delete = delete
|
2001-08-02 01:15:00 -03:00
|
|
|
def __get__(self, obj, type=None):
|
|
|
|
return self.__get(obj)
|
|
|
|
def __set__(self, obj, value):
|
|
|
|
return self.__set(obj, value)
|
2002-08-01 11:39:25 -03:00
|
|
|
def __delete__(self, obj):
|
|
|
|
return self.__delete(obj)
|
2001-08-02 01:15:00 -03:00
|
|
|
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
|
2002-08-01 11:39:25 -03:00
|
|
|
def __delete_x(self):
|
|
|
|
del self.__x
|
|
|
|
x = computed_attribute(__get_x, __set_x, __delete_x)
|
2001-08-02 01:15:00 -03:00
|
|
|
a = C()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.x, 0)
|
|
|
|
vereq(a.x, 1)
|
2001-08-02 01:15:00 -03:00
|
|
|
a.x = 10
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.x, 10)
|
|
|
|
vereq(a.x, 11)
|
2002-08-01 11:39:25 -03:00
|
|
|
del a.x
|
|
|
|
vereq(hasattr(a, 'x'), 0)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.foo, 3)
|
2001-08-02 01:15:00 -03:00
|
|
|
verify(a.__class__ is C)
|
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
b = D()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(b.foo, 3)
|
2001-08-02 01:15:00 -03:00
|
|
|
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
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(D.mro(), [D, B, C, A, object])
|
|
|
|
vereq(D.__mro__, (D, B, C, A, object))
|
|
|
|
vereq(D().f(), "C")
|
2002-11-14 15:50:14 -04:00
|
|
|
|
2001-08-12 02:24:18 -03:00
|
|
|
class PerverseMetaType(type):
|
|
|
|
def mro(cls):
|
|
|
|
L = type.mro(cls)
|
|
|
|
L.reverse()
|
|
|
|
return L
|
2002-11-14 15:50:14 -04:00
|
|
|
class X(D,B,C,A):
|
2001-08-02 01:15:00 -03:00
|
|
|
__metaclass__ = PerverseMetaType
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(X.__mro__, (object, A, C, B, D, X))
|
|
|
|
vereq(X().f(), "A")
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2005-12-29 13:07:39 -04:00
|
|
|
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"
|
2005-12-30 14:42:42 -04:00
|
|
|
|
2005-12-29 13:07:39 -04:00
|
|
|
|
2001-08-02 01:15:00 -03:00
|
|
|
def overloading():
|
2001-08-17 18:27:53 -03:00
|
|
|
if verbose: print "Testing operator overloading..."
|
2001-08-02 01:15:00 -03:00
|
|
|
|
|
|
|
class B(object):
|
|
|
|
"Intermediate class because object doesn't have a __setattr__"
|
|
|
|
|
|
|
|
class C(B):
|
|
|
|
|
2001-09-21 18:24:49 -03:00
|
|
|
def __getattr__(self, name):
|
2001-08-02 01:15:00 -03:00
|
|
|
if name == "foo":
|
|
|
|
return ("getattr", name)
|
|
|
|
else:
|
2001-09-21 18:24:49 -03:00
|
|
|
raise AttributeError
|
2001-08-02 01:15:00 -03:00
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.foo, ("getattr", "foo"))
|
2001-08-02 01:15:00 -03:00
|
|
|
a.foo = 12
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.setattr, ("foo", 12))
|
2001-08-02 01:15:00 -03:00
|
|
|
del a.foo
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.delattr, "foo")
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a[12], ("getitem", 12))
|
2001-08-02 01:15:00 -03:00
|
|
|
a[12] = 21
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.setitem, (12, 21))
|
2001-08-02 01:15:00 -03:00
|
|
|
del a[12]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.delitem, 12)
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a[0:10], ("getslice", 0, 10))
|
2001-08-02 01:15:00 -03:00
|
|
|
a[0:10] = "foo"
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.setslice, (0, 10, "foo"))
|
2001-08-02 01:15:00 -03:00
|
|
|
del a[0:10]
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a.delslice, (0, 10))
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-08-15 14:51:17 -03:00
|
|
|
def methods():
|
2001-08-17 18:27:53 -03:00
|
|
|
if verbose: print "Testing methods..."
|
2001-08-15 14:51:17 -03:00
|
|
|
class C(object):
|
|
|
|
def __init__(self, x):
|
|
|
|
self.x = x
|
|
|
|
def foo(self):
|
|
|
|
return self.x
|
|
|
|
c1 = C(1)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c1.foo(), 1)
|
2001-08-15 14:51:17 -03:00
|
|
|
class D(C):
|
|
|
|
boo = C.foo
|
|
|
|
goo = c1.foo
|
|
|
|
d2 = D(2)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d2.foo(), 2)
|
|
|
|
vereq(d2.boo(), 2)
|
|
|
|
vereq(d2.goo(), 1)
|
2001-08-17 10:40:47 -03:00
|
|
|
class E(object):
|
|
|
|
foo = C.foo
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(E().foo, C.foo) # i.e., unbound
|
2001-08-17 10:58:31 -03:00
|
|
|
verify(repr(C.foo.__get__(C(1))).startswith("<bound method "))
|
2001-08-15 14:51:17 -03:00
|
|
|
|
2001-08-15 20:57:59 -03:00
|
|
|
def specials():
|
|
|
|
# Test operators like __hash__ for which a built-in default exists
|
2001-08-17 18:27:53 -03:00
|
|
|
if verbose: print "Testing special operators..."
|
2001-08-15 20:57:59 -03:00
|
|
|
# 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)
|
2006-04-21 07:40:58 -03:00
|
|
|
verify(id(c1) != id(c2))
|
|
|
|
hash(c1)
|
|
|
|
hash(c2)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(cmp(c1, c2), cmp(id(c1), id(c2)))
|
|
|
|
vereq(c1, c1)
|
2001-08-15 20:57:59 -03:00
|
|
|
verify(c1 != c2)
|
|
|
|
verify(not c1 != c1)
|
|
|
|
verify(not c1 == c2)
|
2001-08-16 16:50:51 -03:00
|
|
|
# Note that the module name appears in str/repr, and that varies
|
|
|
|
# depending on whether this test is run standalone or from a framework.
|
2001-09-24 13:03:59 -03:00
|
|
|
verify(str(c1).find('C object at ') >= 0)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(str(c1), repr(c1))
|
2001-08-15 20:57:59 -03:00
|
|
|
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)
|
2006-04-21 07:40:58 -03:00
|
|
|
verify(id(d1) != id(d2))
|
|
|
|
hash(d1)
|
|
|
|
hash(d2)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(cmp(d1, d2), cmp(id(d1), id(d2)))
|
|
|
|
vereq(d1, d1)
|
2001-08-15 20:57:59 -03:00
|
|
|
verify(d1 != d2)
|
|
|
|
verify(not d1 != d1)
|
|
|
|
verify(not d1 == d2)
|
2001-08-16 16:50:51 -03:00
|
|
|
# Note that the module name appears in str/repr, and that varies
|
|
|
|
# depending on whether this test is run standalone or from a framework.
|
2001-09-24 13:03:59 -03:00
|
|
|
verify(str(d1).find('D object at ') >= 0)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(str(d1), repr(d1))
|
2001-08-15 20:57:59 -03:00
|
|
|
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 __nonzero__(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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(p0), hash(0))
|
|
|
|
vereq(p0, p0)
|
2001-08-15 20:57:59 -03:00
|
|
|
verify(p0 != p1)
|
|
|
|
verify(not p0 != p0)
|
2001-10-08 13:35:45 -03:00
|
|
|
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)")
|
2001-08-15 20:57:59 -03:00
|
|
|
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 __nonzero__(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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(p0), hash(0))
|
|
|
|
vereq(p0, p0)
|
2001-08-15 20:57:59 -03:00
|
|
|
verify(p0 != p1)
|
|
|
|
verify(not p0 != p0)
|
2001-10-08 13:35:45 -03:00
|
|
|
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)")
|
2001-08-15 20:57:59 -03:00
|
|
|
p10 = DProxy(range(10))
|
|
|
|
verify(-1 not in p10)
|
|
|
|
for i in range(10):
|
|
|
|
verify(i in p10)
|
|
|
|
verify(10 not in p10)
|
2001-09-18 17:04:26 -03:00
|
|
|
# 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)
|
2001-08-15 20:57:59 -03:00
|
|
|
|
2003-01-13 16:13:12 -04:00
|
|
|
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'
|
2003-02-18 22:35:07 -04:00
|
|
|
return self
|
2003-01-13 16:13:12 -04:00
|
|
|
|
|
|
|
# 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
|
|
|
|
|
2001-08-17 18:27:53 -03:00
|
|
|
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:
|
2001-10-22 18:45:25 -03:00
|
|
|
verify(str(msg).find("weak reference") >= 0)
|
2001-08-17 18:27:53 -03:00
|
|
|
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
|
|
|
|
|
2001-09-06 18:56:42 -03:00
|
|
|
def properties():
|
|
|
|
if verbose: print "Testing property..."
|
2001-08-24 12:24:24 -03:00
|
|
|
class C(object):
|
|
|
|
def getx(self):
|
|
|
|
return self.__x
|
|
|
|
def setx(self, value):
|
|
|
|
self.__x = value
|
|
|
|
def delx(self):
|
|
|
|
del self.__x
|
2001-09-24 18:17:50 -03:00
|
|
|
x = property(getx, setx, delx, doc="I'm the x property.")
|
2001-08-24 12:24:24 -03:00
|
|
|
a = C()
|
|
|
|
verify(not hasattr(a, "x"))
|
|
|
|
a.x = 42
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a._C__x, 42)
|
|
|
|
vereq(a.x, 42)
|
2001-08-24 12:24:24 -03:00
|
|
|
del a.x
|
|
|
|
verify(not hasattr(a, "x"))
|
|
|
|
verify(not hasattr(a, "_C__x"))
|
|
|
|
C.x.__set__(a, 100)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C.x.__get__(a), 100)
|
2002-08-01 11:39:25 -03:00
|
|
|
C.x.__delete__(a)
|
|
|
|
verify(not hasattr(a, "x"))
|
2001-08-24 12:24:24 -03:00
|
|
|
|
2001-09-24 18:17:50 -03:00
|
|
|
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)
|
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(raw.__doc__, "I'm the x property.")
|
2001-09-24 18:17:50 -03:00
|
|
|
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)
|
|
|
|
|
2002-10-18 13:33:13 -03:00
|
|
|
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"
|
|
|
|
|
2006-03-08 14:09:27 -04:00
|
|
|
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)
|
|
|
|
|
2001-08-24 13:55:27 -03:00
|
|
|
def supers():
|
2001-08-24 14:07:20 -03:00
|
|
|
if verbose: print "Testing super..."
|
2001-08-24 13:55:27 -03:00
|
|
|
|
|
|
|
class A(object):
|
|
|
|
def meth(self, a):
|
|
|
|
return "A(%r)" % a
|
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(A().meth(1), "A(1)")
|
2001-08-24 13:55:27 -03:00
|
|
|
|
|
|
|
class B(A):
|
|
|
|
def __init__(self):
|
|
|
|
self.__super = super(B, self)
|
|
|
|
def meth(self, a):
|
|
|
|
return "B(%r)" % a + self.__super.meth(a)
|
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(B().meth(2), "B(2)A(2)")
|
2001-08-24 13:55:27 -03:00
|
|
|
|
|
|
|
class C(A):
|
|
|
|
def meth(self, a):
|
|
|
|
return "C(%r)" % a + self.__super.meth(a)
|
|
|
|
C._C__super = super(C)
|
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(C().meth(3), "C(3)A(3)")
|
2001-08-24 13:55:27 -03:00
|
|
|
|
|
|
|
class D(C, B):
|
|
|
|
def meth(self, a):
|
|
|
|
return "D(%r)" % a + super(D, self).meth(a)
|
|
|
|
|
2001-12-03 11:38:28 -04:00
|
|
|
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):
|
2003-04-16 17:02:22 -03:00
|
|
|
s = self.__super # == mysuper(F, self)
|
2001-12-03 11:38:28 -04:00
|
|
|
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())"
|
2001-08-24 13:55:27 -03:00
|
|
|
|
2003-04-16 17:02:22 -03:00
|
|
|
# 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)
|
|
|
|
|
2004-03-24 22:19:34 -04:00
|
|
|
# Ensure that super() lookup of descriptor from classmethod
|
|
|
|
# works (SF ID# 743627)
|
|
|
|
|
|
|
|
class Base(object):
|
|
|
|
aProp = property(lambda self: "foo")
|
|
|
|
|
|
|
|
class Sub(Base):
|
2005-01-15 20:25:31 -04:00
|
|
|
@classmethod
|
2004-03-24 22:19:34 -04:00
|
|
|
def test(klass):
|
|
|
|
return super(Sub,klass).aProp
|
|
|
|
|
|
|
|
veris(Sub.test(), Base.aProp)
|
|
|
|
|
|
|
|
|
2001-08-30 17:06:08 -03:00
|
|
|
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.)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(repr(hexint(7) + 9), "0x10")
|
|
|
|
vereq(repr(hexint(1000) + 7), "0x3ef")
|
2001-09-10 17:52:51 -03:00
|
|
|
a = hexint(12345)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, 12345)
|
|
|
|
vereq(int(a), 12345)
|
2001-09-10 17:52:51 -03:00
|
|
|
verify(int(a).__class__ is int)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(a), hash(12345))
|
2001-09-11 18:44:14 -03:00
|
|
|
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)
|
2001-08-30 17:06:08 -03:00
|
|
|
|
|
|
|
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__
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(str(octlong(3) + 5), "010")
|
2001-08-30 17:06:08 -03:00
|
|
|
# (Note that overriding __radd__ here only seems to work
|
|
|
|
# because the example uses a short int left argument.)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(str(5 + octlong(3000)), "05675")
|
2001-09-10 17:52:51 -03:00
|
|
|
a = octlong(12345)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, 12345L)
|
|
|
|
vereq(long(a), 12345L)
|
|
|
|
vereq(hash(a), hash(12345L))
|
2001-09-10 17:52:51 -03:00
|
|
|
verify(long(a).__class__ is long)
|
2001-09-11 19:31:33 -03:00
|
|
|
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)
|
2001-08-30 17:06:08 -03:00
|
|
|
|
2002-03-01 18:24:49 -04:00
|
|
|
# Check that negative clones don't segfault
|
|
|
|
a = longclone(-1)
|
|
|
|
vereq(a.__dict__, {})
|
2002-03-02 00:18:04 -04:00
|
|
|
vereq(long(a), -1) # verify PyNumber_Long() copies the sign bit
|
2002-03-01 18:24:49 -04:00
|
|
|
|
2001-08-30 17:06:08 -03:00
|
|
|
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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(repr(precfloat(1.1)), "1.1")
|
2001-09-10 17:52:51 -03:00
|
|
|
a = precfloat(12345)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, 12345.0)
|
|
|
|
vereq(float(a), 12345.0)
|
2001-09-10 18:28:20 -03:00
|
|
|
verify(float(a).__class__ is float)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(a), hash(12345.0))
|
2001-09-11 18:53:35 -03:00
|
|
|
verify((+a).__class__ is float)
|
2001-08-30 17:06:08 -03:00
|
|
|
|
2001-09-12 16:12:49 -03:00
|
|
|
class madcomplex(complex):
|
|
|
|
def __repr__(self):
|
|
|
|
return "%.17gj%+.17g" % (self.imag, self.real)
|
|
|
|
a = madcomplex(-3, 4)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(repr(a), "4j-3")
|
2001-09-12 16:12:49 -03:00
|
|
|
base = complex(-3, 4)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris(base.__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a, base)
|
|
|
|
vereq(complex(a), base)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris(complex(a).__class__, complex)
|
2001-09-12 16:12:49 -03:00
|
|
|
a = madcomplex(a) # just trying another form of the constructor
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(repr(a), "4j-3")
|
|
|
|
vereq(a, base)
|
|
|
|
vereq(complex(a), base)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris(complex(a).__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(a), hash(base))
|
2001-10-11 15:33:53 -03:00
|
|
|
veris((+a).__class__, complex)
|
|
|
|
veris((a + 0).__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a + 0, base)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris((a - 0).__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a - 0, base)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris((a * 1).__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a * 1, base)
|
2001-10-11 15:33:53 -03:00
|
|
|
veris((a / 1).__class__, complex)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(a / 1, base)
|
2001-09-12 16:12:49 -03:00
|
|
|
|
2001-08-30 17:06:08 -03:00
|
|
|
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))
|
2001-10-08 13:35:45 -03:00
|
|
|
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)))
|
2001-08-30 17:06:08 -03:00
|
|
|
for i in range(512):
|
|
|
|
t = madtuple(range(i))
|
|
|
|
u = t.rev()
|
|
|
|
v = u.rev()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(v, t)
|
2001-09-10 17:52:51 -03:00
|
|
|
a = madtuple((1,2,3,4,5))
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(tuple(a), (1,2,3,4,5))
|
2001-09-10 20:37:46 -03:00
|
|
|
verify(tuple(a).__class__ is tuple)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(a), hash((1,2,3,4,5)))
|
2001-09-11 16:48:03 -03:00
|
|
|
verify(a[:].__class__ is tuple)
|
|
|
|
verify((a * 1).__class__ is tuple)
|
|
|
|
verify((a * 0).__class__ is tuple)
|
|
|
|
verify((a + ()).__class__ is tuple)
|
2001-09-10 17:52:51 -03:00
|
|
|
a = madtuple(())
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(tuple(a), ())
|
2001-09-11 11:02:22 -03:00
|
|
|
verify(tuple(a).__class__ is tuple)
|
2001-09-11 16:48:03 -03:00
|
|
|
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)
|
2001-08-30 17:06:08 -03:00
|
|
|
|
|
|
|
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")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s, "abcdefghijklmnopqrstuvwxyz")
|
|
|
|
vereq(s.rev(), madstring("zyxwvutsrqponmlkjihgfedcba"))
|
|
|
|
vereq(s.rev().rev(), madstring("abcdefghijklmnopqrstuvwxyz"))
|
2001-08-30 17:06:08 -03:00
|
|
|
for i in range(256):
|
|
|
|
s = madstring("".join(map(chr, range(i))))
|
|
|
|
t = s.rev()
|
|
|
|
u = t.rev()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u, s)
|
2001-09-10 17:52:51 -03:00
|
|
|
s = madstring("12345")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(str(s), "12345")
|
2001-09-10 22:41:59 -03:00
|
|
|
verify(str(s).__class__ is str)
|
2001-08-30 17:06:08 -03:00
|
|
|
|
2001-09-11 23:18:30 -03:00
|
|
|
base = "\x00" * 5
|
|
|
|
s = madstring(base)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s, base)
|
|
|
|
vereq(str(s), base)
|
2001-09-10 22:52:02 -03:00
|
|
|
verify(str(s).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(s), hash(base))
|
|
|
|
vereq({s: 1}[base], 1)
|
|
|
|
vereq({base: 1}[s], 1)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify((s + "").__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s + "", base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(("" + s).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq("" + s, base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify((s * 0).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s * 0, "")
|
2001-09-11 23:18:30 -03:00
|
|
|
verify((s * 1).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s * 1, base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify((s * 2).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s * 2, base + base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s[:].__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s[:], base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s[0:0].__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s[0:0], "")
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.strip().__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.strip(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(s.lstrip().__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.lstrip(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(s.rstrip().__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.rstrip(), base)
|
2001-09-11 23:18:30 -03:00
|
|
|
identitytab = ''.join([chr(i) for i in range(256)])
|
|
|
|
verify(s.translate(identitytab).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.translate(identitytab), base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.translate(identitytab, "x").__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.translate(identitytab, "x"), base)
|
|
|
|
vereq(s.translate(identitytab, "\x00"), "")
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.replace("x", "x").__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.replace("x", "x"), base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.ljust(len(s)).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.ljust(len(s)), base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.rjust(len(s)).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.rjust(len(s)), base)
|
2001-09-11 23:18:30 -03:00
|
|
|
verify(s.center(len(s)).__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.center(len(s)), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(s.lower().__class__ is str)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(s.lower(), base)
|
2001-09-10 22:52:02 -03:00
|
|
|
|
2001-08-30 17:52:40 -03:00
|
|
|
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")
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u, u"ABCDEF")
|
|
|
|
vereq(u.rev(), madunicode(u"FEDCBA"))
|
|
|
|
vereq(u.rev().rev(), madunicode(u"ABCDEF"))
|
2001-09-12 00:03:31 -03:00
|
|
|
base = u"12345"
|
|
|
|
u = madunicode(base)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(unicode(u), base)
|
2001-09-11 00:07:38 -03:00
|
|
|
verify(unicode(u).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(hash(u), hash(base))
|
|
|
|
vereq({u: 1}[base], 1)
|
|
|
|
vereq({base: 1}[u], 1)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.strip().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.strip(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.lstrip().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.lstrip(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.rstrip().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.rstrip(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.replace(u"x", u"x").__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.replace(u"x", u"x"), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.replace(u"xy", u"xy").__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.replace(u"xy", u"xy"), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.center(len(u)).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.center(len(u)), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.ljust(len(u)).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.ljust(len(u)), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.rjust(len(u)).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.rjust(len(u)), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.lower().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.lower(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.upper().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.upper(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.capitalize().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.capitalize(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u.title().__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u.title(), base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify((u + u"").__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u + u"", base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify((u"" + u).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u"" + u, base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify((u * 0).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u * 0, u"")
|
2001-09-12 00:03:31 -03:00
|
|
|
verify((u * 1).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u * 1, base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify((u * 2).__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u * 2, base + base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u[:].__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u[:], base)
|
2001-09-12 00:03:31 -03:00
|
|
|
verify(u[0:0].__class__ is unicode)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(u[0:0], u"")
|
2001-08-30 17:52:40 -03:00
|
|
|
|
2001-10-09 17:36:44 -03:00
|
|
|
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))
|
|
|
|
|
2001-09-13 02:38:56 -03:00
|
|
|
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
|
|
|
|
|
2001-09-13 16:36:36 -03:00
|
|
|
f = file(name=TESTFN, mode='w')
|
2001-09-13 02:38:56 -03:00
|
|
|
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()
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(expected, got)
|
|
|
|
vereq(f.lineno, i)
|
|
|
|
vereq(f.ateof, (i > len(lines)))
|
2001-09-13 02:38:56 -03:00
|
|
|
f.close()
|
|
|
|
finally:
|
|
|
|
try:
|
|
|
|
f.close()
|
|
|
|
except:
|
|
|
|
pass
|
|
|
|
try:
|
|
|
|
import os
|
|
|
|
os.unlink(TESTFN)
|
|
|
|
except:
|
|
|
|
pass
|
|
|
|
|
2001-09-13 16:33:07 -03:00
|
|
|
def keywords():
|
|
|
|
if verbose:
|
|
|
|
print "Testing keyword args to basic type constructors ..."
|
2001-10-08 13:35:45 -03:00
|
|
|
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))
|
2002-11-23 05:45:04 -04:00
|
|
|
# note: as of Python 2.3, dict() no longer has an "items" keyword arg
|
2001-09-13 16:33:07 -03:00
|
|
|
|
|
|
|
for constructor in (int, float, long, complex, str, unicode,
|
2002-11-23 05:45:04 -04:00
|
|
|
tuple, list, file):
|
2001-09-13 16:33:07 -03:00
|
|
|
try:
|
|
|
|
constructor(bogus_keyword_arg=1)
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed("expected TypeError from bogus keyword "
|
|
|
|
"argument to %r" % constructor)
|
2001-09-13 16:36:36 -03:00
|
|
|
|
2001-09-13 18:01:29 -03:00
|
|
|
def restricted():
|
2003-01-06 12:03:43 -04:00
|
|
|
# XXX This test is disabled because rexec is not deemed safe
|
|
|
|
return
|
2001-09-13 18:01:29 -03:00
|
|
|
import rexec
|
|
|
|
if verbose:
|
|
|
|
print "Testing interaction with restricted execution ..."
|
|
|
|
|
|
|
|
sandbox = rexec.RExec()
|
|
|
|
|
|
|
|
code1 = """f = open(%r, 'w')""" % TESTFN
|
|
|
|
code2 = """f = file(%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
|
|
|
|
|
2001-09-13 21:25:33 -03:00
|
|
|
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
|
|
|
|
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(cistr('ABC'), 'abc')
|
|
|
|
vereq('aBc', cistr('ABC'))
|
|
|
|
vereq(str(cistr('ABC')), 'ABC')
|
2001-09-13 21:25:33 -03:00
|
|
|
|
|
|
|
d = {cistr('one'): 1, cistr('two'): 2, cistr('tHree'): 3}
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d[cistr('one')], 1)
|
|
|
|
vereq(d[cistr('tWo')], 2)
|
|
|
|
vereq(d[cistr('THrEE')], 3)
|
2001-09-13 21:25:33 -03:00
|
|
|
verify(cistr('ONe') in d)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.get(cistr('thrEE')), 3)
|
2001-09-13 21:25:33 -03:00
|
|
|
|
2001-09-18 17:38:53 -03:00
|
|
|
def classic_comparisons():
|
|
|
|
if verbose: print "Testing classic comparisons..."
|
2001-09-18 18:06:04 -03:00
|
|
|
class classic:
|
|
|
|
pass
|
|
|
|
for base in (classic, int, object):
|
2001-09-18 17:38:53 -03:00
|
|
|
if verbose: print " (base = %s)" % base
|
|
|
|
class C(base):
|
|
|
|
def __init__(self, value):
|
|
|
|
self.value = int(value)
|
|
|
|
def __cmp__(self, other):
|
|
|
|
if isinstance(other, C):
|
|
|
|
return cmp(self.value, other.value)
|
|
|
|
if isinstance(other, int) or isinstance(other, long):
|
|
|
|
return cmp(self.value, other)
|
|
|
|
return NotImplemented
|
|
|
|
c1 = C(1)
|
|
|
|
c2 = C(2)
|
|
|
|
c3 = C(3)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c1, 1)
|
2001-09-18 17:38:53 -03:00
|
|
|
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))
|
|
|
|
|
2001-09-18 18:06:04 -03:00
|
|
|
def rich_comparisons():
|
|
|
|
if verbose:
|
|
|
|
print "Testing rich comparisons..."
|
2001-09-24 14:52:04 -03:00
|
|
|
class Z(complex):
|
2001-10-15 18:05:10 -03:00
|
|
|
pass
|
2001-09-24 14:52:04 -03:00
|
|
|
z = Z(1)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(z, 1+0j)
|
|
|
|
vereq(1+0j, z)
|
2001-09-24 14:52:04 -03:00
|
|
|
class ZZ(complex):
|
|
|
|
def __eq__(self, other):
|
|
|
|
try:
|
|
|
|
return abs(self - other) <= 1e-6
|
|
|
|
except:
|
|
|
|
return NotImplemented
|
|
|
|
zz = ZZ(1.0000003)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(zz, 1+0j)
|
|
|
|
vereq(1+0j, zz)
|
2001-09-24 18:17:50 -03:00
|
|
|
|
2001-09-18 18:06:04 -03:00
|
|
|
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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c1, 1)
|
2001-09-18 18:06:04 -03:00
|
|
|
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))
|
|
|
|
|
2001-09-18 22:25:16 -03:00
|
|
|
def coercions():
|
|
|
|
if verbose: print "Testing coercions..."
|
|
|
|
class I(int): pass
|
|
|
|
coerce(I(0), 0)
|
|
|
|
coerce(0, I(0))
|
|
|
|
class L(long): pass
|
|
|
|
coerce(L(0), 0)
|
|
|
|
coerce(L(0), 0L)
|
|
|
|
coerce(0, L(0))
|
|
|
|
coerce(0L, L(0))
|
|
|
|
class F(float): pass
|
|
|
|
coerce(F(0), 0)
|
|
|
|
coerce(F(0), 0L)
|
|
|
|
coerce(F(0), 0.)
|
|
|
|
coerce(0, F(0))
|
|
|
|
coerce(0L, F(0))
|
|
|
|
coerce(0., F(0))
|
2001-10-15 18:05:10 -03:00
|
|
|
class C(complex): pass
|
2001-09-18 22:25:16 -03:00
|
|
|
coerce(C(0), 0)
|
|
|
|
coerce(C(0), 0L)
|
|
|
|
coerce(C(0), 0.)
|
|
|
|
coerce(C(0), 0j)
|
|
|
|
coerce(0, C(0))
|
|
|
|
coerce(0L, C(0))
|
|
|
|
coerce(0., C(0))
|
|
|
|
coerce(0j, C(0))
|
|
|
|
|
2001-09-20 18:49:53 -03:00
|
|
|
def descrdoc():
|
|
|
|
if verbose: print "Testing descriptor doc strings..."
|
|
|
|
def check(descr, what):
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(descr.__doc__, what)
|
2002-04-03 18:41:51 -04:00
|
|
|
check(file.closed, "True if the file is closed") # getset descriptor
|
2001-09-20 18:49:53 -03:00
|
|
|
check(file.name, "file name") # member descriptor
|
|
|
|
|
2001-09-25 00:43:42 -03:00
|
|
|
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)
|
2002-04-14 22:03:30 -03:00
|
|
|
try:
|
|
|
|
delattr(x, "__class__")
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "shouldn't allow del %r.__class__" % x
|
2001-09-25 00:43:42 -03:00
|
|
|
cant(C(), list)
|
|
|
|
cant(list(), C)
|
|
|
|
cant(C(), 1)
|
|
|
|
cant(C(), object)
|
|
|
|
cant(object(), list)
|
|
|
|
cant(list(), object)
|
2002-08-10 02:42:07 -03:00
|
|
|
class Int(int): __slots__ = []
|
|
|
|
cant(2, Int)
|
|
|
|
cant(Int(), int)
|
|
|
|
cant(True, int)
|
|
|
|
cant(2, bool)
|
2002-12-24 11:26:42 -04:00
|
|
|
o = object()
|
|
|
|
cant(o, type(1))
|
|
|
|
cant(o, type(None))
|
|
|
|
del o
|
2001-09-25 00:43:42 -03:00
|
|
|
|
2001-10-26 01:26:12 -03:00
|
|
|
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
|
2005-04-20 16:41:36 -03:00
|
|
|
except (AttributeError, TypeError):
|
2001-10-26 01:26:12 -03:00
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "shouldn't allow %r.__dict__ = %r" % (x, dict)
|
|
|
|
cant(a, None)
|
|
|
|
cant(a, [])
|
|
|
|
cant(a, 1)
|
2001-12-05 15:46:42 -04:00
|
|
|
del a.__dict__ # Deleting __dict__ is allowed
|
2001-10-26 01:26:12 -03:00
|
|
|
# Classes don't allow __dict__ assignment
|
|
|
|
cant(C, {})
|
|
|
|
|
2001-09-25 13:25:58 -03:00
|
|
|
def pickles():
|
2001-09-28 15:13:29 -03:00
|
|
|
if verbose:
|
|
|
|
print "Testing pickling and copying new-style classes and objects..."
|
2001-09-25 13:25:58 -03:00
|
|
|
import pickle, cPickle
|
|
|
|
|
|
|
|
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)
|
2003-02-07 10:59:13 -04:00
|
|
|
def __getnewargs__(self):
|
|
|
|
return (self.a, self.b)
|
2001-09-25 13:25:58 -03:00
|
|
|
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)
|
2003-02-07 10:59:13 -04:00
|
|
|
def __getnewargs__(self):
|
|
|
|
return (self.a, self.b, int(self))
|
2001-09-25 13:25:58 -03:00
|
|
|
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))
|
|
|
|
|
2001-11-24 17:07:01 -04:00
|
|
|
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
|
|
|
|
|
2001-09-25 13:25:58 -03:00
|
|
|
for p in pickle, cPickle:
|
|
|
|
for bin in 0, 1:
|
2001-10-02 16:58:32 -03:00
|
|
|
if verbose:
|
|
|
|
print p.__name__, ["text", "binary"][bin]
|
2001-09-25 13:25:58 -03:00
|
|
|
|
|
|
|
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)
|
2001-11-24 17:07:01 -04:00
|
|
|
vereq(x.__class__, a.__class__)
|
|
|
|
vereq(sorteditems(x.__dict__), sorteditems(a.__dict__))
|
|
|
|
vereq(y.__class__, b.__class__)
|
|
|
|
vereq(sorteditems(y.__dict__), sorteditems(b.__dict__))
|
2004-02-12 13:35:32 -04:00
|
|
|
vereq(repr(x), repr(a))
|
|
|
|
vereq(repr(y), repr(b))
|
2001-09-25 13:25:58 -03:00
|
|
|
if verbose:
|
|
|
|
print "a = x =", a
|
|
|
|
print "b = y =", b
|
2001-11-24 17:07:01 -04:00
|
|
|
# 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)
|
2001-09-25 13:25:58 -03:00
|
|
|
|
2001-10-02 16:58:32 -03:00
|
|
|
# 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))
|
2001-11-24 17:07:01 -04:00
|
|
|
vereq(x.__class__, a.__class__)
|
|
|
|
vereq(sorteditems(x.__dict__), sorteditems(a.__dict__))
|
|
|
|
vereq(y.__class__, b.__class__)
|
|
|
|
vereq(sorteditems(y.__dict__), sorteditems(b.__dict__))
|
2004-02-12 13:35:32 -04:00
|
|
|
vereq(repr(x), repr(a))
|
|
|
|
vereq(repr(y), repr(b))
|
2001-10-02 16:58:32 -03:00
|
|
|
if verbose:
|
|
|
|
print "a = x =", a
|
|
|
|
print "b = y =", b
|
2001-09-28 15:13:29 -03:00
|
|
|
|
2002-03-14 19:05:54 -04:00
|
|
|
def pickleslots():
|
|
|
|
if verbose: print "Testing pickling of classes with __slots__ ..."
|
|
|
|
import pickle, 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
|
2003-02-10 17:31:27 -04:00
|
|
|
# Give C a nice generic __getstate__ and __setstate__
|
2002-03-14 19:05:54 -04:00
|
|
|
class C(base):
|
|
|
|
__slots__ = ['a']
|
|
|
|
def __getstate__(self):
|
|
|
|
try:
|
|
|
|
d = self.__dict__.copy()
|
|
|
|
except AttributeError:
|
|
|
|
d = {}
|
2003-02-10 17:31:27 -04:00
|
|
|
for cls in self.__class__.__mro__:
|
|
|
|
for sn in cls.__dict__.get('__slots__', ()):
|
|
|
|
try:
|
|
|
|
d[sn] = getattr(self, sn)
|
|
|
|
except AttributeError:
|
|
|
|
pass
|
2002-03-14 19:05:54 -04:00
|
|
|
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)
|
2003-02-10 17:31:27 -04:00
|
|
|
# A subclass that adds a slot should also work
|
2002-03-14 19:05:54 -04:00
|
|
|
class E(C):
|
|
|
|
__slots__ = ['b']
|
2003-02-10 17:31:27 -04:00
|
|
|
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)
|
2002-03-14 19:05:54 -04:00
|
|
|
|
2001-09-28 15:13:29 -03:00
|
|
|
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)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(b.__dict__, a.__dict__)
|
2001-09-28 15:13:29 -03:00
|
|
|
|
|
|
|
a.bar = [1,2,3]
|
|
|
|
c = copy.copy(a)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(c.bar, a.bar)
|
2001-09-28 15:13:29 -03:00
|
|
|
verify(c.bar is a.bar)
|
|
|
|
|
|
|
|
d = copy.deepcopy(a)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.__dict__, a.__dict__)
|
2001-09-28 15:13:29 -03:00
|
|
|
a.bar.append(4)
|
2001-10-08 13:35:45 -03:00
|
|
|
vereq(d.bar, [1,2,3])
|
2001-09-28 15:13:29 -03:00
|
|
|
|
2001-09-28 20:49:48 -03:00
|
|
|
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)))
|
2001-10-04 02:27:00 -03:00
|
|
|
|
2004-02-12 13:35:32 -04:00
|
|
|
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)")
|
2001-09-28 20:49:48 -03:00
|
|
|
class S(str):
|
|
|
|
def __eq__(self, other):
|
|
|
|
return self.lower() == other.lower()
|
|
|
|
|
2001-10-11 15:33:53 -03:00
|
|
|
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()
|
2006-04-21 07:40:58 -03:00
|
|
|
orig_hash = hash(d) # related to id(d) in platform-dependent ways
|
2001-10-11 15:33:53 -03:00
|
|
|
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__
|
2006-04-21 07:40:58 -03:00
|
|
|
vereq(hash(d), orig_hash)
|
2001-10-11 15:33:53 -03:00
|
|
|
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"
|
2001-10-11 23:38:24 -03:00
|
|
|
|
2002-06-13 23:35:45 -03:00
|
|
|
# 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
|
|
|
|
|
2001-10-11 23:38:24 -03:00
|
|
|
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
|
2001-09-13 21:25:33 -03:00
|
|
|
|
2001-10-16 17:18:24 -03:00
|
|
|
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()
|
|
|
|
|
2001-10-21 21:43:43 -03:00
|
|
|
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])
|
Generalize dictionary() to accept a sequence of 2-sequences. At the
outer level, the iterator protocol is used for memory-efficiency (the
outer sequence may be very large if fully materialized); at the inner
level, PySequence_Fast() is used for time-efficiency (these should
always be sequences of length 2).
dictobject.c, new functions PyDict_{Merge,Update}FromSeq2. These are
wholly analogous to PyDict_{Merge,Update}, but process a sequence-of-2-
sequences argument instead of a mapping object. For now, I left these
functions file static, so no corresponding doc changes. It's tempting
to change dict.update() to allow a sequence-of-2-seqs argument too.
Also changed the name of dictionary's keyword argument from "mapping"
to "x". Got a better name? "mapping_or_sequence_of_pairs" isn't
attractive, although more so than "mosop" <wink>.
abstract.h, abstract.tex: Added new PySequence_Fast_GET_SIZE function,
much faster than going thru the all-purpose PySequence_Size.
libfuncs.tex:
- Document dictionary().
- Fiddle tuple() and list() to admit that their argument is optional.
- The long-winded repetitions of "a sequence, a container that supports
iteration, or an iterator object" is getting to be a PITA. Many
months ago I suggested factoring this out into "iterable object",
where the definition of that could include being explicit about
generators too (as is, I'm not sure a reader outside of PythonLabs
could guess that "an iterator object" includes a generator call).
- Please check my curly braces -- I'm going blind <0.9 wink>.
abstract.c, PySequence_Tuple(): When PyObject_GetIter() fails, leave
its error msg alone now (the msg it produces has improved since
PySequence_Tuple was generalized to accept iterable objects, and
PySequence_Tuple was also stomping on the msg in cases it shouldn't
have even before PyObject_GetIter grew a better msg).
2001-10-26 02:06:50 -03:00
|
|
|
vereq(a, [0, 1, 2])
|
2001-10-21 21:43:43 -03:00
|
|
|
|
2001-10-29 22:33:02 -04:00
|
|
|
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])
|
|
|
|
|
2001-12-11 00:37:34 -04:00
|
|
|
class D(object): pass
|
|
|
|
d = D()
|
|
|
|
try: del d[0]
|
|
|
|
except TypeError: pass
|
|
|
|
else: raise TestFailed, "invalid del() didn't raise TypeError"
|
|
|
|
|
2001-12-03 12:32:18 -04:00
|
|
|
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"
|
|
|
|
|
2001-12-11 00:37:34 -04:00
|
|
|
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')
|
|
|
|
|
2001-12-28 17:39:03 -04:00
|
|
|
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
|
2001-12-11 00:37:34 -04:00
|
|
|
|
2002-03-12 16:43:31 -04:00
|
|
|
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})
|
2001-12-11 00:37:34 -04:00
|
|
|
|
2002-03-25 14:36:32 -04:00
|
|
|
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'])
|
|
|
|
|
2002-04-05 21:05:01 -04:00
|
|
|
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)
|
|
|
|
|
2002-04-16 13:44:51 -03:00
|
|
|
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"))
|
|
|
|
|
2002-04-17 21:27:33 -03:00
|
|
|
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')
|
|
|
|
|
2002-06-06 14:53:03 -03:00
|
|
|
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)
|
|
|
|
|
2002-06-13 16:17:46 -03:00
|
|
|
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])
|
|
|
|
|
2002-07-11 03:56:07 -03:00
|
|
|
def subtype_resurrection():
|
|
|
|
if verbose:
|
2002-07-11 04:09:42 -03:00
|
|
|
print "Testing resurrection of new-style instance..."
|
2002-07-11 03:56:07 -03:00
|
|
|
|
|
|
|
class C(object):
|
|
|
|
container = []
|
|
|
|
|
|
|
|
def __del__(self):
|
|
|
|
# resurrect the instance
|
|
|
|
C.container.append(self)
|
|
|
|
|
|
|
|
c = C()
|
|
|
|
c.attr = 42
|
2002-07-11 15:26:21 -03:00
|
|
|
# The most interesting thing here is whether this blows up, due to flawed
|
2002-07-11 04:09:42 -03:00
|
|
|
# GC tracking logic in typeobject.c's call_finalizer() (a 2.2.1 bug).
|
2002-07-11 03:56:07 -03:00
|
|
|
del c
|
2002-07-11 15:26:21 -03:00
|
|
|
|
|
|
|
# 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)
|
2002-07-11 03:56:07 -03:00
|
|
|
vereq(C.container[-1].attr, 42)
|
2002-06-13 16:17:46 -03:00
|
|
|
|
2002-07-11 15:26:21 -03:00
|
|
|
# Make c mortal again, so that the test framework with -l doesn't report
|
|
|
|
# it as a leak.
|
|
|
|
del C.__del__
|
|
|
|
|
2002-08-06 18:28:28 -03:00
|
|
|
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
|
|
|
|
|
2002-08-13 14:16:49 -03:00
|
|
|
def slotmultipleinheritance():
|
|
|
|
# SF bug 575229, multiple inheritance w/ slots dumps core
|
|
|
|
class A(object):
|
|
|
|
__slots__=()
|
|
|
|
class B(object):
|
|
|
|
pass
|
|
|
|
class C(A,B) :
|
|
|
|
__slots__=()
|
2002-08-13 15:26:26 -03:00
|
|
|
vereq(C.__basicsize__, B.__basicsize__)
|
|
|
|
verify(hasattr(C, '__dict__'))
|
|
|
|
verify(hasattr(C, '__weakref__'))
|
|
|
|
C().x = 2
|
2002-08-13 14:16:49 -03:00
|
|
|
|
2002-08-09 13:11:37 -03:00
|
|
|
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")
|
|
|
|
|
2002-10-14 22:01:53 -03:00
|
|
|
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
|
|
|
|
|
2002-05-24 18:40:08 -03:00
|
|
|
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
|
|
|
|
|
2002-06-18 13:49:45 -03:00
|
|
|
if verbose:
|
|
|
|
print "Testing SF bug 570483..."
|
|
|
|
# Another segfault only when run early
|
|
|
|
# (before PyType_Ready(tuple) is called)
|
|
|
|
type.mro(tuple)
|
|
|
|
|
2002-11-27 11:20:19 -04:00
|
|
|
def test_mutable_bases():
|
2003-01-06 17:26:44 -04:00
|
|
|
if verbose:
|
|
|
|
print "Testing mutable bases..."
|
2002-11-26 10:47:27 -04:00
|
|
|
# stuff that should work:
|
|
|
|
class C(object):
|
|
|
|
pass
|
|
|
|
class C2(object):
|
|
|
|
def __getattribute__(self, attr):
|
|
|
|
if attr == 'a':
|
|
|
|
return 2
|
|
|
|
else:
|
2002-12-24 14:31:27 -04:00
|
|
|
return super(C2, self).__getattribute__(attr)
|
2002-11-26 10:47:27 -04:00
|
|
|
def meth(self):
|
|
|
|
return 1
|
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
class E(D):
|
|
|
|
pass
|
|
|
|
d = D()
|
|
|
|
e = E()
|
2002-11-27 06:24:44 -04:00
|
|
|
D.__bases__ = (C,)
|
2002-11-26 10:47:27 -04:00
|
|
|
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:
|
|
|
|
del D.__bases__
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "shouldn't be able to delete .__bases__"
|
|
|
|
|
2002-12-13 13:49:38 -04:00
|
|
|
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 ()"
|
|
|
|
|
2002-11-26 10:47:27 -04:00
|
|
|
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"
|
|
|
|
|
2003-08-07 11:58:10 -03:00
|
|
|
try:
|
|
|
|
D.__bases__ = (C, C)
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "didn't detect repeated base classes"
|
|
|
|
|
2002-11-27 06:24:44 -04:00
|
|
|
try:
|
|
|
|
D.__bases__ = (E,)
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
|
|
|
raise TestFailed, "shouldn't be able to create inheritance cycles"
|
|
|
|
|
2002-11-27 11:20:19 -04:00
|
|
|
def test_mutable_bases_with_failing_mro():
|
2003-01-06 17:26:44 -04:00
|
|
|
if verbose:
|
|
|
|
print "Testing mutable bases with failing mro..."
|
2002-11-27 11:20:19 -04:00
|
|
|
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.
|
2002-12-24 14:31:27 -04:00
|
|
|
|
2002-11-27 11:20:19 -04:00
|
|
|
E_mro_before = E.__mro__
|
2002-11-27 11:40:09 -04:00
|
|
|
D_mro_before = D.__mro__
|
2002-11-27 11:20:19 -04:00
|
|
|
|
|
|
|
try:
|
|
|
|
D.__bases__ = (C2,)
|
|
|
|
except RuntimeError:
|
|
|
|
vereq(E.__mro__, E_mro_before)
|
2002-11-27 11:40:09 -04:00
|
|
|
vereq(D.__mro__, D_mro_before)
|
2002-11-27 11:20:19 -04:00
|
|
|
else:
|
|
|
|
raise TestFailed, "exception not propagated"
|
|
|
|
|
|
|
|
def test_mutable_bases_catch_mro_conflict():
|
2003-01-06 17:26:44 -04:00
|
|
|
if verbose:
|
|
|
|
print "Testing mutable bases catch mro conflict..."
|
2002-11-27 11:20:19 -04:00
|
|
|
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"
|
2002-12-24 14:31:27 -04:00
|
|
|
|
2002-11-26 10:47:27 -04:00
|
|
|
def mutable_names():
|
2003-01-06 17:26:44 -04:00
|
|
|
if verbose:
|
|
|
|
print "Testing mutable names..."
|
2002-11-26 10:47:27 -04:00
|
|
|
class C(object):
|
|
|
|
pass
|
|
|
|
|
2002-11-27 12:29:26 -04:00
|
|
|
# C.__module__ could be 'test_descr' or '__main__'
|
|
|
|
mod = C.__module__
|
2002-12-24 14:31:27 -04:00
|
|
|
|
2002-11-27 12:29:26 -04:00
|
|
|
C.__name__ = 'D'
|
|
|
|
vereq((C.__module__, C.__name__), (mod, 'D'))
|
|
|
|
|
|
|
|
C.__name__ = 'D.E'
|
|
|
|
vereq((C.__module__, C.__name__), (mod, 'D.E'))
|
2002-12-24 14:31:27 -04:00
|
|
|
|
2003-01-06 19:00:59 -04:00
|
|
|
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):
|
2003-02-27 16:04:19 -04:00
|
|
|
def __floordiv__(self, other):
|
|
|
|
return "B.__floordiv__"
|
|
|
|
def __rfloordiv__(self, other):
|
|
|
|
return "B.__rfloordiv__"
|
2003-01-06 19:00:59 -04:00
|
|
|
|
2003-02-27 16:04:19 -04:00
|
|
|
vereq(B(1) // 1, "B.__floordiv__")
|
|
|
|
vereq(1 // B(1), "B.__rfloordiv__")
|
2003-01-06 19:00:59 -04:00
|
|
|
|
|
|
|
# Case 2: subclass of object; this is just the baseline for case 3
|
|
|
|
|
|
|
|
class C(object):
|
2003-02-27 16:04:19 -04:00
|
|
|
def __floordiv__(self, other):
|
|
|
|
return "C.__floordiv__"
|
|
|
|
def __rfloordiv__(self, other):
|
|
|
|
return "C.__rfloordiv__"
|
2003-01-06 19:00:59 -04:00
|
|
|
|
2003-02-27 16:04:19 -04:00
|
|
|
vereq(C() // 1, "C.__floordiv__")
|
|
|
|
vereq(1 // C(), "C.__rfloordiv__")
|
2003-01-06 19:00:59 -04:00
|
|
|
|
|
|
|
# Case 3: subclass of new-style class; here it gets interesting
|
|
|
|
|
|
|
|
class D(C):
|
2003-02-27 16:04:19 -04:00
|
|
|
def __floordiv__(self, other):
|
|
|
|
return "D.__floordiv__"
|
|
|
|
def __rfloordiv__(self, other):
|
|
|
|
return "D.__rfloordiv__"
|
2003-01-06 19:00:59 -04:00
|
|
|
|
2003-02-27 16:04:19 -04:00
|
|
|
vereq(D() // C(), "D.__floordiv__")
|
|
|
|
vereq(C() // D(), "D.__rfloordiv__")
|
2003-01-06 19:00:59 -04:00
|
|
|
|
|
|
|
# Case 4: this didn't work right in 2.2.2 and 2.3a1
|
|
|
|
|
|
|
|
class E(C):
|
|
|
|
pass
|
|
|
|
|
2003-02-27 16:04:19 -04:00
|
|
|
vereq(E.__rfloordiv__, C.__rfloordiv__)
|
2003-01-06 19:00:59 -04:00
|
|
|
|
2003-02-27 16:04:19 -04:00
|
|
|
vereq(E() // 1, "C.__floordiv__")
|
|
|
|
vereq(1 // E(), "C.__rfloordiv__")
|
|
|
|
vereq(E() // C(), "C.__floordiv__")
|
|
|
|
vereq(C() // E(), "C.__floordiv__") # This one would fail
|
2003-01-06 19:00:59 -04:00
|
|
|
|
2003-01-07 09:41:37 -04:00
|
|
|
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__))
|
|
|
|
|
2003-02-11 14:44:42 -04:00
|
|
|
def meth_class_get():
|
|
|
|
# Full coverage of descrobject.c::classmethod_get()
|
2003-02-11 23:32:58 -04:00
|
|
|
if verbose:
|
|
|
|
print "Testing __get__ method of METH_CLASS C methods..."
|
2003-02-11 14:44:42 -04:00
|
|
|
# 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)"
|
|
|
|
|
2003-02-11 23:32:58 -04:00
|
|
|
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
|
2003-02-11 23:58:38 -04:00
|
|
|
# Test with a classic subclass
|
|
|
|
class D(C):
|
|
|
|
pass
|
|
|
|
a = D()
|
|
|
|
pa = Proxy(a)
|
|
|
|
verify(isinstance(a, C)) # Baseline
|
|
|
|
verify(isinstance(pa, C)) # Test
|
2003-02-11 23:32:58 -04:00
|
|
|
# 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
|
2003-02-11 23:58:38 -04:00
|
|
|
# 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")
|
2003-02-11 23:32:58 -04:00
|
|
|
|
2003-04-15 17:05:10 -03:00
|
|
|
def carloverre():
|
2003-04-14 18:46:03 -03:00
|
|
|
if verbose:
|
2003-04-15 17:05:10 -03:00
|
|
|
print "Testing prohibition of Carlo Verre's hack..."
|
2003-04-14 18:46:03 -03:00
|
|
|
try:
|
|
|
|
object.__setattr__(str, "foo", 42)
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2003-04-15 17:05:10 -03:00
|
|
|
raise TestFailed, "Carlo Verre __setattr__ suceeded!"
|
2003-04-14 18:46:03 -03:00
|
|
|
try:
|
|
|
|
object.__delattr__(str, "lower")
|
|
|
|
except TypeError:
|
|
|
|
pass
|
|
|
|
else:
|
2003-04-15 17:05:10 -03:00
|
|
|
raise TestFailed, "Carlo Verre __delattr__ succeeded!"
|
2003-04-14 18:46:03 -03:00
|
|
|
|
2003-05-29 11:26:57 -03:00
|
|
|
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
|
|
|
|
|
2003-06-29 12:44:07 -03:00
|
|
|
# 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
|
2002-11-26 10:47:27 -04:00
|
|
|
|
2003-08-15 10:07:47 -03:00
|
|
|
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)
|
2004-01-18 16:29:55 -04:00
|
|
|
|
2005-03-03 12:45:19 -04:00
|
|
|
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"
|
|
|
|
|
2005-11-07 04:38:00 -04:00
|
|
|
def methodwrapper():
|
|
|
|
# <type 'method-wrapper'> did not support any reflection before 2.5
|
|
|
|
if verbose:
|
|
|
|
print "Testing method-wrapper objects..."
|
|
|
|
|
|
|
|
l = []
|
|
|
|
vereq(l.__add__, l.__add__)
|
Merge the rest of the trunk.
Merged revisions 46490-46494,46496,46498,46500,46506,46521,46538,46558,46563-46567,46570-46571,46583,46593,46595-46598,46604,46606,46609-46753 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r46610 | martin.v.loewis | 2006-06-03 09:42:26 +0200 (Sat, 03 Jun 2006) | 2 lines
Updated version (win32-icons2.zip) from #1490384.
........
r46612 | andrew.kuchling | 2006-06-03 20:09:41 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1472084] Fix description of do_tag
........
r46614 | andrew.kuchling | 2006-06-03 20:33:35 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1475554] Strengthen text to say 'must' instead of 'should'
........
r46616 | andrew.kuchling | 2006-06-03 20:41:28 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1441864] Clarify description of 'data' argument
........
r46617 | andrew.kuchling | 2006-06-03 20:43:24 +0200 (Sat, 03 Jun 2006) | 1 line
Minor rewording
........
r46619 | andrew.kuchling | 2006-06-03 21:02:35 +0200 (Sat, 03 Jun 2006) | 9 lines
[Bug #1497414] _self is a reserved word in the WATCOM 10.6 C compiler.
Fix by renaming the variable.
In a different module, Neal fixed it by renaming _self to self. There's
already a variable named 'self' here, so I used selfptr.
(I'm committing this on a Mac without Tk, but it's a simple search-and-replace.
<crosses fingers>, so I'll watch the buildbots and see what happens.)
........
r46621 | fredrik.lundh | 2006-06-03 23:56:05 +0200 (Sat, 03 Jun 2006) | 5 lines
"_self" is a said to be a reserved word in Watcom C 10.6. I'm
not sure that's really standard compliant behaviour, but I guess
we have to fix that anyway...
........
r46622 | andrew.kuchling | 2006-06-04 00:44:42 +0200 (Sun, 04 Jun 2006) | 1 line
Update readme
........
r46623 | andrew.kuchling | 2006-06-04 00:59:23 +0200 (Sun, 04 Jun 2006) | 1 line
Drop 0 parameter
........
r46624 | andrew.kuchling | 2006-06-04 00:59:59 +0200 (Sun, 04 Jun 2006) | 1 line
Some code tidying; use curses.wrapper
........
r46625 | andrew.kuchling | 2006-06-04 01:02:15 +0200 (Sun, 04 Jun 2006) | 1 line
Use True; value returned from main is unused
........
r46626 | andrew.kuchling | 2006-06-04 01:07:21 +0200 (Sun, 04 Jun 2006) | 1 line
Use true division, and the True value
........
r46627 | andrew.kuchling | 2006-06-04 01:09:58 +0200 (Sun, 04 Jun 2006) | 1 line
Docstring fix; use True
........
r46628 | andrew.kuchling | 2006-06-04 01:15:56 +0200 (Sun, 04 Jun 2006) | 1 line
Put code in a main() function; loosen up the spacing to match current code style
........
r46629 | andrew.kuchling | 2006-06-04 01:39:07 +0200 (Sun, 04 Jun 2006) | 1 line
Use functions; modernize code
........
r46630 | andrew.kuchling | 2006-06-04 01:43:22 +0200 (Sun, 04 Jun 2006) | 1 line
This demo requires Medusa (not just asyncore); remove it
........
r46631 | andrew.kuchling | 2006-06-04 01:46:36 +0200 (Sun, 04 Jun 2006) | 2 lines
Remove xmlrpc demo -- it duplicates the SimpleXMLRPCServer module.
........
r46632 | andrew.kuchling | 2006-06-04 01:47:22 +0200 (Sun, 04 Jun 2006) | 1 line
Remove xmlrpc/ directory
........
r46633 | andrew.kuchling | 2006-06-04 01:51:21 +0200 (Sun, 04 Jun 2006) | 1 line
Remove dangling reference
........
r46634 | andrew.kuchling | 2006-06-04 01:59:36 +0200 (Sun, 04 Jun 2006) | 1 line
Add more whitespace; use a better socket name
........
r46635 | tim.peters | 2006-06-04 03:22:53 +0200 (Sun, 04 Jun 2006) | 2 lines
Whitespace normalization.
........
r46637 | tim.peters | 2006-06-04 05:26:02 +0200 (Sun, 04 Jun 2006) | 16 lines
In a PYMALLOC_DEBUG build obmalloc adds extra debugging info
to each allocated block. This was using 4 bytes for each such
piece of info regardless of platform. This didn't really matter
before (proof: no bug reports, and the debug-build obmalloc would
have assert-failed if it was ever asked for a chunk of memory
>= 2**32 bytes), since container indices were plain ints. But after
the Py_ssize_t changes, it's at least theoretically possible to
allocate a list or string whose guts exceed 2**32 bytes, and the
PYMALLOC_DEBUG routines would fail then (having only 4 bytes
to record the originally requested size).
Now we use sizeof(size_t) bytes for each of a PYMALLOC_DEBUG
build's extra debugging fields. This won't make any difference
on 32-bit boxes, but will add 16 bytes to each allocation in
a debug build on a 64-bit box.
........
r46638 | tim.peters | 2006-06-04 05:38:04 +0200 (Sun, 04 Jun 2006) | 4 lines
_PyObject_DebugMalloc(): The return value should add
2*sizeof(size_t) now, not 8. This probably accounts for
current disasters on the 64-bit buildbot slaves.
........
r46639 | neal.norwitz | 2006-06-04 08:19:31 +0200 (Sun, 04 Jun 2006) | 1 line
SF #1499797, Fix for memory leak in WindowsError_str
........
r46640 | andrew.macintyre | 2006-06-04 14:31:09 +0200 (Sun, 04 Jun 2006) | 2 lines
Patch #1454481: Make thread stack size runtime tunable.
........
r46641 | andrew.macintyre | 2006-06-04 14:59:59 +0200 (Sun, 04 Jun 2006) | 2 lines
clean up function declarations to conform to PEP-7 style.
........
r46642 | martin.blais | 2006-06-04 15:49:49 +0200 (Sun, 04 Jun 2006) | 15 lines
Fixes in struct and socket from merge reviews.
- Following Guido's comments, renamed
* pack_to -> pack_into
* recv_buf -> recv_into
* recvfrom_buf -> recvfrom_into
- Made fixes to _struct.c according to Neal Norwitz comments on the checkins
list.
- Converted some ints into the appropriate -- I hope -- ssize_t and size_t.
........
r46643 | ronald.oussoren | 2006-06-04 16:05:28 +0200 (Sun, 04 Jun 2006) | 3 lines
"Import" LDFLAGS in Mac/OSX/Makefile.in to ensure pythonw gets build with
the right compiler flags.
........
r46644 | ronald.oussoren | 2006-06-04 16:24:59 +0200 (Sun, 04 Jun 2006) | 2 lines
Drop Mac wrappers for the WASTE library.
........
r46645 | tim.peters | 2006-06-04 17:49:07 +0200 (Sun, 04 Jun 2006) | 3 lines
s_methods[]: Stop compiler warnings by casting
s_unpack_from to PyCFunction.
........
r46646 | george.yoshida | 2006-06-04 19:04:12 +0200 (Sun, 04 Jun 2006) | 2 lines
Remove a redundant word
........
r46647 | george.yoshida | 2006-06-04 19:17:25 +0200 (Sun, 04 Jun 2006) | 2 lines
Markup fix
........
r46648 | martin.v.loewis | 2006-06-04 21:36:28 +0200 (Sun, 04 Jun 2006) | 2 lines
Patch #1359618: Speed-up charmap encoder.
........
r46649 | georg.brandl | 2006-06-04 23:46:16 +0200 (Sun, 04 Jun 2006) | 3 lines
Repair refleaks in unicodeobject.
........
r46650 | georg.brandl | 2006-06-04 23:56:52 +0200 (Sun, 04 Jun 2006) | 4 lines
Patch #1346214: correctly optimize away "if 0"-style stmts
(thanks to Neal for review)
........
r46651 | georg.brandl | 2006-06-05 00:15:37 +0200 (Mon, 05 Jun 2006) | 2 lines
Bug #1500293: fix memory leaks in _subprocess module.
........
r46654 | tim.peters | 2006-06-05 01:43:53 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46655 | tim.peters | 2006-06-05 01:52:47 +0200 (Mon, 05 Jun 2006) | 16 lines
Revert revisions:
46640 Patch #1454481: Make thread stack size runtime tunable.
46647 Markup fix
The first is causing many buildbots to fail test runs, and there
are multiple causes with seemingly no immediate prospects for
repairing them. See python-dev discussion.
Note that a branch can (and should) be created for resolving these
problems, like
svn copy svn+ssh://svn.python.org/python/trunk -r46640 svn+ssh://svn.python.org/python/branches/NEW_BRANCH
followed by merging rev 46647 to the new branch.
........
r46656 | andrew.kuchling | 2006-06-05 02:08:09 +0200 (Mon, 05 Jun 2006) | 1 line
Mention second encoding speedup
........
r46657 | gregory.p.smith | 2006-06-05 02:31:01 +0200 (Mon, 05 Jun 2006) | 7 lines
bugfix: when log_archive was called with the DB_ARCH_REMOVE flag present
in BerkeleyDB >= 4.2 it tried to construct a list out of an uninitialized
char **log_list.
feature: export the DB_ARCH_REMOVE flag by name in the module on BerkeleyDB >= 4.2.
........
r46658 | gregory.p.smith | 2006-06-05 02:33:35 +0200 (Mon, 05 Jun 2006) | 5 lines
fix a bug in the previous commit. don't leak empty list on error return and
fix the additional rare (out of memory only) bug that it was supposed to fix
of not freeing log_list when the python allocator failed.
........
r46660 | tim.peters | 2006-06-05 02:55:26 +0200 (Mon, 05 Jun 2006) | 9 lines
"Flat is better than nested."
Move the long-winded, multiply-nested -R support out
of runtest() and into some module-level helper functions.
This makes runtest() and the -R code easier to follow.
That in turn allowed seeing some opportunities for code
simplification, and made it obvious that reglog.txt
never got closed.
........
r46661 | hyeshik.chang | 2006-06-05 02:59:54 +0200 (Mon, 05 Jun 2006) | 3 lines
Fix a potentially invalid memory access of CJKCodecs' shift-jis
decoder. (found by Neal Norwitz)
........
r46663 | gregory.p.smith | 2006-06-05 03:39:52 +0200 (Mon, 05 Jun 2006) | 3 lines
* support DBEnv.log_stat() method on BerkeleyDB >= 4.0 [patch #1494885]
........
r46664 | tim.peters | 2006-06-05 03:43:03 +0200 (Mon, 05 Jun 2006) | 3 lines
Remove doctest.testmod's deprecated (in 2.4) `isprivate`
argument. A lot of hair went into supporting that!
........
r46665 | tim.peters | 2006-06-05 03:47:24 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46666 | tim.peters | 2006-06-05 03:48:21 +0200 (Mon, 05 Jun 2006) | 2 lines
Make doctest news more accurate.
........
r46667 | gregory.p.smith | 2006-06-05 03:56:15 +0200 (Mon, 05 Jun 2006) | 3 lines
* support DBEnv.lsn_reset() method on BerkeleyDB >= 4.4 [patch #1494902]
........
r46668 | gregory.p.smith | 2006-06-05 04:02:25 +0200 (Mon, 05 Jun 2006) | 3 lines
mention the just committed bsddb changes
........
r46671 | gregory.p.smith | 2006-06-05 19:38:04 +0200 (Mon, 05 Jun 2006) | 3 lines
* add support for DBSequence objects [patch #1466734]
........
r46672 | gregory.p.smith | 2006-06-05 20:20:07 +0200 (Mon, 05 Jun 2006) | 3 lines
forgot to add this file in previous commit
........
r46673 | tim.peters | 2006-06-05 20:36:12 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46674 | tim.peters | 2006-06-05 20:36:54 +0200 (Mon, 05 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46675 | gregory.p.smith | 2006-06-05 20:48:21 +0200 (Mon, 05 Jun 2006) | 4 lines
* fix DBCursor.pget() bug with keyword argument names when no data= is
supplied [SF pybsddb bug #1477863]
........
r46676 | andrew.kuchling | 2006-06-05 21:05:32 +0200 (Mon, 05 Jun 2006) | 1 line
Remove use of Trove name, which isn't very helpful to users
........
r46677 | andrew.kuchling | 2006-06-05 21:08:25 +0200 (Mon, 05 Jun 2006) | 1 line
[Bug #1470026] Include link to list of classifiers
........
r46679 | tim.peters | 2006-06-05 22:48:49 +0200 (Mon, 05 Jun 2006) | 10 lines
Access _struct attributes directly instead of mucking with getattr.
string_reverse(): Simplify.
assertRaises(): Raise TestFailed on failure.
test_unpack_from(), test_pack_into(), test_pack_into_fn(): never
use `assert` to test for an expected result (it doesn't test anything
when Python is run with -O).
........
r46680 | tim.peters | 2006-06-05 22:49:27 +0200 (Mon, 05 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46681 | gregory.p.smith | 2006-06-06 01:38:06 +0200 (Tue, 06 Jun 2006) | 3 lines
add depends = ['md5.h'] to the _md5 module extension for correctness sake.
........
r46682 | brett.cannon | 2006-06-06 01:51:55 +0200 (Tue, 06 Jun 2006) | 4 lines
Add 3 more bytes to a buffer to cover constants in string and null byte on top of 10 possible digits for an int.
Closes bug #1501223.
........
r46684 | gregory.p.smith | 2006-06-06 01:59:37 +0200 (Tue, 06 Jun 2006) | 5 lines
- bsddb: the __len__ method of a DB object has been fixed to return correct
results. It could previously incorrectly return 0 in some cases.
Fixes SF bug 1493322 (pybsddb bug 1184012).
........
r46686 | tim.peters | 2006-06-06 02:25:07 +0200 (Tue, 06 Jun 2006) | 7 lines
_PySys_Init(): It's rarely a good idea to size a buffer to the
exact maximum size someone guesses is needed. In this case, if
we're really worried about extreme integers, then "cp%d" can
actually need 14 bytes (2 for "cp" + 1 for \0 at the end +
11 for -(2**31-1)). So reserve 128 bytes instead -- nothing is
actually saved by making a stack-local buffer tiny.
........
r46687 | neal.norwitz | 2006-06-06 09:22:08 +0200 (Tue, 06 Jun 2006) | 1 line
Remove unused variable (and stop compiler warning)
........
r46688 | neal.norwitz | 2006-06-06 09:23:01 +0200 (Tue, 06 Jun 2006) | 1 line
Fix a bunch of parameter strings
........
r46689 | thomas.heller | 2006-06-06 13:34:33 +0200 (Tue, 06 Jun 2006) | 6 lines
Convert CFieldObject tp_members to tp_getset, since there is no
structmember typecode for Py_ssize_t fields. This should fix some of
the errors on the PPC64 debian machine (64-bit, big endian).
Assigning to readonly fields now raises AttributeError instead of
TypeError, so the testcase has to be changed as well.
........
r46690 | thomas.heller | 2006-06-06 13:54:32 +0200 (Tue, 06 Jun 2006) | 1 line
Damn - the sentinel was missing. And fix another silly mistake.
........
r46691 | martin.blais | 2006-06-06 14:46:55 +0200 (Tue, 06 Jun 2006) | 13 lines
Normalized a few cases of whitespace in function declarations.
Found them using::
find . -name '*.py' | while read i ; do grep 'def[^(]*( ' $i /dev/null ; done
find . -name '*.py' | while read i ; do grep ' ):' $i /dev/null ; done
(I was doing this all over my own code anyway, because I'd been using spaces in
all defs, so I thought I'd make a run on the Python code as well. If you need
to do such fixes in your own code, you can use xx-rename or parenregu.el within
emacs.)
........
r46693 | thomas.heller | 2006-06-06 17:34:18 +0200 (Tue, 06 Jun 2006) | 1 line
Specify argtypes for all test functions. Maybe that helps on strange ;-) architectures
........
r46694 | tim.peters | 2006-06-06 17:50:17 +0200 (Tue, 06 Jun 2006) | 5 lines
BSequence_set_range(): Rev 46688 ("Fix a bunch of
parameter strings") changed this function's signature
seemingly by mistake, which is causing buildbots to fail
test_bsddb3. Restored the pre-46688 signature.
........
r46695 | tim.peters | 2006-06-06 17:52:35 +0200 (Tue, 06 Jun 2006) | 4 lines
On python-dev Thomas Heller said these were committed
by mistake in rev 46693, so reverting this part of
rev 46693.
........
r46696 | andrew.kuchling | 2006-06-06 19:10:41 +0200 (Tue, 06 Jun 2006) | 1 line
Fix comment typo
........
r46697 | brett.cannon | 2006-06-06 20:08:16 +0200 (Tue, 06 Jun 2006) | 2 lines
Fix coding style guide bug.
........
r46698 | thomas.heller | 2006-06-06 20:50:46 +0200 (Tue, 06 Jun 2006) | 2 lines
Add a hack so that foreign functions returning float now do work on 64-bit
big endian platforms.
........
r46699 | thomas.heller | 2006-06-06 21:25:13 +0200 (Tue, 06 Jun 2006) | 3 lines
Use the same big-endian hack as in _ctypes/callproc.c for callback functions.
This fixes the callback function tests that return float.
........
r46700 | ronald.oussoren | 2006-06-06 21:50:24 +0200 (Tue, 06 Jun 2006) | 5 lines
* Ensure that "make altinstall" works when the tree was configured
with --enable-framework
* Also for --enable-framework: allow users to use --prefix to specify
the location of the compatibility symlinks (such as /usr/local/bin/python)
........
r46701 | ronald.oussoren | 2006-06-06 21:56:00 +0200 (Tue, 06 Jun 2006) | 3 lines
A quick hack to ensure the right key-bindings for IDLE on osx: install patched
configuration files during a framework install.
........
r46702 | tim.peters | 2006-06-07 03:04:59 +0200 (Wed, 07 Jun 2006) | 4 lines
dash_R_cleanup(): Clear filecmp._cache. This accounts for
different results across -R runs (at least on Windows) of
test_filecmp.
........
r46705 | tim.peters | 2006-06-07 08:57:51 +0200 (Wed, 07 Jun 2006) | 17 lines
SF patch 1501987: Remove randomness from test_exceptions,
from ?iga Seilnacht (sorry about the name, but Firefox
on my box can't display the first character of the name --
the SF "Unix name" is zseil).
This appears to cure the oddball intermittent leaks across
runs when running test_exceptions under -R. I'm not sure
why, but I'm too sleepy to care ;-)
The thrust of the SF patch was to remove randomness in the
pickle protocol used. I changed the patch to use
range(pickle.HIGHEST_PROTOCOL + 1), to try both pickle and
cPickle, and randomly mucked with other test lines to put
statements on their own lines.
Not a bugfix candidate (this is fiddling new-in-2.5 code).
........
r46706 | andrew.kuchling | 2006-06-07 15:55:33 +0200 (Wed, 07 Jun 2006) | 1 line
Add an SQLite introduction, taken from the 'What's New' text
........
r46708 | andrew.kuchling | 2006-06-07 19:02:52 +0200 (Wed, 07 Jun 2006) | 1 line
Mention other placeholders
........
r46709 | andrew.kuchling | 2006-06-07 19:03:46 +0200 (Wed, 07 Jun 2006) | 1 line
Add an item; also, escape %
........
r46710 | andrew.kuchling | 2006-06-07 19:04:01 +0200 (Wed, 07 Jun 2006) | 1 line
Mention other placeholders
........
r46716 | ronald.oussoren | 2006-06-07 20:57:44 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/Tools one level up
........
r46717 | ronald.oussoren | 2006-06-07 20:58:01 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/PythonLauncher one level up
........
r46718 | ronald.oussoren | 2006-06-07 20:58:42 +0200 (Wed, 07 Jun 2006) | 2 lines
mv Mac/OSX/BuildScript one level up
........
r46719 | ronald.oussoren | 2006-06-07 21:02:03 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/* one level up
........
r46720 | ronald.oussoren | 2006-06-07 21:06:01 +0200 (Wed, 07 Jun 2006) | 2 lines
And the last bit: move IDLE one level up and adjust makefiles
........
r46723 | ronald.oussoren | 2006-06-07 21:38:53 +0200 (Wed, 07 Jun 2006) | 4 lines
- Patch the correct version of python in the Info.plists at build time, instead
of relying on a maintainer to update them before releases.
- Remove the now empty Mac/OSX directory
........
r46727 | ronald.oussoren | 2006-06-07 22:18:44 +0200 (Wed, 07 Jun 2006) | 7 lines
* If BuildApplet.py is used as an applet it starts with a version of
sys.exutable that isn't usuable on an #!-line. That results in generated
applets that don't actually work. Work around this problem by resetting
sys.executable.
* argvemulator.py didn't work on intel macs. This patch fixes this
(bug #1491468)
........
r46728 | tim.peters | 2006-06-07 22:40:06 +0200 (Wed, 07 Jun 2006) | 2 lines
Whitespace normalization.
........
r46729 | tim.peters | 2006-06-07 22:40:54 +0200 (Wed, 07 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46730 | thomas.heller | 2006-06-07 22:43:06 +0200 (Wed, 07 Jun 2006) | 7 lines
Fix for foreign functions returning small structures on 64-bit big
endian machines. Should fix the remaininf failure in the PPC64
Debian buildbot.
Thanks to Matthias Klose for providing access to a machine to debug
and test this.
........
r46731 | brett.cannon | 2006-06-07 23:48:17 +0200 (Wed, 07 Jun 2006) | 2 lines
Clarify documentation for bf_getcharbuffer.
........
r46735 | neal.norwitz | 2006-06-08 07:12:45 +0200 (Thu, 08 Jun 2006) | 1 line
Fix a refleak in recvfrom_into
........
r46736 | gregory.p.smith | 2006-06-08 07:17:08 +0200 (Thu, 08 Jun 2006) | 9 lines
- bsddb: the bsddb.dbtables Modify method now raises the proper error and
aborts the db transaction safely when a modifier callback fails.
Fixes SF python patch/bug #1408584.
Also cleans up the bsddb.dbtables docstrings since thats the only
documentation that exists for that unadvertised module. (people
really should really just use sqlite3)
........
r46737 | gregory.p.smith | 2006-06-08 07:38:11 +0200 (Thu, 08 Jun 2006) | 4 lines
* Turn the deadlock situation described in SF bug #775414 into a
DBDeadLockError exception.
* add the test case for my previous dbtables commit.
........
r46738 | gregory.p.smith | 2006-06-08 07:39:54 +0200 (Thu, 08 Jun 2006) | 2 lines
pasted set_lk_detect line in wrong spot in previous commit. fixed. passes tests this time.
........
r46739 | armin.rigo | 2006-06-08 12:56:24 +0200 (Thu, 08 Jun 2006) | 6 lines
(arre, arigo) SF bug #1350060
Give a consistent behavior for comparison and hashing of method objects
(both user- and built-in methods). Now compares the 'self' recursively.
The hash was already asking for the hash of 'self'.
........
r46740 | andrew.kuchling | 2006-06-08 13:56:44 +0200 (Thu, 08 Jun 2006) | 1 line
Typo fix
........
r46741 | georg.brandl | 2006-06-08 14:45:01 +0200 (Thu, 08 Jun 2006) | 2 lines
Bug #1502750: Fix getargs "i" format to use LONG_MIN and LONG_MAX for bounds checking.
........
r46743 | georg.brandl | 2006-06-08 14:54:13 +0200 (Thu, 08 Jun 2006) | 2 lines
Bug #1502728: Correctly link against librt library on HP-UX.
........
r46745 | georg.brandl | 2006-06-08 14:55:47 +0200 (Thu, 08 Jun 2006) | 3 lines
Add news for recent bugfix.
........
r46746 | georg.brandl | 2006-06-08 15:31:07 +0200 (Thu, 08 Jun 2006) | 4 lines
Argh. "integer" is a very confusing word ;)
Actually, checking for INT_MAX and INT_MIN is correct since
the format code explicitly handles a C "int".
........
r46748 | nick.coghlan | 2006-06-08 15:54:49 +0200 (Thu, 08 Jun 2006) | 1 line
Add functools.update_wrapper() and functools.wraps() as described in PEP 356
........
r46751 | georg.brandl | 2006-06-08 16:50:21 +0200 (Thu, 08 Jun 2006) | 4 lines
Bug #1502805: don't alias file.__exit__ to file.close since the
latter can return something that's true.
........
r46752 | georg.brandl | 2006-06-08 16:50:53 +0200 (Thu, 08 Jun 2006) | 3 lines
Convert test_file to unittest.
........
2006-06-08 12:35:45 -03:00
|
|
|
vereq(l.__add__, [].__add__)
|
|
|
|
verify(l.__add__ != [5].__add__)
|
|
|
|
verify(l.__add__ != l.__mul__)
|
2005-11-07 04:38:00 -04:00
|
|
|
verify(l.__add__.__name__ == '__add__')
|
|
|
|
verify(l.__add__.__self__ is l)
|
|
|
|
verify(l.__add__.__objclass__ is list)
|
|
|
|
vereq(l.__add__.__doc__, list.__add__.__doc__)
|
Merge the rest of the trunk.
Merged revisions 46490-46494,46496,46498,46500,46506,46521,46538,46558,46563-46567,46570-46571,46583,46593,46595-46598,46604,46606,46609-46753 via svnmerge from
svn+ssh://pythondev@svn.python.org/python/trunk
........
r46610 | martin.v.loewis | 2006-06-03 09:42:26 +0200 (Sat, 03 Jun 2006) | 2 lines
Updated version (win32-icons2.zip) from #1490384.
........
r46612 | andrew.kuchling | 2006-06-03 20:09:41 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1472084] Fix description of do_tag
........
r46614 | andrew.kuchling | 2006-06-03 20:33:35 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1475554] Strengthen text to say 'must' instead of 'should'
........
r46616 | andrew.kuchling | 2006-06-03 20:41:28 +0200 (Sat, 03 Jun 2006) | 1 line
[Bug #1441864] Clarify description of 'data' argument
........
r46617 | andrew.kuchling | 2006-06-03 20:43:24 +0200 (Sat, 03 Jun 2006) | 1 line
Minor rewording
........
r46619 | andrew.kuchling | 2006-06-03 21:02:35 +0200 (Sat, 03 Jun 2006) | 9 lines
[Bug #1497414] _self is a reserved word in the WATCOM 10.6 C compiler.
Fix by renaming the variable.
In a different module, Neal fixed it by renaming _self to self. There's
already a variable named 'self' here, so I used selfptr.
(I'm committing this on a Mac without Tk, but it's a simple search-and-replace.
<crosses fingers>, so I'll watch the buildbots and see what happens.)
........
r46621 | fredrik.lundh | 2006-06-03 23:56:05 +0200 (Sat, 03 Jun 2006) | 5 lines
"_self" is a said to be a reserved word in Watcom C 10.6. I'm
not sure that's really standard compliant behaviour, but I guess
we have to fix that anyway...
........
r46622 | andrew.kuchling | 2006-06-04 00:44:42 +0200 (Sun, 04 Jun 2006) | 1 line
Update readme
........
r46623 | andrew.kuchling | 2006-06-04 00:59:23 +0200 (Sun, 04 Jun 2006) | 1 line
Drop 0 parameter
........
r46624 | andrew.kuchling | 2006-06-04 00:59:59 +0200 (Sun, 04 Jun 2006) | 1 line
Some code tidying; use curses.wrapper
........
r46625 | andrew.kuchling | 2006-06-04 01:02:15 +0200 (Sun, 04 Jun 2006) | 1 line
Use True; value returned from main is unused
........
r46626 | andrew.kuchling | 2006-06-04 01:07:21 +0200 (Sun, 04 Jun 2006) | 1 line
Use true division, and the True value
........
r46627 | andrew.kuchling | 2006-06-04 01:09:58 +0200 (Sun, 04 Jun 2006) | 1 line
Docstring fix; use True
........
r46628 | andrew.kuchling | 2006-06-04 01:15:56 +0200 (Sun, 04 Jun 2006) | 1 line
Put code in a main() function; loosen up the spacing to match current code style
........
r46629 | andrew.kuchling | 2006-06-04 01:39:07 +0200 (Sun, 04 Jun 2006) | 1 line
Use functions; modernize code
........
r46630 | andrew.kuchling | 2006-06-04 01:43:22 +0200 (Sun, 04 Jun 2006) | 1 line
This demo requires Medusa (not just asyncore); remove it
........
r46631 | andrew.kuchling | 2006-06-04 01:46:36 +0200 (Sun, 04 Jun 2006) | 2 lines
Remove xmlrpc demo -- it duplicates the SimpleXMLRPCServer module.
........
r46632 | andrew.kuchling | 2006-06-04 01:47:22 +0200 (Sun, 04 Jun 2006) | 1 line
Remove xmlrpc/ directory
........
r46633 | andrew.kuchling | 2006-06-04 01:51:21 +0200 (Sun, 04 Jun 2006) | 1 line
Remove dangling reference
........
r46634 | andrew.kuchling | 2006-06-04 01:59:36 +0200 (Sun, 04 Jun 2006) | 1 line
Add more whitespace; use a better socket name
........
r46635 | tim.peters | 2006-06-04 03:22:53 +0200 (Sun, 04 Jun 2006) | 2 lines
Whitespace normalization.
........
r46637 | tim.peters | 2006-06-04 05:26:02 +0200 (Sun, 04 Jun 2006) | 16 lines
In a PYMALLOC_DEBUG build obmalloc adds extra debugging info
to each allocated block. This was using 4 bytes for each such
piece of info regardless of platform. This didn't really matter
before (proof: no bug reports, and the debug-build obmalloc would
have assert-failed if it was ever asked for a chunk of memory
>= 2**32 bytes), since container indices were plain ints. But after
the Py_ssize_t changes, it's at least theoretically possible to
allocate a list or string whose guts exceed 2**32 bytes, and the
PYMALLOC_DEBUG routines would fail then (having only 4 bytes
to record the originally requested size).
Now we use sizeof(size_t) bytes for each of a PYMALLOC_DEBUG
build's extra debugging fields. This won't make any difference
on 32-bit boxes, but will add 16 bytes to each allocation in
a debug build on a 64-bit box.
........
r46638 | tim.peters | 2006-06-04 05:38:04 +0200 (Sun, 04 Jun 2006) | 4 lines
_PyObject_DebugMalloc(): The return value should add
2*sizeof(size_t) now, not 8. This probably accounts for
current disasters on the 64-bit buildbot slaves.
........
r46639 | neal.norwitz | 2006-06-04 08:19:31 +0200 (Sun, 04 Jun 2006) | 1 line
SF #1499797, Fix for memory leak in WindowsError_str
........
r46640 | andrew.macintyre | 2006-06-04 14:31:09 +0200 (Sun, 04 Jun 2006) | 2 lines
Patch #1454481: Make thread stack size runtime tunable.
........
r46641 | andrew.macintyre | 2006-06-04 14:59:59 +0200 (Sun, 04 Jun 2006) | 2 lines
clean up function declarations to conform to PEP-7 style.
........
r46642 | martin.blais | 2006-06-04 15:49:49 +0200 (Sun, 04 Jun 2006) | 15 lines
Fixes in struct and socket from merge reviews.
- Following Guido's comments, renamed
* pack_to -> pack_into
* recv_buf -> recv_into
* recvfrom_buf -> recvfrom_into
- Made fixes to _struct.c according to Neal Norwitz comments on the checkins
list.
- Converted some ints into the appropriate -- I hope -- ssize_t and size_t.
........
r46643 | ronald.oussoren | 2006-06-04 16:05:28 +0200 (Sun, 04 Jun 2006) | 3 lines
"Import" LDFLAGS in Mac/OSX/Makefile.in to ensure pythonw gets build with
the right compiler flags.
........
r46644 | ronald.oussoren | 2006-06-04 16:24:59 +0200 (Sun, 04 Jun 2006) | 2 lines
Drop Mac wrappers for the WASTE library.
........
r46645 | tim.peters | 2006-06-04 17:49:07 +0200 (Sun, 04 Jun 2006) | 3 lines
s_methods[]: Stop compiler warnings by casting
s_unpack_from to PyCFunction.
........
r46646 | george.yoshida | 2006-06-04 19:04:12 +0200 (Sun, 04 Jun 2006) | 2 lines
Remove a redundant word
........
r46647 | george.yoshida | 2006-06-04 19:17:25 +0200 (Sun, 04 Jun 2006) | 2 lines
Markup fix
........
r46648 | martin.v.loewis | 2006-06-04 21:36:28 +0200 (Sun, 04 Jun 2006) | 2 lines
Patch #1359618: Speed-up charmap encoder.
........
r46649 | georg.brandl | 2006-06-04 23:46:16 +0200 (Sun, 04 Jun 2006) | 3 lines
Repair refleaks in unicodeobject.
........
r46650 | georg.brandl | 2006-06-04 23:56:52 +0200 (Sun, 04 Jun 2006) | 4 lines
Patch #1346214: correctly optimize away "if 0"-style stmts
(thanks to Neal for review)
........
r46651 | georg.brandl | 2006-06-05 00:15:37 +0200 (Mon, 05 Jun 2006) | 2 lines
Bug #1500293: fix memory leaks in _subprocess module.
........
r46654 | tim.peters | 2006-06-05 01:43:53 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46655 | tim.peters | 2006-06-05 01:52:47 +0200 (Mon, 05 Jun 2006) | 16 lines
Revert revisions:
46640 Patch #1454481: Make thread stack size runtime tunable.
46647 Markup fix
The first is causing many buildbots to fail test runs, and there
are multiple causes with seemingly no immediate prospects for
repairing them. See python-dev discussion.
Note that a branch can (and should) be created for resolving these
problems, like
svn copy svn+ssh://svn.python.org/python/trunk -r46640 svn+ssh://svn.python.org/python/branches/NEW_BRANCH
followed by merging rev 46647 to the new branch.
........
r46656 | andrew.kuchling | 2006-06-05 02:08:09 +0200 (Mon, 05 Jun 2006) | 1 line
Mention second encoding speedup
........
r46657 | gregory.p.smith | 2006-06-05 02:31:01 +0200 (Mon, 05 Jun 2006) | 7 lines
bugfix: when log_archive was called with the DB_ARCH_REMOVE flag present
in BerkeleyDB >= 4.2 it tried to construct a list out of an uninitialized
char **log_list.
feature: export the DB_ARCH_REMOVE flag by name in the module on BerkeleyDB >= 4.2.
........
r46658 | gregory.p.smith | 2006-06-05 02:33:35 +0200 (Mon, 05 Jun 2006) | 5 lines
fix a bug in the previous commit. don't leak empty list on error return and
fix the additional rare (out of memory only) bug that it was supposed to fix
of not freeing log_list when the python allocator failed.
........
r46660 | tim.peters | 2006-06-05 02:55:26 +0200 (Mon, 05 Jun 2006) | 9 lines
"Flat is better than nested."
Move the long-winded, multiply-nested -R support out
of runtest() and into some module-level helper functions.
This makes runtest() and the -R code easier to follow.
That in turn allowed seeing some opportunities for code
simplification, and made it obvious that reglog.txt
never got closed.
........
r46661 | hyeshik.chang | 2006-06-05 02:59:54 +0200 (Mon, 05 Jun 2006) | 3 lines
Fix a potentially invalid memory access of CJKCodecs' shift-jis
decoder. (found by Neal Norwitz)
........
r46663 | gregory.p.smith | 2006-06-05 03:39:52 +0200 (Mon, 05 Jun 2006) | 3 lines
* support DBEnv.log_stat() method on BerkeleyDB >= 4.0 [patch #1494885]
........
r46664 | tim.peters | 2006-06-05 03:43:03 +0200 (Mon, 05 Jun 2006) | 3 lines
Remove doctest.testmod's deprecated (in 2.4) `isprivate`
argument. A lot of hair went into supporting that!
........
r46665 | tim.peters | 2006-06-05 03:47:24 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46666 | tim.peters | 2006-06-05 03:48:21 +0200 (Mon, 05 Jun 2006) | 2 lines
Make doctest news more accurate.
........
r46667 | gregory.p.smith | 2006-06-05 03:56:15 +0200 (Mon, 05 Jun 2006) | 3 lines
* support DBEnv.lsn_reset() method on BerkeleyDB >= 4.4 [patch #1494902]
........
r46668 | gregory.p.smith | 2006-06-05 04:02:25 +0200 (Mon, 05 Jun 2006) | 3 lines
mention the just committed bsddb changes
........
r46671 | gregory.p.smith | 2006-06-05 19:38:04 +0200 (Mon, 05 Jun 2006) | 3 lines
* add support for DBSequence objects [patch #1466734]
........
r46672 | gregory.p.smith | 2006-06-05 20:20:07 +0200 (Mon, 05 Jun 2006) | 3 lines
forgot to add this file in previous commit
........
r46673 | tim.peters | 2006-06-05 20:36:12 +0200 (Mon, 05 Jun 2006) | 2 lines
Whitespace normalization.
........
r46674 | tim.peters | 2006-06-05 20:36:54 +0200 (Mon, 05 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46675 | gregory.p.smith | 2006-06-05 20:48:21 +0200 (Mon, 05 Jun 2006) | 4 lines
* fix DBCursor.pget() bug with keyword argument names when no data= is
supplied [SF pybsddb bug #1477863]
........
r46676 | andrew.kuchling | 2006-06-05 21:05:32 +0200 (Mon, 05 Jun 2006) | 1 line
Remove use of Trove name, which isn't very helpful to users
........
r46677 | andrew.kuchling | 2006-06-05 21:08:25 +0200 (Mon, 05 Jun 2006) | 1 line
[Bug #1470026] Include link to list of classifiers
........
r46679 | tim.peters | 2006-06-05 22:48:49 +0200 (Mon, 05 Jun 2006) | 10 lines
Access _struct attributes directly instead of mucking with getattr.
string_reverse(): Simplify.
assertRaises(): Raise TestFailed on failure.
test_unpack_from(), test_pack_into(), test_pack_into_fn(): never
use `assert` to test for an expected result (it doesn't test anything
when Python is run with -O).
........
r46680 | tim.peters | 2006-06-05 22:49:27 +0200 (Mon, 05 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46681 | gregory.p.smith | 2006-06-06 01:38:06 +0200 (Tue, 06 Jun 2006) | 3 lines
add depends = ['md5.h'] to the _md5 module extension for correctness sake.
........
r46682 | brett.cannon | 2006-06-06 01:51:55 +0200 (Tue, 06 Jun 2006) | 4 lines
Add 3 more bytes to a buffer to cover constants in string and null byte on top of 10 possible digits for an int.
Closes bug #1501223.
........
r46684 | gregory.p.smith | 2006-06-06 01:59:37 +0200 (Tue, 06 Jun 2006) | 5 lines
- bsddb: the __len__ method of a DB object has been fixed to return correct
results. It could previously incorrectly return 0 in some cases.
Fixes SF bug 1493322 (pybsddb bug 1184012).
........
r46686 | tim.peters | 2006-06-06 02:25:07 +0200 (Tue, 06 Jun 2006) | 7 lines
_PySys_Init(): It's rarely a good idea to size a buffer to the
exact maximum size someone guesses is needed. In this case, if
we're really worried about extreme integers, then "cp%d" can
actually need 14 bytes (2 for "cp" + 1 for \0 at the end +
11 for -(2**31-1)). So reserve 128 bytes instead -- nothing is
actually saved by making a stack-local buffer tiny.
........
r46687 | neal.norwitz | 2006-06-06 09:22:08 +0200 (Tue, 06 Jun 2006) | 1 line
Remove unused variable (and stop compiler warning)
........
r46688 | neal.norwitz | 2006-06-06 09:23:01 +0200 (Tue, 06 Jun 2006) | 1 line
Fix a bunch of parameter strings
........
r46689 | thomas.heller | 2006-06-06 13:34:33 +0200 (Tue, 06 Jun 2006) | 6 lines
Convert CFieldObject tp_members to tp_getset, since there is no
structmember typecode for Py_ssize_t fields. This should fix some of
the errors on the PPC64 debian machine (64-bit, big endian).
Assigning to readonly fields now raises AttributeError instead of
TypeError, so the testcase has to be changed as well.
........
r46690 | thomas.heller | 2006-06-06 13:54:32 +0200 (Tue, 06 Jun 2006) | 1 line
Damn - the sentinel was missing. And fix another silly mistake.
........
r46691 | martin.blais | 2006-06-06 14:46:55 +0200 (Tue, 06 Jun 2006) | 13 lines
Normalized a few cases of whitespace in function declarations.
Found them using::
find . -name '*.py' | while read i ; do grep 'def[^(]*( ' $i /dev/null ; done
find . -name '*.py' | while read i ; do grep ' ):' $i /dev/null ; done
(I was doing this all over my own code anyway, because I'd been using spaces in
all defs, so I thought I'd make a run on the Python code as well. If you need
to do such fixes in your own code, you can use xx-rename or parenregu.el within
emacs.)
........
r46693 | thomas.heller | 2006-06-06 17:34:18 +0200 (Tue, 06 Jun 2006) | 1 line
Specify argtypes for all test functions. Maybe that helps on strange ;-) architectures
........
r46694 | tim.peters | 2006-06-06 17:50:17 +0200 (Tue, 06 Jun 2006) | 5 lines
BSequence_set_range(): Rev 46688 ("Fix a bunch of
parameter strings") changed this function's signature
seemingly by mistake, which is causing buildbots to fail
test_bsddb3. Restored the pre-46688 signature.
........
r46695 | tim.peters | 2006-06-06 17:52:35 +0200 (Tue, 06 Jun 2006) | 4 lines
On python-dev Thomas Heller said these were committed
by mistake in rev 46693, so reverting this part of
rev 46693.
........
r46696 | andrew.kuchling | 2006-06-06 19:10:41 +0200 (Tue, 06 Jun 2006) | 1 line
Fix comment typo
........
r46697 | brett.cannon | 2006-06-06 20:08:16 +0200 (Tue, 06 Jun 2006) | 2 lines
Fix coding style guide bug.
........
r46698 | thomas.heller | 2006-06-06 20:50:46 +0200 (Tue, 06 Jun 2006) | 2 lines
Add a hack so that foreign functions returning float now do work on 64-bit
big endian platforms.
........
r46699 | thomas.heller | 2006-06-06 21:25:13 +0200 (Tue, 06 Jun 2006) | 3 lines
Use the same big-endian hack as in _ctypes/callproc.c for callback functions.
This fixes the callback function tests that return float.
........
r46700 | ronald.oussoren | 2006-06-06 21:50:24 +0200 (Tue, 06 Jun 2006) | 5 lines
* Ensure that "make altinstall" works when the tree was configured
with --enable-framework
* Also for --enable-framework: allow users to use --prefix to specify
the location of the compatibility symlinks (such as /usr/local/bin/python)
........
r46701 | ronald.oussoren | 2006-06-06 21:56:00 +0200 (Tue, 06 Jun 2006) | 3 lines
A quick hack to ensure the right key-bindings for IDLE on osx: install patched
configuration files during a framework install.
........
r46702 | tim.peters | 2006-06-07 03:04:59 +0200 (Wed, 07 Jun 2006) | 4 lines
dash_R_cleanup(): Clear filecmp._cache. This accounts for
different results across -R runs (at least on Windows) of
test_filecmp.
........
r46705 | tim.peters | 2006-06-07 08:57:51 +0200 (Wed, 07 Jun 2006) | 17 lines
SF patch 1501987: Remove randomness from test_exceptions,
from ?iga Seilnacht (sorry about the name, but Firefox
on my box can't display the first character of the name --
the SF "Unix name" is zseil).
This appears to cure the oddball intermittent leaks across
runs when running test_exceptions under -R. I'm not sure
why, but I'm too sleepy to care ;-)
The thrust of the SF patch was to remove randomness in the
pickle protocol used. I changed the patch to use
range(pickle.HIGHEST_PROTOCOL + 1), to try both pickle and
cPickle, and randomly mucked with other test lines to put
statements on their own lines.
Not a bugfix candidate (this is fiddling new-in-2.5 code).
........
r46706 | andrew.kuchling | 2006-06-07 15:55:33 +0200 (Wed, 07 Jun 2006) | 1 line
Add an SQLite introduction, taken from the 'What's New' text
........
r46708 | andrew.kuchling | 2006-06-07 19:02:52 +0200 (Wed, 07 Jun 2006) | 1 line
Mention other placeholders
........
r46709 | andrew.kuchling | 2006-06-07 19:03:46 +0200 (Wed, 07 Jun 2006) | 1 line
Add an item; also, escape %
........
r46710 | andrew.kuchling | 2006-06-07 19:04:01 +0200 (Wed, 07 Jun 2006) | 1 line
Mention other placeholders
........
r46716 | ronald.oussoren | 2006-06-07 20:57:44 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/Tools one level up
........
r46717 | ronald.oussoren | 2006-06-07 20:58:01 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/PythonLauncher one level up
........
r46718 | ronald.oussoren | 2006-06-07 20:58:42 +0200 (Wed, 07 Jun 2006) | 2 lines
mv Mac/OSX/BuildScript one level up
........
r46719 | ronald.oussoren | 2006-06-07 21:02:03 +0200 (Wed, 07 Jun 2006) | 2 lines
Move Mac/OSX/* one level up
........
r46720 | ronald.oussoren | 2006-06-07 21:06:01 +0200 (Wed, 07 Jun 2006) | 2 lines
And the last bit: move IDLE one level up and adjust makefiles
........
r46723 | ronald.oussoren | 2006-06-07 21:38:53 +0200 (Wed, 07 Jun 2006) | 4 lines
- Patch the correct version of python in the Info.plists at build time, instead
of relying on a maintainer to update them before releases.
- Remove the now empty Mac/OSX directory
........
r46727 | ronald.oussoren | 2006-06-07 22:18:44 +0200 (Wed, 07 Jun 2006) | 7 lines
* If BuildApplet.py is used as an applet it starts with a version of
sys.exutable that isn't usuable on an #!-line. That results in generated
applets that don't actually work. Work around this problem by resetting
sys.executable.
* argvemulator.py didn't work on intel macs. This patch fixes this
(bug #1491468)
........
r46728 | tim.peters | 2006-06-07 22:40:06 +0200 (Wed, 07 Jun 2006) | 2 lines
Whitespace normalization.
........
r46729 | tim.peters | 2006-06-07 22:40:54 +0200 (Wed, 07 Jun 2006) | 2 lines
Add missing svn:eol-style property to text files.
........
r46730 | thomas.heller | 2006-06-07 22:43:06 +0200 (Wed, 07 Jun 2006) | 7 lines
Fix for foreign functions returning small structures on 64-bit big
endian machines. Should fix the remaininf failure in the PPC64
Debian buildbot.
Thanks to Matthias Klose for providing access to a machine to debug
and test this.
........
r46731 | brett.cannon | 2006-06-07 23:48:17 +0200 (Wed, 07 Jun 2006) | 2 lines
Clarify documentation for bf_getcharbuffer.
........
r46735 | neal.norwitz | 2006-06-08 07:12:45 +0200 (Thu, 08 Jun 2006) | 1 line
Fix a refleak in recvfrom_into
........
r46736 | gregory.p.smith | 2006-06-08 07:17:08 +0200 (Thu, 08 Jun 2006) | 9 lines
- bsddb: the bsddb.dbtables Modify method now raises the proper error and
aborts the db transaction safely when a modifier callback fails.
Fixes SF python patch/bug #1408584.
Also cleans up the bsddb.dbtables docstrings since thats the only
documentation that exists for that unadvertised module. (people
really should really just use sqlite3)
........
r46737 | gregory.p.smith | 2006-06-08 07:38:11 +0200 (Thu, 08 Jun 2006) | 4 lines
* Turn the deadlock situation described in SF bug #775414 into a
DBDeadLockError exception.
* add the test case for my previous dbtables commit.
........
r46738 | gregory.p.smith | 2006-06-08 07:39:54 +0200 (Thu, 08 Jun 2006) | 2 lines
pasted set_lk_detect line in wrong spot in previous commit. fixed. passes tests this time.
........
r46739 | armin.rigo | 2006-06-08 12:56:24 +0200 (Thu, 08 Jun 2006) | 6 lines
(arre, arigo) SF bug #1350060
Give a consistent behavior for comparison and hashing of method objects
(both user- and built-in methods). Now compares the 'self' recursively.
The hash was already asking for the hash of 'self'.
........
r46740 | andrew.kuchling | 2006-06-08 13:56:44 +0200 (Thu, 08 Jun 2006) | 1 line
Typo fix
........
r46741 | georg.brandl | 2006-06-08 14:45:01 +0200 (Thu, 08 Jun 2006) | 2 lines
Bug #1502750: Fix getargs "i" format to use LONG_MIN and LONG_MAX for bounds checking.
........
r46743 | georg.brandl | 2006-06-08 14:54:13 +0200 (Thu, 08 Jun 2006) | 2 lines
Bug #1502728: Correctly link against librt library on HP-UX.
........
r46745 | georg.brandl | 2006-06-08 14:55:47 +0200 (Thu, 08 Jun 2006) | 3 lines
Add news for recent bugfix.
........
r46746 | georg.brandl | 2006-06-08 15:31:07 +0200 (Thu, 08 Jun 2006) | 4 lines
Argh. "integer" is a very confusing word ;)
Actually, checking for INT_MAX and INT_MIN is correct since
the format code explicitly handles a C "int".
........
r46748 | nick.coghlan | 2006-06-08 15:54:49 +0200 (Thu, 08 Jun 2006) | 1 line
Add functools.update_wrapper() and functools.wraps() as described in PEP 356
........
r46751 | georg.brandl | 2006-06-08 16:50:21 +0200 (Thu, 08 Jun 2006) | 4 lines
Bug #1502805: don't alias file.__exit__ to file.close since the
latter can return something that's true.
........
r46752 | georg.brandl | 2006-06-08 16:50:53 +0200 (Thu, 08 Jun 2006) | 3 lines
Convert test_file to unittest.
........
2006-06-08 12:35:45 -03:00
|
|
|
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__))
|
2003-08-15 10:07:47 -03:00
|
|
|
|
2005-12-29 11:59:19 -04:00
|
|
|
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 in {'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'),
|
2006-03-24 04:14:36 -04:00
|
|
|
('__truediv__', 'x / y', None),
|
|
|
|
('__floordiv__', 'x // y', None),
|
2005-12-29 11:59:19 -04:00
|
|
|
('__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'),
|
|
|
|
('__coerce__', 'coerce(x, y)', None)]:
|
|
|
|
if name == '__coerce__':
|
|
|
|
rname = name
|
|
|
|
else:
|
|
|
|
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)
|
|
|
|
|
2001-09-20 18:39:07 -03:00
|
|
|
def test_main():
|
2003-05-29 11:26:57 -03:00
|
|
|
weakref_segfault() # Must be first, somehow
|
2002-05-24 18:40:08 -03:00
|
|
|
do_this_first()
|
2001-10-04 02:27:00 -03:00
|
|
|
class_docstrings()
|
2001-08-02 01:15:00 -03:00
|
|
|
lists()
|
|
|
|
dicts()
|
2001-09-02 05:22:48 -03:00
|
|
|
dict_constructor()
|
2001-09-03 02:47:38 -03:00
|
|
|
test_dir()
|
2001-08-02 01:15:00 -03:00
|
|
|
ints()
|
|
|
|
longs()
|
|
|
|
floats()
|
|
|
|
complexes()
|
|
|
|
spamlists()
|
|
|
|
spamdicts()
|
|
|
|
pydicts()
|
|
|
|
pylists()
|
|
|
|
metaclass()
|
|
|
|
pymods()
|
|
|
|
multi()
|
2002-11-25 17:38:52 -04:00
|
|
|
mro_disagreement()
|
2001-08-02 01:15:00 -03:00
|
|
|
diamond()
|
2002-11-14 15:50:14 -04:00
|
|
|
ex5()
|
|
|
|
monotonicity()
|
|
|
|
consistency_with_epg()
|
2001-08-09 16:45:21 -03:00
|
|
|
objects()
|
2001-08-02 01:15:00 -03:00
|
|
|
slots()
|
2002-08-13 15:26:26 -03:00
|
|
|
slotspecials()
|
2001-08-02 01:15:00 -03:00
|
|
|
dynamics()
|
|
|
|
errors()
|
|
|
|
classmethods()
|
2002-03-28 11:49:54 -04:00
|
|
|
classmethods_in_c()
|
2001-08-02 01:15:00 -03:00
|
|
|
staticmethods()
|
2002-03-28 11:49:54 -04:00
|
|
|
staticmethods_in_c()
|
2001-08-02 01:15:00 -03:00
|
|
|
classic()
|
|
|
|
compattr()
|
|
|
|
newslot()
|
|
|
|
altmro()
|
|
|
|
overloading()
|
2001-08-15 14:51:17 -03:00
|
|
|
methods()
|
2001-08-15 20:57:59 -03:00
|
|
|
specials()
|
2001-08-17 18:27:53 -03:00
|
|
|
weakrefs()
|
2001-09-06 18:56:42 -03:00
|
|
|
properties()
|
2001-08-24 13:55:27 -03:00
|
|
|
supers()
|
2001-08-30 17:06:08 -03:00
|
|
|
inherits()
|
2001-09-13 16:33:07 -03:00
|
|
|
keywords()
|
2001-09-13 18:01:29 -03:00
|
|
|
restricted()
|
2001-09-13 21:25:33 -03:00
|
|
|
str_subclass_as_dict_key()
|
2001-09-18 17:38:53 -03:00
|
|
|
classic_comparisons()
|
2001-09-18 18:06:04 -03:00
|
|
|
rich_comparisons()
|
2001-09-18 22:25:16 -03:00
|
|
|
coercions()
|
2001-09-20 18:49:53 -03:00
|
|
|
descrdoc()
|
2001-09-25 00:43:42 -03:00
|
|
|
setclass()
|
2001-10-26 01:26:12 -03:00
|
|
|
setdict()
|
2001-09-25 13:25:58 -03:00
|
|
|
pickles()
|
2001-09-28 15:13:29 -03:00
|
|
|
copies()
|
2001-09-28 20:49:48 -03:00
|
|
|
binopoverride()
|
2001-10-11 15:33:53 -03:00
|
|
|
subclasspropagation()
|
2001-10-11 23:38:24 -03:00
|
|
|
buffer_inherit()
|
2001-10-16 17:18:24 -03:00
|
|
|
str_of_str_subclass()
|
2001-10-21 21:43:43 -03:00
|
|
|
kwdargs()
|
2001-10-29 22:33:02 -04:00
|
|
|
delhook()
|
2001-12-03 12:32:18 -04:00
|
|
|
hashinherit()
|
2001-12-11 00:37:34 -04:00
|
|
|
strops()
|
2001-12-28 17:39:03 -04:00
|
|
|
deepcopyrecursive()
|
2002-03-12 16:43:31 -04:00
|
|
|
modules()
|
2002-03-25 14:36:32 -04:00
|
|
|
dictproxyiterkeys()
|
|
|
|
dictproxyitervalues()
|
|
|
|
dictproxyiteritems()
|
2002-03-14 19:05:54 -04:00
|
|
|
pickleslots()
|
2002-04-05 21:05:01 -04:00
|
|
|
funnynew()
|
2002-04-16 13:44:51 -03:00
|
|
|
imulbug()
|
2002-04-17 21:27:33 -03:00
|
|
|
docdescriptor()
|
2002-06-06 14:53:03 -03:00
|
|
|
copy_setstate()
|
2002-06-13 16:17:46 -03:00
|
|
|
slices()
|
2002-07-11 03:56:07 -03:00
|
|
|
subtype_resurrection()
|
2002-08-06 18:28:28 -03:00
|
|
|
slottrash()
|
2002-08-13 14:16:49 -03:00
|
|
|
slotmultipleinheritance()
|
2002-08-09 13:11:37 -03:00
|
|
|
testrmul()
|
2002-10-14 22:01:53 -03:00
|
|
|
testipow()
|
2002-11-27 11:20:19 -04:00
|
|
|
test_mutable_bases()
|
|
|
|
test_mutable_bases_with_failing_mro()
|
|
|
|
test_mutable_bases_catch_mro_conflict()
|
2002-11-26 10:47:27 -04:00
|
|
|
mutable_names()
|
2003-01-06 19:00:59 -04:00
|
|
|
subclass_right_op()
|
2003-01-07 09:41:37 -04:00
|
|
|
dict_type_with_metaclass()
|
2003-02-11 14:44:42 -04:00
|
|
|
meth_class_get()
|
2003-02-11 23:32:58 -04:00
|
|
|
isinst_isclass()
|
2003-02-11 23:58:38 -04:00
|
|
|
proxysuper()
|
2003-04-15 17:05:10 -03:00
|
|
|
carloverre()
|
2003-06-29 12:44:07 -03:00
|
|
|
filefault()
|
2003-08-15 10:07:47 -03:00
|
|
|
vicious_descriptor_nonsense()
|
2005-03-03 12:45:19 -04:00
|
|
|
test_init()
|
2005-11-07 04:38:00 -04:00
|
|
|
methodwrapper()
|
2005-12-29 11:59:19 -04:00
|
|
|
notimplemented()
|
2002-11-27 11:20:19 -04:00
|
|
|
|
2001-09-20 18:39:07 -03:00
|
|
|
if verbose: print "All OK"
|
2001-08-02 01:15:00 -03:00
|
|
|
|
2001-09-20 18:39:07 -03:00
|
|
|
if __name__ == "__main__":
|
|
|
|
test_main()
|