From 04a814f97bd2793ef62f3becb93e840d09bf3ad8 Mon Sep 17 00:00:00 2001 From: Mike Bayer Date: Tue, 6 Apr 2010 01:42:58 -0400 Subject: [PATCH] remove prints --- lib/sqlalchemy/orm/unitofwork.py | 12 ++++++------ lib/sqlalchemy/topological.py | 14 +------------- 2 files changed, 7 insertions(+), 19 deletions(-) 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 -- 2.47.3