Package org.jruby.util.collections
package org.jruby.util.collections
-
ClassDescriptionAbstractEntry<TypeK,
TypeV> A simple implementation ofMap.Entry.ClassValue<T>Represents a cache or other mechanism for getting the Ruby-level proxy classes for a given Java class.Calculate a value based on an incoming class.An auto-resizing table oflongs, supporting low-contention CAS operations.A hash table with weak keys, full concurrency of retrievals, and adjustable expected concurrency for updates.ConcurrentWeakHashMap list entry.Segments are specialized versions of hash tables.A weak-key reference which stores the key hash needed for reclamation.A simple high-performance counter.IntHashMap<V>A proxy cache that uses Java 7's ClassValue.A simple Map-based cache of proxies.NonBlockingHashMapLong<TypeV>A lock-free alternate implementation ofConcurrentHashMapwith primitive long keys, better scaling properties and generally lower costs.NonBlockingHashMapLong.CHM<TypeV>An RubyArray that maintains an O(1) Set for fast include? operations.WeakHashSet<T>A simple set that uses weak references to ensure that its elements can be garbage collected.WeakValuedIdentityMap<Key,Value> Map-like that holds its values weakly and uses object identity for keys.WeakValuedMap<Key,Value> Map-like that holds its values weakly (backed by a concurrent hash map).WeakValuedMap.KeyedReference<Key,Value>