scalaz
package
scalaz
Type Members
-
type
:<:[F[_], G[_]] = Inject[F, G]
-
type
:≺:[F[_], G[_]] = Inject[F, G]
-
-
type
===[A, B] = Leibniz[⊥, ⊤, A, B]
-
-
type
@>[A, B] = LensFamily[A, A, B, B]
-
type
@?>[A, B] = PLensFamily[A, A, B, B]
-
type
@@[T, Tag] = scalaz.TagKind.@@[T, Tag]
-
type
Cont[R, A] = IndexedContsT[scalaz.Id.Id, R, R, scalaz.Id.Id, A]
-
type
ContT[R, M[_], A] = IndexedContsT[scalaz.Id.Id, R, R, M, A]
-
type
Conts[W[_], R, A] = IndexedContsT[W, R, R, scalaz.Id.Id, A]
-
type
ContsT[W[_], R, M[_], A] = IndexedContsT[W, R, R, M, A]
-
type
DLeft[A, B] = -\/[A, B]
-
type
DRight[A, B] = \/-[A, B]
-
type
Disjunction[A, B] = \/[A, B]
-
type
DisjunctionT[A, F[_], B] = EitherT[A, F, B]
-
type
FirstMaybe[A] = scalaz.TagKind.@@[Maybe[A], First]
-
type
FirstOf[A] = scalaz.TagKind.@@[A, FirstVal]
-
type
FirstOption[A] = scalaz.TagKind.@@[Option[A], First]
-
type
IMap[A, B] = ==>>[A, B]
-
type
IRWS[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[R, W, S1, S2, scalaz.Id.Id, A]
-
type
IRWST[-R, W, -S1, S2, F[_], A] = IndexedReaderWriterStateT[R, W, S1, S2, F, A]
-
type
IndexedCont[R, O, A] = IndexedContsT[scalaz.Id.Id, R, O, scalaz.Id.Id, A]
-
type
IndexedContT[R, O, M[_], A] = IndexedContsT[scalaz.Id.Id, R, O, M, A]
-
type
IndexedConts[W[_], R, O, A] = IndexedContsT[W, R, O, scalaz.Id.Id, A]
-
type
IndexedReaderWriterState[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[R, W, S1, S2, scalaz.Id.Id, A]
-
type
IndexedState[-S1, S2, A] = IndexedStateT[S1, S2, scalaz.Id.Id, A]
-
type
IndexedStore[I, A, B] = IndexedStoreT[scalaz.Id.Id, I, A, B]
-
type
LastMaybe[A] = scalaz.TagKind.@@[Maybe[A], Last]
-
type
LastOf[A] = scalaz.TagKind.@@[A, LastVal]
-
type
LastOption[A] = scalaz.TagKind.@@[Option[A], Last]
-
type
Lens[A, B] = LensFamily[A, A, B, B]
-
type
MaxMaybe[A] = scalaz.TagKind.@@[Maybe[A], Max]
-
type
MaxOf[A] = scalaz.TagKind.@@[A, MaxVal]
-
type
MaxOption[A] = scalaz.TagKind.@@[Option[A], Max]
-
type
MinMaybe[A] = scalaz.TagKind.@@[Maybe[A], Min]
-
type
MinOf[A] = scalaz.TagKind.@@[A, MinVal]
-
type
MinOption[A] = scalaz.TagKind.@@[Option[A], Min]
-
type
PIndexedState[-S1, S2, A] = IndexedStateT[S1, S2, scalaz.Id.Id, Option[A]]
-
type
PIndexedStateT[F[_], -S1, S2, A] = IndexedStateT[S1, S2, F, Option[A]]
-
type
PLens[A, B] = PLensFamily[A, A, B, B]
-
type
PState[S, A] = IndexedStateT[S, S, scalaz.Id.Id, Option[A]]
-
type
PStateT[F[_], S, A] = IndexedStateT[S, S, F, Option[A]]
-
type
Pair[A] = (A, A)
-
type
RWS[-R, W, S, A] = IndexedReaderWriterStateT[R, W, S, S, scalaz.Id.Id, A]
-
type
RWST[-R, W, S, F[_], A] = IndexedReaderWriterStateT[R, W, S, S, F, A]
-
type
Reader[E, A] = Kleisli[scalaz.Id.Id, E, A]
-
type
ReaderT[E, F[_], A] = Kleisli[F, E, A]
-
type
ReaderWriterState[-R, W, S, A] = IndexedReaderWriterStateT[R, W, S, S, scalaz.Id.Id, A]
-
type
ReaderWriterStateT[-R, W, S, F[_], A] = IndexedReaderWriterStateT[R, W, S, S, F, A]
-
type
State[S, A] = IndexedStateT[S, S, scalaz.Id.Id, A]
-
type
StateT[S, F[_], A] = IndexedStateT[S, S, F, A]
-
type
Store[A, B] = IndexedStoreT[scalaz.Id.Id, A, A, B]
-
type
StoreT[F[_], A, B] = IndexedStoreT[F, A, A, B]
-
type
Traced[A, B] = TracedT[scalaz.Id.Id, A, B]
-
type
Unwriter[W, A] = UnwriterT[scalaz.Id.Id, W, A]
-
type
ValidationNel[E, X] = Validation[NonEmptyList[E], X]
-
type
Writer[W, A] = WriterT[W, scalaz.Id.Id, A]
-
type
|-->[A, B] = IndexedStoreT[scalaz.Id.Id, B, B, A]
-
-
type
~~>[-F[_, _], +G[_, _]] = BiNaturalTransformation[F, G]
-
type
∨[A, B] = \/[A, B]
-
type
⊤ = Any
-
Value Members
-
val
DLeft: -\/.type
-
val
DRight: \/-.type
-
val
Disjunction: \/.type
-
val
DisjunctionT: EitherT.type
-
val
IMap: ==>>.type
-
val
IRWS: IndexedReaderWriterState.type
-
-
val
RWS: ReaderWriterState.type
-
val
RWST: ReaderWriterStateT.type
-
def
Traced[A, B](f: (A) ⇒ B): Traced[A, B]
-
-
implicit
val
idInstance: Traverse1[scalaz.Id.Id] with Monad[scalaz.Id.Id] with BindRec[scalaz.Id.Id] with Comonad[scalaz.Id.Id] with Distributive[scalaz.Id.Id] with Zip[scalaz.Id.Id] with Unzip[scalaz.Id.Id] with Align[scalaz.Id.Id] with Cozip[scalaz.Id.Id] with Optional[scalaz.Id.Id]
-
package
std
-