Top Description Interfaces Annotations Classes
module collections

Package org.graalvm.collections


The GraalVM SDK collections package contains memory efficient data structures.
Since
19.0
See Also
org.graalvm.collections.EconomicMap, org.graalvm.collections.EconomicSet

Interface Summary

Modifier and TypeInterface and Description
public interface
EconomicMap<K, V>

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.

public interface
EconomicSet<E>

Memory efficient set data structure.

public interface
MapCursor<K, V>

Cursor to iterate over a mutable map.

public interface
UnmodifiableEconomicMap<K, V>

Unmodifiable memory efficient map.

public interface
UnmodifiableEconomicSet<E>

Unmodifiable memory efficient set data structure.

public interface
UnmodifiableMapCursor<K, V>

Cursor to iterate over a map without changing its contents.

Annotation Summary

Modifier and TypeAnnotation and Description
pack-priv @interface
SuppressFBWarnings

Used to suppress SpotBugs warnings.

Class Summary

Modifier and TypeClass and Description
pack-priv class
EconomicMapImpl<K, V>

Implementation of a map with a memory-efficient structure that always preserves insertion order when iterating over keys.

public class
EconomicMapUtil

Utility methods for the EconomicMap.

public class
EconomicMapWrap<K, V>

Wraps an existing Map as an EconomicMap.

pack-priv class
EmptyMap

Singleton instances for empty maps and the corresponding iterators and cursors.

public abstract class
Equivalence

Strategy for comparing two objects.

public class
LockFreePool<
Type of the elements in this pool.
T
>

Concurrent lock-free pool data structure.

public class
LockFreePrefixTree

Thread-safe and lock-free prefix-tree implementation in which keys are sequences of 64-bit values, and the values are 64-bit values.

public class
Pair<L, R>

Utility class representing a pair of values.

public class
SeqLockPrefixTree

Thread-safe prefix-tree implementation in which keys are sequences of 64-bit values, and the values are 64-bit values.