object
MinimizeAutoJoins
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
MinStateM[T[_[_]], F[_]](implicit ev: MinStateM[T, F]): MinStateM[T, F]
-
def
RevIdxM[T[_[_]], F[_]](implicit ev: RevIdxM[T, F]): RevIdxM[T, F]
-
def
apply[T[_[_]], F[_]](agraph: AuthenticatedQSU[T])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: RenderTreeT[T], arg4: Monad[F], arg5: NameGenerator[F], arg6: PlannerErrorME[F]): F[AuthenticatedQSU[T]]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
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
-
def
updateGraph[T[_[_]], G[_]](pat: QScriptUniform[T, slamdata.Predef.Symbol])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: Monad[G], arg4: NameGenerator[G], arg5: MonadState_[G, scala.collection.immutable.Map[QScriptUniform[T, Symbol], Symbol]], arg6: MonadState_[G, MinimizationState[T]], arg7: PlannerErrorME[G]): G[QSUGraph[T]]
-
def
updateProvenance[T[_[_]], G[_]](qgraph: QSUGraph[T])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: ShowT[T], arg3: Monad[G], arg4: NameGenerator[G], arg5: MonadState_[G, scala.collection.immutable.Map[QScriptUniform[T, Symbol], Symbol]], arg6: MonadState_[G, MinimizationState[T]], arg7: PlannerErrorME[G]): G[slamdata.Predef.Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit