Package org.drools.reteoo

Examples of org.drools.reteoo.ReteTuple

62
63
64
65
66
67
68
69
70
71
72
        final RuleBase ruleBase = RuleBaseFactory.newRuleBase();
        final WorkingMemory wm = ruleBase.newStatefulSession();

        final Person p = new Person("mark", "", 31);
        final InternalFactHandle f0 = (InternalFactHandle) wm.insert( p );
        final ReteTuple tuple = new ReteTuple( f0 );

        SalienceBuilder salienceBuilder = new MVELSalienceBuilder();
        salienceBuilder.build( context );
               
        assertEquals( 51, context.getRule().getSalience().getValue( tuple, wm ) );
View Full Code Here
74
75
76
77
78
79
80
81
    }

    public boolean isAllowedCachedLeft(final ContextEntry context,
                                       final Object object) {
        // object MUST be a ReteTuple
        final ReteTuple tuple = ((ReteTuple) object).getSubTuple( ((TupleStartEqualsConstraintContextEntry) context).compareSize );
        return ((TupleStartEqualsConstraintContextEntry) context).left.equals( tuple );
    }
View Full Code Here
70
71
72
73
74
75
76
77
    }

    public boolean isAllowedCachedLeft(final ContextEntry context,
                                       final Object object) {
        // object MUST be a ReteTuple
        final ReteTuple tuple = ((ReteTuple) object).getSubTuple( ((TupleStartEqualsConstraintContextEntry) context).compareSize );
        return ((TupleStartEqualsConstraintContextEntry) context).left.equals( tuple );
    }
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
        FieldIndexEntry current = previous;
        while ( current != null ) {
            final FieldIndexEntry next = (FieldIndexEntry) current.next;
            if ( current.matches( tuple,
                                  hashCode ) ) {
                final ReteTuple old = current.remove( tuple );
                this.factSize--;
                // If the FactEntryIndex is empty, then remove it from the hash table
                if ( current.first == null ) {
                    if ( previous == current ) {
                        this.table[index] = next;
View Full Code Here
342
343
344
345
346
347
348
349
350
351
352
353
354
355
            tuple.setNext( this.first );
            this.first = tuple;
        }

        public ReteTuple get(final ReteTuple tuple) {
            ReteTuple current = this.first;
            while ( current != null ) {
                if ( tuple.equals( current ) ) {
                    return current;
                }
                current = (ReteTuple) current.getNext();
            }
            return null;
        }
View Full Code Here
353
354
355
356
357
358
359
360
361
362
363
364
365
366
            }
            return null;
        }

        public ReteTuple remove(final ReteTuple tuple) {
            ReteTuple previous = this.first;
            ReteTuple current = previous;
            while ( current != null ) {
                final ReteTuple next = (ReteTuple) current.getNext();
                if ( tuple.equals( current ) ) {
                    if ( this.first == current ) {
                        this.first = next;
                    } else {
                        previous.setNext( next );
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
    public ReteTuple get(final ReteTuple tuple) {
        final int hashCode = tuple.hashCode();
        final int index = indexOf( hashCode,
                                   this.table.length );

        ReteTuple current = (ReteTuple) this.table[index];
        while ( current != null ) {
            if ( hashCode == current.hashCode() && tuple.equals( current ) ) {
                return current;
            }
            current = (ReteTuple) current.getNext();
        }
        return null;
    }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
    public ReteTuple remove(final ReteTuple tuple) {
        final int hashCode = tuple.hashCode();
        final int index = indexOf( hashCode,
                                   this.table.length );

        ReteTuple previous = (ReteTuple) this.table[index];
        ReteTuple current = previous;
        while ( current != null ) {
            final ReteTuple next = (ReteTuple) current.getNext();
            if ( hashCode == current.hashCode() && tuple.equals( current ) ) {
                if ( previous == current ) {
                    this.table[index] = next;
                } else {
                    previous.setNext( next );
View Full Code Here
TOP

Related Classes of org.drools.reteoo.ReteTuple

  • org.drools.common.PropagationContextImpl
  • org.drools.common.TupleStartEqualsConstraint
  • org.drools.FactHandle
  • org.drools.rule.builder.dialect.mvel.MVELConsequenceBuilderTest
  • org.drools.rule.builder.dialect.mvel.MVELEvalBuilderTest
  • org.drools.rule.builder.dialect.mvel.MVELPredicateBuilderTest
  • org.drools.rule.builder.dialect.mvel.MVELReturnValueBuilderTest
  • org.drools.rule.builder.dialect.mvel.MVELSalienceBuilderTest
  • org.drools.util.FieldIndexHashTableTest
  • org.drools.util.TupleHashTable
    • 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.