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

org.openl.domain.IntRangeDomain Maven / Gradle / Ivy

The newest version!
/*
 * Created on Apr 28, 2004
 *
 * Developed by OpenRules Inc 2003-2004
 */
package org.openl.domain;

import java.util.Iterator;
import javax.xml.bind.annotation.XmlTransient;

/**
 * @author snshor
 */
public class IntRangeDomain implements IDomain, IIntDomain {
    private class RangeIterator extends AIntIterator {
        private int current;
        private final int step;

        RangeIterator(int step) {
            this.current = min;
            this.step = step;
        }

        @Override
        public boolean hasNext() {
            return current <= max;
        }

        @Override
        public int nextInt() {
            int ret = current;
            current += step;
            return ret;
        }

        @Override
        public int size() {
            return (max - min + 1) / step;
        }

        @Override
        public boolean isResetable() {
            return true;
        }

        @Override
        public void reset() {
            current = min;
        }
    }

    protected final int min;
    protected final int max;

    public IntRangeDomain(int min, int max) {
        this.min = min;
        this.max = max;
    }

    @Override
    public boolean contains(int value) {
        return min <= value && value <= max;
    }

    public boolean containsNumber(Number n) {
        return min <= n.doubleValue() && n.doubleValue() <= max;
    }

    @Override
    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }
        if (!(obj instanceof IntRangeDomain)) {
            return false;
        }

        IntRangeDomain other = (IntRangeDomain) obj;

        return min == other.min && max == other.max;
    }

    @Override
    @XmlTransient
    public IType getElementType() {
        return null;
    }

    @Override
    public int getMax() {
        return max;
    }

    @Override
    public int getMin() {
        return min;
    }

    @Override
    public int hashCode() {
        int hashCode = 1;

        hashCode = 31 * hashCode + min;
        hashCode = 31 * hashCode + max;

        return hashCode;
    }

    @Override
    public IIntIterator intIterator() {
        return new RangeIterator(1);
    }

    public IIntIterator iterate(int step) {
        return new RangeIterator(step);
    }

    @Override
    public Iterator iterator() {
        return intIterator();
    }

    @Override
    public boolean selectObject(Integer n) {
        return containsNumber(n);
    }

    @Override
    public int size() {
        return max - min + 1;
    }

    @Override
    public String toString() {
        if (min == Integer.MIN_VALUE) {
            return "<=" + max;
        } else if (max == Integer.MAX_VALUE) {
            return ">=" + min;
        }

        return "[" + min + ".." + max + "]";
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy