org.apache.flink.util

Interface Visitable<T extends Visitable<T>>

All Known Implementing Classes:

AbstractPartialSolutionNode, AbstractUdfOperator, BinaryUnionNode, BinaryUnionPlanNode, BulkIterationBase, BulkIterationBase.PartialSolutionPlaceHolder, BulkIterationNode, BulkIterationPlanNode, BulkPartialSolutionNode, BulkPartialSolutionPlanNode, CoGroupNode, CoGroupOperatorBase, CoGroupRawNode, CoGroupRawOperatorBase, CrossNode, CrossOperatorBase, DataSinkNode, DataSourceNode, DeltaIterationBase, DeltaIterationBase.SolutionSetPlaceHolder, DeltaIterationBase.WorksetPlaceHolder, DualInputOperator, DualInputPlanNode, FilterNode, FilterOperatorBase, FlatMapNode, FlatMapOperatorBase, GenericDataSinkBase, GenericDataSourceBase, GroupCombineNode, GroupCombineOperatorBase, GroupReduceNode, GroupReduceOperatorBase, InnerJoinOperatorBase, JoinNode, JoinOperatorBase, MapNode, MapOperatorBase, MapPartitionNode, MapPartitionOperatorBase, NAryUnionPlanNode, NoOpBinaryUdfOp, NoOpNode, NoOpUnaryUdfOp, Operator, OptimizedPlan, OptimizerNode, OuterJoinNode, OuterJoinOperatorBase, PartitionNode, PartitionOperatorBase, Plan, PlanBothUnwrappingCoGroupOperator, PlanFilterOperator, PlanLeftUnwrappingCoGroupOperator, PlanNode, PlanProjectOperator, PlanRightUnwrappingCoGroupOperator, PlanUnwrappingGroupCombineOperator, PlanUnwrappingReduceGroupOperator, PlanUnwrappingReduceOperator, PlanUnwrappingSortedGroupCombineOperator, PlanUnwrappingSortedReduceGroupOperator, ReduceNode, ReduceOperatorBase, SingleInputNode, SingleInputOperator, SingleInputPlanNode, SinkJoiner, SinkJoinerPlanNode, SinkPlanNode, SolutionSetNode, SolutionSetPlanNode, SortPartitionNode, SortPartitionOperatorBase, SourcePlanNode, TwoInputNode, UnaryOperatorNode, Union, WorksetIterationNode, WorksetIterationNode.SingleRootJoiner, WorksetIterationPlanNode, WorksetNode, WorksetPlanNode

@Internal
public interface Visitable<T extends Visitable<T>>

This interface marks types as visitable during a traversal. The central method accept(...) contains the logic about how to invoke the supplied Visitor on the visitable object, and how to traverse further.

This concept makes it easy to implement for example a depth-first traversal of a tree or DAG with different types of logic during the traversal. The accept(...) method calls the visitor and then send the visitor to its children (or predecessors). Using different types of visitors, different operations can be performed during the traversal, while writing the actual traversal code only once.

See Also:

Visitor

Method Summary

Modifier and Type	Method and Description
void	accept(Visitor<T> visitor) Contains the logic to invoke the visitor and continue the traversal.

Method Detail

accept

void accept(Visitor<T> visitor)

Contains the logic to invoke the visitor and continue the traversal. Typically invokes the pre-visit method of the visitor, then sends the visitor to the children (or predecessors) and then invokes the post-visit method.

A typical code example is the following:

 public void accept(Visitor<Operator> visitor) {
     boolean descend = visitor.preVisit(this);
     if (descend) {
         if (this.input != null) {
             this.input.accept(visitor);
         }
         visitor.postVisit(this);
     }
 }
 

Parameters:

visitor - The visitor to be called with this object as the parameter.

See Also:

Visitor.preVisit(Visitable), Visitor.postVisit(Visitable)