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




122
123
124
125
126
127
128
129
130
131
132
133
134
135     }


    public Activation getNext() {
        Activation activation = null;
        while ( this.index <= lastIndex ) {
            LinkedList list = this.array[this.index];            
            if ( list != null ) {
                activation = (Activation) ((LinkedListEntry)list.removeFirst()).getObject();
                if ( list.isEmpty()) {
                    this.array[this.index++] = null;
                }
                this.size--;
                break;
            }

View Full Code Here





159
160
161
162
163
164
165
166
167
168
169
170
171 
    public Activation[] getActivations() {
        Activation[] activations = new Activation[this.size];
        int j = 0;
        for ( int i = 0; i < this.array.length; i++ ) {;
            LinkedList list = this.array[i];
            if ( list != null ) {
                Iterator it = list.iterator();
                Activation activation = ( Activation ) ((LinkedListEntry)it.next()).getObject();
                while ( activation != null) {
                    activations[j++] = activation;
                    activation = ( Activation ) it.next();
                }

View Full Code Here


112
113
114
115
116
117
118
119 
    /* (non-Javadoc)
     * @see org.drools.common.BetaNodeConstraints#getConstraints()
     */
    public LinkedList getConstraints() {
        final LinkedList list = new LinkedList();
        return list;
    }
 

View Full Code Here


156
157
158
159
160
161
162
163
164
165         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


240
241
242
243
244
245
246
247
248
249 
    /* (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();
        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++ ) {
            // Determine  if this constraint is indexable

View Full Code Here


182
183
184
185
186
187
188
189
190 
    /* (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


283
284
285
286
287
288
289
290
291
292
293 
    /* (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 ) );
        return list;
    }
 

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);
        }


        // still null, so see if it already exists

View Full Code Here


239
240
241
242
243
244
245
246
247
248 
    /* (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



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.