scalaz

Type Members

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

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

3. type @>[A, B] = LensFamily[A, A, B, B]

4. type @?>[A, B] = PLensFamily[A, A, B, B]

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

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

7. type Cont[R, +A] = IndexedContsT[scalaz.Id.Id, scalaz.Id.Id, R, R, A]

8. type ContT[M[+_], R, +A] = IndexedContsT[scalaz.Id.Id, M, R, R, A]

9. type Conts[W[+_], R, +A] = IndexedContsT[W, scalaz.Id.Id, R, R, A]

10. type ContsT[W[+_], M[+_], R, +A] = IndexedContsT[W, M, R, R, A]

11. type DLeft[+A] = -\/[A]

12. type DRight[+B] = \/-[B]

13. type Disjunction[+A, +B] = \/[A, B]

14. type DisjunctionT[F[+_], A, B] = EitherT[F, A, B]

15. type FirstMaybe[A] = Maybe[A] with Tagged[First]

16. type FirstOf[A] = A with Tagged[FirstVal]

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

18. type IMap[A, B] = ==>>[A, B]

19. type IRWS[-R, +W, -S1, +S2, +A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S1, S2, A]

20. type IRWST[F[+_], -R, +W, -S1, +S2, +A] = IndexedReaderWriterStateT[F, R, W, S1, S2, A]

21. type IndexedCont[+R, -O, +A] = IndexedContsT[scalaz.Id.Id, scalaz.Id.Id, R, O, A]

22. type IndexedContT[M[+_], +R, -O, +A] = IndexedContsT[scalaz.Id.Id, M, R, O, A]

23. type IndexedConts[W[+_], +R, -O, +A] = IndexedContsT[W, scalaz.Id.Id, R, O, A]

24. type IndexedReaderWriterState[-R, +W, -S1, +S2, +A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S1, S2, A]

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

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

27. type LastMaybe[A] = Maybe[A] with Tagged[Last]

28. type LastOf[A] = A with Tagged[LastVal]

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

30. type Lens[A, B] = LensFamily[A, A, B, B]

31. type MaxMaybe[A] = Maybe[A] with Tagged[Max]

32. type MaxOf[A] = A with Tagged[MaxVal]

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

34. type MinMaybe[A] = Maybe[A] with Tagged[Min]

35. type MinOf[A] = A with Tagged[MinVal]

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

37. type NonEmptyIList[A] = OneAnd[IList, A]

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

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

40. type PLens[A, B] = PLensFamily[A, A, B, B]

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

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

43. type RWS[-R, +W, S, +A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S, S, A]

44. type RWST[F[+_], -R, +W, S, +A] = IndexedReaderWriterStateT[F, R, W, S, S, A]

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

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

47. type ReaderWriterState[-R, +W, S, +A] = IndexedReaderWriterStateT[scalaz.Id.Id, R, W, S, S, A]

48. type ReaderWriterStateT[F[+_], -R, +W, S, +A] = IndexedReaderWriterStateT[F, R, W, S, S, A]

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

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

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

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

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

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

55. type ValidationNel[+E, +X] = Validation[NonEmptyList[E], X]

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

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

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

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

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

61. type ⊤ = Any

62. type ⊥ = Nothing