< 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.Length
- scalaz.Show
- scalaz.Order extends scalaz.Equal
- scalaz.Enum extends scalaz.Order
- scalaz.MetricSpace
- scalaz.Plus
- scalaz.PlusEmpty extends scalaz.Plus
- scalaz.IsEmpty extends scalaz.PlusEmpty
- scalaz.Optional
- scalaz.Each
- scalaz.Index
- scalaz.InvariantFunctor
- scalaz.Functor extends scalaz.InvariantFunctor
- scalaz.Contravariant extends scalaz.InvariantFunctor
- 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.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.Bifunctor
- scalaz.Bifoldable
- scalaz.Bitraverse extends scalaz.Bifunctor with scalaz.Bifoldable
- scalaz.Catchable
- scalaz.Nondeterminism extends scalaz.Monad
- scalaz.Compose
- 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.Profunctor with scalaz.Category
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
abstract class LensInstances extends LensInstances0

Definition Classes
scalaz
ArrayLensFamily
FractionalLensFamily
IntegralLensFamily
MapLensFamily
NumericLensFamily
QueueLensFamily
SeqLikeLensFamily
SetLensFamily
StackLensFamily

c

scalaz.LensInstances

StackLensFamily

case class StackLensFamily[S1, S2, A](lens: LensFamily[S1, S2, Stack[A], Stack[A]]) extends Product with Serializable

Provide an imperative-seeming API for stacks viewed through a lens

Annotations: @deprecated
Deprecated: (Since version 7.1) will be removed, because scala.collection.immutable.Stack is deprecated in Scala
Source: Lens.scala

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

StackLensFamily
Serializable
Serializable
Product
Equals
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new StackLensFamily(lens: LensFamily[S1, S2, Stack[A], Stack[A]])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

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

Definition Classes
Any
def length: State[S1, Int]
val lens: LensFamily[S1, S2, Stack[A], Stack[A]]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pop: IndexedState[S1, S2, Unit]
def pop2: IndexedState[S1, S2, A]
def push(elem1: A, elem2: A, elems: A*): IndexedState[S1, S2, Unit]
def push1(elem: A): IndexedState[S1, S2, Unit]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def top: State[S1, A]
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped