def test_to_verify_ticket_9120(self): folder = OrderedBTreeFolderBase("f1") folder['ob1'] = ob1 = DummyObject('ob1') folder['ob2'] = ob2 = DummyObject('ob2') folder['ob3'] = ob3 = DummyObject('ob3') folder['ob4'] = ob4 = DummyObject('ob4') del folder['ob2'] del folder['ob3'] self.assertEquals(folder.keys(), ['ob1', 'ob4']) self.assertEquals(map(aq_base, folder.values()), [ob1, ob4]) self.assertEquals([key in folder for key in folder], [True, True])
def test_to_verify_ticket_9120(self): folder = OrderedBTreeFolderBase("f1") folder["ob1"] = ob1 = DummyObject("ob1") folder["ob2"] = DummyObject("ob2") folder["ob3"] = DummyObject("ob3") folder["ob4"] = ob4 = DummyObject("ob4") del folder["ob2"] del folder["ob3"] self.assertEquals(folder.keys(), ["ob1", "ob4"]) self.assertEquals(map(aq_base, folder.values()), [ob1, ob4]) self.assertEquals([key in folder for key in folder], [True, True])
def testDeleteSpeed(self): folder = OrderedBTreeFolderBase("f1") for idx in xrange(100000): id = 'foo-%s' % idx folder[id] = DummyObject(id, 'bar') last = reversed(folder.keys()[-100:]) @timecall def delete(): for id in last: del folder[id] delete()