scalaz

package scalaz

Linear Supertypes
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[_]] = Inject[F, G]

  2. type :≺:[F[_], G[_]] = Inject[F, G]

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

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

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

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

  7. type @@[T, Tag] = AnyRef { ... /* 2 definitions in type refinement */ }

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

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

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

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

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

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

  14. type FirstMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  15. type FirstOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  16. type FirstOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  17. type GlorifiedTuple[+A, +B] = \/[A, B]

  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] = AnyRef { ... /* 2 definitions in type refinement */ }

  28. type LastOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  29. type LastOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

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

  31. type MaxMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  32. type MaxOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  33. type MaxOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  34. type MinMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  35. type MinOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

  36. type MinOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  59. type [A, B] = \/[A, B]

  60. type = Any

  61. type = Nothing

  62. type Cojoin[F[_]] = Cobind[F]

    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) Cojoin has been merged into Cobind

Value Members

  1. val IMap: ==>>.type

  2. val IRWS: IndexedReaderWriterState.type

  3. val IRWST: IndexedReaderWriterStateT.type

  4. val RWS: ReaderWriterState.type

  5. val RWST: ReaderWriterStateT.type

  6. implicit val idInstance: Traverse1[scalaz.Id.Id] with Each[scalaz.Id.Id] with Monad[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]

  7. package syntax

Deprecated Value Members

  1. val Cojoin: Cobind.type

    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) Cojoin has been merged into Cobind

Inherited from AnyRef

Inherited from Any

Ungrouped