All Classes

Class	Description
Applicant<A>	A thing upon which side-effects may be applied.
BeforeRetryExponentialBackoffTask	A backoff task for use in a retry -function, -supplier, or -task.
BeforeRetryLinearBackoffTask	A backoff task for use in a retry -function, -supplier, or -task.
Checked	Helpers to work with functions that may throw exceptions.
Checked.Function<A,B,E extends java.lang.Exception>	Represents a Checked.Function that may throw an exception.
Checked.Supplier<A,E extends java.lang.Exception>	Represents a Checked.Supplier that may throw an exception.
Effect<A>	Deprecated. in favour of Consumer
Effect.Applicant<A>	Deprecated. in favour of Iterable
Either<L,R>	A class that acts as a container for a value of one of two types.
Either.Left<L,R>
Either.Projection<A,B,L,R>
Either.Right<L,R>
EitherMatchers
EitherMatchers.LeftMatcher<L>
EitherMatchers.RightMatcher<R>
EitherOptics
Eithers	Utility functions for Eithers.
EitherStep1<A,LEFT>	The first step of the Either type.
EitherStep2<A,B,LEFT>	The second step of the Either type.
EitherStep3<A,B,C,LEFT>	The third step of the Either type.
EitherStep4<A,B,C,D,LEFT>	The fourth step of the Either type.
EitherStep5<A,B,C,D,E,LEFT>	The fifth step of the Either type.
EitherStep6<A,B,C,D,E,F,LEFT>	The sixth step of the Either type.
ExceptionHandler	Takes action when an Exception is thrown.
ExceptionHandlers	Provides some standard implementations of various exception actions.
ExceptionHandlers.CompositeExceptionHandler
ExceptionHandlers.IgnoreExceptionHandler
ExceptionHandlers.LoggingExceptionHandler
Fold<S,A>	A Fold can be seen as a Getter with many targets or a weaker PTraversal which cannot modify its target.
FugueCollectors	Collector instances.
FugueCollectors.Ref<A>	Mutable reference.
Function2<A,B,C>	Deprecated. since 2.4 use BiFunction instead
Function3<A,B,C,Z>	Represents a function that accepts three arguments and produces a result.
Function4<A,B,C,D,Z>	Represents a function that accepts four arguments and produces a result.
Function5<A,B,C,D,E,Z>	Represents a function that accepts five arguments and produces a result.
Function6<A,B,C,D,E,F,Z>	Represents a function that accepts six arguments and produces a result.
Functions	Utility methods for Functions
Functions.CurriedFunction<A,B,C>
Functions.FlippedFunction<A,B,C>
Functions.FromConsumer<D>
Functions.FromSupplier<D,R>
Functions.FunctionComposition<A,B,C>
Functions.IdentityFunction
Functions.InstanceOf<A,B>
Functions.Matcher<A,B>
Functions.Partial<A,B>
Functions.PartialComposer<A,B,C>
Functions.WeakMemoizer<A,B>	Class supports the implementation of Functions.weakMemoize(Function) and is not intended for general use.
Functions.WeakMemoizer.MappedReference<K,V>	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.
Getter<S,A>	A Getter can be seen as a glorified get method between a type S and a type A.
ImmutableMaps	Provides some utility methods to convert Iterables to ImmutableMap, and to transform Maps.
IsEq<A>	Represents two values of the same type that are expected to be equal.
Iso<S,A>	PIso when S = T and A = B
IsoLaws<S,A>
Iterables	Contains static utility methods that operate on or return objects of type {code}Iterable{code}.
Iterables.CollectingIterable<A,B>	CollectingIterable, filters and transforms in one.
Iterables.Cycle<A>
Iterables.Cycle.Iter<A>
Iterables.Drop<A>	Iterable that only shows a small range of the original Iterable.
Iterables.Drop.Iter<A>
Iterables.Filter<A>
Iterables.Intersperse<A>
Iterables.IterableToString<A>
Iterables.IteratingIterable<A>	Infinite iterable that repeatedly applies f to start
Iterables.IteratingIterable.Iter<A>
Iterables.Join<A>
Iterables.Join.Iter<A>
Iterables.LazyReference<T>	Class supports the implementation of Iterables.memoize(Iterable) and is not intended for general use.
Iterables.LazyReference.InitializationException	If the factory Iterables.LazyReference.create() method threw an exception, this wraps it.
Iterables.LazyReference.State
Iterables.Mapped<A,B>
Iterables.Memoizer<A>	Memoizing iterable, maintains a lazily computed linked list of nodes.
Iterables.Memoizer.End<A>
Iterables.Memoizer.Iter<A>
Iterables.Memoizer.Lazy<A>	Lazily computes the next node.
Iterables.Memoizer.Node<A>	Linked list node.
Iterables.MergeSortedIterable<A>	Merges multiple sorted Iterables into one, sorted iterable.
Iterables.MergeSortedIterable.Iter<A>
Iterables.Take<A>	Iterable that only shows a small range of the original Iterable.
Iterables.Take.Iter<A>
Iterables.UnfoldingIterable<A,B>	Iterable that repeatedly applies f until it returns none()
Iterables.UnfoldingIterable.Iter<A,B>
Iterables.Zipper<A,B,C>	Iterable that combines two iterables using a combiner function.
Iterators	Utility class for constructing iterables
Iterators.Abstract<A>	A template implementation of the Iterator interface, so clients can more easily implement Iterator for some patterns of iteration.
Iterators.Abstract.State
Iterators.EmptyIterator
Iterators.Peek<A>	Marker interface for use in constructing iterators
Iterators.Peeking<A>	Iterator that can examine next without removing it
Iterators.PeekingImpl<A>	Implementation of Iterators.Peeking that avoids peeking unless necessary.
Iterators.Unmodifiable<E>	Iterator where Iterators.Unmodifiable.remove() is unsupported.
Lens<S,A>	PLens with a monomorphic set function
LensLaws<S,A>
Maybe<A>	Implemented by things that may or may not contain a value.
Monoid<A>	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.
MonoidLaws<A>	Laws for a monoid
Monoids	Monoid instances.
NoOp	Runnable that does nothing.
Option<A>	A class that encapsulates missing values.
Option.None	One of the big two actual implementation classes.
Option.Some<A>	One of the big two actual implementation classes.
Optional<S,A>	POptional restricted to monomorphic update
OptionalLaws<S,A>
OptionalStep1<A>	The first step of the Optional type.
OptionalStep2<A,B>	The second step of the Optional type.
OptionalStep3<A,B,C>	The third step of the Optional type.
OptionalStep4<A,B,C,D>	The fourth step of the Optional type.
OptionalStep5<A,B,C,D,E>	The fifth step of the Optional type.
OptionalStep6<A,B,C,D,E,F>	The sixth step of the Optional type.
OptionMatchers
OptionMatchers.NoneMatcher
OptionMatchers.SomeMatcher<T>
OptionOptics
Options	Utility methods for working with options.
OptionStep1<A>	The first step of the Option type.
OptionStep2<A,B>	The second step of the Option type.
OptionStep3<A,B,C>	The third step of the Option type.
OptionStep4<A,B,C,D>	The fourth step of the Option type.
OptionStep5<A,B,C,D,E>	The fifth step of the Option type.
OptionStep6<A,B,C,D,E,F>	The sixth step of the Option type.
Pair<A,B>	Represents a pair of objects.
PairOptics
PIso<S,T,A,B>	A PIso defines an isomorphism between types S, A and B, T:
PLens<S,T,A,B>	A PLens can be seen as a pair of functions: - `get: S => A` i.e.
POptional<S,T,A,B>	A POptional can be seen as a pair of functions: - `getOrModify: S => T \/ A` - `set : (B, S) => T`
PPrism<S,T,A,B>	A PPrism can be seen as a pair of functions: - `getOrModify: S => T \/ A` - `reverseGet : B => T`
Predicate3<A,B,C>	Represents a predicate (boolean-valued function) of three arguments.
Predicate4<A,B,C,D>	Represents a predicate (boolean-valued function) of four arguments.
Predicate5<A,B,C,D,E>	Represents a predicate (boolean-valued function) of five arguments.
Predicate6<A,B,C,D,E,F>	Represents a predicate (boolean-valued function) of five arguments.
Prism<S,A>	PPrism restricted to monomorphic update
PrismLaws<S,A>
PSetter<S,T,A,B>	A PSetter is a generalisation of Functor map: - `map: (A => B) => F[A] => F[B]` - `modify: (A => B) => S => T`
PTraversal<S,T,A,B>	A PTraversal can be seen as a POptional generalised to 0 to n targets where n can be infinite.
RetryFactory	Provides factory methods for RetryFunction, RetryTask, and RetrySupplier.
RetryFunction<F,T>	A Function which wraps the apply method of another Function and attempts it up to a fixed number of times.
RetrySupplier<T>	A Supplier which wraps the apply method of another Supplier and attempts it up to a fixed number of times.
RetryTask	A Runnable which wraps the apply method of another Runnable and attempts it a fixed number of times.
Semigroup<A>	A Semigroup is an algebraic structure consisting of an associative binary operation across the values of a given type (the Semigroup type argument).
SemigroupLaws<A>	Laws for a semigroup
Semigroups	Semigroup instances.
Setter<S,A>	PSetter with a monomorphic modify function
SetterLaws<S,A>
Steps	This provides an entry point for a "for-comprehension" styled syntax shortcut of fugue Option, Either, Try and Java 8 Optional.
Suppliers	Provide utility functions for the class of functions that supply a return value when invoked.
Suppliers.MemoizingSupplier<A>
Suppliers.WeakMemoizingSupplier<A>
Throwables	Deprecated. since 2.4, no need in Java7 with closeWithResources and multi-catch
Throwables.ExceptionFunction<E extends java.lang.Exception>
Traversal<S,A>
TraversalLaws<S,A>
Try<A>	A Try represents a computation that may either throw an exception or return a value.
Try.Delayed<A>
Try.Failure<A>
Try.Success<A>
TryMatchers
TryMatchers.FailureMatcher
TryMatchers.SuccessfulMatcher<A>
TryStep1<A>	The first step of the Try type.
TryStep2<A,B>	The second step of the Try type.
TryStep3<A,B,C>	The third step of the Try type.
TryStep4<A,B,C,D>	The fourth step of the Try type.
TryStep5<A,B,C,D,E>	The fifth step of the Try type.
TryStep6<A,B,C,D,E,F>	The sixth step of the Try type.
Unit	An alternative to Void that is actually once inhabited (whereas Void is inhabited by null, which causes NPEs).