p
scalaz
package scalaz
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- scalaz
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- type :<:[F[_], G[_]] = Inject[F, G]
- type :≺:[F[_], G[_]] = Inject[F, G]
- type <~[+F[_], -G[_]] = NaturalTransformation[G, F]
- type =?>[E, A] = Kleisli[Option, E, A]
- type @>[A, B] = LensFamily[A, A, B, B]
- type @?>[A, B] = PLensFamily[A, A, B, B]
- type @@[T, Tag] = AnyRef { ... /* 2 definitions in type refinement */ }
- type Alternative[F[_]] = ApplicativePlus[F]
- type Cont[R, A] = IndexedContsT[scalaz.Id.Id, scalaz.Id.Id, R, R, A]
- type ContT[M[_], R, A] = IndexedContsT[scalaz.Id.Id, M, R, R, A]
- type Conts[W[_], R, A] = IndexedContsT[W, scalaz.Id.Id, R, R, A]
- type ContsT[W[_], M[_], R, A] = IndexedContsT[W, M, R, R, A]
- type DLeft[+A] = -\/[A]
- type DRight[+B] = \/-[B]
- type Disjunction[+A, +B] = \/[A, B]
- type DisjunctionT[F[_], A, B] = EitherT[F, A, B]
- type FirstMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type FirstOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type FirstOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type GlorifiedTuple[+A, +B] = \/[A, B]
- type IMap[A, B] = ==>>[A, B]
- type IRWS[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S1, S2, A]
- type IRWST[F[_], -R, W, -S1, S2, A] = IndexedReaderWriterStateT[F, R, W, S1, S2, A]
- type IndexedCont[R, O, A] = IndexedContsT[scalaz.Id.Id, scalaz.Id.Id, R, O, A]
- type IndexedContT[M[_], R, O, A] = IndexedContsT[scalaz.Id.Id, M, R, O, A]
- type IndexedConts[W[_], R, O, A] = IndexedContsT[W, scalaz.Id.Id, R, O, A]
- type IndexedReaderWriterState[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S1, S2, A]
- type IndexedState[-S1, S2, A] = IndexedStateT[scalaz.Id.Id, S1, S2, A]
- type IndexedStore[I, A, B] = IndexedStoreT[scalaz.Id.Id, I, A, B]
- type LastMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type LastOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type LastOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type Lens[A, B] = LensFamily[A, A, B, B]
- type MaxMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type MaxOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type MaxOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type MinMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type MinOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type MinOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }
- type NonEmptyIList[A] = OneAnd[IList, A]
- type PIndexedState[-S1, S2, A] = IndexedStateT[scalaz.Id.Id, S1, S2, Option[A]]
- type PIndexedStateT[F[_], -S1, S2, A] = IndexedStateT[F, S1, S2, Option[A]]
- type PLens[A, B] = PLensFamily[A, A, B, B]
- type PState[S, A] = IndexedStateT[scalaz.Id.Id, S, S, Option[A]]
- type PStateT[F[_], S, A] = IndexedStateT[F, S, S, Option[A]]
- type RWS[-R, W, S, A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S, S, A]
- type RWST[F[_], -R, W, S, A] = IndexedReaderWriterStateT[F, R, W, S, S, A]
- type Reader[E, A] = Kleisli[scalaz.Id.Id, E, A]
- type ReaderT[F[_], E, A] = Kleisli[F, E, A]
- type ReaderWriterState[-R, W, S, A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S, S, A]
- type ReaderWriterStateT[F[_], -R, W, S, A] = IndexedReaderWriterStateT[F, R, W, S, S, A]
- type State[S, A] = IndexedStateT[scalaz.Id.Id, S, S, A]
- type StateT[F[_], S, A] = IndexedStateT[F, S, S, 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[scalaz.Id.Id, W, A]
- type |-->[A, B] = IndexedStoreT[scalaz.Id.Id, B, B, A]
- type |>=|[G[_], F[_]] = MonadPartialOrder[G, F]
- type ~>[-F[_], +G[_]] = NaturalTransformation[F, G]
- type ~~>[-F[_, _], +G[_, _]] = BiNaturalTransformation[F, G]
- type ∨[A, B] = \/[A, B]
- type ⊤ = Any
- type ⊥ = Nothing
Value Members
- val DLeft: -\/.type
- val DRight: \/-.type
- val Disjunction: \/.type
- val DisjunctionT: EitherT.type
- val IMap: ==>>.type
- val IRWS: IndexedReaderWriterState.type
- val IRWST: IndexedReaderWriterStateT.type
- val RWS: ReaderWriterState.type
- val RWST: ReaderWriterStateT.type
- val ReaderT: Kleisli.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]