- annual unitofwork cleanup

- moved conversion of cyclical sort to UOWTask structure to be non-recursive
- reduced some verbosity
- rationale for the "tree" sort clarified
- would love to flatten all of uow topological sorting, sorting within mapper._save_obj() into a single sort someday

1 files changed, 1 insertions, 4 deletions

diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py
index e46b41a49..6ede85f3b 100644
--- a/lib/sqlalchemy/topological.py
+++ b/lib/sqlalchemy/topological.py
@@ -46,7 +46,7 @@ def sort_as_tree(tuples, allitems, with_cycles=False):
     as a hierarchical tree structure.
     
     returns results as an iterable of 3-tuples, containing the item,
-    and a list containing items involved in a cycle with this item, if any,
+    a list containing items involved in a cycle with this item, if any,
     and a list of child tuples.  
     
     if with_cycles is False, the returned structure is of the same form
@@ -156,9 +156,6 @@ class _EdgeCollection(object):
             for child in children:
                 yield (parent, child)
 
-    def __str__(self):
-        return repr(list(self))
-
     def __repr__(self):
         return repr(list(self))