def test_evaluation_do_not_reevaluate_same_node(): visited = [] def func(): visited.append("yes") pg = PortGraph() n = FuncNode(func) pg.add_actor(n, 0) pg.add_actor(n, 1) env = EvaluationEnvironment() algo = BruteEvaluation(pg) ws = WorkflowState(pg) algo.eval(env, ws, 0) assert len(visited) == 1 algo.eval(env, ws, 1) assert len(visited) == 2 algo.eval(env, ws, 0) assert len(visited) == 2 env.new_execution() algo.eval(env, ws, 0) assert len(visited) == 3
def test_ws_nodes_not_evaluated_on_creation(): pg = PortGraph() pg.add_vertex(0) pg.add_vertex(1) ws = WorkflowState(pg) assert ws.last_evaluation(0) is None assert ws.last_evaluation(1) is None
def test_ws_nodes_last_evaluation(): pg = PortGraph() pg.add_vertex(0) pg.add_vertex(1) ws = WorkflowState(pg) ws.set_last_evaluation(0, 1) assert ws.last_evaluation(0) == 1 assert ws.last_evaluation(1) is None
def test_evaluation_new_require_evaluation(): pg = PortGraph() pg.add_vertex(0) algo = BruteEvaluation(pg) assert id(algo.portgraph()) == id(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) assert algo.requires_evaluation(env, ws)
def test_evaluation_propagated_upstream(): visited = [] def func(txt): visited.append(txt) return txt pg = PortGraph() n = FuncNode(func) pg.add_actor(n, 0) pg.add_actor(n, 1) pg.connect(pg.out_port(0, 'txt'), pg.in_port(1, 'txt')) algo = BruteEvaluation(pg) ws = WorkflowState(pg) env = EvaluationEnvironment() ws.store_param(pg.in_port(0, 'txt'), "txt", 0) algo.eval(env, ws, 0) assert len(visited) == 1 algo.eval(env, ws, 1) assert len(visited) == 2 env.new_execution() algo.eval(env, ws, 1) assert len(visited) == 4
def test_evaluation_needs_ready_to_evaluate_state(): def func(a, b): c = a + b return c pg = PortGraph() n = FuncNode(func) pg.add_actor(n, 0) algo = BruteEvaluation(pg) ws = WorkflowState(pg) assert_raises(EvaluationError, lambda: algo.eval(None, ws))
def test_portgraph_is_out_port(): pg = PortGraph() vid = pg.add_vertex() assert_raises(InvalidPort, lambda: pg.is_out_port(None)) assert_raises(InvalidPort, lambda: pg.is_out_port(0)) pid = pg.add_out_port(vid, "out") assert_raises(InvalidPort, lambda: pg.is_out_port(pid + 1)) assert pg.is_out_port(pid) pid = pg.add_in_port(vid, "in") assert not pg.is_out_port(pid)
def test_portgraph_out_port(): pg = PortGraph() assert_raises(InvalidVertex, lambda: pg.out_port(0, None)) vid = pg.add_vertex() assert_raises(InvalidPort, lambda: pg.out_port(vid, None)) pg.add_in_port(vid, "toto") assert_raises(InvalidPort, lambda: pg.out_port(vid, None)) for lpid in [0, 1, "a", None]: assert_raises(InvalidPort, lambda: pg.out_port(vid, "toto")) pid = pg.add_out_port(vid, lpid) assert pg.out_port(vid, lpid) == pid
def test_ws_when_is_none_on_creation(): pg = PortGraph() pg.add_vertex(0) pg.add_in_port(0, "in", 0) pg.add_out_port(0, "out", 1) ws = WorkflowState(pg) assert_raises(KeyError, lambda: ws.when(10))
def test_portgraph_add_out_port(): pg = PortGraph() assert_raises(InvalidVertex, lambda: pg.add_out_port(0, "toto")) vid = pg.add_vertex() pid = pg.add_out_port(vid, "port") # raise error if reuse same global port id assert_raises(IndexError, lambda: pg.add_out_port(vid, "toto", pid)) # raise error if reuse same local port id assert_raises(InvalidPort, lambda: pg.add_out_port(vid, "port")) assert tuple(pg.out_ports(vid)) == (pid,) assert pg.local_id(pid) == "port" assert pg.out_port(vid, "port") == pid
def test_portgraph_set_actor_port_order_not_important(): pg = PortGraph() actor = Node() keys = ("toto", 1, "titi") for key in keys: actor.add_input(key, "descr") actor.add_output(key, "descr") vid = pg.add_vertex() for k in reversed(keys): pg.add_in_port(vid, k) pg.add_out_port(vid, k) pg.set_actor(vid, actor) assert pg.actor(vid) == actor
def test_evaluation_eval_all_nodes(): visited = [] def func(): visited.append("yes") pg = PortGraph() n = FuncNode(func) pg.add_actor(n, 0) pg.add_actor(n, 1) algo = BruteEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) algo.eval(env, ws) assert len(visited) == 2
def test_lazy_evaluate_at_least_once_each_node(): evaluated = [] def func(): evaluated.append('bla') pg = PortGraph() vid = pg.add_actor(FuncNode(func)) assert pg.actor(vid).is_lazy() algo = LazyEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) algo.eval(env, ws) assert len(evaluated) == 1 algo.eval(env, ws) assert len(evaluated) == 1
def test_portgraph_local_id(): pg = PortGraph() vid = pg.add_vertex() assert_raises(InvalidPort, lambda: pg.local_id(0)) for lpid in (0, 1, "a", None): pid = pg.add_in_port(vid, lpid) assert pg.local_id(pid) == lpid pid = pg.add_out_port(vid, lpid) assert pg.local_id(pid) == lpid
def test_ws_is_created_empty(): pg = PortGraph() ws = WorkflowState(pg) assert len(tuple(ws.items())) == 0 assert id(ws.portgraph()) == id(pg) pg.add_vertex(0) pg.add_in_port(0, "in", 0) pg.add_out_port(0, "out", 1) ws = WorkflowState(pg) assert len(tuple(ws.items())) == 0
def test_portgraph_add_vertex(): pg = PortGraph() vid = pg.add_vertex() assert pg.nb_vertices() == 1 assert_raises(InvalidVertex, lambda: pg.add_vertex(vid)) assert len(tuple(pg.ports(vid))) == 0 assert pg.actor(vid) is None
def test_evaluation_clear(): def func(): pass pg = PortGraph() n = FuncNode(func) pg.add_actor(n, 0) pg.add_actor(n, 1) algo = BruteEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) algo.eval(env, ws) assert not algo.requires_evaluation(env, ws) ws.clear() assert algo.requires_evaluation(env, ws)
def test_lazy_do_not_reevaluate_node_if_same_execution(): evaluated = [] def func(txt): evaluated.append(txt) return txt pg = PortGraph() vid = pg.add_actor(FuncNode(func)) assert pg.actor(vid).is_lazy() algo = LazyEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) ws.store_param(pg.in_port(vid, 'txt'), 'toto', env.current_execution()) algo.eval(env, ws) assert len(evaluated) == 1 algo.eval_node(env, ws, vid) assert len(evaluated) == 1
def test_portgraph_vertex(): pg = PortGraph() assert_raises(InvalidPort, lambda: pg.vertex(0)) vid = pg.add_vertex() pid1 = pg.add_in_port(vid, 0) pid2 = pg.add_out_port(vid, 0) assert pg.vertex(pid1) == vid assert pg.vertex(pid2) == vid
def test_ws_when_raise_key_error_for_unset_param(): pg = PortGraph() pg.add_vertex(0) pg.add_in_port(0, "in", 0) ws = WorkflowState(pg) assert_raises(KeyError, lambda: ws.when(0))
def test_ws_can_not_store_data_on_input_port(): pg = PortGraph() pg.add_vertex(0) pg.add_in_port(0, "in", 0) ws = WorkflowState(pg) assert_raises(UserWarning, lambda: ws.store(0, "data"))
def test_ws_when_is_none_for_non_evaluated_output_port(): pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, "out", 0) ws = WorkflowState(pg) assert ws.when(0) is None
def test_ws_when_is_last_evaluation_for_output_port(): pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, "out", 0) ws = WorkflowState(pg) ws.set_last_evaluation(0, 1) assert ws.when(0) == 1
def test_ws_when_set_explicitly_for_params(): pg = PortGraph() pg.add_vertex(0) pg.add_in_port(0, "in", 0) ws = WorkflowState(pg) ws.store_param(0, "param", 10) assert ws.when(0) == 10
def test_evaluation_fail_if_port_mismatch_outputs(): def func(): return 1, 2 pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, 'res', 0) n = RawFuncNode(func) n.add_output('res', "descr") pg.set_actor(0, n) algo = BruteEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) assert_raises(EvaluationError, lambda: algo.eval(env, ws))
def test_ws_retrieve_stored_data_on_output_port(): pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, "out", 0) ws = WorkflowState(pg) ws.store(0, "data") assert_raises(KeyError, lambda: ws.get(1)) assert ws.get(0) == "data"
def test_lazy_always_reevaluate_non_lazy_nodes(): evaluated = [] def func(txt): evaluated.append(txt) return txt pg = PortGraph() vid = pg.add_actor(FuncNode(func)) pg.actor(vid).set_lazy(False) algo = LazyEvaluation(pg) env = EvaluationEnvironment() ws = WorkflowState(pg) ws.store_param(pg.in_port(vid, 'txt'), 'toto', env.current_execution()) algo.eval(env, ws) assert len(evaluated) == 1 env.new_execution() algo.eval(env, ws) assert len(evaluated) == 2
def test_portgraph_init(): pg = PortGraph() assert pg.nb_vertices() == 0 assert pg.nb_edges() == 0
def test_portgraph_out_ports(): pg = PortGraph() assert_raises(InvalidVertex, lambda: tuple(pg.out_ports(0))) vid1 = pg.add_vertex() vid2 = pg.add_vertex() # test new vertices are created without ports assert len(tuple(pg.out_ports(vid1))) == 0 assert len(tuple(pg.out_ports())) == 0 pg.add_in_port(vid1, "in") pids = [pg.add_out_port(vid1, "out%d" % i) for i in range(5)] pg.add_in_port(vid2, "in") pid = pg.add_out_port(vid2, "out") assert sorted(pg.out_ports(vid1)) == sorted(pids) assert sorted(pg.out_ports()) == sorted(pids + [pid])
def test_portgraph_big(): pg = PortGraph() vid1 = pg.add_vertex() pid11 = pg.add_out_port(vid1, "out") vid2 = pg.add_vertex() pid21 = pg.add_out_port(vid2, "out") vid3 = pg.add_vertex() pid31 = pg.add_in_port(vid3, "in1") pid32 = pg.add_in_port(vid3, "in2") pid33 = pg.add_out_port(vid3, "res") vid4 = pg.add_vertex() pid41 = pg.add_in_port(vid4, "in") eid1 = pg.connect(pid11, pid31) eid2 = pg.connect(pid21, pid32) pg.connect(pid33, pid41) assert pg.source_port(eid1) == pid11 assert pg.target_port(eid2) == pid32 assert set(pg.out_ports(vid1)) == {pid11} assert set(pg.in_ports(vid3)) == {pid31, pid32} assert set(pg.ports(vid3)) == {pid31, pid32, pid33} assert pg.is_in_port(pid31) assert pg.is_out_port(pid11) assert pg.vertex(pid11) == vid1 assert set(pg.connected_ports(pid11)) == {pid31} assert set(pg.connected_edges(pid21)) == {eid2} assert pg.out_port(vid1, "out") == pid11 assert pg.in_port(vid3, "in1") == pid31 assert_raises(InvalidPort, lambda: pg.connect(pid11, pid33)) pg.remove_port(pid33) assert set(pg.connected_ports(pid41)) == set() assert set(pg.out_edges(vid3)) == set() assert_raises(InvalidPort, lambda: pg.is_in_port(pid33))
def test_portgraph_clear(): pg = PortGraph() vid1 = pg.add_vertex() vid2 = pg.add_vertex() pid1 = pg.add_in_port(vid1, "in") pid2 = pg.add_out_port(vid2, "out") pg.connect(pid2, pid1) pg.clear() assert pg.nb_vertices() == 0 assert pg.nb_edges() == 0 assert len(tuple(pg.ports())) == 0
def get_pg(): pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, "out", 0) pg.add_vertex(1) pg.add_out_port(1, "out", 1) pg.add_vertex(2) pg.add_in_port(2, "in1", 2) pg.add_in_port(2, "in2", 3) pg.add_out_port(2, "res", 4) pg.add_vertex(3) pg.add_in_port(3, "in", 5) pg.add_vertex(4) pg.add_out_port(4, "out", 6) pg.connect(0, 2, 0) pg.connect(1, 3, 1) pg.connect(4, 5, 2) pg.connect(6, 3, 3) return pg
def test_ws_retrieve_data_on_input_ports(): pg = PortGraph() pg.add_vertex(0) pg.add_out_port(0, "out", 0) pg.add_vertex(1) pg.add_in_port(1, "in", 1) # non existing port ws = WorkflowState(pg) assert_raises(KeyError, lambda: ws.get(10)) # lonely input port without data ws = WorkflowState(pg) assert_raises(KeyError, lambda: ws.get(1)) # lonely input port with data ws.store_param(1, "param", 0) assert ws.get(1) == "param" # connected input port pg.connect(0, 1) ws = WorkflowState(pg) ws.store(0, "data") assert ws.get(1) == "data"
def test_ws_store_param_only_on_lonely_input_ports(): pg = PortGraph() pg.add_vertex(0) pg.add_in_port(0, "in", 0) pg.add_out_port(0, "out", 1) pg.add_vertex(1) pg.add_in_port(1, "in", 2) pg.connect(1, 2) ws = WorkflowState(pg) assert_raises(UserWarning, lambda: ws.store_param(1, "param", 0)) assert_raises(UserWarning, lambda: ws.store_param(2, "param", 0))