Class

quasar.mimir.DAG.dag

Cond

Related Doc: package dag

Permalink

case class Cond(pred: DepGraph, left: DepGraph, leftJoin: JoinSort, right: DepGraph, rightJoin: JoinSort)(loc: yggdrasil.bytecode.Instructions.instructions.Line) extends DepGraph with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, DepGraph, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Cond
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. DepGraph
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Cond(pred: DepGraph, left: DepGraph, leftJoin: JoinSort, right: DepGraph, rightJoin: JoinSort)(loc: yggdrasil.bytecode.Instructions.instructions.Line)

    Permalink

Type Members

  1. trait EditUpdate[E] extends AnyRef

    Permalink
    Definition Classes
    DepGraph
  2. trait ScopeUpdate[S] extends AnyRef

    Permalink
    Definition Classes
    DepGraph

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object EditUpdate

    Permalink
    Definition Classes
    DepGraph
  5. object ScopeUpdate

    Permalink
    Definition Classes
    DepGraph
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. lazy val containsSplitArg: Boolean

    Permalink
    Definition Classes
    CondDepGraph
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def foldDown[Z](enterSplitChild: Boolean)(f0: PartialFunction[DepGraph, Z])(implicit monoid: Monoid[Z]): Z

    Permalink
    Definition Classes
    DepGraph
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. lazy val identities: Product with Serializable with Identities { def distinct: Product with Serializable with DAG.this.Identities }

    Permalink
    Definition Classes
    CondDepGraph
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. lazy val isSingleton: Boolean

    Permalink
    Definition Classes
    CondDepGraph
  16. val left: DepGraph

    Permalink
  17. val leftJoin: JoinSort

    Permalink
  18. val loc: yggdrasil.bytecode.Instructions.instructions.Line

    Permalink
    Definition Classes
    CondDepGraph
  19. def mapDown(body: ((DepGraph) ⇒ DepGraph) ⇒ PartialFunction[DepGraph, DepGraph]): DepGraph

    Permalink
    Definition Classes
    DepGraph
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. val peer: IUI

    Permalink
  24. val pred: DepGraph

    Permalink
  25. val right: DepGraph

    Permalink
  26. val rightJoin: JoinSort

    Permalink
  27. final def size: Int

    Permalink
    Definition Classes
    DepGraph
  28. def substituteDown[S, E](scope: S, edit: (E, E))(implicit arg0: ScopeUpdate[S], arg1: EditUpdate[E]): (DepGraph, S)

    Permalink

    Performs a scoped node substitution on this DepGraph.

    Performs a scoped node substitution on this DepGraph.

    The substitution is represented as a pair from -> to both of type E. The replacement is performed everywhere in the DAG below the scope node of type S. Both S and E are constained to be one of DepGraph or BucketSpec by the availability of instances of the type classes EditUpdate[E] and ScopeUpdate[S] as defined above.

    returns

    A pair of the whole rewritten DAG and the rewritten scope node.

    Definition Classes
    DepGraph
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  30. def uniqueIdentities: Boolean

    Permalink

    Returns true if the identities are guaranteed to be unique.

    Returns true if the identities are guaranteed to be unique.

    Definition Classes
    CondDepGraph
  31. def valueKeys: Set[Int]

    Permalink

    The set of available value-sorted keys.

    The set of available value-sorted keys.

    Definition Classes
    CondDepGraph
  32. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from DepGraph

Inherited from AnyRef

Inherited from Any

Ungrouped