Package

quasar.contrib

matryoshka

Permalink

package matryoshka

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. matryoshka
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. object OrderR

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

    Permalink

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

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

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

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

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

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

    Permalink

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

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

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

    Permalink

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

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

    Permalink

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

Inherited from AnyRef

Inherited from Any

Ungrouped