Package org.drools.common

Examples of org.drools.common.BetaConstraints.updateFromTuple()

3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
                    fm.betaMemory.getLeftTupleMemory().add( leftTuple );
                    matches = new LinkedHashMap<Object, RightTuple>();
                    leftTuple.setObject( matches );
                }        

                betaConstraints.updateFromTuple( context,
                                                 wm,
                                                 leftTuple );

                for ( final java.util.Iterator< ? > it = dataProvider.getResults( leftTuple,
                                                                                  wm,
View Full Code Here
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
                final Map<Object, RightTuple> previousMatches = (Map<Object, RightTuple>) leftTuple.getObject();
                final Map<Object, RightTuple> newMatches = new HashMap<Object, RightTuple>();
                leftTuple.setObject( newMatches );

                betaConstraints.updateFromTuple( context,
                                                      wm,
                                                      leftTuple );

                FastIterator rightIt = LinkedList.fastIterator;
                for ( final java.util.Iterator< ? > it = dataProvider.getResults( leftTuple,
View Full Code Here
807
808
809
810
811
812
813
814
815
816
817
                    if ( !(object instanceof DroolsQuery) || !((DroolsQuery) object).isOpen() ) {
                        useLeftMemory = false;
                    }
                }

                constraints.updateFromTuple( contextEntry,
                                             wm,
                                             leftTuple );

                for ( RightTuple rightTuple = notNode.getFirstRightTuple( leftTuple, rtm, context, it ); rightTuple != null; rightTuple = (RightTuple) it.next( rightTuple ) ) {
                    if ( constraints.isAllowedCachedLeft( contextEntry,
View Full Code Here
954
955
956
957
958
959
960
961
962
963
964
                            blocker = null;
                        }
                    }
                }

                constraints.updateFromTuple( contextEntry,
                                             wm,
                                             leftTuple );

                // if we where not blocked before (or changed buckets), or the previous blocker no longer blocks, then find the next blocker
                if ( blocker == null || !constraints.isAllowedCachedLeft( contextEntry,
View Full Code Here
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
                           
                            leftTuple = temp;
                            continue;                       
                        }                       

                        constraints.updateFromTuple( contextEntry,
                                                     wm,
                                                     leftTuple );

                        if ( useComparisonIndex ) {
                            rootBlocker = notNode.getFirstRightTuple( leftTuple, rtm, context, rightIt );
View Full Code Here
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
                            // ignore, as it will get processed via left iteration. Children cannot be processed twice
                            leftTuple = temp;
                            continue;                       
                        }                       
   
                        constraints.updateFromTuple( contextEntry,
                                                     wm,
                                                     leftTuple );

                        if (useComparisonIndex) {
                            rootBlocker = rtm.getFirst( leftTuple, (InternalFactHandle) context.getFactHandle(), it );
View Full Code Here
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
                            // ignore, as it will get processed via left iteration. Children cannot be processed twice
                            leftTuple = temp;
                            continue;                       
                        }
                       
                        constraints.updateFromTuple( contextEntry,
                                                      wm,
                                                      leftTuple );

                        if (useComparisonIndex) {
                            rootBlocker = rtm.getFirst( leftTuple, (InternalFactHandle) context.getFactHandle(), it );
View Full Code Here
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
                    if ( !(object instanceof DroolsQuery) || !((DroolsQuery) object).isOpen() ) {
                        useLeftMemory = false;
                    }
                }

                constraints.updateFromTuple( contextEntry,
                                             wm,
                                             leftTuple );
               
                for ( RightTuple rightTuple = existsNode.getFirstRightTuple(leftTuple, rtm, context, it); rightTuple != null; rightTuple = (RightTuple) it.next(rightTuple)) {
                    if ( constraints.isAllowedCachedLeft( contextEntry,
View Full Code Here
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
                            blocker = null;
                        }
                    }
                }

                constraints.updateFromTuple( contextEntry,
                                             wm,
                                             leftTuple );

                // if we where not blocked before (or changed buckets), or the previous blocker no longer blocks, then find the next blocker
                if ( blocker == null || !constraints.isAllowedCachedLeft( contextEntry,
View Full Code Here
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
                           
                            leftTuple = temp;
                            continue;                       
                        }

                        constraints.updateFromTuple( contextEntry,
                                                     wm,
                                                     leftTuple );

                        if (useComparisonIndex) {
                            rootBlocker = existsNode.getFirstRightTuple( leftTuple, rtm, context, rightIt );
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.