object
LogicalPlan
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
implicit
val
EqualFLogicalPlan: EqualF[LogicalPlan]
-
-
-
-
object
Let
-
implicit
val
LogicalPlanBinder: Binder[LogicalPlan]
-
implicit
val
LogicalPlanTraverse: Traverse[LogicalPlan]
-
implicit
val
LogicalPlanUnzip: Unzip[LogicalPlan]
-
-
implicit
val
RenderTreeLogicalPlan: ~>[RenderTree, [α]RenderTree[LogicalPlan[α]]]
-
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
-
-
-
def
finalize(): Unit
-
def
freshName(prefix: String): State[NameGen, Symbol]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
lpParaZygoHisto[A, B]: (Fix[LogicalPlan]) ⇒ ((LogicalPlan[(Fix[LogicalPlan], B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ scalaz.Scalaz.Id[A]) ⇒ scalaz.Scalaz.Id[A]
-
def
lpParaZygoHistoM[M[_], A, B](t: Fix[LogicalPlan])(f: (LogicalPlan[(Fix[LogicalPlan], B)]) ⇒ B, g: (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ M[A])(implicit arg0: Monad[M]): M[A]
-
def
lpParaZygoHistoS[S, A, B]: (Fix[LogicalPlan]) ⇒ ((LogicalPlan[(Fix[LogicalPlan], B)]) ⇒ B, (LogicalPlan[Cofree[LogicalPlan, (B, A)]]) ⇒ IndexedStateT[[+X]X, S, S, A]) ⇒ IndexedStateT[[+X]X, S, S, A]
-
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
rename[M[_]](f: (Symbol) ⇒ M[Symbol])(t: Fix[LogicalPlan])(implicit arg0: Monad[M]): M[Fix[LogicalPlan]]
-
def
renameƒ[M[_]](f: (Symbol) ⇒ M[Symbol])(implicit arg0: Monad[M]): ((Map[Symbol, Symbol], Fix[LogicalPlan])) ⇒ M[LogicalPlan[(Map[Symbol, Symbol], Fix[LogicalPlan])]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit