com.sun.tools.xjc.model.Multiplicity Maven / Gradle / Ivy
Show all versions of jaxb-xjc Show documentation
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
*
* Copyright (c) 1997-2017 Oracle and/or its affiliates. All rights reserved.
*
* The contents of this file are subject to the terms of either the GNU
* General Public License Version 2 only ("GPL") or the Common Development
* and Distribution License("CDDL") (collectively, the "License"). You
* may not use this file except in compliance with the License. You can
* obtain a copy of the License at
* https://oss.oracle.com/licenses/CDDL+GPL-1.1
* or LICENSE.txt. See the License for the specific
* language governing permissions and limitations under the License.
*
* When distributing the software, include this License Header Notice in each
* file and include the License file at LICENSE.txt.
*
* GPL Classpath Exception:
* Oracle designates this particular file as subject to the "Classpath"
* exception as provided by Oracle in the GPL Version 2 section of the License
* file that accompanied this code.
*
* Modifications:
* If applicable, add the following below the License Header, with the fields
* enclosed by brackets [] replaced by your own identifying information:
* "Portions Copyright [year] [name of copyright owner]"
*
* Contributor(s):
* If you wish your version of this file to be governed by only the CDDL or
* only the GPL Version 2, indicate your decision by adding "[Contributor]
* elects to include this software in this distribution under the [CDDL or GPL
* Version 2] license." If you don't indicate a single choice of license, a
* recipient has the option to distribute your version of this file under
* either the CDDL, the GPL Version 2 or to extend the choice of license to
* its licensees as provided above. However, if you add GPL Version 2 code
* and therefore, elected the GPL Version 2 license, then the option applies
* only if the new code is made subject to such option by the copyright
* holder.
*/
package com.sun.tools.xjc.model;
import java.math.BigInteger;
/**
* represents a possible number of occurence.
*
* Usually, denoted by a pair of integers like (1,1) or (5,10).
* A special value "unbounded" is allowed as the upper bound.
*
*
* For example, (0,unbounded) corresponds to the '*' occurence of DTD.
* (0,1) corresponds to the '?' occurence of DTD.
*
* @author
* Kohsuke KAWAGUCHI
*/
public final class Multiplicity {
public final BigInteger min;
public final BigInteger max; // null is used to represent "unbounded".
public static Multiplicity create(BigInteger min, BigInteger max ) {
if (BigInteger.ZERO.equals(min) && max==null) return STAR;
if (BigInteger.ONE.equals(min) && max==null) return PLUS;
if (max!=null) {
if(BigInteger.ZERO.equals(min) && BigInteger.ZERO.equals(max)) return ZERO;
if(BigInteger.ZERO.equals(min) && BigInteger.ONE.equals(max)) return OPTIONAL;
if(BigInteger.ONE.equals(min) && BigInteger.ONE.equals(max)) return ONE;
}
return new Multiplicity(min, max);
}
public static Multiplicity create(int min, Integer max ) {
return Multiplicity.create(BigInteger.valueOf(min), BigInteger.valueOf(max.intValue()));
}
private Multiplicity(BigInteger min, BigInteger max) {
this.min = min;
this.max = max;
}
private Multiplicity(int min, int max) {
this(BigInteger.valueOf(min), BigInteger.valueOf(max));
}
private Multiplicity(int min, Integer max) {
this(BigInteger.valueOf(min), (max == null) ? null : BigInteger.valueOf(max));
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Multiplicity)) return false;
Multiplicity that = (Multiplicity) o;
if (!this.min.equals(that.min)) return false;
if (this.max != null ? !this.max.equals(that.max) : that.max != null) return false;
return true;
}
@Override
public int hashCode() {
return min.add(max).intValue();
}
/** returns true if the multiplicity is (1,1). */
public boolean isUnique() {
if(max==null) return false;
return BigInteger.ONE.equals(min) && BigInteger.ONE.equals(max);
}
/** returns true if the multiplicity is (0,1) */
public boolean isOptional() {
if(max==null) return false;
return BigInteger.ZERO.equals(min) && BigInteger.ONE.equals(max);
}
/** returns true if the multiplicity is (0,1) or (1,1). */
public boolean isAtMostOnce() {
if(max==null) return false;
return max.compareTo(BigInteger.ONE)<=0;
}
/** returns true if the multiplicity is (0,0). */
public boolean isZero() {
if(max==null) return false;
return BigInteger.ZERO.equals(max);
}
/**
* Returns true if the multiplicity represented by this object
* completely includes the multiplicity represented by the
* other object. For example, we say [1,3] includes [1,2] but
* [2,4] doesn't include [1,3].
*/
public boolean includes( Multiplicity rhs ) {
if (rhs.min.compareTo(min) == -1) return false;
if (max==null) return true;
if (rhs.max==null) return false;
return rhs.max.compareTo(max) <= 0;
}
/**
* Returns the string representation of the 'max' property.
* Either a number or a token "unbounded".
*/
public String getMaxString() {
if(max==null) return "unbounded";
else return max.toString();
}
/** gets the string representation.
* mainly debug purpose.
*/
@Override
public String toString() {
return "("+min+','+getMaxString()+')';
}
/** the constant representing the (0,0) multiplicity. */
public static final Multiplicity ZERO = new Multiplicity(0,0);
/** the constant representing the (1,1) multiplicity. */
public static final Multiplicity ONE = new Multiplicity(1,1);
/** the constant representing the (0,1) multiplicity. */
public static final Multiplicity OPTIONAL = new Multiplicity(0,1);
/** the constant representing the (0,unbounded) multiplicity. */
public static final Multiplicity STAR = new Multiplicity(0,null);
/** the constant representing the (1,unbounded) multiplicity. */
public static final Multiplicity PLUS = new Multiplicity(1,null);
// arithmetic methods
public static Multiplicity choice( Multiplicity lhs, Multiplicity rhs ) {
return create(
lhs.min.min(rhs.min),
(lhs.max==null || rhs.max==null) ? null : lhs.max.max(rhs.max) );
}
public static Multiplicity group( Multiplicity lhs, Multiplicity rhs ) {
return create(
lhs.min.add(rhs.min),
(lhs.max==null || rhs.max==null) ? null : lhs.max.add(rhs.max) );
}
public static Multiplicity multiply( Multiplicity lhs, Multiplicity rhs ) {
BigInteger min = lhs.min.multiply(rhs.min);
BigInteger max;
if (isZero(lhs.max) || isZero(rhs.max))
max = BigInteger.ZERO;
else
if (lhs.max==null || rhs.max==null)
max = null;
else
max = lhs.max.multiply(rhs.max);
return create(min,max);
}
private static boolean isZero(BigInteger i) {
return (i != null && BigInteger.ZERO.equals(i));
}
public static Multiplicity oneOrMore( Multiplicity c ) {
if(c.max==null) return c; // (x,*) => (x,*)
if(BigInteger.ZERO.equals(c.max)) return c; // (0,0) => (0,0)
else return create( c.min, null ); // (x,y) => (x,*)
}
public Multiplicity makeOptional() {
if (BigInteger.ZERO.equals(min)) return this;
return create(BigInteger.ZERO, max);
}
public Multiplicity makeRepeated() {
if (max==null || BigInteger.ZERO.equals(max)) return this; // (0,0)* = (0,0) and (n,unbounded)* = (n,unbounded)
return create(min,null);
}
}