< 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
BooleanOps
EitherOps
Function1Ops
Function2Ops
LazyListOps
ListOps
MapOps
OptionIdOps
OptionOps
SortedMapOps
StreamOps
StringOps
ToAllStdOps
ToBooleanOps
ToEitherOps
ToFunction1Ops
ToFunction2Ops
ToLazyListOps
ToListOps
ToMapOps
ToOptionIdOps
ToOptionOps
ToSortedMapOps
ToStreamOps
ToStringOps
ToTryOps
ToTupleOps
ToVectorOps
TryOps
Tuple10Ops
Tuple11Ops
Tuple12Ops
Tuple2Ops
Tuple3Ops
Tuple4Ops
Tuple5Ops
Tuple6Ops
Tuple7Ops
Tuple8Ops
Tuple9Ops
VectorOps
all
boolean
either
function1
function2
list
map
option
sortedMap
stream
string
try
tuple
vector

c

scalaz.syntax.std

Tuple7Ops

final class Tuple7Ops[A, B, C, D, E, F, G] extends AnyVal

Source: TupleOps.scala

Linear Supertypes

Ordering

Alphabetic
By Inheritance

Inherited

Tuple7Ops
AnyVal
Any

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new Tuple7Ops(value: (A, B, C, D, E, F, G))

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 fold[Z](f: => (A, B, C, D, E, F, G) => Z): Z
def getClass(): Class[_ <: AnyVal]
Definition Classes
AnyVal → Any
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def mapElements[AA, BB, CC, DD, EE, FF, GG](_1: (A) => AA = identity[A], _2: (B) => BB = identity[B], _3: (C) => CC = identity[C], _4: (D) => DD = identity[D], _5: (E) => EE = identity[E], _6: (F) => FF = identity[F], _7: (G) => GG = identity[G]): (AA, BB, CC, DD, EE, FF, GG)
def toIndexedSeq[Z](implicit ev: <:<[value.type, (Z, Z, Z, Z, Z, Z, Z)]): IndexedSeq[Z]
def toString(): String
Definition Classes
Any
val value: (A, B, C, D, E, F, G)

Inherited from AnyVal

Inherited from Any

Ungrouped