| Modifier and Type | Interface and Description |
|---|---|
| public interface |
| Modifier and Type | Class and Description |
|---|---|
| pack-priv abstract class | AbstractEntry<
the type of keys maintained by this map TypeK, the type of mapped values TypeV>A simple implementation of |
| public abstract class | ClassValue<
value T>Represents a cache or other mechanism for getting the Ruby-level proxy classes for a given Java class. |
| pack-priv class | ConcurrentAutoTable
An auto-resizing table of |
| public class | ConcurrentWeakHashMap<
the type of keys maintained by this map K, the type of mapped values V>A hash table with weak keys, full concurrency of retrievals, and adjustable expected concurrency for updates. |
| pack-priv class | Counter
A simple high-performance counter. |
| public class | |
| public class | |
| public class | |
| public class | |
| pack-priv class | |
| public class | |
| public class | NonBlockingHashMapLong<
the type of mapped values TypeV>A lock-free alternate implementation of |
| public class | SingleBoolean
A carrier object with a single boolean |
| public class | SingleDouble
A carrier object with a single double |
| public class | SingleInt
A carrier object with a single int |
| public class | SingleLong
A carrier object with a single long |
| public class | |
| public class | StringArraySet
An RubyArray that maintains an O(1) Set for fast include? |
| public class | WeakHashSet<
type T>A simple set that uses weak references to ensure that its elements can be garbage collected. |
| public class | WeakValuedIdentityMap<
key Key, value Value>Map-like that holds its values weakly and uses object identity for keys. |
| public class | WeakValuedMap<
key Key, value Value>Map-like that holds its values weakly (backed by a concurrent hash map). |