summaryrefslogtreecommitdiff
path: root/test/base
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2010-09-29 02:11:38 -0400
committerMike Bayer <mike_mp@zzzcomputing.com>2010-09-29 02:11:38 -0400
commite9e221977bde7724d4ef3b553de4f982028eead8 (patch)
tree9da735bed0b6e84d8b17435d6e35ff5cc1548f25 /test/base
parent2811ca21069f63a1b86428a28416c609dc532bbb (diff)
downloadsqlalchemy-e9e221977bde7724d4ef3b553de4f982028eead8.tar.gz
- CircularDependencyError now has .cycles and .edges
members, which are the set of elements involved in one or more cycles, and the set of edges as 2-tuples. [ticket:1890]
Diffstat (limited to 'test/base')
-rw-r--r--test/base/test_dependency.py23
1 files changed, 17 insertions, 6 deletions
diff --git a/test/base/test_dependency.py b/test/base/test_dependency.py
index aa4410576..9fddfc47f 100644
--- a/test/base/test_dependency.py
+++ b/test/base/test_dependency.py
@@ -84,10 +84,16 @@ class DependencySortTest(TestBase):
(node4, node1),
]
allitems = self._nodes_from_tuples(tuples)
- assert_raises(exc.CircularDependencyError, list,
- topological.sort(tuples, allitems))
- # TODO: test find_cycles
+ try:
+ list(topological.sort(tuples, allitems))
+ assert False
+ except exc.CircularDependencyError, err:
+ eq_(err.cycles, set(['node1', 'node3', 'node2', 'node5',
+ 'node4']))
+ eq_(err.edges, set([('node3', 'node1'), ('node4', 'node1'),
+ ('node2', 'node3'), ('node1', 'node2'),
+ ('node4','node5'), ('node5', 'node4')]))
def test_raise_on_cycle_two(self):
@@ -101,10 +107,15 @@ class DependencySortTest(TestBase):
tuples = [(node1, node2), (node3, node1), (node2, node4),
(node3, node2), (node2, node3)]
allitems = self._nodes_from_tuples(tuples)
- assert_raises(exc.CircularDependencyError, list,
- topological.sort(tuples, allitems))
- # TODO: test find_cycles
+ try:
+ list(topological.sort(tuples, allitems))
+ assert False
+ except exc.CircularDependencyError, err:
+ eq_(err.cycles, set(['node1', 'node3', 'node2']))
+ eq_(err.edges, set([('node3', 'node1'), ('node2', 'node3'),
+ ('node3', 'node2'), ('node1', 'node2'),
+ ('node2','node4')]))
def test_raise_on_cycle_three(self):
question, issue, providerservice, answer, provider = \