Package org.chaidb.db.index.btree.bufmgr

Examples of org.chaidb.db.index.btree.bufmgr.PageNumber

74
75
76
77
78
79
80
81
    protected void initParameter(IBTree bt, BTreeSpec btSpec, PageBufferManager buffer, KernelContext kContext) {
        setBtree(bt);
        setBtreeSpec(btSpec);
        this.setBuffer(buffer);
        setCurrentPageNumber(new PageNumber());
        this.setkContext(kContext);
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
        setCurrentPageNumber(new PageNumber());
        this.setkContext(kContext);
    }

    protected void init() throws ChaiDBException {
        PageNumber root = null;

        root = getFirstSubTreeRoot();
        setVisitedRoot(new Hashtable());
        setEnumId2root(((Id2nodeBTree) getBtree()).id2root.elements());

        if (root == null) {
            setCurrentPageNumber(new PageNumber(getBtree().getBtreeId(), 0, -1));
            return;
        }
        //remember visited root
        getVisitedRoot().put(root, root);
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
                    //if it's special, get the next sub tree root
                    if (getBeForSpecialTree().hasMoreElements()) {
                        ((Id2nodeBTree) getBtree()).indexBTree.acquire(kContext, IDBIndex.READ_MODE);
                        byte[] bRoot = (byte[]) ((Id2nodeBTree) getBtree()).indexBTree.lookup((Key) getBeForSpecialTree().nextElement(), getkContext());
                        ((Id2nodeBTree) getBtree()).indexBTree.release(kContext);
                        PageNumber subroot = new PageNumber(ByteTool.bytesToInt(bRoot, 0, getBtreeSpec().isMsbFirst()));
                        subroot.setTreeId(getBtree().getBtreeId());
                        //remember visited root
                        getVisitedRoot().put(subroot, subroot);
                        TreeEnumeratorUtils.findLeftMostLeaf(this, subroot);
                    } else {
                        //return false;
                        boolean notFound = true;
                        while (getEnumId2root().hasMoreElements()) {
                            PageNumber subroot = (PageNumber) getEnumId2root().nextElement();
                            if (!getVisitedRoot().containsKey(subroot)) {
                                TreeEnumeratorUtils.findLeftMostLeaf(this, subroot);
                                getVisitedRoot().put(subroot, subroot);
                                notFound = false;
                                break;
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
        ((Id2nodeBTree) getBtree()).indexBTree.release(kContext);
        if (getBeForSpecialTree().hasMoreElements()) {
            ((Id2nodeBTree) getBtree()).indexBTree.acquire(kContext, IDBIndex.READ_MODE);
            byte[] bRoot = (byte[]) ((Id2nodeBTree) getBtree()).indexBTree.lookup((Key) getBeForSpecialTree().nextElement(), getkContext());
            ((Id2nodeBTree) getBtree()).indexBTree.release(kContext);
            PageNumber subroot = new PageNumber(ByteTool.bytesToInt(bRoot, 0, getBtreeSpec().isMsbFirst()));
            subroot.setTreeId(getBtree().getBtreeId());
            return subroot;
        }
        return null;
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
        // parameters validate
        if (change.getClass() != PageNumber.class) {
            // bad parameters
            return;
        }
        PageNumber pno = (PageNumber) change;
        if (pno.getTreeId() != treeid) {
            return;
        }
        BitMap bm;
        Integer pageInFile = new Integer(pno.getFileNumber());
        bm = (BitMap) bitMaps.get(pageInFile);
        if (bm == null) {
            bm = new BitMap(INIT_CAP);
            bitMaps.put(pageInFile, bm);
        }
        bm.set(pno.getPageInFile());
    }
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
            int pos[];
            while (it.hasNext()) {
                Map.Entry ent = (Map.Entry) it.next();
                pos = ((BitMap) ent.getValue()).getTruePositions();
                for (int i = 0; i < pos.length; i++) {
                    pnos.add(new PageNumber(treeid, ((Integer) ent.getKey()).intValue(), pos[i]));
                }
            }

            // backup changes
            int size = 0; // counter for snap file to 4k blocks
View Full Code Here
365
366
367
368
369
370
371
372
373
374
375
376
377
378
            int data_offset = in.readInt();
            size += 4;
            ArrayList pnos = new ArrayList(count);

            // read page numbers
            PageNumber pn;
            for (int i = 0; i < count; i++) {
                pn = new PageNumber(in.readInt());
                pn.setTreeId(treeid);
                pnos.add(pn);
            }
            size += 4 * count;

            int remain = data_offset - size;
View Full Code Here
124
125
126
127
128
129
130
131
132
     * Default Constructor
     */
    public DataPage(BTreeSpec btreeSpec, PageBufferManager buffer) {
        this.btreeSpec = btreeSpec;
        this.buffer = buffer;
        this.pageNumber = new PageNumber(-1, -1, -1);
        this.prevPage = new PageNumber(-1, -1, -1);
        this.nextPage = new PageNumber(-1, -1, -1);
    }
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
        this(btreeSpec, buffer);
        nextPage.setTreeId(id);
        prevPage.setTreeId(id);

        pageNumber.setTreeId(id);
        this.pageNumber = new PageNumber(pageNumber);
        this.page = buffer.getPage(id, pageNumber);
        if (this.page != null) {
            // get variables from page
            readMetaData();
        } else {
View Full Code Here
204
205
206
207
208
209
210
211
212
213
214
215
        // ### not write to page yet!
        newPage.setNodes((short) 0);
        newPage.setUpperBound((short) newPage.btreeSpec.getPageSize());

        newPage.setNextPage(new PageNumber(BTreeSpec.INVALID_PAGENO));
        newPage.setPrevPage(new PageNumber(BTreeSpec.INVALID_PAGENO));

        if (!isOverflowPage) {
            newPage.setFlags(0);
        } else {
            newPage.setOverflow();
View Full Code Here
TOP

Related Classes of org.chaidb.db.index.btree.bufmgr.PageNumber

  • org.chaidb.db.index.btree.AbstractBTree
  • org.chaidb.db.index.btree.BTree
  • org.chaidb.db.index.btree.BTreeChanges
  • org.chaidb.db.index.btree.BTreeEnumerator
  • org.chaidb.db.index.btree.BTreeNode
  • org.chaidb.db.index.btree.BTreePage
  • org.chaidb.db.index.btree.BTreeSpec
  • org.chaidb.db.index.btree.DataNode
  • org.chaidb.db.index.btree.DataPage
  • org.chaidb.db.index.btree.Debug
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.