scalaz

package scalaz

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. scalaz
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type <~[+F[_], -G[_]] = NaturalTransformation[G, F]

  2. type =?>[E, A] = Kleisli[Option, E, A]

  3. type @>[A, B] = LensFamilyT[scalaz.Id.Id, A, A, B, B]

  4. type @?>[A, B] = PLensFamilyT[scalaz.Id.Id, A, A, B, B]

  5. type @@[T, Tag] = T with Tagged[Tag]

  6. type Alternative[F[_]] = ApplicativePlus[F]

  7. type FirstOption[A] = Option[A] with Tagged[First]

  8. type IndexedState[-S1, +S2, +A] = IndexedStateT[scalaz.Id.Id, S1, S2, A]

  9. type IndexedStore[+I, -A, +B] = IndexedStoreT[scalaz.Id.Id, I, A, B]

  10. type LastOption[A] = Option[A] with Tagged[Last]

  11. type Lens[A, B] = LensFamilyT[scalaz.Id.Id, A, A, B, B]

  12. type LensFamily[-A1, +A2, +B1, -B2] = LensFamilyT[scalaz.Id.Id, A1, A2, B1, B2]

  13. type LensT[F[+_], A, B] = LensFamilyT[F, A, A, B, B]

  14. type MaxOption[A] = Option[A] with Tagged[Max]

  15. type MinOption[A] = Option[A] with Tagged[Min]

  16. type PIndexedState[-S1, +S2, +A] = IndexedStateT[scalaz.Id.Id, S1, S2, Option[A]]

  17. type PIndexedStateT[F[+_], -S1, +S2, +A] = IndexedStateT[F, S1, S2, Option[A]]

  18. type PLens[A, B] = PLensFamilyT[scalaz.Id.Id, A, A, B, B]

  19. type PLensFamily[-A1, +A2, +B1, -B2] = PLensFamilyT[scalaz.Id.Id, A1, A2, B1, B2]

  20. type PLensT[F[+_], A, B] = PLensFamilyT[F, A, A, B, B]

  21. type PState[S, +A] = IndexedStateT[scalaz.Id.Id, S, S, Option[A]]

  22. type PStateT[F[+_], S, +A] = IndexedStateT[F, S, S, Option[A]]

  23. type RWS[-R, +W, S, +A] = ReaderWriterStateT[scalaz.Id.Identity, R, W, S, A]

  24. type RWST[F[+_], -R, +W, S, +A] = ReaderWriterStateT[F, R, W, S, A]

  25. type Reader[E, +A] = Kleisli[scalaz.Id.Id, E, A]

  26. type ReaderT[F[+_], E, +A] = Kleisli[F, E, A]

  27. type ReaderWriterState[-R, +W, S, +A] = ReaderWriterStateT[scalaz.Id.Identity, R, W, S, A]

  28. type State[S, +A] = IndexedStateT[scalaz.Id.Id, S, S, A]

  29. type StateT[F[+_], S, +A] = IndexedStateT[F, S, S, A]

  30. type Store[A, +B] = IndexedStoreT[scalaz.Id.Id, A, A, B]

  31. type StoreT[F[+_], A, +B] = IndexedStoreT[F, A, A, B]

  32. type Tagged[T] = AnyRef { type Tag = T }

  33. type Unwriter[+W, +A] = UnwriterT[scalaz.Id.Id, W, A]

  34. type ValidationNEL[+E, +X] = Validation[NonEmptyList[E], X]

  35. type Writer[+W, +A] = WriterT[scalaz.Id.Id, W, A]

  36. type |-->[+A, B] = IndexedStoreT[scalaz.Id.Id, B, B, A]

  37. type |>=|[G[_], F[_]] = MonadPartialOrder[G, F]

  38. type ~>[-F[_], +G[_]] = NaturalTransformation[F, G]

  39. type ~~>[-F[_, _], +G[_, _]] = BiNaturalTransformation[F, G]

  40. type = Any

  41. type = Nothing

Value Members

  1. val RWST: ReaderWriterStateT.type

  2. implicit val idInstance: Traverse[scalaz.Id.Id] with Each[scalaz.Id.Id] with Monad[scalaz.Id.Id] with Comonad[scalaz.Id.Id] with Cojoin[scalaz.Id.Id] with Distributive[scalaz.Id.Id] with Zip[scalaz.Id.Id] with Unzip[scalaz.Id.Id] with Cozip[scalaz.Id.Id]

  3. package iteratee

  4. package syntax

Inherited from AnyRef

Inherited from Any

Ungrouped