Package io.atlassian.fugue
package io.atlassian.fugue
-
ClassDescriptionApplicant<A>A thing upon which side-effects may be applied.Helpers to work with functions that may throw exceptions.Checked.Function<A,
B, E extends Exception> Represents aChecked.Functionthat may throw an exception.Checked.Supplier<A,E extends Exception> Represents aChecked.Supplierthat may throw an exception.Effect<A>Deprecated.Deprecated.in favour ofIterableEither<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> Utility functions for Eithers.Collectorinstances.Mutable reference.Utility methods for FunctionsFunctions.CurriedFunction<A,B, C> Functions.FlippedFunction<A,B, C> Functions.InstanceOf<A,B> Functions.Matcher<A,B> Functions.Partial<A,B> Functions.PartialComposer<A,B, C> Class supports the implementation ofFunctions.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.Contains 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 appliesftostartClass supports the implementation ofIterables.memoize(Iterable)and is not intended for general use.If the factoryIterables.LazyReference.create()method threw an exception, this wraps it.Iterables.Mapped<A,B> 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 appliesfuntil it returnsnone()Iterables.Zipper<A,B, C> Iterable that combines two iterables using a combiner function.Utility class for constructing iterablesA template implementation of theIteratorinterface, so clients can more easily implement Iterator for some patterns of iteration.Marker interface for use in constructing iteratorsIterator that can examine next without removing itImplementation of Iterators.Peeking that avoids peeking unless necessary.Iterator whereIterators.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 aSemigroup) and an identity element for this operation.Monoidinstances.Option<A>A class that encapsulates missing values.One of the big two actual implementation classes.Option.Some<A>One of the big two actual implementation classes.Utility methods for working withoptions.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).Semigroupinstances.Provide utility functions for the class of functions that supply a return value when invoked.Try<A>ATryrepresents a computation that may either throw an exception or return a value.Try.Delayed<A>Try.Failure<A>Try.Success<A>An alternative toVoidthat is actually once inhabited (whereas Void is inhabited by null, which causes NPEs).
Consumer