From: Mike Bayer <mike_mp@zzzcomputing.com>
Date: Sat, 8 Dec 2007 19:25:10 +0000 (+0000)
Subject: ok found it
X-Git-Tag: rel_0_4_2~88
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=f4e3240812470e2b45ac46d41075658a1354f0d2;p=thirdparty%2Fsqlalchemy%2Fsqlalchemy.git

ok found it
---

diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py
index 209d3455c4..d8ed550b0d 100644
--- a/lib/sqlalchemy/topological.py
+++ b/lib/sqlalchemy/topological.py
@@ -76,7 +76,7 @@ class _Node(object):
             str(self.item) + \
             (self.cycles is not None and (" (cycles: " + repr([x for x in self.cycles]) + ")") or "") + \
             "\n" + \
-            ''.join([n.safestr(indent + 1) for n in self.children])
+            ''.join([str(n) for n in self.children])
 
     def __repr__(self):
         return "%s" % (str(self.item))
@@ -253,7 +253,7 @@ def _organize_as_tree(nodes):
                 if (childsubtree.intersection(nodealldeps) or childcycles.intersection(node.dependencies)):
                     # prepend child to nodes children
                     # (append should be fine, but previous implemetation used prepend)
-                    node.children[0:0] = [(child.item, [child.item for n in child.cycles or []], child.children)]
+                    node.children[0:0] = [(child.item, [n.item for n in child.cycles or []], child.children)]
                     # merge childs subtree and cycles
                     subtree.update(childsubtree)
                     cycles.update(childcycles)