All Classes

Class	Description
$<A,B>	The constant arrow, for attaching a new name to an existing type.
Actor<A>	Light weight actors for Java.
Array<A>	Provides an interface to arrays.
Array.ImmutableProjection<A>	Projects an array by providing only operations which do not mutate.
BigIntegers	Curried functions over Integers.
BitSet	A sequence of bits representing a value.
Booleans	Curried logical functions.
Bottom	Represents the bottom _|_ value.
Bounded<A>	The Bounded class is used to name the upper and lower limits of a type.
Bounded.Definition<A>	Minimal definition of Bounded
Callables	Monadic functions and conversion methods for java.util.concurrent.Callable.
Characters	First-class functions on Characters.
Class<T>	A wrapper for a Class that provides additional methods.
Collectors
Connector	A method of connecting to the database.
Conversions	Functions that convert between data structure types.
DB<A>	The DB monad represents a database action, or a value within the context of a database connection.
DbState	Performs database I/O, in order to read or write the database state.
Deep<V,A>	A finger tree with 1-4-digits on the left and right, and a finger tree of 2-3-nodes in the middle.
Digit<V,A>	A digit is a vector of 1-4 elements.
Digit	The digits zero to nine.
DList<A>	Difference List.
Doubles	Curried functions over Doubles.
Effect	Represents a side-effect.
Effect0
Effect1<A>
Effect2<A,B>
Effect3<A,B,C>
Effect4<A,B,C,D>
Effect5<A,B,C,D,E>
Effect6<A,B,C,D,E,F>
Effect7<A,B,C,D,E,F,G>
Effect8<A,B,C,D,E,F,G,H>
Either<A,B>	The Either type represents a value of one of two possible types (a disjoint union).
Either.Left<A,B>
Either.LeftProjection<A,B>	A left projection of an either value.
Either.Right<A,B>
Either.RightProjection<A,B>	A right projection of an either value.
Either3<A,B,C>
Either3.Left<A,B,C>
Either3.LeftProjection<A,B,C>
Either3.Middle<A,B,C>
Either3.MiddleProjection<A,B,C>
Either3.Right<A,B,C>
Either3.RightProjection<A,B,C>
Empty<V,A>	The empty tree.
Enumerator<A>	Abstracts over a type that may have a successor and/or predecessor value.
Equal<A>	Tests for equality between two objects.
Equal.AltDefinition<A>	Primitives functions of Equal: alternative minimal definition and overridable methods.
Equal.Definition<A>	Primitives functions of Equal: minimal definition and overridable methods.
Eval<A>	Eval is an abstraction over different models of evaluation.
Eval.Always<A>	Represents a lazy computation that is evaluated every time when it's requested.
Eval.BindTrampolineEval<A,B>
Eval.DeferEval<A>
Eval.Later<A>	Represents a lazy computation that is evaluated only once.
Eval.Now<A>	Represents an eager computation.
Eval.PureTrampolineEval<A>
Eval.TrampolineEval<A>	A helper abstraction that allows to perform recursive lazy transformations in O(1) stack space.
F<A,B>	A transformation or function from A to B.
F0<A>
F2<A,B,C>	A transformation function of arity-2 from A and B to C.
F3<A,B,C,D>	A transformation function of arity-3 from A, B and C to D.
F4<A,B,C,D,E>	A transformation function of arity-4 from A, B, C and D to E.
F5<A,B,C,D,E,F$>	A transformation function of arity-5 from A, B, C, D and E to F$.
F6<A,B,C,D,E,F$,G>	A transformation function of arity-6 from A, B, C, D, E and F$ to G.
F7<A,B,C,D,E,F$,G,H>	A transformation function of arity-7 from A, B, C, D, E, F$ and G to H.
F8<A,B,C,D,E,F$,G,H,I>	A transformation function of arity-8 from A, B, C, D, E, F$, G and H to I.
FingerTree<V,A>	Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized O(1) time.
Fold<S,A>	A Fold can be seen as a Getter with many targets or a weaker PTraversal which cannot modify its target.
Four<V,A>	A four-element prefix or suffix of a finger tree.
Function	Transformations on functions.
Getter<S,A>	A Getter can be seen as a glorified get method between a type S and a type A.
Hash<A>	Produces a hash code for an object which should attempt uniqueness.
HashArrayMappedTrie<K,V>	A hash array mapped trie (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.
HashMap<K,V>	A mutable hash map providing O(1) lookup.
HashSet<A>	A mutable hash set that guarantees uniqueness of its elements providing O(1) lookup.
HList<A extends HList<A>>	Type-safe heterogeneous lists.
HList.Apply<F$,A,R>	Type-level function application operators.
HList.HAppend<A,B,C>	The concatenation of two heterogeneous lists.
HList.HCons<E,L extends HList<L>>	The nonempty list
HList.HFoldr<G,V,L,R>	The catamorphism over heterogeneous lists.
HList.HNil	The empty list
HPre	A basic prelude of values lifted into the type system.
HPre.HAdd<A extends HPre.HNat<A>,B extends HPre.HNat<B>,C extends HPre.HNat<C>>	Type-level integer arithmetic
HPre.HAnd<A extends HPre.HBool,B extends HPre.HBool,C extends HPre.HBool>	Type-level boolean conjunction.
HPre.HBool	A type-level Boolean
HPre.HCond<T,X,Y,Z>	A type-level conditional.
HPre.HEq<X,Y,B extends HPre.HBool>	Type-level equality.
HPre.HFalse	Boolean false
HPre.HNat<A extends HPre.HNat<A>>	Type-level natural numbers.
HPre.HOr<A extends HPre.HBool,B extends HPre.HBool,C extends HPre.HBool>	Type-level boolean disjunction.
HPre.HSucc<N extends HPre.HNat<N>>	A natural number N + 1
HPre.HTrue	Boolean true
HPre.HZero	Type-level zero
Integers	Curried functions over Integers.
IO<A>	IO monad for processing files
IOFunctions	IO monad for processing files, with main methods IOFunctions.enumFileLines(java.io.File, fj.data.Option<java.nio.charset.Charset>, fj.data.Iteratee.IterV<java.lang.String, A>), IOFunctions.enumFileChars(java.io.File, fj.data.Option<java.nio.charset.Charset>, fj.data.Iteratee.IterV<java.lang.Character, A>) and IOFunctions.enumFileCharChunks(java.io.File, fj.data.Option<java.nio.charset.Charset>, fj.data.Iteratee.IterV<char[], A>) (the latter one is the fastest as char chunks read from the file are directly passed to the iteratee without indirection in between).
IOFunctions.CharChunkReader<A>
IOFunctions.CharChunkReader2<A>
IOFunctions.LineReader<A>
Iso<S,A>	PIso when S = T and A = B
IterableW<A>	A wrapper for Iterable that equips it with some useful functions.
Iteratee
Iteratee.Input<E>	The input to an iteratee.
Iteratee.IterV<E,A>	A pure iteratee computation which is either done or needs more input
Java	Functions that convert between types from the core Java API.
Java8
LazyString	A lazy (non-evaluated) immutable character string.
LcgRng	https://en.wikipedia.org/wiki/Linear_congruential_generator
Lens<S,A>	PLens with a monomorphic set function
List<A>	Provides an in-memory, immutable, singly linked list.
List.Buffer<A>	A mutable, singly linked list.
List.Cons<A>
List.Nil<A>
List.Optic	Optic factory methods for a List
List.Unsafe
ListUtil
Longs	Curried functions over Longs.
MakeTree<V,A>	A builder of trees and tree components, supplied with a particular monoid and measuring function.
Measured<V,A>	Determines how the elements of a tree are measured and how measures are summed.
Monoid<A>	A monoid abstraction to be defined across types of the given type argument.
Monoid.AltDefinition<A>	Primitives functions of Monoid: alternative minimal definition and overridable methods.
Monoid.Definition<A>	Primitives functions of Monoid: minimal definition and overridable methods.
Natural	Represents a natural number (zero, one, two, etc.)
Node<V,A>	An inner node of the 2-3 tree.
Node<K,V>	A Hash Array Mapped Trie node that is either a key-value pair or a Hash Array Mapped Trie.
Node2<V,A>	A two-element inner tree node.
Node3<V,A>	A three-element inner tree node.
NonEmptyList<A>	Provides an in-memory, immutable, singly linked list with total head and tail.
One<V,A>	A single-element prefix or suffix of a finger tree.
Option<A>	An optional value that may be none (no value) or some (a value).
Option.None<A>
Option.Optic
Option.Some<A>
Optional<S,A>	POptional restricted to monomorphic update
Ord<A>	Tests for ordering between two objects.
Ord.AltDefinition<A>	Primitives functions of Ord: alternative minimal definition and overridable methods.
Ord.Definition<A>	Primitives functions of Ord: minimal definition and overridable methods.
Ordering	The comparison of two instances of a type may have one of three orderings; less than, equal or greater than.
P	Functions across products.
P1<A>
P1.Memo<A>
P1.ReferenceMemo<A>
P1.SoftReferenceMemo<A>
P1.WeakReferenceMemo<A>
P2<A,B>	A product-2.
P2.Optic	Optic factory methods for a P2
P3<A,B,C>	A product-3.
P4<A,B,C,D>	A product-4.
P5<A,B,C,D,E>	A product-5.
P6<A,B,C,D,E,F>	A product-6.
P7<A,B,C,D,E,F,G>	A product-7.
P8<A,B,C,D,E,F,G,H>	A product-8.
ParModule	A module of higher-order concurrency features.
Parser<I,A,E>	A parser is a function that takes some input (I) and produces either an error (E) or a parse result (A) and the remainder of the input.
Parser.CharsParser	Parsers that accept Stream<Character> input.
Parser.StreamParser	Parsers that accept Stream input.
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
Primitive	Functions that convert between Java primitive types.
PriorityQueue<K,A>	A priority queue implementation backed by a FingerTree.
Prism<S,A>	PPrism restricted to monomorphic update
Promise<A>	Represents a non-blocking future value.
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.
Reader<A,B>	The Reader monad (also called the function monad, so equivalent to the idea of F).
Result<I,A>	A parse result made up of a value (A) and the remainder of the parse input (I).
Rng
SafeIO<A>
Semigroup<A>	Implementations must satisfy the law of associativity: Associativity; forall x.
Semigroup.AltDefinition<A>	Primitives functions of Semigroup: alternative minimal definition and overridable methods.
Semigroup.Definition<A>	Primitives functions of Semigroup: minimal definition and overridable methods.
Seq<A>	Provides an immutable finite sequence, implemented as a finger tree.
Set<A>	Provides an in-memory, immutable set, implemented as a red/black tree.
Set.Color
Set.Empty<A>
Set.Tree<A>
Setter<S,A>	PSetter with a monomorphic modify function
Show<A>	Renders an object for display.
Single<V,A>	A tree with a single element.
State<S,A>
Strategy<A>	Functional-style parallel evaluation strategies.
Stream<A>	A lazy (not yet evaluated), immutable, singly linked list.
Stream.Cons<A>
Stream.Nil<A>
Strings	Curried string functions.
Three<V,A>	A three-element prefix or suffix of a finger tree.
Trampoline<A>	A Trampoline is a potentially branching computation that can be stepped through and executed in constant stack.
Trampoline.Codense<A>
Trampoline.Normal<A>
Trampoline.Pure<A>
Trampoline.Suspend<A>
Traversal<S,A>
Tree<A>	Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).
TreeMap<K,V>	An immutable, in-memory map, backed by a red-black tree.
TreeZipper<A>	Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.
Try
Try0<A,Z extends java.lang.Exception>	A product of A which may throw an Exception.
Try1<A,B,Z extends java.lang.Exception>	A transformation function from A to B that may throw an Exception.
Try2<A,B,C,Z extends java.lang.Exception>	A transformation function of arity-2 from A and B to C that may throw an Exception.
Try3<A,B,C,D,Z extends java.lang.Exception>	A transformation function of arity-3 from A, B and C to D that may throw an Exception.
Try4<A,B,C,D,E,Z extends java.lang.Exception>	A transformation function of arity-4 from A, B, C and D to E that may throw an Exception.
Try5<A,B,C,D,E,F,Z extends java.lang.Exception>	A transformation function of arity-5 from A, B, C, D and E to F that may throw an Exception.
Try6<A,B,C,D,E,F,G,Z extends java.lang.Exception>	A transformation function of arity-6 from A, B, C, D, E and F to G that may throw an Exception.
Try7<A,B,C,D,E,F,G,H,Z extends java.lang.Exception>	A transformation function of arity-7 from A, B, C, D, E, F and G to H that may throw an Exception.
Try8<A,B,C,D,E,F,G,H,I,Z extends java.lang.Exception>	A transformation function of arity-8 from A, B, C, D, E, F, G and H to I that may throw an Exception.
TryEffect
TryEffect0<Z extends java.lang.Exception>
TryEffect1<A,Z extends java.lang.Exception>
TryEffect2<A,B,Z extends java.lang.Exception>
TryEffect3<A,B,C,Z extends java.lang.Exception>
TryEffect4<A,B,C,D,Z extends java.lang.Exception>
TryEffect5<A,B,C,D,E,Z extends java.lang.Exception>
TryEffect6<A,B,C,D,E,F,Z extends java.lang.Exception>
TryEffect7<A,B,C,D,E,F,G,Z extends java.lang.Exception>
TryEffect8<A,B,C,D,E,F,G,H,Z extends java.lang.Exception>
Two<V,A>	A two-element prefix or suffix of a finger tree.
Unit	The unit type which has only one value.
V	Functions across vectors.
V2<A>	A vector-2.
V3<A>	A vector-3.
V4<A>	A vector-4.
V5<A>	A vector-5.
V6<A>	A vector-6.
V7<A>	A vector-7.
V8<A>	A vector-8.
Validation<E,T>	Isomorphic to Either but has renamed functions and represents failure on the left and success on the right.
Validation.FailProjection<E,T>	A failing projection of a validation.
Visitor	The essence of the visitor design pattern expressed polymorphically.
Void	A logically uninhabited data type.
Writer<W,A>
Zipper<A>	Provides a pointed stream, which is a non-empty zipper-like stream structure that tracks an index (focus) position in a stream.