Author: Ronan Lamy <[email protected]>
Branch:
Changeset: r82618:51611a2b96f6
Date: 2016-02-29 22:08 +0000
http://bitbucket.org/pypy/pypy/changeset/51611a2b96f6/
Log: kill dead and/or superseded tests
diff --git a/rpython/rtyper/test/test_rdict.py
b/rpython/rtyper/test/test_rdict.py
--- a/rpython/rtyper/test/test_rdict.py
+++ b/rpython/rtyper/test/test_rdict.py
@@ -14,7 +14,20 @@
from rpython.rlib.rarithmetic import r_int, r_uint, r_longlong, r_ulonglong
import py
-py.log.setconsumer("rtyper", py.log.STDOUT)
+from hypothesis.strategies import builds, sampled_from, binary, just, integers
+from hypothesis.stateful import GenericStateMachine, run_state_machine_as_test
+
+def ann2strategy(s_value):
+ if isinstance(s_value, SomeString):
+ if s_value.can_be_None:
+ return binary() | just(None)
+ else:
+ return binary()
+ elif isinstance(s_value, SomeInteger):
+ return integers(min_value=~sys.maxint, max_value=sys.maxint)
+ else:
+ raise TypeError("Cannot convert annotation %s to a strategy" % s_value)
+
if hasattr(signal, 'alarm'):
@contextmanager
@@ -36,7 +49,6 @@
yield
-
def not_really_random():
"""A random-ish generator, which also generates nice patterns from time to
time.
Could be useful to detect problems associated with specific usage
patterns."""
@@ -1032,28 +1044,6 @@
assert r_AB_dic.lowleveltype == r_BA_dic.lowleveltype
- def test_dict_resize(self):
- py.test.skip("test written for non-ordered dicts, update or kill")
- # XXX we no longer automatically resize on 'del'. We need to
- # hack a bit in this test to trigger a resize by continuing to
- # fill the dict's table while keeping the actual size very low
- # in order to force a resize to shrink the table back
- def func(want_empty):
- d = self.newdict()
- for i in range(rdict.DICT_INITSIZE << 1):
- d[chr(ord('a') + i)] = i
- if want_empty:
- for i in range(rdict.DICT_INITSIZE << 1):
- del d[chr(ord('a') + i)]
- for i in range(rdict.DICT_INITSIZE << 3):
- d[chr(ord('A') - i)] = i
- del d[chr(ord('A') - i)]
- return d
- res = self.interpret(func, [0])
- assert len(res.entries) > rdict.DICT_INITSIZE
- res = self.interpret(func, [1])
- assert len(res.entries) == rdict.DICT_INITSIZE
-
def test_opt_dummykeymarker(self):
def f():
d = {"hello": None}
@@ -1145,170 +1135,6 @@
DICT = lltype.typeOf(llres.item1)
assert sorted(DICT.TO.entries.TO.OF._flds) == ['f_hash', 'key',
'value']
- def test_deleted_entry_reusage_with_colliding_hashes(self):
- py.test.skip("test written for non-ordered dicts, update or kill")
- def lowlevelhash(value):
- p = rstr.mallocstr(len(value))
- for i in range(len(value)):
- p.chars[i] = value[i]
- return rstr.LLHelpers.ll_strhash(p)
-
- def func(c1, c2):
- c1 = chr(c1)
- c2 = chr(c2)
- d = self.newdict()
- d[c1] = 1
- d[c2] = 2
- del d[c1]
- return d[c2]
-
- char_by_hash = {}
- base = rdict.DICT_INITSIZE
- for y in range(0, 256):
- y = chr(y)
- y_hash = lowlevelhash(y) % base
- char_by_hash.setdefault(y_hash, []).append(y)
-
- x, y = char_by_hash[0][:2] # find a collision
-
- res = self.interpret(func, [ord(x), ord(y)])
- assert res == 2
-
- def func2(c1, c2):
- c1 = chr(c1)
- c2 = chr(c2)
- d = self.newdict()
- d[c1] = 1
- d[c2] = 2
- del d[c1]
- d[c1] = 3
- return d
-
- res = self.interpret(func2, [ord(x), ord(y)])
- for i in range(len(res.entries)):
- assert not (res.entries.everused(i) and not res.entries.valid(i))
-
- def func3(c0, c1, c2, c3, c4, c5, c6, c7):
- d = self.newdict()
- c0 = chr(c0) ; d[c0] = 1; del d[c0]
- c1 = chr(c1) ; d[c1] = 1; del d[c1]
- c2 = chr(c2) ; d[c2] = 1; del d[c2]
- c3 = chr(c3) ; d[c3] = 1; del d[c3]
- c4 = chr(c4) ; d[c4] = 1; del d[c4]
- c5 = chr(c5) ; d[c5] = 1; del d[c5]
- c6 = chr(c6) ; d[c6] = 1; del d[c6]
- c7 = chr(c7) ; d[c7] = 1; del d[c7]
- return d
-
- if rdict.DICT_INITSIZE != 8:
- py.test.skip("make dict tests more indepdent from initsize")
- res = self.interpret(func3, [ord(char_by_hash[i][0])
- for i in range(rdict.DICT_INITSIZE)])
- count_frees = 0
- for i in range(len(res.entries)):
- if not res.entries.everused(i):
- count_frees += 1
- assert count_frees >= 3
-
-N_KEYS = 400
-
-def test_stress():
- dictrepr = rdict.DictRepr(None, rint.signed_repr, rint.signed_repr,
- DictKey(None, SomeInteger()),
- DictValue(None, SomeInteger()))
- dictrepr.setup()
- l_dict = rdict.ll_newdict(dictrepr.DICT)
- reference = {}
- value = 0
-
- def check_value(n):
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, n)
- except KeyError:
- n not in reference
- else:
- assert gotvalue == reference[n]
-
- def complete_check():
- for n in range(N_KEYS):
- check_value(n)
-
- for x in not_really_random():
- n = int(x*100.0) # 0 <= x < 400
- op = repr(x)[-1]
- if op <= '2' and n in reference:
- rdict.ll_dict_delitem(l_dict, n)
- del reference[n]
- elif op <= '6':
- rdict.ll_dict_setitem(l_dict, n, value)
- reference[n] = value
- value += 1
- else:
- check_value(n)
- if 1.38 <= x <= 1.39:
- complete_check()
- print 'current dict length:', len(reference)
- assert l_dict.num_items == len(reference)
- complete_check()
-
-
[email protected]('key_can_be_none', [True, False])
[email protected]('value_can_be_none', [True, False])
-def test_stress_2(key_can_be_none, value_can_be_none):
- class PseudoRTyper:
- cache_dummy_values = {}
- dictrepr = rdict.DictRepr(PseudoRTyper(), string_repr, string_repr,
- DictKey(None, SomeString(key_can_be_none)),
- DictValue(None, SomeString(value_can_be_none)))
- dictrepr.setup()
- l_dict = rdict.ll_newdict(dictrepr.DICT)
- reference = {}
- values = not_really_random()
- keytable = [string_repr.convert_const("foo%d" % n) for n in range(N_KEYS)]
-
- def check_value(n):
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, keytable[n])
- except KeyError:
- assert n not in reference
- else:
- assert gotvalue == reference[n]
-
- def complete_check():
- for n in range(N_KEYS):
- check_value(n)
-
- for x in not_really_random():
- n = int(x*100.0) # 0 <= x < 400
- op = repr(x)[-1]
- if op <= '2' and n in reference:
- rdict.ll_dict_delitem(l_dict, keytable[n])
- del reference[n]
- elif op <= '6':
- ll_value = string_repr.convert_const(str(values.next()))
- rdict.ll_dict_setitem(l_dict, keytable[n], ll_value)
- reference[n] = ll_value
- else:
- check_value(n)
- if 1.38 <= x <= 1.39:
- complete_check()
- print 'current dict length:', len(reference)
- assert l_dict.num_items == len(reference)
- complete_check()
-
-from hypothesis.strategies import builds, sampled_from, binary, just, integers
-from hypothesis.stateful import GenericStateMachine, run_state_machine_as_test
-
-def ann2strategy(s_value):
- if isinstance(s_value, SomeString):
- if s_value.can_be_None:
- return binary() | just(None)
- else:
- return binary()
- elif isinstance(s_value, SomeInteger):
- return integers(min_value=~sys.maxint, max_value=sys.maxint)
- else:
- raise TypeError("Cannot convert annotation %s to a strategy" % s_value)
class Action(object):
_______________________________________________
pypy-commit mailing list
[email protected]
https://mail.python.org/mailman/listinfo/pypy-commit
