All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.exactpro.sf.common.util.Range Maven / Gradle / Ivy

There is a newer version: 3.4.260
Show newest version
/******************************************************************************
 * Copyright 2009-2018 Exactpro (Exactpro Systems Limited)
 *
 * 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 com.exactpro.sf.common.util;

import java.util.ArrayList;
import java.util.List;

/**
 * Valid values:
 * [-20 ..-17], (-15..-11),  [-9..-5), (-3..-1], 1, 3-5, [7..9], 11-
 * @author dmitry.guriev
 *
 */
public class Range {

	private String origRange;
    private final List operators;

	public static Range newInstance(String s)
	{
		if (s == null) {
			throw new NullPointerException("Range argument cannot be null.");
		}

		Range range = new Range();
		range.origRange = s;
		range.parseRange(s);
		return range;
	}

	private Range()
	{
		this.operators = new ArrayList();
	}

	@Override
	public String toString()
	{
        return origRange;
	}

	public String toStringEx()
	{
		StringBuilder sb = new StringBuilder();

        for(int i = 0; i < operators.size(); i++)
		{
			sb.append("(");
            Operator op = operators.get(i);
            sb.append(op);
            sb.append(i + 1 != operators.size() ? ") && " : ")");
		}
		
		return sb.toString();
	}
	
	public boolean contain(long n)
	{
        if(operators.isEmpty()) {
			return false;
		}
		
		for (Operator op : operators)
		{
            if(op.match(n)) {
                return true;
            }
		}
		return false;
	}

	public boolean notContain(long n)
	{
        if(operators.isEmpty()) {
			return true;
		}

		for (Operator op : operators)
		{
            if(op.match(n)) {
                return false;
            }
		}
		return true;
	}

	private void parseRange(String s)
	{
		String[] arr = s.split(",");
		for (int i=0; i n2) {
					throw new InvalidRangeException("Invalid interval: "+interval);
				}

				if (n1 == n2 && firstChar == '(' && lastChar == ')')
				{
					return null;
				}

				OP_AND c = new OP_AND();
				if (firstChar == '[') {
					c.add(new Condition_GreaterOrEqual(n1));
				} else if (firstChar == '(') {
					c.add(new Condition_Greater(n1));
				} else {
					throw new InvalidRangeException("Invalid open interval char '"+firstChar+"' in "+interval);
				}
				if (lastChar == ']') {
					c.add(new Condition_LessOrEqual(n2));
				} else if (lastChar == ')') {
					c.add(new Condition_Less(n2));
				} else {
					throw new InvalidRangeException("Invalid close interval char '"+lastChar+"' in "+interval);
				}
				return c;
			} catch (NumberFormatException e) {
				throw new InvalidRangeException("Invalid numbers in interval: "+interval);
			}
		}

		if (s.endsWith("-"))
		{
            if(!isLast) {
				throw new InvalidRangeException("Only last interval can be specified without endpoint: "+interval);
			}

			try {
				long n = Long.parseLong(s.substring(0, s.length()-1));
				OP_AND c = new OP_AND();
				c.add(new Condition_GreaterOrEqual(n));
				return c;
			} catch (NumberFormatException e) {
				throw new InvalidRangeException("Invalid numbers in interval: "+interval);
			}
		}

		if (s.contains("-"))
		{
			String[] arr = s.split("-");
			if (arr.length != 2) {
				throw new InvalidRangeException("Invalid interval: "+interval);
			}
			try {
				long n1 = Long.parseLong(arr[0]);
				long n2 = Long.parseLong(arr[1]);

				if (n1 > n2) {
					throw new InvalidRangeException("Invalid numbers in interval: "+interval);
				}

				OP_AND c = new OP_AND();
				c.add(new Condition_GreaterOrEqual(n1));
				c.add(new Condition_LessOrEqual(n2));
				return c;
			} catch (NumberFormatException e) {
				throw new InvalidRangeException("Invalid numbers in interval: "+interval);
			}
		}

		try {
			long n = Long.parseLong(s);
			OP_AND c = new OP_AND();
			c.add(new Condition_Equal(n));
			return c;
		} catch (NumberFormatException e) {
			throw new InvalidRangeException("Invalid numbers in interval: "+interval);
		}
	}

	protected abstract class AbstractCondition
	{
		protected long number;
		abstract boolean checkCondition(long n);
	}

	protected class Condition_Less extends AbstractCondition
	{
		protected Condition_Less(long n) {
			this.number = n;
		}

		@Override
		public boolean checkCondition(long n) {
            return n < number;
		}
		
		@Override
		public String toString() {
            return "X < " + number;
		}
	}

	protected class Condition_LessOrEqual extends AbstractCondition
	{
		protected Condition_LessOrEqual(long n) {
			this.number = n;
		}

		@Override
		protected boolean checkCondition(long n) {
            return n <= number;
		}

		@Override
		public String toString() {
            return "X <= " + number;
		}
	}

	protected class Condition_Equal extends AbstractCondition
	{
		protected Condition_Equal(long n) {
			this.number = n;
		}

		@Override
		protected boolean checkCondition(long n) {
            return n == number;
		}

		@Override
		public String toString() {
            return "X == " + number;
		}
	}

	protected class Condition_NotEqual extends AbstractCondition
	{
		protected Condition_NotEqual(long n) {
			this.number = n;
		}

		@Override
		protected boolean checkCondition(long n) {
            return n != number;
		}

		@Override
		public String toString() {
            return "X != " + number;
		}
	}

	protected class Condition_GreaterOrEqual extends AbstractCondition
	{
		protected Condition_GreaterOrEqual(long n) {
			this.number = n;
		}

		@Override
		protected boolean checkCondition(long n) {
            return n >= number;
		}

		@Override
		public String toString() {
            return "X >= " + number;
		}
	}

	protected class Condition_Greater extends AbstractCondition
	{
		protected Condition_Greater(long n) {
			this.number = n;
		}

		@Override
		protected boolean checkCondition(long n) {
            return n > number;
		}

		@Override
		public String toString() {
            return "X > " + number;
		}
	}

	protected abstract class Operator
	{
		protected List conditions;
		protected Operator() {
			this.conditions = new ArrayList();
		}
		protected abstract boolean match(long n);
		protected void add(AbstractCondition cond) {
            conditions.add(cond);
		}
	}

	protected class OP_AND extends Operator
	{

        @Override
		protected boolean match(long n)
		{
            for(AbstractCondition a : conditions)
			{
				if (!a.checkCondition(n)) {
					return false;
				}
			}
			return true;
		}
		
		@Override
		public String toString()
		{
			StringBuilder sb = new StringBuilder();
            for(int i = 0; i < conditions.size(); i++) {
                sb.append(conditions.get(i));
                if(i + 1 != conditions.size()) {
					sb.append(" && ");
				}
			}
			return sb.toString();
		}
	}

	protected class OP_OR extends Operator
	{

        @Override
		protected boolean match(long n)
		{
            for(AbstractCondition a : conditions)
			{
				if (a.checkCondition(n)) {
					return true;
				}
			}
			return false;
		}

		@Override
		public String toString()
		{
			StringBuilder sb = new StringBuilder();
            for(int i = 0; i < conditions.size(); i++) {
                sb.append(conditions.get(i));
                if(i + 1 != conditions.size()) {
					sb.append(" || ");
				}
			}
			return sb.toString();
		}

	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy