| Interface | Description |
|---|---|
| ISimpleList<T> |
Interface for a simple list abstraction.
|
| Class | Description |
|---|---|
| BiMap<K,V> |
A simple bi-directional map.
|
| ConcurrentHashSet<V> |
Concurrent hash set implementation.
|
| ConcurrentWeakMap<K,V> |
Concurrent weak hash map implementation.
|
| NullableContainer<T> |
A simple container that can hold a value.
|
| NullUnlimitedList<T> |
The class represents a list which allows null elements, but doesn't allocate a memory for them, in the rest of
cases it behaves like usual
ArrayList and should have the same complexity (because keys are unique
integers, so collisions are impossible). |
| SimpleArrayList<T> |
Portable implementation of
ArrayList. |
| Tuple2<T1,T2> |
Simple tuple container that holds two elements.
|
Copyright © 1998–2025 Apryse Group NV. All rights reserved.