/** * * Copyright 2003-2007 Jive Software, 2016-2017 Florian Schmaus. * * Licensed 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. */ package org.jivesoftware.smack.util; import java.io.UnsupportedEncodingException; import java.security.SecureRandom; import java.util.Collection; import java.util.Iterator; import java.util.Random; /** * A collection of utility methods for String objects. */ public class StringUtils { public static final String MD5 = "MD5"; public static final String SHA1 = "SHA-1"; public static final String UTF8 = "UTF-8"; public static final String USASCII = "US-ASCII"; public static final String QUOTE_ENCODE = """; public static final String APOS_ENCODE = "'"; public static final String AMP_ENCODE = "&"; public static final String LT_ENCODE = "<"; public static final String GT_ENCODE = ">"; public static final char[] HEX_CHARS = "0123456789abcdef".toCharArray(); /** * Escape input for XML. * * @param input the input to escape. * @return the XML escaped variant of input. * @deprecated use {@link #escapeForXml(CharSequence)} instead. */ // Remove in 4.3. @Deprecated public static CharSequence escapeForXML(CharSequence input) { return escapeForXml(input); } /** * Escape input for XML. * * @param input the input to escape. * @return the XML escaped variant of input. */ public static CharSequence escapeForXml(CharSequence input) { return escapeForXml(input, XmlEscapeMode.safe); } /** * Escape input for XML. * * @param input the input to escape. * @return the XML escaped variant of input. * @since 4.2 */ public static CharSequence escapeForXmlAttribute(CharSequence input) { return escapeForXml(input, XmlEscapeMode.forAttribute); } /** * Escape input for XML. *

* This is an optimized variant of {@link #escapeForXmlAttribute(CharSequence)} for XML where the * XML attribute is quoted using ''' (Apos). *

* * @param input the input to escape. * @return the XML escaped variant of input. * @since 4.2 */ public static CharSequence escapeForXmlAttributeApos(CharSequence input) { return escapeForXml(input, XmlEscapeMode.forAttributeApos); } /** * Escape input for XML. * * @param input the input to escape. * @return the XML escaped variant of input. * @since 4.2 */ public static CharSequence escapeForXmlText(CharSequence input) { return escapeForXml(input, XmlEscapeMode.forText); } private enum XmlEscapeMode { safe, forAttribute, forAttributeApos, forText, ; } /** * Escapes all necessary characters in the CharSequence so that it can be used * in an XML doc. * * @param input the CharSequence to escape. * @return the string with appropriate characters escaped. */ private static CharSequence escapeForXml(final CharSequence input, final XmlEscapeMode xmlEscapeMode) { if (input == null) { return null; } final int len = input.length(); final StringBuilder out = new StringBuilder((int) (len * 1.3)); CharSequence toAppend; char ch; int last = 0; int i = 0; while (i < len) { toAppend = null; ch = input.charAt(i); switch (xmlEscapeMode) { case safe: switch (ch) { case '<': toAppend = LT_ENCODE; break; case '>': toAppend = GT_ENCODE; break; case '&': toAppend = AMP_ENCODE; break; case '"': toAppend = QUOTE_ENCODE; break; case '\'': toAppend = APOS_ENCODE; break; default: break; } break; case forAttribute: // No need to escape '>' for attributes. switch (ch) { case '<': toAppend = LT_ENCODE; break; case '&': toAppend = AMP_ENCODE; break; case '"': toAppend = QUOTE_ENCODE; break; case '\'': toAppend = APOS_ENCODE; break; default: break; } break; case forAttributeApos: // No need to escape '>' and '"' for attributes using '\'' as quote. switch (ch) { case '<': toAppend = LT_ENCODE; break; case '&': toAppend = AMP_ENCODE; break; case '\'': toAppend = APOS_ENCODE; break; default: break; } break; case forText: // No need to escape '"', '\'', and '>' for text. switch (ch) { case '<': toAppend = LT_ENCODE; break; case '&': toAppend = AMP_ENCODE; break; default: break; } break; } if (toAppend != null) { if (i > last) { out.append(input, last, i); } out.append(toAppend); last = ++i; } else { i++; } } if (last == 0) { return input; } if (i > last) { out.append(input, last, i); } return out; } /** * Hashes a String using the SHA-1 algorithm and returns the result as a * String of hexadecimal numbers. This method is synchronized to avoid * excessive MessageDigest object creation. If calling this method becomes * a bottleneck in your code, you may wish to maintain a pool of * MessageDigest objects instead of using this method. *

* A hash is a one-way function -- that is, given an * input, an output is easily computed. However, given the output, the * input is almost impossible to compute. This is useful for passwords * since we can store the hash and a hacker will then have a very hard time * determining the original password. * * @param data the String to compute the hash of. * @return a hashed version of the passed-in String * @deprecated use {@link org.jivesoftware.smack.util.SHA1#hex(String)} instead. */ @Deprecated public synchronized static String hash(String data) { return org.jivesoftware.smack.util.SHA1.hex(data); } /** * Encodes an array of bytes as String representation of hexadecimal. * * @param bytes an array of bytes to convert to a hex string. * @return generated hex string. */ public static String encodeHex(byte[] bytes) { char[] hexChars = new char[bytes.length * 2]; for (int j = 0; j < bytes.length; j++) { int v = bytes[j] & 0xFF; hexChars[j * 2] = HEX_CHARS[v >>> 4]; hexChars[j * 2 + 1] = HEX_CHARS[v & 0x0F]; } return new String(hexChars); } public static byte[] toBytes(String string) { try { return string.getBytes(StringUtils.UTF8); } catch (UnsupportedEncodingException e) { throw new IllegalStateException("UTF-8 encoding not supported by platform", e); } } /** * Pseudo-random number generator object for use with randomString(). * The Random class is not considered to be cryptographically secure, so * only use these random Strings for low to medium security applications. */ private static final ThreadLocal randGen = new ThreadLocal() { @Override protected Random initialValue() { return new Random(); } }; /** * Array of numbers and letters of mixed case. Numbers appear in the list * twice so that there is a more equal chance that a number will be picked. * We can use the array to get a random number or letter by picking a random * array index. */ private static final char[] numbersAndLetters = ("0123456789abcdefghijklmnopqrstuvwxyz" + "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ").toCharArray(); /** * Returns a random String of numbers and letters (lower and upper case) * of the specified length. The method uses the Random class that is * built-in to Java which is suitable for low to medium grade security uses. * This means that the output is only pseudo random, i.e., each number is * mathematically generated so is not truly random.

* * The specified length must be at least one. If not, the method will return * null. * * @param length the desired length of the random String to return. * @return a random String of numbers and letters of the specified length. */ public static String insecureRandomString(int length) { if (length < 1) { return null; } final Random random = randGen.get(); // Create a char buffer to put random letters and numbers in. char[] randBuffer = new char[length]; for (int i = 0; i < randBuffer.length; i++) { randBuffer[i] = numbersAndLetters[random.nextInt(numbersAndLetters.length)]; } return new String(randBuffer); } private static final ThreadLocal SECURE_RANDOM = new ThreadLocal() { @Override protected SecureRandom initialValue() { return new SecureRandom(); } }; public static String randomString(final int length) { if (length < 1) { return null; } byte[] randomBytes = new byte[length]; SECURE_RANDOM.get().nextBytes(randomBytes); char[] randomChars = new char[length]; for (int i = 0; i < length; i++) { randomChars[i] = getPrintableChar(randomBytes[i]); } return new String(randomChars); } private static char getPrintableChar(byte indexByte) { assert (numbersAndLetters.length < Byte.MAX_VALUE * 2); // Convert indexByte as it where an unsigned byte by promoting it to int // and masking it with 0xff. Yields results from 0 - 254. int index = indexByte & 0xff; return numbersAndLetters[index % numbersAndLetters.length]; } /** * Returns true if CharSequence is not null and is not empty, false otherwise. * Examples: * isNotEmpty(null) - false * isNotEmpty("") - false * isNotEmpty(" ") - true * isNotEmpty("empty") - true * * @param cs checked CharSequence * @return true if string is not null and is not empty, false otherwise */ public static boolean isNotEmpty(CharSequence cs) { return !isNullOrEmpty(cs); } /** * Returns true if the given CharSequence is null or empty. * * @param cs * @return true if the given CharSequence is null or empty */ public static boolean isNullOrEmpty(CharSequence cs) { return cs == null || isEmpty(cs); } /** * Returns true if all given CharSequences are not empty. * * @param css the CharSequences to test. * @return true if all given CharSequences are not empty. */ public static boolean isNotEmpty(CharSequence... css) { for (CharSequence cs : css) { if (StringUtils.isNullOrEmpty(cs)) { return false; } } return true; } /** * Returns true if all given CharSequences are either null or empty. * * @param css the CharSequences to test. * @return true if all given CharSequences are null or empty. */ public static boolean isNullOrEmpty(CharSequence... css) { for (CharSequence cs : css) { if (StringUtils.isNotEmpty(cs)) { return false; } } return true; } /** * Returns true if the given CharSequence is empty. * * @param cs * @return true if the given CharSequence is empty */ public static boolean isEmpty(CharSequence cs) { return cs.length() == 0; } /** * Transform a collection of objects to a whitespace delimited String. * * @param collection the collection to transform. * @return a String with all the elements of the collection. */ public static String collectionToString(Collection collection) { return toStringBuilder(collection, " ").toString(); } /** * Transform a collection of objects to a delimited String. * * @param collection the collection to transform. * @param delimiter the delimiter used to delimit the Strings. * @return a StringBuilder with all the elements of the collection. */ public static StringBuilder toStringBuilder(Collection collection, String delimiter) { StringBuilder sb = new StringBuilder(collection.size() * 20); for (Iterator it = collection.iterator(); it.hasNext();) { Object cs = it.next(); sb.append(cs); if (it.hasNext()) { sb.append(delimiter); } } return sb; } public static String returnIfNotEmptyTrimmed(String string) { if (string == null) return null; String trimmedString = string.trim(); if (trimmedString.length() > 0) { return trimmedString; } else { return null; } } public static boolean nullSafeCharSequenceEquals(CharSequence csOne, CharSequence csTwo) { return nullSafeCharSequenceComperator(csOne, csTwo) == 0; } public static int nullSafeCharSequenceComperator(CharSequence csOne, CharSequence csTwo) { if (csOne == null ^ csTwo == null) { return (csOne == null) ? -1 : 1; } if (csOne == null && csTwo == null) { return 0; } return csOne.toString().compareTo(csTwo.toString()); } public static CS requireNotNullOrEmpty(CS cs, String message) { if (isNullOrEmpty(cs)) { throw new IllegalArgumentException(message); } return cs; } /** * Return the String representation of the given char sequence if it is not null. * * @param cs the char sequence or null. * @return the String representation of cs or null. */ public static String maybeToString(CharSequence cs) { if (cs == null) { return null; } return cs.toString(); } }