Package com.hp.hpl.jena.tdb.base.record

Examples of com.hp.hpl.jena.tdb.base.record.Record

251
252
253
254
255
256
257
258
259
260
       
        System.err.println("nodeIndex >>>") ;
        Iterator<Record> iter2 = this.nodeIndex.iterator() ;
        for ( ; iter2.hasNext() ; )
        {
            Record r = iter2.next() ;
            System.err.println(r) ;
        }
        System.err.println("<<<<<<<<<<") ;
    }
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
                if ( ! iter.hasNext() )
                    System.out.println("<<Empty>>") ;
               
                for ( ; iter.hasNext() ; )
                {
                    Record r = iter.next();
                    printRecord("", System.out, r, keyUnitLen) ;
                }
            }
           
            // Check.
            Iterator<Record> iterCheck = bpt.iterator() ;
            Record r1 = null ;
            int i = 0 ;
            for ( ; iterCheck.hasNext() ; )
            {
                Record r2 = iterCheck.next();
                i++ ;
               
                if ( r1 != null )
                {
                    if ( ! Record.keyLT(r1, r2) )
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
        RecordFactory rf = bpt1.getRecordFactory() ;
       
        Iterator<Record> iter1 = bpt1.iterator() ;
        long counter = 0 ;
        // Use the same slot each time.
        Record r2 = rf.create() ;
       
        for ( ; iter1.hasNext(); )
        {
            counter++ ;
            Record r = iter1.next() ;
            byte[] key1 = r.getKey() ;
           
            long i1 = Bytes.getLong(key1, 0 ) ;
            long i2 = Bytes.getLong(key1, 8 ) ;
            long i3 = Bytes.getLong(key1, 16 ) ;
           
View Full Code Here
182
183
184
185
186
187
188
189
    public static Record search(BPTreeNode root, Record rec)
    {
        root.internalCheckNodeDeep() ;
        if ( root.id != 0 )
            throw new BPTreeException("Search not starting from the root: "+root) ;
        Record r = root.internalSearch(rec) ;
        return r ;
    }
View Full Code Here
207
208
209
210
211
212
213
214
215
216
217
            splitRoot(root) ;
            if ( DumpTree ) root.dump() ;
        }
       
        // Root ready - call insert proper.
        Record result = root.internalInsert(record) ;
       
        root.internalCheckNodeDeep() ;
   
        if ( logging() )
        {
View Full Code Here
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
        {
            // Special case.  Just a records block.  Allow that to go too small.
            BPTreePage page = root.get(0, WRITE) ;
            if ( CheckingNode && ! ( page instanceof BPTreeRecords ) )
                root.error("Zero size leaf root but not pointing a records block") ;
            Record r = page.internalDelete(rec) ;
            page.release() ;
            return r ;
        }
       
        // Entry: checkNodeDeep() ;
        Record v = root.internalDelete(rec) ;

        // Fix root in case it became empty in deletion process.
        if ( ! root.isLeaf && root.count == 0 )
        {
            root.reduceRoot() ;
View Full Code Here
298
299
300
301
302
303
304
305
306
    @Override
    protected Record maxRecord()
    {
        BPTreePage page = get(count, READ) ;
        Record r = page.maxRecord() ;
        page.release() ;
        return r ;
    }
View Full Code Here
307
308
309
310
311
312
313
314
315
    @Override
    protected Record minRecord()
    {
        BPTreePage page = get(0, READ) ;
        Record r = page.minRecord() ;
        page.release() ;
        return r ;
    }
View Full Code Here
403
404
405
406
407
408
409
410
411
    @Override final
    Record internalSearch(Record rec)
    {
        if ( CheckingNode ) internalCheckNode() ;
        BPTreePage page = findHere(rec) ;
        Record r = page.internalSearch(rec) ;
        page.release() ;
        return r ;
    }
View Full Code Here
463
464
465
466
467
468
469
470
471
                page = get(idx, READ) ;
            }
            internalCheckNode() ;
        }

        Record r = page.internalInsert(record) ;
        page.release() ;
        return r ;
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.tdb.base.record.Record

  • com.hp.hpl.jena.tdb.base.buffer.RecordBuffer
  • com.hp.hpl.jena.tdb.base.buffer.RecordBufferIterator
  • com.hp.hpl.jena.tdb.base.buffer.TestRecordBuffer
  • com.hp.hpl.jena.tdb.base.record.TestRecord
  • com.hp.hpl.jena.tdb.base.recordbuffer.RecordRangeIterator
  • com.hp.hpl.jena.tdb.base.recordfile.TestRecordBufferPage
  • com.hp.hpl.jena.tdb.index.bplustree.BPlusTree
  • com.hp.hpl.jena.tdb.index.bplustree.BPlusTreeRewriter
  • com.hp.hpl.jena.tdb.index.bplustree.BPlusTreeRewriter$RebalenceBase
  • com.hp.hpl.jena.tdb.index.bplustree.BPlusTreeRewriter$RebalenceDataEnd
    • 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.