Packages

p

matryoshka

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
  2. type AlgebraIso[F[_], A] = PIso[F[scalaz.Scalaz.Id[A]], F[scalaz.Scalaz.Id[A]], A, A]
  3. type AlgebraM[M[_], F[_], A] = (F[A]) ⇒ M[A]
  4. type AlgebraPrism[F[_], A] = PPrism[F[A], F[A], A, A]
  5. type AlgebraicGTransform[W[_], T, F[_], G[_]] = (F[W[T]]) ⇒ G[T]
  6. type AlgebraicGTransformM[W[_], M[_], T, F[_], G[_]] = (F[W[T]]) ⇒ M[G[T]]
  7. type Coalgebra[F[_], A] = (A) ⇒ F[A]
  8. type CoalgebraM[M[_], F[_], A] = (A) ⇒ M[F[A]]
  9. type CoalgebraPrism[F[_], A] = PPrism[A, A, F[A], F[A]]
  10. type CoalgebraicElgotTransform[N[_], T, F[_], G[_]] = (F[T]) ⇒ N[G[T]]
  11. type CoalgebraicGTransform[N[_], T, F[_], G[_]] = (F[T]) ⇒ G[N[T]]
  12. type CoalgebraicGTransformM[N[_], M[_], T, F[_], G[_]] = (F[T]) ⇒ M[G[N[T]]]
  13. type DistributiveLaw[F[_], G[_]] = NaturalTransformation[[A]F[G[A]], [A]G[F[A]]]
  14. type ElgotAlgebra[W[_], F[_], A] = (W[F[A]]) ⇒ scalaz.Scalaz.Id[A]
  15. type ElgotAlgebraIso[W[_], N[_], F[_], A] = PIso[W[F[A]], N[F[A]], A, A]
  16. type ElgotAlgebraM[W[_], M[_], F[_], A] = (W[F[A]]) ⇒ M[A]
  17. type ElgotCoalgebra[E[_], F[_], A] = (A) ⇒ E[F[A]]
  18. type ElgotCoalgebraM[E[_], M[_], F[_], A] = (A) ⇒ M[E[F[A]]]
  19. type EndoTransform[T, F[_]] = (F[T]) ⇒ F[T]
  20. type GAlgebra[W[_], F[_], A] = (F[W[A]]) ⇒ A
  21. type GAlgebraIso[W[_], N[_], F[_], A] = PIso[F[W[A]], F[N[A]], A, A]
  22. type GAlgebraM[W[_], M[_], F[_], A] = (F[W[A]]) ⇒ M[A]
  23. type GCoalgebra[N[_], F[_], A] = (A) ⇒ F[N[A]]
  24. type GCoalgebraM[N[_], M[_], F[_], A] = (A) ⇒ M[F[N[A]]]
  25. type Transform[T, F[_], G[_]] = (F[T]) ⇒ G[T]
  26. type TransformM[M[_], T, F[_], G[_]] = (F[T]) ⇒ M[G[T]]

