Package

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

Type Members

  1. type Algebra[F[_], A] = (F[A]) ⇒ A

    Permalink
  2. type AlgebraIso[F[_], A] = PIso[F[scalaz.Scalaz.Id[A]], F[scalaz.Scalaz.Id[A]], A, A]

    Permalink
  3. type AlgebraM[M[_], F[_], A] = (F[A]) ⇒ M[A]

    Permalink
  4. type AlgebraPrism[F[_], A] = PPrism[F[A], F[A], A, A]

    Permalink
  5. type AlgebraicGTransform[W[_], T, F[_], G[_]] = (F[W[T]]) ⇒ G[T]

    Permalink
  6. type AlgebraicGTransformM[W[_], M[_], T, F[_], G[_]] = (F[W[T]]) ⇒ M[G[T]]

    Permalink
  7. type Coalgebra[F[_], A] = (A) ⇒ F[A]

    Permalink
  8. type CoalgebraM[M[_], F[_], A] = (A) ⇒ M[F[A]]

    Permalink
  9. type CoalgebraPrism[F[_], A] = PPrism[A, A, F[A], F[A]]

    Permalink
  10. type CoalgebraicElgotTransform[N[_], T, F[_], G[_]] = (F[T]) ⇒ N[G[T]]

    Permalink
  11. type CoalgebraicGTransform[N[_], T, F[_], G[_]] = (F[T]) ⇒ G[N[T]]

    Permalink
  12. type CoalgebraicGTransformM[N[_], M[_], T, F[_], G[_]] = (F[T]) ⇒ M[G[N[T]]]

    Permalink
  13. type DistributiveLaw[F[_], G[_]] = NaturalTransformation[[A]F[G[A]], [A]G[F[A]]]

    Permalink
  14. type ElgotAlgebra[W[_], F[_], A] = (W[F[A]]) ⇒ scalaz.Scalaz.Id[A]

    Permalink
  15. type ElgotAlgebraIso[W[_], N[_], F[_], A] = PIso[W[F[A]], N[F[A]], A, A]

    Permalink
  16. type ElgotAlgebraM[W[_], M[_], F[_], A] = (W[F[A]]) ⇒ M[A]

    Permalink
  17. type ElgotCoalgebra[E[_], F[_], A] = (A) ⇒ E[F[A]]

    Permalink
  18. type ElgotCoalgebraM[E[_], M[_], F[_], A] = (A) ⇒ M[E[F[A]]]

    Permalink
  19. type EndoTransform[T, F[_]] = (F[T]) ⇒ F[T]

    Permalink
  20. type GAlgebra[W[_], F[_], A] = (F[W[A]]) ⇒ A

    Permalink
  21. type GAlgebraIso[W[_], N[_], F[_], A] = PIso[F[W[A]], F[N[A]], A, A]

    Permalink
  22. type GAlgebraM[W[_], M[_], F[_], A] = (F[W[A]]) ⇒ M[A]

    Permalink
  23. type GCoalgebra[N[_], F[_], A] = (A) ⇒ F[N[A]]

    Permalink
  24. type GCoalgebraM[N[_], M[_], F[_], A] = (A) ⇒ M[F[N[A]]]

    Permalink
  25. type Transform[T, F[_], G[_]] = (F[T]) ⇒ G[T]

    Permalink
  26. type TransformM[M[_], T, F[_], G[_]] = (F[T]) ⇒ M[G[T]]

    Permalink

