def test_search(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(b, d)
pattern = ge.GEParser("a > b").parse()
match, following = g.search(pattern)
self.assertCountEqual(match, [a, b])
self.assertCountEqual(following, [c, d])
pattern = ge.GEParser("b > (c | d)").parse()
match, following = g.search(pattern)
self.assertCountEqual(match, [b, c, d])
self.assertEqual(following, [])
pattern = ge.GEParser("c|d").parse()
match, following = g.search(pattern)
self.assertCountEqual(match, [c, d])
self.assertEqual(following, [])
def test_directed_graph(self):
g = hl.Graph()
g.add_node("a")
g.add_node("b")
g.add_node("c")
g.add_edge("a", "b")
g.add_edge("b", "c")
self.assertEqual(g.incoming("b")[0], "a")
self.assertEqual(g.outgoing("b")[0], "c")
g.replace(["b"], "x")
self.assertEqual(sorted(list(g.nodes.values())), sorted(["a", "c", "x"]))
self.assertEqual(g.incoming("x")[0], "a")
self.assertEqual(g.outgoing("x")[0], "c")
def test_fold(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(b, d)
t = ht.Fold("a > b", "ab")
g = t.apply(g)
self.assertEqual(g.incoming(g["c"])[0].op, "ab")
def test_prune(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
e = hl.Node(uid="e", name="e", op="e")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_node(e)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(a, d)
g.add_edge(c, e)
g.add_edge(d, e)
t = ht.Prune("e")
g = t.apply(g)
self.assertFalse(g.outgoing(d))
def test_parallel_fold(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
e = hl.Node(uid="e", name="e", op="e")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_node(e)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(a, d)
g.add_edge(c, e)
g.add_edge(d, e)
t = ht.Fold("((b > c) | d) > e", "bcde")
g = t.apply(g)
self.assertEqual(g.outgoing(g["a"])[0].op, "bcde")
def test_fold_duplicates(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b1 = hl.Node(uid="b1", name="b1", op="b", output_shape=(3, 3))
b2 = hl.Node(uid="b2", name="b2", op="b", output_shape=(4, 4))
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
g.add_node(a)
g.add_node(b1)
g.add_node(b2)
g.add_node(c)
g.add_node(d)
g.add_edge(a, b1)
g.add_edge(b1, b2)
g.add_edge(b2, c)
g.add_edge(b2, d)
t = ht.FoldDuplicates()
g = t.apply(g)
self.assertEqual(g.incoming(g["c"])[0].op, "b")
self.assertEqual(g.incoming(g["c"])[0].name, "b1")
self.assertEqual(g.incoming(g["c"])[0].output_shape, (4, 4))
def test_regex(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(b, d)
t = ht.Rename(op=r"a", to="bbb")
g = t.apply(g)
self.assertEqual(g["a"].op, "bbb")
t = ht.Rename(op=r"b(.*)", to=r"x\1")
g = t.apply(g)
self.assertEqual(g["a"].op, "xbb")
self.assertEqual(g["b"].op, "x")
def test_prune_branch(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
e = hl.Node(uid="e", name="e", op="e")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_node(e)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(a, d)
g.add_edge(c, e)
g.add_edge(d, e)
t = ht.PruneBranch("c")
g = t.apply(g)
self.assertFalse(g["b"])
self.assertFalse(g["c"])
self.assertTrue(g["a"])
def test_basics(self):
g = hl.Graph()
a = hl.Node(uid="a", name="a", op="a")
b = hl.Node(uid="b", name="b", op="b")
c = hl.Node(uid="c", name="c", op="c")
d = hl.Node(uid="d", name="d", op="d")
e = hl.Node(uid="e", name="e", op="e")
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_node(e)
g.add_edge(a, b)
g.add_edge(b, c)
g.add_edge(b, d)
g.add_edge(c, e)
g.add_edge(d, e)
rule = ge.GEParser("a > b").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, a)
self.assertTrue(match)
self.assertCountEqual(following, [c, d])
match, following = rule.match(g, b)
self.assertFalse(match)
rule = ge.GEParser("b > c").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, b)
self.assertFalse(match)
rule = ge.GEParser("c | d").parse()
self.assertIsInstance(rule, ge.ParallelPattern)
match, following = rule.match(g, [c, d])
self.assertTrue(match)
self.assertEqual(following, e)
match, following = rule.match(g, [c])
self.assertTrue(match)
self.assertEqual(following, e)
match, following = rule.match(g, d)
self.assertTrue(match)
self.assertEqual(following, e)
match, following = rule.match(g, b)
self.assertFalse(match)
rule = ge.GEParser("a > b > (c | d)").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, a)
self.assertTrue(match, following)
rule = ge.GEParser("(a > b) > (c | d)").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, a)
self.assertTrue(match)
rule = ge.GEParser("a > b > (c | d) > e").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, a)
self.assertTrue(match)
rule = ge.GEParser("(c | d) > e").parse()
self.assertIsInstance(rule, ge.SerialPattern)
match, following = rule.match(g, [c, d])
self.assertTrue(match)
