def test_parse0(self):
g = n1 | n2
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
self.assertEquals(g, expected_g)
def test_parse7(self):
g = n1 | [n2 | [n3, n4], n5, n6]
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
expected_g.add(n2, n3)
expected_g.add(n2, n4)
expected_g.add(n1, n5)
expected_g.add(n1, n6)
self.assertEquals(g, expected_g)
def test_parse9(self):
g = n1 | [n2, n4 | [n5], [n6], n3]
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
expected_g.add(n1, n4)
expected_g.add(n4, n5)
expected_g.add(n1, n6)
expected_g.add(n1, n3)
self.assertEquals(g, expected_g)
def test_gen_reverse_stream(self):
gen = Generate("gen", size=10, reverse=True, out_streams="num")
p = Pipeline(NodeGraph(gen))
p.run()
output = get_output()
expected_out = reversed([str(x) for x in range(10)])
self.assertCountEqual(output, expected_out)
def test_parse4(self):
g = n1 | [n2, [n3, n4]]
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
expected_g.add(n1, n3)
expected_g.add(n1, n4)
self.assertEquals(g, expected_g)
def test_parse1(self):
g = n1 | n2 | n3 | n4
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
expected_g.add(n2, n3)
expected_g.add(n3, n4)
self.assertEquals(g, expected_g)
def test_parse10(self):
g = n1 | [[n2 | n3], [n5 | n6]]
expected_g = NodeGraph(n1)
expected_g.add(n1, n2)
expected_g.add(n2, n3)
expected_g.add(n1, n5)
expected_g.add(n5, n6)
self.assertEquals(g, expected_g)