X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Futil%2FStringUtils.java;h=2cbbfbf8367495e6c40996af5a4f93f122300012;hb=f0fd407e5fad67185a9813c57bfc50aacaf1de6e;hp=c55d467ca1f7f93d540f5c7dcd1158c95f735b9a;hpb=ea94f71e4b8bd5ceda06e696f6e92723cc2d9db1;p=jalview.git diff --git a/src/jalview/util/StringUtils.java b/src/jalview/util/StringUtils.java index c55d467..2cbbfbf 100644 --- a/src/jalview/util/StringUtils.java +++ b/src/jalview/util/StringUtils.java @@ -1,13 +1,33 @@ +/* + * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$) + * Copyright (C) $$Year-Rel$$ The Jalview Authors + * + * This file is part of Jalview. + * + * Jalview 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 3 + * of the License, or (at your option) any later version. + * + * Jalview 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 Jalview. If not, see . + * The Jalview Authors are detailed in the 'AUTHORS' file. + */ package jalview.util; import java.util.ArrayList; import java.util.List; import java.util.regex.Pattern; - public class StringUtils { - private static final Pattern DELIMITERS_PATTERN = Pattern.compile(".*='[^']*(?!')"); + private static final Pattern DELIMITERS_PATTERN = Pattern + .compile(".*='[^']*(?!')"); private static final boolean DEBUG = false; @@ -25,11 +45,10 @@ public class StringUtils * the character to insert */ public static final char[] insertCharAt(char[] in, int position, - int count, - char ch) + int count, char ch) { char[] tmp = new char[in.length + count]; - + if (position >= in.length) { System.arraycopy(in, 0, tmp, 0, in.length); @@ -39,20 +58,19 @@ public class StringUtils { System.arraycopy(in, 0, tmp, 0, position); } - + int index = position; while (count > 0) { tmp[index++] = ch; count--; } - + if (position < in.length) { - System.arraycopy(in, position, tmp, index, - in.length - position); + System.arraycopy(in, position, tmp, index, in.length - position); } - + return tmp; } @@ -120,14 +138,15 @@ public class StringUtils * @param delimiter * @return elements separated by separator */ - public static String[] separatorListToArray(String input, String delimiter) + public static String[] separatorListToArray(String input, + String delimiter) { int seplen = delimiter.length(); if (input == null || input.equals("") || input.equals(delimiter)) { return null; } - List jv = new ArrayList(); + List jv = new ArrayList<>(); int cp = 0, pos, escape; boolean wasescaped = false, wasquoted = false; String lstitem = null; @@ -137,9 +156,8 @@ public class StringUtils if (wasescaped || wasquoted) { // append to previous pos - jv.set(jv.size() - 1, - lstitem = lstitem + delimiter - + input.substring(cp, pos + escape)); + jv.set(jv.size() - 1, lstitem = lstitem + delimiter + + input.substring(cp, pos + escape)); } else { @@ -183,8 +201,8 @@ public class StringUtils } if (DEBUG) { - System.err.println("Empty Array from '" + delimiter - + "' separated List"); + System.err.println( + "Empty Array from '" + delimiter + "' separated List"); } return null; } @@ -217,17 +235,239 @@ public class StringUtils } if (DEBUG) { - System.err.println("Returning '" + separator - + "' separated List:\n"); + System.err + .println("Returning '" + separator + "' separated List:\n"); System.err.println(v); } return v.toString(); } if (DEBUG) { - System.err.println("Returning empty '" + separator - + "' separated List\n"); + System.err.println( + "Returning empty '" + separator + "' separated List\n"); } return "" + separator; } + + /** + * Converts a list to a string with a delimiter before each term except the + * first. Returns an empty string given a null or zero-length argument. This + * can be replaced with StringJoiner in Java 8. + * + * @param terms + * @param delim + * @return + */ + public static String listToDelimitedString(List terms, + String delim) + { + StringBuilder sb = new StringBuilder(32); + if (terms != null && !terms.isEmpty()) + { + boolean appended = false; + for (String term : terms) + { + if (appended) + { + sb.append(delim); + } + appended = true; + sb.append(term); + } + } + return sb.toString(); + } + + /** + * Convenience method to parse a string to an integer, returning 0 if the + * input is null or not a valid integer + * + * @param s + * @return + */ + public static int parseInt(String s) + { + int result = 0; + if (s != null && s.length() > 0) + { + try + { + result = Integer.parseInt(s); + } catch (NumberFormatException ex) + { + } + } + return result; + } + + /** + * Compares two versions formatted as e.g. "3.4.5" and returns -1, 0 or 1 as + * the first version precedes, is equal to, or follows the second + * + * @param v1 + * @param v2 + * @return + */ + public static int compareVersions(String v1, String v2) + { + return compareVersions(v1, v2, null); + } + + /** + * Compares two versions formatted as e.g. "3.4.5b1" and returns -1, 0 or 1 as + * the first version precedes, is equal to, or follows the second + * + * @param v1 + * @param v2 + * @param pointSeparator + * a string used to delimit point increments in sub-tokens of the + * version + * @return + */ + public static int compareVersions(String v1, String v2, + String pointSeparator) + { + if (v1 == null || v2 == null) + { + return 0; + } + String[] toks1 = v1.split("\\."); + String[] toks2 = v2.split("\\."); + int i = 0; + for (; i < toks1.length; i++) + { + if (i >= toks2.length) + { + /* + * extra tokens in v1 + */ + return 1; + } + String tok1 = toks1[i]; + String tok2 = toks2[i]; + if (pointSeparator != null) + { + /* + * convert e.g. 5b2 into decimal 5.2 for comparison purposes + */ + tok1 = tok1.replace(pointSeparator, "."); + tok2 = tok2.replace(pointSeparator, "."); + } + try + { + float f1 = Float.valueOf(tok1); + float f2 = Float.valueOf(tok2); + int comp = Float.compare(f1, f2); + if (comp != 0) + { + return comp; + } + } catch (NumberFormatException e) + { + System.err + .println("Invalid version format found: " + e.getMessage()); + return 0; + } + } + + if (i < toks2.length) + { + /* + * extra tokens in v2 + */ + return -1; + } + + /* + * same length, all tokens match + */ + return 0; + } + + /** + * Converts the string to all lower-case except the first character which is + * upper-cased + * + * @param s + * @return + */ + public static String toSentenceCase(String s) + { + if (s == null) + { + return s; + } + if (s.length() <= 1) + { + return s.toUpperCase(); + } + return s.substring(0, 1).toUpperCase() + s.substring(1).toLowerCase(); + } + + /** + * A helper method that strips off any leading or trailing html and body tags. + * If no html tag is found, then also html-encodes angle bracket characters. + * + * @param text + * @return + */ + public static String stripHtmlTags(String text) + { + if (text == null) + { + return null; + } + String tmp2up = text.toUpperCase(); + int startTag = tmp2up.indexOf(""); + if (startTag > -1) + { + text = text.substring(startTag + 6); + tmp2up = tmp2up.substring(startTag + 6); + } + // is omission of "" intentional here?? + int endTag = tmp2up.indexOf(""); + if (endTag > -1) + { + text = text.substring(0, endTag); + tmp2up = tmp2up.substring(0, endTag); + } + endTag = tmp2up.indexOf(""); + if (endTag > -1) + { + text = text.substring(0, endTag); + } + + if (startTag == -1 && (text.contains("<") || text.contains(">"))) + { + text = text.replaceAll("<", "<"); + text = text.replaceAll(">", ">"); + } + return text; + } + + /** + * Answers true if the string is not empty and consists only of digits, or + * characters 'a'-'f' or 'A'-'F', else false + * + * @param s + * @return + */ + public static boolean isHexString(String s) + { + int j = s.length(); + if (j == 0) + { + return false; + } + for (int i = 0; i < j; i++) + { + int c = s.charAt(i); + if (!(c >= '0' && c <= '9') && !(c >= 'a' && c <= 'f') + && !(c >= 'A' && c <= 'F')) + { + return false; + } + } + return true; + } }