trait DeclarationInterface extends WdlGraphNodeWithUpstreamReferences
Represents a declaration which can show up in a workflow or a task context. For example
task test { File test_file command { ... } }
workflow wf { String wf_string = "abc" call test { input: s=wf_string } }
Both the definition of test_file and wf_string are declarations
- Alphabetic
- By Inheritance
- DeclarationInterface
- WdlGraphNodeWithUpstreamReferences
- WdlGraphNode
- Scope
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
ast: Ast
- Definition Classes
- DeclarationInterface → Scope
- abstract def expression: Option[WdlExpression]
-
abstract
def
unqualifiedName: LocallyQualifiedName
- Definition Classes
- Scope
- abstract def wdlType: WdlType
Concrete 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
-
lazy val
ancestry: Seq[Scope]
Seq(parent, grandparent, great grandparent, ..., WdlNamespace)
Seq(parent, grandparent, great grandparent, ..., WdlNamespace)
- Definition Classes
- Scope
-
def
appearsInFqn: Boolean
- Definition Classes
- Scope
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asTaskInput: Option[TaskInput]
- def asWorkflowInput: Option[WorkflowInput]
-
lazy val
calls: Set[WdlCall]
Descendants that are Calls
Descendants that are Calls
- Definition Classes
- Scope
-
def
children: Seq[Scope]
Child scopes, in the order that they appear in the source code
Child scopes, in the order that they appear in the source code
- Definition Classes
- Scope
-
def
children_=[Child <: Scope](children: Seq[Child]): Unit
- Definition Classes
- Scope
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
closestCommonAncestor(other: Scope): Option[Scope]
Given another scope, returns the closest common ancestor between the two scopes, if one exists at all
Given another scope, returns the closest common ancestor between the two scopes, if one exists at all
- returns
closest common ancestor
- Definition Classes
- Scope
-
def
closestCommonScatter(other: Scope): Option[Scatter]
- Definition Classes
- Scope
-
lazy val
declarations: Seq[Declaration]
Declarations within this Scope, in the order that they appear in source code
Declarations within this Scope, in the order that they appear in source code
- Definition Classes
- Scope
-
lazy val
descendants: Set[Scope]
All children ++ children's children ++ etc
All children ++ children's children ++ etc
- Definition Classes
- Scope
-
final
lazy val
downstream: Set[WdlGraphNode]
- Definition Classes
- WdlGraphNode
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
lazy val
fullyQualifiedName: String
String identifier for this scope.
String identifier for this scope. this.namespace.resolve(this.fullyQualifiedName) == this
- Definition Classes
- Scope
-
def
fullyQualifiedNameWithIndexScopes: String
String identifier for this scope, with hidden scope information.
String identifier for this scope, with hidden scope information.
this.namespace.resolve(this.fullyQualifiedNameWithIndexScopes) == this
- Definition Classes
- Scope
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
locallyQualifiedName(relativeTo: Scope): String
Similar to fullyQualifiedName but relatively to an ancestry scope.
Similar to fullyQualifiedName but relatively to an ancestry scope. e.g. Workflow w Call a Output o
o.locallyQualified(a) = "a.o" o.locallyQualified(w) = o.fullyQualifiedName = "w.a.o"
- Definition Classes
- Scope
-
def
lookupFunction(knownInputs: WorkflowCoercedInputs, wdlFunctions: WdlFunctions[WdlValue], outputResolver: OutputResolver = NoOutputResolver, shards: Map[Scatter, Int] = Map.empty[Scatter, Int], relativeTo: Scope = this): (String) ⇒ WdlValue
This will return a lookup function for evaluating expressions which will traverse up the scope hierarchy to find a value for
name.This will return a lookup function for evaluating expressions which will traverse up the scope hierarchy to find a value for
name. An exception will be thrown if a value cannot be found forname- knownInputs
All known values of FQNs
- wdlFunctions
Implementation of WDL functions for expression evaluation
- shards
For resolving specific shards of scatter blocks
- returns
String => WdlValue lookup function rooted at
scope
- Definition Classes
- Scope
- Exceptions thrown
VariableLookupExceptionif anything else goes wrong in looking up a value fornameVariableNotFoundExceptionIf no errors occurred, but alsonamedidn't resolve to any value
-
def
namespace: WdlNamespace
Containing namespace
Containing namespace
- Definition Classes
- Scope
-
def
namespace_=[Child <: WdlNamespace](ns: WdlNamespace): Unit
- Definition Classes
- Scope
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
parent: Option[Scope]
Parent scope
Parent scope
- Definition Classes
- Scope
-
def
parent_=[Child <: Scope](scope: Scope): Unit
- Definition Classes
- Scope
-
final
def
referencedNodes: Iterable[WdlGraphNode]
- Definition Classes
- WdlGraphNodeWithUpstreamReferences → WdlGraphNode
- def relativeWdlType(from: Scope): WdlType
-
def
resolveVariable(name: String, relativeTo: Scope = this): Option[WdlGraphNode]
Performs scope resolution starting from this scope and walking up the lexical hierarchy until it finds a GraphNode with the
nameas its unqualifiedNamePerforms scope resolution starting from this scope and walking up the lexical hierarchy until it finds a GraphNode with the
nameas its unqualifiedName- Definition Classes
- Scope
-
lazy val
scatters: Set[Scatter]
Descendants that are Scatters
Descendants that are Scatters
- Definition Classes
- Scope
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
lazy val
taskCalls: Set[WdlTaskCall]
- Definition Classes
- Scope
-
def
toString(): String
- Definition Classes
- DeclarationInterface → AnyRef → Any
- def toWdlString: String
-
final
lazy val
upstream: Set[WdlGraphNode]
The set of all graph nodes which are a single step upstream from this one.
The set of all graph nodes which are a single step upstream from this one.
- Definition Classes
- WdlGraphNode
-
final
lazy val
upstreamAncestry: Set[WdlGraphNode]
The set of all graph nodes which are (transitively) upstream from this one.
The set of all graph nodes which are (transitively) upstream from this one.
- Definition Classes
- WdlGraphNode
-
final
lazy val
upstreamReferences: Iterable[VariableReference]
- Definition Classes
- DeclarationInterface → WdlGraphNodeWithUpstreamReferences
-
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( ... )
-
lazy val
workflowCalls: Set[WdlWorkflowCall]
- Definition Classes
- Scope