Java KeyValue.KVComparator方法代碼示例

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
/**
 * Constructor.
 * @param c Comparator
 */
public DefaultMemStore(final Configuration conf,
                final KeyValue.KVComparator c) {
  this.conf = conf;
  this.comparator = c;
  this.cellSet = new CellSkipListSet(c);
  this.snapshot = new CellSkipListSet(c);
  timeRangeTracker = new TimeRangeTracker();
  snapshotTimeRangeTracker = new TimeRangeTracker();
  this.size = new AtomicLong(DEEP_OVERHEAD);
  this.snapshotSize = 0;
  if (conf.getBoolean(USEMSLAB_KEY, USEMSLAB_DEFAULT)) {
    String className = conf.get(MSLAB_CLASS_NAME, HeapMemStoreLAB.class.getName());
    this.allocator = ReflectionUtils.instantiateWithCustomCtor(className,
        new Class[] { Configuration.class }, new Object[] { conf });
  } else {
    this.allocator = null;
  }
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
public LCIndexQueryProcessor(Scan rawScan, IndexTableRelation indexTableRelation,
    ScanRange primaryRange, ScanRange.ScanRangeList rangeList, HStore store,
    NavigableSet<byte[]> columns, long readPt, KeyValue.KVComparator comparator)
    throws IOException {
  this.rawScan = rawScan;
  this.indexTableRelation = indexTableRelation;
  this.primaryRange = primaryRange;
  this.store = store;
  this.rangeList = rangeList;
  LCIndexMemStoreScanner2 memStoreScanner = getMemstoreScanner(columns, readPt);
  iFileScan = createScanOnIFile(rawScan, primaryRange, rangeList);
  KeyValueScanner scanner =
      store.getLCIndexScanner(iFileScan, columns, readPt, primaryRange, memStoreScanner);
  List<KeyValueScanner> lcIndexScanners = new ArrayList<>();
  lcIndexScanners.add(scanner);
  lcIndexStoreHeap = new KeyValueHeap(lcIndexScanners, comparator);
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
LCIndexQueryProcessor createLCIndexProcessor(IndexTableRelation indexTableRelation,
    Map<byte[], Store> storeMap, Scan scan, long readPt, KeyValue.KVComparator comparator) {
  try {
    ScanRange.ScanRangeList rangeList = ScanRange.ScanRangeList.getScanRangeList(scan);
    checkSingleScanFamily(scan, rangeList);
    // calculate the primary range for scan
    ScanRange primaryRange =
        selectTheBestRange(indexTableRelation, storeMap, rangeList, scan.getId());
    if (primaryRange != null) {
      printRanges(primaryRange, rangeList);
      return new LCIndexQueryProcessor(scan, indexTableRelation, primaryRange, rangeList,
          (HStore) storeMap.get(primaryRange.getFamily()),
          scan.getFamilyMap().get(primaryRange.getFamily()), readPt, comparator);
    }
  } catch (IOException e) {
    e.printStackTrace();
  }
  return null;
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
public CollectionBackedScanner(List<Cell> list,
    KeyValue.KVComparator comparator) {
  Collections.sort(list, comparator);
  this.comparator = comparator;
  data = list;
  init();
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
@Override
protected void checkScanOrder(Cell prevKV, Cell kv,
    KeyValue.KVComparator comparator) throws IOException {
  // Check that the heap gives us KVs in an increasing order for same row and
  // decreasing order for different rows.
  assert prevKV == null || comparator == null || comparator.compareRows(kv, prevKV) < 0
      || (comparator.matchingRows(kv, prevKV) && comparator.compare(kv,
          prevKV) >= 0) : "Key " + prevKV
      + " followed by a " + "error order key " + kv + " in cf " + store
      + " in reversed scan";
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
public WriterBuilder withComparator(KeyValue.KVComparator comparator) {
  Preconditions.checkNotNull(comparator);
  this.comparator = comparator;
  return this;
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
CellSkipListSet(final KeyValue.KVComparator c) {
  this.delegatee = new ConcurrentSkipListMap<Cell, Cell>(c);
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
KeyValue.KVComparator getComparator() {
  return reader.getComparator();
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
/**
 * @return KeyValue Comparator
 */
public KeyValue.KVComparator getComparator() {
  return this.comparator;
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
@Override public KeyValue.KVComparator getComparator() {
  return comparator;
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
public KeyValueScanFixture(KeyValue.KVComparator comparator,
                           KeyValue... incData) {
  super(comparator, incData);
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
/**
 * Check whether scan as expected order
 *
 * @param prevKV
 * @param kv
 * @param comparator
 * @throws IOException
 */
protected void checkScanOrder(Cell prevKV, Cell kv, KeyValue.KVComparator comparator)
    throws IOException {
  // Check that the heap gives us KVs in an increasing order.
  assert
      prevKV == null || comparator == null || comparator.compare(prevKV, kv) <= 0 :
      "Key " + prevKV + " followed by a " + "smaller key " + kv + " in cf " + store;
}
 

import org.apache.hadoop.hbase.KeyValue; //導入方法依賴的package包/類
KeyValue.KVComparator getComparator();