mirror of
https://github.com/pytorch/pytorch.git
synced 2025-10-20 21:14:14 +08:00
fbe6f42dcf
See https://github.com/pytorch/pytorch/pull/129751#issue-2380881501. Most changes are auto-generated by linter. You can review these PRs via: ```bash git diff --ignore-all-space --ignore-blank-lines HEAD~1 ``` Pull Request resolved: https://github.com/pytorch/pytorch/pull/129759 Approved by: https://github.com/justinchuby, https://github.com/ezyang
132 lines
3.6 KiB
Python
132 lines
3.6 KiB
Python
# Owner(s): ["oncall: package/deploy"]
|
|
|
|
from torch.package._digraph import DiGraph
|
|
from torch.testing._internal.common_utils import run_tests
|
|
|
|
|
|
try:
|
|
from .common import PackageTestCase
|
|
except ImportError:
|
|
# Support the case where we run this file directly.
|
|
from common import PackageTestCase
|
|
|
|
|
|
class TestDiGraph(PackageTestCase):
|
|
"""Test the DiGraph structure we use to represent dependencies in PackageExporter"""
|
|
|
|
def test_successors(self):
|
|
g = DiGraph()
|
|
g.add_edge("foo", "bar")
|
|
g.add_edge("foo", "baz")
|
|
g.add_node("qux")
|
|
|
|
self.assertIn("bar", list(g.successors("foo")))
|
|
self.assertIn("baz", list(g.successors("foo")))
|
|
self.assertEqual(len(list(g.successors("qux"))), 0)
|
|
|
|
def test_predecessors(self):
|
|
g = DiGraph()
|
|
g.add_edge("foo", "bar")
|
|
g.add_edge("foo", "baz")
|
|
g.add_node("qux")
|
|
|
|
self.assertIn("foo", list(g.predecessors("bar")))
|
|
self.assertIn("foo", list(g.predecessors("baz")))
|
|
self.assertEqual(len(list(g.predecessors("qux"))), 0)
|
|
|
|
def test_successor_not_in_graph(self):
|
|
g = DiGraph()
|
|
with self.assertRaises(ValueError):
|
|
g.successors("not in graph")
|
|
|
|
def test_predecessor_not_in_graph(self):
|
|
g = DiGraph()
|
|
with self.assertRaises(ValueError):
|
|
g.predecessors("not in graph")
|
|
|
|
def test_node_attrs(self):
|
|
g = DiGraph()
|
|
g.add_node("foo", my_attr=1, other_attr=2)
|
|
self.assertEqual(g.nodes["foo"]["my_attr"], 1)
|
|
self.assertEqual(g.nodes["foo"]["other_attr"], 2)
|
|
|
|
def test_node_attr_update(self):
|
|
g = DiGraph()
|
|
g.add_node("foo", my_attr=1)
|
|
self.assertEqual(g.nodes["foo"]["my_attr"], 1)
|
|
|
|
g.add_node("foo", my_attr="different")
|
|
self.assertEqual(g.nodes["foo"]["my_attr"], "different")
|
|
|
|
def test_edges(self):
|
|
g = DiGraph()
|
|
g.add_edge(1, 2)
|
|
g.add_edge(2, 3)
|
|
g.add_edge(1, 3)
|
|
g.add_edge(4, 5)
|
|
|
|
edge_list = list(g.edges)
|
|
self.assertEqual(len(edge_list), 4)
|
|
|
|
self.assertIn((1, 2), edge_list)
|
|
self.assertIn((2, 3), edge_list)
|
|
self.assertIn((1, 3), edge_list)
|
|
self.assertIn((4, 5), edge_list)
|
|
|
|
def test_iter(self):
|
|
g = DiGraph()
|
|
g.add_node(1)
|
|
g.add_node(2)
|
|
g.add_node(3)
|
|
|
|
nodes = set()
|
|
nodes.update(g)
|
|
|
|
self.assertEqual(nodes, {1, 2, 3})
|
|
|
|
def test_contains(self):
|
|
g = DiGraph()
|
|
g.add_node("yup")
|
|
|
|
self.assertTrue("yup" in g)
|
|
self.assertFalse("nup" in g)
|
|
|
|
def test_contains_non_hashable(self):
|
|
g = DiGraph()
|
|
self.assertFalse([1, 2, 3] in g)
|
|
|
|
def test_forward_closure(self):
|
|
g = DiGraph()
|
|
g.add_edge("1", "2")
|
|
g.add_edge("2", "3")
|
|
g.add_edge("5", "4")
|
|
g.add_edge("4", "3")
|
|
self.assertTrue(g.forward_transitive_closure("1") == {"1", "2", "3"})
|
|
self.assertTrue(g.forward_transitive_closure("4") == {"4", "3"})
|
|
|
|
def test_all_paths(self):
|
|
g = DiGraph()
|
|
g.add_edge("1", "2")
|
|
g.add_edge("1", "7")
|
|
g.add_edge("7", "8")
|
|
g.add_edge("8", "3")
|
|
g.add_edge("2", "3")
|
|
g.add_edge("5", "4")
|
|
g.add_edge("4", "3")
|
|
|
|
result = g.all_paths("1", "3")
|
|
# to get rid of indeterminism
|
|
actual = {i.strip("\n") for i in result.split(";")[2:-1]}
|
|
expected = {
|
|
'"2" -> "3"',
|
|
'"1" -> "7"',
|
|
'"7" -> "8"',
|
|
'"1" -> "2"',
|
|
'"8" -> "3"',
|
|
}
|
|
self.assertEqual(actual, expected)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
run_tests()
|