/*
* Copyright (c) 2010 StockPlay development team
* All rights reserved.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
package com.kapti.filter.condition;
import com.kapti.exceptions.FilterException;
import com.kapti.filter.Convertable;
import com.kapti.filter.data.Data;
import com.kapti.filter.data.DataKey;
import com.kapti.filter.graph.Edge;
import com.kapti.filter.graph.Graph;
import com.kapti.filter.graph.Node;
import java.util.List;
/**
* Een groter dan controle. Deze conditie heeft twee parameters nodig, waarbij
* de eerste een string moet zijn (die de key die moet gecontroleerd worden
* vastlegt.
*/
public class ConditionStrictGreater extends Condition {
//
// Constructie
//
public ConditionStrictGreater(List<Convertable> iParameters) {
super(iParameters);
}
public ConditionStrictGreater(ConditionStrictGreater iObject) {
super(iObject);
}
//
// Methods
//
public static Class[] getSignature() {
return new Class[] {DataKey.class, Data.class};
}
@Override
public final Object compile() throws FilterException {
ConditionStrictGreater tConverter = (ConditionStrictGreater) getConverter();
return tConverter.process((DataKey)getData(0), getData(1));
}
@Override
public Node addNode(Graph iGraph) {
// Self
Node tNodeSelf = super.addNode(iGraph);
tNodeSelf.setAttribute("label", "strict greater");
// Children
Node tNodeLeft = getData(0).addNode(iGraph);
Node tNodeRight = getData(1).addNode(iGraph);
// Edges
iGraph.addElement(new Edge(tNodeSelf, tNodeLeft));
iGraph.addElement(new Edge(tNodeSelf, tNodeRight));
return tNodeSelf;
}
//
// Interface
//
public Object process(DataKey a, Data b) throws FilterException {
throw new RuntimeException();
}
}