summaryrefslogtreecommitdiff
path: root/lib/sqlalchemy/topological.py
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2007-03-07 18:05:39 +0000
committerMike Bayer <mike_mp@zzzcomputing.com>2007-03-07 18:05:39 +0000
commit46b82976bf8651500de6e1c4ccf8c20d535a14e9 (patch)
tree781f0cfbff5514a8ba758106f2fb1a4977d4029f /lib/sqlalchemy/topological.py
parent231acabf72e092c8573a6a9b9a8e4acc20b79812 (diff)
downloadsqlalchemy-46b82976bf8651500de6e1c4ccf8c20d535a14e9.tar.gz
- fixed use_alter flag on ForeignKeyConstraint [ticket:503]
Diffstat (limited to 'lib/sqlalchemy/topological.py')
-rw-r--r--lib/sqlalchemy/topological.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py
index d9f68ac01..41fa9d9b2 100644
--- a/lib/sqlalchemy/topological.py
+++ b/lib/sqlalchemy/topological.py
@@ -44,7 +44,7 @@ I realized this characteristic of the algorithm.
import string, StringIO
from sqlalchemy import util
-from sqlalchemy.exceptions import *
+from sqlalchemy.exceptions import CircularDependencyError
class _Node(object):
"""Represent each item in the sort.
@@ -188,7 +188,7 @@ class QueueDependencySorter(object):
n.cycles = util.Set([n])
continue
else:
- raise FlushError("Self-referential dependency detected " + repr(t))
+ raise CircularDependencyError("Self-referential dependency detected " + repr(t))
childnode = nodes[t[1]]
parentnode = nodes[t[0]]
edges.add((parentnode, childnode))
@@ -222,7 +222,7 @@ class QueueDependencySorter(object):
continue
else:
# long cycles not allowed
- raise FlushError("Circular dependency detected " + repr(edges) + repr(queue))
+ raise CircularDependencyError("Circular dependency detected " + repr(edges) + repr(queue))
node = queue.pop()
if not hasattr(node, '_cyclical'):
output.append(node)