Package io.atlassian.fugue

package io.atlassian.fugue

Related Packages

Package	Description
io.atlassian.fugue.deprecated
io.atlassian.fugue.extras
io.atlassian.fugue.hamcrest
io.atlassian.fugue.law
io.atlassian.fugue.optic
io.atlassian.fugue.retry

Class	Description
Applicant<A>	A thing upon which side-effects may be applied.
Checked	Helpers to work with functions that may throw exceptions.
Checked.Function<A,B,E extends Exception>	Represents a Checked.Function that may throw an exception.
Checked.Supplier<A,E extends 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>
Eithers	Utility functions for Eithers.
FugueCollectors	Collector instances.
FugueCollectors.Ref<A>	Mutable reference.
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.
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.
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.
Monoids	Monoid instances.
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.
Options	Utility methods for working with options.
Pair<A,B>	Represents a pair of objects.
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).
Semigroups	Semigroup instances.
Suppliers	Provide utility functions for the class of functions that supply a return value when invoked.
Suppliers.MemoizingSupplier<A>
Suppliers.WeakMemoizingSupplier<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>
Unit	An alternative to Void that is actually once inhabited (whereas Void is inhabited by null, which causes NPEs).