summaryrefslogtreecommitdiff
path: root/test/dependency.py
diff options
context:
space:
mode:
authorMike Bayer <mike_mp@zzzcomputing.com>2005-10-31 00:14:01 +0000
committerMike Bayer <mike_mp@zzzcomputing.com>2005-10-31 00:14:01 +0000
commit3f51e45483fb1f3c5b29b5473bd62e76ebd0e9af (patch)
tree475e5e0e9551efe7cd7e1c235eddc70f625a8a41 /test/dependency.py
parent51366310ee6e4214300ee77b3c002e47e1875cd6 (diff)
downloadsqlalchemy-3f51e45483fb1f3c5b29b5473bd62e76ebd0e9af.tar.gz
dependency sort....bleah
Diffstat (limited to 'test/dependency.py')
-rw-r--r--test/dependency.py22
1 files changed, 10 insertions, 12 deletions
diff --git a/test/dependency.py b/test/dependency.py
index d08df45e9..5dbc9be4a 100644
--- a/test/dependency.py
+++ b/test/dependency.py
@@ -59,31 +59,29 @@ class DependencySortTest(PersistTest):
node3 = thingy('items')
tuples = [
(node1, node2),
- (node3, node2)
+ (node3, node2),
+ (node1,node3)
]
-# head1 = util.DependencySorter(tuples, [node1, node2, node3]).sort()
+ head1 = util.DependencySorter(tuples, [node1, node2, node3]).sort()
head2 = util.DependencySorter(tuples, [node3, node1, node2]).sort()
- # head3 = util.DependencySorter(tuples, [node3, node2, node1]).sort()
+ head3 = util.DependencySorter(tuples, [node3, node2, node1]).sort()
# TODO: figure out a "node == node2" function
#self.assert_(str(head1) == str(head2) == str(head3))
- # print "\n" + str(head1)
+ print "\n" + str(head1)
print "\n" + str(head2)
- # print "\n" + str(head3)
+ print "\n" + str(head3)
def testsort4(self):
node1 = thingy('keywords')
node2 = thingy('itemkeyowrds')
node3 = thingy('items')
- node4 = thingy('lala')
- node5 = thingy('hoho')
-
+ node4 = thingy('hoho')
tuples = [
(node1, node2),
- (node5, node3),
- (node4, node2),
- (node3, node2),
-
+ (node4, node1),
+ (node1, node3),
+ (node3, node2)
]
head = util.DependencySorter(tuples, []).sort()
print "\n" + str(head)