Examples of org.drools.util.LinkedList

org.drools.util.LinkedList
This is a simple linked linked implementation. Each node must implement LinkedListNodeso that it references the node before and after it. This way a node can be removed without having to scan the list to find it. This class does not provide an Iterator implementation as its designed for efficiency and not genericity. There are a number of ways to iterate the list. Simple iterator: for ( LinkedListNode node = list.getFirst(); node != null; node = node.getNext() ) { } Iterator that pops the first entry: for ( LinkedListNode node = list.removeFirst(); node != null; node = list.removeFirst() ) { } @author Mark Proctor @author Bob McWhirter




202
203
204
205
206
207
208
209
210
211         return this.activationNumber;
    }


    public void addLogicalDependency(final LogicalDependency node) {
        if ( this.justified == null ) {
            this.justified = new LinkedList();
        }


        this.justified.add( node );
    }

View Full Code Here





198
199
200
201
202
203
204
205
206 
    /* (non-Javadoc)
     * @see org.drools.common.BetaNodeConstraints#getConstraints()
     */
    public LinkedList getConstraints() {
        final LinkedList list = new LinkedList();
        list.add( new LinkedListEntry( this.constraint ) );
        return list;
    }
 

View Full Code Here


65
66
67
68
69
70
71      * @param name
     *      The RuleFlowGroup name.
     */
    public RuleFlowGroupImpl(final String name) {
        this.name = name;
        this.list = new LinkedList();
    }
 

View Full Code Here


72
73
74
75
76
77
78     
    public RuleFlowGroupImpl(final String name, final boolean active, final boolean autoDeactivate) {
        this.name = name;
        this.active = active;
        this.autoDeactivate = autoDeactivate;
        this.list = new LinkedList();
    }    

View Full Code Here


65
66
67
68
69
70
71      * @param name
     *      The RuleFlowGroup name.
     */
    public RuleFlowGroupImpl(final String name) {
        this.name = name;
        this.list = new LinkedList();
    }
 

View Full Code Here


72
73
74
75
76
77
78     
    public RuleFlowGroupImpl(final String name, final boolean active, final boolean autoDeactivate) {
        this.name = name;
        this.active = active;
        this.autoDeactivate = autoDeactivate;
        this.list = new LinkedList();
    }    

View Full Code Here


256
257
258
259
260
261
262
263
264
265
266                                           final InternalReadAccessor fieldExtractor) {
        FieldIndex fieldIndex = null;


        // is linkedlist null, if so create and add
        if ( this.hashedFieldIndexes == null ) {
            this.hashedFieldIndexes = new LinkedList();
            fieldIndex = new FieldIndex( index,
                                         fieldExtractor );
            this.hashedFieldIndexes.add( fieldIndex );
        }


View Full Code Here


323
324
325
326
327
328
329
330
331
332
333
334 
    /* (non-Javadoc)
     * @see org.drools.common.BetaNodeConstraints#getConstraints()
     */
    public LinkedList getConstraints() {
        final LinkedList list = new LinkedList();
        list.add( new LinkedListEntry( this.constraint0 ) );
        list.add( new LinkedListEntry( this.constraint1 ) );
        list.add( new LinkedListEntry( this.constraint2 ) );
        list.add( new LinkedListEntry( this.constraint3 ) );
        return list;
    }
 

View Full Code Here


229
230
231
232
233
234
235
236
237
238 
    /* (non-Javadoc)
     * @see org.drools.common.BetaNodeConstraints#getConstraints()
     */
    public LinkedList getConstraints() {
        final LinkedList list = new LinkedList();
        list.add( new LinkedListEntry( this.constraint0 ) );
        list.add( new LinkedListEntry( this.constraint1 ) );
        return list;
    }
 

View Full Code Here


65
66
67
68
69
70
71
72
73
74
75     
    public DefaultBetaConstraints(final BetaNodeFieldConstraint[] constraints,
                                  final RuleBaseConfiguration conf,
                                  final boolean disableIndexing ) {
        this.indexed = -1;
        this.constraints = new LinkedList();
        ContextEntry current = null;
        final int depth = conf.getCompositeKeyDepth();


        // First create a LinkedList of constraints, with the indexed constraints first.
        for ( int i = 0, length = constraints.length; i < length; i++ ) {

View Full Code Here



0
1
2
3
4
5
6
7



TOP

Related Classes of org.drools.util.LinkedList

org.drools.common.ActivationGroupImpl
org.drools.common.AgendaItem
org.drools.common.ArrayAgendaGroup
org.drools.common.DefaultBetaConstraints
org.drools.common.DoubleBetaConstraints
org.drools.common.EmptyBetaConstraints
org.drools.common.QuadroupleBetaConstraints
org.drools.common.RuleFlowGroupImpl
org.drools.common.ScheduledAgendaItem
org.drools.common.SimpleAgendaGroup



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.