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