Package org.glassfish.jersey.internal.util.collection
package org.glassfish.jersey.internal.util.collection
Common set of Jersey collection classes.
-
ClassDescriptionAn
InputStream
backed by a queue ofbyte buffers
to be read.Cache<K,V> Cache implementation that relies on FutureTask.Should a cycle be detected during computation of a value for given key, this interface allows client code to register a callback that would get invoked in such a case.A pair of raw class and the related type.ConcurrentHashMapV8<K,V> A hash table supporting full concurrency of retrievals and high expected concurrency for updates.Base of key, value, and entry Iterators.Base class for views.Holder for the thread-local hash code determining which CounterCell to use.A view of a ConcurrentHashMapV8 as aSet
of (key, value) entries.A node inserted at head of bins during transfer operations.A view of a ConcurrentHashMapV8 as aSet
of keys, in which additions may optionally be enabled by mapping to a common value.Exported Entry for EntryIteratorKey-value entry.A place-holder node used in computeIfAbsent and computeStripped-down version of helper class used in previous version, declared for the sake of serialization compatibilityEncapsulates traversal for methods such as containsValue; also serves as a base class for other iterators and spliterators.TreeNodes used at the heads of bins.Nodes for use in TreeBinsA view of a ConcurrentHashMapV8 as aCollection
of values, in which additions are disabled.Utility class, which tries to pickup the best collection implementation depending on running environment.Set of convenient function regarding a collection immutability.An immutable view of aMultivaluedMap
.A key comparator.KeyComparatorHashMap<K,V> A implementation similar toHashMap
but supports the comparison of keys using aKeyComparator
.A implementation similar toLinkedHashMap
but supports the comparison of keys using aKeyComparator
.LinkedHashMap entry.LazyUnsafeValue<T,E extends Throwable> Lazily initializedunsafe value
.LazyValue<T>Lazily initializedvalue
.An unboundedTransferQueue
based on linked nodes.Queue nodes.An implementation ofMultivaluedMap
where keys and values are instances of String.An abstractInputStream
extension that defines contract for non-blocking streamingread
operations.An implementation ofMultivaluedMap
where values can benull
.Ref<T>A possibly mutable value reference.A collection ofreference
factory & utility methods.Default (mutable)Ref
implementation.ImmutableRef
implementation.Thread-safeRef
implementation.Settable<T>A generic settable value container.Case insensitive String key comparator.Multivalued map with String keys that are compared with each other using the case insensitive method.A random number generator isolated to the current thread.ABlockingQueue
in which producers may wait for consumers to receive elements.UnsafeValue<T,E extends Throwable> A generic value provider, similar toValue
, but able to throw an exception.Value<T>A generic value provider.A collection ofValue provider
factory & utility methods.Values.ExceptionValue<T,E extends Throwable> Values.InstanceUnsafeValue<T,E extends Throwable> Values.LazyUnsafeValueImpl<T,E extends Throwable>