Package org.apache.accumulo.core.file.rfile.MultiLevelIndex

Examples of org.apache.accumulo.core.file.rfile.MultiLevelIndex.IndexEntry

82
83
84
85
86
87
88
89
90
91
92
    ABlockReader cacheBlock = new CachableBlockFile.CachedBlockRead(ce, data);
    BlockIndex blockIndex = null;
   
    for (int i = 0; i < 129; i++)
      blockIndex = BlockIndex.getIndex(cacheBlock, new IndexEntry(prevKey, num, 0, 0, 0));
   
    BlockIndexEntry[] indexEntries = blockIndex.getIndexEntries();
   
    for (int i = 0; i < indexEntries.length; i++) {
      int row = Integer.parseInt(indexEntries[i].getPrevKey().getRowData().toString());
View Full Code Here
152
153
154
155
156
157
158
159
160
161
162
    ABlockReader cacheBlock = new CachableBlockFile.CachedBlockRead(ce, data);
    BlockIndex blockIndex = null;
   
    for (int i = 0; i < 257; i++)
      blockIndex = BlockIndex.getIndex(cacheBlock, new IndexEntry(prevKey, num, 0, 0, 0));
   
    Assert.assertSame(null, blockIndex.seekBlock(new Key(RFileTest.nf("", 0), "cf1", "cq1"), cacheBlock));
    Assert.assertSame(null, blockIndex.seekBlock(new Key(RFileTest.nf("", 1), "cf1", "cq1"), cacheBlock));
   
    for (int i = 2; i < 6; i++) {
View Full Code Here
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
     
      if (entriesLeft == 0) {
        currBlock.close();
       
        if (iiter.hasNext()) {
          IndexEntry indexEntry = iiter.next();
          entriesLeft = indexEntry.getNumEntries();
          currBlock = getDataBlock(indexEntry);
         
          checkRange = range.afterEndKey(indexEntry.getKey());
          if (!checkRange)
            hasTop = true;

        } else {
          rk = null;
View Full Code Here
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
          if (iiter.hasPrevious())
            prevKey = new Key(iiter.peekPrevious().getKey()); // initially prevKey is the last key of the prev block
          else
            prevKey = new Key(); // first block in the file, so set prev key to minimal key
           
          IndexEntry indexEntry = iiter.next();
          entriesLeft = indexEntry.getNumEntries();
          currBlock = getDataBlock(indexEntry);

          checkRange = range.afterEndKey(indexEntry.getKey());
          if (!checkRange)
            hasTop = true;

          MByteSequence valbs = new MByteSequence(new byte[64], 0, 0);
View Full Code Here
110
111
112
113
114
115
116
117
118
119
      if (k % 1000 == 0)
        expected = k / 1000; // end key is inclusive
      else
        expected = k / 1000 + 1;
      liter = reader.lookup(new Key(String.format("%08d", k)));
      IndexEntry ie = liter.next();
      assertEquals(expected, ie.getNumEntries());
    }
   
  }
View Full Code Here
566
567
568
569
570
571
572
573
574
575
576
577
     
      if (entriesLeft == 0) {
        currBlock.close();
       
        if (iiter.hasNext()) {
          IndexEntry indexEntry = iiter.next();
          entriesLeft = indexEntry.getNumEntries();
          currBlock = getDataBlock(indexEntry);
        } else {
          rk = null;
          val = null;
          hasTop = false;
View Full Code Here
711
712
713
714
715
716
717
718
719
720
721
722
          if (iiter.hasPrevious())
            prevKey = new Key(iiter.peekPrevious().getKey()); // initially prevKey is the last key of the prev block
          else
            prevKey = new Key(); // first block in the file, so set prev key to minimal key
           
          IndexEntry indexEntry = iiter.next();
          entriesLeft = indexEntry.getNumEntries();
          currBlock = getDataBlock(indexEntry);
         
          val = new Value();
         
          MByteSequence valbs = new MByteSequence(new byte[64], 0, 0);
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
    ABlockReader cacheBlock = new CachableBlockFile.CachedBlockRead(ce, data);
    BlockIndex blockIndex = null;
   
    for (int i = 0; i < 129; i++)
      blockIndex = BlockIndex.getIndex(cacheBlock, new IndexEntry(prevKey, num, 0, 0, 0));
   
    BlockIndexEntry[] indexEntries = blockIndex.getIndexEntries();
   
    for (int i = 0; i < indexEntries.length; i++) {
      int row = Integer.parseInt(indexEntries[i].getPrevKey().getRowData().toString());
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
    ABlockReader cacheBlock = new CachableBlockFile.CachedBlockRead(ce, data);
    BlockIndex blockIndex = null;
   
    for (int i = 0; i < 257; i++)
      blockIndex = BlockIndex.getIndex(cacheBlock, new IndexEntry(prevKey, num, 0, 0, 0));
   
    Assert.assertSame(null, blockIndex.seekBlock(new Key(RFileTest.nf("", 0), "cf1", "cq1"), cacheBlock));
    Assert.assertSame(null, blockIndex.seekBlock(new Key(RFileTest.nf("", 1), "cf1", "cq1"), cacheBlock));
   
    for (int i = 2; i < 6; i++) {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
      if (k % 1000 == 0)
        expected = k / 1000; // end key is inclusive
      else
        expected = k / 1000 + 1;
      liter = reader.lookup(new Key(String.format("%08d", k)));
      IndexEntry ie = liter.next();
      assertEquals(expected, ie.getNumEntries());
    }
   
  }
View Full Code Here
TOP

Related Classes of org.apache.accumulo.core.file.rfile.MultiLevelIndex.IndexEntry

  • org.apache.accumulo.core.file.rfile.BlockIndexTest
  • org.apache.accumulo.core.file.rfile.MultiLevelIndexTest
  • org.apache.accumulo.core.file.rfile.RFile$LocalityGroupReader
    • 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.