MapFuncCore

Type Members

type CoMapFuncR[T[_[_]], A] = CoEnv[A, [β$0$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$0$], FreeMapA[T, 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
object ConcatArraysN

This returns the set of expressions that are concatenated together.
This returns the set of expressions that are concatenated together. It can include statically known pieces, like MakeArray and Constant(Arr), but also arbitrary expressions that may evaluate to an array of any size.
object ConcatMapsN
val EC: Inject[Common, EJson]
val EX: Inject[Extension, EJson]
object EmptyArray
object EmptyMap
object StaticArray

Returns a List that maps element-by-element to a MapFunc array.
Returns a List that maps element-by-element to a MapFunc array. If we can’t statically determine _all_ of the elements, it doesn’t match.
object StaticArrayPrefix

Like StaticArray, but returns as much of the array as can be statically determined.
Like StaticArray, but returns as much of the array as can be statically determined. Useful if you just want to statically lookup into an array if possible, and punt otherwise.
object StaticMap
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
implicit def equal[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T]): Delay[Equal, [β$11$]MapFuncCore[T, β$11$]]
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def extractFilter[T[_[_]], A](mf: FreeMapA[T, A])(test: (A) ⇒ slamdata.Predef.Option[Hole])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): slamdata.Predef.Option[(FreeMap[T], FreeMapA[T, A], (FreeMapA[T, A]) ⇒ slamdata.Predef.Option[FreeMapA[T, A]])]

Converts conditional Undefineds into conditions that can be used in a Filter.
Converts conditional Undefineds into conditions that can be used in a Filter.
Returns the extracted predicate, the defined expression extracted from the original condition and a function to extract the defined branch from other expressions containing the same conditional test as the original.
def extractGuards[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): (CoMapFuncR[T, A]) ⇒ slamdata.Predef.Option[CoMapFuncR[T, A]]

Pulls conditional Undefineds as far up an expression as possible.
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def flattenAnd[T[_[_]], A](fm: FreeMapA[T, A]): NonEmptyList[FreeMapA[T, A]]

Annotations
@SuppressWarnings()
def foldConstant[T[_[_]], A](implicit arg0: BirecursiveT[T]): (CoMapFuncR[T, A]) ⇒ slamdata.Predef.Option[T[EJson]]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def normalize[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): (CoMapFuncR[T, A]) ⇒ CoMapFuncR[T, A]
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
implicit def renderTree[T[_[_]]](implicit arg0: ShowT[T]): Delay[RenderTree, [β$15$]MapFuncCore[T, β$15$]]
def replaceJoinSides[T[_[_]]](left: slamdata.Predef.Symbol, right: slamdata.Predef.Symbol)(implicit arg0: BirecursiveT[T]): (CoMapFuncR[T, JoinSide]) ⇒ CoMapFuncR[T, JoinSide]
def rollMF[T[_[_]], A](mf: MapFunc[T, FreeMapA[T, A]]): CoEnv[A, [β$1$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$1$], FreeMapA[T, A]]
implicit def show[T[_[_]]](implicit arg0: ShowT[T]): Delay[Show, [β$13$]MapFuncCore[T, β$13$]]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
implicit def traverse[T[_[_]]]: Traverse[[β$9$]MapFuncCore[T, β$9$]]
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( ... )

Related Docs: class MapFuncCore | package qscript

object MapFuncCore

Type Members

type CoMapFuncR[T[_[_]], A] = CoEnv[A, [β$0$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$0$], FreeMapA[T, A]]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object ConcatArraysN

object ConcatMapsN

val EC: Inject[Common, EJson]

val EX: Inject[Extension, EJson]

object EmptyArray

object EmptyMap

object StaticArray

object StaticArrayPrefix

object StaticMap

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

implicit def equal[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T]): Delay[Equal, [β$11$]MapFuncCore[T, β$11$]]

def equals(arg0: Any): Boolean

def extractFilter[T[_[_]], A](mf: FreeMapA[T, A])(test: (A) ⇒ slamdata.Predef.Option[Hole])(implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): slamdata.Predef.Option[(FreeMap[T], FreeMapA[T, A], (FreeMapA[T, A]) ⇒ slamdata.Predef.Option[FreeMapA[T, A]])]

def extractGuards[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): (CoMapFuncR[T, A]) ⇒ slamdata.Predef.Option[CoMapFuncR[T, A]]

def finalize(): Unit

def flattenAnd[T[_[_]], A](fm: FreeMapA[T, A]): NonEmptyList[FreeMapA[T, A]]

def foldConstant[T[_[_]], A](implicit arg0: BirecursiveT[T]): (CoMapFuncR[T, A]) ⇒ slamdata.Predef.Option[T[EJson]]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def normalize[T[_[_]], A](implicit arg0: BirecursiveT[T], arg1: EqualT[T], arg2: Equal[A]): (CoMapFuncR[T, A]) ⇒ CoMapFuncR[T, A]

final def notify(): Unit

final def notifyAll(): Unit

implicit def renderTree[T[_[_]]](implicit arg0: ShowT[T]): Delay[RenderTree, [β$15$]MapFuncCore[T, β$15$]]

def replaceJoinSides[T[_[_]]](left: slamdata.Predef.Symbol, right: slamdata.Predef.Symbol)(implicit arg0: BirecursiveT[T]): (CoMapFuncR[T, JoinSide]) ⇒ CoMapFuncR[T, JoinSide]

def rollMF[T[_[_]], A](mf: MapFunc[T, FreeMapA[T, A]]): CoEnv[A, [β$1$]Coproduct[[β$62$]MapFuncCore[T, β$62$], [β$63$]MapFuncDerived[T, β$63$], β$1$], FreeMapA[T, A]]

implicit def show[T[_[_]]](implicit arg0: ShowT[T]): Delay[Show, [β$13$]MapFuncCore[T, β$13$]]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

implicit def traverse[T[_[_]]]: Traverse[[β$9$]MapFuncCore[T, β$9$]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped