Package io.trino.sql.planner.optimizations

Class PlanNodeSearcher

java.lang.Object

io.trino.sql.planner.optimizations.PlanNodeSearcher

public class PlanNodeSearcher
extends Object

Method Summary

Modifier and Type	Method	Description
int	count()
List<PlanNode>	findAll()	Return a list of matching nodes ordered as in pre-order traversal of the plan tree.
Optional<PlanNode>	findFirst()
PlanNode	findOnlyElement()
boolean	matches()
PlanNodeSearcher	recurseOnlyWhen(Predicate<PlanNode> skipOnly)
PlanNode	removeAll()
PlanNode	removeFirst()
PlanNode	replaceAll(PlanNode newPlanNode)
PlanNode	replaceFirst(PlanNode newPlanNode)
static PlanNodeSearcher	searchFrom(PlanNode node)
static PlanNodeSearcher	searchFrom(PlanNode node, Lookup lookup)	Use it in optimizer Rule only if you truly do not have a better option
PlanNodeSearcher	where(Predicate<PlanNode> where)
final PlanNodeSearcher	whereIsInstanceOfAny(Class<? extends PlanNode>... classes)
final PlanNodeSearcher	whereIsInstanceOfAny(List<Class<? extends PlanNode>> classes)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

searchFrom

public static PlanNodeSearcher searchFrom(PlanNode node)

searchFrom

public static PlanNodeSearcher searchFrom(PlanNode node,
 Lookup lookup)

Use it in optimizer Rule only if you truly do not have a better option

TODO: replace it with a support for plan (physical) properties in rules pattern matching

whereIsInstanceOfAny

@SafeVarargs
public final PlanNodeSearcher whereIsInstanceOfAny(Class<? extends PlanNode>... classes)

whereIsInstanceOfAny

public final PlanNodeSearcher whereIsInstanceOfAny(List<Class<? extends PlanNode>> classes)

where

public PlanNodeSearcher where(Predicate<PlanNode> where)

recurseOnlyWhen

public PlanNodeSearcher recurseOnlyWhen(Predicate<PlanNode> skipOnly)

findFirst

public Optional<PlanNode> findFirst()

findAll

public List<PlanNode> findAll()

Return a list of matching nodes ordered as in pre-order traversal of the plan tree.

findOnlyElement

public PlanNode findOnlyElement()

removeAll

public PlanNode removeAll()

removeFirst

public PlanNode removeFirst()

replaceAll

public PlanNode replaceAll(PlanNode newPlanNode)

replaceFirst

public PlanNode replaceFirst(PlanNode newPlanNode)

matches

public boolean matches()

count

public int count()