Package org.apache.hadoop.hbase.codec.prefixtree.scanner

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellScannerPosition

65
66
67
68
69
70
71
72
73
    /**
     * The searcher should get a token mismatch on the "r" branch. Assert that it skips not only rA,
     * but rB as well.
     */
    KeyValue afterLast = KeyValueUtil.createFirstOnRow(Bytes.toBytes("zzz"));
    CellScannerPosition position = searcher.positionAtOrAfter(afterLast);
    Assert.assertEquals(CellScannerPosition.AFTER_LAST, position);
    Assert.assertNull(searcher.current());
  }
View Full Code Here
183
184
185
186
187
188
189
190
191
192
193
   */

  protected int seekToOrBeforeUsingPositionAtOrBefore(Cell kv, boolean seekBefore) {
    // this does a deep copy of the key byte[] because the CellSearcher
    // interface wants a Cell
    CellScannerPosition position = ptSearcher.seekForwardToOrBefore(kv);

    if (CellScannerPosition.AT == position) {
      if (seekBefore) {
        ptSearcher.previous();
        return 1;
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
    return seekToOrBeforeUsingPositionAtOrAfter(kv, seekBefore);
  }

  protected int seekToOrBeforeUsingPositionAtOrAfter(Cell kv, boolean seekBefore) {
    // should probably switch this to use the seekForwardToOrBefore method
    CellScannerPosition position = ptSearcher.seekForwardToOrAfter(kv);

    if (CellScannerPosition.AT == position) {
      if (seekBefore) {
        // We need not set movedToPrevious because the intention is to seekBefore
        ptSearcher.previous();
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
  protected int seekToOrBeforeUsingPositionAtOrBefore(byte[] keyOnlyBytes, int offset, int length,
      boolean seekBefore){
    // this does a deep copy of the key byte[] because the CellSearcher interface wants a Cell
    KeyValue kv = KeyValue.createKeyValueFromKey(keyOnlyBytes, offset, length);

    CellScannerPosition position = ptSearcher.seekForwardToOrBefore(kv);

    if(CellScannerPosition.AT == position){
      if (seekBefore) {
        ptSearcher.previous();
        return 1;
View Full Code Here
194
195
196
197
198
199
200
201
202
203
204
      boolean seekBefore){
    // this does a deep copy of the key byte[] because the CellSearcher interface wants a Cell
    KeyValue kv = KeyValue.createKeyValueFromKey(keyOnlyBytes, offset, length);

    //should probably switch this to use the seekForwardToOrBefore method
    CellScannerPosition position = ptSearcher.seekForwardToOrAfter(kv);

    if(CellScannerPosition.AT == position){
      if (seekBefore) {
        ptSearcher.previous();
        return 1;
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
          KeyValue kv = rows.getInputs().get(i);

          //nextRow
          KeyValue inputNextRow = KeyValueUtil.createFirstKeyInNextRow(kv);

          CellScannerPosition position = beforeVsAfterOnMiss
              ? searcher.positionAtOrBefore(inputNextRow)
              : searcher.positionAtOrAfter(inputNextRow);
          boolean isFirstInRow = rowStartIndexes.contains(i);
          if(isFirstInRow){
            int rowIndex = rowStartIndexes.indexOf(i);
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
      // seek with half bytes of second row key, should return second row
      KeyValue kv = rows.getInputs().get(1);
      KeyValue firstKVOnRow = KeyValueUtil.createFirstOnRow(Arrays.copyOfRange(
          kv.getRowArray(), kv.getRowOffset(),
          kv.getRowOffset() + kv.getRowLength() / 2));
      CellScannerPosition position = searcher.positionAtOrAfter(firstKVOnRow);
      Assert.assertEquals(CellScannerPosition.AFTER, position);
      Assert.assertEquals(kv, searcher.current());
    } finally {
      DecoderFactory.checkIn(searcher);
    }
View Full Code Here
70
71
72
73
74
75
76
77
78
    /**
     * The searcher should get a token mismatch on the "r" branch. Assert that
     * it skips not only rA, but rB as well.
     */
    KeyValue afterLast = KeyValue.createFirstOnRow(Bytes.toBytes("zzz"));
    CellScannerPosition position = searcher.positionAtOrAfter(afterLast);
    Assert.assertEquals(CellScannerPosition.AFTER_LAST, position);
    Assert.assertNull(searcher.current());
  }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    /**
     * The searcher should get a token mismatch on the "r" branch.  Assert that it skips not only
     * rA, but rB as well.
     */
    KeyValue cfcRow = KeyValue.createFirstOnRow(Bytes.toBytes("cfc"));
    CellScannerPosition position = searcher.positionAtOrAfter(cfcRow);
    Assert.assertEquals(CellScannerPosition.AFTER, position);
    Assert.assertEquals(d.get(2), searcher.current());
    searcher.previous();
    Assert.assertEquals(d.get(1), searcher.current());
  }
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
  protected int seekToOrBeforeUsingPositionAtOrBefore(byte[] keyOnlyBytes, int offset, int length,
      boolean seekBefore){
    // this does a deep copy of the key byte[] because the CellSearcher interface wants a Cell
    KeyValue kv = KeyValue.createKeyValueFromKey(keyOnlyBytes, offset, length);

    CellScannerPosition position = ptSearcher.seekForwardToOrBefore(kv);

    if(CellScannerPosition.AT == position){
      if (seekBefore) {
        ptSearcher.previous();
        return 1;
View Full Code Here
TOP

Related Classes of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellScannerPosition

  • org.apache.hadoop.hbase.codec.prefixtree.PrefixTreeSeeker
  • org.apache.hadoop.hbase.codec.prefixtree.row.data.TestRowDataDeeper
  • org.apache.hadoop.hbase.codec.prefixtree.row.data.TestRowDataSearcherRowMiss
  • org.apache.hadoop.hbase.codec.prefixtree.row.data.TestRowDataSimple
  • org.apache.hadoop.hbase.codec.prefixtree.row.data.TestRowDataTrivial
  • org.apache.hadoop.hbase.codec.prefixtree.row.data.TestRowDataTrivialWithTags
  • org.apache.hadoop.hbase.codec.prefixtree.row.TestPrefixTreeSearcher
    • 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.