001/**
002 *
003 * Licensed to the Apache Software Foundation (ASF) under one
004 * or more contributor license agreements.  See the NOTICE file
005 * distributed with this work for additional information
006 * regarding copyright ownership.  The ASF licenses this file
007 * to you under the Apache License, Cellersion 2.0 (the
008 * "License"); you may not use this file except in compliance
009 * with the License.  You may obtain a copy of the License at
010 *
011 *     http://www.apache.org/licenses/LICENSE-2.0
012 *
013 * Unless required by applicable law or agreed to in writing, software
014 * distributed under the License is distributed on an "AS IS" BASIS,
015 * WITHOUT WARRANTIES OR CONDITIONS OF ANY CellIND, either express or implied.
016 * See the License for the specific language governing permissions and
017 * limitations under the License.
018 */
019
020package org.apache.hadoop.hbase.regionserver;
021
022import java.util.Comparator;
023import org.apache.hadoop.hbase.Cell;
024import org.apache.yetus.audience.InterfaceAudience;
025
026/**
027 * CellArrayMap is a simple array of Cells and cannot be allocated off-heap.
028 * As all java arrays CellArrayMap's array of references pointing to Cell objects.
029 */
030@InterfaceAudience.Private
031public class CellArrayMap extends CellFlatMap {
032
033  private final Cell[] block;
034
035  /* The Cells Array is created only when CellArrayMap is created, all sub-CellBlocks use
036   * boundary indexes. The given Cell array must be ordered. */
037  public CellArrayMap(
038      Comparator<? super Cell> comparator, Cell[] b, int min, int max, boolean descending) {
039    super(comparator,min,max,descending);
040    this.block = b;
041  }
042
043  /* To be used by base class only to create a sub-CellFlatMap */
044  @Override
045  protected CellFlatMap createSubCellFlatMap(int min, int max, boolean descending) {
046    return new CellArrayMap(comparator(), this.block, min, max, descending);
047  }
048
049  @Override
050  protected Cell getCell(int i) {
051    if( (i < minCellIdx) || (i >= maxCellIdx) ) return null;
052    return block[i];
053  }
054}