def update(n):
o = OrderedDict()
o[3] = 4
v = OrderedDict()
v[n] = 5
o.update(v)
return o[3]
def merge_dicts(n):
if n:
o = OrderedDict()
o[5] = 10
else:
o = OrderedDict()
o[2] = 20
o[3] = 30
return o[3]
def f(n):
d = OrderedDict()
while n > 0:
jd.jit_merge_point()
if n % 10 == 0:
n -= len(d)
d = OrderedDict()
d["a"] = n
n -= 1
return len(d)
def pop_keyerror(n):
o = OrderedDict()
o[3] = 4
try:
return o.pop(n)
except KeyError:
return 500
def delitem(n):
o = OrderedDict()
o[2] = 3
o[3] = 4
del o[n]
vals = o.values()
return vals[0] * 10 + len(vals)
def popitem(n):
o = OrderedDict()
if n:
o[n] = n
try:
key, val = o.popitem()
except KeyError:
return 400
else:
return key * 10 + val
def iteritems(n):
o = OrderedDict()
o[0] = 10
o[2] = 15
o[3] = 12
r = []
for k, v in o.iteritems():
r.append((k, v))
p = r[n]
return p[0] * 100 + p[1]
def create():
OrderedDict()
return 0
def truthy(n):
o = OrderedDict()
if n:
o[n] = n
return bool(o)
def clear():
o = OrderedDict()
o[3] = 4
o.clear()
return len(o)
def keys(n):
o = OrderedDict()
o[4] = 1
o[5] = 2
o[4] = 2
return o.keys()[n]
def custom_eq_hash(n):
o = OrderedDict(Simple.eq, Simple.hash)
o[Simple(n)] = 23
return o[Simple(n)]
def pop(n):
o = OrderedDict()
o[1] = 12
o[2] = 3
return (o.pop(n) * 10) + len(o)
def contains(n):
o = OrderedDict()
o[4] = 5
return n in o
def iteritems_next_method(n):
o = OrderedDict()
o[n] = 5
it = o.iteritems()
return it.next()[1]
def get(n):
o = OrderedDict()
o[4] = 3
return o.get(n, 123)
def keys_object(n):
o = OrderedDict()
o[Simple(1)] = None
o[Simple(2)] = None
o[Simple(3)] = None
return o.keys()[n].x
def values(n):
o = OrderedDict()
o[4] = 1
o[5] = 2
o[4] = 3
return o.values()[n]
def simple_get_set():
o = OrderedDict()
o["a"] = 2
return o["a"]
def get_empty_storage(self, space):
return self.erase(OrderedDict(space.eq_w, space.hash_w))
def get_set_object(n):
x = Simple(n)
o = OrderedDict()
o[x] = x
return o[x].x
def copy(n):
o = OrderedDict(Simple.eq, Simple.hash)
o[Simple(n)] = n
d = o.copy()
return d.values()[0] * 10 + len(d)
def len(n):
o = OrderedDict()
for i in xrange(n):
o[i] = i
return len(o)
def __init__(self, cache, matches=None):
self.cache = cache
self._matches = OrderedDict()
for match in (matches or []):
self.append_match(match)
def pop_default(n, d):
o = OrderedDict()
o[1] = 12
o[2] = 3
return (o.pop(n, d) * 10) + len(o)
def grow(n):
o = OrderedDict()
for i in xrange(n):
o[i] = -20
return o[3]
def get_empty_storage(self, space):
return self.erase(OrderedDict())
def __init__(self, space, klass=None):
W_Object.__init__(self, space, klass)
self.contents = OrderedDict(space.eq_w, space.hash_w)
self.w_default = space.w_nil
self.default_proc = None
