Packages

trait AllOps[T, F[_]] extends Ops[T, F]

Linear Supertypes
Ops[T, F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AllOps
  2. Ops
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def self: T
    Definition Classes
    Ops
  2. abstract def typeClassInstance: Aux[T, F]
    Definition Classes
    AllOps → Ops

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def all(p: (T) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
    Definition Classes
    Ops
  5. def any(p: (T) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
    Definition Classes
    Ops
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def attributeTopDown[A](z: A)(f: (A, F[T]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]
    Definition Classes
    Ops
  8. def attributeTopDownM[M[_], A](z: A)(f: (A, F[T]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]
    Definition Classes
    Ops
  9. def cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  10. def cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  11. def children(implicit BT: Traverse[F]): slamdata.Predef.List[T]
    Definition Classes
    Ops
  12. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. def collect[B](pf: slamdata.Predef.PartialFunction[T, B])(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.List[B]
    Definition Classes
    Ops
  14. def contains(c: T)(implicit T: Equal[T], BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
    Definition Classes
    Ops
  15. def convertTo[R](implicit R: Corecursive.Aux[R, F], BF: Functor[F]): R
    Definition Classes
    Ops
  16. def elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
    Definition Classes
    Ops
  17. def elgotCataM[W[_], M[_], A](k: DistributiveLaw[F, [A]M[W[A]]], g: ElgotAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  18. def elgotHisto[A](f: ElgotAlgebra[[β$43$]Cofree[F, β$43$], F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  19. def elgotPara[A](f: ElgotAlgebra[[β$31$](T, β$31$), F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  20. def elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$36$](B, β$36$), F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  21. def elgotZygoM[A, B, M[_]](f: AlgebraM[M, F, B], g: ElgotAlgebraM[[β$37$](B, β$37$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  22. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  24. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  25. def foldMap[Z](f: (T) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z
    Definition Classes
    Ops
  26. def foldMapM[M[_], Z](f: (T) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]
    Definition Classes
    Ops
  27. def gElgotZygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: ElgotAlgebra[[γ$39$]EnvT[B, W, γ$39$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
    Definition Classes
    Ops
  28. def gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
    Definition Classes
    Ops
  29. def gcataM[W[_], M[_], A](w: DistributiveLaw[F, W], g: GAlgebraM[W, M, F, A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  30. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  31. def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$44$]Cofree[H, β$44$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A
    Definition Classes
    Ops
  32. def gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$33$]EnvT[T, W, γ$33$], F, A])(implicit arg0: Comonad[W], T: Corecursive.Aux[T, F], BF: Functor[F]): A
    Definition Classes
    Ops
  33. def gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], T: Corecursive.Aux[T, F], BF: Functor[F]): A
    Definition Classes
    Ops
  34. def gzygo[W[_], A, B](f: Algebra[F, B], w: DistributiveLaw[F, W], g: GAlgebra[[γ$38$]EnvT[B, W, γ$38$], F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
    Definition Classes
    Ops
  35. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  36. def histo[A](f: GAlgebra[[β$42$]Cofree[F, β$42$], F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  37. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  38. def isLeaf(implicit BT: Traverse[F]): slamdata.Predef.Boolean
    Definition Classes
    Ops
  39. def lambek(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): F[T]
    Definition Classes
    Ops
  40. def mapR[U, G[_]](f: (F[T]) ⇒ G[U])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U
    Definition Classes
    Ops
  41. def mutu[A, B](f: GAlgebra[[β$40$](A, β$40$), F, B], g: GAlgebra[[β$41$](B, β$41$), F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  42. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  43. final def notify(): Unit
    Definition Classes
    AnyRef
  44. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  45. def para[A](f: GAlgebra[[β$30$](T, β$30$), F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  46. def paraM[M[_], A](f: GAlgebraM[[β$32$](T, β$32$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  47. def paraMerga[A](that: T)(f: (T, T, slamdata.Predef.Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A
    Definition Classes
    Ops
  48. def paraZygo[A, B](f: GAlgebra[[β$45$](T, β$45$), F, B], g: GAlgebra[[β$46$](B, β$46$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A
    Definition Classes
    Ops
  49. def prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): A
    Definition Classes
    Ops
  50. def project(implicit BF: Functor[F]): F[T]
    Definition Classes
    Ops
  51. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  52. def toString(): String
    Definition Classes
    AnyRef → Any
  53. def topDownCata[A](a: A)(f: (A, T) ⇒ (A, T))(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
    Definition Classes
    Ops
  54. def topDownCataM[M[_], A](a: A)(f: (A, T) ⇒ M[(A, T)])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BT: Traverse[F]): M[T]
    Definition Classes
    Ops
  55. def transAnaM[M[_], U, G[_]](f: TransformM[M, T, F, G])(implicit arg0: Monad[M], arg1: Traverse[G], U: Corecursive.Aux[U, G], BF: Functor[F]): M[U]
    Definition Classes
    Ops
  56. def transAnaT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
    Definition Classes
    Ops
  57. def transAnaTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]
    Definition Classes
    Ops
  58. def transApo[U, G[_]](f: CoalgebraicGTransform[[β$48$]\/[U, β$48$], T, F, G])(implicit arg0: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): U
    Definition Classes
    Ops
  59. def transApoT(f: (T) ⇒ \/[T, T])(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
    Definition Classes
    Ops
  60. def transCataM[M[_], U, G[_]](f: TransformM[M, U, F, G])(implicit arg0: Monad[M], arg1: Functor[G], U: Corecursive.Aux[U, G], BT: Traverse[F]): M[U]
    Definition Classes
    Ops
  61. def transCataT(f: (T) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
    Definition Classes
    Ops
  62. def transCataTM[M[_]](f: (T) ⇒ M[T])(implicit arg0: Monad[M], T: Corecursive.Aux[T, F], BF: Traverse[F]): M[T]
    Definition Classes
    Ops
  63. def transHylo[G[_], U, H[_]](φ: (G[U]) ⇒ H[U], ψ: (F[T]) ⇒ G[T])(implicit arg0: Functor[G], arg1: Functor[H], U: Corecursive.Aux[U, H], BF: Functor[F]): U
    Definition Classes
    Ops
  64. def transParaT(f: ((T, T)) ⇒ T)(implicit T: Corecursive.Aux[T, F], BF: Functor[F]): T
    Definition Classes
    Ops
  65. def traverseR[M[_], U, G[_]](f: (F[T]) ⇒ M[G[U]])(implicit arg0: Functor[M], arg1: Functor[G], U: Corecursive.Aux[U, G], BF: Functor[F]): M[U]
    Definition Classes
    Ops
  66. def universe(implicit BF: Functor[F], B: Foldable[F]): NonEmptyList[T]
    Definition Classes
    Ops
  67. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  68. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  69. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  70. def zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$34$](B, β$34$), F, A])(implicit BF: Functor[F]): A
    Definition Classes
    Ops
  71. def zygoM[A, B, M[_]](f: AlgebraM[M, F, B], g: GAlgebraM[[β$35$](B, β$35$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
    Definition Classes
    Ops
  72. object transAna
    Definition Classes
    Ops
  73. object transCata
    Definition Classes
    Ops
  74. object transPara
    Definition Classes
    Ops
  75. object transPostpro
    Definition Classes
    Ops
  76. object transPrepro
    Definition Classes
    Ops

Inherited from Ops[T, F]

Inherited from AnyRef

Inherited from Any

Ungrouped