Package | Description |
---|---|
org.apache.flink.api.common | |
org.apache.flink.api.common.operators | |
org.apache.flink.api.common.operators.base | |
org.apache.flink.optimizer.dag | |
org.apache.flink.optimizer.plan | |
org.apache.flink.optimizer.plantranslate | |
org.apache.flink.optimizer.traversals |
This package contains the various traversals over the program plan and the
optimizer DAG (directed acyclic graph) that are made in the course of
the optimization.
|
org.apache.flink.util |
Modifier and Type | Method and Description |
---|---|
void |
Plan.accept(Visitor<Operator<?>> visitor)
Traverses the job depth first from all data sinks on towards the sources.
|
Modifier and Type | Method and Description |
---|---|
void |
DualInputOperator.accept(Visitor<Operator<?>> visitor) |
void |
GenericDataSinkBase.accept(Visitor<Operator<?>> visitor)
Accepts the visitor and applies it this instance.
|
void |
GenericDataSourceBase.accept(Visitor<Operator<?>> visitor)
Accepts the visitor and applies it this instance.
|
void |
SingleInputOperator.accept(Visitor<Operator<?>> visitor)
Accepts the visitor and applies it this instance.
|
Modifier and Type | Method and Description |
---|---|
void |
BulkIterationBase.PartialSolutionPlaceHolder.accept(Visitor<Operator<?>> visitor) |
void |
DeltaIterationBase.WorksetPlaceHolder.accept(Visitor<Operator<?>> visitor) |
void |
DeltaIterationBase.SolutionSetPlaceHolder.accept(Visitor<Operator<?>> visitor) |
Modifier and Type | Method and Description |
---|---|
void |
DataSourceNode.accept(Visitor<OptimizerNode> visitor) |
void |
SingleInputNode.accept(Visitor<OptimizerNode> visitor) |
void |
TwoInputNode.accept(Visitor<OptimizerNode> visitor) |
void |
AbstractPartialSolutionNode.accept(Visitor<OptimizerNode> visitor) |
abstract void |
OptimizerNode.accept(Visitor<OptimizerNode> visitor)
This method implements the visit of a depth-first graph traversing visitor.
|
void |
DataSinkNode.accept(Visitor<OptimizerNode> visitor) |
void |
BulkIterationNode.acceptForStepFunction(Visitor<OptimizerNode> visitor) |
void |
WorksetIterationNode.acceptForStepFunction(Visitor<OptimizerNode> visitor) |
void |
IterationNode.acceptForStepFunction(Visitor<OptimizerNode> visitor) |
Modifier and Type | Method and Description |
---|---|
void |
SolutionSetPlanNode.accept(Visitor<PlanNode> visitor) |
void |
OptimizedPlan.accept(Visitor<PlanNode> visitor)
Applies the given visitor top down to all nodes, starting at the sinks.
|
void |
DualInputPlanNode.accept(Visitor<PlanNode> visitor) |
void |
WorksetPlanNode.accept(Visitor<PlanNode> visitor) |
void |
NAryUnionPlanNode.accept(Visitor<PlanNode> visitor) |
void |
SourcePlanNode.accept(Visitor<PlanNode> visitor) |
void |
BulkPartialSolutionPlanNode.accept(Visitor<PlanNode> visitor) |
void |
SingleInputPlanNode.accept(Visitor<PlanNode> visitor) |
void |
IterationPlanNode.acceptForStepFunction(Visitor<PlanNode> visitor) |
void |
BulkIterationPlanNode.acceptForStepFunction(Visitor<PlanNode> visitor) |
void |
WorksetIterationPlanNode.acceptForStepFunction(Visitor<PlanNode> visitor) |
Modifier and Type | Class and Description |
---|---|
class |
JobGraphGenerator
This component translates the optimizer's resulting
OptimizedPlan
to a JobGraph . |
Modifier and Type | Class and Description |
---|---|
class |
BinaryUnionReplacer
A traversal that collects cascading binary unions into a single n-ary
union operator.
|
class |
BranchesVisitor
This traversal of the optimizer DAG computes the information needed to track
branches and joins in the data flow.
|
class |
GraphCreatingVisitor
This traversal creates the optimizer DAG from a program.
|
class |
IdAndEstimatesVisitor
This traversal of the optimizer DAG assigns IDs to each node (in a pre-order fashion),
and calls each node to compute its estimates.
|
class |
InterestingPropertyVisitor
Visitor that computes the interesting properties for each node in the optimizer DAG.
|
class |
PlanFinalizer
This visitor traverses the selected execution plan and finalizes it:
The graph of nodes is double-linked (links from child to parent are inserted).
If unions join static and dynamic paths, the cache is marked as a memory consumer.
Relative memory fractions are assigned to all nodes.
All nodes are collected into a set.
|
class |
RangePartitionRewriter |
class |
StaticDynamicPathIdentifier
A traversal that goes over the program data flow of an iteration and makes the nodes
that depend on the partial solution (the data set recomputed in each iteration) as "dynamic"
and the other nodes as "static".
|
class |
StepFunctionValidator
A traversal that checks if the Workset of a delta iteration is used in the data flow
of its step function.
|
class |
UnionParallelismAndForwardEnforcer
Enforces that all union nodes have the same parallelism as their successor (there must be only one!)
and that the union node and its successor are connected by a forward ship strategy.
|
Modifier and Type | Method and Description |
---|---|
void |
Visitable.accept(Visitor<T> visitor)
Contains the logic to invoke the visitor and continue the traversal.
|
Copyright © 2014–2019 The Apache Software Foundation. All rights reserved.