All Classes and Interfaces
Class
Description
The constant arrow, for attaching a new name to an existing type.
Light weight actors for Java.
Provides an interface to arrays.
Projects an array by providing only operations which do not mutate.
Curried functions over Integers.
A sequence of bits representing a value.
Curried logical functions.
Represents the bottom _|_ value.
The Bounded class is used to name the upper and lower limits of a type.
Minimal definition of Bounded
Monadic functions and conversion methods for java.util.concurrent.Callable.
First-class functions on Characters.
A wrapper for a
Class that provides additional methods.A method of connecting to the database.
Functions that convert between data structure types.
The DB monad represents a database action, or a value within the context of a database connection.
Performs database I/O, in order to read or write the database state.
A finger tree with 1-4-digits on the left and right, and a finger tree of 2-3-nodes in the middle.
A digit is a vector of 1-4 elements.
The digits zero to nine.
Difference List.
Curried functions over Doubles.
Represents a side-effect.
The
Either type represents a value of one of two possible types (a disjoint union).A left projection of an either value.
A right projection of an either value.
The empty tree.
Abstracts over a type that may have a successor and/or predecessor value.
Tests for equality between two objects.
Primitives functions of Equal: alternative minimal definition and overridable methods.
Primitives functions of Equal: minimal definition and overridable methods.
Eval is an abstraction over different models of evaluation.Represents a lazy computation that is evaluated every time when it's requested.
Represents a lazy computation that is evaluated only once.
Represents an eager computation.
A helper abstraction that allows to perform recursive lazy transformations in O(1) stack space.
A transformation or function from
A to B.A transformation function of arity-2 from
A and B to C.A transformation function of arity-3 from
A, B and C to
D.A transformation function of arity-4 from
A, B, C and
D to E.A transformation function of arity-5 from
A, B, C,
D and E to F$.A transformation function of arity-6 from
A, B, C,
D, E and F$ to G.A transformation function of arity-7 from
A, B, C,
D, E, F$ and G to H.A transformation function of arity-8 from
A, B, C,
D, E, F$, G and H to
I.Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in
amortized O(1) time.
A
Fold can be seen as a Getter with many targets or a weaker PTraversal which cannot modify its
target.A four-element prefix or suffix of a finger tree.
Transformations on functions.
A
Getter can be seen as a glorified get method between a type S and a type A.Produces a hash code for an object which should attempt uniqueness.
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.
A mutable hash map providing O(1) lookup.
A mutable hash set that guarantees uniqueness of its elements providing O(1) lookup.
Type-safe heterogeneous lists.
Type-level function application operators.
The concatenation of two heterogeneous lists.
The nonempty list
The catamorphism over heterogeneous lists.
The empty list
A basic prelude of values lifted into the type system.
Type-level integer arithmetic
Type-level boolean conjunction.
A type-level Boolean
A type-level conditional.
Type-level equality.
Boolean false
Type-level natural numbers.
Type-level boolean disjunction.
A natural number N + 1
Boolean true
Type-level zero
Curried functions over Integers.
IO monad for processing files
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).PIso when S = T and A = BA wrapper for Iterable that equips it with some useful functions.
The input to an iteratee.
A pure iteratee computation which is either done or needs more input
Functions that convert between types from the core Java API.
A lazy (non-evaluated) immutable character string.
https://en.wikipedia.org/wiki/Linear_congruential_generator
PLens with a monomorphic set functionProvides an in-memory, immutable, singly linked list.
A mutable, singly linked list.
Optic factory methods for a List
Curried functions over Longs.
A builder of trees and tree components, supplied with a particular monoid and measuring function.
Determines how the elements of a tree are measured and how measures are summed.
A monoid abstraction to be defined across types of the given type argument.
Primitives functions of Monoid: alternative minimal definition and overridable methods.
Primitives functions of Monoid: minimal definition and overridable methods.
Represents a natural number (zero, one, two, etc.)
An inner node of the 2-3 tree.
A Hash Array Mapped Trie node that is either a key-value pair or a
Hash Array Mapped Trie.
A two-element inner tree node.
A three-element inner tree node.
Provides an in-memory, immutable, singly linked list with total
head and tail.A single-element prefix or suffix of a finger tree.
An optional value that may be none (no value) or some (a value).
POptional restricted to monomorphic updateTests for ordering between two objects.
Primitives functions of Ord: alternative minimal definition and overridable methods.
Primitives functions of Ord: minimal definition and overridable methods.
The comparison of two instances of a type may have one of three orderings; less than, equal or
greater than.
Functions across products.
A product-2.
Optic factory methods for a P2
A product-3.
A product-4.
A product-5.
A product-6.
A product-7.
A product-8.
A module of higher-order concurrency features.
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.
Parsers that accept
Stream<Character> input.Parsers that accept
Stream input.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.Functions that convert between Java primitive types.
A priority queue implementation backed by a
FingerTree.PPrism restricted to monomorphic updateRepresents a non-blocking future value.
A
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.The Reader monad (also called the function monad, so equivalent to the idea of F).
A parse result made up of a value (A) and the remainder of the parse input (I).
Implementations must satisfy the law of associativity:
Associativity; forall x.
Primitives functions of Semigroup: alternative minimal definition and overridable methods.
Primitives functions of Semigroup: minimal definition and overridable methods.
Provides an immutable finite sequence, implemented as a finger tree.
Provides an in-memory, immutable set, implemented as a red/black tree.
PSetter with a monomorphic modify functionRenders an object for display.
A tree with a single element.
Functional-style parallel evaluation strategies.
A lazy (not yet evaluated), immutable, singly linked list.
Curried string functions.
A three-element prefix or suffix of a finger tree.
A Trampoline is a potentially branching computation that can be stepped through and executed in constant stack.
Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).
An immutable, in-memory map, backed by a red-black tree.
Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.
A product of
A which may throw an Exception.A transformation function from
A to B that may throw an Exception.A transformation function of arity-2 from
A and B to C that may throw an Exception.A transformation function of arity-3 from
A, B and C to D that may throw an Exception.A transformation function of arity-4 from
A, B, C and D to E that may throw an Exception.A transformation function of arity-5 from
A, B, C, D and E to F that may throw an Exception.A transformation function of arity-6 from
A, B, C, D, E and F to G that may throw an Exception.A transformation function of arity-7 from
A, B, C, D, E, F and G to H that may throw an Exception.A transformation function of arity-8 from
A, B, C, D, E, F, G and H to I that may throw an Exception.A two-element prefix or suffix of a finger tree.
The unit type which has only one value.
Functions across vectors.
A vector-2.
A vector-3.
A vector-4.
A vector-5.
A vector-6.
A vector-7.
A vector-8.
Isomorphic to
Either but has renamed functions and represents failure on the left and success on the right.A failing projection of a validation.
The essence of the visitor design pattern expressed polymorphically.
A logically uninhabited data type.
Provides a pointed stream, which is a non-empty zipper-like stream structure that tracks an index (focus)
position in a stream.