/pypy/rpython/test/test_rdict.py
Python | 1070 lines | 1057 code | 11 blank | 2 comment | 6 complexity | abab77ce4d6edd247552229d4914b89a MD5 | raw file
Possible License(s): AGPL-3.0, BSD-3-Clause, Apache-2.0
- from pypy.translator.translator import TranslationContext
- from pypy.rpython.lltypesystem import lltype, rffi
- from pypy.rpython import rint
- from pypy.rpython.lltypesystem import rdict, rstr
- from pypy.rpython.test.tool import BaseRtypingTest, LLRtypeMixin, OORtypeMixin
- from pypy.rlib.objectmodel import r_dict
- from pypy.rlib.rarithmetic import r_int, r_uint, r_longlong, r_ulonglong
- import py
- py.log.setconsumer("rtyper", py.log.STDOUT)
- 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."""
- import random
- x = random.random()
- print 'random seed: %r' % (x,)
- for i in range(12000):
- r = 3.4 + i/20000.0
- x = r*x - x*x
- assert 0 <= x < 4
- yield x
- class BaseTestRdict(BaseRtypingTest):
- def test_dict_creation(self):
- def createdict(i):
- d = {'hello' : i}
- return d['hello']
- res = self.interpret(createdict, [42])
- assert res == 42
- def test_dict_getitem_setitem(self):
- def func(i):
- d = {'hello' : i}
- d['world'] = i + 1
- return d['hello'] * d['world']
- res = self.interpret(func, [6])
- assert res == 42
- def test_dict_getitem_keyerror(self):
- def func(i):
- d = {'hello' : i}
- try:
- return d['world']
- except KeyError:
- return 0
- res = self.interpret(func, [6])
- assert res == 0
- def test_dict_del_simple(self):
- def func(i):
- d = {'hello' : i}
- d['world'] = i + 1
- del d['hello']
- return len(d)
- res = self.interpret(func, [6])
- assert res == 1
- def test_dict_clear(self):
- def func(i):
- d = {'abc': i}
- d['def'] = i+1
- d.clear()
- d['ghi'] = i+2
- return ('abc' not in d and 'def' not in d
- and d['ghi'] == i+2 and len(d) == 1)
- res = self.interpret(func, [7])
- assert res == True
- def test_empty_strings(self):
- def func(i):
- d = {'' : i}
- del d['']
- try:
- d['']
- return 0
- except KeyError:
- pass
- return 1
- res = self.interpret(func, [6])
- assert res == 1
- def func(i):
- d = {'' : i}
- del d['']
- d[''] = i + 1
- return len(d)
- res = self.interpret(func, [6])
- assert res == 1
- def test_dict_is_true(self):
- def func(i):
- if i:
- d = {}
- else:
- d = {i: i+1}
- if d:
- return i
- else:
- return i+1
- assert self.interpret(func, [42]) == 43
- assert self.interpret(func, [0]) == 0
- def test_contains(self):
- def func(x, y):
- d = {x: x+1}
- return y in d
- assert self.interpret(func, [42, 0]) == False
- assert self.interpret(func, [42, 42]) == True
- def test_dict_iteration(self):
- def func(i, j):
- d = {}
- d['hello'] = i
- d['world'] = j
- k = 1
- for key in d:
- k = k * d[key]
- return k
- res = self.interpret(func, [6, 7])
- assert res == 42
- def test_dict_itermethods(self):
- def func():
- d = {}
- d['hello'] = 6
- d['world'] = 7
- k1 = k2 = k3 = 1
- for key in d.iterkeys():
- k1 = k1 * d[key]
- for value in d.itervalues():
- k2 = k2 * value
- for key, value in d.iteritems():
- assert d[key] == value
- k3 = k3 * value
- return k1 + k2 + k3
- res = self.interpret(func, [])
- assert res == 42 + 42 + 42
- def test_two_dicts_with_different_value_types(self):
- def func(i):
- d1 = {}
- d1['hello'] = i + 1
- d2 = {}
- d2['world'] = d1
- return d2['world']['hello']
- res = self.interpret(func, [5])
- assert res == 6
- def test_dict_get(self):
- def func():
- dic = {}
- x1 = dic.get('hi', 42)
- dic['blah'] = 1 # XXX this triggers type determination
- x2 = dic.get('blah', 2)
- return x1 * 10 + x2
- res = self.interpret(func, ())
- assert res == 421
- def test_dict_get_empty(self):
- def func():
- # this time without writing to the dict
- dic = {}
- x1 = dic.get('hi', 42)
- x2 = dic.get('blah', 2)
- return x1 * 10 + x2
- res = self.interpret(func, ())
- assert res == 422
- def test_dict_setdefault(self):
- def f():
- d = {}
- d.setdefault('a', 2)
- return d['a']
- res = self.interpret(f, ())
- assert res == 2
- def f():
- d = {}
- d.setdefault('a', 2)
- x = d.setdefault('a', -3)
- return x
- res = self.interpret(f, ())
- assert res == 2
- def test_dict_copy(self):
- def func():
- # XXX this does not work if we use chars, only!
- dic = {'ab':1, 'b':2}
- d2 = dic.copy()
- ok = 1
- for key in d2:
- if dic[key] != d2[key]:
- ok = 0
- ok &= len(dic) == len(d2)
- d2['c'] = 3
- ok &= len(dic) == len(d2) - 1
- return ok
- res = self.interpret(func, ())
- assert res == 1
- def test_dict_update(self):
- def func():
- dic = {'ab':1000, 'b':200}
- d2 = {'b':30, 'cb':4}
- dic.update(d2)
- ok = len(dic) == 3
- sum = ok
- for key in dic:
- sum += dic[key]
- return sum
- res = self.interpret(func, ())
- assert res == 1035
- def test_dict_keys(self):
- def func():
- dic = {' 4':1000, ' 8':200}
- keys = dic.keys()
- return ord(keys[0][1]) + ord(keys[1][1]) - 2*ord('0') + len(keys)
- res = self.interpret(func, ())#, view=True)
- assert res == 14
- def test_dict_inst_keys(self):
- class Empty:
- pass
- class A(Empty):
- pass
- def func():
- dic0 = {Empty(): 2}
- dic = {A(): 1, A(): 2}
- keys = dic.keys()
- return (isinstance(keys[1], A))*2+(isinstance(keys[0],A))
- res = self.interpret(func, [])
- assert res == 3
- def test_dict_inst_iterkeys(self):
- class Empty:
- pass
- class A(Empty):
- pass
- def func():
- dic0 = {Empty(): 2}
- dic = {A(): 1, A(): 2}
- a = 0
- for k in dic.iterkeys():
- a += isinstance(k, A)
- return a
- res = self.interpret(func, [])
- assert res == 2
- def test_dict_values(self):
- def func():
- dic = {' 4':1000, ' 8':200}
- values = dic.values()
- return values[0] + values[1] + len(values)
- res = self.interpret(func, ())
- assert res == 1202
- def test_dict_inst_values(self):
- class A:
- pass
- def func():
- dic = {1: A(), 2: A()}
- vals = dic.values()
- return (isinstance(vals[1], A))*2+(isinstance(vals[0],A))
- res = self.interpret(func, [])
- assert res == 3
- def test_dict_inst_itervalues(self):
- class A:
- pass
- def func():
- dic = {1: A(), 2: A()}
- a = 0
- for v in dic.itervalues():
- a += isinstance(v, A)
- return a
- res = self.interpret(func, [])
- assert res == 2
- def test_dict_inst_items(self):
- class Empty:
- pass
- class A:
- pass
- class B(Empty):
- pass
- def func():
- dic0 = {Empty(): 2}
- dic = {B(): A(), B(): A()}
- items = dic.items()
- b = 0
- a = 0
- for k, v in items:
- b += isinstance(k, B)
- a += isinstance(v, A)
- return 3*b+a
- res = self.interpret(func, [])
- assert res == 8
- def test_dict_inst_iteritems(self):
- class Empty:
- pass
- class A:
- pass
- class B(Empty):
- pass
- def func():
- dic0 = {Empty(): 2}
- dic = {B(): A(), B(): A()}
- b = 0
- a = 0
- for k, v in dic.iteritems():
- b += isinstance(k, B)
- a += isinstance(v, A)
- return 3*b+a
- res = self.interpret(func, [])
- assert res == 8
- def test_dict_items(self):
- def func():
- dic = {' 4':1000, ' 8':200}
- items = dic.items()
- res = len(items)
- for key, value in items:
- res += ord(key[1]) - ord('0') + value
- return res
- res = self.interpret(func, ())
- assert res == 1214
- def test_dict_contains(self):
- def func():
- dic = {' 4':1000, ' 8':200}
- return ' 4' in dic and ' 9' not in dic
- res = self.interpret(func, ())
- assert res is True
- def test_dict_contains_with_constant_dict(self):
- dic = {'4':1000, ' 8':200}
- def func(i):
- return chr(i) in dic
- res = self.interpret(func, [ord('4')])
- assert res is True
- res = self.interpret(func, [1])
- assert res is False
- def test_dict_or_none(self):
- class A:
- pass
- def negate(d):
- return not d
- def func(n):
- a = A()
- a.d = None
- if n > 0:
- a.d = {str(n): 1, "42": 2}
- del a.d["42"]
- return negate(a.d)
- res = self.interpret(func, [10])
- assert res is False
- res = self.interpret(func, [0])
- assert res is True
- res = self.interpret(func, [42])
- assert res is True
- def test_int_dict(self):
- def func(a, b):
- dic = {12: 34}
- dic[a] = 1000
- return dic.get(b, -123)
- res = self.interpret(func, [12, 12])
- assert res == 1000
- res = self.interpret(func, [12, 13])
- assert res == -123
- res = self.interpret(func, [524, 12])
- assert res == 34
- res = self.interpret(func, [524, 524])
- assert res == 1000
- res = self.interpret(func, [524, 1036])
- assert res == -123
- def test_id_instances_keys(self):
- class A:
- pass
- class B(A):
- pass
- def f():
- a = A()
- b = B()
- d = {}
- d[b] = 7
- d[a] = 3
- return len(d) + d[a] + d[b]
- res = self.interpret(f, [])
- assert res == 12
- def test_captured_get(self):
- get = {1:2}.get
- def f():
- return get(1, 3)+get(2, 4)
- res = self.interpret(f, [])
- assert res == 6
- def g(h):
- return h(1, 3)
- def f():
- return g(get)
- res = self.interpret(f, [])
- assert res == 2
- def test_specific_obscure_bug(self):
- class A: pass
- class B: pass # unrelated kinds of instances
- def f():
- lst = [A()]
- res1 = A() in lst
- d2 = {B(): None, B(): None}
- return res1+len(d2)
- res = self.interpret(f, [])
- assert res == 2
- def test_type_erase(self):
- class A(object):
- pass
- class B(object):
- pass
- def f():
- return {A(): B()}, {B(): A()}
- t = TranslationContext()
- s = t.buildannotator().build_types(f, [])
- rtyper = t.buildrtyper()
- rtyper.specialize()
- s_AB_dic = s.items[0]
- s_BA_dic = s.items[1]
- r_AB_dic = rtyper.getrepr(s_AB_dic)
- r_BA_dic = rtyper.getrepr(s_AB_dic)
- assert r_AB_dic.lowleveltype == r_BA_dic.lowleveltype
- def test_tuple_dict(self):
- def f(i):
- d = {}
- d[(1, 4.5, (str(i), 2), 2)] = 4
- d[(1, 4.5, (str(i), 2), 3)] = 6
- return d[(1, 4.5, (str(i), 2), i)]
- res = self.interpret(f, [2])
- assert res == f(2)
- def test_dict_of_dict(self):
- def f(n):
- d = {}
- d[5] = d
- d[6] = {}
- return len(d[n])
- res = self.interpret(f, [5])
- assert res == 2
- res = self.interpret(f, [6])
- assert res == 0
- def test_access_in_try(self):
- def f(d):
- try:
- return d[2]
- except ZeroDivisionError:
- return 42
- return -1
- def g(n):
- d = {1: n, 2: 2*n}
- return f(d)
- res = self.interpret(g, [3])
- assert res == 6
- def test_access_in_try_set(self):
- def f(d):
- try:
- d[2] = 77
- except ZeroDivisionError:
- return 42
- return -1
- def g(n):
- d = {1: n}
- f(d)
- return d[2]
- res = self.interpret(g, [3])
- assert res == 77
- def test_r_dict(self):
- class FooError(Exception):
- pass
- def myeq(n, m):
- return n == m
- def myhash(n):
- if n < 0:
- raise FooError
- return -n
- def f(n):
- d = r_dict(myeq, myhash)
- for i in range(10):
- d[i] = i*i
- try:
- value1 = d[n]
- except FooError:
- value1 = 99
- try:
- value2 = n in d
- except FooError:
- value2 = 99
- try:
- value3 = d[-n]
- except FooError:
- value3 = 99
- try:
- value4 = (-n) in d
- except FooError:
- value4 = 99
- return (value1 * 1000000 +
- value2 * 10000 +
- value3 * 100 +
- value4)
- res = self.interpret(f, [5])
- assert res == 25019999
- def test_resize_during_iteration(self):
- def func():
- d = {5: 1, 6: 2, 7: 3}
- try:
- for key, value in d.iteritems():
- d[key^16] = value*2
- except RuntimeError:
- pass
- total = 0
- for key in d:
- total += key
- return total
- res = self.interpret(func, [])
- assert 5 + 6 + 7 <= res <= 5 + 6 + 7 + (5^16) + (6^16) + (7^16)
- def test_change_during_iteration(self):
- def func():
- d = {'a': 1, 'b': 2}
- for key in d:
- d[key] = 42
- return d['a']
- assert self.interpret(func, []) == 42
- def test_dict_of_floats(self):
- d = {3.0: 42, 3.1: 43, 3.2: 44, 3.3: 45, 3.4: 46}
- def fn(f):
- return d[f]
- res = self.interpret(fn, [3.0])
- assert res == 42
- def test_dict_of_r_uint(self):
- for r_t in [r_uint, r_longlong, r_ulonglong]:
- if r_t is r_int:
- continue # for 64-bit platforms: skip r_longlong
- d = {r_t(2): 3, r_t(4): 5}
- def fn(x, y):
- d[r_t(x)] = 123
- return d[r_t(y)]
- res = self.interpret(fn, [4, 2])
- assert res == 3
- res = self.interpret(fn, [3, 3])
- assert res == 123
- def test_dict_popitem(self):
- def func():
- d = {}
- d[5] = 2
- d[6] = 3
- k1, v1 = d.popitem()
- assert len(d) == 1
- k2, v2 = d.popitem()
- try:
- d.popitem()
- except KeyError:
- pass
- else:
- assert 0, "should have raised KeyError"
- assert len(d) == 0
- return k1*1000 + v1*100 + k2*10 + v2
- res = self.interpret(func, [])
- assert res in [5263, 6352]
- def test_dict_popitem_hash(self):
- def deq(n, m):
- return n == m
- def dhash(n):
- return ~n
- def func():
- d = r_dict(deq, dhash)
- d[5] = 2
- d[6] = 3
- k1, v1 = d.popitem()
- assert len(d) == 1
- k2, v2 = d.popitem()
- try:
- d.popitem()
- except KeyError:
- pass
- else:
- assert 0, "should have raised KeyError"
- assert len(d) == 0
- return k1*1000 + v1*100 + k2*10 + v2
- res = self.interpret(func, [])
- assert res in [5263, 6352]
- def test_dict_pop(self):
- def f(n, default):
- d = {}
- d[2] = 3
- d[4] = 5
- if default == -1:
- try:
- x = d.pop(n)
- except KeyError:
- x = -1
- else:
- x = d.pop(n, default)
- return x * 10 + len(d)
- res = self.interpret(f, [2, -1])
- assert res == 31
- res = self.interpret(f, [3, -1])
- assert res == -8
- res = self.interpret(f, [2, 5])
- assert res == 31
- def test_dict_pop_instance(self):
- class A(object):
- pass
- def f(n):
- d = {}
- d[2] = A()
- x = d.pop(n, None)
- if x is None:
- return 12
- else:
- return 15
- res = self.interpret(f, [2])
- assert res == 15
- res = self.interpret(f, [700])
- assert res == 12
- class TestLLtype(BaseTestRdict, LLRtypeMixin):
- def test_dict_but_not_with_char_keys(self):
- def func(i):
- d = {'h': i}
- try:
- return d['hello']
- except KeyError:
- return 0
- res = self.interpret(func, [6])
- assert res == 0
- def test_deleted_entry_reusage_with_colliding_hashes(self):
- 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 = {}
- 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 = {}
- 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 = {}
- 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
- def test_dict_resize(self):
- def func(want_empty):
- d = {}
- for i in range(rdict.DICT_INITSIZE):
- d[chr(ord('a') + i)] = i
- if want_empty:
- for i in range(rdict.DICT_INITSIZE):
- 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_dict_valid_resize(self):
- # see if we find our keys after resize
- def func():
- d = {}
- # fill it up
- for i in range(10):
- d[str(i)] = 0
- # delete again
- for i in range(10):
- del d[str(i)]
- res = 0
- # if it does not crash, we are fine. It crashes if you forget the hash field.
- self.interpret(func, [])
- # ____________________________________________________________
- def test_opt_nullkeymarker(self):
- def f():
- d = {"hello": None}
- d["world"] = None
- return "hello" in d, d
- res = self.interpret(f, [])
- assert res.item0 == True
- DICT = lltype.typeOf(res.item1).TO
- assert not hasattr(DICT.entries.TO.OF, 'f_everused')# non-None string keys
- assert not hasattr(DICT.entries.TO.OF, 'f_valid') # strings have a dummy
- def test_opt_nullvaluemarker(self):
- def f(n):
- d = {-5: "abcd"}
- d[123] = "def"
- return len(d[n]), d
- res = self.interpret(f, [-5])
- assert res.item0 == 4
- DICT = lltype.typeOf(res.item1).TO
- assert not hasattr(DICT.entries.TO.OF, 'f_everused')# non-None str values
- assert not hasattr(DICT.entries.TO.OF, 'f_valid') # strs have a dummy
- def test_opt_nonullmarker(self):
- class A:
- pass
- def f(n):
- if n > 5:
- a = A()
- else:
- a = None
- d = {a: -5441}
- d[A()] = n+9872
- return d[a], d
- res = self.interpret(f, [-5])
- assert res.item0 == -5441
- DICT = lltype.typeOf(res.item1).TO
- assert hasattr(DICT.entries.TO.OF, 'f_everused') # can-be-None A instances
- assert not hasattr(DICT.entries.TO.OF, 'f_valid')# with a dummy A instance
- res = self.interpret(f, [6])
- assert res.item0 == -5441
- def test_opt_nonnegint_dummy(self):
- def f(n):
- d = {n: 12}
- d[-87] = 24
- del d[n]
- return len(d.copy()), d[-87], d
- res = self.interpret(f, [5])
- assert res.item0 == 1
- assert res.item1 == 24
- DICT = lltype.typeOf(res.item2).TO
- assert hasattr(DICT.entries.TO.OF, 'f_everused') # all ints can be zero
- assert not hasattr(DICT.entries.TO.OF, 'f_valid')# nonneg int: dummy -1
- def test_opt_no_dummy(self):
- def f(n):
- d = {n: 12}
- d[-87] = -24
- del d[n]
- return len(d.copy()), d[-87], d
- res = self.interpret(f, [5])
- assert res.item0 == 1
- assert res.item1 == -24
- DICT = lltype.typeOf(res.item2).TO
- assert hasattr(DICT.entries.TO.OF, 'f_everused') # all ints can be zero
- assert hasattr(DICT.entries.TO.OF, 'f_valid') # no dummy available
- def test_opt_boolean_has_no_dummy(self):
- def f(n):
- d = {n: True}
- d[-87] = True
- del d[n]
- return len(d.copy()), d[-87], d
- res = self.interpret(f, [5])
- assert res.item0 == 1
- assert res.item1 is True
- DICT = lltype.typeOf(res.item2).TO
- assert hasattr(DICT.entries.TO.OF, 'f_everused') # all ints can be zero
- assert hasattr(DICT.entries.TO.OF, 'f_valid') # no dummy available
- def test_opt_multiple_identical_dicts(self):
- def f(n):
- s = "x" * n
- d1 = {s: 12}
- d2 = {s: 24}
- d3 = {s: 36}
- d1["a"] = d2[s] # 24
- d3[s] += d1["a"] # 60
- d2["bc"] = d3[s] # 60
- return d2["bc"], d1, d2, d3
- res = self.interpret(f, [5])
- assert res.item0 == 60
- # all three dicts should use the same low-level type
- assert lltype.typeOf(res.item1) == lltype.typeOf(res.item2)
- assert lltype.typeOf(res.item1) == lltype.typeOf(res.item3)
- def test_dict_of_addresses(self):
- from pypy.rpython.lltypesystem import llmemory
- TP = lltype.Struct('x')
- a = lltype.malloc(TP, flavor='raw', immortal=True)
- b = lltype.malloc(TP, flavor='raw', immortal=True)
- def func(i):
- d = {}
- d[llmemory.cast_ptr_to_adr(a)] = 123
- d[llmemory.cast_ptr_to_adr(b)] = 456
- if i > 5:
- key = llmemory.cast_ptr_to_adr(a)
- else:
- key = llmemory.cast_ptr_to_adr(b)
- return d[key]
- assert self.interpret(func, [3]) == 456
- def test_prebuilt_list_of_addresses(self):
- from pypy.rpython.lltypesystem import llmemory
- TP = lltype.Struct('x', ('y', lltype.Signed))
- a = lltype.malloc(TP, flavor='raw', immortal=True)
- b = lltype.malloc(TP, flavor='raw', immortal=True)
- c = lltype.malloc(TP, flavor='raw', immortal=True)
- a_a = llmemory.cast_ptr_to_adr(a)
- a0 = llmemory.cast_ptr_to_adr(a)
- assert a_a is not a0
- assert a_a == a0
- a_b = llmemory.cast_ptr_to_adr(b)
- a_c = llmemory.cast_ptr_to_adr(c)
- d = {a_a: 3, a_b: 4, a_c: 5}
- d[a0] = 8
- def func(i):
- if i == 0:
- ptr = a
- else:
- ptr = b
- return d[llmemory.cast_ptr_to_adr(ptr)]
- py.test.raises(TypeError, self.interpret, func, [0])
- def test_dict_of_voidp(self):
- def func():
- d = {}
- handle = lltype.nullptr(rffi.VOIDP.TO)
- # Use a negative key, so the dict implementation uses
- # the value as a marker for empty entries
- d[-1] = handle
- return len(d)
- assert self.interpret(func, []) == 1
- from pypy.translator.c.test.test_genc import compile
- f = compile(func, [])
- res = f()
- assert res == 1
- def test_nonnull_hint(self):
- def eq(a, b):
- return a == b
- def rhash(a):
- return 3
- def func(i):
- d = r_dict(eq, rhash, force_non_null=True)
- if not i:
- d[None] = i
- else:
- d[str(i)] = i
- return "12" in d, d
- llres = self.interpret(func, [12])
- assert llres.item0 == 1
- DICT = lltype.typeOf(llres.item1)
- assert sorted(DICT.TO.entries.TO.OF._flds) == ['f_hash', 'key', 'value']
- # ____________________________________________________________
- class TestOOtype(BaseTestRdict, OORtypeMixin):
- def test_recursive(self):
- def func(i):
- dic = {i: {}}
- dic[i] = dic
- return dic[i]
- res = self.interpret(func, [5])
- assert res.ll_get(5) is res
- # ____________________________________________________________
- class TestStress:
- def test_stress(self):
- from pypy.annotation.dictdef import DictKey, DictValue
- from pypy.annotation import model as annmodel
- dictrepr = rdict.DictRepr(None, rint.signed_repr, rint.signed_repr,
- DictKey(None, annmodel.SomeInteger()),
- DictValue(None, annmodel.SomeInteger()))
- dictrepr.setup()
- l_dict = rdict.ll_newdict(dictrepr.DICT)
- referencetable = [None] * 400
- referencelength = 0
- value = 0
- def complete_check():
- for n, refvalue in zip(range(len(referencetable)), referencetable):
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, n)
- except KeyError:
- assert refvalue is None
- else:
- assert gotvalue == refvalue
- for x in not_really_random():
- n = int(x*100.0) # 0 <= x < 400
- op = repr(x)[-1]
- if op <= '2' and referencetable[n] is not None:
- rdict.ll_dict_delitem(l_dict, n)
- referencetable[n] = None
- referencelength -= 1
- elif op <= '6':
- rdict.ll_dict_setitem(l_dict, n, value)
- if referencetable[n] is None:
- referencelength += 1
- referencetable[n] = value
- value += 1
- else:
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, n)
- except KeyError:
- assert referencetable[n] is None
- else:
- assert gotvalue == referencetable[n]
- if 1.38 <= x <= 1.39:
- complete_check()
- print 'current dict length:', referencelength
- assert l_dict.num_items == referencelength
- complete_check()
- def test_stress_2(self):
- yield self.stress_combination, True, False
- yield self.stress_combination, False, True
- yield self.stress_combination, False, False
- yield self.stress_combination, True, True
- def stress_combination(self, key_can_be_none, value_can_be_none):
- from pypy.rpython.lltypesystem.rstr import string_repr
- from pypy.annotation.dictdef import DictKey, DictValue
- from pypy.annotation import model as annmodel
- print
- print "Testing combination with can_be_None: keys %s, values %s" % (
- key_can_be_none, value_can_be_none)
- class PseudoRTyper:
- cache_dummy_values = {}
- dictrepr = rdict.DictRepr(PseudoRTyper(), string_repr, string_repr,
- DictKey(None, annmodel.SomeString(key_can_be_none)),
- DictValue(None, annmodel.SomeString(value_can_be_none)))
- dictrepr.setup()
- print dictrepr.lowleveltype
- for key, value in dictrepr.DICTENTRY._adtmeths.items():
- print ' %s = %s' % (key, value)
- l_dict = rdict.ll_newdict(dictrepr.DICT)
- referencetable = [None] * 400
- referencelength = 0
- values = not_really_random()
- keytable = [string_repr.convert_const("foo%d" % n)
- for n in range(len(referencetable))]
- def complete_check():
- for n, refvalue in zip(range(len(referencetable)), referencetable):
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, keytable[n])
- except KeyError:
- assert refvalue is None
- else:
- assert gotvalue == refvalue
- for x in not_really_random():
- n = int(x*100.0) # 0 <= x < 400
- op = repr(x)[-1]
- if op <= '2' and referencetable[n] is not None:
- rdict.ll_dict_delitem(l_dict, keytable[n])
- referencetable[n] = None
- referencelength -= 1
- elif op <= '6':
- ll_value = string_repr.convert_const(str(values.next()))
- rdict.ll_dict_setitem(l_dict, keytable[n], ll_value)
- if referencetable[n] is None:
- referencelength += 1
- referencetable[n] = ll_value
- else:
- try:
- gotvalue = rdict.ll_dict_getitem(l_dict, keytable[n])
- except KeyError:
- assert referencetable[n] is None
- else:
- assert gotvalue == referencetable[n]
- if 1.38 <= x <= 1.39:
- complete_check()
- print 'current dict length:', referencelength
- assert l_dict.num_items == referencelength
- complete_check()