-whitespace bonanza, contd

2 files changed, 6 insertions, 6 deletions

diff --git a/lib/sqlalchemy/util/queue.py b/lib/sqlalchemy/util/queue.py
index 571456577..650733288 100644
--- a/lib/sqlalchemy/util/queue.py
+++ b/lib/sqlalchemy/util/queue.py
@@ -186,7 +186,7 @@ class Queue:
     def abort(self, context):
         """Issue an 'abort', will force any thread waiting on get()
         to stop waiting and raise SAAbort.
-        
+
         """
         self._sqla_abort_context = context
         if not self.not_full.acquire(False):
diff --git a/lib/sqlalchemy/util/topological.py b/lib/sqlalchemy/util/topological.py
index 2ba86b23d..58227af20 100644
--- a/lib/sqlalchemy/util/topological.py
+++ b/lib/sqlalchemy/util/topological.py
@@ -29,7 +29,7 @@ def sort_as_subsets(tuples, allitems):
         if not output:
             raise CircularDependencyError(
                     "Circular dependency detected.",
-                    find_cycles(tuples, allitems), 
+                    find_cycles(tuples, allitems),
                     _gen_edges(edges)
                 )
 
@@ -56,7 +56,7 @@ def find_cycles(tuples, allitems):
 
     output = set()
 
-    # we'd like to find all nodes that are 
+    # we'd like to find all nodes that are
     # involved in cycles, so we do the full
     # pass through the whole thing for each
     # node in the original list.
@@ -86,7 +86,7 @@ def find_cycles(tuples, allitems):
 
 def _gen_edges(edges):
     return set([
-                    (right, left) 
-                    for left in edges 
-                    for right in edges[left] 
+                    (right, left)
+                    for left in edges
+                    for right in edges[left]
                 ])