Examples with AbstractTreeTraverseCallback org.kie.workbench.common.stunner.core.graph.processing.traverse.tree.AbstractTreeTraverseCallback used on opensource projects

Example 1 with AbstractTreeTraverseCallback

use of org.kie.workbench.common.stunner.core.graph.processing.traverse.tree.AbstractTreeTraverseCallback in project kie-wb-common by kiegroup.

the class ConnectorParentsMatchContainmentHandler method evaluateSingleContainment.

@SuppressWarnings("unchecked")
private void evaluateSingleContainment(final DefaultRuleViolations result, final RuleExtension rule, final NodeContainmentContext context, final Node<? extends Definition<?>, ? extends Edge> candidate) {
    final GraphEvaluationState state = context.getState();
    final Graph<?, ? extends Node> graph = context.getState().getGraph();
    final String connectorId = rule.getId();
    // Walk throw the graph and evaluate connector source and target nodes parent match.
    treeWalkTraverseProcessor.traverse(graph, candidate, new AbstractTreeTraverseCallback<Graph, Node, Edge>() {

        @Override
        public boolean startNodeTraversal(final Node node) {
            // Process incoming edges into the node as well.
            final List<? extends Edge> inEdges = node.getInEdges();
            if (null != inEdges) {
                inEdges.stream().forEach(this::process);
            }
            return true;
        }

        @Override
        public boolean startEdgeTraversal(final Edge edge) {
            return process(edge);
        }

        private boolean process(final Edge edge) {
            final Optional<String> eId = getId(definitionManager, edge);
            if (eId.isPresent() && connectorId.equals(eId.get())) {
                final Node sourceNode = state.getConnectionState().getSource(edge);
                final Node targetNode = state.getConnectionState().getTarget(edge);
                final boolean valid = new ParentTypesMatcher(() -> definitionManager, e -> getParent(context, e), rule.getTypeArguments()).matcher().test(sourceNode, targetNode);
                if (!valid) {
                    addViolation(edge.getUUID(), rule, result);
                }
            }
            return true;
        }
    });
}

Example 2 with AbstractTreeTraverseCallback

use of org.kie.workbench.common.stunner.core.graph.processing.traverse.tree.AbstractTreeTraverseCallback in project kie-wb-common by kiegroup.

the class GraphValidatorImpl method validate.

/**
 * Performs the validation for the <code>graph</code> instance.
 * @param graph The instance to validate.
 * @param aRuleSet An optional rule set instance to validate against it. If not present, the default
 * rule set for the the graph will be used.
 * @param graphValidatorConsumer An optional consumer for the graph instance when is being validated.
 * @param nodeValidatorConsumer An optional consumer each node instance when being validated.
 * @param edgeValidatorConsumer An optional consumer each edge instance when being validated.
 * @param resultConsumer The consumer for all the resulting validation violations produced during the
 * validator for the graph, and all of its nodes and edges. It's being called once the
 * validation has been completed.
 */
@SuppressWarnings("unchecked")
void validate(final Graph graph, final Optional<RuleSet> aRuleSet, final Optional<BiConsumer<Graph, Collection<RuleViolation>>> graphValidatorConsumer, final Optional<BiConsumer<Node, Collection<RuleViolation>>> nodeValidatorConsumer, final Optional<BiConsumer<Edge, Collection<RuleViolation>>> edgeValidatorConsumer, Consumer<Collection<RuleViolation>> resultConsumer) {
    final RuleSet ruleSet = aRuleSet.orElse(getRuleSet(graph));
    final ViolationsSet violations = new ViolationsSet();
    final StatelessGraphContextBuilder contextBuilder = new StatelessGraphContextBuilder(graph);
    treeWalkTraverseProcessor.traverse(graph, new AbstractTreeTraverseCallback<org.kie.workbench.common.stunner.core.graph.Graph, Node, Edge>() {

        private final Stack<Node> currentParents = new Stack<Node>();

        @Override
        public void startGraphTraversal(final org.kie.workbench.common.stunner.core.graph.Graph graph) {
            super.startGraphTraversal(graph);
            currentParents.clear();
            // Evaluate the graph's cardinality rules.
            final Set<RuleViolation> graphCardinalityViolations = violations.addViolations(evaluateCardinality(contextBuilder, ruleSet));
            graphValidatorConsumer.ifPresent(g -> g.accept(graph, graphCardinalityViolations));
        }

        @Override
        public boolean startEdgeTraversal(final Edge edge) {
            super.startEdgeTraversal(edge);
            final Object content = edge.getContent();
            final ViolationsSet edgeViolations = new ViolationsSet();
            if (content instanceof Child) {
                this.currentParents.push(edge.getSourceNode());
            } else if (content instanceof View) {
                final Optional<Node<? extends View<?>, ? extends Edge>> sourceOpt = Optional.ofNullable(edge.getSourceNode());
                final Optional<Node<? extends View<?>, ? extends Edge>> targetOpt = Optional.ofNullable(edge.getTargetNode());
                // Check not empty connections.
                final Optional<RuleViolation> emptyConnectionViolation = evaluateNotEmptyConnections(edge, sourceOpt, targetOpt);
                emptyConnectionViolation.ifPresent(edgeViolations::add);
                // Evaluate connection rules.
                edgeViolations.addViolations(evaluateConnection(contextBuilder, ruleSet, edge, sourceOpt, targetOpt));
                // Evaluate connector cardinality rules for this edge.
                if (null != edge.getTargetNode()) {
                    edgeViolations.addViolations(evaluateIncomingEdgeCardinality(contextBuilder, ruleSet, edge));
                }
                if (null != edge.getSourceNode()) {
                    edgeViolations.addViolations(evaluateOutgoingEdgeCardinality(contextBuilder, ruleSet, edge));
                }
            } else if (content instanceof Dock) {
                final Node parent = edge.getSourceNode();
                final Node docked = edge.getTargetNode();
                // Evaluate docking rules for the source & target nodes.
                edgeViolations.addViolations(evaluateDocking(contextBuilder, ruleSet, parent, docked));
            }
            edgeValidatorConsumer.ifPresent(c -> c.accept(edge, edgeViolations));
            violations.addAll(edgeViolations);
            return true;
        }

        @Override
        public void endEdgeTraversal(final Edge edge) {
            super.endEdgeTraversal(edge);
            if (edge.getContent() instanceof Child) {
                this.currentParents.pop();
            }
        }

        @Override
        public boolean startNodeTraversal(final Node node) {
            super.startNodeTraversal(node);
            final Collection<RuleViolation> nodeViolations = evaluateNode(node, currentParents.isEmpty() ? null : currentParents.peek());
            nodeValidatorConsumer.ifPresent(c -> c.accept(node, nodeViolations));
            return true;
        }

        @Override
        public void endGraphTraversal() {
            super.endGraphTraversal();
            // Finished - feed the consumer instance.
            resultConsumer.accept(violations);
        }

        private Collection<RuleViolation> evaluateNode(final Node node, final Node parent) {
            // Evaluate containment rules for this node.
            return violations.addViolations(evaluateContainment(ruleSet, contextBuilder, null != parent ? parent : graph, node));
        }
    });
}

Example 3 with AbstractTreeTraverseCallback

use of org.kie.workbench.common.stunner.core.graph.processing.traverse.tree.AbstractTreeTraverseCallback in project kie-wb-common by kiegroup.

the class GraphUtils method computeGraphHashCode.

@SuppressWarnings("all")
public static int computeGraphHashCode(GraphImpl graph) {
    final int[] result = { 0 };
    new TreeWalkTraverseProcessorImpl().traverse(graph, new AbstractTreeTraverseCallback<Graph, Node, Edge>() {

        @Override
        public boolean startEdgeTraversal(final Edge edge) {
            super.startEdgeTraversal(edge);
            final Object content = edge.getContent();
            result[0] = combineHashCodes(result[0], content.hashCode());
            if (edge.getContent() instanceof ViewConnector) {
                Optional<Connection> sourceConnection = ((ViewConnector) edge.getContent()).getSourceConnection();
                sourceConnection.ifPresent(c -> result[0] = combineHashCodes(result[0], c.hashCode()));
                Optional<Connection> targetConnection = ((ViewConnector) edge.getContent()).getTargetConnection();
                targetConnection.ifPresent(c -> result[0] = combineHashCodes(result[0], c.hashCode()));
            }
            return true;
        }

        @Override
        public boolean startNodeTraversal(final Node node) {
            super.startNodeTraversal(node);
            result[0] = combineHashCodes(result[0], node.hashCode());
            if (!(node.getContent() instanceof DefinitionSet) && node.getContent() instanceof Definition) {
                Object def = ((Definition) (node.getContent())).getDefinition();
                result[0] = combineHashCodes(result[0], def.hashCode());
            }
            if (node.getContent() instanceof HasBounds) {
                Bounds bounds = ((HasBounds) node.getContent()).getBounds();
                result[0] = combineHashCodes(result[0], bounds.hashCode());
            }
            return true;
        }
    });
    return result[0];
}