def performance_it_build2(): #tag access global dt_root, max_items dt = iTree('root') #append itertree with items dt = iTree('root', subtree=[iTree('%i' % i) for i in range(max_items)]) dt_root = dt
def performance_it_build_insert(): #tag access global dt_root, max_items dt = iTree('root') #dt.pre_alloc_list(max_items) #append itertree with items for i in range(max_items): dt.insert(1, iTree('%i' % i))
def performance_it_build(): #tag access global dt_root, max_items dt = iTree('root') #dt.pre_alloc_list(max_items) #append itertree with items append_item = dt for i in range(max_items): for ii in range(max_items): new = iTree('%i' % i) append_item.append(new) append_item = new # we extend on last item (search for this element might be slower) dt_root = dt
def performance_it_load(): global dt_root, fh, load_root fh.seek(0) load_root = iTree('tmp').load(fh)