sealed class IdOps[A] extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- IdOps
- AnyRef
- Any
Implicitly
- by CorecursiveOps
- by toRecursiveOps
- by toBirecursiveOps
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new IdOps(self: A)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def all(p: (IdOps[A]) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
- def any(p: (IdOps[A]) ⇒ slamdata.Predef.Boolean)(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def attributeTopDown[A](z: A)(f: (A, F[IdOps[A]]) ⇒ A)(implicit BF: Functor[F]): Cofree[F, A]
- def attributeTopDownM[M[_], A](z: A)(f: (A, F[IdOps[A]]) ⇒ M[A])(implicit arg0: Monad[M], BT: Traverse[F]): M[Cofree[F, A]]
- def cata[A](f: Algebra[F, A])(implicit BF: Functor[F]): A
- def cataM[M[_], A](f: AlgebraM[M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
- def children(implicit BT: Traverse[F]): slamdata.Predef.List[IdOps[A]]
- def chrono[F[_], B](g: GAlgebra[[β$3$]Cofree[F, β$3$], F, B], f: GCoalgebra[[β$4$]Free[F, β$4$], F, A])(implicit arg0: Functor[F]): B
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def codyna[F[_], B](φ: Algebra[F, B], ψ: GCoalgebra[[β$1$]Free[F, β$1$], F, A])(implicit arg0: Functor[F]): B
- def codynaM[M[_], F[_], B](φ: AlgebraM[M, F, B], ψ: GCoalgebraM[[β$2$]Free[F, β$2$], M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]
- def coelgot[F[_], B](φ: ElgotAlgebra[[β$6$](A, β$6$), F, B], ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B
-
def
colambek(implicit TR: Aux[A, FF], F: Functor[FF]): A
- Implicit
- This member is added by an implicit conversion from IdOps[A] to CorecursiveOps[A, IdOps, FF] performed by method CorecursiveOps in matryoshka.implicits. This conversion will take place only if an implicit value of type Aux[A, FF] is in scope and at the same time an implicit value of type <~<[IdOps[A], FF[A]] is in scope.
- Definition Classes
- CorecursiveOps
- def collect[B](pf: slamdata.Predef.PartialFunction[IdOps[A], B])(implicit BF: Functor[F], B: Foldable[F]): slamdata.Predef.List[B]
- def contains(c: IdOps[A])(implicit T: Equal[IdOps[A]], BF: Functor[F], B: Foldable[F]): slamdata.Predef.Boolean
- def convertTo[R](implicit R: Aux[R, F], BF: Functor[F]): R
- def dyna[F[_], B](φ: GAlgebra[[β$0$]Cofree[F, β$0$], F, B], ψ: Coalgebra[F, A])(implicit arg0: Functor[F]): B
- def elgot[F[_], B](φ: Algebra[F, B], ψ: ElgotCoalgebra[[β$5$]\/[B, β$5$], F, A])(implicit arg0: Functor[F]): B
- def elgotCata[W[_], A](k: DistributiveLaw[F, W], g: ElgotAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
- 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]
- def elgotHisto[A](f: ElgotAlgebra[[β$43$]Cofree[F, β$43$], F, A])(implicit BF: Functor[F]): A
- def elgotPara[A](f: ElgotAlgebra[[β$31$](IdOps[A], β$31$), F, A])(implicit BF: Functor[F]): A
- def elgotZygo[A, B](f: Algebra[F, B], g: ElgotAlgebra[[β$36$](B, β$36$), F, A])(implicit BF: Functor[F]): A
- 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]
-
def
embed(implicit F: Functor[FF]): A
- Implicit
- This member is added by an implicit conversion from IdOps[A] to CorecursiveOps[A, IdOps, FF] performed by method CorecursiveOps in matryoshka.implicits. This conversion will take place only if an implicit value of type Aux[A, FF] is in scope and at the same time an implicit value of type <~<[IdOps[A], FF[A]] is in scope.
- Definition Classes
- CorecursiveOps
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def foldMap[Z](f: (IdOps[A]) ⇒ Z)(implicit arg0: Monoid[Z], BF: Functor[F], B: Foldable[F]): Z
- def foldMapM[M[_], Z](f: (IdOps[A]) ⇒ M[Z])(implicit arg0: Monad[M], arg1: Monoid[Z], BF: Functor[F], B: Foldable[F]): M[Z]
- def futuM[T, M[_], F[_]](f: GCoalgebraM[[β$12$]Free[F, β$12$], M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F], T: Aux[T, F]): M[T]
- 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
- def gcata[W[_], A](k: DistributiveLaw[F, W], g: GAlgebra[W, F, A])(implicit arg0: Comonad[W], BF: Functor[F]): A
- 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]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- def ghisto[H[_], A](g: DistributiveLaw[F, H], f: GAlgebra[[β$44$]Cofree[H, β$44$], F, A])(implicit arg0: Functor[H], BF: Functor[F]): A
- def ghyloM[W[_], N[_], M[_], F[_], B](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]
- def gpara[W[_], A](e: DistributiveLaw[F, W], f: GAlgebra[[γ$33$]EnvT[IdOps[A], W, γ$33$], F, A])(implicit arg0: Comonad[W], T: Aux[IdOps[A], F], BF: Functor[F]): A
- def gprepro[W[_], A](k: DistributiveLaw[F, W], e: ~>[F, F], f: GAlgebra[W, F, A])(implicit arg0: Comonad[W], T: Aux[IdOps[A], F], BF: Functor[F]): A
- 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
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- def histo[A](f: GAlgebra[[β$42$]Cofree[F, β$42$], F, A])(implicit BF: Functor[F]): A
- def hylo[F[_], B](f: Algebra[F, B], g: Coalgebra[F, A])(implicit arg0: Functor[F]): B
- def hyloM[M[_], F[_], B](f: AlgebraM[M, F, B], g: CoalgebraM[M, F, A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isLeaf(implicit BT: Traverse[F]): slamdata.Predef.Boolean
- def lambek(implicit T: Aux[IdOps[A], F], BF: Functor[F]): F[IdOps[A]]
- def mapR[U, G[_]](f: (F[IdOps[A]]) ⇒ G[U])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U
- def mutu[A, B](f: GAlgebra[[β$40$](A, β$40$), F, B], g: GAlgebra[[β$41$](B, β$41$), F, A])(implicit BF: Functor[F]): A
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- def para[A](f: GAlgebra[[β$30$](IdOps[A], β$30$), F, A])(implicit BF: Functor[F]): A
- def paraM[M[_], A](f: GAlgebraM[[β$32$](IdOps[A], β$32$), M, F, A])(implicit arg0: Monad[M], BT: Traverse[F]): M[A]
- def paraMerga[A](that: IdOps[A])(f: (IdOps[A], IdOps[A], slamdata.Predef.Option[F[A]]) ⇒ A)(implicit BF: Functor[F], BM: Merge[F]): A
- def paraZygo[A, B](f: GAlgebra[[β$45$](IdOps[A], β$45$), F, B], g: GAlgebra[[β$46$](B, β$46$), F, A])(implicit BF: Functor[F], BU: Unzip[F]): A
- def prepro[A](e: ~>[F, F], f: Algebra[F, A])(implicit T: Aux[IdOps[A], F], BF: Functor[F]): A
- def project(implicit BF: Functor[F]): F[IdOps[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def topDownCata[A](a: A)(f: (A, IdOps[A]) ⇒ (A, IdOps[A]))(implicit T: Aux[IdOps[A], F], BF: Functor[F]): IdOps[A]
- def topDownCataM[M[_], A](a: A)(f: (A, IdOps[A]) ⇒ M[(A, IdOps[A])])(implicit arg0: Monad[M], T: Aux[IdOps[A], F], BT: Traverse[F]): M[IdOps[A]]
- def transAnaM[M[_], U, G[_]](f: TransformM[M, IdOps[A], F, G])(implicit arg0: Monad[M], arg1: Traverse[G], U: Aux[U, G], BF: Functor[F]): M[U]
- def transAnaT(f: (IdOps[A]) ⇒ IdOps[A])(implicit T: Aux[IdOps[A], F], BF: Functor[F]): IdOps[A]
- def transAnaTM[M[_]](f: (IdOps[A]) ⇒ M[IdOps[A]])(implicit arg0: Monad[M], T: Aux[IdOps[A], F], BF: Traverse[F]): M[IdOps[A]]
- def transApo[U, G[_]](f: CoalgebraicGTransform[[β$48$]\/[U, β$48$], IdOps[A], F, G])(implicit arg0: Functor[G], U: Aux[U, G], BF: Functor[F]): U
- def transApoT(f: (IdOps[A]) ⇒ \/[IdOps[A], IdOps[A]])(implicit T: Aux[IdOps[A], F], BF: Functor[F]): IdOps[A]
- def transCataM[M[_], U, G[_]](f: TransformM[M, U, F, G])(implicit arg0: Monad[M], arg1: Functor[G], U: Aux[U, G], BT: Traverse[F]): M[U]
- def transCataT(f: (IdOps[A]) ⇒ IdOps[A])(implicit T: Aux[IdOps[A], F], BF: Functor[F]): IdOps[A]
- def transCataTM[M[_]](f: (IdOps[A]) ⇒ M[IdOps[A]])(implicit arg0: Monad[M], T: Aux[IdOps[A], F], BF: Traverse[F]): M[IdOps[A]]
- def transHylo[G[_], U, H[_]](φ: (G[U]) ⇒ H[U], ψ: (F[IdOps[A]]) ⇒ G[IdOps[A]])(implicit arg0: Functor[G], arg1: Functor[H], U: Aux[U, H], BF: Functor[F]): U
- def transParaT(f: ((IdOps[A], IdOps[A])) ⇒ IdOps[A])(implicit T: Aux[IdOps[A], F], BF: Functor[F]): IdOps[A]
- def traverseR[M[_], U, G[_]](f: (F[IdOps[A]]) ⇒ M[G[U]])(implicit arg0: Functor[M], arg1: Functor[G], U: Aux[U, G], BF: Functor[F]): M[U]
- def universe(implicit BF: Functor[F], B: Foldable[F]): NonEmptyList[IdOps[A]]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def zygo[A, B](f: Algebra[F, B], g: GAlgebra[[β$34$](B, β$34$), F, A])(implicit BF: Functor[F]): A
- 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]
- object ana
- object anaM
- object apo
- object apoM
- object coelgotM
- object elgotAna
- object elgotApo
- object futu
- object gana
- object ganaM
- object ghylo
- object gpostpro
- object postpro
Shadowed Implicit Value Members
-
def
self: IdOps[A]
- Implicit
- This member is added by an implicit conversion from IdOps[A] to Ops[IdOps[A], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[IdOps[A], F] is in scope.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(idOps: Ops[IdOps[A], F]).self
- Definition Classes
- Ops
-
def
self: IdOps[A]
- Implicit
- This member is added by an implicit conversion from IdOps[A] to Ops[IdOps[A], F] performed by method toBirecursiveOps in matryoshka.Birecursive.ToBirecursiveOps. This conversion will take place only if an implicit value of type Aux[IdOps[A], F] is in scope.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(idOps: Ops[IdOps[A], F]).self
- Definition Classes
- Ops
-
def
typeClassInstance: Aux[IdOps[A], F]
- Implicit
- This member is added by an implicit conversion from IdOps[A] to Ops[IdOps[A], F] performed by method toRecursiveOps in matryoshka.Recursive.ToRecursiveOps. This conversion will take place only if an implicit value of type Aux[IdOps[A], F] is in scope.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(idOps: Ops[IdOps[A], F]).typeClassInstance
- Definition Classes
- Ops
-
def
typeClassInstance: Aux[IdOps[A], F]
- Implicit
- This member is added by an implicit conversion from IdOps[A] to Ops[IdOps[A], F] performed by method toBirecursiveOps in matryoshka.Birecursive.ToBirecursiveOps. This conversion will take place only if an implicit value of type Aux[IdOps[A], F] is in scope.
- Shadowing
- This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
To access this member you can use a type ascription:(idOps: Ops[IdOps[A], F]).typeClassInstance
- Definition Classes
- Ops