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

org.ow2.proactive.process_tree_killer.VersionNumber Maven / Gradle / Ivy

The newest version!
/*
 * ProActive Parallel Suite(TM):
 * The Open Source library for parallel and distributed
 * Workflows & Scheduling, Orchestration, Cloud Automation
 * and Big Data Analysis on Enterprise Grids & Clouds.
 *
 * Copyright (c) 2007 - 2017 ActiveEon
 * Contact: [email protected]
 *
 * This library is free software: you can redistribute it and/or
 * modify it under the terms of the GNU Affero General Public License
 * as published by the Free Software Foundation: version 3 of
 * the License.
 *
 * 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see .
 *
 * If needed, contact us to obtain a release under GPL Version 2 or 3
 * or a different license than the AGPL.
 */
package org.ow2.proactive.process_tree_killer;

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.Locale;
import java.util.Properties;
import java.util.Stack;


/**
 * Immutable representation of a version number based on the Mercury version numbering scheme.
 *
 * {@link VersionNumber}s are {@link Comparable}.
 *
 * 

Special tokens

*

* 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. * *

* '*' is also allowed as a component, and '*' > M for any M > 0. * *

* 'SNAPSHOT' is also allowed as a component, and "N.SNAPSHOT" is interpreted as "N-1.*" * *

 * 2.0.* > 2.0.1 > 2.0.1-SNAPSHOT > 2.0.0.99 > 2.0.0 > 2.0.ea > 2.0
 * 
* * This class is re-implemented in 1.415. The class was originally introduced in 1.139 * * @since 1.139 * @author Stephen Connolly ([email protected]) * @author Kenney Westerhof ([email protected]) * @author Hervé Boutemy ([email protected]) */ @SuppressWarnings("all") public class VersionNumber implements Comparable { private String value; private String canonical; private ListItem items; private interface Item { public static final int INTEGER_ITEM = 0; public static final int STRING_ITEM = 1; public static final int LIST_ITEM = 2; public static final int WILDCARD_ITEM = 3; public int compareTo(Item item); public int getType(); public boolean isNull(); } /** * Represents a wild-card item in the version item list. */ private static class WildCardItem implements Item { public int compareTo(Item item) { if (item == null) // 1.* ( > 1.99) > 1 return 1; switch (item.getType()) { case INTEGER_ITEM: case LIST_ITEM: case STRING_ITEM: return 1; case WILDCARD_ITEM: return 0; default: return 1; } } public int getType() { return WILDCARD_ITEM; } public boolean isNull() { return false; } @Override public String toString() { return "*"; } } /** * Represents a numeric item in the version item list. */ private static class IntegerItem implements Item { private static final BigInteger BigInteger_ZERO = new BigInteger("0"); private final BigInteger value; public static final IntegerItem ZERO = new IntegerItem(); private IntegerItem() { this.value = BigInteger_ZERO; } public IntegerItem(String str) { this.value = new BigInteger(str); } public int getType() { return INTEGER_ITEM; } public boolean isNull() { return BigInteger_ZERO.equals(value); } public int compareTo(Item item) { if (item == null) { return BigInteger_ZERO.equals(value) ? 0 : 1; // 1.0 == 1, 1.1 > 1 } switch (item.getType()) { case INTEGER_ITEM: return value.compareTo(((IntegerItem) item).value); case STRING_ITEM: return 1; // 1.1 > 1-sp case LIST_ITEM: return 1; // 1.1 > 1-1 case WILDCARD_ITEM: return 0; default: throw new RuntimeException("invalid item: " + item.getClass()); } } public String toString() { return value.toString(); } } /** * Represents a string in the version item list, usually a qualifier. */ private static class StringItem implements Item { private final static String[] QUALIFIERS = { "snapshot", "alpha", "beta", "milestone", "rc", "", "sp" }; private final static List _QUALIFIERS = Arrays.asList(QUALIFIERS); private final static Properties ALIASES = new Properties(); static { ALIASES.put("ga", ""); ALIASES.put("final", ""); ALIASES.put("cr", "rc"); ALIASES.put("ea", "rc"); } /** * A comparable for the empty-string qualifier. This one is used to determine if a given qualifier makes the * version older than one without a qualifier, or more recent. */ private static String RELEASE_VERSION_INDEX = String.valueOf(_QUALIFIERS.indexOf("")); private String value; public StringItem(String value, boolean followedByDigit) { if (followedByDigit && value.length() == 1) { // a1 = alpha-1, b1 = beta-1, m1 = milestone-1 switch (value.charAt(0)) { case 'a': value = "alpha"; break; case 'b': value = "beta"; break; case 'm': value = "milestone"; break; } } this.value = ALIASES.getProperty(value, value); } public int getType() { return STRING_ITEM; } public boolean isNull() { return (comparableQualifier(value).compareTo(RELEASE_VERSION_INDEX) == 0); } /** * Returns a comparable for a qualifier. *

* This method both takes into account the ordering of known qualifiers as well as lexical ordering for unknown * qualifiers. *

* just returning an Integer with the index here is faster, but requires a lot of if/then/else to check for -1 * or QUALIFIERS.size and then resort to lexical ordering. Most comparisons are decided by the first character, * so this is still fast. If more characters are needed then it requires a lexical sort anyway. * * @param qualifier * @return */ public static String comparableQualifier(String qualifier) { int i = _QUALIFIERS.indexOf(qualifier); return i == -1 ? _QUALIFIERS.size() + "-" + qualifier : String.valueOf(i); } public int compareTo(Item item) { if (item == null) { // 1-rc < 1, 1-ga > 1 return comparableQualifier(value).compareTo(RELEASE_VERSION_INDEX); } switch (item.getType()) { case INTEGER_ITEM: return -1; // 1.any < 1.1 ? case STRING_ITEM: return comparableQualifier(value).compareTo(comparableQualifier(((StringItem) item).value)); case LIST_ITEM: return -1; // 1.any < 1-1 case WILDCARD_ITEM: return -1; default: throw new RuntimeException("invalid item: " + item.getClass()); } } public String toString() { return value; } } /** * Represents a version list item. This class is used both for the global item list and for sub-lists (which start * with '-(number)' in the version specification). */ private static class ListItem extends ArrayList implements Item { public int getType() { return LIST_ITEM; } public boolean isNull() { return (size() == 0); } void normalize() { for (ListIterator iterator = listIterator(size()); iterator.hasPrevious();) { Item item = (Item) iterator.previous(); if (item.isNull()) { iterator.remove(); // remove null trailing items: 0, "", empty list } else { break; } } } public int compareTo(Item item) { if (item == null) { if (size() == 0) { return 0; // 1-0 = 1- (normalize) = 1 } Item first = (Item) get(0); return first.compareTo(null); } switch (item.getType()) { case INTEGER_ITEM: return -1; // 1-1 < 1.0.x case STRING_ITEM: return 1; // 1-1 > 1-sp case LIST_ITEM: Iterator left = iterator(); Iterator right = ((ListItem) item).iterator(); while (left.hasNext() || right.hasNext()) { Item l = left.hasNext() ? (Item) left.next() : null; Item r = right.hasNext() ? (Item) right.next() : null; // if this is shorter, then invert the compare and mul with -1 int result = l == null ? -1 * r.compareTo(l) : l.compareTo(r); if (result != 0) { return result; } } return 0; case WILDCARD_ITEM: return -1; default: throw new RuntimeException("invalid item: " + item.getClass()); } } public String toString() { StringBuilder buffer = new StringBuilder("("); for (Iterator iter = iterator(); iter.hasNext();) { buffer.append(iter.next()); if (iter.hasNext()) { buffer.append(','); } } buffer.append(')'); return buffer.toString(); } } public VersionNumber(String version) { parseVersion(version); } private void parseVersion(String version) { this.value = version; items = new ListItem(); version = version.toLowerCase(Locale.ENGLISH); ListItem list = items; Stack stack = new Stack(); stack.push(list); boolean isDigit = false; int startIndex = 0; for (int i = 0; i < version.length(); i++) { char c = version.charAt(i); if (c == '.') { if (i == startIndex) { list.add(IntegerItem.ZERO); } else { list.add(parseItem(isDigit, version.substring(startIndex, i))); } startIndex = i + 1; } else if (c == '-') { if (i == startIndex) { list.add(IntegerItem.ZERO); } else { list.add(parseItem(isDigit, version.substring(startIndex, i))); } startIndex = i + 1; if (isDigit) { list.normalize(); // 1.0-* = 1-* if ((i + 1 < version.length()) && Character.isDigit(version.charAt(i + 1))) { // new ListItem only if previous were digits and new char is a digit, // ie need to differentiate only 1.1 from 1-1 list.add(list = new ListItem()); stack.push(list); } } } else if (c == '*') { list.add(new WildCardItem()); startIndex = i + 1; } else if (Character.isDigit(c)) { if (!isDigit && i > startIndex) { list.add(new StringItem(version.substring(startIndex, i), true)); startIndex = i; } isDigit = true; } else if (Character.isWhitespace(c)) { if (i > startIndex) { if (isDigit) { list.add(parseItem(true, version.substring(startIndex, i))); } else { list.add(new StringItem(version.substring(startIndex, i), true)); } startIndex = i; } isDigit = false; } else { if (isDigit && i > startIndex) { list.add(parseItem(true, version.substring(startIndex, i))); startIndex = i; } isDigit = false; } } if (version.length() > startIndex) { list.add(parseItem(isDigit, version.substring(startIndex))); } while (!stack.isEmpty()) { list = (ListItem) stack.pop(); list.normalize(); } canonical = items.toString(); } private static Item parseItem(boolean isDigit, String buf) { return isDigit ? (Item) new IntegerItem(buf) : (Item) new StringItem(buf, false); } public int compareTo(VersionNumber o) { return items.compareTo(o.items); } public String toString() { return value; } public boolean equals(Object o) { return (o instanceof VersionNumber) && canonical.equals(((VersionNumber) o).canonical); } public int hashCode() { return canonical.hashCode(); } public boolean isOlderThan(VersionNumber rhs) { return compareTo(rhs) < 0; } public boolean isNewerThan(VersionNumber rhs) { return compareTo(rhs) > 0; } public int digit(int idx) { Iterator i = items.iterator(); Item item = (Item) i.next(); while (idx > 0 && i.hasNext()) { if (item instanceof IntegerItem) { idx--; } i.next(); } return ((IntegerItem) item).value.intValue(); } public static final Comparator DESCENDING = new Comparator() { public int compare(VersionNumber o1, VersionNumber o2) { return o2.compareTo(o1); } }; }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy