Modifier and Type	Class and Description
private static class	EconomicMapImpl.CollisionLink Links the collisions.
private abstract class	EconomicMapImpl.SparseMapIterator<E>

Modifier and Type	Field and Description
private static final int	COMPRESS_IMMEDIATE_CAPACITY Maximum number of entries that are moved linearly forward if a key is removed.
private int	deletedEntries Number of deleted entries.
private Object[]	entries Entries array with even indices storing keys and odd indices storing values.
private static final int	HASH_THRESHOLD Number of entries above which a hash table is created.
private static final int	HASH_THRESHOLD_IDENTITY_COMPARE Number of entries above which a hash table is created when equality can be checked with object identity.
private byte[]	hashArray Hash array that is interpreted either as byte or short or int array depending on number of map entries.
private static final int	INITIAL_CAPACITY Initial number of key/value pair entries that is allocated in the first entries array.
private final boolean	isSet
private static final int	LARGE_HASH_THRESHOLD Number of entries above which more than 1 byte is necessary for the hash index.
private static final int	MAX_ELEMENT_COUNT Maximum number of entries allowed in the map.
private static final int	MIN_CAPACITY_INCREASE Minimum number of key/value pair entries added when the entries array is increased in size.
private final Equivalence	strategy The strategy used for comparing keys or `null` for denoting special strategy `Equivalence#IDENTITY`.
private int	totalEntries Total number of entries (actual entries plus deleted entries).
private static final int	VERY_LARGE_HASH_THRESHOLD Number of entries above which more than 2 bytes are are necessary for the hash index.

Access	Constructor and Description
private	EconomicMapImpl(Equivalence strategy, boolean isSet)
private	EconomicMapImpl(Equivalence strategy, int initialCapacity, boolean isSet)
private	EconomicMapImpl(Equivalence strategy, UnmodifiableEconomicMap<K, V> other, boolean isSet)
private	EconomicMapImpl(Equivalence strategy, UnmodifiableEconomicSet<K> other, boolean isSet)

Method Summary

