List of positionAtOrAfter() Examples

Examples of positionAtOrAfter()

org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()
Same as positionAt(..), but go to the extra effort of finding the next key if there's no exact match.
@param key position the CellScanner on this key or the closest cell after @return AT if exact match
AFTER if on first cell after key
AFTER_LAST if key was after the last cell in this scanner's scope

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()


        //previous KV
        KeyValue inputPreviousKv = KeyValueUtil.previousKey(kv);
        boolean hit = searcher.positionAt(inputPreviousKv);
        Assert.assertFalse(hit);
        position = searcher.positionAtOrAfter(inputPreviousKv);
        if(CollectionUtils.isLastIndex(rows.getInputs(), i)){
          Assert.assertTrue(CellScannerPosition.AFTER_LAST == position);
        }else{
          Assert.assertTrue(CellScannerPosition.AFTER == position);
          /*

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()

          //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);
            if(rowIndex < rowStartIndexes.size() - 1){
              if(beforeVsAfterOnMiss){

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()


          //previous KV
          KeyValue inputPreviousKv = KeyValueUtil.previousKey(kv);
          boolean hit = searcher.positionAt(inputPreviousKv);
          Assert.assertFalse(hit);
          position = searcher.positionAtOrAfter(inputPreviousKv);
          if(CollectionUtils.isLastIndex(rows.getInputs(), i)){
            Assert.assertTrue(CellScannerPosition.AFTER_LAST == position);
          }else{
            Assert.assertTrue(CellScannerPosition.AFTER == position);
            /*

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()

      // 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

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()

          //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);
            if(rowIndex < rowStartIndexes.size() - 1){
              if(beforeVsAfterOnMiss){

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()


          //previous KV
          KeyValue inputPreviousKv = KeyValueUtil.previousKey(kv);
          boolean hit = searcher.positionAt(inputPreviousKv);
          Assert.assertFalse(hit);
          position = searcher.positionAtOrAfter(inputPreviousKv);
          if(CollectionUtils.isLastIndex(rows.getInputs(), i)){
            Assert.assertTrue(CellScannerPosition.AFTER_LAST == position);
          }else{
            Assert.assertTrue(CellScannerPosition.AFTER == position);
            /*

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()

          //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);
            if(rowIndex < rowStartIndexes.size() - 1){
              if(beforeVsAfterOnMiss){

View Full Code Here

Examples of org.apache.hadoop.hbase.codec.prefixtree.scanner.CellSearcher.positionAtOrAfter()


          //previous KV
          KeyValue inputPreviousKv = KeyValueUtil.previousKey(kv);
          boolean hit = searcher.positionAt(inputPreviousKv);
          Assert.assertFalse(hit);
          position = searcher.positionAtOrAfter(inputPreviousKv);
          if(CollectionUtils.isLastIndex(rows.getInputs(), i)){
            Assert.assertTrue(CellScannerPosition.AFTER_LAST == position);
          }else{
            Assert.assertTrue(CellScannerPosition.AFTER == position);
            /*

View Full Code Here

TOP

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.