diff options
| author | Jason Kirtland <jek@discorporate.us> | 2008-07-15 19:29:41 +0000 |
|---|---|---|
| committer | Jason Kirtland <jek@discorporate.us> | 2008-07-15 19:29:41 +0000 |
| commit | 1d37472fdd1e4091fe2d158a21b27043fc8626f9 (patch) | |
| tree | 8dc6eca7f42399c267c000a82aeefd0097477ecd /lib/sqlalchemy/topological.py | |
| parent | 8fa48edbf9d84093152aced94fc1eb7996b9827f (diff) | |
| download | sqlalchemy-1d37472fdd1e4091fe2d158a21b27043fc8626f9.tar.gz | |
- Dropped `reversed` emulation
Diffstat (limited to 'lib/sqlalchemy/topological.py')
| -rw-r--r-- | lib/sqlalchemy/topological.py | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py index bfcfc9c0a..e46b41a49 100644 --- a/lib/sqlalchemy/topological.py +++ b/lib/sqlalchemy/topological.py @@ -18,7 +18,6 @@ conditions. """ -from sqlalchemy import util from sqlalchemy.exc import CircularDependencyError __all__ = ['sort', 'sort_with_cycles', 'sort_as_tree'] @@ -237,7 +236,7 @@ def _organize_as_tree(nodes): # order of the list has no semantics for the algorithmic independents = [] # in reverse topological order - for node in util.reversed(nodes): + for node in reversed(nodes): # nodes subtree and cycles contain the node itself subtree = set([node]) if node.cycles is not None: |