Type Members

1.  trait Aggregator[B, A] extends (B, A) => B

   Represents the kind of function that one passes to foldLeft, as a typeclass.

2.  abstract class AggregatorK[B, F[_]] extends AnyRef
3.  trait Catenable[F[_]] extends PlusEmpty[F]
4.  trait Choose[L <: HList, C <: HList] extends (L) => C
5.  trait ChooseByNats[L <: HList, C <: HList, NS <: HList] extends (NS) => Choose[L, C]
6.  trait ChooseByPtrs[L <: HList, C <: HList, Ptrs <: HList] extends (Ptrs) => Choose[L, C]
7.  type ContU[M[_], A] = IndexedContsT[scalaz.Id.Id, Unit, Unit, M, A]

   Continuation monad with result type M[Unit].

8.  trait DeepEqual[A1, A2, Ptr1[_], Ptr2[_]] extends AnyRef

   Comparing of (potentially cyclic) object graphs for equality.

   Comparing of (potentially cyclic) object graphs for equality. Features:

   • abstracted over pointers;
   • termination and correctness in presence of cycles;
   • stack safety.

   XXX: Relies on meaningful hashCode and equals for Ptr1

9.  trait DeepEqualK[F1[_[_]], F2[_[_]]] extends AnyRef
10.  type DeepShow[A, Ptr[_]] = ObjectSerializer[A, String, Ptr]
11.  trait DeepShowK[A[_[_]]] extends AnyRef
12.  type Desc[Ptr[_]] = FreeObjectOutput[String, Ptr, Unit]
13.  trait EqualK[F[_]] extends AnyRef

    Universally quantified equality, isomorphic to ∀A. Equal[F[A]].

    Universally quantified equality, isomorphic to ∀A. Equal[F[A]].

    Note that equality on A is not required to compare values of F[A].

14.  sealed abstract class Exists[F[_]] extends AnyRef
15.  sealed abstract class Exists{(* -> *) -> *}[F[_[_]]] extends AnyRef
16.  trait Forall{(* -> *) -> * -> *}[F[_[_], _]] extends AnyRef

    Universally quantified value: ∀ K[_], A. F[K, A]

17.  trait Forall{(* -> *) -> *}[F[_[_]]] extends AnyRef

    Universally quantified value: ∀ K[_]. F[K]

18.  trait Forall{* -> *}[F[_]] extends AnyRef

    Universally quantified value: ∀ A. F[A]

19.  final class FreeK[F[_[_], _], A] extends AnyRef

    Free monad for type constructors of kind F[_[_], _], where F's first type parameter is recursively set to FreeK[F, ?].

    Free monad for type constructors of kind F[_[_], _], where F's first type parameter is recursively set to FreeK[F, ?]. If we pretend that recursive type aliases are legal, then FreeK is equivalent to

    type FreeK[F[_[_], _], A] = Free[F[FreeK[F, ?], ?], A]

    This is useful for instruction sets (a.k.a. algebras, DSLs, ...) that need to refer to the type of the free program that they are embedded in.

20.  final case class FreeKT[F[_[_], _], M[_], A](run: FreeT[[β$3$]F[[γ$2$]FreeKT[F, M, γ$2$], β$3$], M, A]) extends Product with Serializable
21.  final class FreeObjectOutput[R, Ptr[_], A] extends AnyRef
22.  trait FunctionK{(* -> *) -> * -> *}[F[_[_], _], G[_[_], _]] extends AnyRef

    Universally quantified function: ∀ K[_], A. F[K, A] => G[K, A]

23.  trait FunctionK{(* -> *) -> *}[F[_[_]], G[_[_]]] extends AnyRef

    Universally quantified function: ∀ K[_]. F[K] => G[K]

24.  trait FunctorKA[F[_[_], _]] extends AnyRef
25.  trait HEqual[A, B] extends AnyRef

    Heterogeneous equality, i.e.

    Heterogeneous equality, i.e. able to compare values of two disparate types.

26.  trait HEqualK[F[_]] extends EqualK[F] with Equal[F[_]]

    Universally quantified heterogeneous equality, isomorphic to ∀A,B. HEqual[F[A], F[B]].

    Universally quantified heterogeneous equality, isomorphic to ∀A,B. HEqual[F[A], F[B]].

    Note that (heterogeneous) equality between A and B is not required to compare F[A] to F[B].

27.  final case class HHKMap[K[_[_[_]]], V[_[_[_]]]](map: Map[K[Any], V[Any]]) extends AnyVal with Product with Serializable
28.  final case class HKMap[K[_[_]], V[_[_]]](map: Map[K[Any], V[Any]]) extends AnyVal with Product with Serializable
29.  trait HListPtr[L <: HList, N <: Nat] extends At[L, N]
30.  trait HOrderK[F[_]] extends HEqualK[F] with Order[F[_]]
31.  type Index[K, V] = TransformedIndex[K, V, V]
32.  trait Inject[F[_], G[_]] extends ~>[F, G]

    Similar to scalaz.Inject, except:

    Similar to scalaz.Inject, except:

    • not sealed, thus not restricted to injections into scalaz.Coproduct;
    • doesn't require to implement projection, so more instances are possible.
33.  trait InjectInstances0 extends InjectInstances1
34.  trait InjectInstances1 extends InjectInstances2
35.  trait InjectInstances2 extends InjectInstances3
36.  trait InjectInstances3 extends InjectInstances4
37.  trait InjectInstances4 extends InjectInstances5
38.  trait InjectInstances5 extends AnyRef
39.  final case class IsEqual[Ptr1[_], Ptr2[_]] extends Product with Serializable
40.  final case class K2Map[K[_, _], V[_, _]](map: Map[K[_, _], V[_, _]]) extends AnyVal with Product with Serializable
41.  final case class K3Map[K[_, _, _], V[_, _, _]](map: Map[K[_, _, _], V[_, _, _]]) extends AnyVal with Product with Serializable
42.  sealed abstract class K3Pair[K[_, _, _], V[_, _, _]] extends AnyRef
43.  final case class KMap[K[_], V[_]](map: Map[K[_], V[_]]) extends AnyVal with Product with Serializable
44.  final case class KMap1_2[K[_], V[_, _, _], TC[_, _, _]](map: Map[K[_], V[_, _, _]]) extends AnyVal with Product with Serializable

    KMap where values are parameterized by 2 additional type parameters, uniquely determined by a typeclass instance.

    KMap where values are parameterized by 2 additional type parameters, uniquely determined by a typeclass instance. Type safety relies on TC[A, B, C] being functional in A, i.e. for each A there are globally unique B, C such that there is an instance of TC[A, B, C].

45.  final case class KMapB[K[_ <: UB], V[_ <: UB], UB](map: Map[K[_ <: UB], V[_ <: UB]]) extends AnyVal with Product with Serializable

    KMap with an upper bound on the type parameter accepted by K[_], V[_].

46.  final case class KPair[F[_[_]], G[_[_]], A[_]](_1: F[A], _2: G[A]) extends Product with Serializable
47.  sealed abstract class Lst[+A] extends AnyRef

    Linked list with O(1) cons, snoc and concatenation and amortized O(1) uncons.

48.  trait Mapped[L <: HList, F[_]] extends Serializable
49.  trait MappedListBuilder[L <: HList] extends AnyRef
50.  final class Mediated[M[_], A, B, C] extends AnyVal

    Computation of C with a missing link between A and B.

    Computation of C with a missing link between A and B. Encapsulates effectful computations () ~~~> A and B ~~~> C. By plugging in A ~~~> B one can obtain () ~~~> C. The purpose of this class is to prevent using just one of the two encapsulated computations: either both, or none. This is useful when the effects of the two computations are somehow paired and this pairing can't be broken. This is only safe when M is a lazy monad with benign effects.

51.  trait MonadObjectOutput[F[_], R, Ptr[_]] extends MonadTell[F, R] with BindRec[F]
52.  trait MonadTellState[F[_], W, S] extends MonadTell[F, W] with MonadState[F, S]
53.  trait MonoidAggregator[B, A] extends Aggregator[B, A] with Monoid[B]
54.  trait MonoidK[F[_]] extends AnyRef
55.  trait ObjectOutput[O, R, Ptr[_]] extends AnyRef
    O

    represents output. Examples: String, java.io.OutputStream, ...

    R

    represents type of data to be written to the output. Examples: String, bit string, ...

    Ptr

    abstraction of pointers.

56.  trait ObjectSerializer[A, S, Ptr[_]] extends AnyRef

    Serialization of (potentially cyclic) object graphs.

    Serialization of (potentially cyclic) object graphs. Features:

    • abstracted over pointers;
    • termination and correctness in presence of cycles;
    • stack safety.

    A

    type of objects that this serializer can serialize.

    S

    type of data this serializer writes when serializing A, e.g. String, byte array, etc.

    Ptr

    abstraction of pointers.

57.  trait Pointers[L <: HList] extends AnyRef
58.  trait Pointers0[L <: HList, T <: HList, N <: Nat] extends AnyRef
59.  trait ShowK[F[_]] extends ~>[F, [α]String]
60.  abstract class StateInterpreter[K[_], F[_], S] extends AnyRef
61.  trait StratifiedAggregator[B, A] extends (B, A, Int) => B
62.  trait StratifiedMonoidAggregator[B, A] extends StratifiedAggregator[B, A] with Monoid[B]
63.  trait SummonHList[L <: HList] extends AnyRef

    Used to implicitly summon an HList by implicitly summoning its elements.

64.  trait Transformed[L <: HList, F[_], G[_]] extends Serializable
65.  case class TransformedIndex[K, VIn, VOut] extends Product with Serializable
66.  case class TwoLevel[F[_], A](_1: F[A], _2: F[A]) extends Product with Serializable
67.  trait TwoLevelInstances extends TwoLevelInstances1
68.  trait TwoLevelInstances1 extends AnyRef
69.  type Uninhabited = Nothing { type T = Unit }
70.  trait ValuedPointers[V <: HList, PA <: HList] extends AnyRef
71.  type WriterState[W, S, A] = WriterStateT[W, S, scalaz.Id.Id, A]
72.  final case class WriterStateT[W, S, F[_], A](run: (S) => F[(W, S, A)]) extends AnyVal with Product with Serializable
73.  trait WriterStateTInstances extends WriterStateTInstances1
74.  trait WriterStateTInstances1 extends WriterStateTInstances2
75.  trait WriterStateTInstances2 extends AnyRef
76.  type ∃[F[_]] = F[_]
77.  type ≈>[F[_[_]], G[_[_]]] = FunctionK{(* -> *) -> *}[F, G]
78.  type ≈~>[F[_[_], _], G[_[_], _]] = FunctionK{(* -> *) -> * -> *}[F, G]