org.apache.hadoop.hbase.regionserver

Class CellFlatMap

java.lang.Object

org.apache.hadoop.hbase.regionserver.CellFlatMap

All Implemented Interfaces:

Map<Cell,Cell>, NavigableMap<Cell,Cell>, SortedMap<Cell,Cell>

Direct Known Subclasses:

CellArrayMap, CellChunkMap

@InterfaceAudience.Private
public abstract class CellFlatMap
extends Object
implements NavigableMap<Cell,Cell>

CellFlatMap stores a constant number of elements and is immutable after creation stage. Being immutable, the CellFlatMap can be implemented as array. The actual array can be on- or off-heap and is implemented in concrete class derived from CellFlatMap. The CellFlatMap uses no synchronization primitives, it is assumed to be created by a single thread and then it can be read-only by multiple threads. The "flat" in the name, means that the memory layout of the Map is sequential array and thus requires less memory than ConcurrentSkipListMap.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private class	CellFlatMap.CellFlatMapCollection
private static class	CellFlatMap.CellFlatMapEntry
private class	CellFlatMap.CellFlatMapIterator

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Field Summary

Fields

Modifier and Type	Field and Description
private Comparator<? super Cell>	comparator
private boolean	descending
private static org.slf4j.Logger	LOG
protected int	maxCellIdx
protected int	minCellIdx

Constructor Summary

Constructors

Constructor and Description
CellFlatMap(Comparator<? super Cell> comparator, int min, int max, boolean d)

Method Summary

Modifier and Type	Method and Description
Map.Entry<Cell,Cell>	ceilingEntry(Cell k)
Cell	ceilingKey(Cell k)
void	clear()
Comparator<? super Cell>	comparator()
boolean	containsKey(Object o)
boolean	containsValue(Object o)
protected abstract CellFlatMap	createSubCellFlatMap(int min, int max, boolean descending)
NavigableSet<Cell>	descendingKeySet()
NavigableMap<Cell,Cell>	descendingMap()
Set<Map.Entry<Cell,Cell>>	entrySet()
private int	find(Cell needle) Binary search for a given key in between given boundaries of the array.
Map.Entry<Cell,Cell>	firstEntry()
Cell	firstKey()
Map.Entry<Cell,Cell>	floorEntry(Cell k)
Cell	floorKey(Cell k)
Cell	get(Object o)
protected abstract Cell	getCell(int i)
private int	getValidIndex(Cell key, boolean inclusive, boolean tail) Get the index of the given anchor key for creating subsequent set.
NavigableMap<Cell,Cell>	headMap(Cell k)
NavigableMap<Cell,Cell>	headMap(Cell toKey, boolean inclusive)
Map.Entry<Cell,Cell>	higherEntry(Cell k)
Cell	higherKey(Cell k)
boolean	isEmpty()
NavigableSet<Cell>	keySet()
Map.Entry<Cell,Cell>	lastEntry()
Cell	lastKey()
Map.Entry<Cell,Cell>	lowerEntry(Cell k)
Cell	lowerKey(Cell k)
NavigableSet<Cell>	navigableKeySet()
Map.Entry<Cell,Cell>	pollFirstEntry()
Map.Entry<Cell,Cell>	pollLastEntry()
Cell	put(Cell k, Cell v)
void	putAll(Map<? extends Cell,? extends Cell> map)
Cell	remove(Object o)
int	size()
NavigableMap<Cell,Cell>	subMap(Cell fromKey, boolean fromInclusive, Cell toKey, boolean toInclusive)
NavigableMap<Cell,Cell>	subMap(Cell k1, Cell k2)
NavigableMap<Cell,Cell>	tailMap(Cell k)
NavigableMap<Cell,Cell>	tailMap(Cell fromKey, boolean inclusive)
Collection<Cell>	values()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll

Field Detail

LOG

private static final org.slf4j.Logger LOG

comparator

private final Comparator<? super Cell> comparator

minCellIdx

protected int minCellIdx

maxCellIdx

protected int maxCellIdx

descending

private boolean descending

Constructor Detail

CellFlatMap

public CellFlatMap(Comparator<? super Cell> comparator,
                   int min,
                   int max,
                   boolean d)

Method Detail

createSubCellFlatMap

protected abstract CellFlatMap createSubCellFlatMap(int min,
                                                    int max,
                                                    boolean descending)

getCell

protected abstract Cell getCell(int i)

find

private int find(Cell needle)

Binary search for a given key in between given boundaries of the array. Positive returned numbers mean the index. Negative returned numbers means the key not found. The absolute value of the output is the possible insert index for the searched key In twos-complement, (-1 * insertion point)-1 is the bitwise not of the insert point.

Parameters:

needle - The key to look for in all of the entries

Returns:

Same return value as Arrays.binarySearch.

getValidIndex

private int getValidIndex(Cell key,
                          boolean inclusive,
                          boolean tail)

Get the index of the given anchor key for creating subsequent set. It doesn't matter whether the given key exists in the set or not. taking into consideration whether the key should be inclusive or exclusive.

comparator

public Comparator<? super Cell> comparator()

Specified by:

comparator in interface SortedMap<Cell,Cell>

