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 ===[A, B] = Leibniz[⊥, ⊤, A, B]
5.  type =?>[E, A] = Kleisli[Option, E, A]
6.  type @>[A, B] = LensFamily[A, A, B, B]
7.  type @?>[A, B] = PLensFamily[A, A, B, B]
8.  type @@[T, Tag] = scalaz.TagKind.@@[T, Tag]
9.  type Cont[R, A] = IndexedContsT[scalaz.Id.Id, R, R, scalaz.Id.Id, A]
10.  type ContT[R, M[_], A] = IndexedContsT[scalaz.Id.Id, R, R, M, A]
11.  type Conts[W[_], R, A] = IndexedContsT[W, R, R, scalaz.Id.Id, A]
12.  type ContsT[W[_], R, M[_], A] = IndexedContsT[W, R, R, M, A]
13.  type DLeft[A, B] = -\/[A, B]
14.  type DRight[A, B] = \/-[A, B]
15.  type Disjunction[A, B] = \/[A, B]
16.  type DisjunctionT[A, F[_], B] = EitherT[A, F, B]
17.  type FirstMaybe[A] = scalaz.TagKind.@@[Maybe[A], First]
18.  type FirstOf[A] = scalaz.TagKind.@@[A, FirstVal]
19.  type FirstOption[A] = scalaz.TagKind.@@[Option[A], First]
20.  type IMap[A, B] = ==>>[A, B]
21.  type IRWS[R, W, S1, S2, A] = IndexedReaderWriterStateT[R, W, S1, S2, scalaz.Id.Id, A]
22.  type IRWST[R, W, S1, S2, F[_], A] = IndexedReaderWriterStateT[R, W, S1, S2, F, A]
23.  type IndexedCont[R, O, A] = IndexedContsT[scalaz.Id.Id, R, O, scalaz.Id.Id, A]
24.  type IndexedContT[R, O, M[_], A] = IndexedContsT[scalaz.Id.Id, R, O, M, A]
25.  type IndexedConts[W[_], R, O, A] = IndexedContsT[W, R, O, scalaz.Id.Id, A]
26.  type IndexedReaderWriterState[R, W, S1, S2, A] = IndexedReaderWriterStateT[R, W, S1, S2, scalaz.Id.Id, A]
27.  type IndexedState[S1, S2, A] = IndexedStateT[S1, S2, scalaz.Id.Id, A]
28.  type IndexedStore[I, A, B] = IndexedStoreT[scalaz.Id.Id, I, A, B]
29.  type LastMaybe[A] = scalaz.TagKind.@@[Maybe[A], Last]
30.  type LastOf[A] = scalaz.TagKind.@@[A, LastVal]
31.  type LastOption[A] = scalaz.TagKind.@@[Option[A], Last]
32.  type Lens[A, B] = LensFamily[A, A, B, B]
33.  type MaxMaybe[A] = scalaz.TagKind.@@[Maybe[A], Max]
34.  type MaxOf[A] = scalaz.TagKind.@@[A, MaxVal]
35.  type MaxOption[A] = scalaz.TagKind.@@[Option[A], Max]
36.  type MinMaybe[A] = scalaz.TagKind.@@[Maybe[A], Min]
37.  type MinOf[A] = scalaz.TagKind.@@[A, MinVal]
38.  type MinOption[A] = scalaz.TagKind.@@[Option[A], Min]
39.  type PIndexedState[S1, S2, A] = IndexedStateT[S1, S2, scalaz.Id.Id, Option[A]]
40.  type PIndexedStateT[F[_], S1, S2, A] = IndexedStateT[S1, S2, F, Option[A]]
41.  type PLens[A, B] = PLensFamily[A, A, B, B]
42.  type PState[S, A] = IndexedStateT[S, S, scalaz.Id.Id, Option[A]]
43.  type PStateT[F[_], S, A] = IndexedStateT[S, S, F, Option[A]]
44.  type Pair[A] = (A, A)
45.  type RWS[R, W, S, A] = IndexedReaderWriterStateT[R, W, S, S, scalaz.Id.Id, A]
46.  type RWST[R, W, S, F[_], A] = IndexedReaderWriterStateT[R, W, S, S, F, A]
47.  type Reader[E, A] = Kleisli[scalaz.Id.Id, E, A]
48.  type ReaderT[E, F[_], A] = Kleisli[F, E, A]
49.  type ReaderWriterState[R, W, S, A] = IndexedReaderWriterStateT[R, W, S, S, scalaz.Id.Id, A]
50.  type ReaderWriterStateT[R, W, S, F[_], A] = IndexedReaderWriterStateT[R, W, S, S, F, A]
51.  type Select[R, A] = SelectT[R, scalaz.Id.Id, A]
52.  type State[S, A] = IndexedStateT[S, S, scalaz.Id.Id, A]
53.  type StateT[S, F[_], A] = IndexedStateT[S, S, F, A]
54.  type Store[A, B] = IndexedStoreT[scalaz.Id.Id, A, A, B]
55.  type StoreT[F[_], A, B] = IndexedStoreT[F, A, A, B]
56.  type Traced[A, B] = TracedT[scalaz.Id.Id, A, B]
57.  type Unwriter[W, A] = UnwriterT[scalaz.Id.Id, W, A]
58.  type ValidationNel[E, X] = Validation[NonEmptyList[E], X]
59.  type Writer[W, A] = WriterT[W, scalaz.Id.Id, A]
60.  type |-->[A, B] = IndexedStoreT[scalaz.Id.Id, B, B, A]
61.  type ~>[F[_], G[_]] = NaturalTransformation[F, G]
62.  type ~~>[F[_, _], G[_, _]] = BiNaturalTransformation[F, G]
63.  type ∨[A, B] = \/[A, B]
64.  type ⊤ = Any
65.  type ⊥ = Nothing