Java tutorial
/* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. * * Copyright 1997-2007 Sun Microsystems, Inc. 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://glassfish.dev.java.net/public/CDDL+GPL.html * or glassfish/bootstrap/legal/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 glassfish/bootstrap/legal/LICENSE.txt. * Sun designates this particular file as subject to the "Classpath" exception * as provided by Sun in the GPL Version 2 section of the License file that * accompanied this code. If applicable, add the following below the License * Header, with the fields enclosed by brackets [] replaced by your own * identifying information: "Portions Copyrighted [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 hudson.plugins.simpleupdatesite; import java.util.StringTokenizer; import org.apache.commons.lang.math.NumberUtils; /** * Immutable representation of a dot or '-'-separated digits (such as "1.0.1" or * "1.0-52"). * * {@link VersionNumber}s are {@link Comparable}. * * <h2>Special tokens</h2> * <p> * We allow a component to be not just a number, but also "ea", "ea1", "ea2". * "ea" is treated as "ea0", and eaN < M for any M > 0. * * <p> * '*' is also allowed as a component, and '*' > M for any M > 0. * * <p> * 'SNAPSHOT' is also allowed as a component, and "N.SNAPSHOT" is interpreted as * "N-1.*" * * <pre> * 2.0.* > 2.0.1 > 2.0.1-SNAPSHOT > 2.0.0.99 > 2.0.0 > 2.0.ea > 2.0 * </pre> * * @author Kohsuke Kawaguchi (kohsuke.kawaguchi@sun.com) * @since 1.139 */ public class VersionNumber implements Comparable<VersionNumber> { private final int[] digits; /** * Parses a string like "1.0.2" into the version number. * * @throws IllegalArgumentException * if the parsing fails. */ public VersionNumber(String num) { StringTokenizer tokens = new StringTokenizer(num, ".-"); this.digits = new int[tokens.countTokens()]; if (this.digits.length < 2) { throw new IllegalArgumentException("Failed to parse " + num + " as version number"); } int i = 0; while (tokens.hasMoreTokens()) { String token = tokens.nextToken().toLowerCase(); if (token.equals("*")) { this.digits[i++] = 1000; } else if (token.startsWith("snapshot")) { this.digits[i - 1]--; this.digits[i++] = 1000; break; } else if (token.startsWith("ea")) { if (token.length() == 2) { this.digits[i++] = -1000; // just "ea" } else { this.digits[i++] = -1000 + Integer.parseInt(token.substring(2)); // "eaNNN" } } else { if (NumberUtils.isNumber(token)) { this.digits[i++] = Integer.parseInt(token); } } } } @Override public String toString() { StringBuffer buf = new StringBuffer(); for (int i = 0; i < this.digits.length; i++) { if (i != 0) { buf.append('.'); } buf.append(Integer.toString(this.digits[i])); } return buf.toString(); } public boolean isOlderThan(VersionNumber rhs) { return compareTo(rhs) < 0; } public boolean isNewerThan(VersionNumber rhs) { return compareTo(rhs) > 0; } @Override public boolean equals(Object o) { if (!(o instanceof VersionNumber)) { return false; } return compareTo((VersionNumber) o) == 0; } @Override public int hashCode() { int x = 0; for (int i : this.digits) { x = x << 1 | i; } return x; } public int compareTo(VersionNumber rhs) { for (int i = 0;; i++) { if (i == this.digits.length && i == rhs.digits.length) { return 0; // equals } if (i == this.digits.length) { return -1; // rhs is larger } if (i == rhs.digits.length) { return 1; } int r = this.digits[i] - rhs.digits[i]; if (r != 0) { return r; } } } }