/**
* Copyright 2005 JBoss Inc
*
* 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.common;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import java.util.ArrayList;
import java.util.List;
import org.drools.RuleBaseConfiguration;
import org.drools.base.evaluators.Operator;
import org.drools.core.util.LeftTupleIndexHashTable;
import org.drools.core.util.LeftTupleList;
import org.drools.core.util.LinkedList;
import org.drools.core.util.LinkedListEntry;
import org.drools.core.util.RightTupleIndexHashTable;
import org.drools.core.util.RightTupleList;
import org.drools.core.util.AbstractHashTable.FieldIndex;
import org.drools.reteoo.BetaMemory;
import org.drools.reteoo.LeftTuple;
import org.drools.reteoo.LeftTupleMemory;
import org.drools.reteoo.RightTupleMemory;
import org.drools.rule.ContextEntry;
import org.drools.rule.VariableConstraint;
import org.drools.spi.BetaNodeFieldConstraint;
public class TripleBetaConstraints
implements
BetaConstraints {
/**
*
*/
private static final long serialVersionUID = 510l;
private BetaNodeFieldConstraint constraint0;
private BetaNodeFieldConstraint constraint1;
private BetaNodeFieldConstraint constraint2;
private boolean indexed0;
private boolean indexed1;
private boolean indexed2;
public TripleBetaConstraints() {
}
public TripleBetaConstraints(final BetaNodeFieldConstraint[] constraints,
final RuleBaseConfiguration conf) {
this( constraints,
conf,
false );
}
public TripleBetaConstraints(final BetaNodeFieldConstraint[] constraints,
final RuleBaseConfiguration conf,
final boolean disableIndexing) {
if ( disableIndexing || (!conf.isIndexLeftBetaMemory() && !conf.isIndexRightBetaMemory()) ) {
this.indexed0 = false;
this.indexed1 = false;
this.indexed2 = false;
} else {
final int depth = conf.getCompositeKeyDepth();
// Determine if this constraints are indexable
final boolean i0 = isIndexable( constraints[0] );
final boolean i1 = isIndexable( constraints[1] );
final boolean i2 = isIndexable( constraints[2] );
if ( depth >= 1 && i0 ) {
this.indexed0 = true;
}
if ( i1 ) {
if ( depth >= 1 && !this.indexed0 ) {
this.indexed0 = true;
swap( constraints,
1,
0 );
} else if ( depth >= 2 ) {
this.indexed1 = true;
}
}
if ( i2 ) {
if ( depth >= 1 && !this.indexed0 ) {
this.indexed0 = true;
swap( constraints,
2,
0 );
} else if ( depth >= 2 && this.indexed0 && !this.indexed1 ) {
this.indexed1 = true;
swap( constraints,
2,
1 );
} else if ( depth >= 3 ) {
this.indexed2 = true;
}
}
}
this.constraint0 = constraints[0];
this.constraint1 = constraints[1];
this.constraint2 = constraints[2];
}
public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException {
constraint0 = (BetaNodeFieldConstraint)in.readObject();
constraint1 = (BetaNodeFieldConstraint)in.readObject();
constraint2 = (BetaNodeFieldConstraint)in.readObject();
indexed0 = in.readBoolean();
indexed1 = in.readBoolean();
indexed2 = in.readBoolean();
}
public void writeExternal(ObjectOutput out) throws IOException {
out.writeObject(constraint0);
out.writeObject(constraint1);
out.writeObject(constraint2);
out.writeBoolean(indexed0);
out.writeBoolean(indexed1);
out.writeBoolean(indexed2);
}
private void swap(final BetaNodeFieldConstraint[] constraints,
final int p1,
final int p2) {
final BetaNodeFieldConstraint temp = constraints[p2];
constraints[p2] = constraints[p1];
constraints[p1] = temp;
}
private boolean isIndexable(final BetaNodeFieldConstraint constraint) {
return SingleBetaConstraints.isIndexable( constraint );
}
/* (non-Javadoc)
* @see org.drools.common.BetaNodeConstraints#updateFromTuple(org.drools.reteoo.ReteTuple)
*/
public void updateFromTuple(final ContextEntry[] context,
final InternalWorkingMemory workingMemory,
final LeftTuple tuple) {
context[0].updateFromTuple( workingMemory,
tuple );
context[1].updateFromTuple( workingMemory,
tuple );
context[2].updateFromTuple( workingMemory,
tuple );
}
/* (non-Javadoc)
* @see org.drools.common.BetaNodeConstraints#updateFromFactHandle(org.drools.common.InternalFactHandle)
*/
public void updateFromFactHandle(final ContextEntry[] context,
final InternalWorkingMemory workingMemory,
final InternalFactHandle handle) {
context[0].updateFromFactHandle( workingMemory,
handle );
context[1].updateFromFactHandle( workingMemory,
handle );
context[2].updateFromFactHandle( workingMemory,
handle );
}
public void resetTuple(final ContextEntry[] context) {
context[0].resetTuple();
context[1].resetTuple();
context[2].resetTuple();
}
public void resetFactHandle(final ContextEntry[] context) {
context[0].resetFactHandle();
context[1].resetFactHandle();
context[2].resetFactHandle();
}
/* (non-Javadoc)
* @see org.drools.common.BetaNodeConstraints#isAllowedCachedLeft(java.lang.Object)
*/
public boolean isAllowedCachedLeft(final ContextEntry[] context,
final InternalFactHandle handle) {
// return ( this.indexed0 || this.constraint0.isAllowedCachedLeft( context0,
// object ) ) && this.constraint1.isAllowedCachedLeft( context1,
// object ) && this.constraint2.isAllowedCachedLeft( context2,
// object );
return (this.indexed0 || this.constraint0.isAllowedCachedLeft( context[0],
handle )) && (this.indexed1 || this.constraint1.isAllowedCachedLeft( context[1],
handle )) && (this.indexed2 || this.constraint2.isAllowedCachedLeft( context[2],
handle ));
}
/* (non-Javadoc)
* @see org.drools.common.BetaNodeConstraints#isAllowedCachedRight(org.drools.reteoo.ReteTuple)
*/
public boolean isAllowedCachedRight(final ContextEntry[] context,
final LeftTuple tuple) {
return this.constraint0.isAllowedCachedRight( tuple,
context[0] ) && this.constraint1.isAllowedCachedRight( tuple,
context[1] ) && this.constraint2.isAllowedCachedRight( tuple,
context[2] );
}
public boolean isIndexed() {
return this.indexed0;
}
public int getIndexCount() {
int count = 0;
if ( this.indexed0 ) {
count++;
}
if ( this.indexed1 ) {
count++;
}
if ( this.indexed2 ) {
count++;
}
return count;
}
public boolean isEmpty() {
return false;
}
public BetaMemory createBetaMemory(final RuleBaseConfiguration conf) {
BetaMemory memory;
final List list = new ArrayList( 2 );
if ( this.indexed0 ) {
final VariableConstraint variableConstraint = (VariableConstraint) this.constraint0;
final FieldIndex index = new FieldIndex( variableConstraint.getFieldExtractor(),
variableConstraint.getRequiredDeclarations()[0],
variableConstraint.getEvaluator() );
list.add( index );
}
if ( this.indexed1 ) {
final VariableConstraint variableConstraint = (VariableConstraint) this.constraint1;
final FieldIndex index = new FieldIndex( variableConstraint.getFieldExtractor(),
variableConstraint.getRequiredDeclarations()[0],
variableConstraint.getEvaluator() );
list.add( index );
}
if ( this.indexed2 ) {
final VariableConstraint variableConstraint = (VariableConstraint) this.constraint2;
final FieldIndex index = new FieldIndex( variableConstraint.getFieldExtractor(),
variableConstraint.getRequiredDeclarations()[0],
variableConstraint.getEvaluator() );
list.add( index );
}
if ( !list.isEmpty() ) {
final FieldIndex[] indexes = (FieldIndex[]) list.toArray( new FieldIndex[list.size()] );
LeftTupleMemory tupleMemory;
if ( conf.isIndexLeftBetaMemory() ) {
tupleMemory = new LeftTupleIndexHashTable( indexes );
} else {
tupleMemory = new LeftTupleList();
}
RightTupleMemory factHandleMemory;
if ( conf.isIndexRightBetaMemory() ) {
factHandleMemory = new RightTupleIndexHashTable( indexes );
} else {
factHandleMemory = new RightTupleList();
}
memory = new BetaMemory( conf.isSequential() ? null : tupleMemory,
factHandleMemory,
this.createContext() );
} else {
memory = new BetaMemory( conf.isSequential() ? null : new LeftTupleList(),
new RightTupleList(),
this.createContext() );
}
return memory;
}
public int hashCode() {
return this.constraint0.hashCode() ^ this.constraint1.hashCode() ^ this.constraint2.hashCode();
}
/* (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;
}
/**
* Determine if another object is equal to this.
*
* @param object
* The object to test.
*
* @return <code>true</code> if <code>object</code> is equal to this,
* otherwise <code>false</code>.
*/
public boolean equals(final Object object) {
if ( this == object ) {
return true;
}
if ( object == null || getClass() != object.getClass() ) {
return false;
}
final TripleBetaConstraints other = (TripleBetaConstraints) object;
if ( this.constraint0 != other.constraint0 && !this.constraint0.equals( other.constraint0 ) ) {
return false;
}
if ( this.constraint1 != other.constraint1 && !this.constraint1.equals( other.constraint1 ) ) {
return false;
}
if ( this.constraint2 != other.constraint2 && !this.constraint2.equals( other.constraint2 ) ) {
return false;
}
return true;
}
public ContextEntry[] createContext() {
return new ContextEntry[]{this.constraint0.createContextEntry(), this.constraint1.createContextEntry(), this.constraint2.createContextEntry()};
}
}