Packages

•  package root

  Definition Classes

  root

•  package scalaz

  Scalaz: Type classes and pure functional data structures for Scala.

  Scalaz: Type classes and pure functional data structures for Scala.

  This package, scalaz, contains:

  • type class definitions
  • data structures
  • related functions

  Type class instances and other functions related to the Scala and Java standard library are in scalaz.std

  Implicit conversions and wrapper classes that provide a more convenient syntax for accessing the functionality of the library are in scalaz.syntax.

  Type Classes Index

  • scalaz.Semigroup
  • scalaz.Monoid extends scalaz.Semigroup
  • scalaz.Equal
  • scalaz.Show
  • scalaz.Order extends scalaz.Equal
  • scalaz.Enum extends scalaz.Order
  • scalaz.Plus
  • scalaz.PlusEmpty extends scalaz.Plus
  • scalaz.IsEmpty extends scalaz.PlusEmpty
  • scalaz.Optional
  • scalaz.InvariantFunctor
  • scalaz.Functor extends scalaz.InvariantFunctor
  • scalaz.Contravariant extends scalaz.InvariantFunctor
  • scalaz.Divide extends scalaz.Contravariant
  • scalaz.Divisible extends scalaz.Divide
  • scalaz.Apply extends scalaz.Functor
  • scalaz.Applicative extends scalaz.Apply
  • scalaz.Align extends scalaz.Functor
  • scalaz.Zip
  • scalaz.Unzip
  • scalaz.Cozip
  • scalaz.Bind extends scalaz.Apply
  • scalaz.BindRec extends scalaz.Bind
  • scalaz.Monad extends scalaz.Applicative with scalaz.Bind
  • scalaz.Cobind extends scalaz.Functor
  • scalaz.Comonad extends scalaz.Cobind
  • scalaz.ApplicativePlus extends scalaz.Applicative with scalaz.PlusEmpty
  • scalaz.MonadPlus extends scalaz.Monad with scalaz.ApplicativePlus
  • scalaz.Foldable
  • scalaz.Foldable1 extends scalaz.Foldable
  • scalaz.Traverse extends scalaz.Functor with scalaz.Foldable
  • scalaz.Traverse1 extends scalaz.Traverse with scalaz.Foldable1
  • scalaz.Associative
  • scalaz.Bifunctor
  • scalaz.Bifoldable
  • scalaz.Bitraverse extends scalaz.Bifunctor with scalaz.Bifoldable
  • scalaz.Nondeterminism extends scalaz.Monad
  • scalaz.Compose
  • scalaz.Profunctor
  • scalaz.Strong extends scalaz.Profunctor
  • scalaz.ProChoice extends scalaz.Profunctor
  • scalaz.Category extends scalaz.Compose
  • scalaz.Choice extends scalaz.Category
  • scalaz.Split extends scalaz.Compose
  • scalaz.Arrow extends scalaz.Split with scalaz.Strong with scalaz.Category
  • scalaz.MonadState extends scalaz.Monad
  • scalaz.MonadError extends scalaz.Monad
  • scalaz.MonadTell extends scalaz.Monad
  • scalaz.MonadReader extends scalaz.Monad
  • scalaz.ComonadStore extends scalaz.Comonad

  Data Structures Index

  • scalaz.Validation Represent computations that may succeed or fail, accumulating multiple errors.
  • scalaz.NonEmptyList A list containing at least one element.
  • scalaz.DList A difference list, supporting efficient append and prepend.
  • scalaz.EphemeralStream A stream that holds weak references to its elements, and recomputes them if needed if reclaimed by the garbage collector.
  • scalaz.Heap A priority queue, implemented with bootstrapped skew binomial heaps.
  • scalaz.Endo Represents functions from A => A.
  • scalaz.FingerTree A tree containing elements at it's leaves, and measures at the nodes. Can be adapted to various purposes by choosing a different measure, for example scalaz.IndSeq and scalaz.OrdSeq.
  • scalaz.Lens Composable, functional alternative to getters and setters
  • scalaz.Tree A multiway tree. Each node contains a single element, and a Stream of sub-trees.
  • scalaz.TreeLoc A cursor over a scalaz.Tree.
  • scalaz.Zipper A functional cursor over a List.
  • scalaz.Kleisli Represents a function A => M[B], allowing chaining. Also known, and aliased, as scalaz.ReaderT.
  • scalaz.StateT Computations that modify state.
  • scalaz.WriterT Computations that log a value
  • scalaz.OptionT Represents computations of type F[Option[A]]
  • scalaz.MaybeT Represents computations of type F[Maybe[A]]
  • scalaz.EitherT Represents computations of type F[A \/ B]

  Definition Classes

  root

•  trait Reducer[C, M] extends AnyRef

  A Reducer[C,M] is a scalaz.Semigroup[M] that maps values of type C through unit to values of type M.

  A Reducer[C,M] is a scalaz.Semigroup[M] that maps values of type C through unit to values of type M. A C-Reducer may also supply operations which tack on another C to an existing Semigroup M on the left or right. These specialized reductions may be more efficient in some scenarios and are used when appropriate by a scalaz.Generator. The names cons and snoc work by analogy to the synonymous operations in the list semigroup.

  Minimal definition: unit or snoc

  Based on the Reducer Haskell library by Edward Kmett (https://hackage.haskell.org/package/reducers).

  Definition Classes

  scalaz

• ReducerLaw

scalaz.Reducer

ReducerLaw