< Back

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.Catchable
- 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
package syntax
Implicits to provide a convenient syntax to work with type classes and functions.
Implicits to provide a convenient syntax to work with type classes and functions.
Non-trivial code should *not* be defined in this package; instead delegate.

Definition Classes
scalaz
package std

Definition Classes
syntax
AlignOps
AlignSyntax
AltOps
AltSyntax
ApplicativeBuilder
ApplicativeErrorOps
ApplicativeErrorSyntax
ApplicativeOps
ApplicativePlusOps
ApplicativePlusSyntax
ApplicativeSyntax
ApplyOps
ApplySyntax
ArrowOps
ArrowSyntax
AssociativeOps
AssociativeSyntax
BandOps
BandSyntax
BifoldableOps
BifoldableSyntax
BifunctorOps
BifunctorSyntax
BindOps
BindRecOps
BindRecSyntax
BindSyntax
BitraverseOps
BitraverseSyntax
CatchableOps
CatchableSyntax
CategoryOps
CategorySyntax
ChoiceOps
ChoiceSyntax
CobindOps
CobindSyntax
ComonadOps
ComonadSyntax
ComposeOps
ComposeSyntax
ConstOps
ContTOps
ContravariantOps
ContravariantSyntax
CozipOps
CozipSyntax
DecidableOps
DecidableSyntax
DistributiveOps
DistributiveSyntax
DivideOps
DivideSyntax
DivisibleOps
DivisibleSyntax
EitherOps
EitherTOps
EnumOps
EnumSyntax
EqualOps
EqualSyntax
Foldable1Ops
Foldable1Syntax
FoldableOps
FoldableSyntax
FunctorOps
FunctorSyntax
IdOps
InvariantAltOps
InvariantAltSyntax
InvariantApplicativeOps
InvariantApplicativeSyntax
InvariantFunctorOps
InvariantFunctorSyntax
IsContravariantOps
IsContravariantSyntax
IsCovariantOps
IsCovariantSyntax
IsEmptyOps
IsEmptySyntax
KleisliFAOps
KleisliIdOps
MaybeOps
MonadErrorIdOps
MonadErrorOps
MonadErrorSyntax
MonadListenOps
MonadListenSyntax
MonadOps
MonadPlusOps
MonadPlusSyntax
MonadSyntax
MonadTellOps
MonadTellSyntax
MonadTransGFGA
MonoidOps
MonoidSyntax
NelOps
NondeterminismOps
NondeterminismSyntax
Ops
OptionalOps
OptionalSyntax
OrderOps
OrderSyntax
PlusEmptyOps
PlusEmptySyntax
PlusOps
PlusSyntax
ProChoiceOps
ProChoiceSyntax
ProfunctorOps
ProfunctorSyntax
ReducerOps
SemiLatticeOps
SemiLatticeSyntax
SemigroupOps
SemigroupSyntax
ShowOps
ShowSyntax
SplitOps
SplitSyntax
StateOps
StrictTreeOps
StrongOps
StrongSyntax
Syntaxes
TagOps
TheseOps
ThesePairOps
ToAlignOps
ToAlignOps0
ToAlignOpsU
ToAltOps
ToAltOps0
ToAltOpsU
ToApplicativeErrorOps
ToApplicativeErrorOps0
ToApplicativeOps
ToApplicativeOps0
ToApplicativeOpsU
ToApplicativePlusOps
ToApplicativePlusOps0
ToApplicativePlusOpsU
ToApplyOps
ToApplyOps0
ToApplyOpsU
ToArrowOps
ToArrowOps0
ToArrowOpsU
ToAssociativeOps
ToAssociativeOps0
ToAssociativeOpsU
ToBandOps
ToBifoldableOps
ToBifoldableOps0
ToBifoldableOpsU
ToBifunctorOps
ToBifunctorOps0
ToBifunctorOpsU
ToBindOps
ToBindOps0
ToBindOpsU
ToBindRecOps
ToBindRecOps0
ToBindRecOpsU
ToBitraverseOps
ToBitraverseOps0
ToBitraverseOpsU
ToCatchableOps
ToCatchableOps0
ToCatchableOpsU
ToCategoryOps
ToCategoryOps0
ToCategoryOpsU
ToChoiceOps
ToChoiceOps0
ToChoiceOpsU
ToCobindOps
ToCobindOps0
ToCobindOpsU
ToComonadOps
ToComonadOps0
ToComonadOpsU
ToComposeOps
ToComposeOps0
ToComposeOpsU
ToConstOps
ToContTOps
ToContravariantOps
ToContravariantOps0
ToContravariantOpsU
ToCozipOps
ToCozipOps0
ToCozipOpsU
ToDataOps
ToDecidableOps
ToDecidableOps0
ToDecidableOpsU
ToDistributiveOps
ToDistributiveOps0
ToDistributiveOpsU
ToDivideOps
ToDivideOps0
ToDivideOpsU
ToDivisibleOps
ToDivisibleOps0
ToDivisibleOpsU
ToEitherOps
ToEitherTOps
ToEnumOps
ToEqualOps
ToFoldable1Ops
ToFoldable1Ops0
ToFoldable1OpsU
ToFoldableOps
ToFoldableOps0
ToFoldableOpsU
ToFunctorOps
ToFunctorOps0
ToFunctorOpsU
ToIdOps
ToInvariantAltOps
ToInvariantAltOps0
ToInvariantAltOpsU
ToInvariantApplicativeOps
ToInvariantApplicativeOps0
ToInvariantApplicativeOpsU
ToInvariantFunctorOps
ToInvariantFunctorOps0
ToInvariantFunctorOpsU
ToIsContravariantOps
ToIsContravariantOps0
ToIsContravariantOpsU
ToIsCovariantOps
ToIsCovariantOps0
ToIsCovariantOpsU
ToIsEmptyOps
ToIsEmptyOps0
ToIsEmptyOpsU
ToKleisliOps
ToKleisliOps0
ToMaybeOps
ToMonadErrorOps
ToMonadErrorOps0
ToMonadListenOps
ToMonadListenOps0
ToMonadOps
ToMonadOps0
ToMonadOpsU
ToMonadPlusOps
ToMonadPlusOps0
ToMonadPlusOpsU
ToMonadTellOps
ToMonadTellOps0
ToMonadTransOps
ToMonoidOps
ToNelOps
ToNondeterminismOps
ToNondeterminismOps0
ToNondeterminismOpsU
ToOptionalOps
ToOptionalOps0
ToOptionalOpsU
ToOrderOps
ToPlusEmptyOps
ToPlusEmptyOps0
ToPlusEmptyOpsU
ToPlusOps
ToPlusOps0
ToPlusOpsU
ToProChoiceOps
ToProChoiceOps0
ToProChoiceOpsU
ToProfunctorOps
ToProfunctorOps0
ToProfunctorOpsU
ToReducerOps
ToSemiLatticeOps
ToSemigroupOps
ToShowOps
ToSplitOps
ToSplitOps0
ToSplitOpsU
ToStateOps
ToStrictTreeOps
ToStrongOps
ToStrongOps0
ToStrongOpsU
ToTagOps
ToTheseOps
ToTraverse1Ops
ToTraverse1Ops0
ToTraverse1OpsU
ToTraverseOps
ToTraverseOps0
ToTraverseOpsU
ToTreeOps
ToTypeClassOps
ToUnzipOps
ToUnzipOps0
ToUnzipOpsU
ToValidationOps
ToWriterOps
ToZipOps
ToZipOps0
ToZipOpsU
Traverse1Ops
Traverse1Syntax
TraverseOps
TraverseSyntax
TreeOps
UnzipOps
UnzipSyntax
ValidationOps
WriterOps
ZipOps
ZipSyntax
align
align0
all
alt
alt0
applicative
applicative0
applicativeError
applicativeError0
applicativePlus
applicativePlus0
apply
apply0
arrow
arrow0
associative
associative0
band
bifoldable
bifoldable0
bifunctor
bifunctor0
bind
bind0
bitraverse
bitraverse0
catchable
catchable0
category
category0
choice
choice0
cobind
cobind0
comonad
comonad0
compose
compose0
const
contT
contravariant
contravariant0
cozip
cozip0
either
eithert
enum
equal
foldable
foldable0
foldable1
foldable10
functor
functor0
id
invariantFunctor
invariantFunctor0
isEmpty
isEmpty0
kleisli
maybe
monad
monad0
monadError
monadError0
monadListen
monadListen0
monadPlus
monadPlus0
monadTell
monadTell0
monadTrans
monoid
nel
optional
optional0
order
plus
plus0
plusEmpty
plusEmpty0
proChoice
proChoice0
profunctor
profunctor0
reducer
semigroup
show
split
split0
state
strictTree
strong
strong0
tag
these
traverse
traverse0
traverse1
traverse10
tree
unzip
unzip0
validation
writer
zip
zip0

c

scalaz.syntax

TreeOps

final class TreeOps[A] extends AnyVal

Source: TreeOps.scala

Linear Supertypes

AnyVal, Any

Ordering

Alphabetic
By Inheritance

Inherited

TreeOps
AnyVal
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new TreeOps(self: A)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
Any
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def getClass(): Class[_ <: AnyVal]

Definition Classes
AnyVal → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def leaf: Tree[A]
def node(subForest: Tree[A]*): Tree[A]
def toString(): String

Definition Classes
Any

Packages

TreeOps

final class TreeOps[A] extends AnyVal

Instance Constructors

Value Members

Inherited from AnyVal

Inherited from Any

Ungrouped

Packages

TreeOps 

final class TreeOps[A] extends AnyVal

Instance Constructors

Value Members

Inherited from AnyVal

Inherited from Any

Ungrouped

TreeOps