Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(122)

Side by Side Diff: pylib/gyp/input_test.py

Issue 1454433002: Python 3 compatibility Base URL: https://chromium.googlesource.com/external/gyp.git@master
Patch Set: Rebase with master (4ec6c4e3a94bd04a6da2858163d40b2429b8aad1) Created 4 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 #!/usr/bin/env python 1 #!/usr/bin/env python
2 2
3 # Copyright 2013 Google Inc. All rights reserved. 3 # Copyright 2013 Google Inc. All rights reserved.
4 # Use of this source code is governed by a BSD-style license that can be 4 # Use of this source code is governed by a BSD-style license that can be
5 # found in the LICENSE file. 5 # found in the LICENSE file.
6 6
7 """Unit tests for the input.py file.""" 7 """Unit tests for the input.py file."""
8 8
9 import gyp.input 9 import gyp.input
10 import unittest 10 import unittest
11 import sys 11 import sys
12 12
13 13
14 class TestFindCycles(unittest.TestCase): 14 class TestFindCycles(unittest.TestCase):
15 def setUp(self): 15 def setUp(self):
16 self.nodes = {} 16 self.nodes = {}
17 for x in ('a', 'b', 'c', 'd', 'e'): 17 for x in ('a', 'b', 'c', 'd', 'e'):
18 self.nodes[x] = gyp.input.DependencyGraphNode(x) 18 self.nodes[x] = gyp.input.DependencyGraphNode(x)
19 19
20 def _create_dependency(self, dependent, dependency): 20 def _create_dependency(self, dependent, dependency):
21 dependent.dependencies.append(dependency) 21 dependent.dependencies.append(dependency)
22 dependency.dependents.append(dependent) 22 dependency.dependents.append(dependent)
23 23
24 def test_no_cycle_empty_graph(self): 24 def test_no_cycle_empty_graph(self):
25 for label, node in self.nodes.iteritems(): 25 for label, node in self.nodes.items():
26 self.assertEquals([], node.FindCycles()) 26 self.assertEquals([], node.FindCycles())
27 27
28 def test_no_cycle_line(self): 28 def test_no_cycle_line(self):
29 self._create_dependency(self.nodes['a'], self.nodes['b']) 29 self._create_dependency(self.nodes['a'], self.nodes['b'])
30 self._create_dependency(self.nodes['b'], self.nodes['c']) 30 self._create_dependency(self.nodes['b'], self.nodes['c'])
31 self._create_dependency(self.nodes['c'], self.nodes['d']) 31 self._create_dependency(self.nodes['c'], self.nodes['d'])
32 32
33 for label, node in self.nodes.iteritems(): 33 for label, node in self.nodes.items():
34 self.assertEquals([], node.FindCycles()) 34 self.assertEquals([], node.FindCycles())
35 35
36 def test_no_cycle_dag(self): 36 def test_no_cycle_dag(self):
37 self._create_dependency(self.nodes['a'], self.nodes['b']) 37 self._create_dependency(self.nodes['a'], self.nodes['b'])
38 self._create_dependency(self.nodes['a'], self.nodes['c']) 38 self._create_dependency(self.nodes['a'], self.nodes['c'])
39 self._create_dependency(self.nodes['b'], self.nodes['c']) 39 self._create_dependency(self.nodes['b'], self.nodes['c'])
40 40
41 for label, node in self.nodes.iteritems(): 41 for label, node in self.nodes.items():
42 self.assertEquals([], node.FindCycles()) 42 self.assertEquals([], node.FindCycles())
43 43
44 def test_cycle_self_reference(self): 44 def test_cycle_self_reference(self):
45 self._create_dependency(self.nodes['a'], self.nodes['a']) 45 self._create_dependency(self.nodes['a'], self.nodes['a'])
46 46
47 self.assertEquals([[self.nodes['a'], self.nodes['a']]], 47 self.assertEquals([[self.nodes['a'], self.nodes['a']]],
48 self.nodes['a'].FindCycles()) 48 self.nodes['a'].FindCycles())
49 49
50 def test_cycle_two_nodes(self): 50 def test_cycle_two_nodes(self):
51 self._create_dependency(self.nodes['a'], self.nodes['b']) 51 self._create_dependency(self.nodes['a'], self.nodes['b'])
(...skipping 29 matching lines...) Expand all
81 self.nodes['b'], 81 self.nodes['b'],
82 self.nodes['c'], 82 self.nodes['c'],
83 self.nodes['d'], 83 self.nodes['d'],
84 self.nodes['e'], 84 self.nodes['e'],
85 self.nodes['a']]], 85 self.nodes['a']]],
86 self.nodes['a'].FindCycles()) 86 self.nodes['a'].FindCycles())
87 87
88 88
89 if __name__ == '__main__': 89 if __name__ == '__main__':
90 unittest.main() 90 unittest.main()
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698