scalaz

Type Members

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

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

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

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

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

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

7. trait Enumerator[F[_]] extends AnyRef

   An Enumerator[F] feeds data from an F to an iteratee

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

9. sealed trait Input[E] extends AnyRef

   The input to an iteratee.

10. sealed trait IterV[E, A] extends AnyRef

    A pure iteratee computation which is either done or needs more input

11. sealed trait IterVM[M[+_], E, A] extends AnyRef

    Monadic Iteratees

12. case class Iteratee[M[+_], E, A](value: M[IterVM[M, E, A]]) extends Product with Serializable

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

14. type Lens[A, B] = LensT[scalaz.Id.Id, A, B]

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

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

17. type PLens[A, B] = PLensT[scalaz.Id.Id, A, B]

18. type PState[A, B] = StateT[scalaz.Id.Id, A, Option[B]]

19. type PStateT[F[+_], A, B] = StateT[F, A, Option[B]]

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

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

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

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

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

25. type State[S, +A] = StateT[scalaz.Id.Id, S, A]

26. type Store[A, B] = StoreT[scalaz.Id.Id, A, B]

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

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

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

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

31. type |-->[A, B] = StoreT[scalaz.Id.Id, B, A]

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

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

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

35. type ⊤ = Any

36. type ⊥ = Nothing