Package org.apache.hadoop.hbase.regionserver

Class CellFlatMap<T extends Cell>

java.lang.Object

org.apache.hadoop.hbase.regionserver.CellFlatMap<T>

All Implemented Interfaces:

Map<T,T>, NavigableMap<T,T>, SortedMap<T,T>

Direct Known Subclasses:

CellArrayMap, CellChunkMap

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

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	Description
private final class	CellFlatMap.CellFlatMapCollection
private static class	CellFlatMap.CellFlatMapEntry<T>
private final class	CellFlatMap.CellFlatMapIterator

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

Map.Entry<K extends Object,V extends Object>

Field Summary

Fields

Modifier and Type	Field	Description
private final Comparator<? super T>	comparator
private boolean	descending
protected int	maxCellIdx
protected int	minCellIdx

Constructor Summary

Constructors

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

Method Summary

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

comparator

private final Comparator<? super T extends Cell> comparator

minCellIdx

protected int minCellIdx

maxCellIdx

protected int maxCellIdx

descending

private boolean descending

Constructor Details

CellFlatMap

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

Method Details

createSubCellFlatMap

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

getCell

protected abstract T getCell(int i)

find

private int find(T 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(T 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 T> comparator()

Specified by:

comparator in interface SortedMap<T extends Cell,T extends Cell>

size

public int size()

Specified by:

size in interface Map<T extends Cell,T extends Cell>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<T extends Cell,T extends Cell>

subMap

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

Specified by:

subMap in interface NavigableMap<T extends Cell,T extends Cell>

headMap

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

Specified by:

headMap in interface NavigableMap<T extends Cell,T extends Cell>

tailMap

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

Specified by:

tailMap in interface NavigableMap<T extends Cell,T extends Cell>

descendingMap

public NavigableMap<T,T> descendingMap()

Specified by:

descendingMap in interface NavigableMap<T extends Cell,T extends Cell>

subMap

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

Specified by:

subMap in interface NavigableMap<T extends Cell,T extends Cell>

Specified by:

subMap in interface SortedMap<T extends Cell,T extends Cell>

headMap

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

Specified by:

headMap in interface NavigableMap<T extends Cell,T extends Cell>

Specified by:

headMap in interface SortedMap<T extends Cell,T extends Cell>

tailMap

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

Specified by:

tailMap in interface NavigableMap<T extends Cell,T extends Cell>

Specified by:

tailMap in interface SortedMap<T extends Cell,T extends Cell>

firstKey

public T firstKey()

Specified by:

firstKey in interface SortedMap<T extends Cell,T extends Cell>

lastKey

public T lastKey()

Specified by:

lastKey in interface SortedMap<T extends Cell,T extends Cell>

lowerKey

public T lowerKey(T k)

Specified by:

lowerKey in interface NavigableMap<T extends Cell,T extends Cell>

floorKey

public T floorKey(T k)

Specified by:

floorKey in interface NavigableMap<T extends Cell,T extends Cell>

ceilingKey

public T ceilingKey(T k)

Specified by:

ceilingKey in interface NavigableMap<T extends Cell,T extends Cell>

higherKey

public T higherKey(T k)

Specified by:

higherKey in interface NavigableMap<T extends Cell,T extends Cell>

containsKey

public boolean containsKey(Object o)

Specified by:

containsKey in interface Map<T extends Cell,T extends Cell>

containsValue

public boolean containsValue(Object o)

Specified by:

containsValue in interface Map<T extends Cell,T extends Cell>

get

public T get(Object o)

Specified by:

get in interface Map<T extends Cell,T extends Cell>

lowerEntry

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

Specified by:

lowerEntry in interface NavigableMap<T extends Cell,T extends Cell>

higherEntry

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

Specified by:

higherEntry in interface NavigableMap<T extends Cell,T extends Cell>

ceilingEntry

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

Specified by:

ceilingEntry in interface NavigableMap<T extends Cell,T extends Cell>

floorEntry

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

Specified by:

floorEntry in interface NavigableMap<T extends Cell,T extends Cell>

firstEntry

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

Specified by:

firstEntry in interface NavigableMap<T extends Cell,T extends Cell>

lastEntry

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

Specified by:

lastEntry in interface NavigableMap<T extends Cell,T extends Cell>

pollFirstEntry

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

Specified by:

pollFirstEntry in interface NavigableMap<T extends Cell,T extends Cell>

pollLastEntry

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

Specified by:

pollLastEntry in interface NavigableMap<T extends Cell,T extends Cell>

put

public T put(T k,
 T v)

Specified by:

put in interface Map<T extends Cell,T extends Cell>

clear

public void clear()

Specified by:

clear in interface Map<T extends Cell,T extends Cell>

remove

public T remove(Object o)

Specified by:

remove in interface Map<T extends Cell,T extends Cell>

putAll

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

Specified by:

putAll in interface Map<T extends Cell,T extends Cell>

navigableKeySet

public NavigableSet<T> navigableKeySet()

Specified by:

navigableKeySet in interface NavigableMap<T extends Cell,T extends Cell>

descendingKeySet

public NavigableSet<T> descendingKeySet()

Specified by:

descendingKeySet in interface NavigableMap<T extends Cell,T extends Cell>

keySet

public NavigableSet<T> keySet()

Specified by:

keySet in interface Map<T extends Cell,T extends Cell>

Specified by:

keySet in interface SortedMap<T extends Cell,T extends Cell>

values

public Collection<T> values()

Specified by:

values in interface Map<T extends Cell,T extends Cell>

Specified by:

values in interface SortedMap<T extends Cell,T extends Cell>

entrySet

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

Specified by:

entrySet in interface Map<T extends Cell,T extends Cell>

Specified by:

entrySet in interface SortedMap<T extends Cell,T extends Cell>