diff options
Diffstat (limited to 'test/base/test_dependency.py')
| -rw-r--r-- | test/base/test_dependency.py | 28 |
1 files changed, 15 insertions, 13 deletions
diff --git a/test/base/test_dependency.py b/test/base/test_dependency.py index a06bd5a51..120f6a147 100644 --- a/test/base/test_dependency.py +++ b/test/base/test_dependency.py @@ -4,6 +4,7 @@ from sqlalchemy.testing.util import conforms_partial_ordering from sqlalchemy import exc from sqlalchemy.testing import fixtures + class DependencySortTest(fixtures.TestBase): def assert_sort(self, tuples, allitems=None): @@ -15,7 +16,9 @@ class DependencySortTest(fixtures.TestBase): assert conforms_partial_ordering(tuples, result) def assert_sort_deterministic(self, tuples, allitems, expected): - result = list(topological.sort(tuples, allitems, deterministic_order=True)) + result = list(topological.sort(tuples, + allitems, + deterministic_order=True)) assert conforms_partial_ordering(tuples, result) assert result == expected @@ -116,7 +119,7 @@ class DependencySortTest(fixtures.TestBase): 'node4'])) eq_(err.edges, set([('node3', 'node1'), ('node4', 'node1'), ('node2', 'node3'), ('node1', 'node2'), - ('node4','node5'), ('node5', 'node4')])) + ('node4', 'node5'), ('node5', 'node4')])) def test_raise_on_cycle_two(self): @@ -138,7 +141,7 @@ class DependencySortTest(fixtures.TestBase): eq_(err.cycles, set(['node1', 'node3', 'node2'])) eq_(err.edges, set([('node3', 'node1'), ('node2', 'node3'), ('node3', 'node2'), ('node1', 'node2'), - ('node2','node4')])) + ('node2', 'node4')])) def test_raise_on_cycle_three(self): question, issue, providerservice, answer, provider = \ @@ -178,8 +181,7 @@ class DependencySortTest(fixtures.TestBase): tuples = [(node1, node2), (node3, node1), (node2, node4), (node3, node2), (node2, node3)] eq_(topological.find_cycles(tuples, - self._nodes_from_tuples(tuples)), set([node1, node2, - node3])) + self._nodes_from_tuples(tuples)), set([node1, node2, node3])) def test_find_multiple_cycles_one(self): node1 = 'node1' @@ -254,7 +256,7 @@ class DependencySortTest(fixtures.TestBase): # node6 only became present here once [ticket:2282] was addressed. eq_( topological.find_cycles(tuples, allnodes), - set(['node1','node2', 'node4', 'node6']) + set(['node1', 'node2', 'node4', 'node6']) ) def test_find_multiple_cycles_three(self): @@ -294,16 +296,16 @@ class DependencySortTest(fixtures.TestBase): ('node17', 'node11'), ('node1', 'node19'), ('node15', 'node8'), ('node6', 'node20'), ('node14', 'node11'), ('node6', 'node14'), ('node11', 'node2'), ('node10', 'node20'), ('node1', 'node11'), - ('node20', 'node19'), ('node4', 'node20'), ('node15', 'node20'), - ('node9', 'node19'), ('node11', 'node10'), ('node11', 'node19'), - ('node13', 'node6'), ('node3', 'node15'), ('node9', 'node11'), - ('node4', 'node17'), ('node2', 'node20'), ('node19', 'node10'), - ('node8', 'node4'), ('node11', 'node3'), ('node6', 'node1') + ('node20', 'node19'), ('node4', 'node20'), ('node15', 'node20'), + ('node9', 'node19'), ('node11', 'node10'), ('node11', 'node19'), + ('node13', 'node6'), ('node3', 'node15'), ('node9', 'node11'), + ('node4', 'node17'), ('node2', 'node20'), ('node19', 'node10'), + ('node8', 'node4'), ('node11', 'node3'), ('node6', 'node1') ] allnodes = ['node%d' % i for i in range(1, 21)] eq_( topological.find_cycles(tuples, allnodes), set(['node11', 'node10', 'node13', 'node15', 'node14', 'node17', - 'node19', 'node20', 'node8', 'node1', 'node3', - 'node2', 'node4', 'node6']) + 'node19', 'node20', 'node8', 'node1', 'node3', 'node2', + 'node4', 'node6']) ) |