size

public int size()

Specified by:

size in interface Map<Cell,Cell>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Cell,Cell>

subMap

public NavigableMap<Cell,Cell> subMap(Cell fromKey,
                                      boolean fromInclusive,
                                      Cell toKey,
                                      boolean toInclusive)

Specified by:

subMap in interface NavigableMap<Cell,Cell>

headMap

public NavigableMap<Cell,Cell> headMap(Cell toKey,
                                       boolean inclusive)

Specified by:

headMap in interface NavigableMap<Cell,Cell>

tailMap

public NavigableMap<Cell,Cell> tailMap(Cell fromKey,
                                       boolean inclusive)

Specified by:

tailMap in interface NavigableMap<Cell,Cell>

descendingMap

public NavigableMap<Cell,Cell> descendingMap()

Specified by:

descendingMap in interface NavigableMap<Cell,Cell>

subMap

public NavigableMap<Cell,Cell> subMap(Cell k1,
                                      Cell k2)

Specified by:

subMap in interface NavigableMap<Cell,Cell>

Specified by:

subMap in interface SortedMap<Cell,Cell>

headMap

public NavigableMap<Cell,Cell> headMap(Cell k)

Specified by:

headMap in interface NavigableMap<Cell,Cell>

Specified by:

headMap in interface SortedMap<Cell,Cell>

tailMap

public NavigableMap<Cell,Cell> tailMap(Cell k)

Specified by:

tailMap in interface NavigableMap<Cell,Cell>

Specified by:

tailMap in interface SortedMap<Cell,Cell>

firstKey

public Cell firstKey()

Specified by:

firstKey in interface SortedMap<Cell,Cell>

lastKey

public Cell lastKey()

Specified by:

lastKey in interface SortedMap<Cell,Cell>

lowerKey

public Cell lowerKey(Cell k)

Specified by:

lowerKey in interface NavigableMap<Cell,Cell>

floorKey

public Cell floorKey(Cell k)

Specified by:

floorKey in interface NavigableMap<Cell,Cell>

ceilingKey

public Cell ceilingKey(Cell k)

Specified by:

ceilingKey in interface NavigableMap<Cell,Cell>

higherKey

public Cell higherKey(Cell k)

Specified by:

higherKey in interface NavigableMap<Cell,Cell>

containsKey

public boolean containsKey(Object o)

Specified by:

containsKey in interface Map<Cell,Cell>

containsValue

public boolean containsValue(Object o)

Specified by:

containsValue in interface Map<Cell,Cell>

get

public Cell get(Object o)

Specified by:

get in interface Map<Cell,Cell>

lowerEntry

public Map.Entry<Cell,Cell> lowerEntry(Cell k)

Specified by:

lowerEntry in interface NavigableMap<Cell,Cell>

higherEntry

public Map.Entry<Cell,Cell> higherEntry(Cell k)

Specified by:

higherEntry in interface NavigableMap<Cell,Cell>

ceilingEntry

public Map.Entry<Cell,Cell> ceilingEntry(Cell k)

Specified by:

ceilingEntry in interface NavigableMap<Cell,Cell>

floorEntry

public Map.Entry<Cell,Cell> floorEntry(Cell k)

Specified by:

floorEntry in interface NavigableMap<Cell,Cell>

firstEntry

public Map.Entry<Cell,Cell> firstEntry()

Specified by:

firstEntry in interface NavigableMap<Cell,Cell>

lastEntry

public Map.Entry<Cell,Cell> lastEntry()

Specified by:

lastEntry in interface NavigableMap<Cell,Cell>

pollFirstEntry

public Map.Entry<Cell,Cell> pollFirstEntry()

Specified by:

pollFirstEntry in interface NavigableMap<Cell,Cell>

pollLastEntry

public Map.Entry<Cell,Cell> pollLastEntry()

Specified by:

pollLastEntry in interface NavigableMap<Cell,Cell>

put

public Cell put(Cell k,
                Cell v)

Specified by:

put in interface Map<Cell,Cell>

clear

public void clear()

Specified by:

clear in interface Map<Cell,Cell>

remove

public Cell remove(Object o)

Specified by:

remove in interface Map<Cell,Cell>

putAll

public void putAll(Map<? extends Cell,? extends Cell> map)

Specified by:

putAll in interface Map<Cell,Cell>

navigableKeySet

public NavigableSet<Cell> navigableKeySet()

Specified by:

navigableKeySet in interface NavigableMap<Cell,Cell>

descendingKeySet

public NavigableSet<Cell> descendingKeySet()

Specified by:

descendingKeySet in interface NavigableMap<Cell,Cell>

keySet

public NavigableSet<Cell> keySet()

Specified by:

keySet in interface Map<Cell,Cell>

Specified by:

keySet in interface SortedMap<Cell,Cell>

values

public Collection<Cell> values()

Specified by:

values in interface Map<Cell,Cell>

Specified by:

values in interface SortedMap<Cell,Cell>

entrySet

public Set<Map.Entry<Cell,Cell>> entrySet()

Specified by:

entrySet in interface Map<Cell,Cell>

Specified by:

entrySet in interface SortedMap<Cell,Cell>