BoundedBlockingQueue<E> |
BoundedBlockingQueue wraps any Queue and turns the result into a BlockingQueue with a limited capacity.
|
BoxedType |
|
BoxedType$ |
|
ByteIterator |
Get a single Byte from this iterator.
|
ByteIterator.ByteArrayIterator |
|
ByteIterator.ByteArrayIterator$ |
|
ByteIterator.MultiByteArrayIterator |
|
ByteIterator.MultiByteArrayIterator$ |
|
ByteIterator$ |
For performance sensitive code, call take() directly on ByteString (it's optimised there)
|
ByteString |
Java API: copy this ByteString into a fresh byte array
|
ByteString.ByteString1 |
|
ByteString.ByteString1$ |
|
ByteString.ByteString1C |
|
ByteString.ByteString1C$ |
|
ByteString.ByteStrings |
|
ByteString.ByteStrings$ |
|
ByteString.Companion$ |
|
ByteString$ |
Creates a new ByteString by copying a byte array.
|
ByteStringBuilder |
Java API: append a ByteString to this builder.
|
ClassLoaderObjectInputStream |
ClassLoaderObjectInputStream tries to utilize the provided ClassLoader to load Classes and falls
back to ObjectInputStreams resolver.
|
Collections |
INTERNAL API
|
Collections.EmptyImmutableSeq$ |
|
Collections.PartialImmutableValuesIterable<From,To> |
|
Collections$ |
INTERNAL API
|
CompactByteString |
A compact ByteString.
|
CompactByteString$ |
Creates a new CompactByteString by copying a byte array.
|
ConcurrentMultiMap<K,V> |
An implementation of a ConcurrentMultiMap
Adds/remove is serialized over the specified key
Reads are fully concurrent <-- el-cheapo
|
ConstantFun |
INTERNAL API
|
ConstantFun$ |
INTERNAL API
|
ErrorMessages |
INTERNAL API
|
ErrorMessages$ |
INTERNAL API
|
HashCode |
Set of methods which allow easy implementation of hashCode .
|
HashCode$ |
Set of methods which allow easy implementation of hashCode .
|
Helpers |
Create a comparator which will efficiently use System.identityHashCode ,
unless that happens to be the same for two non-equals objects, in which
case the supplied “real” comparator is used; the comparator must be
consistent with equals, otherwise it would not be an enhancement over
the identityHashCode.
|
Helpers.ConfigOps |
|
Helpers.ConfigOps$ |
|
Helpers.Requiring<A> |
Check that a condition is true.
|
Helpers.Requiring$ |
|
Helpers$ |
Create a comparator which will efficiently use System.identityHashCode ,
unless that happens to be the same for two non-equals objects, in which
case the supplied “real” comparator is used; the comparator must be
consistent with equals, otherwise it would not be an enhancement over
the identityHashCode.
|
ImmutableIntMap |
Worst case O(log n) , allocation free.
|
ImmutableIntMap$ |
INTERNAL API
|
Index<K,V> |
Associates the value of type V with the key of type K
|
JavaDurationConverters |
INTERNAL API
|
JavaDurationConverters.JavaDurationOps |
|
JavaDurationConverters.JavaDurationOps$ |
|
JavaDurationConverters.ScalaDurationOps |
|
JavaDurationConverters.ScalaDurationOps$ |
|
JavaDurationConverters$ |
INTERNAL API
|
JavaVersion |
INTERNAL API
|
JavaVersion$ |
INTERNAL API
|
LineNumbers |
Scala API: Obtain line number information for the class defining the given object.
|
LineNumbers.NoSourceInfo$ |
|
LineNumbers.SourceFile |
|
LineNumbers.SourceFile$ |
|
LineNumbers.SourceFileLines |
|
LineNumbers.SourceFileLines$ |
|
LineNumbers.UnknownSourceFormat |
|
LineNumbers.UnknownSourceFormat$ |
|
LineNumbers$ |
Scala API: Obtain line number information for the class defining the given object.
|
ManifestInfo |
Versions of artifacts from known vendors.
|
ManifestInfo.Version |
Comparable version information
|
ManifestInfo$ |
Comparable version information
|
MessageBuffer |
Check if the message buffer is empty.
|
MessageBuffer$ |
Create an empty message buffer.
|
MessageBufferMap<I> |
Check if the buffer map is empty.
|
NanoTimeTokenBucket |
Default implementation of TokenBucket that uses System.nanoTime as the time source.
|
OptionVal<A> |
|
OptionVal.Some$ |
|
OptionVal$ |
Represents non-existent values, null values.
|
PrettyByteString |
INTERNAL API: ByteString pretty printer, based on Johanes Rudolph's implementation from:
https://github.com/jrudolph/akka/commit/c889dddf37c8635c365a79a391eb18a709f36773#diff-947cbf07996eeb823cb9850cc2e81126R19
|
PrettyByteString.asPretty |
|
PrettyByteString$ |
INTERNAL API: ByteString pretty printer, based on Johanes Rudolph's implementation from:
https://github.com/jrudolph/akka/commit/c889dddf37c8635c365a79a391eb18a709f36773#diff-947cbf07996eeb823cb9850cc2e81126R19
|
PrettyDuration |
JAVA API
Selects most appropriate TimeUnit for given duration and formats it accordingly, with 4 digits precision
|
PrettyDuration.PrettyPrintableDuration |
Selects most appropriate TimeUnit for given duration and formats it accordingly, with 4 digits precision
|
PrettyDuration.PrettyPrintableDuration$ |
|
PrettyDuration$ |
JAVA API
Selects most appropriate TimeUnit for given duration and formats it accordingly, with 4 digits precision
|
PriorityQueueStabilizer.WrappedElement<E> |
|
PriorityQueueStabilizer.WrappedElementComparator<E> |
|
PriorityQueueStabilizer$ |
|
ReentrantGuard |
|
Reflect |
This optionally holds a function which looks N levels above itself
on the call stack and returns the Class[_] object for the code
executing in that stack frame.
|
Reflect$ |
This optionally holds a function which looks N levels above itself
on the call stack and returns the Class[_] object for the code
executing in that stack frame.
|
SerializedSuspendableExecutionContext |
Resumes execution of tasks until suspend is called,
if it isn't currently suspended, it is a no-op.
|
SerializedSuspendableExecutionContext$ |
|
StablePriorityBlockingQueue<E> |
StablePriorityBlockingQueue is a blocking priority queue that preserves order for elements of equal priority.
|
StablePriorityQueue<E> |
StablePriorityQueue is a priority queue that preserves order for elements of equal priority.
|
SubclassifiedIndex<K,V> |
Add key to this index which inherits its value set from the most specific
super-class which is known.
|
SubclassifiedIndex.Nonroot<K,V> |
|
SubclassifiedIndex$ |
True if and only if x is a subclass of y; equal classes must be considered sub-classes!
|
Switch |
Executes the provided action if the lock is on under a lock, so be _very_ careful with longrunning/blocking operations in it
Only executes the action if the switch is on, and switches it off immediately after obtaining the lock
Will switch it back on if the provided action throws an exception
|
Switch$ |
|
Timeout |
Construct a Timeout from the given time unit and factor.
|
Timeout$ |
A timeout with zero duration, will cause most requests to always timeout.
|
TokenBucket |
This method must be called before the token bucket can be used.
|
TraversableOnceExtensionMethods<A> |
Get a Builder for the collection.
|
TraversableOnceExtensionMethods$ |
|
TypedMultiMap<T,K> |
Return the set of keys which are mapped to non-empty value sets.
|
TypedMultiMap$ |
Obtain the empty map for the given key type and key–value type function.
|
Unsafe |
INTERNAL API
|
unused |
Marker for explicit or implicit parameter known to be unused, yet
still necessary from a binary compatibility perspective
or other reason.
|
WildcardIndex<T> |
|
WildcardIndex$ |
|
WildcardTree<T> |
|
WildcardTree$ |
|