Value Members

  1. implicit def AlgebraZip[F[_]](implicit arg0: Functor[F]): Zip[[γ$44$](F[scalaz.Scalaz.Id[γ$44$]]) ⇒ γ$44$]
  2. implicit def ElgotAlgebraMZip[W[_], M[_], F[_]](implicit arg0: Functor[W], arg1: Applicative[M], arg2: Functor[F]): Zip[[δ$46$](W[F[δ$46$]]) ⇒ M[δ$46$]]
  3. implicit def ElgotAlgebraZip[W[_], F[_]](implicit arg0: Functor[W], arg1: Functor[F]): Zip[[δ$46$](W[F[δ$46$]]) ⇒ scalaz.Scalaz.Id[δ$46$]]
  4. implicit def GAlgebraZip[W[_], F[_]](implicit arg0: Functor[W], arg1: Functor[F]): Zip[[γ$44$](F[W[γ$44$]]) ⇒ γ$44$]
  5. def alignThese[T, F[_]](implicit arg0: Align[F], T: Aux[T, F]): ElgotCoalgebra[[β$51$]\/[T, β$51$], F, \&/[T, T]]
  6. def attrK[F[_], A](k: A)(implicit arg0: Functor[F]): Algebra[F, Cofree[F, A]]
  7. def attrSelf[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): Algebra[F, Cofree[F, T]]
  8. def attributeAlgebra[F[_], A](f: Algebra[F, A])(implicit arg0: Functor[F]): Algebra[F, Cofree[F, A]]
  9. def attributeAlgebraM[F[_], M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Functor[F], arg1: Functor[M]): AlgebraM[M, F, Cofree[F, A]]
  10. def attributeCoalgebra[F[_], B](ψ: Coalgebra[F, B]): Coalgebra[[γ$35$]EnvT[B, F, γ$35$], B]
  11. def binarySequence[A](relation: (A, A) ⇒ A): Coalgebra[[β$52$](A, β$52$), (A, A)]
  12. implicit def birecursiveTBirecursive[T[_[_]], F[_]](implicit arg0: BirecursiveT[T]): Aux[T[F], F]
  13. implicit def birecursiveTFunctor[T[_[_]], F[_, _]](implicit arg0: BirecursiveT[T], F: Bifunctor[F]): Functor[[α]T[[β$53$]F[α, β$53$]]]
  14. def builder[F[_], A, B](fa: F[A], children: slamdata.Predef.List[B])(implicit arg0: Traverse[F]): F[B]
  15. def chrono[F[_], A, B](a: A)(g: GAlgebra[[β$6$]Cofree[F, β$6$], F, B], f: GCoalgebra[[β$7$]Free[F, β$7$], F, A])(implicit arg0: Functor[F]): B
  16. def codyna[F[_], A, B](a: A)(φ: Algebra[F, B], ψ: GCoalgebra[[β$1$]Free[F, β$1$], F, A])(implicit arg0: Functor[F]): B
  17. 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]
  18. def coelgot[F[_], A, B](a: A)(φ: ElgotAlgebra[[β$16$](A, β$16$), F, B], ψ: Coalgebra[F, A])(implicit F: Functor[F]): B
  19. implicit def corecursiveTCorecursive[T[_[_]], F[_]](implicit arg0: CorecursiveT[T]): Aux[T[F], F]
  20. def count[T, F[_]](form: T)(implicit arg0: Equal[T], arg1: Functor[F], arg2: Foldable[F], T: Aux[T, F]): ElgotAlgebra[[β$50$](T, β$50$), F, slamdata.Predef.Int]
  21. def deattribute[F[_], A, B](φ: Algebra[F, B]): Algebra[[γ$36$]EnvT[A, F, γ$36$], B]
  22. implicit def delayEqual[F[_], A](implicit A: Equal[A], F: Delay[Equal, F]): Equal[F[A]]
  23. implicit def delayShow[F[_], A](implicit A: Show[A], F: Delay[Show, F]): Show[F[A]]
  24. def distAna[F[_]]: DistributiveLaw[scalaz.Scalaz.Id, F]
  25. def distApo[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): DistributiveLaw[[β$29$]\/[T, β$29$], F]
  26. def distApplicative[F[_], G[_]](implicit arg0: Traverse[F], arg1: Applicative[G]): DistributiveLaw[F, G]
  27. def distCata[F[_]]: DistributiveLaw[F, scalaz.Scalaz.Id]
  28. def distDistributive[F[_], G[_]](implicit arg0: Functor[F], arg1: Distributive[G]): DistributiveLaw[F, G]
  29. def distFutu[F[_]](implicit arg0: Functor[F]): DistributiveLaw[[β$32$]Free[F, β$32$], F]
  30. def distGApo[F[_], B](g: Coalgebra[F, B])(implicit arg0: Functor[F]): DistributiveLaw[[β$30$]\/[B, β$30$], F]
  31. def distGApoT[F[_], M[_], B](g: Coalgebra[F, B], k: DistributiveLaw[M, F])(implicit arg0: Functor[F], arg1: Functor[M]): DistributiveLaw[[γ$31$]EitherT[M, B, γ$31$], F]
  32. def distGFutu[H[_], F[_]](k: DistributiveLaw[H, F])(implicit arg0: Functor[H], F: Functor[F]): DistributiveLaw[[β$33$]Free[H, β$33$], F]
  33. def distGHisto[F[_], H[_]](k: DistributiveLaw[F, H])(implicit arg0: Functor[F], arg1: Functor[H]): DistributiveLaw[F, [β$28$]Cofree[H, β$28$]]
  34. def distHisto[F[_]](implicit arg0: Functor[F]): DistributiveLaw[F, [β$27$]Cofree[F, β$27$]]
  35. def distPara[T, F[_]](implicit arg0: Functor[F], T: Aux[T, F]): DistributiveLaw[F, [β$22$](T, β$22$)]
  36. def distParaT[T, W[_], F[_]](t: DistributiveLaw[F, W])(implicit arg0: Comonad[W], arg1: Functor[F], T: Aux[T, F]): DistributiveLaw[F, [γ$23$]EnvT[T, W, γ$23$]]
  37. def distZygo[F[_], B](g: Algebra[F, B])(implicit arg0: Functor[F]): DistributiveLaw[F, [β$24$](B, β$24$)]
  38. 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)]]
  39. def distZygoT[F[_], W[_], B](g: Algebra[F, B], k: DistributiveLaw[F, W])(implicit arg0: Functor[F], arg1: Comonad[W]): DistributiveLaw[F, [γ$26$]EnvT[B, W, γ$26$]]
  40. def dyna[F[_], A, B](a: A)(φ: (F[Cofree[F, B]]) ⇒ B, ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B
  41. def elgot[F[_], A, B](a: A)(φ: Algebra[F, B], ψ: ElgotCoalgebra[[β$10$]\/[B, β$10$], F, A])(implicit F: Functor[F]): B
  42. def elgotHylo[W[_], N[_], F[_], A, B](a: A)(kφ: DistributiveLaw[F, W], kψ: DistributiveLaw[N, F], φ: ElgotAlgebra[W, F, B], ψ: ElgotCoalgebra[N, F, A])(implicit arg0: Comonad[W], arg1: Monad[N], arg2: Functor[F]): B
  43. def elgotM[M[_], F[_], A, B](a: A)(φ: AlgebraM[M, F, B], ψ: ElgotCoalgebraM[[β$13$]\/[B, β$13$], M, F, A])(implicit M: Monad[M], F: Traverse[F]): M[B]
  44. implicit def equalTEqual[T[_[_]], F[_]](implicit arg0: Functor[F], T: EqualT[T], F: Delay[Equal, F]): Equal[T[F]]
  45. def find[T](f: (T) ⇒ slamdata.Predef.Boolean): (T) ⇒ \/[T, T]
  46. def foldIso[T, F[_], A](alg: AlgebraIso[F, A])(implicit arg0: Functor[F], T: Aux[T, F]): Iso[T, A]
  47. def foldPrism[T, F[_], A](alg: AlgebraPrism[F, A])(implicit arg0: Traverse[F], T: Aux[T, F]): Prism[T, A]
  48. def forgetAnnotation[T, R, F[_], A](t: T)(implicit arg0: Functor[F], T: Aux[T, [γ$37$]EnvT[A, F, γ$37$]], R: Aux[R, F]): R
  49. 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
  50. def ghyloM[W[_], N[_], M[_], F[_], A, B](a: A)(w: DistributiveLaw[F, W], n: 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]
  51. def height[F[_]](implicit arg0: Foldable[F]): Algebra[F, slamdata.Predef.Int]
  52. def holes[F[_], A](fa: F[A])(implicit arg0: Traverse[F]): F[(A, Coalgebra[F, A])]
  53. def holesList[F[_], A](fa: F[A])(implicit arg0: Traverse[F]): slamdata.Predef.List[(A, Coalgebra[F, A])]
  54. def hylo[F[_], A, B](a: A)(φ: Algebra[F, B], ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B
  55. def hyloM[M[_], F[_], A, B](a: A)(f: AlgebraM[M, F, B], g: CoalgebraM[M, F, A])(implicit M: Monad[M], F: Traverse[F]): M[B]
  56. def join[A]: Algebra[[α]Option[(A, (α, α))], slamdata.Predef.List[A]]
  57. def liftT[F[_], A, B](φ: ElgotAlgebra[[β$38$](A, β$38$), F, B]): Algebra[[γ$39$]EnvT[A, F, γ$39$], B]
  58. def liftTM[M[_], F[_], A, B](φ: ElgotAlgebraM[[β$40$](A, β$40$), M, F, B]): AlgebraM[M, [γ$41$]EnvT[A, F, γ$41$], B]
  59. def mergeTuple[T, F[_]](implicit arg0: Functor[F], arg1: Merge[F], T: Aux[T, F]): CoalgebraM[slamdata.Predef.Option, F, (T, T)]
  60. def orDefault[A, B](default: B)(f: (A) ⇒ slamdata.Predef.Option[B]): (A) ⇒ B
  61. def orOriginal[A](f: (A) ⇒ slamdata.Predef.Option[A]): (A) ⇒ A
  62. def partition[A](implicit arg0: Order[A]): Coalgebra[[α]Option[(A, (α, α))], slamdata.Predef.List[A]]
  63. def project[F[_], A](index: slamdata.Predef.Int, fa: F[A])(implicit arg0: Foldable[F]): slamdata.Predef.Option[A]
  64. def quicksort[A](as: slamdata.Predef.List[A])(implicit arg0: Order[A]): slamdata.Predef.List[A]
  65. implicit def recursiveTFoldable[T[_[_]], F[_, _]](implicit arg0: RecursiveT[T], FB: Bifoldable[F], FF: Bifunctor[F]): Foldable[[α]T[[β$58$]F[α, β$58$]]]
  66. implicit def recursiveTRecursive[T[_[_]], F[_]](implicit arg0: RecursiveT[T]): Aux[T[F], F]
  67. final def repeatedly[A](f: (A) ⇒ slamdata.Predef.Option[A])(expr: A): A
    Annotations
    @tailrec()
  68. def runT[F[_], A, B](ψ: ElgotCoalgebra[[β$42$]\/[A, β$42$], F, B]): Coalgebra[[γ$43$]CoEnv[A, F, γ$43$], B]
  69. implicit def showTShow[T[_[_]], F[_]](implicit arg0: Functor[F], T: ShowT[T], F: Delay[Show, F]): Show[T[F]]
  70. def size[F[_]](implicit arg0: Foldable[F]): Algebra[F, slamdata.Predef.Int]
  71. def substitute[T](original: T, replacement: T)(implicit arg0: Equal[T]): (T) ⇒ \/[T, T]
  72. def toTree[F[_]](implicit arg0: Functor[F], arg1: Foldable[F]): Algebra[F, Tree[F[slamdata.Predef.Unit]]]
  73. def unfoldPrism[T, F[_], A](coalg: CoalgebraPrism[F, A])(implicit arg0: Traverse[F], T: Aux[T, F]): Prism[A, T]
  74. def zipTuple[T, F[_]](implicit arg0: Functor[F], arg1: Zip[F], T: Aux[T, F]): Coalgebra[F, (T, T)]

Inherited from AnyRef

Inherited from Any

Ungrouped