Uses of Package
fj.data

Packages that use fj.data
Package
Description
Types that set the premise for the existence of Functional Java.
Functional control abstractions.
Parallelization strategies.
Common algebraic data types.
Provides 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized O(1) time.
 
Optic data types adapted from the Scala Monocle library and inspired by the Haskell Lens library.
Fixed-length vectors
A prelude of commonly used first-class functions
Parser combinators.
  • Classes in fj.data used by fj
    Class
    Description
    Provides an interface to arrays.
    The Either type represents a value of one of two possible types (a disjoint union).
     
    Abstracts over a type that may have a successor and/or predecessor value.
    IO monad for processing files
    A wrapper for Iterable that equips it with some useful functions.
    A lazy (non-evaluated) immutable character string.
    Provides an in-memory, immutable, singly linked list.
    Represents a natural number (zero, one, two, etc.)
    Provides an in-memory, immutable, singly linked list with total head and tail.
    An optional value that may be none (no value) or some (a value).
    A priority queue implementation backed by a FingerTree.
    Provides an immutable finite sequence, implemented as a finger tree.
    Provides an in-memory, immutable set, implemented as a red/black tree.
    A lazy (not yet evaluated), immutable, singly linked list.
    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.
    Isomorphic to Either but has renamed functions and represents failure on the left and success on the right.
     
    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
    The Either type represents a value of one of two possible types (a disjoint union).
  • Classes in fj.data used by fj.control.parallel
    Class
    Description
    Provides an interface to arrays.
    The Either type represents a value of one of two possible types (a disjoint union).
    Provides an in-memory, immutable, singly linked list.
    Provides an in-memory, immutable, singly linked list with total head and tail.
    An optional value that may be none (no value) or some (a value).
    A lazy (not yet evaluated), immutable, singly linked list.
    Provides a lazy, immutable, non-empty, multi-way tree (a rose tree).
    Provides a zipper structure for rose trees, which is a Tree supplied with a location within that tree.
    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.
    Provides an interface to arrays.
    Projects an array by providing only operations which do not mutate.
    Difference List.
    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.
     
     
     
     
    Abstracts over a type that may have a successor and/or predecessor value.
    Eval is an abstraction over different models of evaluation.
    A helper abstraction that allows to perform recursive lazy transformations in O(1) stack space.
    A mutable hash map providing O(1) lookup.
     
    A mutable hash set that guarantees uniqueness of its elements providing O(1) lookup.
    IO monad for processing files
    A 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
    A lazy (non-evaluated) immutable character string.
    Provides an in-memory, immutable, singly linked list.
    A mutable, singly linked list.
     
     
    Represents a natural number (zero, one, two, etc.)
    Provides an in-memory, immutable, singly linked list with total head and tail.
    An optional value that may be none (no value) or some (a value).
    A priority queue implementation backed by a FingerTree.
    The Reader monad (also called the function monad, so equivalent to the idea of F).
     
    Provides an immutable finite sequence, implemented as a finger tree.
    Provides an in-memory, immutable set, implemented as a red/black tree.
     
     
     
    A lazy (not yet evaluated), immutable, singly linked list.
    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.
    Isomorphic to Either but has renamed functions and represents failure on the left and success on the right.
    A failing projection of a validation.
     
    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
    An optional value that may be none (no value) or some (a value).
    A lazy (not yet evaluated), immutable, singly linked list.
  • Classes in fj.data used by fj.data.hamt
    Class
    Description
    The Either type represents a value of one of two possible types (a disjoint union).
    Provides an in-memory, immutable, singly linked list.
    An optional value that may be none (no value) or some (a value).
    Provides an immutable finite sequence, implemented as a finger tree.
    A lazy (not yet evaluated), immutable, singly linked list.
  • Classes in fj.data used by fj.data.optic
    Class
    Description
    The Either type represents a value of one of two possible types (a disjoint union).
    IO monad for processing files
    Provides an in-memory, immutable, singly linked list.
    An optional value that may be none (no value) or some (a value).
    A lazy (not yet evaluated), immutable, singly linked list.
    Isomorphic to Either 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
    Provides an interface to arrays.
    Provides an in-memory, immutable, singly linked list with total head and tail.
    A lazy (not yet evaluated), immutable, singly linked list.
  • Classes in fj.data used by fj.function
    Class
    Description
    Provides an in-memory, immutable, singly linked list.
    An optional value that may be none (no value) or some (a value).
    A lazy (not yet evaluated), immutable, singly linked list.
    Isomorphic to Either 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
    Provides an in-memory, immutable, singly linked list.
    A lazy (not yet evaluated), immutable, singly linked list.
    Isomorphic to Either but has renamed functions and represents failure on the left and success on the right.