Uses of Package
fj.data
-
Packages that use fj.data Package Description fj Types that set the premise for the existence of Functional Java.fj.control Functional control abstractions.fj.control.parallel Parallelization strategies.fj.data Common algebraic data types.fj.data.fingertrees Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized O(1) time.fj.data.hamt fj.data.optic Optic data types adapted from the Scala Monocle library and inspired by the Haskell Lens library.fj.data.vector Fixed-length vectorsfj.function A prelude of commonly used first-class functionsfj.parser Parser combinators. -
Classes in fj.data used by fj Class Description Array Provides an interface to arrays.Either TheEither
type represents a value of one of two possible types (a disjoint union).Either3 Enumerator Abstracts over a type that may have a successor and/or predecessor value.IO IO monad for processing filesIterableW A wrapper for Iterable that equips it with some useful functions.LazyString A lazy (non-evaluated) immutable character string.List Provides an in-memory, immutable, singly linked list.Natural Represents a natural number (zero, one, two, etc.)NonEmptyList Provides an in-memory, immutable, singly linked list with totalhead
andtail
.Option An optional value that may be none (no value) or some (a value).PriorityQueue A priority queue implementation backed by aFingerTree
.Seq Provides an immutable finite sequence, implemented as a finger tree.Set Provides an in-memory, immutable set, implemented as a red/black tree.Stream A lazy (not yet evaluated), immutable, singly linked list.Tree Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).TreeMap An immutable, in-memory map, backed by a red-black tree.TreeZipper Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.Validation Isomorphic toEither
but has renamed functions and represents failure on the left and success on the right.Writer Zipper Provides a pointed stream, which is a non-empty zipper-like stream structure that tracks an index (focus) position in a stream. -
Classes in fj.data used by fj.control Class Description Either TheEither
type represents a value of one of two possible types (a disjoint union). -
Classes in fj.data used by fj.control.parallel Class Description Array Provides an interface to arrays.Either TheEither
type represents a value of one of two possible types (a disjoint union).List Provides an in-memory, immutable, singly linked list.NonEmptyList Provides an in-memory, immutable, singly linked list with totalhead
andtail
.Option An optional value that may be none (no value) or some (a value).Stream A lazy (not yet evaluated), immutable, singly linked list.Tree Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).TreeZipper Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.Zipper Provides a pointed stream, which is a non-empty zipper-like stream structure that tracks an index (focus) position in a stream. -
Classes in fj.data used by fj.data Class Description $ The constant arrow, for attaching a new name to an existing type.Array Provides an interface to arrays.Array.ImmutableProjection Projects an array by providing only operations which do not mutate.DList Difference List.Either TheEither
type represents a value of one of two possible types (a disjoint union).Either.LeftProjection A left projection of an either value.Either.RightProjection A right projection of an either value.Either3 Either3.LeftProjection Either3.MiddleProjection Either3.RightProjection Enumerator Abstracts over a type that may have a successor and/or predecessor value.Eval Eval
is an abstraction over different models of evaluation.Eval.TrampolineEval A helper abstraction that allows to perform recursive lazy transformations in O(1) stack space.HashMap A mutable hash map providing O(1) lookup.HashMap.Key HashSet A mutable hash set that guarantees uniqueness of its elements providing O(1) lookup.IO IO monad for processing filesIterableW A wrapper for Iterable that equips it with some useful functions.Iteratee.Input The input to an iteratee.Iteratee.IterV A pure iteratee computation which is either done or needs more inputLazyString A lazy (non-evaluated) immutable character string.List Provides an in-memory, immutable, singly linked list.List.Buffer A mutable, singly linked list.List.Cons List.Nil Natural Represents a natural number (zero, one, two, etc.)NonEmptyList Provides an in-memory, immutable, singly linked list with totalhead
andtail
.Option An optional value that may be none (no value) or some (a value).PriorityQueue A priority queue implementation backed by aFingerTree
.Reader The Reader monad (also called the function monad, so equivalent to the idea of F).SafeIO Seq Provides an immutable finite sequence, implemented as a finger tree.Set Provides an in-memory, immutable set, implemented as a red/black tree.Set.Color Set.Tree State Stream A lazy (not yet evaluated), immutable, singly linked list.Tree Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).TreeMap An immutable, in-memory map, backed by a red-black tree.TreeZipper Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.Validation Isomorphic toEither
but has renamed functions and represents failure on the left and success on the right.Validation.FailProjection A failing projection of a validation.Writer Zipper Provides a pointed stream, which is a non-empty zipper-like stream structure that tracks an index (focus) position in a stream. -
Classes in fj.data used by fj.data.fingertrees Class Description Option An optional value that may be none (no value) or some (a value).Stream A lazy (not yet evaluated), immutable, singly linked list. -
Classes in fj.data used by fj.data.hamt Class Description Either TheEither
type represents a value of one of two possible types (a disjoint union).List Provides an in-memory, immutable, singly linked list.Option An optional value that may be none (no value) or some (a value).Seq Provides an immutable finite sequence, implemented as a finger tree.Stream A lazy (not yet evaluated), immutable, singly linked list. -
Classes in fj.data used by fj.data.optic Class Description Either TheEither
type represents a value of one of two possible types (a disjoint union).IO IO monad for processing filesList Provides an in-memory, immutable, singly linked list.Option An optional value that may be none (no value) or some (a value).Stream A lazy (not yet evaluated), immutable, singly linked list.Validation Isomorphic toEither
but has renamed functions and represents failure on the left and success on the right. -
Classes in fj.data used by fj.data.vector Class Description Array Provides an interface to arrays.NonEmptyList Provides an in-memory, immutable, singly linked list with totalhead
andtail
.Stream A lazy (not yet evaluated), immutable, singly linked list. -
Classes in fj.data used by fj.function Class Description List Provides an in-memory, immutable, singly linked list.Option An optional value that may be none (no value) or some (a value).Stream A lazy (not yet evaluated), immutable, singly linked list.Validation Isomorphic toEither
but has renamed functions and represents failure on the left and success on the right. -
Classes in fj.data used by fj.parser Class Description List Provides an in-memory, immutable, singly linked list.Stream A lazy (not yet evaluated), immutable, singly linked list.Validation Isomorphic toEither
but has renamed functions and represents failure on the left and success on the right.