Value Members

  1. implicit def AlgebraZip[F[_]](implicit arg0: Functor[F]): Zip[[γ$35$](F[scalaz.Scalaz.Id[γ$35$]]) ⇒ γ$35$]

    Permalink
  2. implicit def ElgotAlgebraMZip[W[_], M[_], F[_]](implicit arg0: Functor[W], arg1: Applicative[M], arg2: Functor[F]): Zip[[δ$37$](W[F[δ$37$]]) ⇒ M[δ$37$]]

    Permalink
  3. implicit def ElgotAlgebraZip[W[_], F[_]](implicit arg0: Functor[W], arg1: Functor[F]): Zip[[δ$37$](W[F[δ$37$]]) ⇒ scalaz.Scalaz.Id[δ$37$]]

    Permalink
  4. implicit def GAlgebraZip[W[_], F[_]](implicit arg0: Functor[W], arg1: Functor[F]): Zip[[γ$35$](F[W[γ$35$]]) ⇒ γ$35$]

    Permalink
  5. def alignThese[T, F[_]](implicit arg0: Align[F], T: Aux[T, F]): ElgotCoalgebra[[β$42$]\/[T, β$42$], F, \&/[T, T]]

    Permalink
  6. def attrK[F[_], A](k: A)(implicit arg0: Functor[F]): Algebra[F, Cofree[F, A]]

    Permalink
  7. def attrSelf[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): Algebra[F, Cofree[F, T]]

    Permalink
  8. def attributeAlgebra[F[_], A](f: Algebra[F, A])(implicit arg0: Functor[F]): Algebra[F, Cofree[F, A]]

    Permalink
  9. def attributeAlgebraM[F[_], M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Functor[F], arg1: Functor[M]): AlgebraM[M, F, Cofree[F, A]]

    Permalink
  10. def attributeCoalgebra[F[_], B](ψ: Coalgebra[F, B]): Coalgebra[[γ$26$]EnvT[B, F, γ$26$], B]

    Permalink
  11. def bilambekIso[T, F[_]](implicit arg0: Functor[F], TR: Aux[T, F], TC: Aux[T, F]): AlgebraIso[F, T]

    Permalink
  12. def binarySequence[A](relation: (A, A) ⇒ A): Coalgebra[[β$43$](A, β$43$), (A, A)]

    Permalink
  13. def birecursiveIso[T, F[_]](implicit arg0: Functor[F], TR: Aux[T, F], TC: Aux[T, F]): AlgebraIso[F, T]

    Permalink
  14. implicit def birecursiveTBirecursive[T[_[_]], F[_]](implicit arg0: BirecursiveT[T]): Aux[T[F], F]

    Permalink
  15. implicit def birecursiveTFunctor[T[_[_]], F[_, _]](implicit arg0: BirecursiveT[T], F: Bifunctor[F]): Functor[[α]T[[β$44$]F[α, β$44$]]]

    Permalink
  16. def builder[F[_], A, B](fa: F[A], children: slamdata.Predef.List[B])(implicit arg0: Traverse[F]): F[B]

    Permalink
  17. def chrono[F[_], A, B](a: A)(g: GAlgebra[[β$5$]Cofree[F, β$5$], F, B], f: GCoalgebra[[β$6$]Free[F, β$6$], F, A])(implicit arg0: Functor[F]): B

    Permalink
  18. def codyna[F[_], A, B](a: A)(φ: Algebra[F, B], ψ: GCoalgebra[[β$1$]Free[F, β$1$], F, A])(implicit arg0: Functor[F]): B

    Permalink
  19. def codynaM[M[_], F[_], A, B](a: A)(φ: AlgebraM[M, F, B], ψ: GCoalgebraM[[β$3$]Free[F, β$3$], M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
  20. def coelgot[F[_], A, B](a: A)(φ: ElgotAlgebra[[β$11$](A, β$11$), F, B], ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B

    Permalink
  21. implicit def corecursiveTCorecursive[T[_[_]], F[_]](implicit arg0: CorecursiveT[T]): Aux[T[F], F]

    Permalink
  22. def count[T, F[_]](form: T)(implicit arg0: Equal[T], arg1: Functor[F], arg2: Foldable[F], T: Aux[T, F]): ElgotAlgebra[[β$41$](T, β$41$), F, slamdata.Predef.Int]

    Permalink
  23. def deattribute[F[_], A, B](φ: Algebra[F, B]): Algebra[[γ$27$]EnvT[A, F, γ$27$], B]

    Permalink
  24. implicit def delayEqual[F[_], A](implicit A: Equal[A], F: Delay[Equal, F]): Equal[F[A]]

    Permalink
  25. implicit def delayShow[F[_], A](implicit A: Show[A], F: Delay[Show, F]): Show[F[A]]

    Permalink
  26. def distAna[F[_]]: DistributiveLaw[scalaz.Scalaz.Id, F]

    Permalink
  27. def distApo[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): DistributiveLaw[[β$20$]\/[T, β$20$], F]

    Permalink
  28. def distApplicative[F[_], G[_]](implicit arg0: Traverse[F], arg1: Applicative[G]): DistributiveLaw[F, G]

    Permalink
  29. def distCata[F[_]]: DistributiveLaw[F, scalaz.Scalaz.Id]

    Permalink
  30. def distDistributive[F[_], G[_]](implicit arg0: Functor[F], arg1: Distributive[G]): DistributiveLaw[F, G]

    Permalink
  31. def distFutu[F[_]](implicit arg0: Functor[F]): DistributiveLaw[[β$23$]Free[F, β$23$], F]

    Permalink
  32. def distGApo[F[_], B](g: Coalgebra[F, B])(implicit arg0: Functor[F]): DistributiveLaw[[β$21$]\/[B, β$21$], F]

    Permalink
  33. def distGApoT[F[_], M[_], B](g: Coalgebra[F, B], k: DistributiveLaw[M, F])(implicit arg0: Functor[F], arg1: Functor[M]): DistributiveLaw[[γ$22$]EitherT[M, B, γ$22$], F]

    Permalink
  34. def distGFutu[H[_], F[_]](k: DistributiveLaw[H, F])(implicit arg0: Functor[H], F: Functor[F]): DistributiveLaw[[β$24$]Free[H, β$24$], F]

    Permalink
  35. def distGHisto[F[_], H[_]](k: DistributiveLaw[F, H])(implicit arg0: Functor[F], arg1: Functor[H]): DistributiveLaw[F, [β$19$]Cofree[H, β$19$]]

    Permalink
  36. def distHisto[F[_]](implicit arg0: Functor[F]): DistributiveLaw[F, [β$18$]Cofree[F, β$18$]]

    Permalink
  37. def distPara[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): DistributiveLaw[F, [β$13$](T, β$13$)]

    Permalink
  38. def distParaT[T, W[_], F[_]](t: DistributiveLaw[F, W])(implicit arg0: Comonad[W], arg1: Functor[F], T: Aux[T, F]): DistributiveLaw[F, [γ$14$]EnvT[T, W, γ$14$]]

    Permalink
  39. def distZygo[F[_], B](g: Algebra[F, B])(implicit arg0: Functor[F]): DistributiveLaw[F, [β$15$](B, β$15$)]

    Permalink
  40. def distZygoM[F[_], M[_], B](g: AlgebraM[M, F, B], k: DistributiveLaw[F, M])(implicit arg0: Functor[F], arg1: Monad[M]): DistributiveLaw[F, [A]M[(B, A)]]

    Permalink
  41. def distZygoT[F[_], W[_], B](g: Algebra[F, B], k: DistributiveLaw[F, W])(implicit arg0: Functor[F], arg1: Comonad[W]): DistributiveLaw[F, [γ$17$]EnvT[B, W, γ$17$]]

    Permalink
  42. def dyna[F[_], A, B](a: A)(φ: (F[Cofree[F, B]]) ⇒ B, ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B

    Permalink
  43. def elgot[F[_], A, B](a: A)(φ: Algebra[F, B], ψ: ElgotCoalgebra[[β$9$]\/[B, β$9$], F, A])(implicit arg0: Functor[F]): B

    Permalink
  44. def elgotM[M[_], F[_], A, B](a: A)(φ: AlgebraM[M, F, B], ψ: ElgotCoalgebraM[[β$10$]\/[B, β$10$], M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
  45. implicit def equalTEqual[T[_[_]], F[_]](implicit arg0: Functor[F], T: EqualT[T], F: Delay[Equal, F]): Equal[T[F]]

    Permalink
  46. def find[T](f: (T) ⇒ slamdata.Predef.Boolean): (T) ⇒ \/[T, T]

    Permalink
  47. def foldIso[T, F[_], A](alg: AlgebraIso[F, A])(implicit arg0: Functor[F], TR: Aux[T, F], TC: Aux[T, F]): Iso[T, A]

    Permalink
  48. def foldPrism[T, F[_], A](alg: AlgebraPrism[F, A])(implicit arg0: Traverse[F], TR: Aux[T, F], TC: Aux[T, F]): Prism[T, A]

    Permalink
  49. def forgetAnnotation[T, R, F[_], A](t: T)(implicit arg0: Functor[F], T: Aux[T, [γ$28$]EnvT[A, F, γ$28$]], R: Aux[R, F]): R

    Permalink
  50. def ghylo[W[_], N[_], F[_], A, B](a: A)(w: DistributiveLaw[F, W], n: DistributiveLaw[N, F], f: GAlgebra[W, F, B], g: GCoalgebra[N, F, A])(implicit arg0: Comonad[W], arg1: Monad[N], arg2: Functor[F]): B

    Permalink
  51. def ghyloM[W[_], N[_], M[_], F[_], A, B](a: A)(w: DistributiveLaw[F, W], m: DistributiveLaw[N, F], f: GAlgebraM[W, M, F, B], g: GCoalgebraM[N, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[N], arg3: Traverse[N], arg4: Monad[M], arg5: Traverse[F]): M[B]

    Permalink
  52. def height[F[_]](implicit arg0: Foldable[F]): Algebra[F, slamdata.Predef.Int]

    Permalink
  53. def holes[F[_], A](fa: F[A])(implicit arg0: Traverse[F]): F[(A, Coalgebra[F, A])]

    Permalink
  54. def holesList[F[_], A](fa: F[A])(implicit arg0: Traverse[F]): slamdata.Predef.List[(A, Coalgebra[F, A])]

    Permalink
  55. def hylo[F[_], A, B](a: A)(f: Algebra[F, B], g: Coalgebra[F, A])(implicit arg0: Functor[F]): B

    Permalink
  56. def hyloM[M[_], F[_], A, B](a: A)(f: AlgebraM[M, F, B], g: CoalgebraM[M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    Permalink
  57. def join[A]: Algebra[[α]Option[(A, (α, α))], slamdata.Predef.List[A]]

    Permalink
  58. def liftT[F[_], A, B](φ: ElgotAlgebra[[β$29$](A, β$29$), F, B]): Algebra[[γ$30$]EnvT[A, F, γ$30$], B]

    Permalink
  59. def liftTM[M[_], F[_], A, B](φ: ElgotAlgebraM[[β$31$](A, β$31$), M, F, B]): AlgebraM[M, [γ$32$]EnvT[A, F, γ$32$], B]

    Permalink
  60. def mergeTuple[T, F[_]](implicit arg0: Functor[F], arg1: Merge[F], T: Aux[T, F]): CoalgebraM[slamdata.Predef.Option, F, (T, T)]

    Permalink
  61. def orDefault[A, B](default: B)(f: (A) ⇒ slamdata.Predef.Option[B]): (A) ⇒ B

    Permalink
  62. def orOriginal[A](f: (A) ⇒ slamdata.Predef.Option[A]): (A) ⇒ A

    Permalink
  63. def partition[A](implicit arg0: Order[A]): Coalgebra[[α]Option[(A, (α, α))], slamdata.Predef.List[A]]

    Permalink
  64. def project[F[_], A](index: slamdata.Predef.Int, fa: F[A])(implicit arg0: Foldable[F]): slamdata.Predef.Option[A]

    Permalink
  65. def quicksort[A](as: slamdata.Predef.List[A])(implicit arg0: Order[A]): slamdata.Predef.List[A]

    Permalink
  66. implicit def recursiveTFoldable[T[_[_]], F[_, _]](implicit arg0: RecursiveT[T], FB: Bifoldable[F], FF: Bifunctor[F]): Foldable[[α]T[[β$49$]F[α, β$49$]]]

    Permalink
  67. implicit def recursiveTRecursive[T[_[_]], F[_]](implicit arg0: RecursiveT[T]): Aux[T[F], F]

    Permalink
  68. final def repeatedly[A](f: (A) ⇒ slamdata.Predef.Option[A])(expr: A): A

    Permalink
    Annotations
    @tailrec()
  69. def runT[F[_], A, B](ψ: ElgotCoalgebra[[β$33$]\/[A, β$33$], F, B]): Coalgebra[[γ$34$]CoEnv[A, F, γ$34$], B]

    Permalink
  70. package scalacheck

    Permalink
  71. implicit def showTShow[T[_[_]], F[_]](implicit arg0: Functor[F], T: ShowT[T], F: Delay[Show, F]): Show[T[F]]

    Permalink
  72. def size[F[_]](implicit arg0: Foldable[F]): Algebra[F, slamdata.Predef.Int]

    Permalink
  73. def substitute[T](original: T, replacement: T)(implicit arg0: Equal[T]): (T) ⇒ \/[T, T]

    Permalink
  74. def toTree[F[_]](implicit arg0: Functor[F], arg1: Foldable[F]): Algebra[F, Tree[F[slamdata.Predef.Unit]]]

    Permalink
  75. def unfoldPrism[T, F[_], A](coalg: CoalgebraPrism[F, A])(implicit arg0: Traverse[F], TR: Aux[T, F], TC: Aux[T, F]): Prism[A, T]

    Permalink
  76. def zipTuple[T, F[_]](implicit arg0: Functor[F], arg1: Zip[F], T: Aux[T, F]): Coalgebra[F, (T, T)]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped