trait GraphOperations extends AnyRef
- Alphabetic
- By Inheritance
- GraphOperations
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- def dfsInternal(startDestination: TableIdentifier, downstream: Boolean, stopAtMaterializationPoints: Boolean = false): Set[TableIdentifier]
Performs a DFS starting from
startNodeand returns the set of nodes (datasets) reached.Performs a DFS starting from
startNodeand returns the set of nodes (datasets) reached.- startDestination
The identifier of the node to start from.
- downstream
if true, traverse output edges (search downstream) if false, traverse input edges (search upstream).
- stopAtMaterializationPoints
If true, stop when we reach a materialization point (table). If false, keep going until the end.
- Attributes
- protected
- def downstreamFlows(flowIdentifier: TableIdentifier): Set[TableIdentifier]
Returns the set of flows reachable from
flowIdentifiervia output (child) edges. - final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- lazy val flowNodes: Map[TableIdentifier, FlowNode]
A map from flow identifier to
FlowNode, which contains the input/output nodes. - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def upstreamDatasets(datasetIdentifiers: Seq[TableIdentifier]): Map[TableIdentifier, Set[TableIdentifier]]
Traverses the graph upstream starting from the specified
datasetIdentifiersto return the reachable nodes.Traverses the graph upstream starting from the specified
datasetIdentifiersto return the reachable nodes. The return map's keyset consists of all datasets reachable fromdatasetIdentifiers. For each entry in the response map, the value of that element refers to which ofdatasetIdentifierswas able to reach the key. If multiple ofdatasetIdentifierscould reach that key, one is picked arbitrarily. - def upstreamDatasets(datasetIdentifier: TableIdentifier): Set[TableIdentifier]
Returns the set of datasets reachable from
datasetIdentifiervia input (parent) edges. - def upstreamFlows(flowIdentifier: TableIdentifier): Set[TableIdentifier]
Returns the set of flows reachable from
flowIdentifiervia input (parent) edges. - final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)