• Home
  • Raw
  • Download

Lines Matching refs:l2

46         l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
47 self.assertEqual(str(l2), " foo")
58 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
59 self.assertEqual(l1, l2)
75 l2 = pytree.Leaf(200, "bar")
76 n1 = pytree.Node(1000, [l1, l2])
78 self.assertEqual(n1.children, [l1, l2])
82 l2 = pytree.Leaf(100, "bar", context=(" ", (1, 0)))
83 n1 = pytree.Node(1000, [l1, l2])
85 "Node(1000, [%s, %s])" % (repr(l1), repr(l2)))
89 l2 = pytree.Leaf(100, "bar", context=(" ", (1, 0)))
90 n1 = pytree.Node(1000, [l1, l2])
104 l2 = pytree.Leaf(100, "bar", prefix="b")
105 n1 = pytree.Node(1000, [l1, l2])
107 self.assertEqual(l1.get_suffix(), l2.prefix)
108 self.assertEqual(l2.get_suffix(), "")
127 l2 = pytree.Leaf(100, "foo")
129 n2 = pytree.Node(1000, [l2])
137 l2 = pytree.Leaf(100, "+")
139 n1 = pytree.Node(1000, [l1, l2, l3])
140 self.assertEqual(n1.children, [l1, l2, l3])
144 l2.replace(l2new)
151 l2 = pytree.Leaf(100, "+")
153 n1 = pytree.Node(1000, [l1, l2, l3])
155 l2.replace([pytree.Leaf(100, "*"), pytree.Leaf(100, "*")])
161 l2 = pytree.Leaf(100, "bar")
163 n2 = pytree.Node(1000, [l1, l2])
167 self.assertEqual(list(n1.leaves()), [l1, l2, l3])
171 l2 = pytree.Leaf(100, "bar")
172 n2 = pytree.Node(1000, [l1, l2])
182 l2 = pytree.Leaf(100, "bar")
184 c1 = pytree.Node(1000, [l1, l2])
186 self.assertEqual(list(n1.post_order()), [l1, l2, c1, l3, n1])
190 l2 = pytree.Leaf(100, "bar")
192 c1 = pytree.Node(1000, [l1, l2])
194 self.assertEqual(list(n1.pre_order()), [n1, c1, l1, l2, l3])
209 l2 = pytree.Leaf(100, "+")
211 n1 = pytree.Node(1000, [l1, l2, l3])
231 l2 = pytree.Leaf(100, "foo", prefix="_")
232 n1 = pytree.Node(1000, [l1, l2], prefix=prefix)
236 self.assertEqual(l2.prefix, "_")
240 l2 = pytree.Leaf(100, "foo")
241 n1 = pytree.Node(1000, [l1, l2])
252 self.assertEqual(l2.remove(), 1)
274 l2 = pytree.Leaf(100, "bar")
275 n1.set_child(0, l2)
277 self.assertEqual(l2.parent, n1)
278 self.assertEqual(n1.children, [l2])
287 self.assertRaises(IndexError, n1.set_child, 4, l2)
295 l2 = pytree.Leaf(100, "bar")
296 n1.insert_child(0, l2)
297 self.assertEqual(l2.parent, n1)
298 self.assertEqual(n1.children, [l2, l1])
302 self.assertEqual(n1.children, [l2, l1, l3])
315 l2 = pytree.Leaf(100, "bar")
316 n1.append_child(l2)
317 self.assertEqual(l2.parent, n1)
318 self.assertEqual(n1.children, [l1, l2])
334 l2 = pytree.Leaf(100, "b")
335 p1 = pytree.Node(1000, [l1, l2])
337 self.assertIs(l1.next_sibling, l2)
338 self.assertEqual(l2.next_sibling, None)
352 l2 = pytree.Leaf(100, "b")
353 p1 = pytree.Node(1000, [l1, l2])
355 self.assertIs(l2.prev_sibling, l1)
367 l2 = pytree.Leaf(100, "bar")
369 n1 = pytree.Node(1000, [l1, l2])
384 self.assertFalse(pl.match(l2, results=r))
397 self.assertFalse(pn.match(l2, results=r))
403 l2 = pytree.Leaf(100, "bar")
405 n1 = pytree.Node(1000, [l1, l2])
467 l2 = pytree.Leaf(3, "x")
469 node = pytree.Node(331, [l1, l2, l3])
472 self.assertEqual(r["args"], [l2])