final
class
ApplyProvenance[T[_[_]]] extends AnyRef
Instance Constructors
-
new
ApplyProvenance()(implicit arg0: BirecursiveT[T], arg1: EqualT[T])
Type Members
-
type
Dims = IList[P]
-
type
GPF[A] = EnvT[slamdata.Predef.Symbol, [β$0$]QScriptUniform[T, β$0$], A]
-
type
GStateM[F[_]] = MonadState_[F, QSUGraph[T]]
-
type
P = T[[β$2$]ProvF[T[[A]Coproduct[Extension, Common, A]], Free[[β$73$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$73$], Access[Symbol]], β$2$]]
-
-
type
RenameT[F[_]] = MonadTell_[F, DList[(slamdata.Predef.Symbol, slamdata.Predef.Symbol)]]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
def
GStateM[F[_]](implicit ev: GStateM[F]): GStateM[F]
-
def
RenameT[F[_]](implicit ev: RenameT[F]): RenameT[F]
-
-
def
applyProvenanceƒ[F[_]](implicit arg0: Monad[F], arg1: GStateM[F], arg2: RenameT[F]): ElgotAlgebraM[[β$1$]((Symbol, IList[T[[β$2$]ProvF[T[[A]Coproduct[Extension, Common, A]], Free[[β$73$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$73$], Access[Symbol]], β$2$]]]), β$1$), F, GPF, (slamdata.Predef.Symbol, QSUDims[T])]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
computeProvenanceƒ[F[_]](implicit arg0: Monad[F], arg1: PlannerErrorME[F]): AlgebraM[F, GPF, (slamdata.Predef.Symbol, Dims)]
-
val
dims: QProv[T]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
