• Home
  • Raw
  • Download

Lines Matching refs:l2

68         l2 = pytree.Leaf(100, "foo", context=(" ", (10, 1)))
69 self.assertEqual(str(l2), " foo")
80 l2 = pytree.Leaf(100, "foo", context=(" ", (1, 0)))
81 self.assertEqual(l1, l2)
97 l2 = pytree.Leaf(200, "bar")
98 n1 = pytree.Node(1000, [l1, l2])
100 self.assertEqual(n1.children, [l1, l2])
104 l2 = pytree.Leaf(100, "bar", context=(" ", (1, 0)))
105 n1 = pytree.Node(1000, [l1, l2])
107 "Node(1000, [%s, %s])" % (repr(l1), repr(l2)))
111 l2 = pytree.Leaf(100, "bar", context=(" ", (1, 0)))
112 n1 = pytree.Node(1000, [l1, l2])
126 l2 = pytree.Leaf(100, "bar", prefix="b")
127 n1 = pytree.Node(1000, [l1, l2])
129 self.assertEqual(l1.get_suffix(), l2.prefix)
130 self.assertEqual(l2.get_suffix(), "")
149 l2 = pytree.Leaf(100, "foo")
151 n2 = pytree.Node(1000, [l2])
159 l2 = pytree.Leaf(100, "+")
161 n1 = pytree.Node(1000, [l1, l2, l3])
162 self.assertEqual(n1.children, [l1, l2, l3])
166 l2.replace(l2new)
173 l2 = pytree.Leaf(100, "+")
175 n1 = pytree.Node(1000, [l1, l2, l3])
177 l2.replace([pytree.Leaf(100, "*"), pytree.Leaf(100, "*")])
183 l2 = pytree.Leaf(100, "bar")
185 n2 = pytree.Node(1000, [l1, l2])
189 self.assertEqual(list(n1.leaves()), [l1, l2, l3])
193 l2 = pytree.Leaf(100, "bar")
194 n2 = pytree.Node(1000, [l1, l2])
204 l2 = pytree.Leaf(100, "bar")
206 c1 = pytree.Node(1000, [l1, l2])
208 self.assertEqual(list(n1.post_order()), [l1, l2, c1, l3, n1])
212 l2 = pytree.Leaf(100, "bar")
214 c1 = pytree.Node(1000, [l1, l2])
216 self.assertEqual(list(n1.pre_order()), [n1, c1, l1, l2, l3])
231 l2 = pytree.Leaf(100, "+")
233 n1 = pytree.Node(1000, [l1, l2, l3])
253 l2 = pytree.Leaf(100, "foo", prefix="_")
254 n1 = pytree.Node(1000, [l1, l2], prefix=prefix)
258 self.assertEqual(l2.prefix, "_")
262 l2 = pytree.Leaf(100, "foo")
263 n1 = pytree.Node(1000, [l1, l2])
274 self.assertEqual(l2.remove(), 1)
296 l2 = pytree.Leaf(100, "bar")
297 n1.set_child(0, l2)
299 self.assertEqual(l2.parent, n1)
300 self.assertEqual(n1.children, [l2])
309 self.assertRaises(IndexError, n1.set_child, 4, l2)
317 l2 = pytree.Leaf(100, "bar")
318 n1.insert_child(0, l2)
319 self.assertEqual(l2.parent, n1)
320 self.assertEqual(n1.children, [l2, l1])
324 self.assertEqual(n1.children, [l2, l1, l3])
337 l2 = pytree.Leaf(100, "bar")
338 n1.append_child(l2)
339 self.assertEqual(l2.parent, n1)
340 self.assertEqual(n1.children, [l1, l2])
356 l2 = pytree.Leaf(100, "b")
357 p1 = pytree.Node(1000, [l1, l2])
359 self.assertIs(l1.next_sibling, l2)
360 self.assertEqual(l2.next_sibling, None)
374 l2 = pytree.Leaf(100, "b")
375 p1 = pytree.Node(1000, [l1, l2])
377 self.assertIs(l2.prev_sibling, l1)
389 l2 = pytree.Leaf(100, "bar")
391 n1 = pytree.Node(1000, [l1, l2])
406 self.assertFalse(pl.match(l2, results=r))
419 self.assertFalse(pn.match(l2, results=r))
425 l2 = pytree.Leaf(100, "bar")
427 n1 = pytree.Node(1000, [l1, l2])
489 l2 = pytree.Leaf(3, "x")
491 node = pytree.Node(331, [l1, l2, l3])
494 self.assertEqual(r["args"], [l2])