/**
* Copyright (c) 2013, Institute of Information Systems (Sven Groppe and contributors of LUPOSDATE), University of Luebeck
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
* following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice, this list of conditions and the following
* disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the
* following disclaimer in the documentation and/or other materials provided with the distribution.
* - Neither the name of the University of Luebeck nor the names of its contributors may be used to endorse or promote
* products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package lupos.optimizations.logical.rules.generated;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import lupos.optimizations.logical.rules.generated.runtime.Rule;
import lupos.engine.operators.BasicOperator;
import lupos.engine.operators.OperatorIDTuple;
public class BoundinFilterUnderAddRule extends Rule {
private boolean deleteAll = false;
private lupos.engine.operators.singleinput.filter.Filter f = null;
private lupos.engine.operators.singleinput.AddBinding a = null;
private lupos.engine.operators.BasicOperator[] o = null;
private int _dim_0 = -1;
private boolean _checkPrivate0(BasicOperator _op) {
if(_op.getClass() != lupos.engine.operators.singleinput.AddBinding.class) {
return false;
}
this.a = (lupos.engine.operators.singleinput.AddBinding) _op;
List<OperatorIDTuple> _succedingOperators_1_0 = _op.getSucceedingOperators();
if(_succedingOperators_1_0.size() != 1) {
return false;
}
for(OperatorIDTuple _sucOpIDTup_1_0 : _succedingOperators_1_0) {
if(_sucOpIDTup_1_0.getOperator().getPrecedingOperators().size() != 1) {
break;
}
if(_sucOpIDTup_1_0.getOperator().getClass() != lupos.engine.operators.singleinput.filter.Filter.class) {
continue;
}
this.f = (lupos.engine.operators.singleinput.filter.Filter) _sucOpIDTup_1_0.getOperator();
List<OperatorIDTuple> _succedingOperators_2_0 = _sucOpIDTup_1_0.getOperator().getSucceedingOperators();
this._dim_0 = -1;
this.o = new lupos.engine.operators.BasicOperator[_succedingOperators_2_0.size()];
for(OperatorIDTuple _sucOpIDTup_2_0 : _succedingOperators_2_0) {
this._dim_0 += 1;
if(!this._checkPrivate1(_sucOpIDTup_2_0.getOperator())) {
return false;
}
}
return true;
}
return false;
}
private boolean _checkPrivate1(BasicOperator _op) {
if(!(_op instanceof lupos.engine.operators.BasicOperator)) {
return false;
}
this.o[this._dim_0] = (lupos.engine.operators.BasicOperator) _op;
return true;
}
public BoundinFilterUnderAddRule() {
this.startOpClass = lupos.engine.operators.singleinput.AddBinding.class;
this.ruleName = "Bound in Filter Under Add";
}
protected boolean check(BasicOperator _op) {
boolean _result = this._checkPrivate0(_op);
if(_result) {
// additional check method code...
lupos.sparql1_1.Node n = this.f.getNodePointer();
boolean negated = false;
if(n.jjtGetNumChildren() > 0) {
n = n.jjtGetChild(0);
while(n instanceof lupos.sparql1_1.ASTNotNode){
negated = !negated;
n = n.jjtGetChild(0);
}
if(n instanceof lupos.sparql1_1.ASTBoundFuncNode){
n = n.jjtGetChild(0);
if(n instanceof lupos.sparql1_1.ASTVar) {
lupos.datastructures.items.Variable var = new lupos.datastructures.items.Variable(((lupos.sparql1_1.ASTVar) n).getName());
this.deleteAll = negated;
return var.equals(this.a.getVar());
}
}
}
return false;
}
return _result;
}
protected void replace(HashMap<Class<?>, HashSet<BasicOperator>> _startNodes) {
// remove obsolete connections...
int[] _label_o_id = null;
int _label_o_id_count = 0;
_label_o_id = new int[this.o.length];
for(lupos.engine.operators.BasicOperator _child : this.o) {
_label_o_id[_label_o_id_count] = this.f.getOperatorIDTuple(_child).getId();
_label_o_id_count += 1;
this.f.removeSucceedingOperator(_child);
_child.removePrecedingOperator(this.f);
}
this.a.removeSucceedingOperator(this.f);
this.f.removePrecedingOperator(this.a);
// add new operators...
// add new connections...
_label_o_id_count = 0;
for(lupos.engine.operators.BasicOperator _child : this.o) {
this.a.addSucceedingOperator(new OperatorIDTuple(_child, _label_o_id[_label_o_id_count]));
_child.addPrecedingOperator(this.a);
_label_o_id_count += 1;
}
// delete unreachable operators...
this.deleteOperatorWithoutParentsRecursive(this.f, _startNodes);
// additional replace method code...
if(this.deleteAll){
this.deleteOperatorWithParentsAndChildren(this.a ,_startNodes);
}
}
}