public class PlanNodeSearcher
extends Object

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`count()`
`<T extends PlanNode> List<T>`	`findAll()`	Return a list of matching nodes ordered as in pre-order traversal of the plan tree.
`<T extends PlanNode> Optional<T>`	`findFirst()`
`<T extends PlanNode> T`	`findOnlyElement()`
`<T extends PlanNode> T`	`findOnlyElement(T defaultValue)`
`<T extends PlanNode> Optional<T>`	`findSingle()`
`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)`

public static PlanNodeSearcher searchFrom(PlanNode node)

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

public PlanNodeSearcher where(Predicate<PlanNode> where)

public PlanNodeSearcher recurseOnlyWhen(Predicate<PlanNode> skipOnly)

public <T extends PlanNode> Optional<T> findFirst()

public <T extends PlanNode> Optional<T> findSingle()

findAll
```
public <T extends PlanNode> List<T> findAll()
```
Return a list of matching nodes ordered as in pre-order traversal of the plan tree.

public <T extends PlanNode> T findOnlyElement()

public <T extends PlanNode> T findOnlyElement(T defaultValue)

public PlanNode replaceAll(PlanNode newPlanNode)

public PlanNode replaceFirst(PlanNode newPlanNode)

Class PlanNodeSearcher