def test__contains__(self): parent = Node() child = parent.descend('Child') parent.ctx['a'] = 1 child.ctx['b'] = 2 assert 'a' in parent.ctx assert 'a' in child.ctx assert 'b' in child.ctx assert 'b' not in parent.ctx
def test_maps(self): parent = Node() child = parent.descend('Child') assert list(child.ctx.maps) == [child.ctx.map] + list(parent.ctx.maps)
def test_eq(self): n1 = Node(a=1, b=2, c=3) n1.descend('Test1', x=1, y=2, z=3) n2 = Node(a=1, b=2, c=3) n2.descend('Test1', x=1, y=2, z=3)
def test_clone_ne(self): n1 = Node(a=1, b=2, c=3) n1.descend('Test1', x=1, y=2, z=3) n2 = n1.clone(cow='moo') self.assertNotEqual(n1, n2)
def test_clone_eq(self): n1 = Node(a=1, b=2, c=3) n1.descend('Test1', x=1, y=2, z=3) self.assertEqual(n1, n1.clone())
def test__repr__(self): parent = Node() child = parent.descend('Child') parent.ctx['a'] = 1 child.ctx['b'] = 2 assert repr(child.ctx) == "{'b': 2} -> {'a': 1}"
def test__iter__(self): parent = Node() child = parent.descend('Child') parent.ctx['a'] = 1 child.ctx['b'] = 2 assert list(child.ctx) == list(child.ctx.map) + list(parent.ctx)
def test__len__(self): parent = Node() child = parent.descend('Child') parent.ctx['a'] = 1 child.ctx['b'] = 2 assert len(child.ctx) is 2
def test__delitem__(self): parent = Node() child = parent.descend('Child') parent.ctx['a'] = 1 del parent.ctx['a']
def test__init__(self): node = Node() node.ctx['a'] = 1 child = node.descend('Child') newmap = ChainMap(inst=child) assert newmap['a'] == 1
def test_ne(self): n1 = Node(a=1, b=2, c=3) n1.descend('Test1', x=1, y=2, z=3) n2 = Node(a=1, b=2, c=3) n2.descend('Test1', x=1, y=2, z=4) self.assertNotEqual(n1, n2)