Modifier and Type	Method and Description
public boolean	add(K element) Implements org.graalvm.collections.EconomicSet.add. Adds `element` to this set if it is not already present.
private void	checkKeyNonNull(K key)
public void	clear() Implements org.graalvm.collections.EconomicMap.clear, org.graalvm.collections.EconomicSet.clear. Removes all of the mappings from this map.
private boolean	compareKeys(Object key, Object entryKey)
private int	compressLarge(int nextIndex) Compresses the graph and returns the translated new next index.
public boolean	contains(K element) Implements org.graalvm.collections.UnmodifiableEconomicSet.contains. Returns `true` if this set contains a mapping for the `element`.
public boolean	containsKey(K key) Implements org.graalvm.collections.UnmodifiableEconomicMap.containsKey. Returns `true` if this map contains a mapping for `key`.
public static <K, V> EconomicMapImpl<K, V>	create(Equivalence strategy, boolean isSet)
public static <K, V> EconomicMapImpl<K, V>	create(Equivalence strategy, int initialCapacity, boolean isSet)
public static <K, V> EconomicMapImpl<K, V>	create(Equivalence strategy, UnmodifiableEconomicMap<K, V> other, boolean isSet)
public static <K, V> EconomicMapImpl<K, V>	create(Equivalence strategy, UnmodifiableEconomicSet<K> other, boolean isSet)
private void	createHash()
private int	find(K key)
private int	findAndRemoveHash(Object key)
private int	findAndRemoveWithCollision(Object key, EconomicMapImpl.CollisionLink initialEntryValue, int initialIndexValue)
private int	findHash(K key)
private int	findLinear(K key)
private int	findWithCollision(K key, EconomicMapImpl.CollisionLink initialEntryValue)
public V	get(K key) Implements org.graalvm.collections.UnmodifiableEconomicMap.get. Returns the value to which `key` is mapped, or `null` if this map contains no mapping for `key`.
public MapCursor<K, V>	getEntries() Implements org.graalvm.collections.EconomicMap.getEntries. Returns a `MapCursor` view of the mappings contained in this map.
public Equivalence	getEquivalenceStrategy() Overrides default org.graalvm.collections.UnmodifiableEconomicMap.getEquivalenceStrategy. Returns the strategy used to compare keys.
private int	getHashArray(int index)
private int	getHashIndex(Object key)
private int	getHashTableSize()
private int	getHashThreshold() Number of entries above which a hash table should be constructed.
private Object	getKey(int index)
public Iterable<K>	getKeys() Implements org.graalvm.collections.UnmodifiableEconomicMap.getKeys. Returns a `Iterable` view of the keys contained in this map.
private Object	getRawValue(int index)
private Object	getValue(int index)
public Iterable<V>	getValues() Implements org.graalvm.collections.UnmodifiableEconomicMap.getValues. Returns a `Iterable` view of the values contained in this map.
private void	grow()
private boolean	hasHashArray()
private void	init(int size)
private boolean	initFrom(Object o)
private static <K, V> EconomicMapImpl<K, V>	intercept(EconomicMapImpl<K, V> map) Intercept method for debugging purposes.
public boolean	isEmpty() Implements org.graalvm.collections.UnmodifiableEconomicMap.isEmpty, org.graalvm.collections.UnmodifiableEconomicSet.isEmpty. Returns `true` if this map contains no key-value mappings.
public Iterator<K>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
private int	maybeCompress(int nextIndex) Compresses the graph if there is a large number of deleted entries and returns the translated new next index.
public V	put(K key, V value) Implements org.graalvm.collections.EconomicMap.put. Associates `value` with `key` in this map.
private void	putHashEntry(Object key, int entryIndex, boolean rehashOnCollision)
private int	remove(int indexToRemove) Implements org.graalvm.collections.EconomicSet.remove. Removes the element at the specific index and returns the index of the next element.
public void	remove(K element) Implements org.graalvm.collections.EconomicSet.remove. Removes `element` from this set if it is present.
public V	removeKey(K key) Implements org.graalvm.collections.EconomicMap.removeKey. Removes the mapping for `key` from this map if it is present.
public void	replaceAll(BiFunction<? super K, ? super V, ? extends V> function) Implements org.graalvm.collections.EconomicMap.replaceAll. Replaces each entry's value with the result of invoking `function` on that entry until all entries have been processed or the function throws an exception.
private void	setHashArray(int index, int value)
private void	setKey(int index, Object newValue)
private void	setRawValue(int index, Object newValue)
private void	setValue(int index, Object newValue)
public int	size() Implements org.graalvm.collections.UnmodifiableEconomicMap.size, org.graalvm.collections.UnmodifiableEconomicSet.size. Returns the number of key-value mappings in this map.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
pack-priv static <K, V> String	toString(boolean isSet, int size, MapCursor<K, V> cursor)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

COMPRESS_IMMEDIATE_CAPACITY	back to summary
private static final int COMPRESS_IMMEDIATE_CAPACITY Maximum number of entries that are moved linearly forward if a key is removed.

deletedEntries	back to summary
private int deletedEntries Number of deleted entries.

entries	back to summary
private Object[] entries Entries array with even indices storing keys and odd indices storing values.

HASH_THRESHOLD	back to summary
private static final int HASH_THRESHOLD Number of entries above which a hash table is created.

HASH_THRESHOLD_IDENTITY_COMPARE	back to summary
private static final int HASH_THRESHOLD_IDENTITY_COMPARE Number of entries above which a hash table is created when equality can be checked with object identity.

hashArray	back to summary
private byte[] hashArray Hash array that is interpreted either as byte or short or int array depending on number of map entries.

INITIAL_CAPACITY	back to summary
private static final int INITIAL_CAPACITY Initial number of key/value pair entries that is allocated in the first entries array.

isSet	back to summary
private final boolean isSet

LARGE_HASH_THRESHOLD	back to summary
private static final int LARGE_HASH_THRESHOLD Number of entries above which more than 1 byte is necessary for the hash index.

MAX_ELEMENT_COUNT	back to summary
private static final int MAX_ELEMENT_COUNT Maximum number of entries allowed in the map.

MIN_CAPACITY_INCREASE	back to summary
private static final int MIN_CAPACITY_INCREASE Minimum number of key/value pair entries added when the entries array is increased in size.

strategy	back to summary
private final Equivalence strategy The strategy used for comparing keys or `null` for denoting special strategy `Equivalence#IDENTITY`.

totalEntries	back to summary
private int totalEntries Total number of entries (actual entries plus deleted entries).

VERY_LARGE_HASH_THRESHOLD	back to summary
private static final int VERY_LARGE_HASH_THRESHOLD Number of entries above which more than 2 bytes are are necessary for the hash index.

Constructor Detail

EconomicMapImpl	back to summary
private EconomicMapImpl(Equivalence strategy, boolean isSet)

EconomicMapImpl	back to summary
private EconomicMapImpl(Equivalence strategy, int initialCapacity, boolean isSet)

EconomicMapImpl	back to summary
private EconomicMapImpl(Equivalence strategy, UnmodifiableEconomicMap<K, V> other, boolean isSet)

EconomicMapImpl	back to summary
private EconomicMapImpl(Equivalence strategy, UnmodifiableEconomicSet<K> other, boolean isSet)

Method Detail

add back to summary

add	back to summary
public boolean add(K element) Implements org.graalvm.collections.EconomicSet.add. Doc from org.graalvm.collections.EconomicSet.add. Adds `element` to this set if it is not already present. Returns:boolean `true` if this set did not already contain `element`. Annotations @SuppressWarnings:unchecked @Override

public boolean add(K element)

Implements org.graalvm.collections.EconomicSet.add.

Doc from org.graalvm.collections.EconomicSet.add.

Adds element to this set if it is not already present.

Returns:boolean

true if this set did not already contain element.

Annotations

@SuppressWarnings:unchecked
@Override

checkKeyNonNull	back to summary
private void checkKeyNonNull(K key)

clear	back to summary
public void clear() Implements org.graalvm.collections.EconomicMap.clear, org.graalvm.collections.EconomicSet.clear. Doc from org.graalvm.collections.EconomicMap.clear. Removes all of the mappings from this map. The map will be empty after this call returns. Annotations @Override

clear

back to summary

public void clear()

Implements org.graalvm.collections.EconomicMap.clear, org.graalvm.collections.EconomicSet.clear.

Doc from org.graalvm.collections.EconomicMap.clear.

Removes all of the mappings from this map. The map will be empty after this call returns.

Annotations

@Override

compareKeys	back to summary
private boolean compareKeys(Object key, Object entryKey)

compressLarge	back to summary
private int compressLarge(int nextIndex) Compresses the graph and returns the translated new next index.

contains back to summary

contains	back to summary
public boolean contains(K element) Implements org.graalvm.collections.UnmodifiableEconomicSet.contains. Doc from org.graalvm.collections.UnmodifiableEconomicSet.contains. Returns `true` if this set contains a mapping for the `element`. Annotations @Override

public boolean contains(K element)

Implements org.graalvm.collections.UnmodifiableEconomicSet.contains.

Doc from org.graalvm.collections.UnmodifiableEconomicSet.contains.

Returns true if this set contains a mapping for the element.

Annotations

@Override

containsKey back to summary

containsKey	back to summary
public boolean containsKey(K key) Implements org.graalvm.collections.UnmodifiableEconomicMap.containsKey. Doc from org.graalvm.collections.UnmodifiableEconomicMap.containsKey. Returns `true` if this map contains a mapping for `key`. Always returns `false` if the `key` is `null`. Annotations @Override

public boolean containsKey(K key)

Implements org.graalvm.collections.UnmodifiableEconomicMap.containsKey.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.containsKey.

Returns true if this map contains a mapping for key. Always returns false if the key is null.

Annotations

@Override

create	back to summary
public static <K, V> EconomicMapImpl<K, V> create(Equivalence strategy, boolean isSet)

create	back to summary
public static <K, V> EconomicMapImpl<K, V> create(Equivalence strategy, int initialCapacity, boolean isSet)

create	back to summary
public static <K, V> EconomicMapImpl<K, V> create(Equivalence strategy, UnmodifiableEconomicMap<K, V> other, boolean isSet)

create	back to summary
public static <K, V> EconomicMapImpl<K, V> create(Equivalence strategy, UnmodifiableEconomicSet<K> other, boolean isSet)

createHash	back to summary
private void createHash()

find	back to summary
private int find(K key)

findAndRemoveHash	back to summary
private int findAndRemoveHash(Object key)

findAndRemoveWithCollision	back to summary
private int findAndRemoveWithCollision(Object key, EconomicMapImpl.CollisionLink initialEntryValue, int initialIndexValue)

findHash	back to summary
private int findHash(K key)

findLinear	back to summary
private int findLinear(K key)

findWithCollision	back to summary
private int findWithCollision(K key, EconomicMapImpl.CollisionLink initialEntryValue)

get back to summary

get	back to summary
public V get(K key) Implements org.graalvm.collections.UnmodifiableEconomicMap.get. Doc from org.graalvm.collections.UnmodifiableEconomicMap.get. Returns the value to which `key` is mapped, or `null` if this map contains no mapping for `key`. The `key` must not be `null`. Annotations @SuppressWarnings:unchecked @Override

public V get(K key)

Implements org.graalvm.collections.UnmodifiableEconomicMap.get.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.get.

Returns the value to which key is mapped, or null if this map contains no mapping for key. The key must not be null.

Annotations

@SuppressWarnings:unchecked
@Override

getEntries back to summary

getEntries	back to summary
public MapCursor<K, V> getEntries() Implements org.graalvm.collections.EconomicMap.getEntries. Doc from org.graalvm.collections.EconomicMap.getEntries. Returns a `MapCursor` view of the mappings contained in this map. Annotations @Override

public MapCursor<K, V> getEntries()

Implements org.graalvm.collections.EconomicMap.getEntries.

Doc from org.graalvm.collections.EconomicMap.getEntries.

Returns a MapCursor view of the mappings contained in this map.

Annotations

@Override

getEquivalenceStrategy	back to summary
public Equivalence getEquivalenceStrategy() Overrides default org.graalvm.collections.UnmodifiableEconomicMap.getEquivalenceStrategy. Doc from org.graalvm.collections.UnmodifiableEconomicMap.getEquivalenceStrategy. Returns the strategy used to compare keys. Annotations @Override

getEquivalenceStrategy

back to summary

public Equivalence getEquivalenceStrategy()

Overrides default org.graalvm.collections.UnmodifiableEconomicMap.getEquivalenceStrategy.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.getEquivalenceStrategy.

Returns the strategy used to compare keys.

Annotations

@Override

getHashArray	back to summary
private int getHashArray(int index)

getHashIndex	back to summary
private int getHashIndex(Object key)

getHashTableSize	back to summary
private int getHashTableSize()

getHashThreshold	back to summary
private int getHashThreshold() Number of entries above which a hash table should be constructed.

getKey	back to summary
private Object getKey(int index)

getKeys back to summary

getKeys	back to summary
public Iterable<K> getKeys() Implements org.graalvm.collections.UnmodifiableEconomicMap.getKeys. Doc from org.graalvm.collections.UnmodifiableEconomicMap.getKeys. Returns a `Iterable` view of the keys contained in this map. Annotations @Override

public Iterable<K> getKeys()

Implements org.graalvm.collections.UnmodifiableEconomicMap.getKeys.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.getKeys.

Returns a Iterable view of the keys contained in this map.

Annotations

@Override

getRawValue	back to summary
private Object getRawValue(int index)

getValue	back to summary
private Object getValue(int index)

getValues back to summary

public Iterable<V> getValues()

Implements org.graalvm.collections.UnmodifiableEconomicMap.getValues.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.getValues.

Returns a Iterable view of the values contained in this map.

Annotations

@Override

grow	back to summary
private void grow()

hasHashArray	back to summary
private boolean hasHashArray()

init	back to summary
private void init(int size)

initFrom	back to summary
private boolean initFrom(Object o) Annotations @SuppressWarnings:unchecked

intercept	back to summary
private static <K, V> EconomicMapImpl<K, V> intercept(EconomicMapImpl<K, V> map) Intercept method for debugging purposes.

isEmpty back to summary

public boolean isEmpty()

Implements org.graalvm.collections.UnmodifiableEconomicMap.isEmpty, org.graalvm.collections.UnmodifiableEconomicSet.isEmpty.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.isEmpty.

Returns true if this map contains no key-value mappings.

Annotations

@Override

iterator back to summary

public Iterator<K> iterator()

Implements java.lang.Iterable.iterator.

Doc from java.lang.Iterable.iterator.

Returns an iterator over elements of type T.

Returns:Iterator<K>

an Iterator.

Annotations

@Override

maybeCompress	back to summary
private int maybeCompress(int nextIndex) Compresses the graph if there is a large number of deleted entries and returns the translated new next index.

put back to summary

public V put(K key, V value)

Implements org.graalvm.collections.EconomicMap.put.

Doc from org.graalvm.collections.EconomicMap.put.

Associates value with key in this map. If the map previously contained a mapping for key, the old value is replaced by value. While the value may be null, the key must not be {code null}.

Returns:V

the previous value associated with key, or null if there was no mapping for key.

Annotations

@SuppressWarnings:unchecked
@Override

putHashEntry	back to summary
private void putHashEntry(Object key, int entryIndex, boolean rehashOnCollision)

remove

back to summary

private int remove(int indexToRemove)

Implements org.graalvm.collections.EconomicSet.remove.

Removes the element at the specific index and returns the index of the next element. This can be a different value if graph compression was triggered.

remove back to summary

public void remove(K element)

Implements org.graalvm.collections.EconomicSet.remove.

Doc from org.graalvm.collections.EconomicSet.remove.

Removes element from this set if it is present. This set will not contain element once the call returns.

Annotations

@Override

removeKey back to summary

public V removeKey(K key)

Implements org.graalvm.collections.EconomicMap.removeKey.

Doc from org.graalvm.collections.EconomicMap.removeKey.

Removes the mapping for key from this map if it is present. The map will not contain a mapping for key once the call returns. The key must not be null.

Returns:V

the previous value associated with key, or null if there was no mapping for key.

Annotations

@SuppressWarnings:unchecked
@Override

replaceAll back to summary

public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function)

Implements org.graalvm.collections.EconomicMap.replaceAll.

Doc from org.graalvm.collections.EconomicMap.replaceAll.

Replaces each entry's value with the result of invoking function on that entry until all entries have been processed or the function throws an exception. Exceptions thrown by the function are relayed to the caller.

Annotations

@SuppressWarnings:unchecked
@Override

setHashArray	back to summary
private void setHashArray(int index, int value)

setKey	back to summary
private void setKey(int index, Object newValue)

setRawValue	back to summary
private void setRawValue(int index, Object newValue)

setValue	back to summary
private void setValue(int index, Object newValue)

size

back to summary

public int size()

Implements org.graalvm.collections.UnmodifiableEconomicMap.size, org.graalvm.collections.UnmodifiableEconomicSet.size.

Doc from org.graalvm.collections.UnmodifiableEconomicMap.size.

Returns the number of key-value mappings in this map.

Annotations

@Override

toString back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Returns:String

a string representation of the object

Annotations

@Override

toString	back to summary
pack-priv static <K, V> String toString(boolean isSet, int size, MapCursor<K, V> cursor)

org.graalvm.collections back to summary

private final Class EconomicMapImpl.CollisionLink

Class Inheritance

extends Object

java.lang.Object
org.graalvm.collections.EconomicMapImpl.CollisionLink

Links the collisions. Needs to be immutable class for allowing efficient shallow copy from other map on construction.

Field Summary

Modifier and Type	Field and Description
pack-priv final int	next Index plus one of the next entry in the collision link chain.
pack-priv final Object	value

Constructor Summary

Access	Constructor and Description
pack-priv	CollisionLink(Object value, int next)

Method Summary

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

next	back to summary
pack-priv final int next Index plus one of the next entry in the collision link chain.

value	back to summary
pack-priv final Object value

Constructor Detail

CollisionLink	back to summary
pack-priv CollisionLink(Object value, int next)

org.graalvm.collections back to summary

private abstract Class EconomicMapImpl.SparseMapIterator<E>

Class Inheritance

extends Object
implements Iterator<E>

java.lang.Object
org.graalvm.collections.EconomicMapImpl.SparseMapIterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
protected int	current

Constructor Summary

Access	Constructor and Description
private	SparseMapIterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

current	back to summary
protected int current

Constructor Detail

SparseMapIterator	back to summary
private SparseMapIterator()

Method Detail

hasNext back to summary

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Returns:boolean

true if the iteration has more elements

Annotations

@Override

remove back to summary

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations

@Override

pack-priv final Class EconomicMapImpl<K, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private final Class EconomicMapImpl.CollisionLink

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

private abstract Class EconomicMapImpl.SparseMapIterator<E>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail