matryoshka

Value Members

1. implicit def AlgebraMZip[M[_], F[_]](implicit arg0: Applicative[M], arg1: Functor[F]): Zip[[γ$4$](F[γ$4$]) ⇒ M[γ$4$]]

   

2. object OrderR

   

3. def applyTransforms[A](first: (A) ⇒ slamdata.Predef.Option[A], rest: (A) ⇒ slamdata.Predef.Option[A]*): (A) ⇒ slamdata.Predef.Option[A]

   

   Chains multiple transformations together, each of which can fail to change anything.

4. implicit def coproductOrder[F[_], G[_]](implicit F: Delay[Order, F], G: Delay[Order, G]): Delay[Order, [γ$2$]Coproduct[F, G, γ$2$]]

   

5. implicit def delayOrder[F[_], A](implicit F: Delay[Order, F], A: Order[A]): Order[F[A]]

   

6. def envT[E, W[_], A](e: E, wa: W[A]): EnvT[E, W, A]

   

7. def envTIso[E, W[_], A]: Iso[EnvT[E, W, A], (E, W[A])]

   

8. def forgetRecursive[T, E, F[_]](implicit T: Aux[T, [γ$0$]EnvT[E, F, γ$0$]]): Aux[T, F]

   

   Derive a recursive instance over the functor transformed by EnvT by forgetting the annotation.

9. def project[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): Getter[T, F[T]]

   

10. def rememberCorecursive[T, E, F[_]](implicit arg0: Monoid[E], T: Aux[T, [γ$1$]EnvT[E, F, γ$1$]]): Aux[T, F]

    

    Derive a corecursive instance over the functor transformed by EnvT using the zero of the annotation monoid.

11. def totally[A](pf: slamdata.Predef.PartialFunction[A, A]): (A) ⇒ A

    

    Make a partial endomorphism total by returning the argument when undefined.