This processor will first search for Nodes in the hierarchy tree with a matching name. These nodes are considered
'equivalent' nodes. Then, all children are matched against the given pattern and depth. All matching
children are then put in the resulti tree.
A processor handling BucketNodeInterfaces.
This processor will first search for Nodes in the hierarchy tree with a matching name. These nodes are considered 'equivalent' nodes. Then, all children are matched against the given pattern and depth. All matching children are then put in the resulti tree.