示例#1
0
 def b_index(self):
     visited = set()
     for p in self.pp:
         if p not in visited:
             visited.add(p)
             page = Ipage(page_offset=p, filename=self.filename)
             for attr, key_size in zip(self.index_attrs, self.key_sizes):
                 tree = self.trees[attr]
                 page.store_to_tree(tree, self.type, attr, self.filename)
         else:
             continue
     visited.clear()
示例#2
0
 def b_index(self):
     visited = set()
     for p in self.pp:
         if p not in visited:
             visited.add(p)
             page = Ipage(page_offset=p, filename=self.filename)
             for attr, key_size in zip(self.index_attrs, self.key_sizes):
                 tree = self.trees[attr]
                 page.store_to_tree(tree, self.type, attr, self.filename)
         else:
             continue
     visited.clear()
示例#3
0
def page_test():
    studs = get_dataset()
    p = Ipage()
    open('page.txt', 'w').close()
    from mx.BeeBase import BeeDict
    tree = BeeDict.BeeStringDict(os.getcwd() + '/storage/' + student.__name__ + 'name',
                                                 keysize=256)

    for stud in studs[0:10]:
        p.insert(stud)
        p.store('page.txt', 0)
    p.store_to_tree(tree, student, 'name', 'page.txt')
    print (zip(tree.keys(), tree.values()))
    tree.close()
示例#4
0
def page_test():
    studs = get_dataset()
    p = Ipage()
    open('page.txt', 'w').close()
    from mx.BeeBase import BeeDict
    tree = BeeDict.BeeStringDict(os.getcwd() + '/storage/' + student.__name__ +
                                 'name',
                                 keysize=256)

    for stud in studs[0:10]:
        p.insert(stud)
        p.store('page.txt', 0)
    p.store_to_tree(tree, student, 'name', 'page.txt')
    print(zip(tree.keys(), tree.values()))
    tree.close()