private void recursiveValidate(ConfigProblemSetBuilder psBuilder, Node node, NodeFilter filter) { int runCount = validatorCollection.runAllValidators(psBuilder, node); log.info("Ran " + runCount + " validators for node \"" + node.getNodeName() + "\" with class \"" + node.getClass().getSimpleName() + "\""); NodeIterator children = node.getChildren(); Node recurse = children.getNext(filter); while (recurse != null) { recursiveValidate(psBuilder, recurse, filter); recurse = children.getNext(filter); } } }
private void recursiveValidate(ConfigProblemSetBuilder psBuilder, Node node, NodeFilter filter) { int runCount = validatorCollection.runAllValidators(psBuilder, node); log.info("Ran " + runCount + " validators for node \"" + node.getNodeName() + "\" with class \"" + node.getClass().getSimpleName() + "\""); NodeIterator children = node.getChildren(); Node recurse = children.getNext(filter); while (recurse != null) { recursiveValidate(psBuilder, recurse, filter); recurse = children.getNext(filter); } } }
/** * @param node is the node whose children we want to find. * @param filter is the filter to lookup by. * @return the children of the input node matching the filter. */ private List<Node> getMatchingNodes(Node node, NodeFilter filter) { log.trace("Checking for leaf nodes of node " + node.getNodeName()); List<Node> result = new ArrayList<>(); NodeIterator children = node.getChildren(); Node recurse = children.getNext(filter); while (recurse != null) { result.addAll(getMatchingNodes(recurse, filter)); recurse = children.getNext(filter); } // If we have visited this node, it must have matched the filter. result.add(node); return result; }
/** * @param node is the node whose children we want to find. * @param filter is the filter to lookup by. * @return the children of the input node matching the filter. */ private List<Node> getMatchingNodes(Node node, NodeFilter filter) { log.trace("Checking for leaf nodes of node " + node.getNodeName()); List<Node> result = new ArrayList<>(); NodeIterator children = node.getChildren(); Node recurse = children.getNext(filter); while (recurse != null) { result.addAll(getMatchingNodes(recurse, filter)); recurse = children.getNext(filter); } // If we have visited this node, it must have matched the filter. result.add(node); return result; }
@Override public NodeIterator getChildren() { List<Node> nodes = new ArrayList<Node>(); NodeIterator children = NodeIteratorFactory.makeReflectiveIterator(this); Node child = children.getNext(); while (child != null) { if (!child.getNodeName().equals("oracle") && !child.getNodeName().equals("oraclebmcs")) { nodes.add(child); } child = children.getNext(); } nodes.add(OracleProvider.mergeOracleBMCSProvider(oracle, oraclebmcs)); return NodeIteratorFactory.makeListIterator(nodes); }
@Override public NodeIterator getChildren() { List<Node> nodes = new ArrayList<Node>(); NodeIterator children = NodeIteratorFactory.makeReflectiveIterator(this); Node child = children.getNext(); while (child != null) { if (!child.getNodeName().equals("oracle") && !child.getNodeName().equals("oraclebmcs")) { nodes.add(child); } child = children.getNext(); } nodes.add(OraclePersistentStore.mergeOracleBMCSPersistentStore(oracle, oraclebmcs)); return NodeIteratorFactory.makeListIterator(nodes); }
@Override public NodeIterator getChildren() { List<Node> nodes = new ArrayList<Node>(); NodeIterator children = NodeIteratorFactory.makeReflectiveIterator(this); Node child = children.getNext(); while (child != null) { if (!child.getNodeName().equals("oracle") && !child.getNodeName().equals("oraclebmcs")) { nodes.add(child); } child = children.getNext(); } nodes.add(OraclePersistentStore.mergeOracleBMCSPersistentStore(oracle, oraclebmcs)); return NodeIteratorFactory.makeListIterator(nodes); }
@Override public NodeIterator getChildren() { List<Node> nodes = new ArrayList<Node>(); NodeIterator children = NodeIteratorFactory.makeReflectiveIterator(this); Node child = children.getNext(); while (child != null) { if (!child.getNodeName().equals("oracle") && !child.getNodeName().equals("oraclebmcs")) { nodes.add(child); } child = children.getNext(); } nodes.add(OracleProvider.mergeOracleBMCSProvider(oracle, oraclebmcs)); return NodeIteratorFactory.makeListIterator(nodes); }