def setUp(self): self.treeset = LLTreeSet() self.k0 = long(1) self.treeset.insert(self.k0) self.k1 = long((time.time() - 3700) * 1e6) self.treeset.insert(self.k1) self.k2 = self.k1 + 1 self.treeset.insert(self.k2) self.k3 = self.k2 + 1 self.treeset.insert(self.k3) self.k10 = long(time.time() * 1e6 - 10) self.treeset.insert(self.k10) self.k11 = self.k10 + 1 self.treeset.insert(self.k11)
def setUp(self): self.treeset = LLTreeSet() self.k0 = long(1) self.treeset.insert(self.k0) self.k1 = long((time.time() - 3600 * 25) * 1e6) self.treeset.insert(self.k1) self.k2 = long((time.time() - 3600 * 4) * 1e6) self.treeset.insert(self.k2) self.k3 = long((time.time() - 3600 * 3) * 1e6) self.treeset.insert(self.k3) self.k10 = long(time.time() * 1e6 - 10) self.treeset.insert(self.k10) self.k11 = self.k10 + 1 self.treeset.insert(self.k11)
def setUp(self): self.treeset = LLTreeSet() for id in replay_ids: self.treeset.insert(id)
def _makeOne(self): from BTrees.LLBTree import LLTreeSet return LLTreeSet()