Package org.drools.ruleflow.core

Examples of org.drools.ruleflow.core.Node

82
83
84
85
86
87
88
89
90
91
92
        boolean startNodeFound = false;
        boolean endNodeFound = false;
        final Node[] nodes = process.getNodes();
        for ( int i = 0; i < nodes.length; i++ ) {
            final Node node = nodes[i];
            if ( node instanceof StartNode ) {
                final StartNode startNode = (StartNode) node;
                startNodeFound = true;
                if ( startNode.getTo() == null ) {
                    errors.add( new RuleFlowProcessValidationErrorImpl( RuleFlowProcessValidationError.START_NODE_WITHOUT_OUTGOING_NODES ) );
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
    private void checkAllNodesConnectedToStart(final RuleFlowProcess process,
                                               final List errors) {
        final Map processNodes = new HashMap();
        final Node[] nodes = process.getNodes();
        for ( int i = 0; i < nodes.length; i++ ) {
            final Node node = nodes[i];
            processNodes.put( node,
                              Boolean.FALSE );
        }

        final Node start = process.getStart();
        if ( start != null ) {
            processNode( start,
                         processNodes );
        }

        for ( final Iterator it = processNodes.keySet().iterator(); it.hasNext(); ) {
            final Node node = (Node) it.next();
            if ( Boolean.FALSE.equals( processNodes.get( node ) ) ) {
                errors.add( new RuleFlowProcessValidationErrorImpl( RuleFlowProcessValidationError.ALL_NODES_CONNECTED_TO_START, "name = " + node.getName() ) );
            }
        }
    }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
        this.variables = new ArrayList();
    }

    public StartNode getStart() {
        for ( final Iterator it = this.nodes.values().iterator(); it.hasNext(); ) {
            final Node node = (Node) it.next();
            if ( node instanceof StartNode ) {
                return (StartNode) node;
            }
        }
        return null;
View Full Code Here
88
89
90
91
92
93
94
95
96
97
    public void removeNode(final Node node) {
        if ( node == null ) {
            throw new IllegalArgumentException( "Node is null" );
        }
        final Node n = (Node) this.nodes.remove( new Long( node.getId() ) );
        if ( n == null ) {
            throw new IllegalArgumentException( "Unknown node: " + node );
        }
    }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
        switch ( join.getType() ) {
            case Join.TYPE_XOR :
                triggerCompleted();
                break;
            case Join.TYPE_AND :
                final Node node = getProcessInstance().getRuleFlowProcess().getNode( from.getNodeId() );
                final Integer count = (Integer) this.triggers.get( node );
                if ( count == null ) {
                    this.triggers.put( node,
                                       new Integer( 1 ) );
                } else {
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
        this.variables = new ArrayList();
    }

    public StartNode getStart() {
        for ( final Iterator it = this.nodes.values().iterator(); it.hasNext(); ) {
            final Node node = (Node) it.next();
            if ( node instanceof StartNode ) {
                return (StartNode) node;
            }
        }
        return null;
View Full Code Here
87
88
89
90
91
92
93
94
95
96
    public void removeNode(final Node node) {
        if ( node == null ) {
            throw new IllegalArgumentException( "Node is null" );
        }
        final Node n = (Node) this.nodes.remove( new Long( node.getId() ) );
        if ( n == null ) {
            throw new IllegalArgumentException( "Unknown node: " + node );
        }
    }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
        boolean startNodeFound = false;
        boolean endNodeFound = false;
        final Node[] nodes = process.getNodes();
        for ( int i = 0; i < nodes.length; i++ ) {
            final Node node = nodes[i];
            if ( node instanceof StartNode ) {
                final StartNode startNode = (StartNode) node;
                startNodeFound = true;
                if ( startNode.getTo() == null ) {
                    errors.add( new RuleFlowProcessValidationErrorImpl( RuleFlowProcessValidationError.START_NODE_WITHOUT_OUTGOING_NODES ) );
View Full Code Here
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
    private void checkAllNodesConnectedToStart(final RuleFlowProcess process,
                                               final List errors) {
        final Map processNodes = new HashMap();
        final Node[] nodes = process.getNodes();
        for ( int i = 0; i < nodes.length; i++ ) {
            final Node node = nodes[i];
            processNodes.put( node,
                              Boolean.FALSE );
        }

        final Node start = process.getStart();
        if ( start != null ) {
            processNode( start,
                         processNodes );
        }

        for ( final Iterator it = processNodes.keySet().iterator(); it.hasNext(); ) {
            final Node node = (Node) it.next();
            if ( Boolean.FALSE.equals( processNodes.get( node ) ) ) {
                errors.add( new RuleFlowProcessValidationErrorImpl( RuleFlowProcessValidationError.ALL_NODES_CONNECTED_TO_START ) );
            }
        }
    }
View Full Code Here
TOP

Related Classes of org.drools.ruleflow.core.Node

  • org.drools.ruleflow.core.impl.RuleFlowProcessImpl
  • org.drools.ruleflow.core.impl.RuleFlowProcessValidatorImpl
  • org.drools.ruleflow.instance.impl.RuleFlowJoinInstanceImpl
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.