T - the type of elements maintained by this Collectionpublic class Object2ByteOpenHashMap<T> extends AbstractObject2ByteMap<T> implements ITrimmable
AbstractObject2ByteMap.BasicEntry<T>java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>Object2ByteMap.BuilderCache<T>, Object2ByteMap.Entry<T>, Object2ByteMap.FastEntrySet<T>, Object2ByteMap.MapBuilder| Constructor and Description |
|---|
Object2ByteOpenHashMap()
Default Constructor
|
Object2ByteOpenHashMap(int minCapacity)
Constructor that defines the minimum capacity
|
Object2ByteOpenHashMap(int minCapacity,
float loadFactor)
Constructor that defines the minimum capacity and load factor
|
Object2ByteOpenHashMap(java.util.Map<? extends T,? extends java.lang.Byte> map)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ByteOpenHashMap(java.util.Map<? extends T,? extends java.lang.Byte> map,
float loadFactor)
A Helper constructor that allows to create a Map with exactly the same values as the provided map.
|
Object2ByteOpenHashMap(Object2ByteMap<T> map)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ByteOpenHashMap(Object2ByteMap<T> map,
float loadFactor)
A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
|
Object2ByteOpenHashMap(T[] keys,
byte[] values)
Helper constructor that allow to create a map from unboxed values
|
Object2ByteOpenHashMap(T[] keys,
java.lang.Byte[] values)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
Object2ByteOpenHashMap(T[] keys,
byte[] values,
float loadFactor)
Helper constructor that allow to create a map from unboxed values
|
Object2ByteOpenHashMap(T[] keys,
java.lang.Byte[] values,
float loadFactor)
Helper constructor that allow to create a map from boxed values (it will unbox them)
|
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(T key,
byte value)
A Helper method to add a primitives together.
|
void |
clear() |
void |
clearAndTrim(int size)
Trims the collection down to the requested size and clears all elements while doing so
|
byte |
computeByte(T key,
ObjectByteUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
byte |
computeByteIfAbsent(T key,
Object2ByteFunction<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
byte |
computeByteIfPresent(T key,
ObjectByteUnaryOperator<T> mappingFunction)
A Type Specific compute method to reduce boxing/unboxing
|
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(byte value)
Type Specific method to reduce boxing/unboxing of values
|
boolean |
containsValue(java.lang.Object value)
Deprecated.
|
Object2ByteOpenHashMap<T> |
copy()
A Function that does a shallow clone of the Map itself.
|
void |
forEach(ObjectByteConsumer<T> action)
Type Specific forEach method to reduce boxing/unboxing
|
java.lang.Byte |
get(java.lang.Object key) |
byte |
getByte(T key)
A Type Specific get method to reduce boxing/unboxing
|
byte |
getOrDefault(T key,
byte defaultValue)
A Type Specific getOrDefault method to reduce boxing/unboxing
|
ObjectSet<T> |
keySet() |
void |
mergeAllByte(Object2ByteMap<T> m,
ByteByteUnaryOperator mappingFunction)
A Bulk method for merging Maps.
|
byte |
mergeByte(T key,
byte value,
ByteByteUnaryOperator mappingFunction)
A Type Specific merge method to reduce boxing/unboxing
|
ObjectSet<Object2ByteMap.Entry<T>> |
object2ByteEntrySet()
Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
|
byte |
put(T key,
byte value)
Type Specific method to reduce boxing/unboxing of values
|
byte |
putIfAbsent(T key,
byte value)
Type Specific method to reduce boxing/unboxing of values
|
byte |
rem(T key)
Type Specific remove function to reduce boxing/unboxing
|
byte |
remOrDefault(T key,
byte defaultValue)
Type-Specific Remove function with a default return value if wanted.
|
java.lang.Byte |
remove(java.lang.Object key) |
boolean |
remove(java.lang.Object key,
java.lang.Object value) |
boolean |
remove(T key,
byte value)
Type Specific remove function to reduce boxing/unboxing
|
byte |
replace(T key,
byte value)
A Type Specific replace method to reduce boxing/unboxing replace an existing value
|
boolean |
replace(T key,
byte oldValue,
byte newValue)
A Type Specific replace method to replace an existing value
|
int |
size() |
byte |
subFrom(T key,
byte value)
A Helper method to subtract from primitive from each other.
|
byte |
supplyByteIfAbsent(T key,
ByteSupplier valueProvider)
A Supplier based computeIfAbsent function to fill the most used usecase of this function
|
boolean |
trim(int size)
Trims the original collection down to the size of the current elements or the requested size depending which is bigger
|
ByteCollection |
values() |
addToAll, entrySet, equals, getDefaultReturnValue, getOrDefault, hashCode, put, putAll, putAll, putAll, putAll, putAllIfAbsent, replaceBytes, replaceBytes, setDefaultReturnValueclearAndTrim, trimbuilder, compute, computeIfAbsent, computeIfPresent, forEach, merge, putAll, putAll, putIfAbsent, replace, replace, replaceAll, synchronize, synchronize, unmodifiablepublic Object2ByteOpenHashMap()
public Object2ByteOpenHashMap(int minCapacity)
minCapacity - the minimum capacity the HashMap is allowed to be.java.lang.IllegalStateException - if the minimum capacity is negativepublic Object2ByteOpenHashMap(int minCapacity,
float loadFactor)
minCapacity - the minimum capacity the HashMap is allowed to be.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the minimum capacity is negativejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ByteOpenHashMap(T[] keys, java.lang.Byte[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2ByteOpenHashMap(T[] keys, java.lang.Byte[] values, float loadFactor)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ByteOpenHashMap(T[] keys, byte[] values)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.java.lang.IllegalStateException - if the keys and values do not match in lenghtpublic Object2ByteOpenHashMap(T[] keys, byte[] values, float loadFactor)
keys - the keys that should be put into the mapvalues - the values that should be put into the map.loadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the keys and values do not match in lenghtjava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ByteOpenHashMap(java.util.Map<? extends T,? extends java.lang.Byte> map)
map - the values that should be present in the mappublic Object2ByteOpenHashMap(java.util.Map<? extends T,? extends java.lang.Byte> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public Object2ByteOpenHashMap(Object2ByteMap<T> map)
map - the values that should be present in the mappublic Object2ByteOpenHashMap(Object2ByteMap<T> map, float loadFactor)
map - the values that should be present in the maploadFactor - the percentage of how full the backing array can be before they resizejava.lang.IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1public byte put(T key, byte value)
Object2ByteMapput in interface Object2ByteMap<T>key - the key that should be inserted,value - the value that should be insertedMap.put(Object, Object)public byte putIfAbsent(T key, byte value)
Object2ByteMapputIfAbsent in interface Object2ByteMap<T>key - the key that should be inserted,value - the value that should be insertedMap.putIfAbsent(Object, Object)public byte addTo(T key, byte value)
Object2ByteMapaddTo in interface Object2ByteMap<T>key - the key that should be inserted,value - the value that should be inserted / addedpublic byte subFrom(T key, byte value)
Object2ByteMapObject2ByteMap.getDefaultReturnValue()
If the fence is reached the element will be automaticall removedsubFrom in interface Object2ByteMap<T>key - that should be subtract fromvalue - that should be subtractpublic boolean containsKey(java.lang.Object key)
containsKey in interface java.util.Map<T,java.lang.Byte>containsKey in class AbstractObject2ByteMap<T>public boolean containsValue(byte value)
Object2ByteMapcontainsValue in interface Object2ByteMap<T>containsValue in class AbstractObject2ByteMap<T>value - element that is searched for@Deprecated public boolean containsValue(java.lang.Object value)
containsValue in interface java.util.Map<T,java.lang.Byte>containsValue in interface Object2ByteMap<T>containsValue in class java.util.AbstractMap<T,java.lang.Byte>value - that is searched for.Map.containsValue(Object)public byte rem(T key)
Object2ByteMaprem in interface Object2ByteMap<T>key - the element that should be removedpublic byte remOrDefault(T key, byte defaultValue)
Object2ByteMapremOrDefault in interface Object2ByteMap<T>key - the element that should be removeddefaultValue - the value that should be returned if the entry doesn't existMap.remove(Object, Object)public java.lang.Byte remove(java.lang.Object key)
remove in interface java.util.Map<T,java.lang.Byte>remove in interface Object2ByteMap<T>remove in class AbstractObject2ByteMap<T>key - the element that should be removedMap.remove(Object)public boolean remove(T key, byte value)
Object2ByteMapremove in interface Object2ByteMap<T>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public boolean remove(java.lang.Object key,
java.lang.Object value)
remove in interface java.util.Map<T,java.lang.Byte>remove in interface Object2ByteMap<T>key - the element that should be removedvalue - the expected value that should be foundMap.remove(Object, Object)public byte getByte(T key)
Object2ByteMapgetByte in interface Object2ByteFunction<T>getByte in interface Object2ByteMap<T>key - the key that is searched forpublic java.lang.Byte get(java.lang.Object key)
get in interface java.util.Map<T,java.lang.Byte>get in interface Object2ByteMap<T>get in class AbstractObject2ByteMap<T>public byte getOrDefault(T key, byte defaultValue)
Object2ByteMapgetOrDefault in interface Object2ByteMap<T>key - the key that is searched fordefaultValue - the value that should be returned if the key is not presentpublic Object2ByteOpenHashMap<T> copy()
Object2ByteMapcopy in interface Object2ByteMap<T>copy in class AbstractObject2ByteMap<T>public ObjectSet<Object2ByteMap.Entry<T>> object2ByteEntrySet()
Object2ByteMapobject2ByteEntrySet in interface Object2ByteMap<T>public ObjectSet<T> keySet()
keySet in interface java.util.Map<T,java.lang.Byte>keySet in interface Object2ByteMap<T>keySet in class AbstractObject2ByteMap<T>public ByteCollection values()
values in interface java.util.Map<T,java.lang.Byte>values in interface Object2ByteMap<T>values in class AbstractObject2ByteMap<T>public void forEach(ObjectByteConsumer<T> action)
Object2ByteMapforEach in interface Object2ByteMap<T>forEach in class AbstractObject2ByteMap<T>action - processor of the values that are iterator overpublic boolean replace(T key, byte oldValue, byte newValue)
Object2ByteMapreplace in interface Object2ByteMap<T>replace in class AbstractObject2ByteMap<T>key - the element that should be searched foroldValue - the expected value to be replacednewValue - the value to replace the oldValue with.public byte replace(T key, byte value)
Object2ByteMapreplace in interface Object2ByteMap<T>replace in class AbstractObject2ByteMap<T>key - the element that should be searched forvalue - the value to replace with.public byte computeByte(T key, ObjectByteUnaryOperator<T> mappingFunction)
Object2ByteMapcomputeByte in interface Object2ByteMap<T>computeByte in class AbstractObject2ByteMap<T>key - the key that should be computedmappingFunction - the operator that should generate the valuepublic byte computeByteIfAbsent(T key, Object2ByteFunction<T> mappingFunction)
Object2ByteMapcomputeByteIfAbsent in interface Object2ByteMap<T>computeByteIfAbsent in class AbstractObject2ByteMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if not presentpublic byte supplyByteIfAbsent(T key, ByteSupplier valueProvider)
Object2ByteMapsupplyByteIfAbsent in interface Object2ByteMap<T>supplyByteIfAbsent in class AbstractObject2ByteMap<T>key - the key that should be computedvalueProvider - the value if not presentpublic byte computeByteIfPresent(T key, ObjectByteUnaryOperator<T> mappingFunction)
Object2ByteMapcomputeByteIfPresent in interface Object2ByteMap<T>computeByteIfPresent in class AbstractObject2ByteMap<T>key - the key that should be computedmappingFunction - the operator that should generate the value if presentpublic byte mergeByte(T key, byte value, ByteByteUnaryOperator mappingFunction)
Object2ByteMapmergeByte in interface Object2ByteMap<T>mergeByte in class AbstractObject2ByteMap<T>key - the key that should be be searched forvalue - the value that should be merged withmappingFunction - the operator that should generate the new Valuepublic void mergeAllByte(Object2ByteMap<T> m, ByteByteUnaryOperator mappingFunction)
Object2ByteMapmergeAllByte in interface Object2ByteMap<T>mergeAllByte in class AbstractObject2ByteMap<T>m - the entries that should be bulk addedmappingFunction - the operator that should generate the new Valuepublic int size()
public void clear()
public boolean trim(int size)
ITrimmabletrim in interface ITrimmablesize - the requested trim size.public void clearAndTrim(int size)
ITrimmableclearAndTrim in interface ITrimmablesize - the amount of elements that should be allowed