scalaz

package scalaz

Visibility
  1. Public
  2. All

Type Members

  1. type :<:[F[_], G[_]] = Inject[F, G]

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

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

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

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

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

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

    Definition Classes
    package
  8. type Alternative[F[_]] = ApplicativePlus[F]

    Definition Classes
    package
  9. type Cont[R, A] = IndexedContsT[Id, Id, R, R, A]

    Definition Classes
    package
  10. type ContT[M[_], R, A] = IndexedContsT[Id, M, R, R, A]

    Definition Classes
    package
  11. type Conts[W[_], R, A] = IndexedContsT[W, Id, R, R, A]

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

    Definition Classes
    package
  13. type DLeft[+A] = -\/[A]

    Definition Classes
    package
  14. type DRight[+B] = \/-[B]

    Definition Classes
    package
  15. type Disjunction[+A, +B] = \/[A, B]

    Definition Classes
    package
  16. type DisjunctionT[F[_], A, B] = EitherT[F, A, B]

    Definition Classes
    package
  17. type FirstMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  18. type FirstOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  19. type FirstOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  20. type GlorifiedTuple[+A, +B] = \/[A, B]

    Definition Classes
    package
  21. type IMap[A, B] = ==>>[A, B]

    Definition Classes
    package
  22. type IRWS[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[Id, R, W, S1, S2, A]

    Definition Classes
    package
  23. type IRWST[F[_], -R, W, -S1, S2, A] = IndexedReaderWriterStateT[F, R, W, S1, S2, A]

    Definition Classes
    package
  24. type IndexedCont[R, O, A] = IndexedContsT[Id, Id, R, O, A]

    Definition Classes
    package
  25. type IndexedContT[M[_], R, O, A] = IndexedContsT[Id, M, R, O, A]

    Definition Classes
    package
  26. type IndexedConts[W[_], R, O, A] = IndexedContsT[W, Id, R, O, A]

    Definition Classes
    package
  27. type IndexedReaderWriterState[-R, W, -S1, S2, A] = IndexedReaderWriterStateT[Id, R, W, S1, S2, A]

    Definition Classes
    package
  28. type IndexedState[-S1, S2, A] = IndexedStateT[Id, S1, S2, A]

    Definition Classes
    package
  29. type IndexedStore[I, A, B] = IndexedStoreT[Id, I, A, B]

    Definition Classes
    package
  30. type LastMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  31. type LastOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  32. type LastOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  33. type Lens[A, B] = LensFamily[A, A, B, B]

    Definition Classes
    package
  34. type MaxMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  35. type MaxOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  36. type MaxOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  37. type MinMaybe[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  38. type MinOf[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  39. type MinOption[A] = AnyRef { ... /* 2 definitions in type refinement */ }

    Definition Classes
    package
  40. type NonEmptyIList[A] = OneAnd[IList, A]

    Definition Classes
    package
  41. type PIndexedState[-S1, S2, A] = IndexedStateT[Id, S1, S2, Option[A]]

    Definition Classes
    package
  42. type PIndexedStateT[F[_], -S1, S2, A] = IndexedStateT[F, S1, S2, Option[A]]

    Definition Classes
    package
  43. type PLens[A, B] = PLensFamily[A, A, B, B]

    Definition Classes
    package
  44. type PState[S, A] = IndexedStateT[Id, S, S, Option[A]]

    Definition Classes
    package
  45. type PStateT[F[_], S, A] = IndexedStateT[F, S, S, Option[A]]

    Definition Classes
    package
  46. type RWS[-R, W, S, A] = IndexedReaderWriterStateT[Id, R, W, S, S, A]

    Definition Classes
    package
  47. type RWST[F[_], -R, W, S, A] = IndexedReaderWriterStateT[F, R, W, S, S, A]

    Definition Classes
    package
  48. type Reader[E, A] = Kleisli[Id, E, A]

    Definition Classes
    package
  49. type ReaderT[F[_], E, A] = Kleisli[F, E, A]

    Definition Classes
    package
  50. type ReaderWriterState[-R, W, S, A] = IndexedReaderWriterStateT[Id, R, W, S, S, A]

    Definition Classes
    package
  51. type ReaderWriterStateT[F[_], -R, W, S, A] = IndexedReaderWriterStateT[F, R, W, S, S, A]

    Definition Classes
    package
  52. type State[S, A] = IndexedStateT[Id, S, S, A]

    Definition Classes
    package
  53. type StateT[F[_], S, A] = IndexedStateT[F, S, S, A]

    Definition Classes
    package
  54. type Store[A, B] = IndexedStoreT[Id, A, A, B]

    Definition Classes
    package
  55. type StoreT[F[_], A, B] = IndexedStoreT[F, A, A, B]

    Definition Classes
    package
  56. type Unwriter[W, A] = UnwriterT[Id, W, A]

    Definition Classes
    package
  57. type ValidationNel[+E, +X] = Validation[NonEmptyList[E], X]

    Definition Classes
    package
  58. type Writer[W, A] = WriterT[Id, W, A]

    Definition Classes
    package
  59. type |-->[A, B] = IndexedStoreT[Id, B, B, A]

    Definition Classes
    package
  60. type |>=|[G[_], F[_]] = MonadPartialOrder[G, F]

    Definition Classes
    package
  61. type ~>[-F[_], +G[_]] = NaturalTransformation[F, G]

    Definition Classes
    package
  62. type ~~>[-F[_, _], +G[_, _]] = BiNaturalTransformation[F, G]

    Definition Classes
    package
  63. type [A, B] = \/[A, B]

    Definition Classes
    package
  64. type = Any

    Definition Classes
    package
  65. type = Nothing

    Definition Classes
    package
  66. type Cojoin[F[_]] = Cobind[F]

    Definition Classes
    package
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) Cojoin has been merged into Cobind

Value Members

  1. val DLeft: scalaz.-\/.type

    Definition Classes
    package
  2. val DRight: scalaz.\/-.type

    Definition Classes
    package
  3. val Disjunction: scalaz.\/.type

    Definition Classes
    package
  4. val DisjunctionT: scalaz.EitherT.type

    Definition Classes
    package
  5. val IMap: scalaz.==>>.type

    Definition Classes
    package
  6. val IRWS: scalaz.package.IndexedReaderWriterState.type

    Definition Classes
    package
  7. val IRWST: scalaz.IndexedReaderWriterStateT.type

    Definition Classes
    package
  8. val RWS: scalaz.package.ReaderWriterState.type

    Definition Classes
    package
  9. val RWST: scalaz.package.ReaderWriterStateT.type

    Definition Classes
    package
  10. implicit val idInstance: Traverse1[Id] with Each[Id] with Monad[Id] with Comonad[Id] with Distributive[Id] with Zip[Id] with Unzip[Id] with Align[Id] with Cozip[Id]

    Definition Classes
    package
  11. package xml

Deprecated Value Members

  1. val Cojoin: scalaz.Cobind.type

    Definition Classes
    package
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) Cojoin has been merged into Cobind