From: Mike Bayer <mike_mp@zzzcomputing.com>
Date: Tue, 6 Apr 2010 05:42:58 +0000 (-0400)
Subject: remove prints
X-Git-Tag: rel_0_6_0~49
X-Git-Url: http://git.ipfire.org/gitweb.cgi?a=commitdiff_plain;h=04a814f97bd2793ef62f3becb93e840d09bf3ad8;p=thirdparty%2Fsqlalchemy%2Fsqlalchemy.git

remove prints
---

diff --git a/lib/sqlalchemy/orm/unitofwork.py b/lib/sqlalchemy/orm/unitofwork.py
index 088c71b6e5..b4258a58ef 100644
--- a/lib/sqlalchemy/orm/unitofwork.py
+++ b/lib/sqlalchemy/orm/unitofwork.py
@@ -230,12 +230,12 @@ class UOWTransaction(object):
                     n = set_.pop()
                     n.execute_aggregate(self, set_)
         else:
-            r = list(topological.sort(
-                                    self.dependencies, 
-                                    postsort_actions))
-            print "-----------"
-            print self.dependencies
-            print r
+            #r = list(topological.sort(
+            #                        self.dependencies, 
+            #                        postsort_actions))
+            #print "-----------"
+            #print self.dependencies
+            #print r
             for rec in topological.sort(
                                     self.dependencies, 
                                     postsort_actions):
diff --git a/lib/sqlalchemy/topological.py b/lib/sqlalchemy/topological.py
index 2ae631fb59..603bb055b5 100644
--- a/lib/sqlalchemy/topological.py
+++ b/lib/sqlalchemy/topological.py
@@ -4,19 +4,7 @@
 # This module is part of SQLAlchemy and is released under
 # the MIT License: http://www.opensource.org/licenses/mit-license.php
 
-"""Topological sorting algorithms.
-
-The topological sort is an algorithm that receives this list of
-dependencies as a *partial ordering*, that is a list of pairs which
-might say, *X is dependent on Y*, *Q is dependent on Z*, but does not
-necessarily tell you anything about Q being dependent on X. Therefore,
-its not a straight sort where every element can be compared to
-another... only some of the elements have any sorting preference, and
-then only towards just some of the other elements.  For a particular
-partial ordering, there can be many possible sorts that satisfy the
-conditions.
-
-"""
+"""Topological sorting algorithms."""
 
 from sqlalchemy.exc import CircularDependencyError
 from sqlalchemy import util