[Zodb-checkins] CVS: Zope/lib/python/BTrees/tests - __init__.py:1.3 testBTrees.py:1.47 testConflict.py:1.13
Martijn Pieters
mj@zope.com
Wed, 14 Aug 2002 17:32:25 -0400
Update of /cvs-repository/Zope/lib/python/BTrees/tests
In directory cvs.zope.org:/tmp/cvs-serv13229/tests
Modified Files:
__init__.py testBTrees.py testConflict.py
Log Message:
Clean up indentation and trailing whitespace.
=== Zope/lib/python/BTrees/tests/__init__.py 1.2 => 1.3 ===
--- Zope/lib/python/BTrees/tests/__init__.py:1.2 Thu Mar 15 08:16:22 2001
+++ Zope/lib/python/BTrees/tests/__init__.py Wed Aug 14 17:32:24 2002
@@ -1,2 +1 @@
# If tests is a package, debugging is a bit easier.
-
=== Zope/lib/python/BTrees/tests/testBTrees.py 1.46 => 1.47 ===
--- Zope/lib/python/BTrees/tests/testBTrees.py:1.46 Thu Aug 8 14:25:10 2002
+++ Zope/lib/python/BTrees/tests/testBTrees.py Wed Aug 14 17:32:24 2002
@@ -1126,11 +1126,11 @@
## utility functions
def lsubtract(l1, l2):
- l1=list(l1)
- l2=list(l2)
- l = filter(lambda x, l1=l1: x not in l1, l2)
- l = l + filter(lambda x, l2=l2: x not in l2, l1)
- return l
+ l1=list(l1)
+ l2=list(l2)
+ l = filter(lambda x, l1=l1: x not in l1, l2)
+ l = l + filter(lambda x, l2=l2: x not in l2, l1)
+ return l
def realseq(itemsob):
return map(lambda x: x, itemsob)
=== Zope/lib/python/BTrees/tests/testConflict.py 1.12 => 1.13 ===
--- Zope/lib/python/BTrees/tests/testConflict.py:1.12 Thu Mar 28 14:28:31 2002
+++ Zope/lib/python/BTrees/tests/testConflict.py Wed Aug 14 17:32:24 2002
@@ -2,14 +2,14 @@
#
# Copyright (c) 2001, 2002 Zope Corporation and Contributors.
# All Rights Reserved.
-#
+#
# This software is subject to the provisions of the Zope Public License,
# Version 2.0 (ZPL). A copy of the ZPL should accompany this distribution.
# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
# FOR A PARTICULAR PURPOSE
-#
+#
##############################################################################
import os
@@ -50,7 +50,7 @@
del self.t[1]
def _setupConflict(self):
-
+
l=[ -5124, -7377, 2274, 8801, -9901, 7327, 1565, 17, -679,
3686, -3607, 14, 6419, -5637, 6040, -4556, -8622, 3847, 7191,
-4067]
@@ -59,7 +59,7 @@
e1=[(-1704, 0), (5420, 1), (-239, 2), (4024, 3), (-6984, 4)]
e2=[(7745, 0), (4868, 1), (-2548, 2), (-2711, 3), (-3154, 4)]
-
+
base=self.t
base.update([(i, i*i) for i in l[:20]])
b1=base.__class__(base)
@@ -126,7 +126,7 @@
b2[items[0][0]]=-9
test_merge(base, b1, b2, bm, 'merge conflicting update and delete',
should_fail=1)
-
+
def testMergeInserts(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -140,7 +140,7 @@
bm[99999]=99999
bm[e1[2][0]]=e1[2][1]
test_merge(base, b1, b2, bm, 'merge insert')
-
+
def testMergeInsertsFromEmpty(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -155,7 +155,7 @@
bm.update(e2)
test_merge(base, b1, b2, bm, 'merge insert from empty')
-
+
def testMergeEmptyAndFill(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -165,7 +165,7 @@
bm.update(e2)
test_merge(base, b1, b2, bm, 'merge insert from empty')
-
+
def testMergeEmpty(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -182,7 +182,7 @@
b2[e1[0][0]]=e1[0][1]
test_merge(base, b1, b2, bm, 'merge conflicting inserts',
should_fail=1)
-
+
class NormalSetTests(Base):
""" Test common to all set types """
@@ -192,7 +192,7 @@
class ExtendedSetTests(NormalSetTests):
"Set (as opposed to TreeSet) specific tests."
- def _setupConflict(self):
+ def _setupConflict(self):
l=[ -5124, -7377, 2274, 8801, -9901, 7327, 1565, 17, -679,
3686, -3607, 14, 6419, -5637, 6040, -4556, -8622, 3847, 7191,
-4067]
@@ -200,7 +200,7 @@
e1=[-1704, 5420, -239, 4024, -6984]
e2=[7745, 4868, -2548, -2711, -3154]
-
+
base=self.t
base.update(l)
b1=base.__class__(base)
@@ -229,7 +229,7 @@
b2.remove(items[0])
test_merge(base, b1, b2, bm, 'merge conflicting delete',
should_fail=1)
-
+
def testMergeInserts(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -243,7 +243,7 @@
bm.insert(99999)
bm.insert(e1[2])
test_merge(base, b1, b2, bm, 'merge insert')
-
+
def testMergeInsertsFromEmpty(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -258,7 +258,7 @@
bm.update(e2)
test_merge(base, b1, b2, bm, 'merge insert from empty')
-
+
def testMergeEmptyAndFill(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -268,7 +268,7 @@
bm.update(e2)
test_merge(base, b1, b2, bm, 'merge insert from empty')
-
+
def testMergeEmpty(self):
base, b1, b2, bm, e1, e2, items = self._setupConflict()
@@ -285,7 +285,7 @@
b2.insert(e1[0])
test_merge(base, b1, b2, bm, 'merge conflicting inserts',
should_fail=1)
-
+
def test_merge(o1, o2, o3, expect, message='failed to merge', should_fail=0):
s1=o1.__getstate__()
@@ -304,10 +304,10 @@
else:
merged=o1._p_resolveConflict(s1, s2, s3)
assert merged==expected, message
-
+
class BucketTests(MappingBase):
""" Tests common to all buckets """
-
+
class BTreeTests(MappingBase):
""" Tests common to all BTrees """
@@ -351,7 +351,7 @@
class TestIOTreeSets(NormalSetTests, TestCase):
def setUp(self):
self.t = IOTreeSet()
-
+
class TestOOTreeSets(NormalSetTests, TestCase):
def setUp(self):
self.t = OOTreeSet()
@@ -363,7 +363,7 @@
class TestOITreeSets(NormalSetTests, TestCase):
def setUp(self):
self.t = OITreeSet()
-
+
## Bucket tests
class TestIOBuckets(BucketTests, TestCase):
@@ -403,7 +403,7 @@
TOOBucket = makeSuite(TestOOBuckets, 'test')
TOIBucket = makeSuite(TestOIBuckets, 'test')
TIIBucket = makeSuite(TestIIBuckets, 'test')
-
+
alltests = TestSuite((TIOSet, TOOSet, TOISet, TIISet,
TIOTreeSet, TOOTreeSet, TOITreeSet, TIITreeSet,
TIOBucket, TOOBucket, TOIBucket, TIIBucket,
@@ -414,11 +414,11 @@
## utility functions
def lsubtract(l1, l2):
- l1=list(l1)
- l2=list(l2)
- l = filter(lambda x, l1=l1: x not in l1, l2)
- l = l + filter(lambda x, l2=l2: x not in l2, l1)
- return l
+ l1=list(l1)
+ l2=list(l2)
+ l = filter(lambda x, l1=l1: x not in l1, l2)
+ l = l + filter(lambda x, l2=l2: x not in l2, l1)
+ return l
def realseq(itemsob):
return map(lambda x: x, itemsob)
@@ -428,4 +428,3 @@
if __name__ == '__main__':
main()
-