Name	Size	Mode	Actions
generator/	-	0755	rm
common.py	25313	0644	editdlrm
common_test.py	6252	0755	editdlrm
easy_xml.py	5487	0644	editdlrm
easy_xml_test.py	3941	0755	editdlrm
flock_tool.py	1886	0755	editdlrm
input.py	126437	0644	editdlrm
input_test.py	3426	0755	editdlrm
mac_tool.py	30482	0755	editdlrm
MSVSNew.py	13191	0644	editdlrm
MSVSProject.py	6940	0644	editdlrm
MSVSSettings.py	45747	0644	editdlrm
MSVSSettings_test.py	74434	0755	editdlrm
MSVSToolFile.py	1830	0644	editdlrm
MSVSUserFile.py	5376	0644	editdlrm
MSVSUtil.py	10326	0644	editdlrm
MSVSVersion.py	19878	0644	editdlrm
msvs_emulation.py	54021	0644	editdlrm
ninja_syntax.py	5640	0644	editdlrm
simple_copy.py	1297	0644	editdlrm
win_tool.py	15178	0755	editdlrm
xcodeproj_file.py	136272	0644	editdlrm
xcode_emulation.py	82454	0644	editdlrm
xcode_emulation_test.py	1489	0644	editdlrm
xcode_ninja.py	12132	0644	editdlrm
xml_fix.py	2244	0644	editdlrm
__init__.py	24653	0755	editdlrm

#!/usr/bin/env python3 # Copyright 2013 Google Inc. All rights reserved. # Use of this source code is governed by a BSD-style license that can be # found in the LICENSE file. """Unit tests for the input.py file.""" import unittest import gyp.input class TestFindCycles(unittest.TestCase): def setUp(self): self.nodes = {} for x in ("a", "b", "c", "d", "e"): self.nodes[x] = gyp.input.DependencyGraphNode(x) def _create_dependency(self, dependent, dependency): dependent.dependencies.append(dependency) dependency.dependents.append(dependent) def test_no_cycle_empty_graph(self): for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_no_cycle_line(self): self._create_dependency(self.nodes["a"], self.nodes["b"]) self._create_dependency(self.nodes["b"], self.nodes["c"]) self._create_dependency(self.nodes["c"], self.nodes["d"]) for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_no_cycle_dag(self): self._create_dependency(self.nodes["a"], self.nodes["b"]) self._create_dependency(self.nodes["a"], self.nodes["c"]) self._create_dependency(self.nodes["b"], self.nodes["c"]) for label, node in self.nodes.items(): self.assertEqual([], node.FindCycles()) def test_cycle_self_reference(self): self._create_dependency(self.nodes["a"], self.nodes["a"]) self.assertEqual( [[self.nodes["a"], self.nodes["a"]]], self.nodes["a"].FindCycles() ) def test_cycle_two_nodes(self): self._create_dependency(self.nodes["a"], self.nodes["b"]) self._create_dependency(self.nodes["b"], self.nodes["a"]) self.assertEqual( [[self.nodes["a"], self.nodes["b"], self.nodes["a"]]], self.nodes["a"].FindCycles(), ) self.assertEqual( [[self.nodes["b"], self.nodes["a"], self.nodes["b"]]], self.nodes["b"].FindCycles(), ) def test_two_cycles(self): self._create_dependency(self.nodes["a"], self.nodes["b"]) self._create_dependency(self.nodes["b"], self.nodes["a"]) self._create_dependency(self.nodes["b"], self.nodes["c"]) self._create_dependency(self.nodes["c"], self.nodes["b"]) cycles = self.nodes["a"].FindCycles() self.assertTrue([self.nodes["a"], self.nodes["b"], self.nodes["a"]] in cycles) self.assertTrue([self.nodes["b"], self.nodes["c"], self.nodes["b"]] in cycles) self.assertEqual(2, len(cycles)) def test_big_cycle(self): self._create_dependency(self.nodes["a"], self.nodes["b"]) self._create_dependency(self.nodes["b"], self.nodes["c"]) self._create_dependency(self.nodes["c"], self.nodes["d"]) self._create_dependency(self.nodes["d"], self.nodes["e"]) self._create_dependency(self.nodes["e"], self.nodes["a"]) self.assertEqual( [ [ self.nodes["a"], self.nodes["b"], self.nodes["c"], self.nodes["d"], self.nodes["e"], self.nodes["a"], ] ], self.nodes["a"].FindCycles(), ) if __name__ == "__main__": unittest.main()