def test_delegate_add_node_to_the_underlying_graph_object(
digraph_add_node_mock):
definition = _a_mock_definition()
def_use_graph = DefUseGraph()
def_use_graph.add_node(definition)
digraph_add_node_mock.assert_called_once_with(definition)
def test_delegate_add_node_to_the_underlying_graph_object(
digraph_add_node_mock):
definition = Definition(None, None, DataSet(set(), 8), None)
def_use_graph = DefUseGraph()
def_use_graph.add_node(definition)
digraph_add_node_mock.assert_called_once_with(definition)
def test_delegate_add_edge_to_the_underlying_graph_object(
digraph_add_edge_mock):
use = (_a_mock_definition(), _a_mock_definition())
labels = {'attribute1': 'value1', 'attribute2': 'value2'}
def_use_graph = DefUseGraph()
def_use_graph.add_edge(*use, **labels)
digraph_add_edge_mock.assert_called_once_with(*use, **labels)
def test_delegate_add_edge_to_the_underlying_graph_object(
digraph_add_edge_mock):
use = (
Definition(None, None, DataSet(set(), 8), None),
Definition(None, None, DataSet(set(), 8), None),
)
def_use_graph = DefUseGraph()
def_use_graph.add_edge(*use)
digraph_add_edge_mock.assert_called_once_with(*use)
def test_transitive_closure_of_a_node_should_copy_labels_from_original_graph():
def_use_graph = DefUseGraph()
# A -> B
A = _a_mock_definition()
B = _a_mock_definition()
uses = [(A, B)]
for use in uses:
def_use_graph.add_edge(*use, label='some data')
result = def_use_graph.transitive_closure(B).get_edge_data(A, B)['label']
nose.tools.assert_equals(result, 'some data')
def test_top_predecessors():
def_use_graph = DefUseGraph()
# A -> B, B -> D, C -> D
A = _a_mock_definition()
B = _a_mock_definition()
C = _a_mock_definition()
D = _a_mock_definition()
uses = [
(A, B),
(B, D),
(C, D),
]
for use in uses:
def_use_graph.add_edge(*use)
result = def_use_graph.top_predecessors(D)
nose.tools.assert_list_equal(result, [A, C])
def test_transitive_closure_of_a_node():
def_use_graph = DefUseGraph()
# A -> B, B -> D, C -> D
A = _a_mock_definition()
B = _a_mock_definition()
C = _a_mock_definition()
D = _a_mock_definition()
uses = [
(A, B),
(B, D),
(C, D),
]
for use in uses:
def_use_graph.add_edge(*use)
result = def_use_graph.transitive_closure(D)
result_nodes = set(result.nodes)
result_edges = set(result.edges)
nose.tools.assert_set_equal(result_nodes, {D, B, C, A})
nose.tools.assert_set_equal(result_edges, {(B, D), (C, D), (A, B)})
def test_refuses_to_add_edge_between_non_definition_nodes():
def_use_graph = DefUseGraph()
nose.tools.assert_raises(TypeError, def_use_graph.add_edge, 1, 2)
def test_def_use_graph_has_a_default_graph():
def_use_graph = DefUseGraph()
nose.tools.assert_equal(isinstance(def_use_graph.graph, networkx.DiGraph),
True)