Skip navigation links
A B C D E G H I K L M N O P R S T U V W 

A

add(E) - Method in interface org.graalvm.collections.EconomicSet
Adds element to this set if it is not already present.
add(T) - Method in class org.graalvm.collections.LockFreePool
Adds an element to this pool.
addAll(EconomicSet<E>) - Method in interface org.graalvm.collections.EconomicSet
Adds all of the elements in other to this set if they're not already present.
addAll(Iterable<E>) - Method in interface org.graalvm.collections.EconomicSet
Adds all of the elements in values to this set if they're not already present.
addAll(Iterator<E>) - Method in interface org.graalvm.collections.EconomicSet
Adds all of the elements enumerated by iterator to this set if they're not already present.
advance() - Method in interface org.graalvm.collections.UnmodifiableMapCursor
Advances to the next entry.
allocator() - Method in class org.graalvm.collections.LockFreePrefixTree
 
Allocator() - Constructor for class org.graalvm.collections.LockFreePrefixTree.Allocator
 
at(LockFreePrefixTree.Allocator, long) - Method in class org.graalvm.collections.LockFreePrefixTree.Node
Get existing (or create if missing) child with the given key.
at(long) - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
Get existing (or create if missing) child with the given key.

B

bitwiseOrValue(long) - Method in class org.graalvm.collections.LockFreePrefixTree.Node
Atomically does the bitwise-or on the current value.

C

clear() - Method in interface org.graalvm.collections.EconomicMap
Removes all of the mappings from this map.
clear() - Method in class org.graalvm.collections.EconomicMapWrap
 
clear() - Method in interface org.graalvm.collections.EconomicSet
Removes all of the elements from this set.
contains(E) - Method in interface org.graalvm.collections.UnmodifiableEconomicSet
Returns true if this set contains a mapping for the element.
containsKey(K) - Method in class org.graalvm.collections.EconomicMapWrap
 
containsKey(K) - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns true if this map contains a mapping for key.
create() - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set with the default Equivalence.DEFAULT comparison strategy for keys.
create(int) - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set with the default Equivalence.DEFAULT comparison strategy for keys and initializes with a specified capacity.
create(Equivalence) - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set with the given comparison strategy for keys.
create(UnmodifiableEconomicMap<K, V>) - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set with the default Equivalence.DEFAULT comparison strategy for keys and copies all elements from the specified existing map.
create(Equivalence, UnmodifiableEconomicMap<K, V>) - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set and copies all elements from the specified existing map.
create(Equivalence, int) - Static method in interface org.graalvm.collections.EconomicMap
Creates a new map that guarantees insertion order on the key set and initializes with a specified capacity.
create() - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements with the default Equivalence.DEFAULT comparison strategy.
create(Equivalence) - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements.
create(int) - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements with the default Equivalence.DEFAULT comparison strategy and inserts all elements of the specified collection.
create(UnmodifiableEconomicSet<E>) - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements with the default Equivalence.DEFAULT comparison strategy and inserts all elements of the specified collection.
create(Equivalence, int) - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements and initializes with the given capacity.
create(Equivalence, UnmodifiableEconomicSet<E>) - Static method in interface org.graalvm.collections.EconomicSet
Creates a new set guaranteeing insertion order when iterating over its elements and inserts all elements of the specified collection.
create(L, R) - Static method in class org.graalvm.collections.Pair
Constructs a pair with its left value being left, and its right value being right, or returns an empty pair if both inputs are null.
createLeft(L) - Static method in class org.graalvm.collections.Pair
Constructs a pair with its left value being left, or returns an empty pair if left is null.
createRight(R) - Static method in class org.graalvm.collections.Pair
Constructs a pair with its right value being right, or returns an empty pair if right is null.

D

DEFAULT - Static variable in class org.graalvm.collections.Equivalence
Default equivalence calling Object.equals(Object) to check equality and Object.hashCode() for obtaining hash values.

E

EconomicMap<K,V> - Interface in org.graalvm.collections
Memory efficient map data structure that dynamically changes its representation depending on the number of entries and is specially optimized for small number of entries.
EconomicMapUtil - Class in org.graalvm.collections
Utility methods for the EconomicMap.
EconomicMapWrap<K,V> - Class in org.graalvm.collections
Wraps an existing Map as an EconomicMap.
EconomicMapWrap(Map<K, V>) - Constructor for class org.graalvm.collections.EconomicMapWrap
 
EconomicSet<E> - Interface in org.graalvm.collections
Memory efficient set data structure.
empty() - Static method in class org.graalvm.collections.Pair
Returns an empty pair.
emptyCursor() - Static method in interface org.graalvm.collections.EconomicMap
Return an empty MapCursor.
emptyMap() - Static method in interface org.graalvm.collections.EconomicMap
Return an empty, unmodifiable EconomicMap.
equals(UnmodifiableEconomicMap<K, V>, UnmodifiableEconomicMap<K, V>) - Static method in class org.graalvm.collections.EconomicMapUtil
Compares maps for equality.
equals(Object, Object) - Method in class org.graalvm.collections.Equivalence
Returns true if the non-null arguments are equal to each other and false otherwise.
equals(Object) - Method in class org.graalvm.collections.Pair
Equivalence - Class in org.graalvm.collections
Strategy for comparing two objects.
Equivalence() - Constructor for class org.graalvm.collections.Equivalence
Subclass for creating custom equivalence definitions.

G

get(K) - Method in class org.graalvm.collections.EconomicMapWrap
 
get() - Method in class org.graalvm.collections.LockFreePool
Returns a previously added element.
get(K) - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns the value to which key is mapped, or null if this map contains no mapping for key.
get(K, V) - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns the value to which key is mapped, or defaultValue if this map contains no mapping for key.
getEntries() - Method in interface org.graalvm.collections.EconomicMap
Returns a MapCursor view of the mappings contained in this map.
getEntries() - Method in class org.graalvm.collections.EconomicMapWrap
 
getEntries() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns a UnmodifiableMapCursor view of the mappings contained in this map.
getEquivalenceStrategy() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns the strategy used to compare keys.
getKey() - Method in interface org.graalvm.collections.UnmodifiableMapCursor
The key of the current entry.
getKeys() - Method in class org.graalvm.collections.EconomicMapWrap
 
getKeys() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns a Iterable view of the keys contained in this map.
getLeft() - Method in class org.graalvm.collections.Pair
Returns the left value of this pair.
getRight() - Method in class org.graalvm.collections.Pair
Returns the right value of this pair.
getValue() - Method in interface org.graalvm.collections.UnmodifiableMapCursor
The value of the current entry.
getValues() - Method in class org.graalvm.collections.EconomicMapWrap
 
getValues() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns a Iterable view of the values contained in this map.

H

hashCode(UnmodifiableEconomicMap<K, V>) - Static method in class org.graalvm.collections.EconomicMapUtil
Computes an order-independent hash code for an EconomicMap.
hashCode(Object) - Method in class org.graalvm.collections.Equivalence
Returns the hash code of a non-null argument o.
hashCode() - Method in class org.graalvm.collections.Pair
HeapAllocator() - Constructor for class org.graalvm.collections.LockFreePrefixTree.HeapAllocator
 

I

IDENTITY - Static variable in class org.graalvm.collections.Equivalence
Identity equivalence using == to check equality and Object.hashCode() for obtaining hash values.
IDENTITY_WITH_SYSTEM_HASHCODE - Static variable in class org.graalvm.collections.Equivalence
Identity equivalence using == to check equality and System.identityHashCode(Object) for obtaining hash values.
incValue() - Method in class org.graalvm.collections.LockFreePrefixTree.Node
Increment value.
incValue() - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
Increment value.
isEmpty() - Method in class org.graalvm.collections.EconomicMapWrap
 
isEmpty() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns true if this map contains no key-value mappings.
isEmpty() - Method in interface org.graalvm.collections.UnmodifiableEconomicSet
Returns true if this set contains no elements.

K

keySet(EconomicMap<K, V>) - Static method in class org.graalvm.collections.EconomicMapUtil
Returns an EconomicSet of the keys contained in a map.

L

lexicographicalComparator(Comparator<K>, Comparator<V>) - Static method in class org.graalvm.collections.EconomicMapUtil
Creates a lexicographical map comparator using the provided key and value comparators.
LockFreePool<T> - Class in org.graalvm.collections
Concurrent lock-free pool data structure.
LockFreePool() - Constructor for class org.graalvm.collections.LockFreePool
 
LockFreePrefixTree - Class in org.graalvm.collections
Thread-safe and lock-free prefix-tree implementation in which keys are sequences of 64-bit values, and the values are 64-bit values.
LockFreePrefixTree(LockFreePrefixTree.Allocator) - Constructor for class org.graalvm.collections.LockFreePrefixTree
Create new LockFreePrefixTree with root being a Node with key 0.
LockFreePrefixTree.Allocator - Class in org.graalvm.collections
Policy for allocating objects of the lock-free prefix tree.
LockFreePrefixTree.HeapAllocator - Class in org.graalvm.collections
Allocator that allocates objects directly on the managed heap.
LockFreePrefixTree.Node - Class in org.graalvm.collections
 
LockFreePrefixTree.ObjectPoolingAllocator - Class in org.graalvm.collections
Allocator that internally maintains several pools of preallocated objects, and allocates objects from those pools.

M

MapCursor<K,V> - Interface in org.graalvm.collections
Cursor to iterate over a mutable map.

N

newHashChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.Allocator
Allocates a new reference array of child nodes stored as a hash table.
newHashChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.HeapAllocator
 
newHashChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 
newLinearChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.Allocator
Allocates a new reference array of child nodes stored linearly.
newLinearChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.HeapAllocator
 
newLinearChildren(int) - Method in class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 
newNode(long) - Method in class org.graalvm.collections.LockFreePrefixTree.Allocator
Allocates a new Node object.
newNode(long) - Method in class org.graalvm.collections.LockFreePrefixTree.HeapAllocator
 
newNode(long) - Method in class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 

O

ObjectPoolingAllocator() - Constructor for class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 
ObjectPoolingAllocator(int) - Constructor for class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 
of(K, V) - Static method in interface org.graalvm.collections.EconomicMap
Creates an EconomicMap with one mapping.
of(K, V, K, V) - Static method in interface org.graalvm.collections.EconomicMap
Creates an EconomicMap with two mappings.
org.graalvm.collections - package org.graalvm.collections
The GraalVM SDK collections package contains memory efficient data structures.

P

Pair<L,R> - Class in org.graalvm.collections
Utility class representing a pair of values.
put(K, V) - Method in interface org.graalvm.collections.EconomicMap
Associates value with key in this map.
put(K, V) - Method in class org.graalvm.collections.EconomicMapWrap
 
putAll(EconomicMap<K, V>) - Method in interface org.graalvm.collections.EconomicMap
Copies all of the mappings from other to this map.
putAll(UnmodifiableEconomicMap<? extends K, ? extends V>) - Method in interface org.graalvm.collections.EconomicMap
Copies all of the mappings from other to this map.
putIfAbsent(K, V) - Method in interface org.graalvm.collections.EconomicMap
If the specified key is not already associated with a value (or is mapped to null) associates it with the given value and returns null, else returns the current value.
putIfAbsent(K, V) - Method in class org.graalvm.collections.EconomicMapWrap
 

R

remove(E) - Method in interface org.graalvm.collections.EconomicSet
Removes element from this set if it is present.
remove() - Method in interface org.graalvm.collections.MapCursor
Remove the current entry from the map.
removeAll(EconomicSet<E>) - Method in interface org.graalvm.collections.EconomicSet
Removes from this set all of its elements that are contained in other.
removeAll(Iterable<E>) - Method in interface org.graalvm.collections.EconomicSet
Removes from this set all of its elements that are contained in values.
removeAll(Iterator<E>) - Method in interface org.graalvm.collections.EconomicSet
Removes from this set all of its elements that are enumerated by iterator.
removeKey(K) - Method in interface org.graalvm.collections.EconomicMap
Removes the mapping for key from this map if it is present.
removeKey(K) - Method in class org.graalvm.collections.EconomicMapWrap
 
