def testLotsOfLittleOnes(self): from random import shuffle N = 5000 inputs = [] mkset, mktreeset = self.mkset, self.mktreeset for i in range(N): base = i * 4 - N inputs.append(mkset([base, base + 1])) inputs.append(mktreeset([base + 2, base + 3])) shuffle(inputs) output = self.multiunion(inputs) self.assertEqual(len(output), N * 4) self.assertEqual(list(output), range(-N, 3 * N))
def testLotsOfLittleOnes(self): from random import shuffle N = 5000 inputs = [] mkset, mktreeset = self.mkset, self.mktreeset for i in range(N): base = i * 4 - N inputs.append(mkset([base, base+1])) inputs.append(mktreeset([base+2, base+3])) shuffle(inputs) output = self.multiunion(inputs) self.assertEqual(len(output), N*4) self.assertEqual(list(output), range(-N, 3*N))
def mktreeset(self, *args): from BTrees.LFBTree import LFTreeSet as mktreeset return mktreeset(*args)
def mktreeset(self, *args): from BTrees.IOBTree import IOTreeSet as mktreeset return mktreeset(*args)
def mktreeset(self, *args): from BTrees.IIBTree import IITreeSetPy as mktreeset return mktreeset(*args)