Package org.apache.hadoop.hbase

Examples of org.apache.hadoop.hbase.KeyValue$KeyComparator

557
558
559
560
561
562
563
564
565
566
567
568
569
   */
  protected void removeNonReplicableEdits(WALEdit edit) {
    NavigableMap<byte[], Integer> scopes = edit.getScopes();
    List<KeyValue> kvs = edit.getKeyValues();
    for (int i = edit.size()-1; i >= 0; i--) {
      KeyValue kv = kvs.get(i);
      // The scope will be null or empty if
      // there's nothing to replicate in that WALEdit
      if (scopes == null || !scopes.containsKey(kv.getFamily())) {
        kvs.remove(i);
      }
    }
  }
View Full Code Here
575
576
577
578
579
580
581
582
583
584
585
   * @return number of different row keys
   */
  private int countDistinctRowKeys(WALEdit edit) {
    List<KeyValue> kvs = edit.getKeyValues();
    int distinctRowKeys = 1;
    KeyValue lastKV = kvs.get(0);
    for (int i = 0; i < edit.size(); i++) {
      if (!kvs.get(i).matchingRow(lastKV)) {
        distinctRowKeys++;
      }
    }
View Full Code Here
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
    startRegionOperation();
    this.readRequestsCount.increment();
    try {
      Store store = getStore(family);
      // get the closest key. (HStore.getRowKeyAtOrBefore can return null)
      KeyValue key = store.getRowKeyAtOrBefore(row);
      Result result = null;
      if (key != null) {
        Get get = new Get(key.getRow());
        get.addFamily(family);
        result = get(get, null);
      }
      if (coprocessorHost != null) {
        coprocessorHost.postGetClosestRowBefore(row, family, result);
View Full Code Here
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
            continue;
          }
          if (result.size() > count) {
            throw new RuntimeException("Unexpected size: " + result.size());
          }
          KeyValue getkv = result.get(count - 1);
          Bytes.putBytes(kv.getBuffer(), kv.getTimestampOffset(),
              getkv.getBuffer(), getkv.getTimestampOffset(), Bytes.SIZEOF_LONG);
        } else {
          kv.updateLatestStamp(byteNow);
        }
      }
    }
View Full Code Here
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
          matches = true;
        } else if (result.size() > 0 && result.get(0).getValue().length == 0 &&
            valueIsNull) {
          matches = true;
        } else if (result.size() == 1 && !valueIsNull) {
          KeyValue kv = result.get(0);
          int compareResult = comparator.compareTo(kv.getBuffer(),
              kv.getValueOffset(), kv.getValueLength());
          switch (compareOp) {
          case LESS:
            matches = compareResult <= 0;
            break;
          case LESS_OR_EQUAL:
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
113
      for (HLog.Entry entry : entries) {
        WALEdit edit = entry.getEdit();
        byte[] table = entry.getKey().getTablename();
        Put put = null;
        Delete del = null;
        KeyValue lastKV = null;
        List<KeyValue> kvs = edit.getKeyValues();
        for (KeyValue kv : kvs) {
          if (lastKV == null || lastKV.getType() != kv.getType() || !lastKV.matchingRow(kv)) {
            if (kv.isDelete()) {
              del = new Delete(kv.getRow());
              del.setClusterId(entry.getKey().getClusterId());
              addToMultiMap(rows, table, del);
            } else {
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
     */
    value = Bytes.toBytes(98L);
    id = 35;
    bldr = new CompleteIndexBuilder(columnDescriptor,
      new IdxIndexDescriptor(QUALIFIER, IdxQualifierType.LONG));
    bldr.addKeyValue(new KeyValue(ROW, FAMILY, QUALIFIER, value), id);
    Assert.assertTrue(
      bldr.finalizeIndex(NUM_KEY_VALUES).lookup(value).contains(id));

    /**
     * Test double type
     */
    value = Bytes.toBytes(9.8D);
    id = 899;
    bldr = new CompleteIndexBuilder(columnDescriptor,
      new IdxIndexDescriptor(QUALIFIER, IdxQualifierType.DOUBLE));
    bldr.addKeyValue(new KeyValue(ROW, FAMILY, QUALIFIER, value), id);
    Assert.assertTrue(
      bldr.finalizeIndex(NUM_KEY_VALUES).lookup(value).contains(id));

    /**
     * Test the byte array type
     */
    value = Bytes.toBytes(this.getClass().getName());
    id = 1016;
    bldr = new CompleteIndexBuilder(columnDescriptor,
      new IdxIndexDescriptor(QUALIFIER, IdxQualifierType.BYTE_ARRAY));
    bldr.addKeyValue(new KeyValue(ROW, FAMILY, QUALIFIER, value), id);
    Assert.assertTrue(
      bldr.finalizeIndex(NUM_KEY_VALUES).lookup(value).contains(id));

  }
View Full Code Here
296
297
298
299
300
301
302
303
304
305
    HColumnDescriptor columnDescriptor = new HColumnDescriptor(FAMILY);
    CompleteIndexBuilder completeIndex =
      new CompleteIndexBuilder(columnDescriptor,
        new IdxIndexDescriptor(QUALIFIER, IdxQualifierType.LONG));
    for (int i = 0; i < values.length; i++) {
      completeIndex.addKeyValue(new KeyValue(Bytes.toBytes(ids[i]), FAMILY,
        QUALIFIER, Bytes.toBytes(values[i])), ids[i]);
    }
    return (CompleteIndex) completeIndex.finalizeIndex(NUM_KEY_VALUES);
  }
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
      seekNext();
      super.nextRow(currentRow);
    }

    protected void seekNext() throws IOException {
      KeyValue keyValue;
      do {
        keyValue = keyProvider.next();

        if (keyValue == null) {
          // out of results keys, nothing more to process
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
      // this seems a bit pointless because the memstore only ever returns an
      // array with only one element, but just incase...
      KeyValueScanner[] memstorescanners = store.memstore.getScanners();
      // to make sure we don't provide rows that the scan is not interested in
      // we seekTo the scan's startRow
      KeyValue seekTo = KeyValue.createFirstOnRow(startRow);
      for (int i = memstorescanners.length - 1; i >= 0; i--) {
        memstorescanners[i].seek(seekTo);
        scanners.add(memstorescanners[i]);
      }
View Full Code Here
TOP

Related Classes of org.apache.hadoop.hbase.KeyValue$KeyComparator

  • co.cask.tigon.data.increment.hbase94.IncrementSummingScanner
  • co.cask.tigon.data.transaction.queue.coprocessor.hbase94.HBaseQueueRegionObserver$EvictionInternalScanner
  • com.alibaba.wasp.storage.NullStorageServices
  • com.salesforce.hbase.index.covered.data.IndexMemStore$MemStoreScanner
  • com.salesforce.hbase.index.covered.TestLocalTableState
  • com.salesforce.phoenix.coprocessor.MetaDataEndpointImpl
  • com.salesforce.phoenix.coprocessor.SequenceRegionObserver
  • com.salesforce.phoenix.schema.Sequence
  • com.salesforce.phoenix.schema.tuple.MultiKeyValueTuple
  • com.salesforce.phoenix.util.KeyValueUtil
    • 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.