当前位置: 首页>>代码示例>>C++>>正文


C++ GiSTentry::SetPtr方法代码示例

本文整理汇总了C++中GiSTentry::SetPtr方法的典型用法代码示例。如果您正苦于以下问题:C++ GiSTentry::SetPtr方法的具体用法?C++ GiSTentry::SetPtr怎么用?C++ GiSTentry::SetPtr使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在GiSTentry的用法示例。


在下文中一共展示了GiSTentry::SetPtr方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: ReadNode

// adjust the keys of node, which is used during the final phase of the BulkLoad algorithm
void
MT::AdjKeys (GiSTnode *node)
{
    if (node->Path().IsRoot()) {
        return;
    }

    GiSTpath parentPath = node->Path();
    parentPath.MakeParent ();
    GiSTnode *parentNode = ReadNode (parentPath);
    GiSTentry *parentEntry = parentNode->SearchPtr(node->Path().Page());  // parent entry
    assert (parentEntry != NULL);
    GiSTentry *unionEntry = node->Union();
    unionEntry->SetPtr(node->Path().Page());
    ((MTkey *) unionEntry->Key())->distance = ((MTkey *) parentEntry->Key())->distance;  // necessary to keep track of the distance from the parent
    if (!parentEntry->IsEqual(*unionEntry)) {  // replace this entry
        parentNode->DeleteEntry(parentEntry->Position());
        parentNode->Insert(*unionEntry);
        WriteNode (parentNode);
        AdjKeys (parentNode);
    }
    delete unionEntry;
    delete parentEntry;
    delete parentNode;
}
开发者ID:jsc0218,项目名称:MxTree,代码行数:26,代码来源:BulkLoad.cpp

示例2: ReadNode

void 
GiST::AdjustKeys (GiSTnode *node, GiSTnode **parent)
{
    if (node->Path().IsRoot()) {
        return;
    }

    GiSTnode *P;
    // Read in node's parent
    if (parent == NULL) {
        GiSTpath parent_path = node->Path();
        parent_path.MakeParent ();
        P = ReadNode (parent_path);
        parent = &P;
    } else {
        P = *parent;
    }

    // Get the old entry pointing to node
    GiSTentry *entry = P->SearchPtr(node->Path().Page());

    assert (entry != NULL);

    // Get union of node
    GiSTentry *actual = node->Union();
    WriteNode(node);  // added by myself for the splitted = false;
    actual->SetPtr(node->Path().Page());
    if (!entry->IsEqual(*actual)) {
        int pos = entry->Position();
        P->DeleteEntry(pos);
        P->InsertBefore(*actual, pos);
        // A split may be necessary.
        // XXX: should we do Forced Reinsert here too?
        if (P->IsOverFull(*store)) {
            Split (parent, *actual);

            GiSTpage page = node->Path().Page();
            node->Path() = P->Path();
            node->Path().MakeChild(page);
        } else {
            WriteNode (P);
            AdjustKeys (P, NULL);
        }
    }
    if (parent == &P) {
        delete P;
    }
    delete actual;
    delete entry;
}
开发者ID:jsc0218,项目名称:MxTree,代码行数:50,代码来源:GiST.cpp

示例3: Split

void MXTree::Split(GiSTnode **node, const GiSTentry& entry)
{
    double radii[2], dist, *dists = new double[(*node)->NumEntries()*2];
    int pageNums[2], cands[2];
    vector<vector<int>> vec(2);
    ((MXTnode *)(*node))->TestPromotion(radii, &dist, pageNums, cands, dists, vec);
    if (Trade((*node)->Path().IsRoot(), radii, dist, pageNums, ((MXTnode *)(*node))->GetPageNum()+1, (*node)->NumEntries())) {
        // don't split now
        delete[] dists;
        GiSTpath oldPath = (*node)->Path();

        int startPage = ((*node)->Path().IsRoot() ? rootPage : (*node)->Path().Page());
        int pageNum = ((MXTnode *)(*node))->GetPageNum();
        ((MXTfile *)store)->Deallocate(startPage, pageNum);
        startPage = ((MXTfile *)store)->Allocate(++pageNum);
        (*node)->Path().MakeSibling(startPage);
        rootPage = ((*node)->Path().IsRoot() ? startPage : rootPage);
        ((MXTnode *)(*node))->SetPageNum(pageNum);
        WriteNode(*node);

        if (!(*node)->Path().IsRoot() && startPage != oldPath.Page()) {
            GiSTpath parentPath = oldPath;
            parentPath.MakeParent();
            GiSTnode *parentNode = ReadNode(parentPath);
            GiSTentry *e = parentNode->SearchPtr(oldPath.Page());
            assert(e != NULL);
            int pos = e->Position();
            e->SetPtr(startPage);
            parentNode->DeleteEntry(pos);
            parentNode->InsertBefore(*e, pos);
            WriteNode(parentNode);
            delete parentNode;
            delete e;
        }
    } else {
        // split now
        bool bLeft = false, bNewRoot = false;

        if ((*node)->Path().IsRoot()) {
            bNewRoot = true;
            (*node)->Path().MakeChild(rootPage);
            rootPage = store->Allocate();
        }

        int oldPageNum = ((MXTnode *)(*node))->GetPageNum();
        GiSTnode *node2 = ((MXTnode *)(*node))->PickSplit(cands, dists, vec);
        delete[] dists;
        int curPageNum = ((MXTnode *)(*node))->GetPageNum();
        assert(oldPageNum >= curPageNum);
        if (oldPageNum > curPageNum) {
            ((MXTfile *)store)->Deallocate((*node)->Path().Page()+curPageNum, oldPageNum-curPageNum);
        }
        node2->Path().MakeSibling(((MXTfile *)store)->Allocate(((MXTnode *)node2)->GetPageNum()));

        WriteNode(*node);
        WriteNode(node2);
    
        GiSTentry *e = (*node)->SearchPtr(entry.Ptr());
        if (e != NULL) {
            bLeft = true;
            delete e;
        }
    
        GiSTentry *e1 = (*node)->Union();
        GiSTentry *e2 = node2->Union();
    
        e1->SetPtr((*node)->Path().Page());
        e2->SetPtr(node2->Path().Page());
        // Create new root if root is being split
        if (bNewRoot) {
            GiSTnode *root = NewNode(this);
            root->SetLevel((*node)->Level() + 1);
            root->InsertBefore(*e1, 0);
            root->InsertBefore(*e2, 1);
            root->Path().MakeRoot();
            WriteNode(root);
            delete root;
        } else {
            // Insert entry for N' in parent
            GiSTpath parentPath = (*node)->Path();
            parentPath.MakeParent();
            GiSTnode *parent = ReadNode(parentPath);
            // Find the entry for N in parent
            GiSTentry *e = parent->SearchPtr((*node)->Path().Page());
            assert(e != NULL);
            // Insert the new entry right after it
            int pos = e->Position();
            parent->DeleteEntry(pos);
            parent->InsertBefore(*e1, pos);
            parent->InsertBefore(*e2, pos+1);
            delete e;
            if (!parent->IsOverFull(*store)) {
                WriteNode(parent);
            } else {
                Split(&parent, bLeft? *e1: *e2);  // parent is the node which contains the entry inserted
                GiSTpage page = (*node)->Path().Page();
                (*node)->Path() = parent->Path();  // parent's path may change
                (*node)->Path().MakeChild(page);
                page = node2->Path().Page();
                node2->Path() = (*node)->Path();
//.........这里部分代码省略.........
开发者ID:jsc0218,项目名称:MxTree,代码行数:101,代码来源:MXTree.cpp


注:本文中的GiSTentry::SetPtr方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。