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



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





144
145
146
147
148
149
150
151
152
153
154
155
156
157         out.writeBoolean( tupleMemoryEnabled );
        super.writeExternal( out );
    }


    public BetaNodeFieldConstraint[] getConstraints() {
        final LinkedList constraints = this.constraints.getConstraints();


        final BetaNodeFieldConstraint[] array = new BetaNodeFieldConstraint[constraints.size()];
        int i = 0;
        for ( LinkedListEntry entry = (LinkedListEntry) constraints.getFirst(); entry != null; entry = (LinkedListEntry) entry.getNext() ) {
            array[i++] = (BetaNodeFieldConstraint) entry.getObject();
        }
        return array;
    }

View Full Code Here


304
305
306
307
308
309
310
311
312
313
314 
    /* (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


131
132
133
134
135
136
137
138
139
140
141
142
143 
        if ( seq > this.lastIndex ) {
            this.lastIndex = seq;
        }


        LinkedList list = this.array[seq];
        if ( list == null ) {
            list = new LinkedList();
            this.array[item.getSequenence()] = list;
        }


        list.add( new LinkedListEntry( activation ) );
    }

View Full Code Here


143
144
145
146
147
148
149
150
151
152
153
154
155
156     }


    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


180
181
182
183
184
185
186
187
188
189
190
191
192 
    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


257
258
259
260
261
262
263
264
265
266 
    /* (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


66
67
68
69
70
71
72
73
74
75
76 
    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


358
359
360
361
362
363
364
365
366
367
368
369 
    /* (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


116
117
118
119
120
121
122
123 
    /* (non-Javadoc)
     * @see org.drools.common.BetaNodeConstraints#getConstraints()
     */
    public LinkedList getConstraints() {
        final LinkedList list = new LinkedList();
        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.