IntenseFinance/nosqlbench
3
0
Fork 0
mirror of https://github.com/nosqlbench/nosqlbench.git synced 2025-01-11 00:12:04 -06:00
Code Issues Packages Projects Releases Wiki Activity

implement predicate based component visitor

Browse Source
This commit is contained in:
Jonathan Shook 2024-01-11 00:40:44 -06:00
parent bca0caba13
commit 325676fa6b
1 changed files with 35 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
nb-api/src/main/java/io/nosqlbench/nb/api/components/core/NBComponentTraversal.java
View File

@ -19,6 +19,7 @@ package io.nosqlbench.nb.api.components.core;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.function.Predicate;
public class NBComponentTraversal {
@ -29,6 +30,7 @@ public class NBComponentTraversal {
public static void visitDepthFirst(NBComponent component, Visitor visitor) {
visitDepthFirst(component,visitor,0);
}
private static void visitDepthFirst(NBComponent component, Visitor visitor, int depth) {
visitor.visit(component,depth);
List<NBComponent> children = component.getChildren();
@ -37,6 +39,35 @@ public class NBComponentTraversal {
}
}
/**
* Visits each component. If the component does NOT match the predicate, then NON-matching visitor
* method applies. Otherwise the MATCHing visitor method applies and the search stops at that node,
* continuing again for every sibling.
* @param component The component to test and visit
* @param visitor The methods for non-matching and matching nodes
* @param predicate A test to determine whether to apply the matching predicate and stop searching deeper
*/
public static void visitDepthFirstLimited(NBComponent component, FilterVisitor visitor, Predicate<NBComponent> predicate) {
visitDepthFirstLimited(component, visitor, 0, predicate);
}
private static void visitDepthFirstLimited(NBComponent component, FilterVisitor visitor, int depth, Predicate<NBComponent> predicate) {
if (predicate.test(component)) {
visitor.visitMatching(component,depth);
return;
} else {
visitor.visitNonMatching(component,depth);
List<NBComponent> children = component.getChildren();
for (NBComponent child : children) {
visitDepthFirstLimited(child,visitor,depth+1,predicate);
}
}
}
public static Iterator<NBComponent> traverseBreadth(NBComponent component) {
return new IterBreadthFirst(component);
}
@ -86,4 +117,8 @@ public class NBComponentTraversal {
public interface Visitor {
void visit(NBComponent component, int depth);
}
public interface FilterVisitor {
void visitMatching(NBComponent component, int depth);
void visitNonMatching(NBComponent component, int depth);
}
}