replaceAll(BiFunction<? super K, ? super V, ? extends V>) - Method in interface org.graalvm.collections.EconomicMap
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.
replaceAll(BiFunction<? super K, ? super V, ? extends V>) - Method in class org.graalvm.collections.EconomicMapWrap
 
reset() - Method in class org.graalvm.collections.LockFreePrefixTree
Resets the tree.
retainAll(EconomicSet<E>) - Method in interface org.graalvm.collections.EconomicSet
Removes from this set all of its elements that are not contained in other.
root() - Method in class org.graalvm.collections.LockFreePrefixTree
The root node of the tree.
root() - Method in class org.graalvm.collections.SeqLockPrefixTree
The root node of the tree.

S

SeqLockPrefixTree - Class in org.graalvm.collections
Thread-safe prefix-tree implementation in which keys are sequences of 64-bit values, and the values are 64-bit values.
SeqLockPrefixTree() - Constructor for class org.graalvm.collections.SeqLockPrefixTree
Create new SeqLockPrefixTree with root being a Node with key 0.
SeqLockPrefixTree.Node - Class in org.graalvm.collections
 
seqlockValue() - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
 
setValue(long) - Method in class org.graalvm.collections.LockFreePrefixTree.Node
Set the value for the LockFreePrefixTree.Node.
setValue(V) - Method in interface org.graalvm.collections.MapCursor
Set the value of the current entry.
setValue(long) - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
Set the value for the LockFreePrefixTree.Node.
shutdown() - Method in class org.graalvm.collections.LockFreePrefixTree.Allocator
Releases the allocator's resources.
shutdown() - Method in class org.graalvm.collections.LockFreePrefixTree.HeapAllocator
 
shutdown() - Method in class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 
size() - Method in class org.graalvm.collections.EconomicMapWrap
 
size() - Method in interface org.graalvm.collections.UnmodifiableEconomicMap
Returns the number of key-value mappings in this map.
size() - Method in interface org.graalvm.collections.UnmodifiableEconomicSet
Returns the number of elements in this set.
status() - Method in class org.graalvm.collections.LockFreePrefixTree.ObjectPoolingAllocator
 

T

toArray(E[]) - Method in interface org.graalvm.collections.UnmodifiableEconomicSet
Stores all of the elements in this set into target.
topDown(C, BiFunction<C, Long, C>, BiConsumer<C, Long>) - Method in class org.graalvm.collections.LockFreePrefixTree
Traverse the tree top-down while maintaining a context.
topDown(C, BiFunction<C, Long, C>, BiConsumer<C, Long>) - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
Traverse the tree top-down while maintaining a context.
toString() - Method in class org.graalvm.collections.EconomicMapWrap
 
toString() - Method in class org.graalvm.collections.LockFreePrefixTree.Node
 
toString() - Method in class org.graalvm.collections.Pair
toString() - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
 

U

UnmodifiableEconomicMap<K,V> - Interface in org.graalvm.collections
Unmodifiable memory efficient map.
UnmodifiableEconomicSet<E> - Interface in org.graalvm.collections
Unmodifiable memory efficient set data structure.
UnmodifiableMapCursor<K,V> - Interface in org.graalvm.collections
Cursor to iterate over a map without changing its contents.

V

value() - Method in class org.graalvm.collections.LockFreePrefixTree.Node
 
value() - Method in class org.graalvm.collections.SeqLockPrefixTree.Node
 

W

wrapMap(Map<K, V>) - Static method in interface org.graalvm.collections.EconomicMap
Wraps an existing Map as an EconomicMap.
A B C D E G H I K L M N O P R S T U V W 
Skip navigation links