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

net.dermetfan.utils.StringUtils Maven / Gradle / Ivy

There is a newer version: 0.13.4
Show newest version
/** Copyright 2014 Robin Stumm ([email protected], http://dermetfan.net)
 *
 *  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 net.dermetfan.utils;

/** utility methods for operations on Strings
 *  @author dermetfan
 *  @since 0.6.0 */
public class StringUtils {

	/** @param string the String to convert to a valid java identifier, as far as possible */
	public static String toJavaIdentifier(String string) {
		if(string.length() == 0)
			return string;
		StringBuilder result = new StringBuilder(string.length());
		if(isJavaIdentifierStart(string.charAt(0)))
			result.append(string.charAt(0));
		boolean nextUpperCase = false;
		for(int i = 1, n = string.length(); i < n; i++) {
			char c = string.charAt(i);
			if(isJavaIdentifierPart(c)) {
				if(nextUpperCase) {
					c = Character.toUpperCase(c);
					nextUpperCase = false;
				}
				result.append(c);
			} else
				nextUpperCase = true;
		}
		return result.toString();
	}

	/** for GWT compatibility
	 *  @see Character#isJavaIdentifierStart(char) */
	public static boolean isJavaIdentifierStart(char c) {
		return isJavaIdentifierStart((int) c);
	}

	/** for GWT compatibility
	 *  @see Character#isJavaIdentifierStart(int) */
	public static boolean isJavaIdentifierStart(int codePoint) {
		return codePoint >= 'a' && codePoint <= 'z' || codePoint >= 'A' && codePoint <= 'Z' || codePoint == '$' || codePoint == 'µ' || codePoint >= 'À' && codePoint <= 'Ö' || codePoint >= 'Ø' && codePoint <= 'ö' || codePoint >= 'ø' && codePoint <= 'ÿ';
	}

	/** for GWT compatibility
	 *  @see Character#isJavaIdentifierPart(char) */
	public static boolean isJavaIdentifierPart(char c) {
		return isJavaIdentifierPart((int) c);
	}

	/** for GWT compatibility
	 *  @see Character#isJavaIdentifierPart(int) */
	public static boolean isJavaIdentifierPart(int codePoint) {
		return isJavaIdentifierStart(codePoint) || codePoint >= '0' && codePoint <= '9';
	}

	/** @param index the index of the character to replace
	 *  @param replacement the replacement for the character at the given index
	 *  @param string the String in which to replace
	 *  @return a representation of the given String with the contents replaced */
	public static String replace(int index, String replacement, String string) {
		return string.substring(0, index).concat(replacement).concat(string.substring(index + 1));
	}

	/** @see #replace(int, String, String) */
	public static String replace(int index, char replacement, String string) {
		return (string.substring(0, index) + replacement).concat(string.substring(index + 1));
	}

	/** @param beginIndex the index of the first character to remove
	 *  @param endIndex the index at which to stop the removal
	 *  @param string the String from which to remove
	 *  @return a representation of the given String with contents removed */
	public static String remove(int beginIndex, int endIndex, String string) {
		return string.substring(0, beginIndex).concat(string.substring(endIndex));
	}

	/** @see #remove(int, int, String) */
	public static String remove(int index, String string) {
		return remove(index, index + 1, string);
	}

	/** @see #count(int, String, int, int)
	 *  @param overlap if occurrences are allowed to overlap */
	public static int count(String target, String string, int beginIndex, int endIndex, boolean overlap) {
		int count = 0, increment = (overlap ? 1 : target.length());
		for(int i = string.indexOf(target, beginIndex); i != -1 && i < endIndex; i = string.indexOf(target, i + increment))
			count++;
		return count;
	}

	/** same as {@link #count(String, String, int, int, boolean) count} without overlapping occurrences
	 *  @see #count(String, String, int, int, boolean) */
	public static int count(String target, String string, int beginIndex, int endIndex) {
		return count(target, string, beginIndex, endIndex, false);
	}

	/** @see #count(String, String, int, int, boolean) */
	public static int count(String target, String string, boolean overlap) {
		return count(target, string, 0, string.length(), overlap);
	}

	/** same as {@link #count(String, String, boolean) count} without overlapping occurrences
	 *  @see #count(String, String, boolean) */
	public static int count(String target, String string) {
		return count(target, string, false);
	}

	/** @param c the character to count
	 *  @param string the String in which to count
	 *  @return the number of occurrences of c in string in the range from beginIndex to endIndex */
	public static int count(int c, String string, int beginIndex, int endIndex) {
		int count = 0;
		for(int i = string.indexOf(c, beginIndex); i != -1 && i < endIndex; i = string.indexOf(c, i + 1))
			count++;
		return count;
	}

	/** @see #count(int, String, int, int) */
	public static int count(char c, String string, int beginIndex, int endIndex) {
		return count((int) c, string, beginIndex, endIndex);
	}

	/** @see #count(int, String, int, int) */
	public static int count(int c, String string) {
		return count(c, string, 0, string.length());
	}

	/** @see #count(char, String, int, int) */
	public static int count(char c, String string) {
		return count((int) c, string);
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy