org.drools.compiler.rule.builder.ForallBuilder Maven / Gradle / Ivy
The newest version!
/*
* Copyright 2006 Red Hat, Inc. and/or its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.drools.compiler.rule.builder;
import org.drools.drl.ast.descr.BaseDescr;
import org.drools.drl.ast.descr.ExistsDescr;
import org.drools.drl.ast.descr.ForallDescr;
import org.drools.drl.ast.descr.NotDescr;
import org.drools.drl.ast.descr.PatternDescr;
import org.drools.base.rule.Forall;
import org.drools.base.rule.GroupElement;
import org.drools.base.rule.Pattern;
import org.drools.base.rule.RuleConditionElement;
public class ForallBuilder
implements
RuleConditionBuilder {
public RuleConditionElement build(final RuleBuildContext context,
final BaseDescr descr,
final Pattern prefixPattern) {
return build( context, descr );
}
public RuleConditionElement build(final RuleBuildContext context,
final BaseDescr descr) {
final ForallDescr forallDescr = (ForallDescr) descr;
if (forallDescr.isSinglePattern()) {
PatternDescr pattern = (PatternDescr) forallDescr.getDescrs().get(0);
NotDescr notDescr = new NotDescr( pattern.negateConstraint() );
RuleConditionBuilder builder = (RuleConditionBuilder) context.getDialect().getBuilder( notDescr.getClass() );
return builder.build( context, notDescr );
}
BaseDescr selfJoin = forallDescr.getSelfJoinConstraint();
if (selfJoin != null) {
// transforms a self join forall in the form
// forall( $t : Type( constraints1 ) Type( this == $t, constraints2 ) )
// into
// exists( Type( constraints1 ) ) and not( Type( constraints1, !constraints2 ) )
GroupElement transformedForall = new GroupElement();
PatternDescr p1 = (PatternDescr) forallDescr.getDescrs().get(0);
PatternDescr p2 = (PatternDescr) forallDescr.getDescrs().get(1);
ExistsDescr existDescr = new ExistsDescr( p1 );
RuleConditionBuilder existsBuilder = (RuleConditionBuilder) context.getDialect().getBuilder( existDescr.getClass() );
transformedForall.addChild( existsBuilder.build( context, existDescr ) );
NotDescr notDescr = new NotDescr( p1 );
p2.removeConstraint( selfJoin );
p2.negateConstraint().getConstraint().getDescrs().forEach( p1::addConstraint );
RuleConditionBuilder notBuilder = (RuleConditionBuilder) context.getDialect().getBuilder( notDescr.getClass() );
transformedForall.addChild( notBuilder.build( context, notDescr ) );
return transformedForall;
}
final PatternBuilder patternBuilder = (PatternBuilder) context.getDialect().getBuilder( PatternDescr.class );
final Pattern basePattern = (Pattern) patternBuilder.build( context,
forallDescr.getBasePattern() );
if ( basePattern == null ) {
return null;
}
final Forall forall = new Forall( basePattern );
// adding the newly created forall CE to the build stack
// this is necessary in case of local declaration usage
context.getDeclarationResolver().pushOnBuildStack( forall );
for ( BaseDescr baseDescr : forallDescr.getRemainingPatterns() ) {
final Pattern anotherPattern = (Pattern) patternBuilder.build( context,
(PatternDescr) baseDescr );
forall.addRemainingPattern( anotherPattern );
}
if ( forallDescr.getDescrs().size() == 1 ) {
// An optimization for unlinking, where we allow unlinking if the resulting 'not' node has no constraints
// we need to record this here, due to getRemainingPatterns injecting "this == " + BASE_IDENTIFIER $__forallBaseIdentifier
// which we wish to ignore
PatternDescr p = ( PatternDescr ) forallDescr.getDescrs().get( 0 );
if ( p.getConstraint().getDescrs().isEmpty() ) {
forall.setEmptyBetaConstraints( true );
}
}
// poping the forall
context.getDeclarationResolver().popBuildStack();
return forall;
}
}