com.github.autermann.wps.commons.description.InputOccurence Maven / Gradle / Ivy
/*
* Copyright (C) 2013-2015 Christian Autermann
*
* 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 2
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
package com.github.autermann.wps.commons.description;
import static com.google.common.base.Preconditions.checkArgument;
import java.math.BigInteger;
/**
* TODO JavaDoc
*
* @author Christian Autermann
*/
public class InputOccurence {
private final BigInteger min;
private final BigInteger max;
public InputOccurence(BigInteger min, BigInteger max) {
this.min = min == null ? BigInteger.ONE : min;
this.max = max == null ? BigInteger.ONE : max;
checkArgument(this.min.compareTo(BigInteger.ZERO) >= 0, "minimum < 0");
checkArgument(this.max.compareTo(BigInteger.ZERO) > 0, "maximum <= 0");
checkArgument(this.min.compareTo(this.max) <= 0, "minimum > maximum");
}
public BigInteger getMin() {
return this.min;
}
public BigInteger getMax() {
return this.max;
}
public boolean isRequired() {
return this.min.compareTo(BigInteger.ZERO) > 0;
}
public boolean isMultiple() {
return this.max.compareTo(BigInteger.ONE) > 0;
}
public boolean isInBounds(BigInteger occurence) {
return this.min.compareTo(occurence) >= 0 &&
this.max.compareTo(occurence) <= 0;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy