com.scudata.dw.ColumnFilter Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of esproc Show documentation
SPL(Structured Process Language) A programming language specially for structured data computing.
The newest version!
package com.scudata.dw;

import com.scudata.expression.Constant;
import com.scudata.expression.Expression;
import com.scudata.expression.Node;
import com.scudata.expression.UnknownSymbol;
import com.scudata.expression.operator.Equals;
import com.scudata.expression.operator.Greater;
import com.scudata.expression.operator.NotEquals;
import com.scudata.expression.operator.NotGreater;
import com.scudata.expression.operator.NotSmaller;
import com.scudata.expression.operator.Smaller;
import com.scudata.util.Variant;

public class ColumnFilter extends IFilter {
	private Object rightValue;
	private int operator;

	public ColumnFilter(ColumnMetaData column, int priority, int operator, Object rightValue) {
		super(column, priority);
		this.operator = operator;
		this.rightValue = rightValue;
	}
	
	public ColumnFilter(String column, int priority, int operator, Object rightValue) {
		columnName = column;
		this.priority = priority;
		this.operator = operator;
		this.rightValue = rightValue;
	}
	
	public ColumnFilter(ColumnMetaData column, int priority, int operator, Object rightValue, Node node) {
		super(column, priority);
		this.operator = operator;
		this.rightValue = rightValue;
		initExp();
	}

	public boolean match(Object value) {
		switch (operator) {
		case EQUAL:
			return Variant.isEquals(value, rightValue);
		case GREATER:
			return Variant.compare(value, rightValue, true) > 0;
		case GREATER_EQUAL:
			return Variant.compare(value, rightValue, true) >= 0;
		case LESS:
			return Variant.compare(value, rightValue, true) < 0;
		case LESS_EQUAL:
			return Variant.compare(value, rightValue, true) <= 0;
		default: //NOT_EQUAL:
			return !Variant.isEquals(value, rightValue);
		}
	}
	
	public boolean match(Object minValue, Object maxValue) {
		switch (operator) {
		case EQUAL:
			return Variant.compare(minValue, rightValue, true) <= 0 && Variant.compare(maxValue, rightValue, true) >= 0;
		case GREATER:
			return Variant.compare(maxValue, rightValue, true) > 0;
		case GREATER_EQUAL:
			return Variant.compare(maxValue, rightValue, true) >= 0;
		case LESS:
			return Variant.compare(minValue, rightValue, true) < 0;
		case LESS_EQUAL:
			return Variant.compare(minValue, rightValue, true) <= 0;
		default: //NOT_EQUAL:
			return !Variant.isEquals(minValue, rightValue) || !Variant.isEquals(maxValue, rightValue);
		}
	}
	
	/**
	 * ???еĶ???ƥ??
	 */
	public boolean matchAll(Object minValue, Object maxValue) {
		switch (operator) {
		case EQUAL:
			return Variant.compare(minValue, rightValue, true) == 0 && Variant.compare(maxValue, rightValue, true) == 0;
		case GREATER:
			return Variant.compare(minValue, rightValue, true) > 0;
		case GREATER_EQUAL:
			return Variant.compare(minValue, rightValue, true) >= 0;
		case LESS:
			return Variant.compare(maxValue, rightValue, true) < 0;
		case LESS_EQUAL:
			return Variant.compare(maxValue, rightValue, true) <= 0;
		default: //NOT_EQUAL:
			return !Variant.isEquals(minValue, rightValue) && !Variant.isEquals(maxValue, rightValue);
		}
	}
	
	public Object getRightValue() {
		return rightValue;
	}

	public void setRightValue(Object rightValue) {
		this.rightValue = rightValue;
	}

	public int getOperator() {
		return operator;
	}

	public void setOperator(int operator) {
		this.operator = operator;
	}
	
	public void initExp() {
		if (exp == null) {
			Node node;
			switch (operator) {
			case EQUAL:
				node = new Equals();
				break;
			case GREATER:
				node = new Greater();
				break;
			case GREATER_EQUAL:
				node = new NotSmaller();
				break;
			case LESS:
				node = new Smaller();
				break;
			case LESS_EQUAL:
				node = new NotGreater();
				break;
			default: //NOT_EQUAL:
				node = new NotEquals();
			}
			
			node.setLeft(new UnknownSymbol(column.getColName()));
			node.setRight(new Constant(rightValue));
			exp = new Expression(node);
		}
	}
}