All Classes and Interfaces
Class
Description
A thing upon which side-effects may be applied.
A backoff task for use in a retry -function, -supplier, or -task.
A backoff task for use in a retry -function, -supplier, or -task.
Helpers to work with functions that may throw exceptions.
Represents a
Checked.Function that may throw an exception.Represents a
Checked.Supplier that may throw an exception.Deprecated.
Deprecated.
in favour of
IterableA class that acts as a container for a value of one of two types.
Utility functions for Eithers.
The first step of the
Either type.The second step of the
Either type.The third step of the
Either type.The fourth step of the
Either type.The fifth step of the
Either type.The sixth step of the
Either type.Takes action when an Exception is thrown.
Provides some standard implementations of various exception actions.
A
Fold can be seen as a Getter with many targets or a weaker
PTraversal which cannot modify its target.Collector instances.Mutable reference.
Deprecated.
since 2.4 use BiFunction instead
Represents a function that accepts three arguments and produces a result.
Represents a function that accepts four arguments and produces a result.
Represents a function that accepts five arguments and produces a result.
Represents a function that accepts six arguments and produces a result.
Utility methods for Functions
Class supports the implementation of
Functions.weakMemoize(Function) and is not intended for general
use.A weak reference that maintains a reference to the key so that it can be
removed from the map when the value is garbage collected.
A
Getter can be seen as a glorified get method between a type S and a
type A.Provides some utility methods to convert Iterables to ImmutableMap, and to
transform Maps.
Represents two values of the same type that are expected to be equal.
PIso when S = T and A = BContains static utility methods that operate on or return objects of type
{code}Iterable{code}.
CollectingIterable, filters and transforms in one.
Iterable that only shows a small range of the original Iterable.
Infinite iterable that repeatedly applies
f to startClass supports the implementation of
Iterables.memoize(Iterable)
and is not intended for general use.If the factory
Iterables.LazyReference.create() method threw an exception,
this wraps it.Memoizing iterable, maintains a lazily computed linked list of nodes.
Lazily computes the next node.
Linked list node.
Merges multiple sorted Iterables into one, sorted iterable.
Iterable that only shows a small range of the original Iterable.
Iterable that repeatedly applies
f until it returns none()Iterable that combines two iterables using a combiner function.
Utility class for constructing iterables
A template implementation of the
Iterator interface, so clients can
more easily implement Iterator for some patterns of iteration.Marker interface for use in constructing iterators
Iterator that can examine next without removing it
Implementation of Iterators.Peeking that avoids peeking unless necessary.
Iterator where
Iterators.Unmodifiable.remove() is unsupported.PLens with a monomorphic set functionImplemented by things that may or may not contain a value.
A Monoid is an algebraic structure consisting of an associative binary
operation across the values of a given type (a monoid is a
Semigroup)
and an identity element for this operation.Laws for a monoid
Monoid instances.Runnable that does nothing.
A class that encapsulates missing values.
One of the big two actual implementation classes.
One of the big two actual implementation classes.
POptional restricted to monomorphic updateThe first step of the
Optional type.The second step of the
Optional type.The third step of the
Optional type.The fourth step of the
Optional type.The fifth step of the
Optional type.The sixth step of the
Optional type.Utility methods for working with
options.The first step of the
Option type.The second step of the
Option type.The third step of the
Option type.The fourth step of the
Option type.The fifth step of the
Option type.The sixth step of the
Option type.Represents a pair of objects.
A
PIso defines an isomorphism between types S, A and B, T:A
PLens can be seen as a pair of functions: - `get: S => A` i.e.A
POptional can be seen as a pair of functions: - `getOrModify: S
=> T \/ A` - `set : (B, S) => T`A
PPrism can be seen as a pair of functions: - `getOrModify: S =>
T \/ A` - `reverseGet : B => T`Represents a predicate (boolean-valued function) of three arguments.
Represents a predicate (boolean-valued function) of four arguments.
Represents a predicate (boolean-valued function) of five arguments.
Represents a predicate (boolean-valued function) of five arguments.
PPrism restricted to monomorphic updateA
PSetter is a generalisation of Functor map: - `map: (A => B)
=> F[A] => F[B]` - `modify: (A => B) => S => T`A
PTraversal can be seen as a POptional generalised to 0 to n
targets where n can be infinite.Provides factory methods for RetryFunction, RetryTask, and RetrySupplier.
A Function which wraps the apply method of another Function and attempts it
up to a fixed number of times.
A Supplier which wraps the apply method of another Supplier and attempts it
up to a fixed number of times.
A Runnable which wraps the apply method of another Runnable and attempts it a
fixed number of times.
A Semigroup is an algebraic structure consisting of an associative binary
operation across the values of a given type (the Semigroup type argument).
Laws for a semigroup
Semigroup instances.PSetter with a monomorphic modify functionProvide utility functions for the class of functions that supply a return
value when invoked.
Deprecated.
since 2.4, no need in Java7 with closeWithResources and
multi-catch
A
Try represents a computation that may either throw an
exception or return a value.The first step of the
Try type.The second step of the
Try type.The third step of the
Try type.The fourth step of the
Try type.The fifth step of the
Try type.The sixth step of the
Try type.An alternative to
Void that is actually once inhabited
(whereas Void is inhabited by null, which causes NPEs).
Consumer