* The target and do not encode languages must be in the Unicode BMP, but the * source language does not. *
* ** The encoding will all be of a fixed length, except for the 'do not encode' * chars, which will be of length 1 *
* *
* Character[] originals; // a, b, c, d
* Character[] encoding; // 0, 1, d
* Character[] doNotEncode; // d
*
* AlphabetConverter ac = AlphabetConverter.createConverterFromChars(originals,
* encoding, doNotEncode);
*
* ac.encode("a"); // 00
* ac.encode("b"); // 01
* ac.encode("c"); // 0d
* ac.encode("d"); // d
* ac.encode("abcd"); // 00010dd
*
*
* * #ThreadSafe# AlphabetConverter class methods are thread-safe as they do not * change internal state. *
* * @since 1.0 * */ public final class AlphabetConverter { /** * Original string to be encoded. */ private final MapDuplicate letters in either original or encoding will be ignored.
* * @param original an array of chars representing the original alphabet * @param encoding an array of chars representing the alphabet to be used * for encoding * @param doNotEncode an array of chars to be encoded using the original * alphabet - every char here must appear in * both the previous params * @return The AlphabetConverter * @throws IllegalArgumentException if an AlphabetConverter cannot be * constructed */ public static AlphabetConverter createConverterFromChars( final Character[] original, final Character[] encoding, final Character[] doNotEncode) { return AlphabetConverter.createConverter( convertCharsToIntegers(original), convertCharsToIntegers(encoding), convertCharsToIntegers(doNotEncode)); } /** * Convert characters to integers. * * @param chars array of characters * @return an equivalent array of integers */ private static Integer[] convertCharsToIntegers(final Character[] chars) { if (chars == null || chars.length == 0) { return new Integer[0]; } final Integer[] integers = new Integer[chars.length]; for (int i = 0; i < chars.length; i++) { integers[i] = (int) chars[i]; } return integers; } /** * Create an alphabet converter, for converting from the original alphabet, * to the encoded alphabet, while leaving * the characters in doNotEncode as they are (if possible). * *Duplicate letters in either original or encoding will be ignored.
* * @param original an array of ints representing the original alphabet in * codepoints * @param encoding an array of ints representing the alphabet to be used for * encoding, in codepoints * @param doNotEncode an array of ints representing the chars to be encoded * using the original alphabet - every char * here must appear in both the previous params * @return The AlphabetConverter * @throws IllegalArgumentException if an AlphabetConverter cannot be * constructed */ public static AlphabetConverter createConverter( final Integer[] original, final Integer[] encoding, final Integer[] doNotEncode) { final Set* The Builder interface is designed to designate a class as a builder * object in the Builder design pattern. Builders are capable of creating and * configuring objects or results that normally take multiple steps to construct * or are very complex to derive. *
* ** The builder interface defines a single method, {@link #build()}, that * classes must implement. The result of this method should be the final * configured object or result after all building operations are performed. *
* ** It is a recommended practice that the methods supplied to configure the * object or result being built return a reference to {@code this} so that * method calls can be chained together. *
* ** Example Builder: *
* class FontBuilder implements Builder<Font> {
* private Font font;
*
* public FontBuilder(String fontName) {
* this.font = new Font(fontName, Font.PLAIN, 12);
* }
*
* public FontBuilder bold() {
* this.font = this.font.deriveFont(Font.BOLD);
* return this; // Reference returned so calls can be chained
* }
*
* public FontBuilder size(float pointSize) {
* this.font = this.font.deriveFont(pointSize);
* return this; // Reference returned so calls can be chained
* }
*
* // Other Font construction methods
*
* public Font build() {
* return this.font;
* }
* }
*
* Font bold14ptSansSerifFont = new FontBuilder(Font.SANS_SERIF).bold()
* .size(14.0f)
* .build();
* Case manipulation operations on Strings that contain words.
* *This class tries to handle null input gracefully.
* An exception will not be thrown for a null input.
* Each method documents its behaviour in more detail.
CaseUtils instances should NOT be constructed in
* standard programming. Instead, the class should be used as
* CaseUtils.toCamelCase("foo bar", true, new char[]{'-'});.
This constructor is public to permit tools that require a JavaBean * instance to operate.
*/ public CaseUtils() { super(); } /** *Converts all the delimiter separated words in a String into camelCase, * that is each word is made up of a titlecase character and then a series of * lowercase characters.
* *The delimiters represent a set of characters understood to separate words. * The first non-delimiter character after a delimiter will be capitalized. The first String * character may or may not be capitalized and it's determined by the user input for capitalizeFirstLetter * variable.
* *A null input String returns null.
* Capitalization uses the Unicode title case, normally equivalent to
* upper case and cannot perform locale-sensitive mappings.
* CaseUtils.toCamelCase(null, false) = null
* CaseUtils.toCamelCase("", false, *) = ""
* CaseUtils.toCamelCase(*, false, null) = *
* CaseUtils.toCamelCase(*, true, new char[0]) = *
* CaseUtils.toCamelCase("To.Camel.Case", false, new char[]{'.'}) = "toCamelCase"
* CaseUtils.toCamelCase(" to @ Camel case", true, new char[]{'@'}) = "ToCamelCase"
* CaseUtils.toCamelCase(" @to @ Camel case", false, new char[]{'@'}) = "toCamelCase"
*
*
* @param str the String to be converted to camelCase, may be null
* @param capitalizeFirstLetter boolean that determines if the first character of first word should be title case.
* @param delimiters set of characters to determine capitalization, null and/or empty array means whitespace
* @return camelCase of String, null if null String input
*/
public static String toCamelCase(String str, final boolean capitalizeFirstLetter, final char... delimiters) {
if (StringUtils.isEmpty(str)) {
return str;
}
str = str.toLowerCase();
final int strLen = str.length();
final int[] newCodePoints = new int[strLen];
int outOffset = 0;
final SetConverts an array of delimiters to a hash set of code points. Code point of space(32) is added * as the default value. The generated hash set provides O(1) lookup time.
* * @param delimiters set of characters to determine capitalization, null means whitespace * @return Set* Commonly used implementations of {@link CharacterPredicate}. Per the interface * requirements, all implementations are thread safe. *
* * @since 1.0 */ public enum CharacterPredicates implements CharacterPredicate { /** * Tests code points against {@link Character#isLetter(int)}. * * @since 1.0 */ LETTERS { @Override public boolean test(final int codePoint) { return Character.isLetter(codePoint); } }, /** * Tests code points against {@link Character#isDigit(int)}. * * @since 1.0 */ DIGITS { @Override public boolean test(final int codePoint) { return Character.isDigit(codePoint); } }, /** * Tests if the code points represents a number between 0 and 9. * * @since 1.2 */ ARABIC_NUMERALS { @Override public boolean test(final int codePoint) { return codePoint >= '0' && codePoint <= '9'; } }, /** * Tests if the code points represents a letter between a and z. * * @since 1.2 */ ASCII_LOWERCASE_LETTERS { @Override public boolean test(final int codePoint) { return codePoint >= 'a' && codePoint <= 'z'; } }, /** * Tests if the code points represents a letter between A and Z. * * @since 1.2 */ ASCII_UPPERCASE_LETTERS { @Override public boolean test(final int codePoint) { return codePoint >= 'A' && codePoint <= 'Z'; } }, /** * Tests if the code points represents a letter between a and Z. * * @since 1.2 */ ASCII_LETTERS { @Override public boolean test(final int codePoint) { return ASCII_LOWERCASE_LETTERS.test(codePoint) || ASCII_UPPERCASE_LETTERS.test(codePoint); } }, /** * Tests if the code points represents a letter between a and Z or a number between 0 and 9. * * @since 1.2 */ ASCII_ALPHA_NUMERALS { @Override public boolean test(final int codePoint) { return ASCII_LOWERCASE_LETTERS.test(codePoint) || ASCII_UPPERCASE_LETTERS.test(codePoint) || ARABIC_NUMERALS.test(codePoint); } } } commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/CompositeFormat.java 0000664 0000000 0000000 00000007207 13532277265 0031555 0 ustar 00root root 0000000 0000000 /* * 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. */ package org.apache.commons.text; import java.text.FieldPosition; import java.text.Format; import java.text.ParseException; import java.text.ParsePosition; /** * Formats using one formatter and parses using a different formatter. An * example of use for this would be a webapp where data is taken in one way and * stored in a database another way. * * @since 1.0 */ public class CompositeFormat extends Format { /** * Required for serialization support. * * @see java.io.Serializable */ private static final long serialVersionUID = -4329119827877627683L; /** The parser to use. */ private final Format parser; /** The formatter to use. */ private final Format formatter; /** * Create a format that points its parseObject method to one implementation * and its format method to another. * * @param parser implementation * @param formatter implementation */ public CompositeFormat(final Format parser, final Format formatter) { this.parser = parser; this.formatter = formatter; } /** * Uses the formatter Format instance. * * @param obj the object to format * @param toAppendTo the {@link StringBuffer} to append to * @param pos the FieldPosition to use (or ignore). * @returntoAppendTo
* @see Format#format(Object, StringBuffer, FieldPosition)
*/
@Override // Therefore has to use StringBuffer
public StringBuffer format(final Object obj, final StringBuffer toAppendTo,
final FieldPosition pos) {
return formatter.format(obj, toAppendTo, pos);
}
/**
* Uses the parser Format instance.
*
* @param source the String source
* @param pos the ParsePosition containing the position to parse from, will
* be updated according to parsing success (index) or failure
* (error index)
* @return The parsed Object
* @see Format#parseObject(String, ParsePosition)
*/
@Override
public Object parseObject(final String source, final ParsePosition pos) {
return parser.parseObject(source, pos);
}
/**
* Provides access to the parser Format implementation.
*
* @return parser Format implementation
*/
public Format getParser() {
return this.parser;
}
/**
* Provides access to the parser Format implementation.
*
* @return formatter Format implementation
*/
public Format getFormatter() {
return this.formatter;
}
/**
* Utility method to parse and then reformat a String.
*
* @param input String to reformat
* @return A reformatted String
* @throws ParseException thrown by parseObject(String) call
*/
public String reformat(final String input) throws ParseException {
return format(parseObject(input));
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/ExtendedMessageFormat.java 0000664 0000000 0000000 00000047603 13532277265 0032664 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.text.Format;
import java.text.MessageFormat;
import java.text.ParsePosition;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.Locale;
import java.util.Locale.Category;
import java.util.Map;
import java.util.Objects;
import org.apache.commons.text.matcher.StringMatcherFactory;
/**
* Extends java.text.MessageFormat to allow pluggable/additional formatting
* options for embedded format elements. Client code should specify a registry
* of FormatFactory instances associated with String
* format names. This registry will be consulted when the format elements are
* parsed from the message pattern. In this way custom patterns can be specified,
* and the formats supported by java.text.MessageFormat can be overridden
* at the format and/or format style level (see MessageFormat). A "format element"
* embedded in the message pattern is specified (()? signifies optionality):{argument-number(,format-name
* (,format-style)?)?}
*
*
* format-name and format-style values are trimmed of surrounding whitespace
* in the manner of java.text.MessageFormat. If format-name denotes
* FormatFactory formatFactoryInstance in registry, a Format
* matching format-name and format-style is requested from
* formatFactoryInstance. If this is successful, the Format
* found is used for this format element.
*
NOTICE: The various subformat mutator methods are considered unnecessary; they exist on the parent
* class to allow the type of customization which it is the job of this class to provide in
* a configurable fashion. These methods have thus been disabled and will throw
* UnsupportedOperationException if called.
*
Limitations inherited from java.text.MessageFormat:
Formats, including MessageFormat and thus
* ExtendedMessageFormat, is not guaranteed.pos
*/
private ParsePosition next(final ParsePosition pos) {
pos.setIndex(pos.getIndex() + 1);
return pos;
}
/**
* Consume a quoted string, adding it to appendTo if
* specified.
*
* @param pattern pattern to parse
* @param pos current parse position
* @param appendTo optional StringBuilder to append
* @return appendTo
*/
private StringBuilder appendQuotedString(final String pattern, final ParsePosition pos,
final StringBuilder appendTo) {
assert pattern.toCharArray()[pos.getIndex()] == QUOTE
: "Quoted string must start with quote character";
// handle quote character at the beginning of the string
if (appendTo != null) {
appendTo.append(QUOTE);
}
next(pos);
final int start = pos.getIndex();
final char[] c = pattern.toCharArray();
final int lastHold = start;
for (int i = pos.getIndex(); i < pattern.length(); i++) {
switch (c[pos.getIndex()]) {
case QUOTE:
next(pos);
return appendTo == null ? null : appendTo.append(c, lastHold,
pos.getIndex() - lastHold);
default:
next(pos);
}
}
throw new IllegalArgumentException(
"Unterminated quoted string at position " + start);
}
/**
* Consume quoted string only.
*
* @param pattern pattern to parse
* @param pos current parse position
*/
private void getQuotedString(final String pattern, final ParsePosition pos) {
appendQuotedString(pattern, pos, null);
}
/**
* Learn whether the specified Collection contains non-null elements.
* @param coll to check
* @return true if some Object was found, false otherwise.
*/
private boolean containsElements(final Collection coll) {
if (coll == null || coll.isEmpty()) {
return false;
}
for (final Object name : coll) {
if (name != null) {
return true;
}
}
return false;
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/FormatFactory.java 0000664 0000000 0000000 00000002675 13532277265 0031226 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.text.Format;
import java.util.Locale;
/**
* Format factory.
*
* @since 1.0
*/
public interface FormatFactory {
/**
* Create or retrieve a format instance.
*
* @param name The format type name
* @param arguments Arguments used to create the format instance. This allows the
* FormatFactory to implement the "format style"
* concept from java.text.MessageFormat.
* @param locale The locale, may be null
* @return The format instance
*/
Format getFormat(String name, String arguments, Locale locale);
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/FormattableUtils.java 0000664 0000000 0000000 00000015115 13532277265 0031720 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.util.Formattable;
import java.util.Formatter;
import static java.util.FormattableFlags.LEFT_JUSTIFY;
/**
* Provides utilities for working with the {@code Formattable} interface.
* *The {@link Formattable} interface provides basic control over formatting * when using a {@code Formatter}. It is primarily concerned with numeric precision * and padding, and is not designed to allow generalised alternate formats.
* * @since 1.0 * */ public class FormattableUtils { /** * A format that simply outputs the value as a string. */ private static final String SIMPLEST_FORMAT = "%s"; /** *{@code FormattableUtils} instances should NOT be constructed in * standard programming. Instead, the methods of the class should be invoked * statically.
* *This constructor is public to permit tools that require a JavaBean * instance to operate.
*/ public FormattableUtils() { super(); } //----------------------------------------------------------------------- /** * Get the default formatted representation of the specified * {@code Formattable}. * * @param formattable the instance to convert to a string, not null * @return The resulting string, not null */ public static String toString(final Formattable formattable) { return String.format(SIMPLEST_FORMAT, formattable); } /** * Handles the common {@code Formattable} operations of truncate-pad-append, * with no ellipsis on precision overflow, and padding width underflow with * spaces. * * @param seq the string to handle, not null * @param formatter the destination formatter, not null * @param flags the flags for formatting, see {@code Formattable} * @param width the width of the output, see {@code Formattable} * @param precision the precision of the output, see {@code Formattable} * @return The {@code formatter} instance, not null */ public static Formatter append(final CharSequence seq, final Formatter formatter, final int flags, final int width, final int precision) { return append(seq, formatter, flags, width, precision, ' ', null); } /** * Handles the common {@link Formattable} operations of truncate-pad-append, * with no ellipsis on precision overflow. * * @param seq the string to handle, not null * @param formatter the destination formatter, not null * @param flags the flags for formatting, see {@code Formattable} * @param width the width of the output, see {@code Formattable} * @param precision the precision of the output, see {@code Formattable} * @param padChar the pad character to use * @return The {@code formatter} instance, not null */ public static Formatter append(final CharSequence seq, final Formatter formatter, final int flags, final int width, final int precision, final char padChar) { return append(seq, formatter, flags, width, precision, padChar, null); } /** * Handles the common {@link Formattable} operations of truncate-pad-append, * padding width underflow with spaces. * * @param seq the string to handle, not null * @param formatter the destination formatter, not null * @param flags the flags for formatting, see {@code Formattable} * @param width the width of the output, see {@code Formattable} * @param precision the precision of the output, see {@code Formattable} * @param ellipsis the ellipsis to use when precision dictates truncation, null or * empty causes a hard truncation * @return The {@code formatter} instance, not null */ public static Formatter append(final CharSequence seq, final Formatter formatter, final int flags, final int width, final int precision, final CharSequence ellipsis) { return append(seq, formatter, flags, width, precision, ' ', ellipsis); } /** * Handles the common {@link Formattable} operations of truncate-pad-append. * * @param seq the string to handle, not null * @param formatter the destination formatter, not null * @param flags the flags for formatting, see {@code Formattable} * @param width the width of the output, see {@code Formattable} * @param precision the precision of the output, see {@code Formattable} * @param padChar the pad character to use * @param ellipsis the ellipsis to use when precision dictates truncation, null or * empty causes a hard truncation * @return The {@code formatter} instance, not null */ public static Formatter append(final CharSequence seq, final Formatter formatter, final int flags, final int width, final int precision, final char padChar, final CharSequence ellipsis) { if (!(ellipsis == null || precision < 0 || ellipsis.length() <= precision)) { throw new IllegalArgumentException( String.format("Specified ellipsis '%s' exceeds precision of %s", ellipsis, precision)); } final StringBuilder buf = new StringBuilder(seq); if (precision >= 0 && precision < seq.length()) { final CharSequence _ellipsis; if (ellipsis == null) { _ellipsis = ""; } else { _ellipsis = ellipsis; } buf.replace(precision - _ellipsis.length(), seq.length(), _ellipsis.toString()); } final boolean leftJustify = (flags & LEFT_JUSTIFY) == LEFT_JUSTIFY; for (int i = buf.length(); i < width; i++) { buf.insert(leftJustify ? i : 0, padChar); } formatter.format(buf.toString()); return formatter; } } commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/RandomStringGenerator.java 0000664 0000000 0000000 00000042557 13532277265 0032727 0 ustar 00root root 0000000 0000000 /* * 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. */ package org.apache.commons.text; import org.apache.commons.lang3.Validate; import java.util.ArrayList; import java.util.HashSet; import java.util.List; import java.util.Set; import java.util.Collections; import java.util.concurrent.ThreadLocalRandom; /** ** Generates random Unicode strings containing the specified number of code points. * Instances are created using a builder class, which allows the * callers to define the properties of the generator. See the documentation for the * {@link Builder} class to see available properties. *
*
* // Generates a 20 code point string, using only the letters a-z
* RandomStringGenerator generator = new RandomStringGenerator.Builder()
* .withinRange('a', 'z').build();
* String randomLetters = generator.generate(20);
*
*
* // Using Apache Commons RNG for randomness
* UniformRandomProvider rng = RandomSource.create(...);
* // Generates a 20 code point string, using only the letters a-z
* RandomStringGenerator generator = new RandomStringGenerator.Builder()
* .withinRange('a', 'z')
* .usingRandom(rng::nextInt) // uses Java 8 syntax
* .build();
* String randomLetters = generator.generate(20);
*
* * {@code RandomStringGenerator} instances are thread-safe when using the * default random number generator (RNG). If a custom RNG is set by calling the method * {@link Builder#usingRandom(TextRandomProvider) Builder.usingRandom(TextRandomProvider)}, thread-safety * must be ensured externally. *
* @since 1.1 */ public final class RandomStringGenerator { /** * The smallest allowed code point (inclusive). */ private final int minimumCodePoint; /** * The largest allowed code point (inclusive). */ private final int maximumCodePoint; /** * Filters for code points. */ private final Set* Generates a random string, containing the specified number of code points. *
*Code points are randomly selected between the minimum and maximum values defined * in the generator. * Surrogate and private use characters are not returned, although the * resulting string may contain pairs of surrogates that together encode a * supplementary character. *
** Note: the number of {@code char} code units generated will exceed * {@code length} if the string contains supplementary characters. See the * {@link Character} documentation to understand how Java stores Unicode * values. *
* * @param length * the number of code points to generate * @return The generated string * @throws IllegalArgumentException * if {@code length < 0} */ public String generate(final int length) { if (length == 0) { return ""; } Validate.isTrue(length > 0, "Length %d is smaller than zero.", length); final StringBuilder builder = new StringBuilder(length); long remaining = length; do { int codePoint; if (characterList != null && !characterList.isEmpty()) { codePoint = generateRandomNumber(characterList); } else { codePoint = generateRandomNumber(minimumCodePoint, maximumCodePoint); } switch (Character.getType(codePoint)) { case Character.UNASSIGNED: case Character.PRIVATE_USE: case Character.SURROGATE: continue; default: } if (inclusivePredicates != null) { boolean matchedFilter = false; for (final CharacterPredicate predicate : inclusivePredicates) { if (predicate.test(codePoint)) { matchedFilter = true; break; } } if (!matchedFilter) { continue; } } builder.appendCodePoint(codePoint); remaining--; } while (remaining != 0); return builder.toString(); } /** * Generates a random string, containing between the minimum (inclusive) and the maximum (inclusive) * number of code points. * * @param minLengthInclusive * the minimum (inclusive) number of code points to generate * @param maxLengthInclusive * the maximum (inclusive) number of code points to generate * @return The generated string * @throws IllegalArgumentException * if {@code minLengthInclusive < 0}, or {@code maxLengthInclusive < minLengthInclusive} * @see RandomStringGenerator#generate(int) * @since 1.2 */ public String generate(final int minLengthInclusive, final int maxLengthInclusive) { Validate.isTrue(minLengthInclusive >= 0, "Minimum length %d is smaller than zero.", minLengthInclusive); Validate.isTrue(minLengthInclusive <= maxLengthInclusive, "Maximum length %d is smaller than minimum length %d.", maxLengthInclusive, minLengthInclusive); return generate(generateRandomNumber(minLengthInclusive, maxLengthInclusive)); } /** *A builder for generating {@code RandomStringGenerator} instances.
*The behaviour of a generator is controlled by properties set by this * builder. Each property has a default value, which can be overridden by * calling the methods defined in this class, prior to calling {@link #build()}.
* *All the property setting methods return the {@code Builder} instance to allow for method chaining.
* *The minimum and maximum code point values are defined using {@link #withinRange(int, int)}. The * default values are {@code 0} and {@link Character#MAX_CODE_POINT} respectively.
* *The source of randomness can be set using {@link #usingRandom(TextRandomProvider)}, * otherwise {@link ThreadLocalRandom} is used.
* *The type of code points returned can be filtered using {@link #filteredBy(CharacterPredicate...)}, * which defines a collection of tests that are applied to the randomly generated code points. * The code points will only be included in the result if they pass at least one of the tests. * Some commonly used predicates are provided by the {@link CharacterPredicates} enum.
* *This class is not thread safe.
* @since 1.1 */ public static class Builder implements org.apache.commons.text.Builder* Specifies the minimum and maximum code points allowed in the * generated string. *
* * @param minimumCodePoint * the smallest code point allowed (inclusive) * @param maximumCodePoint * the largest code point allowed (inclusive) * @return {@code this}, to allow method chaining * @throws IllegalArgumentException * if {@code maximumCodePoint >} * {@link Character#MAX_CODE_POINT} * @throws IllegalArgumentException * if {@code minimumCodePoint < 0} * @throws IllegalArgumentException * if {@code minimumCodePoint > maximumCodePoint} */ public Builder withinRange(final int minimumCodePoint, final int maximumCodePoint) { Validate.isTrue(minimumCodePoint <= maximumCodePoint, "Minimum code point %d is larger than maximum code point %d", minimumCodePoint, maximumCodePoint); Validate.isTrue(minimumCodePoint >= 0, "Minimum code point %d is negative", minimumCodePoint); Validate.isTrue(maximumCodePoint <= Character.MAX_CODE_POINT, "Value %d is larger than Character.MAX_CODE_POINT.", maximumCodePoint); this.minimumCodePoint = minimumCodePoint; this.maximumCodePoint = maximumCodePoint; return this; } /** ** Specifies the array of minimum and maximum char allowed in the * generated string. *
* * For example: *
* {@code
* char [][] pairs = {{'0','9'}};
* char [][] pairs = {{'a','z'}};
* char [][] pairs = {{'a','z'},{'0','9'}};
* }
*
*
* @param pairs array of characters array, expected is to pass min, max pairs through this arg.
* @return {@code this}, to allow method chaining.
*/
public Builder withinRange(final char[]... pairs) {
characterList = new ArrayList<>();
for (final char[] pair : pairs) {
Validate.isTrue(pair.length == 2,
"Each pair must contain minimum and maximum code point");
final int minimumCodePoint = pair[0];
final int maximumCodePoint = pair[1];
Validate.isTrue(minimumCodePoint <= maximumCodePoint,
"Minimum code point %d is larger than maximum code point %d", minimumCodePoint, maximumCodePoint);
for (int index = minimumCodePoint; index <= maximumCodePoint; index++) {
characterList.add((char) index);
}
}
return this;
}
/**
* * Limits the characters in the generated string to those that match at * least one of the predicates supplied. *
* ** Passing {@code null} or an empty array to this method will revert to the * default behaviour of allowing any character. Multiple calls to this * method will replace the previously stored predicates. *
* * @param predicates * the predicates, may be {@code null} or empty * @return {@code this}, to allow method chaining */ public Builder filteredBy(final CharacterPredicate... predicates) { if (predicates == null || predicates.length == 0) { inclusivePredicates = null; return this; } if (inclusivePredicates == null) { inclusivePredicates = new HashSet<>(); } else { inclusivePredicates.clear(); } Collections.addAll(inclusivePredicates, predicates); return this; } /** ** Overrides the default source of randomness. It is highly * recommended that a random number generator library like * Apache Commons RNG * be used to provide the random number generation. *
* ** When using Java 8 or later, {@link TextRandomProvider} is a * functional interface and need not be explicitly implemented: *
*
* {@code
* UniformRandomProvider rng = RandomSource.create(...);
* RandomStringGenerator gen = new RandomStringGenerator.Builder()
* .usingRandom(rng::nextInt)
* // additional builder calls as needed
* .build();
* }
*
*
* * Passing {@code null} to this method will revert to the default source of * randomness. *
* * @param random * the source of randomness, may be {@code null} * @return {@code this}, to allow method chaining */ public Builder usingRandom(final TextRandomProvider random) { this.random = random; return this; } /** ** Limits the characters in the generated string to those who match at * supplied list of Character. *
* ** Passing {@code null} or an empty array to this method will revert to the * default behaviour of allowing any character. Multiple calls to this * method will replace the previously stored Character. *
* * @param chars set of predefined Characters for random string generation * the Character can be, may be {@code null} or empty * @return {@code this}, to allow method chaining * @since 1.2 */ public Builder selectFrom(final char... chars) { characterList = new ArrayList<>(); for (final char c : chars) { characterList.add(c); } return this; } /** *Builds the {@code RandomStringGenerator} using the properties specified.
* @return The configured {@code RandomStringGenerator} */ @Override public RandomStringGenerator build() { return new RandomStringGenerator(minimumCodePoint, maximumCodePoint, inclusivePredicates, random, characterList); } } } commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/StrBuilder.java 0000664 0000000 0000000 00000315647 13532277265 0030533 0 ustar 00root root 0000000 0000000 /* * 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. */ package org.apache.commons.text; import java.io.IOException; import java.io.Reader; import java.io.Serializable; import java.io.Writer; import java.nio.CharBuffer; import java.util.Iterator; import java.util.List; import java.util.Objects; /** * Builds a string from constituent parts providing a more flexible and powerful API * than StringBuffer. ** The main differences from StringBuffer/StringBuilder are: *
** The aim has been to provide an API that mimics very closely what StringBuffer * provides, but with additional methods. It should be noted that some edge cases, * with invalid indices or null input, have been altered - see individual methods. * The biggest of these changes is that by default, null will not output the text * 'null'. This can be controlled by a property, {@link #setNullText(String)}. *
* * @since 1.0 * @deprecated Deprecated as of 1.3, use {@link TextStringBuilder} instead. This class will be removed in 2.0. */ @Deprecated public class StrBuilder implements CharSequence, Appendable, Serializable, Builder* This method is the same as {@link #length()} and is provided to match the * API of Collections. * * @return The length */ public int size() { return size; } /** * Checks is the string builder is empty (convenience Collections API style method). *
* This method is the same as checking {@link #length()} and is provided to match the
* API of Collections.
*
* @return true if the size is 0.
*/
public boolean isEmpty() {
return size == 0;
}
/**
* Clears the string builder (convenience Collections API style method).
*
* This method does not reduce the size of the internal character buffer.
* To do that, call clear() followed by {@link #minimizeCapacity()}.
*
* This method is the same as {@link #setLength(int)} called with zero * and is provided to match the API of Collections. * * @return this, to enable chaining */ public StrBuilder clear() { size = 0; return this; } //----------------------------------------------------------------------- /** * Gets the character at the specified index. * * @see #setCharAt(int, char) * @see #deleteCharAt(int) * @param index the index to retrieve, must be valid * @return The character at the index * @throws IndexOutOfBoundsException if the index is invalid */ @Override public char charAt(final int index) { if (index < 0 || index >= length()) { throw new StringIndexOutOfBoundsException(index); } return buffer[index]; } /** * Sets the character at the specified index. * * @see #charAt(int) * @see #deleteCharAt(int) * @param index the index to set * @param ch the new character * @return this, to enable chaining * @throws IndexOutOfBoundsException if the index is invalid */ public StrBuilder setCharAt(final int index, final char ch) { if (index < 0 || index >= length()) { throw new StringIndexOutOfBoundsException(index); } buffer[index] = ch; return this; } /** * Deletes the character at the specified index. * * @see #charAt(int) * @see #setCharAt(int, char) * @param index the index to delete * @return this, to enable chaining * @throws IndexOutOfBoundsException if the index is invalid */ public StrBuilder deleteCharAt(final int index) { if (index < 0 || index >= size) { throw new StringIndexOutOfBoundsException(index); } deleteImpl(index, index + 1, 1); return this; } //----------------------------------------------------------------------- /** * Copies the builder's character array into a new character array. * * @return a new array that represents the contents of the builder */ public char[] toCharArray() { if (size == 0) { return new char[0]; } final char[] chars = new char[size]; System.arraycopy(buffer, 0, chars, 0, size); return chars; } /** * Copies part of the builder's character array into a new character array. * * @param startIndex the start index, inclusive, must be valid * @param endIndex the end index, exclusive, must be valid except that * if too large it is treated as end of string * @return a new array that holds part of the contents of the builder * @throws IndexOutOfBoundsException if startIndex is invalid, * or if endIndex is invalid (but endIndex greater than size is valid) */ public char[] toCharArray(final int startIndex, int endIndex) { endIndex = validateRange(startIndex, endIndex); final int len = endIndex - startIndex; if (len == 0) { return new char[0]; } final char[] chars = new char[len]; System.arraycopy(buffer, startIndex, chars, 0, len); return chars; } /** * Copies the character array into the specified array. * * @param destination the destination array, null will cause an array to be created * @return The input array, unless that was null or too small */ public char[] getChars(char[] destination) { final int len = length(); if (destination == null || destination.length < len) { destination = new char[len]; } System.arraycopy(buffer, 0, destination, 0, len); return destination; } /** * Copies the character array into the specified array. * * @param startIndex first index to copy, inclusive, must be valid * @param endIndex last index, exclusive, must be valid * @param destination the destination array, must not be null or too small * @param destinationIndex the index to start copying in destination * @throws NullPointerException if the array is null * @throws IndexOutOfBoundsException if any index is invalid */ public void getChars(final int startIndex, final int endIndex, final char[] destination, final int destinationIndex) { if (startIndex < 0) { throw new StringIndexOutOfBoundsException(startIndex); } if (endIndex < 0 || endIndex > length()) { throw new StringIndexOutOfBoundsException(endIndex); } if (startIndex > endIndex) { throw new StringIndexOutOfBoundsException("end < start"); } System.arraycopy(buffer, startIndex, destination, destinationIndex, endIndex - startIndex); } //----------------------------------------------------------------------- /** * If possible, reads chars from the provided {@link Readable} directly into underlying * character buffer without making extra copies. * * @param readable object to read from * @return The number of characters read * @throws IOException if an I/O error occurs * * @see #appendTo(Appendable) */ public int readFrom(final Readable readable) throws IOException { final int oldSize = size; if (readable instanceof Reader) { final Reader r = (Reader) readable; ensureCapacity(size + 1); int read; while ((read = r.read(buffer, size, buffer.length - size)) != -1) { size += read; ensureCapacity(size + 1); } } else if (readable instanceof CharBuffer) { final CharBuffer cb = (CharBuffer) readable; final int remaining = cb.remaining(); ensureCapacity(size + remaining); cb.get(buffer, size, remaining); size += remaining; } else { while (true) { ensureCapacity(size + 1); final CharBuffer buf = CharBuffer.wrap(buffer, size, buffer.length - size); final int read = readable.read(buf); if (read == -1) { break; } size += read; } } return size - oldSize; } //----------------------------------------------------------------------- /** * Appends the new line string to this string builder. *
* The new line string can be altered using {@link #setNewLineText(String)}.
* This might be used to force the output to always use Unix line endings
* even when on Windows.
*
* @return this, to enable chaining
*/
public StrBuilder appendNewLine() {
if (newLine == null) {
append(System.lineSeparator());
return this;
}
return append(newLine);
}
/**
* Appends the text representing
* This method is useful for adding a separator each time around the
* loop except the first.
*
* This method is for example useful for constructing queries
*
* This method is useful for adding a separator each time around the
* loop except the first.
*
* This method is useful for adding a separator each time around the
* loop except the first.
*
* This method is useful for adding a separator each time around the
* loop except the first.
*
* Matchers can be used to perform advanced deletion behaviour.
* For example you could write a matcher to delete all occurrences
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @return this, to enable chaining
*/
public StrBuilder deleteAll(final StrMatcher matcher) {
return replace(matcher, null, 0, size, -1);
}
/**
* Deletes the first match within the builder using the specified matcher.
*
* Matchers can be used to perform advanced deletion behaviour.
* For example you could write a matcher to delete
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @return this, to enable chaining
*/
public StrBuilder deleteFirst(final StrMatcher matcher) {
return replace(matcher, null, 0, size, 1);
}
//-----------------------------------------------------------------------
/**
* Internal method to delete a range without validation.
*
* @param startIndex the start index, must be valid
* @param endIndex the end index (exclusive), must be valid
* @param removeLen the length to remove (endIndex - startIndex), must be valid
* @param insertStr the string to replace with, null means delete range
* @param insertLen the length of the insert string, must be valid
* @throws IndexOutOfBoundsException if any index is invalid
*/
private void replaceImpl(final int startIndex,
final int endIndex,
final int removeLen,
final String insertStr,
final int insertLen) {
final int newSize = size - removeLen + insertLen;
if (insertLen != removeLen) {
ensureCapacity(newSize);
System.arraycopy(buffer, endIndex, buffer, startIndex + insertLen, size - endIndex);
size = newSize;
}
if (insertLen > 0) {
insertStr.getChars(0, insertLen, buffer, startIndex);
}
}
/**
* Replaces a portion of the string builder with another string.
* The length of the inserted string does not have to match the removed length.
*
* @param startIndex the start index, inclusive, must be valid
* @param endIndex the end index, exclusive, must be valid except
* that if too large it is treated as end of string
* @param replaceStr the string to replace with, null means delete range
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder replace(final int startIndex, int endIndex, final String replaceStr) {
endIndex = validateRange(startIndex, endIndex);
final int insertLen = replaceStr == null ? 0 : replaceStr.length();
replaceImpl(startIndex, endIndex, endIndex - startIndex, replaceStr, insertLen);
return this;
}
//-----------------------------------------------------------------------
/**
* Replaces the search character with the replace character
* throughout the builder.
*
* @param search the search character
* @param replace the replace character
* @return this, to enable chaining
*/
public StrBuilder replaceAll(final char search, final char replace) {
if (search != replace) {
for (int i = 0; i < size; i++) {
if (buffer[i] == search) {
buffer[i] = replace;
}
}
}
return this;
}
/**
* Replaces the first instance of the search character with the
* replace character in the builder.
*
* @param search the search character
* @param replace the replace character
* @return this, to enable chaining
*/
public StrBuilder replaceFirst(final char search, final char replace) {
if (search != replace) {
for (int i = 0; i < size; i++) {
if (buffer[i] == search) {
buffer[i] = replace;
break;
}
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Replaces the search string with the replace string throughout the builder.
*
* @param searchStr the search string, null causes no action to occur
* @param replaceStr the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public StrBuilder replaceAll(final String searchStr, final String replaceStr) {
final int searchLen = searchStr == null ? 0 : searchStr.length();
if (searchLen > 0) {
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
int index = indexOf(searchStr, 0);
while (index >= 0) {
replaceImpl(index, index + searchLen, searchLen, replaceStr, replaceLen);
index = indexOf(searchStr, index + replaceLen);
}
}
return this;
}
/**
* Replaces the first instance of the search string with the replace string.
*
* @param searchStr the search string, null causes no action to occur
* @param replaceStr the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public StrBuilder replaceFirst(final String searchStr, final String replaceStr) {
final int searchLen = searchStr == null ? 0 : searchStr.length();
if (searchLen > 0) {
final int index = indexOf(searchStr, 0);
if (index >= 0) {
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
replaceImpl(index, index + searchLen, searchLen, replaceStr, replaceLen);
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Replaces all matches within the builder with the replace string.
*
* Matchers can be used to perform advanced replace behaviour.
* For example you could write a matcher to replace all occurrences
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @param replaceStr the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public StrBuilder replaceAll(final StrMatcher matcher, final String replaceStr) {
return replace(matcher, replaceStr, 0, size, -1);
}
/**
* Replaces the first match within the builder with the replace string.
*
* Matchers can be used to perform advanced replace behaviour.
* For example you could write a matcher to replace
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @param replaceStr the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public StrBuilder replaceFirst(final StrMatcher matcher, final String replaceStr) {
return replace(matcher, replaceStr, 0, size, 1);
}
// -----------------------------------------------------------------------
/**
* Advanced search and replaces within the builder using a matcher.
*
* Matchers can be used to perform advanced behaviour.
* For example you could write a matcher to delete all occurrences
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @param replaceStr the string to replace the match with, null is a delete
* @param startIndex the start index, inclusive, must be valid
* @param endIndex the end index, exclusive, must be valid except
* that if too large it is treated as end of string
* @param replaceCount the number of times to replace, -1 for replace all
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if start index is invalid
*/
public StrBuilder replace(
final StrMatcher matcher, final String replaceStr,
final int startIndex, int endIndex, final int replaceCount) {
endIndex = validateRange(startIndex, endIndex);
return replaceImpl(matcher, replaceStr, startIndex, endIndex, replaceCount);
}
/**
* Replaces within the builder using a matcher.
*
* Matchers can be used to perform advanced behaviour.
* For example you could write a matcher to delete all occurrences
* where the character 'a' is followed by a number.
*
* @param matcher the matcher to use to find the deletion, null causes no action
* @param replaceStr the string to replace the match with, null is a delete
* @param from the start index, must be valid
* @param to the end index (exclusive), must be valid
* @param replaceCount the number of times to replace, -1 for replace all
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if any index is invalid
*/
private StrBuilder replaceImpl(
final StrMatcher matcher, final String replaceStr,
final int from, int to, int replaceCount) {
if (matcher == null || size == 0) {
return this;
}
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
for (int i = from; i < to && replaceCount != 0; i++) {
final char[] buf = buffer;
final int removeLen = matcher.isMatch(buf, i, from, to);
if (removeLen > 0) {
replaceImpl(i, i + removeLen, removeLen, replaceStr, replaceLen);
to = to - removeLen + replaceLen;
i = i + replaceLen - 1;
if (replaceCount > 0) {
replaceCount--;
}
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Reverses the string builder placing each character in the opposite index.
*
* @return this, to enable chaining
*/
public StrBuilder reverse() {
if (size == 0) {
return this;
}
final int half = size / 2;
final char[] buf = buffer;
for (int leftIdx = 0, rightIdx = size - 1; leftIdx < half; leftIdx++, rightIdx--) {
final char swap = buf[leftIdx];
buf[leftIdx] = buf[rightIdx];
buf[rightIdx] = swap;
}
return this;
}
//-----------------------------------------------------------------------
/**
* Trims the builder by removing characters less than or equal to a space
* from the beginning and end.
*
* @return this, to enable chaining
*/
public StrBuilder trim() {
if (size == 0) {
return this;
}
int len = size;
final char[] buf = buffer;
int pos = 0;
while (pos < len && buf[pos] <= ' ') {
pos++;
}
while (pos < len && buf[len - 1] <= ' ') {
len--;
}
if (len < size) {
delete(len, size);
}
if (pos > 0) {
delete(0, pos);
}
return this;
}
//-----------------------------------------------------------------------
/**
* Checks whether this builder starts with the specified string.
*
* Note that this method handles null input quietly, unlike String.
*
* @param str the string to search for, null returns false
* @return true if the builder starts with the string
*/
public boolean startsWith(final String str) {
if (str == null) {
return false;
}
final int len = str.length();
if (len == 0) {
return true;
}
if (len > size) {
return false;
}
for (int i = 0; i < len; i++) {
if (buffer[i] != str.charAt(i)) {
return false;
}
}
return true;
}
/**
* Checks whether this builder ends with the specified string.
*
* Note that this method handles null input quietly, unlike String.
*
* @param str the string to search for, null returns false
* @return true if the builder ends with the string
*/
public boolean endsWith(final String str) {
if (str == null) {
return false;
}
final int len = str.length();
if (len == 0) {
return true;
}
if (len > size) {
return false;
}
int pos = size - len;
for (int i = 0; i < len; i++, pos++) {
if (buffer[pos] != str.charAt(i)) {
return false;
}
}
return true;
}
//-----------------------------------------------------------------------
/**
* {@inheritDoc}
*/
@Override
public CharSequence subSequence(final int startIndex, final int endIndex) {
if (startIndex < 0) {
throw new StringIndexOutOfBoundsException(startIndex);
}
if (endIndex > size) {
throw new StringIndexOutOfBoundsException(endIndex);
}
if (startIndex > endIndex) {
throw new StringIndexOutOfBoundsException(endIndex - startIndex);
}
return substring(startIndex, endIndex);
}
/**
* Extracts a portion of this string builder as a string.
*
* @param start the start index, inclusive, must be valid
* @return The new string
* @throws IndexOutOfBoundsException if the index is invalid
*/
public String substring(final int start) {
return substring(start, size);
}
/**
* Extracts a portion of this string builder as a string.
*
* Note: This method treats an endIndex greater than the length of the
* builder as equal to the length of the builder, and continues
* without error, unlike StringBuffer or String.
*
* @param startIndex the start index, inclusive, must be valid
* @param endIndex the end index, exclusive, must be valid except
* that if too large it is treated as end of string
* @return The new string
* @throws IndexOutOfBoundsException if the index is invalid
*/
public String substring(final int startIndex, int endIndex) {
endIndex = validateRange(startIndex, endIndex);
return new String(buffer, startIndex, endIndex - startIndex);
}
/**
* Extracts the leftmost characters from the string builder without
* throwing an exception.
*
* This method extracts the left
* This method extracts the right
* This method extracts
* Matchers can be used to perform advanced searching behaviour.
* For example you could write a matcher to search for the character
* 'a' followed by a number.
*
* @param matcher the matcher to use, null returns -1
* @return true if the matcher finds a match in the builder
*/
public boolean contains(final StrMatcher matcher) {
return indexOf(matcher, 0) >= 0;
}
//-----------------------------------------------------------------------
/**
* Searches the string builder to find the first reference to the specified char.
*
* @param ch the character to find
* @return The first index of the character, or -1 if not found
*/
public int indexOf(final char ch) {
return indexOf(ch, 0);
}
/**
* Searches the string builder to find the first reference to the specified char.
*
* @param ch the character to find
* @param startIndex the index to start at, invalid index rounded to edge
* @return The first index of the character, or -1 if not found
*/
public int indexOf(final char ch, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (startIndex >= size) {
return -1;
}
final char[] thisBuf = buffer;
for (int i = startIndex; i < size; i++) {
if (thisBuf[i] == ch) {
return i;
}
}
return -1;
}
/**
* Searches the string builder to find the first reference to the specified string.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str the string to find, null returns -1
* @return The first index of the string, or -1 if not found
*/
public int indexOf(final String str) {
return indexOf(str, 0);
}
/**
* Searches the string builder to find the first reference to the specified
* string starting searching from the given index.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str the string to find, null returns -1
* @param startIndex the index to start at, invalid index rounded to edge
* @return The first index of the string, or -1 if not found
*/
public int indexOf(final String str, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (str == null || startIndex >= size) {
return -1;
}
final int strLen = str.length();
if (strLen == 1) {
return indexOf(str.charAt(0), startIndex);
}
if (strLen == 0) {
return startIndex;
}
if (strLen > size) {
return -1;
}
final char[] thisBuf = buffer;
final int len = size - strLen + 1;
outer:
for (int i = startIndex; i < len; i++) {
for (int j = 0; j < strLen; j++) {
if (str.charAt(j) != thisBuf[i + j]) {
continue outer;
}
}
return i;
}
return -1;
}
/**
* Searches the string builder using the matcher to find the first match.
*
* Matchers can be used to perform advanced searching behaviour.
* For example you could write a matcher to find the character 'a'
* followed by a number.
*
* @param matcher the matcher to use, null returns -1
* @return The first index matched, or -1 if not found
*/
public int indexOf(final StrMatcher matcher) {
return indexOf(matcher, 0);
}
/**
* Searches the string builder using the matcher to find the first
* match searching from the given index.
*
* Matchers can be used to perform advanced searching behaviour.
* For example you could write a matcher to find the character 'a'
* followed by a number.
*
* @param matcher the matcher to use, null returns -1
* @param startIndex the index to start at, invalid index rounded to edge
* @return The first index matched, or -1 if not found
*/
public int indexOf(final StrMatcher matcher, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (matcher == null || startIndex >= size) {
return -1;
}
final int len = size;
final char[] buf = buffer;
for (int i = startIndex; i < len; i++) {
if (matcher.isMatch(buf, i, startIndex, len) > 0) {
return i;
}
}
return -1;
}
//-----------------------------------------------------------------------
/**
* Searches the string builder to find the last reference to the specified char.
*
* @param ch the character to find
* @return The last index of the character, or -1 if not found
*/
public int lastIndexOf(final char ch) {
return lastIndexOf(ch, size - 1);
}
/**
* Searches the string builder to find the last reference to the specified char.
*
* @param ch the character to find
* @param startIndex the index to start at, invalid index rounded to edge
* @return The last index of the character, or -1 if not found
*/
public int lastIndexOf(final char ch, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (startIndex < 0) {
return -1;
}
for (int i = startIndex; i >= 0; i--) {
if (buffer[i] == ch) {
return i;
}
}
return -1;
}
/**
* Searches the string builder to find the last reference to the specified string.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str the string to find, null returns -1
* @return The last index of the string, or -1 if not found
*/
public int lastIndexOf(final String str) {
return lastIndexOf(str, size - 1);
}
/**
* Searches the string builder to find the last reference to the specified
* string starting searching from the given index.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str the string to find, null returns -1
* @param startIndex the index to start at, invalid index rounded to edge
* @return The last index of the string, or -1 if not found
*/
public int lastIndexOf(final String str, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (str == null || startIndex < 0) {
return -1;
}
final int strLen = str.length();
if (strLen > 0 && strLen <= size) {
if (strLen == 1) {
return lastIndexOf(str.charAt(0), startIndex);
}
outer:
for (int i = startIndex - strLen + 1; i >= 0; i--) {
for (int j = 0; j < strLen; j++) {
if (str.charAt(j) != buffer[i + j]) {
continue outer;
}
}
return i;
}
} else if (strLen == 0) {
return startIndex;
}
return -1;
}
/**
* Searches the string builder using the matcher to find the last match.
*
* Matchers can be used to perform advanced searching behaviour.
* For example you could write a matcher to find the character 'a'
* followed by a number.
*
* @param matcher the matcher to use, null returns -1
* @return The last index matched, or -1 if not found
*/
public int lastIndexOf(final StrMatcher matcher) {
return lastIndexOf(matcher, size);
}
/**
* Searches the string builder using the matcher to find the last
* match searching from the given index.
*
* Matchers can be used to perform advanced searching behaviour.
* For example you could write a matcher to find the character 'a'
* followed by a number.
*
* @param matcher the matcher to use, null returns -1
* @param startIndex the index to start at, invalid index rounded to edge
* @return The last index matched, or -1 if not found
*/
public int lastIndexOf(final StrMatcher matcher, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (matcher == null || startIndex < 0) {
return -1;
}
final char[] buf = buffer;
final int endIndex = startIndex + 1;
for (int i = startIndex; i >= 0; i--) {
if (matcher.isMatch(buf, i, 0, endIndex) > 0) {
return i;
}
}
return -1;
}
//-----------------------------------------------------------------------
/**
* Creates a tokenizer that can tokenize the contents of this builder.
*
* This method allows the contents of this builder to be tokenized.
* The tokenizer will be setup by default to tokenize on space, tab,
* newline and form feed (as per StringTokenizer). These values can be
* changed on the tokenizer class, before retrieving the tokens.
*
* The returned tokenizer is linked to this builder. You may intermix
* calls to the builder and tokenizer within certain limits, however
* there is no synchronization. Once the tokenizer has been used once,
* it must be {@link StrTokenizer#reset() reset} to pickup the latest
* changes in the builder. For example:
*
* Calling {@link StrTokenizer#reset(String)} or {@link StrTokenizer#reset(char[])}
* with a non-null value will break the link with the builder.
*
* @return a tokenizer that is linked to this builder
*/
public StrTokenizer asTokenizer() {
return new StrBuilderTokenizer();
}
//-----------------------------------------------------------------------
/**
* Gets the contents of this builder as a Reader.
*
* This method allows the contents of the builder to be read
* using any standard method that expects a Reader.
*
* To use, simply create a
* The internal character array is shared between the builder and the reader.
* This allows you to append to the builder after creating the reader,
* and the changes will be picked up.
* Note however, that no synchronization occurs, so you must perform
* all operations with the builder and the reader in one thread.
*
* The returned reader supports marking, and ignores the flush method.
*
* @return a reader that reads from this builder
*/
public Reader asReader() {
return new StrBuilderReader();
}
//-----------------------------------------------------------------------
/**
* Gets this builder as a Writer that can be written to.
*
* This method allows you to populate the contents of the builder
* using any standard method that takes a Writer.
*
* To use, simply create a
* The internal character array is shared between the builder and the writer.
* This allows you to intermix calls that append to the builder and
* write using the writer and the changes will be occur correctly.
* Note however, that no synchronization occurs, so you must perform
* all operations with the builder and the writer in one thread.
*
* The returned writer ignores the close and flush methods.
*
* @return a writer that populates this builder
*/
public Writer asWriter() {
return new StrBuilderWriter();
}
/**
* Appends current contents of this
* This method tries to avoid doing any extra copies of contents.
*
* @param appendable the appendable to append data to
* @throws IOException if an I/O error occurs
*
* @see #readFrom(Readable)
*/
public void appendTo(final Appendable appendable) throws IOException {
if (appendable instanceof Writer) {
((Writer) appendable).write(buffer, 0, size);
} else if (appendable instanceof StringBuilder) {
((StringBuilder) appendable).append(buffer, 0, size);
} else if (appendable instanceof StringBuffer) {
((StringBuffer) appendable).append(buffer, 0, size);
} else if (appendable instanceof CharBuffer) {
((CharBuffer) appendable).put(buffer, 0, size);
} else {
appendable.append(this);
}
}
/**
* Checks the contents of this builder against another to see if they
* contain the same character content ignoring case.
*
* @param other the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
public boolean equalsIgnoreCase(final StrBuilder other) {
if (this == other) {
return true;
}
if (this.size != other.size) {
return false;
}
final char[] thisBuf = this.buffer;
final char[] otherBuf = other.buffer;
for (int i = size - 1; i >= 0; i--) {
final char c1 = thisBuf[i];
final char c2 = otherBuf[i];
if (c1 != c2 && Character.toUpperCase(c1) != Character.toUpperCase(c2)) {
return false;
}
}
return true;
}
/**
* Checks the contents of this builder against another to see if they
* contain the same character content.
*
* @param other the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
public boolean equals(final StrBuilder other) {
if (this == other) {
return true;
}
if (other == null) {
return false;
}
if (this.size != other.size) {
return false;
}
final char[] thisBuf = this.buffer;
final char[] otherBuf = other.buffer;
for (int i = size - 1; i >= 0; i--) {
if (thisBuf[i] != otherBuf[i]) {
return false;
}
}
return true;
}
/**
* Checks the contents of this builder against another to see if they
* contain the same character content.
*
* @param obj the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
@Override
public boolean equals(final Object obj) {
return obj instanceof StrBuilder
&& equals((StrBuilder) obj);
}
/**
* Gets a suitable hash code for this builder.
*
* @return a hash code
*/
@Override
public int hashCode() {
final char[] buf = buffer;
int hash = 0;
for (int i = size - 1; i >= 0; i--) {
hash = 31 * hash + buf[i];
}
return hash;
}
//-----------------------------------------------------------------------
/**
* Gets a String version of the string builder, creating a new instance
* each time the method is called.
*
* Note that unlike StringBuffer, the string version returned is
* independent of the string builder.
*
* @return The builder as a String
*/
@Override
public String toString() {
return new String(buffer, 0, size);
}
/**
* Gets a StringBuffer version of the string builder, creating a
* new instance each time the method is called.
*
* @return The builder as a StringBuffer
*/
public StringBuffer toStringBuffer() {
return new StringBuffer(size).append(buffer, 0, size);
}
/**
* Gets a StringBuilder version of the string builder, creating a
* new instance each time the method is called.
*
* @return The builder as a StringBuilder
*/
public StringBuilder toStringBuilder() {
return new StringBuilder(size).append(buffer, 0, size);
}
/**
* Implement the {@link Builder} interface.
* @return The builder as a String
* @see #toString()
*/
@Override
public String build() {
return toString();
}
//-----------------------------------------------------------------------
/**
* Validates parameters defining a range of the builder.
*
* @param startIndex the start index, inclusive, must be valid
* @param endIndex the end index, exclusive, must be valid except
* that if too large it is treated as end of string
* @return The new string
* @throws IndexOutOfBoundsException if the index is invalid
*/
protected int validateRange(final int startIndex, int endIndex) {
if (startIndex < 0) {
throw new StringIndexOutOfBoundsException(startIndex);
}
if (endIndex > size) {
endIndex = size;
}
if (startIndex > endIndex) {
throw new StringIndexOutOfBoundsException("end < start");
}
return endIndex;
}
/**
* Validates parameters defining a single index in the builder.
*
* @param index the index, must be valid
* @throws IndexOutOfBoundsException if the index is invalid
*/
protected void validateIndex(final int index) {
if (index < 0 || index > size) {
throw new StringIndexOutOfBoundsException(index);
}
}
//-----------------------------------------------------------------------
/**
* Inner class to allow StrBuilder to operate as a tokenizer.
*/
class StrBuilderTokenizer extends StrTokenizer {
/**
* Default constructor.
*/
StrBuilderTokenizer() {
super();
}
/** {@inheritDoc} */
@Override
protected List
* This class represents the simplest form of a string to string map. It has a benefit over a map in that it can create
* the result on demand based on the key.
*
* This class comes complete with various factory methods. If these do not suffice, you can subclass and implement your
* own matcher.
*
* For example, it would be possible to implement a lookup that used the key as a primary key, and looked up the value
* on demand from the database
*
* @param
* If a security manager blocked access to system properties, then null will be returned from every lookup.
*
* If a null key is used, this lookup will throw a NullPointerException.
*
* @return a lookup using system properties, not null
*/
public static StrLookup
* If the map is null, then null will be returned from every lookup. The map result object is converted to a string
* using toString().
*
* @param
* If the ResourceBundle is null, then null will be returned from every lookup. The map result object is converted
* to a string using toString().
*
* @param resourceBundle the map of keys to values, may be null
* @return a lookup using the map, not null
* @see StringLookupFactory#resourceBundleStringLookup(String)
*/
public static StrLookup
* If the map is null, then null is returned. The map result object is converted to a string using toString().
*
* @param key the key to be looked up, may be null
* @return The matching value, null if no match
*/
@Override
public String lookup(final String key) {
if (map == null) {
return null;
}
final Object obj = map.get(key);
if (obj == null) {
return null;
}
return obj.toString();
}
@Override
public String toString() {
return super.toString() + " [map=" + map + "]";
}
}
// -----------------------------------------------------------------------
/**
* Lookup implementation based on a ResourceBundle.
*/
private static final class ResourceBundleLookup extends StrLookup
* This class comes complete with various factory methods.
* If these do not suffice, you can subclass and implement your own matcher.
*
* @since 1.0
* @deprecated Deprecated as of 1.3, use {@link StringMatcherFactory} instead. This class will be removed in 2.0.
*/
@Deprecated
public abstract class StrMatcher {
/**
* Matches the comma character.
*/
private static final StrMatcher COMMA_MATCHER = new CharMatcher(',');
/**
* Matches the tab character.
*/
private static final StrMatcher TAB_MATCHER = new CharMatcher('\t');
/**
* Matches the space character.
*/
private static final StrMatcher SPACE_MATCHER = new CharMatcher(' ');
/**
* Matches the same characters as StringTokenizer,
* namely space, tab, newline, form feed.
*/
private static final StrMatcher SPLIT_MATCHER = new CharSetMatcher(" \t\n\r\f".toCharArray());
/**
* Matches the String trim() whitespace characters.
*/
private static final StrMatcher TRIM_MATCHER = new TrimMatcher();
/**
* Matches the double quote character.
*/
private static final StrMatcher SINGLE_QUOTE_MATCHER = new CharMatcher('\'');
/**
* Matches the double quote character.
*/
private static final StrMatcher DOUBLE_QUOTE_MATCHER = new CharMatcher('"');
/**
* Matches the single or double quote character.
*/
private static final StrMatcher QUOTE_MATCHER = new CharSetMatcher("'\"".toCharArray());
/**
* Matches no characters.
*/
private static final StrMatcher NONE_MATCHER = new NoMatcher();
// -----------------------------------------------------------------------
/**
* Returns a matcher which matches the comma character.
*
* @return a matcher for a comma
*/
public static StrMatcher commaMatcher() {
return COMMA_MATCHER;
}
/**
* Returns a matcher which matches the tab character.
*
* @return a matcher for a tab
*/
public static StrMatcher tabMatcher() {
return TAB_MATCHER;
}
/**
* Returns a matcher which matches the space character.
*
* @return a matcher for a space
*/
public static StrMatcher spaceMatcher() {
return SPACE_MATCHER;
}
/**
* Matches the same characters as StringTokenizer,
* namely space, tab, newline and form feed.
*
* @return The split matcher
*/
public static StrMatcher splitMatcher() {
return SPLIT_MATCHER;
}
/**
* Matches the String trim() whitespace characters.
*
* @return The trim matcher
*/
public static StrMatcher trimMatcher() {
return TRIM_MATCHER;
}
/**
* Returns a matcher which matches the single quote character.
*
* @return a matcher for a single quote
*/
public static StrMatcher singleQuoteMatcher() {
return SINGLE_QUOTE_MATCHER;
}
/**
* Returns a matcher which matches the double quote character.
*
* @return a matcher for a double quote
*/
public static StrMatcher doubleQuoteMatcher() {
return DOUBLE_QUOTE_MATCHER;
}
/**
* Returns a matcher which matches the single or double quote character.
*
* @return a matcher for a single or double quote
*/
public static StrMatcher quoteMatcher() {
return QUOTE_MATCHER;
}
/**
* Matches no characters.
*
* @return a matcher that matches nothing
*/
public static StrMatcher noneMatcher() {
return NONE_MATCHER;
}
/**
* Creates a matcher from a character.
*
* @param ch the character to match, must not be null
* @return a new Matcher for the given char
*/
public static StrMatcher charMatcher(final char ch) {
return new CharMatcher(ch);
}
/**
* Creates a matcher from a set of characters.
*
* @param chars the characters to match, null or empty matches nothing
* @return a new matcher for the given char[]
*/
public static StrMatcher charSetMatcher(final char... chars) {
if (chars == null || chars.length == 0) {
return NONE_MATCHER;
}
if (chars.length == 1) {
return new CharMatcher(chars[0]);
}
return new CharSetMatcher(chars);
}
/**
* Creates a matcher from a string representing a set of characters.
*
* @param chars the characters to match, null or empty matches nothing
* @return a new Matcher for the given characters
*/
public static StrMatcher charSetMatcher(final String chars) {
if (chars == null || chars.length() == 0) {
return NONE_MATCHER;
}
if (chars.length() == 1) {
return new CharMatcher(chars.charAt(0));
}
return new CharSetMatcher(chars.toCharArray());
}
/**
* Creates a matcher from a string.
*
* @param str the string to match, null or empty matches nothing
* @return a new Matcher for the given String
*/
public static StrMatcher stringMatcher(final String str) {
if (str == null || str.length() == 0) {
return NONE_MATCHER;
}
return new StringMatcher(str);
}
//-----------------------------------------------------------------------
/**
* Constructor.
*/
protected StrMatcher() {
super();
}
/**
* Returns the number of matching characters, or zero if there is no match.
*
* This method is called to check for a match.
* The parameter
* The character array may be larger than the active area to be matched.
* Only values in the buffer between the specified indices may be accessed.
*
* The matching code may check one character or many.
* It may check characters preceding
* It must return zero for no match, or a positive number if a match was found.
* The number indicates the number of characters that matched.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index (exclusive) of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
public abstract int isMatch(char[] buffer, int pos, int bufferStart, int bufferEnd);
/**
* Returns the number of matching characters, or zero if there is no match.
*
* This method is called to check for a match.
* The parameter
* The matching code may check one character or many.
* It may check characters preceding
* It must return zero for no match, or a positive number if a match was found.
* The number indicates the number of characters that matched.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
public int isMatch(final char[] buffer, final int pos) {
return isMatch(buffer, pos, 0, buffer.length);
}
//-----------------------------------------------------------------------
/**
* Class used to define a set of characters for matching purposes.
*/
static final class CharSetMatcher extends StrMatcher {
/** The set of characters to match. */
private final char[] chars;
/**
* Constructor that creates a matcher from a character array.
*
* @param chars the characters to match, must not be null
*/
CharSetMatcher(final char[] chars) {
super();
this.chars = chars.clone();
Arrays.sort(this.chars);
}
/**
* Returns whether or not the given character matches.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return Arrays.binarySearch(chars, buffer[pos]) >= 0 ? 1 : 0;
}
}
//-----------------------------------------------------------------------
/**
* Class used to define a character for matching purposes.
*/
static final class CharMatcher extends StrMatcher {
/** The character to match. */
private final char ch;
/**
* Constructor that creates a matcher that matches a single character.
*
* @param ch the character to match
*/
CharMatcher(final char ch) {
super();
this.ch = ch;
}
/**
* Returns whether or not the given character matches.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return ch == buffer[pos] ? 1 : 0;
}
}
//-----------------------------------------------------------------------
/**
* Class used to define a set of characters for matching purposes.
*/
static final class StringMatcher extends StrMatcher {
/** The string to match, as a character array. */
private final char[] chars;
/**
* Constructor that creates a matcher from a String.
*
* @param str the string to match, must not be null
*/
StringMatcher(final String str) {
super();
chars = str.toCharArray();
}
/**
* Returns whether or not the given text matches the stored string.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
@Override
public int isMatch(final char[] buffer, int pos, final int bufferStart, final int bufferEnd) {
final int len = chars.length;
if (pos + len > bufferEnd) {
return 0;
}
for (int i = 0; i < chars.length; i++, pos++) {
if (chars[i] != buffer[pos]) {
return 0;
}
}
return len;
}
@Override
public String toString() {
return super.toString() + ' ' + Arrays.toString(chars);
}
}
//-----------------------------------------------------------------------
/**
* Class used to match no characters.
*/
static final class NoMatcher extends StrMatcher {
/**
* Constructs a new instance of
* This class takes a piece of text and substitutes all the variables within it.
* The default definition of a variable is
* Variable values are typically resolved from a map, but could also be resolved
* from system properties, or by supplying a custom variable resolver.
*
* The simplest example is to use this class to replace Java System properties. For example:
*
* Typical usage of this class follows the following pattern: First an instance is created
* and initialized with the map that contains the values for the available variables.
* If a prefix and/or suffix for variables should be used other than the default ones,
* the appropriate settings can be performed. After that the
* Also, this class allows to set a default value for unresolved variables.
* The default value for a variable can be appended to the variable name after the variable
* default value delimiter. The default value of the variable default value delimiter is ':-',
* as in bash and other *nix shells, as those are arguably where the default ${} delimiter set originated.
* The variable default value delimiter can be manually set by calling {@link #setValueDelimiterMatcher(StrMatcher)},
* {@link #setValueDelimiter(char)} or {@link #setValueDelimiter(String)}.
* The following shows an example with variable default value settings:
*
* In addition to this usage pattern there are some static convenience methods that
* cover the most common use cases. These methods can be used without the need of
* manually creating an instance. However if multiple replace operations are to be
* performed, creating and reusing an instance of this class will be more efficient.
*
* Variable replacement works in a recursive way. Thus, if a variable value contains
* a variable then that variable will also be replaced. Cyclic replacements are
* detected and will cause an exception to be thrown.
*
* Sometimes the interpolation's result must contain a variable prefix. As an example
* take the following source text:
*
* In some complex scenarios you might even want to perform substitution in the
* names of variables, for instance
* This class is not thread safe.
* Only the specified portion of the string will be processed.
* The rest of the string is not processed, and is not returned.
*
* @param source the string to replace in, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
*/
public String replace(final String source, final int offset, final int length) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return source.substring(offset, offset + length);
}
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source array as a template.
* The array is not altered by this method.
*
* @param source the character array to replace in, not altered, null returns null
* @return The result of the replace operation
*/
public String replace(final char[] source) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(source.length).append(source);
substitute(buf, 0, source.length);
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source array as a template.
* The array is not altered by this method.
*
* Only the specified portion of the array will be processed.
* The rest of the array is not processed, and is not returned.
*
* @param source the character array to replace in, not altered, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
*/
public String replace(final char[] source, final int offset, final int length) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source buffer as a template.
* The buffer is not altered by this method.
*
* @param source the buffer to use as a template, not changed, null returns null
* @return The result of the replace operation
*/
public String replace(final StringBuffer source) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(source.length()).append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source buffer as a template.
* The buffer is not altered by this method.
*
* Only the specified portion of the buffer will be processed.
* The rest of the buffer is not processed, and is not returned.
*
* @param source the buffer to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
*/
public String replace(final StringBuffer source, final int offset, final int length) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source as a template.
* The source is not altered by this method.
*
* @param source the buffer to use as a template, not changed, null returns null
* @return The result of the replace operation
*/
public String replace(final CharSequence source) {
if (source == null) {
return null;
}
return replace(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source as a template.
* The source is not altered by this method.
*
* Only the specified portion of the buffer will be processed.
* The rest of the buffer is not processed, and is not returned.
*
* @param source the buffer to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
*/
public String replace(final CharSequence source, final int offset, final int length) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source builder as a template.
* The builder is not altered by this method.
*
* @param source the builder to use as a template, not changed, null returns null
* @return The result of the replace operation
*/
public String replace(final StrBuilder source) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(source.length()).append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values
* from the resolver using the given source builder as a template.
* The builder is not altered by this method.
*
* Only the specified portion of the builder will be processed.
* The rest of the builder is not processed, and is not returned.
*
* @param source the builder to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
*/
public String replace(final StrBuilder source, final int offset, final int length) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables in the given source object with
* their matching values from the resolver. The input source object is
* converted to a string using
* Only the specified portion of the buffer will be processed.
* The rest of the buffer is not processed, but it is not deleted.
*
* @param source the buffer to replace in, updated, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the buffer to be processed, must be valid
* @return true if altered
*/
public boolean replaceIn(final StringBuffer source, final int offset, final int length) {
if (source == null) {
return false;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return false;
}
source.replace(offset, offset + length, buf.toString());
return true;
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source buffer
* with their matching values from the resolver.
* The buffer is updated with the result.
*
* @param source the buffer to replace in, updated, null returns zero
* @return true if altered
*/
public boolean replaceIn(final StringBuilder source) {
if (source == null) {
return false;
}
return replaceIn(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source builder
* with their matching values from the resolver.
* The builder is updated with the result.
*
* Only the specified portion of the buffer will be processed.
* The rest of the buffer is not processed, but it is not deleted.
*
* @param source the buffer to replace in, updated, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the buffer to be processed, must be valid
* @return true if altered
*/
public boolean replaceIn(final StringBuilder source, final int offset, final int length) {
if (source == null) {
return false;
}
final StrBuilder buf = new StrBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return false;
}
source.replace(offset, offset + length, buf.toString());
return true;
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source
* builder with their matching values from the resolver.
*
* @param source the builder to replace in, updated, null returns zero
* @return true if altered
*/
public boolean replaceIn(final StrBuilder source) {
if (source == null) {
return false;
}
return substitute(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source
* builder with their matching values from the resolver.
*
* Only the specified portion of the builder will be processed.
* The rest of the builder is not processed, but it is not deleted.
*
* @param source the builder to replace in, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the builder to be processed, must be valid
* @return true if altered
*/
public boolean replaceIn(final StrBuilder source, final int offset, final int length) {
if (source == null) {
return false;
}
return substitute(source, offset, length);
}
//-----------------------------------------------------------------------
/**
* Internal method that substitutes the variables.
*
* Most users of this class do not need to call this method. This method will
* be called automatically by another (public) method.
*
* Writers of subclasses can override this method if they need access to
* the substitution process at the start or end.
*
* @param buf the string builder to substitute into, not null
* @param offset the start offset within the builder, must be valid
* @param length the length within the builder to be processed, must be valid
* @return true if altered
*/
protected boolean substitute(final StrBuilder buf, final int offset, final int length) {
return substitute(buf, offset, length, null) > 0;
}
/**
* Recursive handler for multiple levels of interpolation. This is the main
* interpolation method, which resolves the values of all variable references
* contained in the passed in text.
*
* @param buf the string builder to substitute into, not null
* @param offset the start offset within the builder, must be valid
* @param length the length within the builder to be processed, must be valid
* @param priorVariables the stack keeping track of the replaced variables, may be null
* @return The length change that occurs, unless priorVariables is null when the int
* represents a boolean flag as to whether any change occurred.
*/
private int substitute(final StrBuilder buf, final int offset, final int length, List
* Most users of this class do not need to call this method. This method is
* called automatically by the substitution process.
*
* Writers of subclasses can override this method if they need to alter
* how each substitution occurs. The method is passed the variable's name
* and must return the corresponding value. This implementation uses the
* {@link #getVariableResolver()} with the variable's name as the key.
*
* @param variableName the name of the variable, not null
* @param buf the buffer where the substitution is occurring, not null
* @param startPos the start position of the variable including the prefix, valid
* @param endPos the end position of the variable including the suffix, valid
* @return The variable's value or null if the variable is unknown
*/
protected String resolveVariable(final String variableName,
final StrBuilder buf,
final int startPos,
final int endPos) {
final StrLookup resolver = getVariableResolver();
if (resolver == null) {
return null;
}
return resolver.lookup(variableName);
}
// Escape
//-----------------------------------------------------------------------
/**
* Returns the escape character.
*
* @return The character used for escaping variable references
*/
public char getEscapeChar() {
return this.escapeChar;
}
/**
* Sets the escape character.
* If this character is placed before a variable reference in the source
* text, this variable will be ignored.
*
* @param escapeCharacter the escape character (0 for disabling escaping)
*/
public void setEscapeChar(final char escapeCharacter) {
this.escapeChar = escapeCharacter;
}
// Prefix
//-----------------------------------------------------------------------
/**
* Gets the variable prefix matcher currently in use.
*
* The variable prefix is the character or characters that identify the
* start of a variable. This prefix is expressed in terms of a matcher
* allowing advanced prefix matches.
*
* @return The prefix matcher in use
*/
public StrMatcher getVariablePrefixMatcher() {
return prefixMatcher;
}
/**
* Sets the variable prefix matcher currently in use.
*
* The variable prefix is the character or characters that identify the
* start of a variable. This prefix is expressed in terms of a matcher
* allowing advanced prefix matches.
*
* @param prefixMatcher the prefix matcher to use, null ignored
* @return this, to enable chaining
* @throws IllegalArgumentException if the prefix matcher is null
*/
public StrSubstitutor setVariablePrefixMatcher(final StrMatcher prefixMatcher) {
Validate.isTrue(prefixMatcher != null, "Variable prefix matcher must not be null!");
this.prefixMatcher = prefixMatcher;
return this;
}
/**
* Sets the variable prefix to use.
*
* The variable prefix is the character or characters that identify the
* start of a variable. This method allows a single character prefix to
* be easily set.
*
* @param prefix the prefix character to use
* @return this, to enable chaining
*/
public StrSubstitutor setVariablePrefix(final char prefix) {
return setVariablePrefixMatcher(StrMatcher.charMatcher(prefix));
}
/**
* Sets the variable prefix to use.
*
* The variable prefix is the character or characters that identify the
* start of a variable. This method allows a string prefix to be easily set.
*
* @param prefix the prefix for variables, not null
* @return this, to enable chaining
* @throws IllegalArgumentException if the prefix is null
*/
public StrSubstitutor setVariablePrefix(final String prefix) {
Validate.isTrue(prefix != null, "Variable prefix must not be null!");
return setVariablePrefixMatcher(StrMatcher.stringMatcher(prefix));
}
// Suffix
//-----------------------------------------------------------------------
/**
* Gets the variable suffix matcher currently in use.
*
* The variable suffix is the character or characters that identify the
* end of a variable. This suffix is expressed in terms of a matcher
* allowing advanced suffix matches.
*
* @return The suffix matcher in use
*/
public StrMatcher getVariableSuffixMatcher() {
return suffixMatcher;
}
/**
* Sets the variable suffix matcher currently in use.
*
* The variable suffix is the character or characters that identify the
* end of a variable. This suffix is expressed in terms of a matcher
* allowing advanced suffix matches.
*
* @param suffixMatcher the suffix matcher to use, null ignored
* @return this, to enable chaining
* @throws IllegalArgumentException if the suffix matcher is null
*/
public StrSubstitutor setVariableSuffixMatcher(final StrMatcher suffixMatcher) {
Validate.isTrue(suffixMatcher != null, "Variable suffix matcher must not be null!");
this.suffixMatcher = suffixMatcher;
return this;
}
/**
* Sets the variable suffix to use.
*
* The variable suffix is the character or characters that identify the
* end of a variable. This method allows a single character suffix to
* be easily set.
*
* @param suffix the suffix character to use
* @return this, to enable chaining
*/
public StrSubstitutor setVariableSuffix(final char suffix) {
return setVariableSuffixMatcher(StrMatcher.charMatcher(suffix));
}
/**
* Sets the variable suffix to use.
*
* The variable suffix is the character or characters that identify the
* end of a variable. This method allows a string suffix to be easily set.
*
* @param suffix the suffix for variables, not null
* @return this, to enable chaining
* @throws IllegalArgumentException if the suffix is null
*/
public StrSubstitutor setVariableSuffix(final String suffix) {
Validate.isTrue(suffix != null, "Variable suffix must not be null!");
return setVariableSuffixMatcher(StrMatcher.stringMatcher(suffix));
}
// Variable Default Value Delimiter
//-----------------------------------------------------------------------
/**
* Gets the variable default value delimiter matcher currently in use.
*
* The variable default value delimiter is the character or characters that delimite the
* variable name and the variable default value. This delimiter is expressed in terms of a matcher
* allowing advanced variable default value delimiter matches.
*
* If it returns null, then the variable default value resolution is disabled.
*
* @return The variable default value delimiter matcher in use, may be null
*/
public StrMatcher getValueDelimiterMatcher() {
return valueDelimiterMatcher;
}
/**
* Sets the variable default value delimiter matcher to use.
*
* The variable default value delimiter is the character or characters that delimite the
* variable name and the variable default value. This delimiter is expressed in terms of a matcher
* allowing advanced variable default value delimiter matches.
*
* If the
* The variable default value delimiter is the character or characters that delimite the
* variable name and the variable default value. This method allows a single character
* variable default value delimiter to be easily set.
*
* @param valueDelimiter the variable default value delimiter character to use
* @return this, to enable chaining
*/
public StrSubstitutor setValueDelimiter(final char valueDelimiter) {
return setValueDelimiterMatcher(StrMatcher.charMatcher(valueDelimiter));
}
/**
* Sets the variable default value delimiter to use.
*
* The variable default value delimiter is the character or characters that delimite the
* variable name and the variable default value. This method allows a string
* variable default value delimiter to be easily set.
*
* If the
* This class can split a String into many smaller strings. It aims
* to do a similar job to {@link java.util.StringTokenizer StringTokenizer},
* however it offers much more control and flexibility including implementing
* the
* The input String is split into a number of tokens.
* Each token is separated from the next String by a delimiter.
* One or more delimiter characters must be specified.
*
* Each token may be surrounded by quotes.
* The quote matcher specifies the quote character(s).
* A quote may be escaped within a quoted section by duplicating itself.
*
* Between each token and the delimiter are potentially characters that need trimming.
* The trimmer matcher specifies these characters.
* One usage might be to trim whitespace characters.
*
* At any point outside the quotes there might potentially be invalid characters.
* The ignored matcher specifies these characters to be removed.
* One usage might be to remove new line characters.
*
* Empty tokens may be removed or returned as null.
*
* You must call a "reset" method to set the string which you want to parse.
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StrTokenizer getCSVInstance() {
return getCSVClone();
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings
* initializing it with the given input. The default for CSV processing
* will be trim whitespace from both ends (which can be overridden with
* the setTrimmer method).
*
* @param input the text to parse
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StrTokenizer getCSVInstance(final String input) {
final StrTokenizer tok = getCSVClone();
tok.reset(input);
return tok;
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings
* initializing it with the given input. The default for CSV processing
* will be trim whitespace from both ends (which can be overridden with
* the setTrimmer method).
*
* @param input the text to parse
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StrTokenizer getCSVInstance(final char[] input) {
final StrTokenizer tok = getCSVClone();
tok.reset(input);
return tok;
}
/**
* Returns a clone of
* You must call a "reset" method to set the string which you want to parse.
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StrTokenizer getTSVInstance() {
return getTSVClone();
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings.
* The default for CSV processing will be trim whitespace from both ends
* (which can be overridden with the setTrimmer method).
* @param input the string to parse
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StrTokenizer getTSVInstance(final String input) {
final StrTokenizer tok = getTSVClone();
tok.reset(input);
return tok;
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings.
* The default for CSV processing will be trim whitespace from both ends
* (which can be overridden with the setTrimmer method).
* @param input the string to parse
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StrTokenizer getTSVInstance(final char[] input) {
final StrTokenizer tok = getTSVClone();
tok.reset(input);
return tok;
}
//-----------------------------------------------------------------------
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed
* as per StringTokenizer, but with no text to tokenize.
*
* This constructor is normally used with {@link #reset(String)}.
*/
public StrTokenizer() {
super();
this.chars = null;
}
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed
* as per StringTokenizer.
*
* @param input the string which is to be parsed
*/
public StrTokenizer(final String input) {
super();
if (input != null) {
chars = input.toCharArray();
} else {
chars = null;
}
}
/**
* Constructs a tokenizer splitting on the specified delimiter character.
*
* @param input the string which is to be parsed
* @param delim the field delimiter character
*/
public StrTokenizer(final String input, final char delim) {
this(input);
setDelimiterChar(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter string.
*
* @param input the string which is to be parsed
* @param delim the field delimiter string
*/
public StrTokenizer(final String input, final String delim) {
this(input);
setDelimiterString(delim);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher.
*
* @param input the string which is to be parsed
* @param delim the field delimiter matcher
*/
public StrTokenizer(final String input, final StrMatcher delim) {
this(input);
setDelimiterMatcher(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter character
* and handling quotes using the specified quote character.
*
* @param input the string which is to be parsed
* @param delim the field delimiter character
* @param quote the field quoted string character
*/
public StrTokenizer(final String input, final char delim, final char quote) {
this(input, delim);
setQuoteChar(quote);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher
* and handling quotes using the specified quote matcher.
*
* @param input the string which is to be parsed
* @param delim the field delimiter matcher
* @param quote the field quoted string matcher
*/
public StrTokenizer(final String input, final StrMatcher delim, final StrMatcher quote) {
this(input, delim);
setQuoteMatcher(quote);
}
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed
* as per StringTokenizer.
*
* @param input the string which is to be parsed, not cloned
*/
public StrTokenizer(final char[] input) {
super();
if (input == null) {
this.chars = null;
} else {
this.chars = input.clone();
}
}
/**
* Constructs a tokenizer splitting on the specified character.
*
* @param input the string which is to be parsed, not cloned
* @param delim the field delimiter character
*/
public StrTokenizer(final char[] input, final char delim) {
this(input);
setDelimiterChar(delim);
}
/**
* Constructs a tokenizer splitting on the specified string.
*
* @param input the string which is to be parsed, not cloned
* @param delim the field delimiter string
*/
public StrTokenizer(final char[] input, final String delim) {
this(input);
setDelimiterString(delim);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher.
*
* @param input the string which is to be parsed, not cloned
* @param delim the field delimiter matcher
*/
public StrTokenizer(final char[] input, final StrMatcher delim) {
this(input);
setDelimiterMatcher(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter character
* and handling quotes using the specified quote character.
*
* @param input the string which is to be parsed, not cloned
* @param delim the field delimiter character
* @param quote the field quoted string character
*/
public StrTokenizer(final char[] input, final char delim, final char quote) {
this(input, delim);
setQuoteChar(quote);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher
* and handling quotes using the specified quote matcher.
*
* @param input the string which is to be parsed, not cloned
* @param delim the field delimiter character
* @param quote the field quoted string character
*/
public StrTokenizer(final char[] input, final StrMatcher delim, final StrMatcher quote) {
this(input, delim);
setQuoteMatcher(quote);
}
// API
//-----------------------------------------------------------------------
/**
* Gets the number of tokens found in the String.
*
* @return The number of matched tokens
*/
public int size() {
checkTokenized();
return tokens.length;
}
/**
* Gets the next token from the String.
* Equivalent to {@link #next()} except it returns null rather than
* throwing {@link NoSuchElementException} when no tokens remain.
*
* @return The next sequential token, or null when no more tokens are found
*/
public String nextToken() {
if (hasNext()) {
return tokens[tokenPos++];
}
return null;
}
/**
* Gets the previous token from the String.
*
* @return The previous sequential token, or null when no more tokens are found
*/
public String previousToken() {
if (hasPrevious()) {
return tokens[--tokenPos];
}
return null;
}
/**
* Gets a copy of the full token list as an independent modifiable array.
*
* @return The tokens as a String array
*/
public String[] getTokenArray() {
checkTokenized();
return tokens.clone();
}
/**
* Gets a copy of the full token list as an independent modifiable list.
*
* @return The tokens as a String array
*/
public List
* This method allows the same tokenizer to be reused for the same String.
*
* @return this, to enable chaining
*/
public StrTokenizer reset() {
tokenPos = 0;
tokens = null;
return this;
}
/**
* Reset this tokenizer, giving it a new input string to parse.
* In this manner you can re-use a tokenizer with the same settings
* on multiple input lines.
*
* @param input the new string to tokenize, null sets no text to parse
* @return this, to enable chaining
*/
public StrTokenizer reset(final String input) {
reset();
if (input != null) {
this.chars = input.toCharArray();
} else {
this.chars = null;
}
return this;
}
/**
* Reset this tokenizer, giving it a new input string to parse.
* In this manner you can re-use a tokenizer with the same settings
* on multiple input lines.
*
* @param input the new character array to tokenize, not cloned, null sets no text to parse
* @return this, to enable chaining
*/
public StrTokenizer reset(final char[] input) {
reset();
if (input != null) {
this.chars = input.clone();
} else {
this.chars = null;
}
return this;
}
// ListIterator
//-----------------------------------------------------------------------
/**
* Checks whether there are any more tokens.
*
* @return true if there are more tokens
*/
@Override
public boolean hasNext() {
checkTokenized();
return tokenPos < tokens.length;
}
/**
* Gets the next token.
*
* @return The next String token
* @throws NoSuchElementException if there are no more elements
*/
@Override
public String next() {
if (hasNext()) {
return tokens[tokenPos++];
}
throw new NoSuchElementException();
}
/**
* Gets the index of the next token to return.
*
* @return The next token index
*/
@Override
public int nextIndex() {
return tokenPos;
}
/**
* Checks whether there are any previous tokens that can be iterated to.
*
* @return true if there are previous tokens
*/
@Override
public boolean hasPrevious() {
checkTokenized();
return tokenPos > 0;
}
/**
* Gets the token previous to the last returned token.
*
* @return The previous token
*/
@Override
public String previous() {
if (hasPrevious()) {
return tokens[--tokenPos];
}
throw new NoSuchElementException();
}
/**
* Gets the index of the previous token.
*
* @return The previous token index
*/
@Override
public int previousIndex() {
return tokenPos - 1;
}
/**
* Unsupported ListIterator operation.
*
* @throws UnsupportedOperationException always
*/
@Override
public void remove() {
throw new UnsupportedOperationException("remove() is unsupported");
}
/**
* Unsupported ListIterator operation.
* @param obj this parameter ignored.
* @throws UnsupportedOperationException always
*/
@Override
public void set(final String obj) {
throw new UnsupportedOperationException("set() is unsupported");
}
/**
* Unsupported ListIterator operation.
* @param obj this parameter ignored.
* @throws UnsupportedOperationException always
*/
@Override
public void add(final String obj) {
throw new UnsupportedOperationException("add() is unsupported");
}
// Implementation
//-----------------------------------------------------------------------
/**
* Checks if tokenization has been done, and if not then do it.
*/
private void checkTokenized() {
if (tokens == null) {
if (chars == null) {
// still call tokenize as subclass may do some work
final List
* Most users of this class do not need to call this method. This method
* will be called automatically by other (public) methods when required.
*
* This method exists to allow subclasses to add code before or after the
* tokenization. For example, a subclass could alter the character array,
* offset or count to be parsed, or call the tokenizer multiple times on
* multiple strings. It is also be possible to filter the results.
*
*
* The delimiter is used to separate one token from another.
*
* @param delim the delimiter matcher to use
* @return this, to enable chaining
*/
public StrTokenizer setDelimiterMatcher(final StrMatcher delim) {
if (delim == null) {
this.delimMatcher = StrMatcher.noneMatcher();
} else {
this.delimMatcher = delim;
}
return this;
}
/**
* Sets the field delimiter character.
*
* @param delim the delimiter character to use
* @return this, to enable chaining
*/
public StrTokenizer setDelimiterChar(final char delim) {
return setDelimiterMatcher(StrMatcher.charMatcher(delim));
}
/**
* Sets the field delimiter string.
*
* @param delim the delimiter string to use
* @return this, to enable chaining
*/
public StrTokenizer setDelimiterString(final String delim) {
return setDelimiterMatcher(StrMatcher.stringMatcher(delim));
}
// Quote
//-----------------------------------------------------------------------
/**
* Gets the quote matcher currently in use.
*
* The quote character is used to wrap data between the tokens.
* This enables delimiters to be entered as data.
* The default value is '"' (double quote).
*
* @return The quote matcher in use
*/
public StrMatcher getQuoteMatcher() {
return quoteMatcher;
}
/**
* Set the quote matcher to use.
*
* The quote character is used to wrap data between the tokens.
* This enables delimiters to be entered as data.
*
* @param quote the quote matcher to use, null ignored
* @return this, to enable chaining
*/
public StrTokenizer setQuoteMatcher(final StrMatcher quote) {
if (quote != null) {
this.quoteMatcher = quote;
}
return this;
}
/**
* Sets the quote character to use.
*
* The quote character is used to wrap data between the tokens.
* This enables delimiters to be entered as data.
*
* @param quote the quote character to use
* @return this, to enable chaining
*/
public StrTokenizer setQuoteChar(final char quote) {
return setQuoteMatcher(StrMatcher.charMatcher(quote));
}
// Ignored
//-----------------------------------------------------------------------
/**
* Gets the ignored character matcher.
*
* These characters are ignored when parsing the String, unless they are
* within a quoted region.
* The default value is not to ignore anything.
*
* @return The ignored matcher in use
*/
public StrMatcher getIgnoredMatcher() {
return ignoredMatcher;
}
/**
* Set the matcher for characters to ignore.
*
* These characters are ignored when parsing the String, unless they are
* within a quoted region.
*
* @param ignored the ignored matcher to use, null ignored
* @return this, to enable chaining
*/
public StrTokenizer setIgnoredMatcher(final StrMatcher ignored) {
if (ignored != null) {
this.ignoredMatcher = ignored;
}
return this;
}
/**
* Set the character to ignore.
*
* This character is ignored when parsing the String, unless it is
* within a quoted region.
*
* @param ignored the ignored character to use
* @return this, to enable chaining
*/
public StrTokenizer setIgnoredChar(final char ignored) {
return setIgnoredMatcher(StrMatcher.charMatcher(ignored));
}
// Trimmer
//-----------------------------------------------------------------------
/**
* Gets the trimmer character matcher.
*
* These characters are trimmed off on each side of the delimiter
* until the token or quote is found.
* The default value is not to trim anything.
*
* @return The trimmer matcher in use
*/
public StrMatcher getTrimmerMatcher() {
return trimmerMatcher;
}
/**
* Sets the matcher for characters to trim.
*
* These characters are trimmed off on each side of the delimiter
* until the token or quote is found.
*
* @param trimmer the trimmer matcher to use, null ignored
* @return this, to enable chaining
*/
public StrTokenizer setTrimmerMatcher(final StrMatcher trimmer) {
if (trimmer != null) {
this.trimmerMatcher = trimmer;
}
return this;
}
//-----------------------------------------------------------------------
/**
* Gets whether the tokenizer currently returns empty tokens as null.
* The default for this property is false.
*
* @return true if empty tokens are returned as null
*/
public boolean isEmptyTokenAsNull() {
return this.emptyAsNull;
}
/**
* Sets whether the tokenizer should return empty tokens as null.
* The default for this property is false.
*
* @param emptyAsNull whether empty tokens are returned as null
* @return this, to enable chaining
*/
public StrTokenizer setEmptyTokenAsNull(final boolean emptyAsNull) {
this.emptyAsNull = emptyAsNull;
return this;
}
//-----------------------------------------------------------------------
/**
* Gets whether the tokenizer currently ignores empty tokens.
* The default for this property is true.
*
* @return true if empty tokens are not returned
*/
public boolean isIgnoreEmptyTokens() {
return ignoreEmptyTokens;
}
/**
* Sets whether the tokenizer should ignore and not return empty tokens.
* The default for this property is true.
*
* @param ignoreEmptyTokens whether empty tokens are not returned
* @return this, to enable chaining
*/
public StrTokenizer setIgnoreEmptyTokens(final boolean ignoreEmptyTokens) {
this.ignoreEmptyTokens = ignoreEmptyTokens;
return this;
}
//-----------------------------------------------------------------------
/**
* Gets the String content that the tokenizer is parsing.
*
* @return The string content being parsed
*/
public String getContent() {
if (chars == null) {
return null;
}
return new String(chars);
}
//-----------------------------------------------------------------------
/**
* Creates a new instance of this Tokenizer. The new instance is reset so
* that it will be at the start of the token list.
* If a {@link CloneNotSupportedException} is caught, return Escapes and unescapes {@code String}s for
* Java, Java Script, HTML and XML. #ThreadSafe#
* This code has been adapted from Apache Commons Lang 3.5.
* {@code StringEscapeUtils} instances should NOT be constructed in
* standard programming. Instead, the class should be used as: This constructor is public to permit tools that require a JavaBean
* instance to operate. Convenience wrapper for {@link java.lang.StringBuilder} providing escape methods. Example: Escape {@code input} according to the given {@link CharSequenceTranslator}. Return the escaped string. Escapes the characters in a {@code String} using Java String rules. Deals correctly with quotes and control-chars (tab, backslash, cr, ff, etc.) So a tab becomes the characters {@code '\\'} and
* {@code 't'}. The only difference between Java strings and JavaScript strings
* is that in JavaScript, a single quote and forward-slash (/) are escaped. Example: Escapes the characters in a {@code String} using EcmaScript String rules. Escapes any values it finds into their EcmaScript String form.
* Deals correctly with quotes and control-chars (tab, backslash, cr, ff, etc.) So a tab becomes the characters {@code '\\'} and
* {@code 't'}. The only difference between Java strings and EcmaScript strings
* is that in EcmaScript, a single quote and forward-slash (/) are escaped. Note that EcmaScript is best known by the JavaScript and ActionScript dialects. Example: Escapes the characters in a {@code String} using Json String rules. Escapes any values it finds into their Json String form.
* Deals correctly with quotes and control-chars (tab, backslash, cr, ff, etc.) So a tab becomes the characters {@code '\\'} and
* {@code 't'}. The only difference between Java strings and Json strings
* is that in Json, forward-slash (/) is escaped. See http://www.ietf.org/rfc/rfc4627.txt for further details. Example: Unescapes any Java literals found in the {@code String}.
* For example, it will turn a sequence of {@code '\'} and
* {@code 'n'} into a newline character, unless the {@code '\'}
* is preceded by another {@code '\'}. Unescapes any EcmaScript literals found in the {@code String}. For example, it will turn a sequence of {@code '\'} and {@code 'n'}
* into a newline character, unless the {@code '\'} is preceded by another
* {@code '\'}. Unescapes any Json literals found in the {@code String}. For example, it will turn a sequence of {@code '\'} and {@code 'n'}
* into a newline character, unless the {@code '\'} is preceded by another
* {@code '\'}. Escapes the characters in a {@code String} using HTML entities.
* For example:
*
* Supports all known HTML 4.0 entities, including funky accents.
* Note that the commonly used apostrophe escape character (')
* is not a legal entity and so is not supported). Escapes the characters in a {@code String} using HTML entities. Supports only the HTML 3.0 entities. Unescapes a string containing entity escapes to a string
* containing the actual Unicode characters corresponding to the
* escapes. Supports HTML 4.0 entities. For example, the string {@code "<Français>"}
* will become {@code " If an entity is unrecognized, it is left alone, and inserted
* verbatim into the result string. e.g. {@code ">&zzzz;x"} will
* become {@code ">&zzzz;x"}. Unescapes a string containing entity escapes to a string
* containing the actual Unicode characters corresponding to the
* escapes. Supports only HTML 3.0 entities. Escapes the characters in a {@code String} using XML entities. For example: {@code "bread" & "butter"} =>
* {@code "bread" & "butter"}.
* Note that XML 1.0 is a text-only format: it cannot represent control
* characters or unpaired Unicode surrogate codepoints, even after escaping.
* {@code escapeXml10} will remove characters that do not fit in the
* following ranges: {@code #x9 | #xA | #xD | [#x20-#xD7FF] | [#xE000-#xFFFD] | [#x10000-#x10FFFF]} Though not strictly necessary, {@code escapeXml10} will escape
* characters in the following ranges: {@code [#x7F-#x84] | [#x86-#x9F]} The returned string can be inserted into a valid XML 1.0 or XML 1.1
* document. If you want to allow more non-text characters in an XML 1.1
* document, use {@link #escapeXml11(String)}. Escapes the characters in a {@code String} using XML entities. For example: {@code "bread" & "butter"} =>
* {@code "bread" & "butter"}.
* XML 1.1 can represent certain control characters, but it cannot represent
* the null byte or unpaired Unicode surrogate codepoints, even after escaping.
* {@code escapeXml11} will remove characters that do not fit in the following
* ranges: {@code [#x1-#xD7FF] | [#xE000-#xFFFD] | [#x10000-#x10FFFF]} {@code escapeXml11} will escape characters in the following ranges: {@code [#x1-#x8] | [#xB-#xC] | [#xE-#x1F] | [#x7F-#x84] | [#x86-#x9F]} The returned string can be inserted into a valid XML 1.1 document. Do not
* use it for XML 1.0 documents. Unescapes a string containing XML entity escapes to a string
* containing the actual Unicode characters corresponding to the
* escapes. Supports only the five basic XML entities (gt, lt, quot, amp, apos).
* Does not support DTDs or external entities. Note that numerical \\u Unicode codes are unescaped to their respective
* Unicode characters. This may change in future releases. Returns a {@code String} value for a CSV column enclosed in double quotes,
* if required. If the value contains a comma, newline or double quote, then the
* String value is returned enclosed in double quotes. Any double quote characters in the value are escaped with another double quote. If the value does not contain a comma, newline or double quote, then the
* String value is returned unchanged. Returns a {@code String} value for an unescaped CSV column. If the value is enclosed in double quotes, and contains a comma, newline
* or double quote, then quotes are removed.
* Any double quote escaped characters (a pair of double quotes) are unescaped
* to just one double quote. If the value is not enclosed in double quotes, or is and does not contain a
* comma, newline or double quote, then the String value is returned unchanged. Escapes the characters in a {@code String} using XSI rules. Beware! In most cases you don't want to escape shell commands but use multi-argument
* methods provided by {@link java.lang.ProcessBuilder} or {@link java.lang.Runtime#exec(String[])}
* instead. Example: Unescapes the characters in a {@code String} using XSI rules.
* This class takes a piece of text and substitutes all the variables within it. The default definition of a variable is
*
* Variable values are typically resolved from a map, but could also be resolved from system properties, or by supplying
* a custom variable resolver.
*
* The simplest example is to use this class to replace Java System properties. For example:
*
* Typical usage of this class follows the following pattern: First an instance is created and initialized with the map
* that contains the values for the available variables. If a prefix and/or suffix for variables should be used other
* than the default ones, the appropriate settings can be performed. After that the {@code replace()} method can be
* called passing in the source text for interpolation. In the returned text all variable references (as long as their
* values are known) will be resolved. The following example demonstrates this:
*
* yielding:
*
* This class lets you set a default value for unresolved variables. The default value for a variable can be appended to
* the variable name after the variable default value delimiter. The default value of the variable default value
* delimiter is ':-', as in bash and other *nix shells, as those are arguably where the default ${} delimiter set
* originated. The variable default value delimiter can be manually set by calling
* {@link #setValueDelimiterMatcher(StringMatcher)}, {@link #setValueDelimiter(char)} or
* {@link #setValueDelimiter(String)}. The following shows an example with variable default value settings:
*
* yielding:
*
* {@code StringSubstitutor} supports throwing exceptions for unresolved variables, you enable this by setting calling
* {@link #setEnableUndefinedVariableException(boolean)} with {@code true}.
*
* In addition to this usage pattern there are some static convenience methods that cover the most common use cases.
* These methods can be used without the need of manually creating an instance. However if multiple replace operations
* are to be performed, creating and reusing an instance of this class will be more efficient.
*
* This class is not thread safe.
*
* The default interpolator let's you use string lookups like:
*
* For documentation of each lookup, see {@link StringLookupFactory}.
*
* Variable replacement works in a recursive way. Thus, if a variable value contains a variable then that variable will
* also be replaced. Cyclic replacements are detected and will cause an exception to be thrown.
*
* Sometimes the interpolation's result must contain a variable prefix. As an example take the following source text:
*
* Here only the variable's name referred to in the text should be replaced resulting in the text (assuming that the
* value of the {@code name} variable is {@code x}):
*
* To achieve this effect there are two possibilities: Either set a different prefix and suffix for variables which do
* not conflict with the result text you want to produce. The other possibility is to use the escape character, by
* default '$'. If this character is placed before a variable reference, this reference is ignored and won't be
* replaced. For example:
*
* In some complex scenarios you might even want to perform substitution in the names of variables, for instance
*
* {@code StringSubstitutor} supports this recursive substitution in variable names, but it has to be enabled explicitly
* by calling {@link #setEnableSubstitutionInVariables(boolean)} with {@code true}.
*
* This StringSubstitutor lets you perform substituions like:
*
* The variable default value delimiter is the character or characters that delimite the variable name and the
* variable default value. This delimiter is expressed in terms of a matcher allowing advanced variable default
* value delimiter matches.
*
* If it returns null, then the variable default value resolution is disabled.
*
* @return The variable default value delimiter matcher in use, may be null
*/
public StringMatcher getValueDelimiterMatcher() {
return valueDelimiterMatcher;
}
// Prefix
// -----------------------------------------------------------------------
/**
* Gets the variable prefix matcher currently in use.
*
* The variable prefix is the character or characters that identify the start of a variable. This prefix is
* expressed in terms of a matcher allowing advanced prefix matches.
*
* @return The prefix matcher in use
*/
public StringMatcher getVariablePrefixMatcher() {
return prefixMatcher;
}
// Suffix
// -----------------------------------------------------------------------
/**
* Gets the variable suffix matcher currently in use.
*
* The variable suffix is the character or characters that identify the end of a variable. This suffix is expressed
* in terms of a matcher allowing advanced suffix matches.
*
* @return The suffix matcher in use
*/
public StringMatcher getVariableSuffixMatcher() {
return suffixMatcher;
}
/**
* Returns a flag whether substitution is disabled in variable values.If set to true, the values of variables
* can contain other variables will not be processed and substituted original variable is evaluated, e.g.
*
*
* Only the specified portion of the array will be processed. The rest of the array is not processed, and is not
* returned.
*
* @param source the character array to replace in, not altered, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final char[] source, final int offset, final int length) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source as
* a template. The source is not altered by this method.
*
* @param source the buffer to use as a template, not changed, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final CharSequence source) {
if (source == null) {
return null;
}
return replace(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source as
* a template. The source is not altered by this method.
*
* Only the specified portion of the buffer will be processed. The rest of the buffer is not processed, and is not
* returned.
*
* @param source the buffer to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final CharSequence source, final int offset, final int length) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source.toString(), offset, length);
substitute(buf, 0, length);
return buf.toString();
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables in the given source object with their matching values from the
* resolver. The input source object is converted to a string using
* Only the specified portion of the string will be processed. The rest of the string is not processed, and is not
* returned.
*
* @param source the string to replace in, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final String source, final int offset, final int length) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return source.substring(offset, offset + length);
}
return buf.toString();
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* buffer as a template. The buffer is not altered by this method.
*
* @param source the buffer to use as a template, not changed, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final StringBuffer source) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(source.length()).append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* buffer as a template. The buffer is not altered by this method.
*
* Only the specified portion of the buffer will be processed. The rest of the buffer is not processed, and is not
* returned.
*
* @param source the buffer to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final StringBuffer source, final int offset, final int length) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* builder as a template. The builder is not altered by this method.
*
* @param source the builder to use as a template, not changed, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final TextStringBuilder source) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(source.length()).append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* builder as a template. The builder is not altered by this method.
*
* Only the specified portion of the builder will be processed. The rest of the builder is not processed, and is not
* returned.
*
* @param source the builder to use as a template, not changed, null returns null
* @param offset the start offset within the array, must be valid
* @param length the length within the array to be processed, must be valid
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final TextStringBuilder source, final int offset, final int length) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
substitute(buf, 0, length);
return buf.toString();
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source buffer with their matching values from the
* resolver. The buffer is updated with the result.
*
* @param source the buffer to replace in, updated, null returns zero
* @return true if altered
*/
public boolean replaceIn(final StringBuffer source) {
if (source == null) {
return false;
}
return replaceIn(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source buffer with their matching values from the
* resolver. The buffer is updated with the result.
*
* Only the specified portion of the buffer will be processed. The rest of the buffer is not processed, but it is
* not deleted.
*
* @param source the buffer to replace in, updated, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the buffer to be processed, must be valid
* @return true if altered
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public boolean replaceIn(final StringBuffer source, final int offset, final int length) {
if (source == null) {
return false;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return false;
}
source.replace(offset, offset + length, buf.toString());
return true;
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source buffer with their matching values from the
* resolver. The buffer is updated with the result.
*
* @param source the buffer to replace in, updated, null returns zero
* @return true if altered
*/
public boolean replaceIn(final StringBuilder source) {
if (source == null) {
return false;
}
return replaceIn(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source builder with their matching values from the
* resolver. The builder is updated with the result.
*
* Only the specified portion of the buffer will be processed. The rest of the buffer is not processed, but it is
* not deleted.
*
* @param source the buffer to replace in, updated, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the buffer to be processed, must be valid
* @return true if altered
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public boolean replaceIn(final StringBuilder source, final int offset, final int length) {
if (source == null) {
return false;
}
final TextStringBuilder buf = new TextStringBuilder(length).append(source, offset, length);
if (!substitute(buf, 0, length)) {
return false;
}
source.replace(offset, offset + length, buf.toString());
return true;
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source builder with their matching values from the
* resolver.
*
* @param source the builder to replace in, updated, null returns zero
* @return true if altered
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public boolean replaceIn(final TextStringBuilder source) {
if (source == null) {
return false;
}
return substitute(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source builder with their matching values from the
* resolver.
*
* Only the specified portion of the builder will be processed. The rest of the builder is not processed, but it is
* not deleted.
*
* @param source the builder to replace in, null returns zero
* @param offset the start offset within the array, must be valid
* @param length the length within the builder to be processed, must be valid
* @return true if altered
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public boolean replaceIn(final TextStringBuilder source, final int offset, final int length) {
if (source == null) {
return false;
}
return substitute(source, offset, length);
}
/**
* Internal method that resolves the value of a variable.
*
* Most users of this class do not need to call this method. This method is called automatically by the substitution
* process.
*
* Writers of subclasses can override this method if they need to alter how each substitution occurs. The method is
* passed the variable's name and must return the corresponding value. This implementation uses the
* {@link #getStringLookup()} with the variable's name as the key.
*
* @param variableName the name of the variable, not null
* @param buf the buffer where the substitution is occurring, not null
* @param startPos the start position of the variable including the prefix, valid
* @param endPos the end position of the variable including the suffix, valid
* @return The variable's value or null if the variable is unknown
*/
protected String resolveVariable(final String variableName, final TextStringBuilder buf, final int startPos,
final int endPos) {
final StringLookup resolver = getStringLookup();
if (resolver == null) {
return null;
}
return resolver.lookup(variableName);
}
/**
* Sets a flag whether substitution is done in variable values (recursive).
*
* @param disableSubstitutionInValues true if substitution in variable value are disabled
* @return this, to enable chaining
*/
public StringSubstitutor setDisableSubstitutionInValues(final boolean disableSubstitutionInValues) {
this.disableSubstitutionInValues = disableSubstitutionInValues;
return this;
}
/**
* Sets a flag whether substitution is done in variable names. If set to true, the names of variables can
* contain other variables which are processed first before the original variable is evaluated, e.g.
*
* The variable default value delimiter is the character or characters that delimite the variable name and the
* variable default value. This method allows a single character variable default value delimiter to be easily set.
*
* @param valueDelimiter the variable default value delimiter character to use
* @return this, to enable chaining
*/
public StringSubstitutor setValueDelimiter(final char valueDelimiter) {
return setValueDelimiterMatcher(StringMatcherFactory.INSTANCE.charMatcher(valueDelimiter));
}
/**
* Sets the variable default value delimiter to use.
*
* The variable default value delimiter is the character or characters that delimite the variable name and the
* variable default value. This method allows a string variable default value delimiter to be easily set.
*
* If the
* The variable default value delimiter is the character or characters that delimite the variable name and the
* variable default value. This delimiter is expressed in terms of a matcher allowing advanced variable default
* value delimiter matches.
*
* If the
* The variable prefix is the character or characters that identify the start of a variable. This method allows a
* single character prefix to be easily set.
*
* @param prefix the prefix character to use
* @return this, to enable chaining
*/
public StringSubstitutor setVariablePrefix(final char prefix) {
return setVariablePrefixMatcher(StringMatcherFactory.INSTANCE.charMatcher(prefix));
}
/**
* Sets the variable prefix to use.
*
* The variable prefix is the character or characters that identify the start of a variable. This method allows a
* string prefix to be easily set.
*
* @param prefix the prefix for variables, not null
* @return this, to enable chaining
* @throws IllegalArgumentException if the prefix is null
*/
public StringSubstitutor setVariablePrefix(final String prefix) {
Validate.isTrue(prefix != null, "Variable prefix must not be null!");
return setVariablePrefixMatcher(StringMatcherFactory.INSTANCE.stringMatcher(prefix));
}
/**
* Sets the variable prefix matcher currently in use.
*
* The variable prefix is the character or characters that identify the start of a variable. This prefix is
* expressed in terms of a matcher allowing advanced prefix matches.
*
* @param prefixMatcher the prefix matcher to use, null ignored
* @return this, to enable chaining
* @throws IllegalArgumentException if the prefix matcher is null
*/
public StringSubstitutor setVariablePrefixMatcher(final StringMatcher prefixMatcher) {
Validate.isTrue(prefixMatcher != null, "Variable prefix matcher must not be null!");
this.prefixMatcher = prefixMatcher;
return this;
}
/**
* Sets the VariableResolver that is used to lookup variables.
*
* @param variableResolver the VariableResolver
* @return this, to enable chaining
*/
public StringSubstitutor setVariableResolver(final StringLookup variableResolver) {
this.variableResolver = variableResolver;
return this;
}
/**
* Sets the variable suffix to use.
*
* The variable suffix is the character or characters that identify the end of a variable. This method allows a
* single character suffix to be easily set.
*
* @param suffix the suffix character to use
* @return this, to enable chaining
*/
public StringSubstitutor setVariableSuffix(final char suffix) {
return setVariableSuffixMatcher(StringMatcherFactory.INSTANCE.charMatcher(suffix));
}
/**
* Sets the variable suffix to use.
*
* The variable suffix is the character or characters that identify the end of a variable. This method allows a
* string suffix to be easily set.
*
* @param suffix the suffix for variables, not null
* @return this, to enable chaining
* @throws IllegalArgumentException if the suffix is null
*/
public StringSubstitutor setVariableSuffix(final String suffix) {
Validate.isTrue(suffix != null, "Variable suffix must not be null!");
return setVariableSuffixMatcher(StringMatcherFactory.INSTANCE.stringMatcher(suffix));
}
/**
* Sets the variable suffix matcher currently in use.
*
* The variable suffix is the character or characters that identify the end of a variable. This suffix is expressed
* in terms of a matcher allowing advanced suffix matches.
*
* @param suffixMatcher the suffix matcher to use, null ignored
* @return this, to enable chaining
* @throws IllegalArgumentException if the suffix matcher is null
*/
public StringSubstitutor setVariableSuffixMatcher(final StringMatcher suffixMatcher) {
Validate.isTrue(suffixMatcher != null, "Variable suffix matcher must not be null!");
this.suffixMatcher = suffixMatcher;
return this;
}
// -----------------------------------------------------------------------
/**
* Internal method that substitutes the variables.
*
* Most users of this class do not need to call this method. This method will be called automatically by another
* (public) method.
*
* Writers of subclasses can override this method if they need access to the substitution process at the start or
* end.
*
* @param buf the string builder to substitute into, not null
* @param offset the start offset within the builder, must be valid
* @param length the length within the builder to be processed, must be valid
* @return true if altered
*/
protected boolean substitute(final TextStringBuilder buf, final int offset, final int length) {
return substitute(buf, offset, length, null) > 0;
}
/**
* Recursive handler for multiple levels of interpolation. This is the main interpolation method, which resolves the
* values of all variable references contained in the passed in text.
*
* @param buf the string builder to substitute into, not null
* @param offset the start offset within the builder, must be valid
* @param length the length within the builder to be processed, must be valid
* @param priorVariables the stack keeping track of the replaced variables, may be null
* @return The length change that occurs, unless priorVariables is null when the int represents a boolean flag as to
* whether any change occurred.
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
private int substitute(final TextStringBuilder buf, final int offset, final int length,
List
* This class can split a String into many smaller strings. It aims to do a similar job to
* {@link java.util.StringTokenizer StringTokenizer}, however it offers much more control and flexibility including
* implementing the
* The input String is split into a number of tokens. Each token is separated from the next String by a
* delimiter. One or more delimiter characters must be specified.
*
* Each token may be surrounded by quotes. The quote matcher specifies the quote character(s). A quote may be
* escaped within a quoted section by duplicating itself.
*
* Between each token and the delimiter are potentially characters that need trimming. The trimmer matcher
* specifies these characters. One usage might be to trim whitespace characters.
*
* At any point outside the quotes there might potentially be invalid characters. The ignored matcher specifies
* these characters to be removed. One usage might be to remove new line characters.
*
* Empty tokens may be removed or returned as null.
*
*
* You must call a "reset" method to set the string which you want to parse.
*
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StringTokenizer getCSVInstance() {
return getCSVClone();
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings initializing it with the given input.
* The default for CSV processing will be trim whitespace from both ends (which can be overridden with the
* setTrimmer method).
*
* @param input
* the text to parse
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StringTokenizer getCSVInstance(final String input) {
final StringTokenizer tok = getCSVClone();
tok.reset(input);
return tok;
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings initializing it with the given input.
* The default for CSV processing will be trim whitespace from both ends (which can be overridden with the
* setTrimmer method).
*
* @param input
* the text to parse
* @return a new tokenizer instance which parses Comma Separated Value strings
*/
public static StringTokenizer getCSVInstance(final char[] input) {
final StringTokenizer tok = getCSVClone();
tok.reset(input);
return tok;
}
/**
* Returns a clone of
* You must call a "reset" method to set the string which you want to parse.
*
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StringTokenizer getTSVInstance() {
return getTSVClone();
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings. The default for CSV processing will be
* trim whitespace from both ends (which can be overridden with the setTrimmer method).
*
* @param input
* the string to parse
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StringTokenizer getTSVInstance(final String input) {
final StringTokenizer tok = getTSVClone();
tok.reset(input);
return tok;
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings. The default for CSV processing will be
* trim whitespace from both ends (which can be overridden with the setTrimmer method).
*
* @param input
* the string to parse
* @return a new tokenizer instance which parses Tab Separated Value strings.
*/
public static StringTokenizer getTSVInstance(final char[] input) {
final StringTokenizer tok = getTSVClone();
tok.reset(input);
return tok;
}
// -----------------------------------------------------------------------
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed as per StringTokenizer, but with no text to
* tokenize.
*
* This constructor is normally used with {@link #reset(String)}.
*/
public StringTokenizer() {
super();
this.chars = null;
}
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed as per StringTokenizer.
*
* @param input
* the string which is to be parsed
*/
public StringTokenizer(final String input) {
super();
if (input != null) {
chars = input.toCharArray();
} else {
chars = null;
}
}
/**
* Constructs a tokenizer splitting on the specified delimiter character.
*
* @param input
* the string which is to be parsed
* @param delim
* the field delimiter character
*/
public StringTokenizer(final String input, final char delim) {
this(input);
setDelimiterChar(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter string.
*
* @param input
* the string which is to be parsed
* @param delim
* the field delimiter string
*/
public StringTokenizer(final String input, final String delim) {
this(input);
setDelimiterString(delim);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher.
*
* @param input
* the string which is to be parsed
* @param delim
* the field delimiter matcher
*/
public StringTokenizer(final String input, final StringMatcher delim) {
this(input);
setDelimiterMatcher(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter character and handling quotes using the specified
* quote character.
*
* @param input
* the string which is to be parsed
* @param delim
* the field delimiter character
* @param quote
* the field quoted string character
*/
public StringTokenizer(final String input, final char delim, final char quote) {
this(input, delim);
setQuoteChar(quote);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher and handling quotes using the specified
* quote matcher.
*
* @param input
* the string which is to be parsed
* @param delim
* the field delimiter matcher
* @param quote
* the field quoted string matcher
*/
public StringTokenizer(final String input, final StringMatcher delim, final StringMatcher quote) {
this(input, delim);
setQuoteMatcher(quote);
}
/**
* Constructs a tokenizer splitting on space, tab, newline and form feed as per StringTokenizer.
*
* @param input
* the string which is to be parsed, not cloned
*/
public StringTokenizer(final char[] input) {
super();
if (input == null) {
this.chars = null;
} else {
this.chars = input.clone();
}
}
/**
* Constructs a tokenizer splitting on the specified character.
*
* @param input
* the string which is to be parsed, not cloned
* @param delim
* the field delimiter character
*/
public StringTokenizer(final char[] input, final char delim) {
this(input);
setDelimiterChar(delim);
}
/**
* Constructs a tokenizer splitting on the specified string.
*
* @param input
* the string which is to be parsed, not cloned
* @param delim
* the field delimiter string
*/
public StringTokenizer(final char[] input, final String delim) {
this(input);
setDelimiterString(delim);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher.
*
* @param input
* the string which is to be parsed, not cloned
* @param delim
* the field delimiter matcher
*/
public StringTokenizer(final char[] input, final StringMatcher delim) {
this(input);
setDelimiterMatcher(delim);
}
/**
* Constructs a tokenizer splitting on the specified delimiter character and handling quotes using the specified
* quote character.
*
* @param input
* the string which is to be parsed, not cloned
* @param delim
* the field delimiter character
* @param quote
* the field quoted string character
*/
public StringTokenizer(final char[] input, final char delim, final char quote) {
this(input, delim);
setQuoteChar(quote);
}
/**
* Constructs a tokenizer splitting using the specified delimiter matcher and handling quotes using the specified
* quote matcher.
*
* @param input
* the string which is to be parsed, not cloned
* @param delim
* the field delimiter character
* @param quote
* the field quoted string character
*/
public StringTokenizer(final char[] input, final StringMatcher delim, final StringMatcher quote) {
this(input, delim);
setQuoteMatcher(quote);
}
// API
// -----------------------------------------------------------------------
/**
* Gets the number of tokens found in the String.
*
* @return The number of matched tokens
*/
public int size() {
checkTokenized();
return tokens.length;
}
/**
* Gets the next token from the String. Equivalent to {@link #next()} except it returns null rather than throwing
* {@link NoSuchElementException} when no tokens remain.
*
* @return The next sequential token, or null when no more tokens are found
*/
public String nextToken() {
if (hasNext()) {
return tokens[tokenPos++];
}
return null;
}
/**
* Gets the previous token from the String.
*
* @return The previous sequential token, or null when no more tokens are found
*/
public String previousToken() {
if (hasPrevious()) {
return tokens[--tokenPos];
}
return null;
}
/**
* Gets a copy of the full token list as an independent modifiable array.
*
* @return The tokens as a String array
*/
public String[] getTokenArray() {
checkTokenized();
return tokens.clone();
}
/**
* Gets a copy of the full token list as an independent modifiable list.
*
* @return The tokens as a String array
*/
public List
* This method allows the same tokenizer to be reused for the same String.
*
* @return this, to enable chaining
*/
public StringTokenizer reset() {
tokenPos = 0;
tokens = null;
return this;
}
/**
* Reset this tokenizer, giving it a new input string to parse. In this manner you can re-use a tokenizer with the
* same settings on multiple input lines.
*
* @param input
* the new string to tokenize, null sets no text to parse
* @return this, to enable chaining
*/
public StringTokenizer reset(final String input) {
reset();
if (input != null) {
this.chars = input.toCharArray();
} else {
this.chars = null;
}
return this;
}
/**
* Reset this tokenizer, giving it a new input string to parse. In this manner you can re-use a tokenizer with the
* same settings on multiple input lines.
*
* @param input
* the new character array to tokenize, not cloned, null sets no text to parse
* @return this, to enable chaining
*/
public StringTokenizer reset(final char[] input) {
reset();
if (input != null) {
this.chars = input.clone();
} else {
this.chars = null;
}
return this;
}
// ListIterator
// -----------------------------------------------------------------------
/**
* Checks whether there are any more tokens.
*
* @return true if there are more tokens
*/
@Override
public boolean hasNext() {
checkTokenized();
return tokenPos < tokens.length;
}
/**
* Gets the next token.
*
* @return The next String token
* @throws NoSuchElementException
* if there are no more elements
*/
@Override
public String next() {
if (hasNext()) {
return tokens[tokenPos++];
}
throw new NoSuchElementException();
}
/**
* Gets the index of the next token to return.
*
* @return The next token index
*/
@Override
public int nextIndex() {
return tokenPos;
}
/**
* Checks whether there are any previous tokens that can be iterated to.
*
* @return true if there are previous tokens
*/
@Override
public boolean hasPrevious() {
checkTokenized();
return tokenPos > 0;
}
/**
* Gets the token previous to the last returned token.
*
* @return The previous token
*/
@Override
public String previous() {
if (hasPrevious()) {
return tokens[--tokenPos];
}
throw new NoSuchElementException();
}
/**
* Gets the index of the previous token.
*
* @return The previous token index
*/
@Override
public int previousIndex() {
return tokenPos - 1;
}
/**
* Unsupported ListIterator operation.
*
* @throws UnsupportedOperationException
* always
*/
@Override
public void remove() {
throw new UnsupportedOperationException("remove() is unsupported");
}
/**
* Unsupported ListIterator operation.
*
* @param obj
* this parameter ignored.
* @throws UnsupportedOperationException
* always
*/
@Override
public void set(final String obj) {
throw new UnsupportedOperationException("set() is unsupported");
}
/**
* Unsupported ListIterator operation.
*
* @param obj
* this parameter ignored.
* @throws UnsupportedOperationException
* always
*/
@Override
public void add(final String obj) {
throw new UnsupportedOperationException("add() is unsupported");
}
// Implementation
// -----------------------------------------------------------------------
/**
* Checks if tokenization has been done, and if not then do it.
*/
private void checkTokenized() {
if (tokens == null) {
if (chars == null) {
// still call tokenize as subclass may do some work
final List
* Most users of this class do not need to call this method. This method will be called automatically by other
* (public) methods when required.
*
* This method exists to allow subclasses to add code before or after the tokenization. For example, a subclass
* could alter the character array, offset or count to be parsed, or call the tokenizer multiple times on multiple
* strings. It is also be possible to filter the results.
*
*
* The delimiter is used to separate one token from another.
*
* @param delim
* the delimiter matcher to use
* @return this, to enable chaining
*/
public StringTokenizer setDelimiterMatcher(final StringMatcher delim) {
if (delim == null) {
this.delimMatcher = StringMatcherFactory.INSTANCE.noneMatcher();
} else {
this.delimMatcher = delim;
}
return this;
}
/**
* Sets the field delimiter character.
*
* @param delim
* the delimiter character to use
* @return this, to enable chaining
*/
public StringTokenizer setDelimiterChar(final char delim) {
return setDelimiterMatcher(StringMatcherFactory.INSTANCE.charMatcher(delim));
}
/**
* Sets the field delimiter string.
*
* @param delim
* the delimiter string to use
* @return this, to enable chaining
*/
public StringTokenizer setDelimiterString(final String delim) {
return setDelimiterMatcher(StringMatcherFactory.INSTANCE.stringMatcher(delim));
}
// Quote
// -----------------------------------------------------------------------
/**
* Gets the quote matcher currently in use.
*
* The quote character is used to wrap data between the tokens. This enables delimiters to be entered as data. The
* default value is '"' (double quote).
*
* @return The quote matcher in use
*/
public StringMatcher getQuoteMatcher() {
return quoteMatcher;
}
/**
* Set the quote matcher to use.
*
* The quote character is used to wrap data between the tokens. This enables delimiters to be entered as data.
*
* @param quote
* the quote matcher to use, null ignored
* @return this, to enable chaining
*/
public StringTokenizer setQuoteMatcher(final StringMatcher quote) {
if (quote != null) {
this.quoteMatcher = quote;
}
return this;
}
/**
* Sets the quote character to use.
*
* The quote character is used to wrap data between the tokens. This enables delimiters to be entered as data.
*
* @param quote
* the quote character to use
* @return this, to enable chaining
*/
public StringTokenizer setQuoteChar(final char quote) {
return setQuoteMatcher(StringMatcherFactory.INSTANCE.charMatcher(quote));
}
// Ignored
// -----------------------------------------------------------------------
/**
* Gets the ignored character matcher.
*
* These characters are ignored when parsing the String, unless they are within a quoted region. The default value
* is not to ignore anything.
*
* @return The ignored matcher in use
*/
public StringMatcher getIgnoredMatcher() {
return ignoredMatcher;
}
/**
* Set the matcher for characters to ignore.
*
* These characters are ignored when parsing the String, unless they are within a quoted region.
*
* @param ignored
* the ignored matcher to use, null ignored
* @return this, to enable chaining
*/
public StringTokenizer setIgnoredMatcher(final StringMatcher ignored) {
if (ignored != null) {
this.ignoredMatcher = ignored;
}
return this;
}
/**
* Set the character to ignore.
*
* This character is ignored when parsing the String, unless it is within a quoted region.
*
* @param ignored
* the ignored character to use
* @return this, to enable chaining
*/
public StringTokenizer setIgnoredChar(final char ignored) {
return setIgnoredMatcher(StringMatcherFactory.INSTANCE.charMatcher(ignored));
}
// Trimmer
// -----------------------------------------------------------------------
/**
* Gets the trimmer character matcher.
*
* These characters are trimmed off on each side of the delimiter until the token or quote is found. The default
* value is not to trim anything.
*
* @return The trimmer matcher in use
*/
public StringMatcher getTrimmerMatcher() {
return trimmerMatcher;
}
/**
* Sets the matcher for characters to trim.
*
* These characters are trimmed off on each side of the delimiter until the token or quote is found.
*
* @param trimmer
* the trimmer matcher to use, null ignored
* @return this, to enable chaining
*/
public StringTokenizer setTrimmerMatcher(final StringMatcher trimmer) {
if (trimmer != null) {
this.trimmerMatcher = trimmer;
}
return this;
}
// -----------------------------------------------------------------------
/**
* Gets whether the tokenizer currently returns empty tokens as null. The default for this property is false.
*
* @return true if empty tokens are returned as null
*/
public boolean isEmptyTokenAsNull() {
return this.emptyAsNull;
}
/**
* Sets whether the tokenizer should return empty tokens as null. The default for this property is false.
*
* @param emptyAsNull
* whether empty tokens are returned as null
* @return this, to enable chaining
*/
public StringTokenizer setEmptyTokenAsNull(final boolean emptyAsNull) {
this.emptyAsNull = emptyAsNull;
return this;
}
// -----------------------------------------------------------------------
/**
* Gets whether the tokenizer currently ignores empty tokens. The default for this property is true.
*
* @return true if empty tokens are not returned
*/
public boolean isIgnoreEmptyTokens() {
return ignoreEmptyTokens;
}
/**
* Sets whether the tokenizer should ignore and not return empty tokens. The default for this property is true.
*
* @param ignoreEmptyTokens
* whether empty tokens are not returned
* @return this, to enable chaining
*/
public StringTokenizer setIgnoreEmptyTokens(final boolean ignoreEmptyTokens) {
this.ignoreEmptyTokens = ignoreEmptyTokens;
return this;
}
// -----------------------------------------------------------------------
/**
* Gets the String content that the tokenizer is parsing.
*
* @return The string content being parsed
*/
public String getContent() {
if (chars == null) {
return null;
}
return new String(chars);
}
// -----------------------------------------------------------------------
/**
* Creates a new instance of this Tokenizer. The new instance is reset so that it will be at the start of the token
* list. If a {@link CloneNotSupportedException} is caught, return
* TextRandomProvider implementations are used by {@link RandomStringGenerator}
* as a source of randomness. It is highly recommended that the
* Apache Commons RNG
* library be used to provide the random number generation.
*
* When using Java 8 or later, TextRandomProvider is a functional interface and
* need not be explicitly implemented. For example:
*
* The main differences from StringBuffer/StringBuilder are:
*
* The aim has been to provide an API that mimics very closely what StringBuffer provides, but with additional methods.
* It should be noted that some edge cases, with invalid indices or null input, have been altered - see individual
* methods. The biggest of these changes is that by default, null will not output the text 'null'. This can be
* controlled by a property, {@link #setNullText(String)}.
*
* This class is called {@code TextStringBuilder} instead of {@code StringBuilder} to avoid clashing with
* {@link java.lang.StringBuilder}.
*
* This method is the same as {@link #length()} and is provided to match the API of Collections.
*
* @return The length
*/
public int size() {
return size;
}
/**
* Checks is the string builder is empty (convenience Collections API style method).
*
* This method is the same as checking {@link #length()} and is provided to match the API of Collections.
*
* @return
* This method does not reduce the size of the internal character buffer. To do that, call
* This method is the same as {@link #setLength(int)} called with zero and is provided to match the API of
* Collections.
*
* @return this, to enable chaining
*/
public TextStringBuilder clear() {
size = 0;
return this;
}
// -----------------------------------------------------------------------
/**
* Gets the character at the specified index.
*
* @see #setCharAt(int, char)
* @see #deleteCharAt(int)
* @param index
* the index to retrieve, must be valid
* @return The character at the index
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
@Override
public char charAt(final int index) {
if (index < 0 || index >= length()) {
throw new StringIndexOutOfBoundsException(index);
}
return buffer[index];
}
/**
* Sets the character at the specified index.
*
* @see #charAt(int)
* @see #deleteCharAt(int)
* @param index
* the index to set
* @param ch
* the new character
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder setCharAt(final int index, final char ch) {
if (index < 0 || index >= length()) {
throw new StringIndexOutOfBoundsException(index);
}
buffer[index] = ch;
return this;
}
/**
* Deletes the character at the specified index.
*
* @see #charAt(int)
* @see #setCharAt(int, char)
* @param index
* the index to delete
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder deleteCharAt(final int index) {
if (index < 0 || index >= size) {
throw new StringIndexOutOfBoundsException(index);
}
deleteImpl(index, index + 1, 1);
return this;
}
// -----------------------------------------------------------------------
/**
* Copies the builder's character array into a new character array.
*
* @return a new array that represents the contents of the builder
*/
public char[] toCharArray() {
if (size == 0) {
return new char[0];
}
final char[] chars = new char[size];
System.arraycopy(buffer, 0, chars, 0, size);
return chars;
}
/**
* Copies part of the builder's character array into a new character array.
*
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @return a new array that holds part of the contents of the builder
* @throws IndexOutOfBoundsException
* if startIndex is invalid, or if endIndex is invalid (but endIndex greater than size is valid)
*/
public char[] toCharArray(final int startIndex, int endIndex) {
endIndex = validateRange(startIndex, endIndex);
final int len = endIndex - startIndex;
if (len == 0) {
return new char[0];
}
final char[] chars = new char[len];
System.arraycopy(buffer, startIndex, chars, 0, len);
return chars;
}
/**
* Copies the character array into the specified array.
*
* @param destination
* the destination array, null will cause an array to be created
* @return The input array, unless that was null or too small
*/
public char[] getChars(char[] destination) {
final int len = length();
if (destination == null || destination.length < len) {
destination = new char[len];
}
System.arraycopy(buffer, 0, destination, 0, len);
return destination;
}
/**
* Copies the character array into the specified array.
*
* @param startIndex
* first index to copy, inclusive, must be valid
* @param endIndex
* last index, exclusive, must be valid
* @param destination
* the destination array, must not be null or too small
* @param destinationIndex
* the index to start copying in destination
* @throws NullPointerException
* if the array is null
* @throws IndexOutOfBoundsException
* if any index is invalid
*/
public void getChars(final int startIndex, final int endIndex, final char[] destination,
final int destinationIndex) {
if (startIndex < 0) {
throw new StringIndexOutOfBoundsException(startIndex);
}
if (endIndex < 0 || endIndex > length()) {
throw new StringIndexOutOfBoundsException(endIndex);
}
if (startIndex > endIndex) {
throw new StringIndexOutOfBoundsException("end < start");
}
System.arraycopy(buffer, startIndex, destination, destinationIndex, endIndex - startIndex);
}
// -----------------------------------------------------------------------
/**
* If possible, reads chars from the provided {@link Readable} directly into underlying character buffer without
* making extra copies.
*
* @param readable
* object to read from
* @return The number of characters read
* @throws IOException
* if an I/O error occurs
*
* @see #appendTo(Appendable)
*/
public int readFrom(final Readable readable) throws IOException {
final int oldSize = size;
if (readable instanceof Reader) {
final Reader r = (Reader) readable;
ensureCapacity(size + 1);
int read;
while ((read = r.read(buffer, size, buffer.length - size)) != -1) {
size += read;
ensureCapacity(size + 1);
}
} else if (readable instanceof CharBuffer) {
final CharBuffer cb = (CharBuffer) readable;
final int remaining = cb.remaining();
ensureCapacity(size + remaining);
cb.get(buffer, size, remaining);
size += remaining;
} else {
while (true) {
ensureCapacity(size + 1);
final CharBuffer buf = CharBuffer.wrap(buffer, size, buffer.length - size);
final int read = readable.read(buf);
if (read == -1) {
break;
}
size += read;
}
}
return size - oldSize;
}
// -----------------------------------------------------------------------
/**
* Appends the new line string to this string builder.
*
* The new line string can be altered using {@link #setNewLineText(String)}. This might be used to force the output
* to always use Unix line endings even when on Windows.
*
* @return this, to enable chaining
*/
public TextStringBuilder appendNewLine() {
if (newLine == null) {
append(System.lineSeparator());
return this;
}
return append(newLine);
}
/**
* Appends the text representing
* This method is useful for adding a separator each time around the loop except the first.
*
*
* This method is for example useful for constructing queries
*
*
* This method is useful for adding a separator each time around the loop except the first.
*
*
* This method is useful for adding a separator each time around the loop except the first.
*
* This method is useful for adding a separator each time around the loop except the first.
*
* Matchers can be used to perform advanced deletion behaviour. For example you could write a matcher to delete all
* occurrences where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @return this, to enable chaining
*/
public TextStringBuilder deleteAll(final StringMatcher matcher) {
return replace(matcher, null, 0, size, -1);
}
/**
* Deletes the first match within the builder using the specified matcher.
*
* Matchers can be used to perform advanced deletion behaviour. For example you could write a matcher to delete
* where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @return this, to enable chaining
*/
public TextStringBuilder deleteFirst(final StringMatcher matcher) {
return replace(matcher, null, 0, size, 1);
}
// -----------------------------------------------------------------------
/**
* Internal method to delete a range without validation.
*
* @param startIndex
* the start index, must be valid
* @param endIndex
* the end index (exclusive), must be valid
* @param removeLen
* the length to remove (endIndex - startIndex), must be valid
* @param insertStr
* the string to replace with, null means delete range
* @param insertLen
* the length of the insert string, must be valid
* @throws IndexOutOfBoundsException
* if any index is invalid
*/
private void replaceImpl(final int startIndex, final int endIndex, final int removeLen, final String insertStr,
final int insertLen) {
final int newSize = size - removeLen + insertLen;
if (insertLen != removeLen) {
ensureCapacity(newSize);
System.arraycopy(buffer, endIndex, buffer, startIndex + insertLen, size - endIndex);
size = newSize;
}
if (insertLen > 0) {
insertStr.getChars(0, insertLen, buffer, startIndex);
}
}
/**
* Replaces a portion of the string builder with another string. The length of the inserted string does not have to
* match the removed length.
*
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @param replaceStr
* the string to replace with, null means delete range
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder replace(final int startIndex, int endIndex, final String replaceStr) {
endIndex = validateRange(startIndex, endIndex);
final int insertLen = replaceStr == null ? 0 : replaceStr.length();
replaceImpl(startIndex, endIndex, endIndex - startIndex, replaceStr, insertLen);
return this;
}
// -----------------------------------------------------------------------
/**
* Replaces the search character with the replace character throughout the builder.
*
* @param search
* the search character
* @param replace
* the replace character
* @return this, to enable chaining
*/
public TextStringBuilder replaceAll(final char search, final char replace) {
if (search != replace) {
for (int i = 0; i < size; i++) {
if (buffer[i] == search) {
buffer[i] = replace;
}
}
}
return this;
}
/**
* Replaces the first instance of the search character with the replace character in the builder.
*
* @param search
* the search character
* @param replace
* the replace character
* @return this, to enable chaining
*/
public TextStringBuilder replaceFirst(final char search, final char replace) {
if (search != replace) {
for (int i = 0; i < size; i++) {
if (buffer[i] == search) {
buffer[i] = replace;
break;
}
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Replaces the search string with the replace string throughout the builder.
*
* @param searchStr
* the search string, null causes no action to occur
* @param replaceStr
* the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public TextStringBuilder replaceAll(final String searchStr, final String replaceStr) {
final int searchLen = searchStr == null ? 0 : searchStr.length();
if (searchLen > 0) {
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
int index = indexOf(searchStr, 0);
while (index >= 0) {
replaceImpl(index, index + searchLen, searchLen, replaceStr, replaceLen);
index = indexOf(searchStr, index + replaceLen);
}
}
return this;
}
/**
* Replaces the first instance of the search string with the replace string.
*
* @param searchStr
* the search string, null causes no action to occur
* @param replaceStr
* the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public TextStringBuilder replaceFirst(final String searchStr, final String replaceStr) {
final int searchLen = searchStr == null ? 0 : searchStr.length();
if (searchLen > 0) {
final int index = indexOf(searchStr, 0);
if (index >= 0) {
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
replaceImpl(index, index + searchLen, searchLen, replaceStr, replaceLen);
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Replaces all matches within the builder with the replace string.
*
* Matchers can be used to perform advanced replace behaviour. For example you could write a matcher to replace all
* occurrences where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @param replaceStr
* the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public TextStringBuilder replaceAll(final StringMatcher matcher, final String replaceStr) {
return replace(matcher, replaceStr, 0, size, -1);
}
/**
* Replaces the first match within the builder with the replace string.
*
* Matchers can be used to perform advanced replace behaviour. For example you could write a matcher to replace
* where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @param replaceStr
* the replace string, null is equivalent to an empty string
* @return this, to enable chaining
*/
public TextStringBuilder replaceFirst(final StringMatcher matcher, final String replaceStr) {
return replace(matcher, replaceStr, 0, size, 1);
}
// -----------------------------------------------------------------------
/**
* Advanced search and replaces within the builder using a matcher.
*
* Matchers can be used to perform advanced behaviour. For example you could write a matcher to delete all
* occurrences where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @param replaceStr
* the string to replace the match with, null is a delete
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @param replaceCount
* the number of times to replace, -1 for replace all
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if start index is invalid
*/
public TextStringBuilder replace(final StringMatcher matcher, final String replaceStr, final int startIndex,
int endIndex, final int replaceCount) {
endIndex = validateRange(startIndex, endIndex);
return replaceImpl(matcher, replaceStr, startIndex, endIndex, replaceCount);
}
/**
* Replaces within the builder using a matcher.
*
* Matchers can be used to perform advanced behaviour. For example you could write a matcher to delete all
* occurrences where the character 'a' is followed by a number.
*
* @param matcher
* the matcher to use to find the deletion, null causes no action
* @param replaceStr
* the string to replace the match with, null is a delete
* @param from
* the start index, must be valid
* @param to
* the end index (exclusive), must be valid
* @param replaceCount
* the number of times to replace, -1 for replace all
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if any index is invalid
*/
private TextStringBuilder replaceImpl(final StringMatcher matcher, final String replaceStr, final int from, int to,
int replaceCount) {
if (matcher == null || size == 0) {
return this;
}
final int replaceLen = replaceStr == null ? 0 : replaceStr.length();
for (int i = from; i < to && replaceCount != 0; i++) {
final char[] buf = buffer;
final int removeLen = matcher.isMatch(buf, i, from, to);
if (removeLen > 0) {
replaceImpl(i, i + removeLen, removeLen, replaceStr, replaceLen);
to = to - removeLen + replaceLen;
i = i + replaceLen - 1;
if (replaceCount > 0) {
replaceCount--;
}
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Reverses the string builder placing each character in the opposite index.
*
* @return this, to enable chaining
*/
public TextStringBuilder reverse() {
if (size == 0) {
return this;
}
final int half = size / 2;
final char[] buf = buffer;
for (int leftIdx = 0, rightIdx = size - 1; leftIdx < half; leftIdx++, rightIdx--) {
final char swap = buf[leftIdx];
buf[leftIdx] = buf[rightIdx];
buf[rightIdx] = swap;
}
return this;
}
// -----------------------------------------------------------------------
/**
* Trims the builder by removing characters less than or equal to a space from the beginning and end.
*
* @return this, to enable chaining
*/
public TextStringBuilder trim() {
if (size == 0) {
return this;
}
int len = size;
final char[] buf = buffer;
int pos = 0;
while (pos < len && buf[pos] <= ' ') {
pos++;
}
while (pos < len && buf[len - 1] <= ' ') {
len--;
}
if (len < size) {
delete(len, size);
}
if (pos > 0) {
delete(0, pos);
}
return this;
}
// -----------------------------------------------------------------------
/**
* Checks whether this builder starts with the specified string.
*
* Note that this method handles null input quietly, unlike String.
*
* @param str
* the string to search for, null returns false
* @return true if the builder starts with the string
*/
public boolean startsWith(final String str) {
if (str == null) {
return false;
}
final int len = str.length();
if (len == 0) {
return true;
}
if (len > size) {
return false;
}
for (int i = 0; i < len; i++) {
if (buffer[i] != str.charAt(i)) {
return false;
}
}
return true;
}
/**
* Checks whether this builder ends with the specified string.
*
* Note that this method handles null input quietly, unlike String.
*
* @param str
* the string to search for, null returns false
* @return true if the builder ends with the string
*/
public boolean endsWith(final String str) {
if (str == null) {
return false;
}
final int len = str.length();
if (len == 0) {
return true;
}
if (len > size) {
return false;
}
int pos = size - len;
for (int i = 0; i < len; i++, pos++) {
if (buffer[pos] != str.charAt(i)) {
return false;
}
}
return true;
}
// -----------------------------------------------------------------------
/**
* {@inheritDoc}
*/
@Override
public CharSequence subSequence(final int startIndex, final int endIndex) {
if (startIndex < 0) {
throw new StringIndexOutOfBoundsException(startIndex);
}
if (endIndex > size) {
throw new StringIndexOutOfBoundsException(endIndex);
}
if (startIndex > endIndex) {
throw new StringIndexOutOfBoundsException(endIndex - startIndex);
}
return substring(startIndex, endIndex);
}
/**
* Extracts a portion of this string builder as a string.
*
* @param start
* the start index, inclusive, must be valid
* @return The new string
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public String substring(final int start) {
return substring(start, size);
}
/**
* Extracts a portion of this string builder as a string.
*
* Note: This method treats an endIndex greater than the length of the builder as equal to the length of the
* builder, and continues without error, unlike StringBuffer or String.
*
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @return The new string
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public String substring(final int startIndex, int endIndex) {
endIndex = validateRange(startIndex, endIndex);
return new String(buffer, startIndex, endIndex - startIndex);
}
/**
* Extracts the leftmost characters from the string builder without throwing an exception.
*
* This method extracts the left
* This method extracts the right
* This method extracts
* Matchers can be used to perform advanced searching behaviour. For example you could write a matcher to search for
* the character 'a' followed by a number.
*
* @param matcher
* the matcher to use, null returns -1
* @return true if the matcher finds a match in the builder
*/
public boolean contains(final StringMatcher matcher) {
return indexOf(matcher, 0) >= 0;
}
// -----------------------------------------------------------------------
/**
* Searches the string builder to find the first reference to the specified char.
*
* @param ch
* the character to find
* @return The first index of the character, or -1 if not found
*/
public int indexOf(final char ch) {
return indexOf(ch, 0);
}
/**
* Searches the string builder to find the first reference to the specified char.
*
* @param ch
* the character to find
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The first index of the character, or -1 if not found
*/
public int indexOf(final char ch, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (startIndex >= size) {
return -1;
}
final char[] thisBuf = buffer;
for (int i = startIndex; i < size; i++) {
if (thisBuf[i] == ch) {
return i;
}
}
return -1;
}
/**
* Searches the string builder to find the first reference to the specified string.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str
* the string to find, null returns -1
* @return The first index of the string, or -1 if not found
*/
public int indexOf(final String str) {
return indexOf(str, 0);
}
/**
* Searches the string builder to find the first reference to the specified string starting searching from the given
* index.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str
* the string to find, null returns -1
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The first index of the string, or -1 if not found
*/
public int indexOf(final String str, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (str == null || startIndex >= size) {
return -1;
}
final int strLen = str.length();
if (strLen == 1) {
return indexOf(str.charAt(0), startIndex);
}
if (strLen == 0) {
return startIndex;
}
if (strLen > size) {
return -1;
}
final char[] thisBuf = buffer;
final int len = size - strLen + 1;
outer: for (int i = startIndex; i < len; i++) {
for (int j = 0; j < strLen; j++) {
if (str.charAt(j) != thisBuf[i + j]) {
continue outer;
}
}
return i;
}
return -1;
}
/**
* Searches the string builder using the matcher to find the first match.
*
* Matchers can be used to perform advanced searching behaviour. For example you could write a matcher to find the
* character 'a' followed by a number.
*
* @param matcher
* the matcher to use, null returns -1
* @return The first index matched, or -1 if not found
*/
public int indexOf(final StringMatcher matcher) {
return indexOf(matcher, 0);
}
/**
* Searches the string builder using the matcher to find the first match searching from the given index.
*
* Matchers can be used to perform advanced searching behaviour. For example you could write a matcher to find the
* character 'a' followed by a number.
*
* @param matcher
* the matcher to use, null returns -1
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The first index matched, or -1 if not found
*/
public int indexOf(final StringMatcher matcher, int startIndex) {
startIndex = startIndex < 0 ? 0 : startIndex;
if (matcher == null || startIndex >= size) {
return -1;
}
final int len = size;
final char[] buf = buffer;
for (int i = startIndex; i < len; i++) {
if (matcher.isMatch(buf, i, startIndex, len) > 0) {
return i;
}
}
return -1;
}
// -----------------------------------------------------------------------
/**
* Searches the string builder to find the last reference to the specified char.
*
* @param ch
* the character to find
* @return The last index of the character, or -1 if not found
*/
public int lastIndexOf(final char ch) {
return lastIndexOf(ch, size - 1);
}
/**
* Searches the string builder to find the last reference to the specified char.
*
* @param ch
* the character to find
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The last index of the character, or -1 if not found
*/
public int lastIndexOf(final char ch, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (startIndex < 0) {
return -1;
}
for (int i = startIndex; i >= 0; i--) {
if (buffer[i] == ch) {
return i;
}
}
return -1;
}
/**
* Searches the string builder to find the last reference to the specified string.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str
* the string to find, null returns -1
* @return The last index of the string, or -1 if not found
*/
public int lastIndexOf(final String str) {
return lastIndexOf(str, size - 1);
}
/**
* Searches the string builder to find the last reference to the specified string starting searching from the given
* index.
*
* Note that a null input string will return -1, whereas the JDK throws an exception.
*
* @param str
* the string to find, null returns -1
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The last index of the string, or -1 if not found
*/
public int lastIndexOf(final String str, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (str == null || startIndex < 0) {
return -1;
}
final int strLen = str.length();
if (strLen > 0 && strLen <= size) {
if (strLen == 1) {
return lastIndexOf(str.charAt(0), startIndex);
}
outer: for (int i = startIndex - strLen + 1; i >= 0; i--) {
for (int j = 0; j < strLen; j++) {
if (str.charAt(j) != buffer[i + j]) {
continue outer;
}
}
return i;
}
} else if (strLen == 0) {
return startIndex;
}
return -1;
}
/**
* Searches the string builder using the matcher to find the last match.
*
* Matchers can be used to perform advanced searching behaviour. For example you could write a matcher to find the
* character 'a' followed by a number.
*
* @param matcher
* the matcher to use, null returns -1
* @return The last index matched, or -1 if not found
*/
public int lastIndexOf(final StringMatcher matcher) {
return lastIndexOf(matcher, size);
}
/**
* Searches the string builder using the matcher to find the last match searching from the given index.
*
* Matchers can be used to perform advanced searching behaviour. For example you could write a matcher to find the
* character 'a' followed by a number.
*
* @param matcher
* the matcher to use, null returns -1
* @param startIndex
* the index to start at, invalid index rounded to edge
* @return The last index matched, or -1 if not found
*/
public int lastIndexOf(final StringMatcher matcher, int startIndex) {
startIndex = startIndex >= size ? size - 1 : startIndex;
if (matcher == null || startIndex < 0) {
return -1;
}
final char[] buf = buffer;
final int endIndex = startIndex + 1;
for (int i = startIndex; i >= 0; i--) {
if (matcher.isMatch(buf, i, 0, endIndex) > 0) {
return i;
}
}
return -1;
}
// -----------------------------------------------------------------------
/**
* Creates a tokenizer that can tokenize the contents of this builder.
*
* This method allows the contents of this builder to be tokenized. The tokenizer will be setup by default to
* tokenize on space, tab, newline and form feed (as per StringTokenizer). These values can be changed on the
* tokenizer class, before retrieving the tokens.
*
* The returned tokenizer is linked to this builder. You may intermix calls to the builder and tokenizer within
* certain limits, however there is no synchronization. Once the tokenizer has been used once, it must be
* {@link StringTokenizer#reset() reset} to pickup the latest changes in the builder. For example:
*
*
* Calling {@link StringTokenizer#reset(String)} or {@link StringTokenizer#reset(char[])} with a non-null value will
* break the link with the builder.
*
* @return a tokenizer that is linked to this builder
*/
public StringTokenizer asTokenizer() {
return new TextStringBuilderTokenizer();
}
// -----------------------------------------------------------------------
/**
* Gets the contents of this builder as a Reader.
*
* This method allows the contents of the builder to be read using any standard method that expects a Reader.
*
* To use, simply create a
* The internal character array is shared between the builder and the reader. This allows you to append to the
* builder after creating the reader, and the changes will be picked up. Note however, that no synchronization
* occurs, so you must perform all operations with the builder and the reader in one thread.
*
* The returned reader supports marking, and ignores the flush method.
*
* @return a reader that reads from this builder
*/
public Reader asReader() {
return new StrBuilderReader();
}
// -----------------------------------------------------------------------
/**
* Gets this builder as a Writer that can be written to.
*
* This method allows you to populate the contents of the builder using any standard method that takes a Writer.
*
* To use, simply create a
* The internal character array is shared between the builder and the writer. This allows you to intermix calls that
* append to the builder and write using the writer and the changes will be occur correctly. Note however, that no
* synchronization occurs, so you must perform all operations with the builder and the writer in one thread.
*
* The returned writer ignores the close and flush methods.
*
* @return a writer that populates this builder
*/
public Writer asWriter() {
return new StrBuilderWriter();
}
/**
* Appends current contents of this
* This method tries to avoid doing any extra copies of contents.
*
* @param appendable
* the appendable to append data to
* @throws IOException
* if an I/O error occurs
*
* @see #readFrom(Readable)
*/
public void appendTo(final Appendable appendable) throws IOException {
if (appendable instanceof Writer) {
((Writer) appendable).write(buffer, 0, size);
} else if (appendable instanceof StringBuilder) {
((StringBuilder) appendable).append(buffer, 0, size);
} else if (appendable instanceof StringBuffer) {
((StringBuffer) appendable).append(buffer, 0, size);
} else if (appendable instanceof CharBuffer) {
((CharBuffer) appendable).put(buffer, 0, size);
} else {
appendable.append(this);
}
}
/**
* Checks the contents of this builder against another to see if they contain the same character content ignoring
* case.
*
* @param other
* the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
public boolean equalsIgnoreCase(final TextStringBuilder other) {
if (this == other) {
return true;
}
if (this.size != other.size) {
return false;
}
final char[] thisBuf = this.buffer;
final char[] otherBuf = other.buffer;
for (int i = size - 1; i >= 0; i--) {
final char c1 = thisBuf[i];
final char c2 = otherBuf[i];
if (c1 != c2 && Character.toUpperCase(c1) != Character.toUpperCase(c2)) {
return false;
}
}
return true;
}
/**
* Checks the contents of this builder against another to see if they contain the same character content.
*
* @param other
* the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
public boolean equals(final TextStringBuilder other) {
if (this == other) {
return true;
}
if (other == null) {
return false;
}
if (this.size != other.size) {
return false;
}
final char[] thisBuf = this.buffer;
final char[] otherBuf = other.buffer;
for (int i = size - 1; i >= 0; i--) {
if (thisBuf[i] != otherBuf[i]) {
return false;
}
}
return true;
}
/**
* Checks the contents of this builder against another to see if they contain the same character content.
*
* @param obj
* the object to check, null returns false
* @return true if the builders contain the same characters in the same order
*/
@Override
public boolean equals(final Object obj) {
return obj instanceof TextStringBuilder && equals((TextStringBuilder) obj);
}
/**
* Gets a suitable hash code for this builder.
*
* @return a hash code
*/
@Override
public int hashCode() {
final char[] buf = buffer;
int hash = 0;
for (int i = size - 1; i >= 0; i--) {
hash = 31 * hash + buf[i];
}
return hash;
}
// -----------------------------------------------------------------------
/**
* Gets a String version of the string builder, creating a new instance each time the method is called.
*
* Note that unlike StringBuffer, the string version returned is independent of the string builder.
*
* @return The builder as a String
*/
@Override
public String toString() {
return new String(buffer, 0, size);
}
/**
* Gets a StringBuffer version of the string builder, creating a new instance each time the method is called.
*
* @return The builder as a StringBuffer
*/
public StringBuffer toStringBuffer() {
return new StringBuffer(size).append(buffer, 0, size);
}
/**
* Gets a StringBuilder version of the string builder, creating a new instance each time the method is called.
*
* @return The builder as a StringBuilder
*/
public StringBuilder toStringBuilder() {
return new StringBuilder(size).append(buffer, 0, size);
}
/**
* Implement the {@link Builder} interface.
*
* @return The builder as a String
* @see #toString()
*/
@Override
public String build() {
return toString();
}
// -----------------------------------------------------------------------
/**
* Validates parameters defining a range of the builder.
*
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @return The new string
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
protected int validateRange(final int startIndex, int endIndex) {
if (startIndex < 0) {
throw new StringIndexOutOfBoundsException(startIndex);
}
if (endIndex > size) {
endIndex = size;
}
if (startIndex > endIndex) {
throw new StringIndexOutOfBoundsException("end < start");
}
return endIndex;
}
/**
* Validates parameters defining a single index in the builder.
*
* @param index
* the index, must be valid
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
protected void validateIndex(final int index) {
if (index < 0 || index > size) {
throw new StringIndexOutOfBoundsException(index);
}
}
// -----------------------------------------------------------------------
/**
* Inner class to allow StrBuilder to operate as a tokenizer.
*/
class TextStringBuilderTokenizer extends StringTokenizer {
/**
* Default constructor.
*/
TextStringBuilderTokenizer() {
super();
}
/** {@inheritDoc} */
@Override
protected List
* Operations on Strings that contain words.
*
* This class tries to handle This constructor is public to permit tools that require a JavaBean
* instance to operate. Wraps a single line of text, identifying words by New lines will be separated by the system property line separator.
* Very long words, such as URLs will not be wrapped. Leading spaces on a new line are stripped.
* Trailing spaces are not stripped. Wraps a single line of text, identifying words by Leading spaces on a new line are stripped.
* Trailing spaces are not stripped. Wraps a single line of text, identifying words by Leading spaces on a new line are stripped.
* Trailing spaces are not stripped. Capitalizes all the whitespace separated words in a String.
* Only the first character of each word is changed. To convert the
* rest of each word to lowercase at the same time,
* use {@link #capitalizeFully(String)}. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Capitalizes all the delimiter separated words in a String.
* Only the first character of each word is changed. To convert the
* rest of each word to lowercase at the same time,
* use {@link #capitalizeFully(String, char[])}. The delimiters represent a set of characters understood to separate words.
* The first string character and the first non-delimiter character after a
* delimiter will be capitalized. A Converts all the whitespace separated words in a String into capitalized words,
* that is each word is made up of a titlecase character and then a series of
* lowercase characters. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Converts all the delimiter separated words in a String into capitalized words,
* that is each word is made up of a titlecase character and then a series of
* lowercase characters. The delimiters represent a set of characters understood to separate words.
* The first string character and the first non-delimiter character after a
* delimiter will be capitalized. A Uncapitalizes all the whitespace separated words in a String.
* Only the first character of each word is changed. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Uncapitalizes all the whitespace separated words in a String.
* Only the first character of each word is changed. The delimiters represent a set of characters understood to separate words.
* The first string character and the first non-delimiter character after a
* delimiter will be uncapitalized. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Swaps the case of a String using a word based algorithm. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Extracts the initial characters from each word in the String. All first characters after whitespace are returned as a new string.
* Their case is not changed. Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Extracts the initial characters from each word in the String. All first characters after the defined delimiters are returned as a new string.
* Their case is not changed. If the delimiters array is null, then Whitespace is used.
* Whitespace is defined by {@link Character#isWhitespace(char)}.
* A Checks if the String contains all words in the given array.
* A {@code null} String will return {@code false}. A {@code null}, zero
* length search array or if one element of array is null will return {@code false}.
*
* Converts an array of delimiters to a hash set of code points. Code point of space(32) is added as the default
* value if delimiters is null. The generated hash set provides O(1) lookup time.
*
* Users should implement this interface in order to walk through
* the {@link EditScript EditScript} object created by the comparison
* of two sequences. This is a direct application of the visitor
* design pattern. The {@link EditScript#visit EditScript.visit}
* method takes an object implementing this interface as an argument,
* it will perform the loop over all commands in the script and the
* proper methods of the user class will be called as the commands are
* encountered.
*
* The implementation of the user visitor class will depend on the
* need. Here are two examples.
*
* The first example is a visitor that build the longest common
* subsequence:
*
* The second example is a visitor that shows the commands and the way
* they transform the first sequence into the second one:
*
* When one object of the first sequence has no corresponding object in the
* second sequence at the right place, the {@link EditScript edit script}
* transforming the first sequence into the second sequence uses an instance of
* this class to represent the deletion of this object. The objects embedded in
* these type of commands always come from the first sequence.
*
* When two objects sequences are compared through the
* {@link StringsComparator#getScript StringsComparator.getScript} method,
* the result is provided has a {@link EditScript script} containing the commands
* that progressively transform the first sequence into the second one.
*
* There are only three types of commands, all of which are subclasses of this
* abstract class. Each command is associated with one object belonging to at
* least one of the sequences. These commands are {@link InsertCommand
* InsertCommand} which correspond to an object of the second sequence being
* inserted into the first sequence, {@link DeleteCommand DeleteCommand} which
* correspond to an object of the first sequence being removed and
* {@link KeepCommand KeepCommand} which correspond to an object of the first
* sequence which
* This code has been adapted from Apache Commons Collections 4.0.
*
* This method is invoked for each commands belonging to
* an {@link EditScript EditScript}, in order to implement the visitor design pattern
*
* @param visitor the visitor to be accepted
*/
public abstract void accept(CommandVisitor
* An edit script is the most general view of the differences between two
* sequences. It is built as the result of the comparison between two sequences
* by the {@link StringsComparator StringsComparator} class. The user can
* walk through it using the visitor design pattern.
*
* It is guaranteed that the objects embedded in the {@link InsertCommand insert
* commands} come from the second sequence and that the objects embedded in
* either the {@link DeleteCommand delete commands} or {@link KeepCommand keep
* commands} come from the first sequence. This can be important if subclassing
* is used for some elements in the first sequence and the
* When one object of the second sequence has no corresponding object in the
* first sequence at the right place, the {@link EditScript edit script}
* transforming the first sequence into the second sequence uses an instance of
* this class to represent the insertion of this object. The objects embedded in
* these type of commands always come from the second sequence.
*
* When one object of the first sequence
* The comparison of two objects sequences leads to the identification of common
* parts and parts which only belong to the first or to the second sequence. The
* common parts appear in the edit script in the form of keep commands,
* they can be considered as synchronization objects between the two sequences.
* These synchronization objects split the two sequences in synchronized
* sub-sequences. The first sequence can be transformed into the second one by
* replacing each synchronized sub-sequence of the first sequence by the
* corresponding sub-sequence of the second sequence. This is a synthetic way to
* see an {@link EditScript edit script}, replacing individual
* {@link DeleteCommand delete}, {@link KeepCommand keep} and
* {@link InsertCommand insert} commands by fewer replacements acting on
* complete sub-sequences.
*
* This class is devoted to perform this interpretation. It visits an
* {@link EditScript edit script} (because it implements the
* {@link CommandVisitor CommandVisitor} interface) and calls a user-supplied
* handler implementing the {@link ReplacementsHandler ReplacementsHandler}
* interface to process the sub-sequences.
*
* When a synchronization object is identified, the pending insertions and
* pending deletions sets are provided to the user handler as subsequences.
*
* This method is called by a {@link ReplacementsFinder ReplacementsFinder}
* instance when it has synchronized two sub-sequences of object arrays
* being compared, and at least one of the sequences is non-empty. Since the
* sequences are synchronized, the objects before the two sub-sequences are
* equals (if they exist). This property also holds for the objects after
* the two sub-sequences.
*
* The replacement is defined as replacing the
* It is guaranteed that the comparisons will always be done as
*
* Comparison can be seen from two points of view: either as giving the smallest
* modification allowing to transform the first sequence into the second one, or
* as giving the longest sequence which is a subsequence of both initial
* sequences. The
* This class implements the comparison algorithm, which is the very efficient
* algorithm from Eugene W. Myers
*
* An O(ND) Difference Algorithm and Its Variations. This algorithm produces
* the shortest possible {@link EditScript edit script} containing all the
* {@link EditCommand commands} needed to transform the first sequence into
* the second one.
*
*
* This code has been adapted from Apache Commons Collections 4.0.
*
* Creates a new instance of StringsComparator.
*
* It is guaranteed that the comparisons will always be done as
*
* It is guaranteed that the objects embedded in the {@link InsertCommand
* insert commands} come from the second sequence and that the objects
* embedded in either the {@link DeleteCommand delete commands} or
* {@link KeepCommand keep commands} come from the first sequence. This can
* be important if subclassing is used for some elements in the first
* sequence and the
* The snake is found using the MYERS Algorithm (this algorithms has
* also been implemented in the GNU diff program). This algorithm is
* explained in Eugene Myers article:
*
* An O(ND) Difference Algorithm and Its Variations.
* Provides algorithms for diff between strings. The initial implementation of the Myers algorithm was adapted from the
* commons-collections sequence package.
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "SGVsbG9Xb3JsZCE="} to {@code "HelloWorld!"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "HelloWorld!"} to {@code "SGVsbG9Xb3JsZCE="}.
*
* Looks up the value of a fully-qualified static final value.
*
* Sometimes it is necessary in a configuration file to refer to a constant defined in a class. This can be done with
* this lookup implementation. Variable names must be in the format {@code apackage.AClass.AFIELD}. The
* {@code lookup(String)} method will split the passed in string at the last dot, separating the fully qualified class
* name and the name of the constant (i.e. static final) member field. Then the class is loaded and the field's
* value is obtained using reflection.
*
* Once retrieved values are cached for fast access. This class is thread-safe. It can be used as a standard (i.e.
* global) lookup object and serve multiple clients concurrently.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code java.awt.event.KeyEvent.VK_ESCAPE} to {@code "27"}.
*
* This class was adapted from Apache Commons Configuration.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "yyyy-MM-dd"} to todays's date, for example, {@code "2019-08-04"}.
*
* This enum was adapted and expanded from Apache Commons Configuration 2.4.
*
* The lookup keys are:
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "address|apache.org"} to {@code "95.216.24.32} (or {@code "40.79.78.1"}).
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert (on Linux) {@code "USER"} to the current user name. On Windows 10, you would use
* {@code "USERNAME"} to the same effect.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "UTF-8:SomePath"} to the contents of the file.
*
* For example: "com/domain/document.xml:/path/to/node".
*
* Uses the {@link StringLookupFactory default lookups}.
*
* Uses the {@link StringLookupFactory default lookups}.
*
* Uses the {@link StringLookupFactory default lookups}.
*
* The lookup keys with examples are:
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "version"} to the current VM version, for example,
* {@code "Java version 1.8.0_181"}.
*
* The lookup keys with examples are:
*
* The lookup keys are:
*
* If the map is null, then null is returned. The map result object is converted to a string using toString().
*
* Looks up the value for a given key in the format "Document::Key".
*
* Note the use of "::" instead of ":" to allow for "C:" drive letters in paths.
*
* For example: "com/domain/document.properties:key".
*
* For example: "com/domain/document.xml::/path/to/node".
*
* Note the use of "::" instead of ":" to allow for "C:" drive letters in paths.
*
* Looks up the value for a given key in the format "BundleName:BundleKey".
*
* For example: "com.domain.messages:MyKey".
*
* Looks up the value for a given key in the format "Document:Key".
*
* For example: {@code "javascript:3 + 4"}.
*
* Using a {@link StringSubstitutor}:
*
* For example: "com/domain/document.xml:/path/to/node".
*
* This class represents the simplest form of a string to string map. It has a benefit over a map in that it can create
* the result on demand based on the key.
*
* For example, it would be possible to implement a lookup that used the key as a primary key, and looked up the value
* on demand from the database.
*
* The internal implementation may use any mechanism to return the value. The simplest implementation is to use a
* Map. However, virtually any implementation is possible.
*
* For example, it would be possible to implement a lookup that used the key as a primary key, and looked up the
* value on demand from the database Or, a numeric based implementation could be created that treats the key as an
* integer, increments the value and return the result as a string - converting 1 to 2, 15 to 16 etc.
*
* This method always returns a String, regardless of the underlying data, by converting it as necessary. For
* example:
*
* The default lookups are:
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "SGVsbG9Xb3JsZCE="} to {@code "HelloWorld!"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code } to {@code "SGVsbG9Xb3JsZCE="}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "SGVsbG9Xb3JsZCE="} to {@code "HelloWorld!"}.
*
* Sometimes it is necessary in a configuration file to refer to a constant defined in a class. This can be done
* with this lookup implementation. Variable names must be in the format {@code apackage.AClass.AFIELD}. The
* {@code lookup(String)} method will split the passed in string at the last dot, separating the fully qualified
* class name and the name of the constant (i.e. static final) member field. Then the class is loaded and the
* field's value is obtained using reflection.
*
* Once retrieved values are cached for fast access. This class is thread-safe. It can be used as a standard (i.e.
* global) lookup object and serve multiple clients concurrently.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code java.awt.event.KeyEvent.VK_ESCAPE} to {@code "27"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "yyyy-MM-dd"} to todays's date, for example, {@code "2019-08-04"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert (on Linux) {@code "USER"} to the current user name. On Windows 10, you would use
* {@code "USERNAME"} to the same effect.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "UTF-8:com/domain/document.properties"} to the contents of the file.
*
* The lookups available to an interpolator are defined in
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "${sys:os.name}, ${env:USER}"} to the OS name and Linux user name.
*
* If {@code addDefaultLookups} is true, the following lookups are used in addition to the ones provided in
* {@code stringLookupMap}:
*
* The lookup keys with examples are:
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "version"} to the current VM version, for example,
* {@code "Java version 1.8.0_181"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "canonical-name"} to the current host name, for example,
* {@code "EXAMPLE.apache.org"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "address|apache.org"} to {@code "95.216.24.32} (or {@code "40.79.78.1"}).
*
* Looks up the value for the key in the format "DocumentPath::MyKey".
*
* Note the use of "::" instead of ":" to allow for "C:" drive letters in paths.
*
* For example: "com/domain/document.properties::MyKey".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "com/domain/document.properties::MyKey"} to the key value in the properties
* file at the path "com/domain/document.properties".
*
* Looks up the value for a given key in the format "BundleName:BundleKey".
*
* For example: "com.domain.messages:MyKey".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "com.domain.messages:MyKey"} to the key value in the resource bundle at
* {@code "com.domain.messages"}.
*
* Looks up the value for a given key in the format "MyKey".
*
* For example: "MyKey".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* The above example converts {@code "MyKey"} to the key value in the resource bundle at
* {@code "com.domain.messages"}.
*
* Looks up the value for the key in the format "ScriptEngineName:Script".
*
* For example: "javascript:3 + 4".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "javascript:3 + 4"} to {@code "7"}.
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "os.name"} to the operating system name.
*
* Decodes URL Strings using the UTF-8 encoding.
*
* For example: "Hello%20World%21" becomes "Hello World!".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "Hello%20World%21"} to {@code "Hello World!"}.
*
* Decodes URL Strings using the UTF-8 encoding.
*
* For example: "Hello World!" becomes "Hello+World%21".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "Hello World!"} to {@code "Hello%20World%21"}.
*
* Looks up the value for the key in the format "CharsetName:URL".
*
* For example, using the HTTP scheme: "UTF-8:http://www.google.com"
*
* For example, using the file scheme:
* "UTF-8:file:///C:/somehome/commons/commons-text/src/test/resources/document.properties"
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "UTF-8:https://www.apache.org"} to the contents of that page.
*
* Looks up the value for the key in the format "DocumentPath:XPath".
*
* For example: "com/domain/document.xml:/path/to/node".
*
* Using a {@link StringLookup} from the {@link StringLookupFactory}:
*
* Using a {@link StringSubstitutor}:
*
* The above examples convert {@code "com/domain/document.xml:/path/to/node"} to the value of the XPath in the XML
* document.
*
* Looks up the value for a given key in the format "Charset:URL".
*
* For example: "UTF-8:com/domain/document.properties".
*
* For example: "com/domain/document.xml:/path/to/node".
*
* Looks up the value for a given key in the format "Document:XPath".
*
* For example: "com/domain/document.xml:/path/to/node".
*
* For example: "com/domain/document.xml:/path/to/node".
*
* Provides algorithms for looking up strings for use with a {@link org.apache.commons.text.StringSubstitutor}. The main
* class here is {@link org.apache.commons.text.lookup.StringLookupFactory}.
*
* The initial implementation was adapted from Apache Commons Log4j 2.11.0.
*
* This class comes complete with various factory methods. If these do not suffice, you can subclass and implement your
* own matcher.
*
* @since 1.3
*/
abstract class AbstractStringMatcher implements StringMatcher {
/**
* Class used to define a character for matching purposes.
*/
static final class CharMatcher extends AbstractStringMatcher {
/** The character to match. */
private final char ch;
/**
* Constructor that creates a matcher that matches a single character.
*
* @param ch
* the character to match
*/
CharMatcher(final char ch) {
super();
this.ch = ch;
}
/**
* Returns whether or not the given character matches.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index of the active buffer, valid for buffer
* @return The number of matching characters, zero for no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return ch == buffer[pos] ? 1 : 0;
}
}
/**
* Class used to define a set of characters for matching purposes.
*/
static final class CharSetMatcher extends AbstractStringMatcher {
/** The set of characters to match. */
private final char[] chars;
/**
* Constructor that creates a matcher from a character array.
*
* @param chars
* the characters to match, must not be null
*/
CharSetMatcher(final char[] chars) {
super();
this.chars = chars.clone();
Arrays.sort(this.chars);
}
/**
* Returns whether or not the given character matches.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index of the active buffer, valid for buffer
* @return The number of matching characters, zero for no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return Arrays.binarySearch(chars, buffer[pos]) >= 0 ? 1 : 0;
}
}
/**
* Class used to match no characters.
*/
static final class NoMatcher extends AbstractStringMatcher {
/**
* Constructs a new instance of
* This method is called to check for a match. The parameter
* The matching code may check one character or many. It may check characters preceding
* It must return zero for no match, or a positive number if a match was found. The number indicates the number of
* characters that matched.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @return The number of matching characters, zero for no match
*/
public int isMatch(final char[] buffer, final int pos) {
return isMatch(buffer, pos, 0, buffer.length);
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/matcher/StringMatcher.java 0000664 0000000 0000000 00000004673 13532277265 0032643 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.matcher;
/**
* Determines if a character array portion matches.
*
* @since 1.3
*/
public interface StringMatcher {
/**
* Returns the number of matching characters, zero for no match.
*
* This method is called to check for a match. The parameter
* The character array may be larger than the active area to be matched. Only values in the buffer between the
* specified indices may be accessed.
*
* The matching code may check one character or many. It may check characters preceding
* It must return zero for no match, or a positive number if a match was found. The number indicates the number of
* characters that matched.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index (exclusive) of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
int isMatch(char[] buffer, int pos, int bufferStart, int bufferEnd);
}
StringMatcherFactory.java 0000664 0000000 0000000 00000015542 13532277265 0034111 0 ustar 00root root 0000000 0000000 commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/matcher /*
* 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.
*/
package org.apache.commons.text.matcher;
/**
* Provides access to matchers defined in this package.
*
* @since 1.3
*/
public final class StringMatcherFactory {
/**
* Defines the singleton for this class.
*/
public static final StringMatcherFactory INSTANCE = new StringMatcherFactory();
/**
* Matches the same characters as StringTokenizer, namely space, tab, newline, form feed.
*/
private static final AbstractStringMatcher.CharSetMatcher SPLIT_MATCHER = new AbstractStringMatcher.CharSetMatcher(
" \t\n\r\f".toCharArray());
/**
* Matches the comma character.
*/
private static final AbstractStringMatcher.CharMatcher COMMA_MATCHER = new AbstractStringMatcher.CharMatcher(',');
/**
* Matches the tab character.
*/
private static final AbstractStringMatcher.CharMatcher TAB_MATCHER = new AbstractStringMatcher.CharMatcher('\t');
/**
* Matches the space character.
*/
private static final AbstractStringMatcher.CharMatcher SPACE_MATCHER = new AbstractStringMatcher.CharMatcher(' ');
/**
* Matches the String trim() whitespace characters.
*/
private static final AbstractStringMatcher.TrimMatcher TRIM_MATCHER = new AbstractStringMatcher.TrimMatcher();
/**
* Matches the double quote character.
*/
private static final AbstractStringMatcher.CharMatcher SINGLE_QUOTE_MATCHER = new AbstractStringMatcher.CharMatcher(
'\'');
/**
* Matches the double quote character.
*/
private static final AbstractStringMatcher.CharMatcher DOUBLE_QUOTE_MATCHER = new AbstractStringMatcher.CharMatcher(
'"');
/**
* Matches the single or double quote character.
*/
private static final AbstractStringMatcher.CharSetMatcher QUOTE_MATCHER = new AbstractStringMatcher.CharSetMatcher(
"'\"".toCharArray());
/**
* Matches no characters.
*/
private static final AbstractStringMatcher.NoMatcher NONE_MATCHER = new AbstractStringMatcher.NoMatcher();
/**
* No need to build instances for now.
*/
private StringMatcherFactory() {
// empty
}
/**
* Constructor that creates a matcher from a character.
*
* @param ch
* the character to match, must not be null
* @return a new Matcher for the given char
*/
public StringMatcher charMatcher(final char ch) {
return new AbstractStringMatcher.CharMatcher(ch);
}
/**
* Constructor that creates a matcher from a set of characters.
*
* @param chars
* the characters to match, null or empty matches nothing
* @return a new matcher for the given char[]
*/
public StringMatcher charSetMatcher(final char... chars) {
if (chars == null || chars.length == 0) {
return NONE_MATCHER;
}
if (chars.length == 1) {
return new AbstractStringMatcher.CharMatcher(chars[0]);
}
return new AbstractStringMatcher.CharSetMatcher(chars);
}
/**
* Creates a matcher from a string representing a set of characters.
*
* @param chars
* the characters to match, null or empty matches nothing
* @return a new Matcher for the given characters
*/
public StringMatcher charSetMatcher(final String chars) {
if (chars == null || chars.length() == 0) {
return NONE_MATCHER;
}
if (chars.length() == 1) {
return new AbstractStringMatcher.CharMatcher(chars.charAt(0));
}
return new AbstractStringMatcher.CharSetMatcher(chars.toCharArray());
}
/**
* Returns a matcher which matches the comma character.
*
* @return a matcher for a comma
*/
public StringMatcher commaMatcher() {
return COMMA_MATCHER;
}
/**
* Returns a matcher which matches the double quote character.
*
* @return a matcher for a double quote
*/
public StringMatcher doubleQuoteMatcher() {
return DOUBLE_QUOTE_MATCHER;
}
/**
* Matches no characters.
*
* @return a matcher that matches nothing
*/
public StringMatcher noneMatcher() {
return NONE_MATCHER;
}
/**
* Returns a matcher which matches the single or double quote character.
*
* @return a matcher for a single or double quote
*/
public StringMatcher quoteMatcher() {
return QUOTE_MATCHER;
}
/**
* Returns a matcher which matches the single quote character.
*
* @return a matcher for a single quote
*/
public StringMatcher singleQuoteMatcher() {
return SINGLE_QUOTE_MATCHER;
}
/**
* Returns a matcher which matches the space character.
*
* @return a matcher for a space
*/
public StringMatcher spaceMatcher() {
return SPACE_MATCHER;
}
/**
* Matches the same characters as StringTokenizer, namely space, tab, newline and form feed.
*
* @return The split matcher
*/
public StringMatcher splitMatcher() {
return SPLIT_MATCHER;
}
/**
* Creates a matcher from a string.
*
* @param str
* the string to match, null or empty matches nothing
* @return a new Matcher for the given String
*/
public StringMatcher stringMatcher(final String str) {
if (str == null || str.length() == 0) {
return NONE_MATCHER;
}
return new AbstractStringMatcher.StringMatcher(str);
}
/**
* Returns a matcher which matches the tab character.
*
* @return a matcher for a tab
*/
public StringMatcher tabMatcher() {
return TAB_MATCHER;
}
/**
* Matches the String trim() whitespace characters.
*
* @return The trim matcher
*/
public StringMatcher trimMatcher() {
return TRIM_MATCHER;
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/matcher/package-info.java 0000664 0000000 0000000 00000002125 13532277265 0032403 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
/**
*
* Provides algorithms for matching up strings for use with a {@link org.apache.commons.text.StringSubstitutor}. The
* main class here is {@link org.apache.commons.text.matcher.StringMatcherFactory}
* Basic classes for text handling. It utilizes the {@link CosineSimilarity} to compute the distance. Character sequences
* are converted into vectors through a simple tokenizer that works with a regular expression
* to split words in a sentence.
* For further explanation about Cosine Similarity and Cosine Distance, refer to
* http://en.wikipedia.org/wiki/Cosine_similarity.
*
* For further explanation about the Cosine Similarity, refer to
* http://en.wikipedia.org/wiki/Cosine_similarity.
* It counts how many times each element provided occurred in an array and
* returns a dict with the element as key and the count as value.
* An edit distance is a formal metric on the Kleene closure (
* This is a BiFunction<CharSequence, CharSequence, R>.
* The
* This stores a {@link EditDistance} implementation and a {@link CharSequence} "left" string.
* The {@link #apply(CharSequence right)} method accepts the "right" string and invokes the
* comparison function for the pair of strings.
*
* The following is an example which finds the most similar string:
* This accepts the edit distance implementation and the "left" string.
* This compares "left" field against the "right" parameter
* using the "edit distance" implementation.
*
* One point is given for every matched character. Subsequent matches yield two bonus points. A higher score
* indicates a higher similarity.
*
* This code has been adapted from Apache Commons Lang 3.3.
* This returns a {@link Locale}-specific {@link FuzzyScore}.
* Find the Fuzzy Score which indicates the similarity score between two
* Strings.
*
* For further explanation about the Hamming Distance, take a look at its
* Wikipedia page at http://en.wikipedia.org/wiki/Hamming_distance.
* The distance starts with zero, and for each occurrence of a
* different character in either String, it increments the distance
* by 1, and finally return its value. Since the Hamming Distance can only be calculated between strings of equal length, input of different lengths
* will throw IllegalArgumentException Stores the size of set A, set B and the intersection of A and B
* (null to this string builder.
*
* @return this, to enable chaining
*/
public StrBuilder appendNull() {
if (nullText == null) {
return this;
}
return append(nullText);
}
/**
* Appends an object to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param obj the object to append
* @return this, to enable chaining
*/
public StrBuilder append(final Object obj) {
if (obj == null) {
return appendNull();
}
if (obj instanceof CharSequence) {
return append((CharSequence) obj);
}
return append(obj.toString());
}
/**
* Appends a CharSequence to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param seq the CharSequence to append
* @return this, to enable chaining
*/
@Override
public StrBuilder append(final CharSequence seq) {
if (seq == null) {
return appendNull();
}
if (seq instanceof StrBuilder) {
return append((StrBuilder) seq);
}
if (seq instanceof StringBuilder) {
return append((StringBuilder) seq);
}
if (seq instanceof StringBuffer) {
return append((StringBuffer) seq);
}
if (seq instanceof CharBuffer) {
return append((CharBuffer) seq);
}
return append(seq.toString());
}
/**
* Appends part of a CharSequence to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param seq the CharSequence to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
@Override
public StrBuilder append(final CharSequence seq, final int startIndex, final int length) {
if (seq == null) {
return appendNull();
}
return append(seq.toString(), startIndex, length);
}
/**
* Appends a string to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @return this, to enable chaining
*/
public StrBuilder append(final String str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a string to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final String str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Calls {@link String#format(String, Object...)} and appends the result.
*
* @param format the format string
* @param objs the objects to use in the format string
* @return {@code this} to enable chaining
* @see String#format(String, Object...)
*/
public StrBuilder append(final String format, final Object... objs) {
return append(String.format(format, objs));
}
/**
* Appends the contents of a char buffer to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param buf the char buffer to append
* @return this, to enable chaining
*/
public StrBuilder append(final CharBuffer buf) {
if (buf == null) {
return appendNull();
}
if (buf.hasArray()) {
final int length = buf.remaining();
final int len = length();
ensureCapacity(len + length);
System.arraycopy(buf.array(), buf.arrayOffset() + buf.position(), buffer, len, length);
size += length;
} else {
append(buf.toString());
}
return this;
}
/**
* Appends the contents of a char buffer to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param buf the char buffer to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final CharBuffer buf, final int startIndex, final int length) {
if (buf == null) {
return appendNull();
}
if (buf.hasArray()) {
final int totalLength = buf.remaining();
if (startIndex < 0 || startIndex > totalLength) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > totalLength) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
final int len = length();
ensureCapacity(len + length);
System.arraycopy(buf.array(), buf.arrayOffset() + buf.position() + startIndex, buffer, len, length);
size += length;
} else {
append(buf.toString(), startIndex, length);
}
return this;
}
/**
* Appends a string buffer to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string buffer to append
* @return this, to enable chaining
*/
public StrBuilder append(final StringBuffer str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a string buffer to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final StringBuffer str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends a StringBuilder to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the StringBuilder to append
* @return this, to enable chaining
*/
public StrBuilder append(final StringBuilder str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a StringBuilder to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the StringBuilder to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final StringBuilder str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends another string builder to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string builder to append
* @return this, to enable chaining
*/
public StrBuilder append(final StrBuilder str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
System.arraycopy(str.buffer, 0, buffer, len, strLen);
size += strLen;
}
return this;
}
/**
* Appends part of a string builder to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final StrBuilder str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends a char array to the string builder.
* Appending null will call {@link #appendNull()}.
*
* @param chars the char array to append
* @return this, to enable chaining
*/
public StrBuilder append(final char[] chars) {
if (chars == null) {
return appendNull();
}
final int strLen = chars.length;
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
System.arraycopy(chars, 0, buffer, len, strLen);
size += strLen;
}
return this;
}
/**
* Appends a char array to the string builder.
* Appending null will call {@link #appendNull()}.
*
* @param chars the char array to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder append(final char[] chars, final int startIndex, final int length) {
if (chars == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid startIndex: " + length);
}
if (length < 0 || startIndex + length > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid length: " + length);
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
System.arraycopy(chars, startIndex, buffer, len, length);
size += length;
}
return this;
}
/**
* Appends a boolean value to the string builder.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder append(final boolean value) {
if (value) {
ensureCapacity(size + 4);
buffer[size++] = 't';
buffer[size++] = 'r';
buffer[size++] = 'u';
buffer[size++] = 'e';
} else {
ensureCapacity(size + 5);
buffer[size++] = 'f';
buffer[size++] = 'a';
buffer[size++] = 'l';
buffer[size++] = 's';
buffer[size++] = 'e';
}
return this;
}
/**
* Appends a char value to the string builder.
*
* @param ch the value to append
* @return this, to enable chaining
*/
@Override
public StrBuilder append(final char ch) {
final int len = length();
ensureCapacity(len + 1);
buffer[size++] = ch;
return this;
}
/**
* Appends an int value to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder append(final int value) {
return append(String.valueOf(value));
}
/**
* Appends a long value to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder append(final long value) {
return append(String.valueOf(value));
}
/**
* Appends a float value to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder append(final float value) {
return append(String.valueOf(value));
}
/**
* Appends a double value to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder append(final double value) {
return append(String.valueOf(value));
}
//-----------------------------------------------------------------------
/**
* Appends an object followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param obj the object to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final Object obj) {
return append(obj).appendNewLine();
}
/**
* Appends a string followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final String str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder appendln(final String str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Calls {@link String#format(String, Object...)} and appends the result.
*
* @param format the format string
* @param objs the objects to use in the format string
* @return {@code this} to enable chaining
* @see String#format(String, Object...)
*/
public StrBuilder appendln(final String format, final Object... objs) {
return append(format, objs).appendNewLine();
}
/**
* Appends a string buffer followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string buffer to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final StringBuffer str) {
return append(str).appendNewLine();
}
/**
* Appends a string builder followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string builder to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final StringBuilder str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string builder followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string builder to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder appendln(final StringBuilder str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends part of a string buffer followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder appendln(final StringBuffer str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends another string builder followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string builder to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final StrBuilder str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string builder followed by a new line to this string builder.
* Appending null will call {@link #appendNull()}.
*
* @param str the string to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder appendln(final StrBuilder str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends a char array followed by a new line to the string builder.
* Appending null will call {@link #appendNull()}.
*
* @param chars the char array to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final char[] chars) {
return append(chars).appendNewLine();
}
/**
* Appends a char array followed by a new line to the string builder.
* Appending null will call {@link #appendNull()}.
*
* @param chars the char array to append
* @param startIndex the start index, inclusive, must be valid
* @param length the length to append, must be valid
* @return this, to enable chaining
*/
public StrBuilder appendln(final char[] chars, final int startIndex, final int length) {
return append(chars, startIndex, length).appendNewLine();
}
/**
* Appends a boolean value followed by a new line to the string builder.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final boolean value) {
return append(value).appendNewLine();
}
/**
* Appends a char value followed by a new line to the string builder.
*
* @param ch the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final char ch) {
return append(ch).appendNewLine();
}
/**
* Appends an int value followed by a new line to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final int value) {
return append(value).appendNewLine();
}
/**
* Appends a long value followed by a new line to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final long value) {
return append(value).appendNewLine();
}
/**
* Appends a float value followed by a new line to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final float value) {
return append(value).appendNewLine();
}
/**
* Appends a double value followed by a new line to the string builder using String.valueOf.
*
* @param value the value to append
* @return this, to enable chaining
*/
public StrBuilder appendln(final double value) {
return append(value).appendNewLine();
}
//-----------------------------------------------------------------------
/**
* Appends each item in an array to the builder without any separators.
* Appending a null array will have no effect.
* Each object is appended using {@link #append(Object)}.
*
* @param
* for (Iterator it = list.iterator(); it.hasNext();){
* appendSeparator(",");
* append(it.next());
* }
*
* Note that for this simple example, you should use
* {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator the separator to use, null means no separator
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final String separator) {
return appendSeparator(separator, null);
}
/**
* Appends one of both separators to the StrBuilder.
* If the builder is currently empty it will append the defaultIfEmpty-separator
* Otherwise it will append the standard-separator
*
* Appending a null separator will have no effect.
* The separator is appended using {@link #append(String)}.
*
* StrBuilder whereClause = new StrBuilder();
* if(searchCommand.getPriority() != null) {
* whereClause.appendSeparator(" and", " where");
* whereClause.append(" priority = ?")
* }
* if(searchCommand.getComponent() != null) {
* whereClause.appendSeparator(" and", " where");
* whereClause.append(" component = ?")
* }
* selectClause.append(whereClause)
*
*
* @param standard the separator if builder is not empty, null means no separator
* @param defaultIfEmpty the separator if builder is empty, null means no separator
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final String standard, final String defaultIfEmpty) {
final String str = isEmpty() ? defaultIfEmpty : standard;
if (str != null) {
append(str);
}
return this;
}
/**
* Appends a separator if the builder is currently non-empty.
* The separator is appended using {@link #append(char)}.
*
* for (Iterator it = list.iterator(); it.hasNext();){
* appendSeparator(',');
* append(it.next());
* }
*
* Note that for this simple example, you should use
* {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator the separator to use
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final char separator) {
if (size() > 0) {
append(separator);
}
return this;
}
/**
* Append one of both separators to the builder
* If the builder is currently empty it will append the defaultIfEmpty-separator
* Otherwise it will append the standard-separator
*
* The separator is appended using {@link #append(char)}.
* @param standard the separator if builder is not empty
* @param defaultIfEmpty the separator if builder is empty
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final char standard, final char defaultIfEmpty) {
if (size() > 0) {
append(standard);
} else {
append(defaultIfEmpty);
}
return this;
}
/**
* Appends a separator to the builder if the loop index is greater than zero.
* Appending a null separator will have no effect.
* The separator is appended using {@link #append(String)}.
*
* for (int i = 0; i < list.size(); i++) {
* appendSeparator(",", i);
* append(list.get(i));
* }
*
* Note that for this simple example, you should use
* {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator the separator to use, null means no separator
* @param loopIndex the loop index
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final String separator, final int loopIndex) {
if (separator != null && loopIndex > 0) {
append(separator);
}
return this;
}
/**
* Appends a separator to the builder if the loop index is greater than zero.
* The separator is appended using {@link #append(char)}.
*
* for (int i = 0; i < list.size(); i++) {
* appendSeparator(",", i);
* append(list.get(i));
* }
*
* Note that for this simple example, you should use
* {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator the separator to use
* @param loopIndex the loop index
* @return this, to enable chaining
*/
public StrBuilder appendSeparator(final char separator, final int loopIndex) {
if (loopIndex > 0) {
append(separator);
}
return this;
}
//-----------------------------------------------------------------------
/**
* Appends the pad character to the builder the specified number of times.
*
* @param length the length to append, negative means no append
* @param padChar the character to append
* @return this, to enable chaining
*/
public StrBuilder appendPadding(final int length, final char padChar) {
if (length >= 0) {
ensureCapacity(size + length);
for (int i = 0; i < length; i++) {
buffer[size++] = padChar;
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Appends an object to the builder padding on the left to a fixed width.
* The toString of the object is used.
* If the object is larger than the length, the left hand side is lost.
* If the object is null, the null text value is used.
*
* @param obj the object to append, null uses null text
* @param width the fixed field width, zero or negative has no effect
* @param padChar the pad character to use
* @return this, to enable chaining
*/
public StrBuilder appendFixedWidthPadLeft(final Object obj, final int width, final char padChar) {
if (width > 0) {
ensureCapacity(size + width);
String str = obj == null ? getNullText() : obj.toString();
if (str == null) {
str = "";
}
final int strLen = str.length();
if (strLen >= width) {
str.getChars(strLen - width, strLen, buffer, size);
} else {
final int padLen = width - strLen;
for (int i = 0; i < padLen; i++) {
buffer[size + i] = padChar;
}
str.getChars(0, strLen, buffer, size + padLen);
}
size += width;
}
return this;
}
/**
* Appends an object to the builder padding on the left to a fixed width.
* The String.valueOf of the int value is used.
* If the formatted value is larger than the length, the left hand side is lost.
*
* @param value the value to append
* @param width the fixed field width, zero or negative has no effect
* @param padChar the pad character to use
* @return this, to enable chaining
*/
public StrBuilder appendFixedWidthPadLeft(final int value, final int width, final char padChar) {
return appendFixedWidthPadLeft(String.valueOf(value), width, padChar);
}
/**
* Appends an object to the builder padding on the right to a fixed length.
* The toString of the object is used.
* If the object is larger than the length, the right hand side is lost.
* If the object is null, null text value is used.
*
* @param obj the object to append, null uses null text
* @param width the fixed field width, zero or negative has no effect
* @param padChar the pad character to use
* @return this, to enable chaining
*/
public StrBuilder appendFixedWidthPadRight(final Object obj, final int width, final char padChar) {
if (width > 0) {
ensureCapacity(size + width);
String str = obj == null ? getNullText() : obj.toString();
if (str == null) {
str = "";
}
final int strLen = str.length();
if (strLen >= width) {
str.getChars(0, width, buffer, size);
} else {
final int padLen = width - strLen;
str.getChars(0, strLen, buffer, size);
for (int i = 0; i < padLen; i++) {
buffer[size + strLen + i] = padChar;
}
}
size += width;
}
return this;
}
/**
* Appends an object to the builder padding on the right to a fixed length.
* The String.valueOf of the int value is used.
* If the object is larger than the length, the right hand side is lost.
*
* @param value the value to append
* @param width the fixed field width, zero or negative has no effect
* @param padChar the pad character to use
* @return this, to enable chaining
*/
public StrBuilder appendFixedWidthPadRight(final int value, final int width, final char padChar) {
return appendFixedWidthPadRight(String.valueOf(value), width, padChar);
}
//-----------------------------------------------------------------------
/**
* Inserts the string representation of an object into this builder.
* Inserting null will use the stored null text value.
*
* @param index the index to add at, must be valid
* @param obj the object to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final Object obj) {
if (obj == null) {
return insert(index, nullText);
}
return insert(index, obj.toString());
}
/**
* Inserts the string into this builder.
* Inserting null will use the stored null text value.
*
* @param index the index to add at, must be valid
* @param str the string to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, String str) {
validateIndex(index);
if (str == null) {
str = nullText;
}
if (str != null) {
final int strLen = str.length();
if (strLen > 0) {
final int newSize = size + strLen;
ensureCapacity(newSize);
System.arraycopy(buffer, index, buffer, index + strLen, size - index);
size = newSize;
str.getChars(0, strLen, buffer, index);
}
}
return this;
}
/**
* Inserts the character array into this builder.
* Inserting null will use the stored null text value.
*
* @param index the index to add at, must be valid
* @param chars the char array to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final char[] chars) {
validateIndex(index);
if (chars == null) {
return insert(index, nullText);
}
final int len = chars.length;
if (len > 0) {
ensureCapacity(size + len);
System.arraycopy(buffer, index, buffer, index + len, size - index);
System.arraycopy(chars, 0, buffer, index, len);
size += len;
}
return this;
}
/**
* Inserts part of the character array into this builder.
* Inserting null will use the stored null text value.
*
* @param index the index to add at, must be valid
* @param chars the char array to insert
* @param offset the offset into the character array to start at, must be valid
* @param length the length of the character array part to copy, must be positive
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if any index is invalid
*/
public StrBuilder insert(final int index, final char[] chars, final int offset, final int length) {
validateIndex(index);
if (chars == null) {
return insert(index, nullText);
}
if (offset < 0 || offset > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid offset: " + offset);
}
if (length < 0 || offset + length > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid length: " + length);
}
if (length > 0) {
ensureCapacity(size + length);
System.arraycopy(buffer, index, buffer, index + length, size - index);
System.arraycopy(chars, offset, buffer, index, length);
size += length;
}
return this;
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(int index, final boolean value) {
validateIndex(index);
if (value) {
ensureCapacity(size + 4);
System.arraycopy(buffer, index, buffer, index + 4, size - index);
buffer[index++] = 't';
buffer[index++] = 'r';
buffer[index++] = 'u';
buffer[index] = 'e';
size += 4;
} else {
ensureCapacity(size + 5);
System.arraycopy(buffer, index, buffer, index + 5, size - index);
buffer[index++] = 'f';
buffer[index++] = 'a';
buffer[index++] = 'l';
buffer[index++] = 's';
buffer[index] = 'e';
size += 5;
}
return this;
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final char value) {
validateIndex(index);
ensureCapacity(size + 1);
System.arraycopy(buffer, index, buffer, index + 1, size - index);
buffer[index] = value;
size++;
return this;
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final int value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final long value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final float value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index the index to add at, must be valid
* @param value the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder insert(final int index, final double value) {
return insert(index, String.valueOf(value));
}
//-----------------------------------------------------------------------
/**
* Internal method to delete a range without validation.
*
* @param startIndex the start index, must be valid
* @param endIndex the end index (exclusive), must be valid
* @param len the length, must be valid
* @throws IndexOutOfBoundsException if any index is invalid
*/
private void deleteImpl(final int startIndex, final int endIndex, final int len) {
System.arraycopy(buffer, endIndex, buffer, startIndex, size - endIndex);
size -= len;
}
/**
* Deletes the characters between the two specified indices.
*
* @param startIndex the start index, inclusive, must be valid
* @param endIndex the end index, exclusive, must be valid except
* that if too large it is treated as end of string
* @return this, to enable chaining
* @throws IndexOutOfBoundsException if the index is invalid
*/
public StrBuilder delete(final int startIndex, int endIndex) {
endIndex = validateRange(startIndex, endIndex);
final int len = endIndex - startIndex;
if (len > 0) {
deleteImpl(startIndex, endIndex, len);
}
return this;
}
//-----------------------------------------------------------------------
/**
* Deletes the character wherever it occurs in the builder.
*
* @param ch the character to delete
* @return this, to enable chaining
*/
public StrBuilder deleteAll(final char ch) {
for (int i = 0; i < size; i++) {
if (buffer[i] == ch) {
final int start = i;
while (++i < size) {
if (buffer[i] != ch) {
break;
}
}
final int len = i - start;
deleteImpl(start, i, len);
i -= len;
}
}
return this;
}
/**
* Deletes the character wherever it occurs in the builder.
*
* @param ch the character to delete
* @return this, to enable chaining
*/
public StrBuilder deleteFirst(final char ch) {
for (int i = 0; i < size; i++) {
if (buffer[i] == ch) {
deleteImpl(i, i + 1, 1);
break;
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Deletes the string wherever it occurs in the builder.
*
* @param str the string to delete, null causes no action
* @return this, to enable chaining
*/
public StrBuilder deleteAll(final String str) {
final int len = str == null ? 0 : str.length();
if (len > 0) {
int index = indexOf(str, 0);
while (index >= 0) {
deleteImpl(index, index + len, len);
index = indexOf(str, index);
}
}
return this;
}
/**
* Deletes the string wherever it occurs in the builder.
*
* @param str the string to delete, null causes no action
* @return this, to enable chaining
*/
public StrBuilder deleteFirst(final String str) {
final int len = str == null ? 0 : str.length();
if (len > 0) {
final int index = indexOf(str, 0);
if (index >= 0) {
deleteImpl(index, index + len, len);
}
}
return this;
}
//-----------------------------------------------------------------------
/**
* Deletes all parts of the builder that the matcher matches.
* length characters from
* the builder. If this many characters are not available, the whole
* builder is returned. Thus the returned string may be shorter than the
* length requested.
*
* @param length the number of characters to extract, negative returns empty string
* @return The new string
*/
public String leftString(final int length) {
if (length <= 0) {
return "";
} else if (length >= size) {
return new String(buffer, 0, size);
} else {
return new String(buffer, 0, length);
}
}
/**
* Extracts the rightmost characters from the string builder without
* throwing an exception.
* length characters from
* the builder. If this many characters are not available, the whole
* builder is returned. Thus the returned string may be shorter than the
* length requested.
*
* @param length the number of characters to extract, negative returns empty string
* @return The new string
*/
public String rightString(final int length) {
if (length <= 0) {
return "";
} else if (length >= size) {
return new String(buffer, 0, size);
} else {
return new String(buffer, size - length, length);
}
}
/**
* Extracts some characters from the middle of the string builder without
* throwing an exception.
* length characters from the builder
* at the specified index.
* If the index is negative it is treated as zero.
* If the index is greater than the builder size, it is treated as the builder size.
* If the length is negative, the empty string is returned.
* If insufficient characters are available in the builder, as much as possible is returned.
* Thus the returned string may be shorter than the length requested.
*
* @param index the index to start at, negative means zero
* @param length the number of characters to extract, negative returns empty string
* @return The new string
*/
public String midString(int index, final int length) {
if (index < 0) {
index = 0;
}
if (length <= 0 || index >= size) {
return "";
}
if (size <= index + length) {
return new String(buffer, index, size - index);
}
return new String(buffer, index, length);
}
//-----------------------------------------------------------------------
/**
* Checks if the string builder contains the specified char.
*
* @param ch the character to find
* @return true if the builder contains the character
*/
public boolean contains(final char ch) {
final char[] thisBuf = buffer;
for (int i = 0; i < this.size; i++) {
if (thisBuf[i] == ch) {
return true;
}
}
return false;
}
/**
* Checks if the string builder contains the specified string.
*
* @param str the string to find
* @return true if the builder contains the string
*/
public boolean contains(final String str) {
return indexOf(str, 0) >= 0;
}
/**
* Checks if the string builder contains a string matched using the
* specified matcher.
*
* StrBuilder b = new StrBuilder();
* b.append("a b ");
* StrTokenizer t = b.asTokenizer();
* String[] tokens1 = t.getTokenArray(); // returns a,b
* b.append("c d ");
* String[] tokens2 = t.getTokenArray(); // returns a,b (c and d ignored)
* t.reset(); // reset causes builder changes to be picked up
* String[] tokens3 = t.getTokenArray(); // returns a,b,c,d
*
* In addition to simply intermixing appends and tokenization, you can also
* call the set methods on the tokenizer to alter how it tokenizes. Just
* remember to call reset when you want to pickup builder changes.
* StrBuilder, populate it with
* data, call asReader, and then read away.
* StrBuilder,
* call asWriter, and populate away. The data is available
* at any time using the methods of the StrBuilder.
* StrBuilder to the
* provided {@link Appendable}.
* pos represents the current position to be
* checked in the string buffer (a character array which must
* not be changed).
* The API guarantees that pos is a valid index for buffer.
* pos as well as those
* after, so long as no checks exceed the bounds specified.
* pos represents the current position to be
* checked in the string buffer (a character array which must
* not be changed).
* The API guarantees that pos is a valid index for buffer.
* pos as well as those after.
* NoMatcher.
*/
NoMatcher() {
super();
}
/**
* Always returns false.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return 0;
}
}
//-----------------------------------------------------------------------
/**
* Class used to match whitespace as per trim().
*/
static final class TrimMatcher extends StrMatcher {
/**
* Constructs a new instance of TrimMatcher.
*/
TrimMatcher() {
super();
}
/**
* Returns whether or not the given character matches.
*
* @param buffer the text content to match against, do not change
* @param pos the starting position for the match, valid for buffer
* @param bufferStart the first active index in the buffer, valid for buffer
* @param bufferEnd the end index of the active buffer, valid for buffer
* @return The number of matching characters, or zero if there is no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return buffer[pos] <= 32 ? 1 : 0;
}
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/StrSubstitutor.java 0000664 0000000 0000000 00000153257 13532277265 0031511 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.util.ArrayList;
import java.util.Enumeration;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Properties;
import org.apache.commons.lang3.Validate;
/**
* Substitutes variables within a string by values.
* ${variableName}.
* The prefix and suffix can be changed via constructors and set methods.
*
* StrSubstitutor.replaceSystemProperties(
* "You are running with java.version = ${java.version} and os.name = ${os.name}.");
*
* replace()
* method can be called passing in the source text for interpolation. In the returned
* text all variable references (as long as their values are known) will be resolved.
* The following example demonstrates this:
*
* Map valuesMap = HashMap();
* valuesMap.put("animal", "quick brown fox");
* valuesMap.put("target", "lazy dog");
* String templateString = "The ${animal} jumped over the ${target}.";
* StrSubstitutor sub = new StrSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
* yielding:
*
* The quick brown fox jumped over the lazy dog.
*
*
* Map valuesMap = HashMap();
* valuesMap.put("animal", "quick brown fox");
* valuesMap.put("target", "lazy dog");
* String templateString = "The ${animal} jumped over the ${target}. ${undefined.number:-1234567890}.";
* StrSubstitutor sub = new StrSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
* yielding:
*
* The quick brown fox jumped over the lazy dog. 1234567890.
*
*
* The variable ${${name}} must be used.
*
* Here only the variable's name referred to in the text should be replaced resulting
* in the text (assuming that the value of the name variable is x):
*
* The variable ${x} must be used.
*
* To achieve this effect there are two possibilities: Either set a different prefix
* and suffix for variables which do not conflict with the result text you want to
* produce. The other possibility is to use the escape character, by default '$'.
* If this character is placed before a variable reference, this reference is ignored
* and won't be replaced. For example:
*
* The variable $${${name}} must be used.
*
*
* ${jre-${java.specification.version}}
*
* StrSubstitutor supports this recursive substitution in variable
* names, but it has to be enabled explicitly by setting the
* {@link #setEnableSubstitutionInVariables(boolean) enableSubstitutionInVariables}
* property to true.
* toString and is not altered.
*
* @param source the source to replace in, null returns null
* @return The result of the replace operation
*/
public String replace(final Object source) {
if (source == null) {
return null;
}
final StrBuilder buf = new StrBuilder().append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables within the given source buffer
* with their matching values from the resolver.
* The buffer is updated with the result.
*
* @param source the buffer to replace in, updated, null returns zero
* @return true if altered
*/
public boolean replaceIn(final StringBuffer source) {
if (source == null) {
return false;
}
return replaceIn(source, 0, source.length());
}
/**
* Replaces all the occurrences of variables within the given source buffer
* with their matching values from the resolver.
* The buffer is updated with the result.
* valueDelimiterMatcher is null, then the variable default value resolution
* becomes disabled.
*
* @param valueDelimiterMatcher variable default value delimiter matcher to use, may be null
* @return this, to enable chaining
*/
public StrSubstitutor setValueDelimiterMatcher(final StrMatcher valueDelimiterMatcher) {
this.valueDelimiterMatcher = valueDelimiterMatcher;
return this;
}
/**
* Sets the variable default value delimiter to use.
* valueDelimiter is null or empty string, then the variable default
* value resolution becomes disabled.
*
* @param valueDelimiter the variable default value delimiter string to use, may be null or empty
* @return this, to enable chaining
*/
public StrSubstitutor setValueDelimiter(final String valueDelimiter) {
if (valueDelimiter == null || valueDelimiter.length() == 0) {
setValueDelimiterMatcher(null);
return this;
}
return setValueDelimiterMatcher(StrMatcher.stringMatcher(valueDelimiter));
}
// Resolver
//-----------------------------------------------------------------------
/**
* Gets the VariableResolver that is used to lookup variables.
*
* @return The VariableResolver
*/
public StrLookup getVariableResolver() {
return this.variableResolver;
}
/**
* Sets the VariableResolver that is used to lookup variables.
*
* @param variableResolver the VariableResolver
*/
public void setVariableResolver(final StrLookup variableResolver) {
this.variableResolver = variableResolver;
}
// Substitution support in variable names
//-----------------------------------------------------------------------
/**
* Returns a flag whether substitution is done in variable names.
*
* @return The substitution in variable names flag
*/
public boolean isEnableSubstitutionInVariables() {
return enableSubstitutionInVariables;
}
/**
* Sets a flag whether substitution is done in variable names. If set to
* true, the names of variables can contain other variables which are
* processed first before the original variable is evaluated, e.g.
* ${jre-${java.version}}. The default value is false.
*
* @param enableSubstitutionInVariables the new value of the flag
*/
public void setEnableSubstitutionInVariables(
final boolean enableSubstitutionInVariables) {
this.enableSubstitutionInVariables = enableSubstitutionInVariables;
}
/**
* Returns a flag whether substitution is disabled in variable values.If set to
* true, the values of variables can contain other variables will not be
* processed and substituted original variable is evaluated, e.g.
*
* Map valuesMap = HashMap();
* valuesMap.put("name", "Douglas ${surname}");
* valuesMap.put("surname", "Crockford");
* String templateString = "Hi ${name}";
* StrSubstitutor sub = new StrSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
* yielding:
*
* Hi Douglas ${surname}
*
*
* @return The substitution in variable values flag
*
* @since 1.2
*/
public boolean isDisableSubstitutionInValues() {
return disableSubstitutionInValues;
}
/**
* Sets a flag whether substitution is done in variable values (recursive).
*
* @param disableSubstitutionInValues true if substitution in variable value are disabled
*
* @since 1.2
*/
public void setDisableSubstitutionInValues(final boolean disableSubstitutionInValues) {
this.disableSubstitutionInValues = disableSubstitutionInValues;
}
/**
* Returns the flag controlling whether escapes are preserved during
* substitution.
*
* @return The preserve escape flag
*/
public boolean isPreserveEscapes() {
return preserveEscapes;
}
/**
* Sets a flag controlling whether escapes are preserved during
* substitution. If set to true, the escape character is retained
* during substitution (e.g. $${this-is-escaped} remains
* $${this-is-escaped}). If set to false, the escape
* character is removed during substitution (e.g.
* $${this-is-escaped} becomes
* ${this-is-escaped}). The default value is false
*
* @param preserveEscapes true if escapes are to be preserved
*/
public void setPreserveEscapes(final boolean preserveEscapes) {
this.preserveEscapes = preserveEscapes;
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/StrTokenizer.java 0000664 0000000 0000000 00000113106 13532277265 0031101 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
/**
* Tokenizes a string based on delimiters (separators)
* and supporting quoting and ignored character concepts.
* ListIterator interface. By default, it is set up
* like StringTokenizer.
*
* "a,b,c" - Three tokens "a","b","c" (comma delimiter)
* " a, b , c " - Three tokens "a","b","c" (default CSV processing trims whitespace)
* "a, ", b ,", c" - Three tokens "a, " , " b ", ", c" (quoted text untouched)
*
*
*
*
*
* @since 1.0
* @deprecated Deprecated as of 1.3, use {@link StringTokenizer} instead. This class will be removed in 2.0.
*/
@Deprecated
public class StrTokenizer implements ListIterator
*
* Property Type Default
*
*
* delim CharSetMatcher { \t\n\r\f}
*
*
* quote NoneMatcher {}
*
*
* ignore NoneMatcher {}
*
*
* emptyTokenAsNull boolean false
*
*
* ignoreEmptyTokens boolean true
* CSV_TOKENIZER_PROTOTYPE.
*
* @return a clone of CSV_TOKENIZER_PROTOTYPE.
*/
private static StrTokenizer getCSVClone() {
return (StrTokenizer) CSV_TOKENIZER_PROTOTYPE.clone();
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings
* initializing it with the given input. The default for CSV processing
* will be trim whitespace from both ends (which can be overridden with
* the setTrimmer method).
* TSV_TOKENIZER_PROTOTYPE.
*
* @return a clone of TSV_TOKENIZER_PROTOTYPE.
*/
private static StrTokenizer getTSVClone() {
return (StrTokenizer) TSV_TOKENIZER_PROTOTYPE.clone();
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings.
* The default for CSV processing will be trim whitespace from both ends
* (which can be overridden with the setTrimmer method).
* StrTokenizer will always pass a zero offset and a count
* equal to the length of the array to this method, however a subclass
* may pass other values, or even an entirely different array.
*
* @param srcChars the character array being tokenized, may be null
* @param offset the start position within the character array, must be valid
* @param count the number of characters to tokenize, must be valid
* @return The modifiable list of String tokens, unmodifiable if null array or zero count
*/
protected Listnull.
*
* @return a new instance of this Tokenizer which has been reset.
*/
@Override
public Object clone() {
try {
return cloneReset();
} catch (final CloneNotSupportedException ex) {
return null;
}
}
/**
* Creates a new instance of this Tokenizer. The new instance is reset so that
* it will be at the start of the token list.
*
* @return a new instance of this Tokenizer which has been reset.
* @throws CloneNotSupportedException if there is a problem cloning
*/
Object cloneReset() throws CloneNotSupportedException {
// this method exists to enable 100% test coverage
final StrTokenizer cloned = (StrTokenizer) super.clone();
if (cloned.chars != null) {
cloned.chars = cloned.chars.clone();
}
cloned.reset();
return cloned;
}
//-----------------------------------------------------------------------
/**
* Gets the String content that the tokenizer is parsing.
*
* @return The string content being parsed
*/
@Override
public String toString() {
if (tokens == null) {
return "StrTokenizer[not tokenized yet]";
}
return "StrTokenizer" + getTokenList();
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/StringEscapeUtils.java 0000664 0000000 0000000 00000103645 13532277265 0032055 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import org.apache.commons.lang3.StringUtils;
import org.apache.commons.text.translate.AggregateTranslator;
import org.apache.commons.text.translate.CharSequenceTranslator;
import org.apache.commons.text.translate.CsvTranslators;
import org.apache.commons.text.translate.EntityArrays;
import org.apache.commons.text.translate.JavaUnicodeEscaper;
import org.apache.commons.text.translate.LookupTranslator;
import org.apache.commons.text.translate.NumericEntityEscaper;
import org.apache.commons.text.translate.NumericEntityUnescaper;
import org.apache.commons.text.translate.OctalUnescaper;
import org.apache.commons.text.translate.UnicodeUnescaper;
import org.apache.commons.text.translate.UnicodeUnpairedSurrogateRemover;
import java.io.IOException;
import java.io.Writer;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
/**
* StringEscapeUtils.escapeJava("foo");
*
*
* new Builder(ESCAPE_HTML4)
* .append("<p>")
* .escape("This is paragraph 1 and special chars like & get escaped.")
* .append("</p><p>")
* .escape("This is paragraph 2 & more...")
* .append("</p>")
* .toString()
*
*
*/
public static final class Builder {
/**
* StringBuilder to be used in the Builder class.
*/
private final StringBuilder sb;
/**
* CharSequenceTranslator to be used in the Builder class.
*/
private final CharSequenceTranslator translator;
/**
* Builder constructor.
*
* @param translator a CharSequenceTranslator.
*/
private Builder(final CharSequenceTranslator translator) {
this.sb = new StringBuilder();
this.translator = translator;
}
/**
*
* input string: He didn't say, "Stop!"
* output string: He didn't say, \"Stop!\"
*
*
* @param input String to escape values in, may be null
* @return String with escaped values, {@code null} if null string input
*/
public static final String escapeJava(final String input) {
return ESCAPE_JAVA.translate(input);
}
/**
*
* input string: He didn't say, "Stop!"
* output string: He didn\'t say, \"Stop!\"
*
*
* Security Note. We only provide backslash escaping in this method. For example, {@code '\"'} has the output
* {@code '\\\"'} which could result in potential issues in the case where the string being escaped is being used
* in an HTML tag like {@code }. If you wish to have more rigorous string escaping, you
* may consider the
* ESAPI Libraries.
* Further, you can view the ESAPI GitHub Org.
*
* @param input String to escape values in, may be null
* @return String with escaped values, {@code null} if null string input
*/
public static final String escapeEcmaScript(final String input) {
return ESCAPE_ECMASCRIPT.translate(input);
}
/**
*
* input string: He didn't say, "Stop!"
* output string: He didn't say, \"Stop!\"
*
*
* @param input String to escape values in, may be null
* @return String with escaped values, {@code null} if null string input
*/
public static final String escapeJson(final String input) {
return ESCAPE_JSON.translate(input);
}
/**
* "bread" & "butter""bread" & "butter".
*
* input string: He didn't say, "Stop!"
* output string: He\ didn\'t\ say,\ \"Stop!\"
*
*
* @see Shell Command Language
* @param input String to escape values in, may be null
* @return String with escaped values, {@code null} if null string input
*/
public static final String escapeXSI(final String input) {
return ESCAPE_XSI.translate(input);
}
/**
* ${variableName}. The prefix and suffix can be changed via constructors and set methods.
*
* StringSubstitutor
* .replaceSystemProperties("You are running with java.version = ${java.version} and os.name = ${os.name}.");
*
*
* Using a Custom Map
*
* Map valuesMap = HashMap();
* valuesMap.put("animal", "quick brown fox");
* valuesMap.put("target", "lazy dog");
* String templateString = "The ${animal} jumped over the ${target}.";
* StringSubstitutor sub = new StringSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
*
*
* The quick brown fox jumped over the lazy dog.
*
*
* Providing Default Values
*
* Map valuesMap = HashMap();
* valuesMap.put("animal", "quick brown fox");
* valuesMap.put("target", "lazy dog");
* String templateString = "The ${animal} jumped over the ${target}. ${undefined.number:-1234567890}.";
* StringSubstitutor sub = new StringSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
*
*
* The quick brown fox jumped over the lazy dog. 1234567890.
*
*
* Reusing Instances
* Using Interpolation
*
final StringSubstitutor interpolator = StringSubstitutor.createInterpolator();
interpolator.setEnableSubstitutionInVariables(true); // Allows for nested $'s.
final String text = interpolator.replace(
"Base64 Decoder: ${base64Decoder:SGVsbG9Xb3JsZCE=}\n" +
"Base64 Encoder: ${base64Encoder:HelloWorld!}\n" +
"Java Constant: ${const:java.awt.event.KeyEvent.VK_ESCAPE}\n" +
"Date: ${date:yyyy-MM-dd}\n" +
"DNS: ${dns:address|apache.org}\n" +
"Environment Variable: ${env:USERNAME}\n" +
"File Content: ${file:UTF-8:src/test/resources/document.properties}\n" +
"Java: ${java:version}\n" +
"Localhost: ${localhost:canonical-name}\n" +
"Properties File: ${properties:src/test/resources/document.properties::mykey}\n" +
"Resource Bundle: ${resourceBundle:org.example.testResourceBundleLookup:mykey}\n" +
"Script: ${script:javascript:3 + 4}\n" +
"System Property: ${sys:user.dir}\n" +
"URL Decoder: ${urlDecoder:Hello%20World%21}\n" +
"URL Encoder: ${urlEncoder:Hello World!}\n" +
"URL Content (HTTP): ${url:UTF-8:http://www.apache.org}\n" +
"URL Content (HTTPS): ${url:UTF-8:https://www.apache.org}\n" +
"URL Content (File): ${url:UTF-8:file:///${sys:user.dir}/src/test/resources/document.properties}\n" +
"XML XPath: ${xml:src/test/resources/document.xml:/root/path/to/node}\n"
);
*
* Using Recursive Variable Replacement
*
* The variable ${${name}} must be used.
*
*
*
* The variable ${x} must be used.
*
*
*
* The variable $${${name}} must be used.
*
*
* ${jre-${java.specification.version}}
*
*
*
* StringSubstitutor.createInterpolator()
* .replace("OS name: ${sys:os.name}, " + "3 + 4 = ${script:javascript:3 + 4}");
*
*
* @return a new instance using the interpolator string lookup.
* @see StringLookupFactory#interpolatorStringLookup()
* @since 1.8
*/
public static StringSubstitutor createInterpolator() {
return new StringSubstitutor(StringLookupFactory.INSTANCE.interpolatorStringLookup());
}
/**
* Replaces all the occurrences of variables in the given source object with their matching values from the map.
*
* @param
* Map valuesMap = HashMap();
* valuesMap.put("name", "Douglas ${surname}");
* valuesMap.put("surname", "Crockford");
* String templateString = "Hi ${name}";
* StrSubstitutor sub = new StrSubstitutor(valuesMap);
* String resolvedString = sub.replace(templateString);
*
*
* yielding:
*
*
* Hi Douglas ${surname}
*
*
* @return The substitution in variable values flag
*/
public boolean isDisableSubstitutionInValues() {
return disableSubstitutionInValues;
}
// Substitution support in variable names
// -----------------------------------------------------------------------
/**
* Returns a flag whether substitution is done in variable names.
*
* @return The substitution in variable names flag
*/
public boolean isEnableSubstitutionInVariables() {
return enableSubstitutionInVariables;
}
/**
* Returns a flag whether exception can be thrown upon undefined variable.
*
* @return The fail on undefined variable flag
*/
public boolean isEnableUndefinedVariableException() {
return enableUndefinedVariableException;
}
/**
* Returns the flag controlling whether escapes are preserved during substitution.
*
* @return The preserve escape flag
*/
public boolean isPreserveEscapes() {
return preserveEscapes;
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* array as a template. The array is not altered by this method.
*
* @param source the character array to replace in, not altered, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final char[] source) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(source.length).append(source);
substitute(buf, 0, source.length);
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* array as a template. The array is not altered by this method.
* toString and is not altered.
*
* @param source the source to replace in, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if a variable is not found and enableUndefinedVariableException is true
*/
public String replace(final Object source) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder().append(source);
substitute(buf, 0, buf.length());
return buf.toString();
}
// -----------------------------------------------------------------------
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* string as a template.
*
* @param source the string to replace in, null returns null
* @return The result of the replace operation
* @throws IllegalArgumentException if variable is not found when its allowed to throw exception
*/
public String replace(final String source) {
if (source == null) {
return null;
}
final TextStringBuilder buf = new TextStringBuilder(source);
if (!substitute(buf, 0, source.length())) {
return source;
}
return buf.toString();
}
/**
* Replaces all the occurrences of variables with their matching values from the resolver using the given source
* string as a template.
* ${jre-${java.version}}. The default value is false.
*
* @param enableSubstitutionInVariables the new value of the flag
* @return this, to enable chaining
*/
public StringSubstitutor setEnableSubstitutionInVariables(final boolean enableSubstitutionInVariables) {
this.enableSubstitutionInVariables = enableSubstitutionInVariables;
return this;
}
/**
* Sets a flag whether exception should be thrown if any variable is undefined.
*
* @param failOnUndefinedVariable true if exception should be thrown on undefined variable
* @return this, to enable chaining
*/
public StringSubstitutor setEnableUndefinedVariableException(final boolean failOnUndefinedVariable) {
this.enableUndefinedVariableException = failOnUndefinedVariable;
return this;
}
/**
* Sets the escape character. If this character is placed before a variable reference in the source text, this
* variable will be ignored.
*
* @param escapeCharacter the escape character (0 for disabling escaping)
* @return this, to enable chaining
*/
public StringSubstitutor setEscapeChar(final char escapeCharacter) {
this.escapeChar = escapeCharacter;
return this;
}
/**
* Sets a flag controlling whether escapes are preserved during substitution. If set to true, the escape
* character is retained during substitution (e.g. $${this-is-escaped} remains
* $${this-is-escaped}). If set to false, the escape character is removed during substitution
* (e.g. $${this-is-escaped} becomes ${this-is-escaped}). The default value is
* false
*
* @param preserveEscapes true if escapes are to be preserved
* @return this, to enable chaining
*/
public StringSubstitutor setPreserveEscapes(final boolean preserveEscapes) {
this.preserveEscapes = preserveEscapes;
return this;
}
/**
* Sets the variable default value delimiter to use.
* valueDelimiter is null or empty string, then the variable default value resolution becomes
* disabled.
*
* @param valueDelimiter the variable default value delimiter string to use, may be null or empty
* @return this, to enable chaining
*/
public StringSubstitutor setValueDelimiter(final String valueDelimiter) {
if (valueDelimiter == null || valueDelimiter.length() == 0) {
setValueDelimiterMatcher(null);
return this;
}
return setValueDelimiterMatcher(StringMatcherFactory.INSTANCE.stringMatcher(valueDelimiter));
}
/**
* Sets the variable default value delimiter matcher to use.
* valueDelimiterMatcher is null, then the variable default value resolution becomes disabled.
*
* @param valueDelimiterMatcher variable default value delimiter matcher to use, may be null
* @return this, to enable chaining
*/
public StringSubstitutor setValueDelimiterMatcher(final StringMatcher valueDelimiterMatcher) {
this.valueDelimiterMatcher = valueDelimiterMatcher;
return this;
}
/**
* Sets the variable prefix to use.
* ListIterator interface. By default, it is set up like StringTokenizer.
*
* "a,b,c" - Three tokens "a","b","c" (comma delimiter)
* " a, b , c " - Three tokens "a","b","c" (default CSV processing trims whitespace)
* "a, ", b ,", c" - Three tokens "a, " , " b ", ", c" (quoted text untouched)
*
*
*
*
*
* @since 1.3
*/
public class StringTokenizer implements ListIterator
*
* Property
* Type
* Default
*
*
* delim
* CharSetMatcher
* { \t\n\r\f}
*
*
* quote
* NoneMatcher
* {}
*
*
* ignore
* NoneMatcher
* {}
*
*
* emptyTokenAsNull
* boolean
* false
*
*
* ignoreEmptyTokens
* boolean
* true
* CSV_TOKENIZER_PROTOTYPE.
*
* @return a clone of CSV_TOKENIZER_PROTOTYPE.
*/
private static StringTokenizer getCSVClone() {
return (StringTokenizer) CSV_TOKENIZER_PROTOTYPE.clone();
}
/**
* Gets a new tokenizer instance which parses Comma Separated Value strings initializing it with the given input.
* The default for CSV processing will be trim whitespace from both ends (which can be overridden with the
* setTrimmer method).
* TSV_TOKENIZER_PROTOTYPE.
*
* @return a clone of TSV_TOKENIZER_PROTOTYPE.
*/
private static StringTokenizer getTSVClone() {
return (StringTokenizer) TSV_TOKENIZER_PROTOTYPE.clone();
}
/**
* Gets a new tokenizer instance which parses Tab Separated Value strings. The default for CSV processing will be
* trim whitespace from both ends (which can be overridden with the setTrimmer method).
* StrTokenizer will always pass a zero offset and a count equal to the length of the array to this
* method, however a subclass may pass other values, or even an entirely different array.
*
* @param srcChars
* the character array being tokenized, may be null
* @param offset
* the start position within the character array, must be valid
* @param count
* the number of characters to tokenize, must be valid
* @return The modifiable list of String tokens, unmodifiable if null array or zero count
*/
protected Listnull.
*
* @return a new instance of this Tokenizer which has been reset.
*/
@Override
public Object clone() {
try {
return cloneReset();
} catch (final CloneNotSupportedException ex) {
return null;
}
}
/**
* Creates a new instance of this Tokenizer. The new instance is reset so that it will be at the start of the token
* list.
*
* @return a new instance of this Tokenizer which has been reset.
* @throws CloneNotSupportedException
* if there is a problem cloning
*/
Object cloneReset() throws CloneNotSupportedException {
// this method exists to enable 100% test coverage
final StringTokenizer cloned = (StringTokenizer) super.clone();
if (cloned.chars != null) {
cloned.chars = cloned.chars.clone();
}
cloned.reset();
return cloned;
}
// -----------------------------------------------------------------------
/**
* Gets the String content that the tokenizer is parsing.
*
* @return The string content being parsed
*/
@Override
public String toString() {
if (tokens == null) {
return "StringTokenizer[not tokenized yet]";
}
return "StringTokenizer" + getTokenList();
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/TextRandomProvider.java 0000664 0000000 0000000 00000003555 13532277265 0032244 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
/**
*
* {@code
* UniformRandomProvider rng = RandomSource.create(...);
* RandomStringGenerator gen = new RandomStringGenerator.Builder()
* .usingRandom(rng::nextInt)
* // additional builder calls as needed
* .build();
* }
*
* @since 1.1
*/
public interface TextRandomProvider {
/**
* Generates an int value between 0 (inclusive) and the specified value
* (exclusive).
* @param max Bound on the random number to be returned. Must be positive.
* @return a random int value between 0 (inclusive) and n (exclusive).
*/
int nextInt(int max);
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/TextStringBuilder.java 0000664 0000000 0000000 00000327526 13532277265 0032075 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text;
import java.io.IOException;
import java.io.Reader;
import java.io.Serializable;
import java.io.Writer;
import java.nio.CharBuffer;
import java.util.Iterator;
import java.util.List;
import java.util.Objects;
import org.apache.commons.text.matcher.StringMatcher;
/**
* Builds a string from constituent parts providing a more flexible and powerful API than StringBuffer.
*
*
*
*
*
*
* true if the size is 0.
*/
public boolean isEmpty() {
return size == 0;
}
/**
* Clears the string builder (convenience Collections API style method).
* clear()
* followed by {@link #minimizeCapacity()}.
* null to this string builder.
*
* @return this, to enable chaining
*/
public TextStringBuilder appendNull() {
if (nullText == null) {
return this;
}
return append(nullText);
}
/**
* Appends an object to this string builder. Appending null will call {@link #appendNull()}.
*
* @param obj
* the object to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final Object obj) {
if (obj == null) {
return appendNull();
}
if (obj instanceof CharSequence) {
return append((CharSequence) obj);
}
return append(obj.toString());
}
/**
* Appends a CharSequence to this string builder. Appending null will call {@link #appendNull()}.
*
* @param seq
* the CharSequence to append
* @return this, to enable chaining
*/
@Override
public TextStringBuilder append(final CharSequence seq) {
if (seq == null) {
return appendNull();
}
if (seq instanceof TextStringBuilder) {
return append((TextStringBuilder) seq);
}
if (seq instanceof StringBuilder) {
return append((StringBuilder) seq);
}
if (seq instanceof StringBuffer) {
return append((StringBuffer) seq);
}
if (seq instanceof CharBuffer) {
return append((CharBuffer) seq);
}
return append(seq.toString());
}
/**
* Appends part of a CharSequence to this string builder. Appending null will call {@link #appendNull()}.
*
* @param seq
* the CharSequence to append
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid
* @return this, to enable chaining
*/
@Override
public TextStringBuilder append(final CharSequence seq, final int startIndex, final int endIndex) {
if (seq == null) {
return appendNull();
}
if (endIndex <= 0) {
throw new StringIndexOutOfBoundsException("endIndex must be valid");
}
if (startIndex >= endIndex) {
throw new StringIndexOutOfBoundsException("endIndex must be greater than startIndex");
}
return append(seq.toString(), startIndex, endIndex - startIndex);
}
/**
* Appends a string to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final String str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a string to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final String str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Calls {@link String#format(String, Object...)} and appends the result.
*
* @param format
* the format string
* @param objs
* the objects to use in the format string
* @return {@code this} to enable chaining
* @see String#format(String, Object...)
*/
public TextStringBuilder append(final String format, final Object... objs) {
return append(String.format(format, objs));
}
/**
* Appends the contents of a char buffer to this string builder. Appending null will call {@link #appendNull()}.
*
* @param buf
* the char buffer to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final CharBuffer buf) {
if (buf == null) {
return appendNull();
}
if (buf.hasArray()) {
final int length = buf.remaining();
final int len = length();
ensureCapacity(len + length);
System.arraycopy(buf.array(), buf.arrayOffset() + buf.position(), buffer, len, length);
size += length;
} else {
append(buf.toString());
}
return this;
}
/**
* Appends the contents of a char buffer to this string builder. Appending null will call {@link #appendNull()}.
*
* @param buf
* the char buffer to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final CharBuffer buf, final int startIndex, final int length) {
if (buf == null) {
return appendNull();
}
if (buf.hasArray()) {
final int totalLength = buf.remaining();
if (startIndex < 0 || startIndex > totalLength) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > totalLength) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
final int len = length();
ensureCapacity(len + length);
System.arraycopy(buf.array(), buf.arrayOffset() + buf.position() + startIndex, buffer, len, length);
size += length;
} else {
append(buf.toString(), startIndex, length);
}
return this;
}
/**
* Appends a string buffer to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string buffer to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final StringBuffer str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a string buffer to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final StringBuffer str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends a StringBuilder to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the StringBuilder to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final StringBuilder str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
str.getChars(0, strLen, buffer, len);
size += strLen;
}
return this;
}
/**
* Appends part of a StringBuilder to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the StringBuilder to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final StringBuilder str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends another string builder to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string builder to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final TextStringBuilder str) {
if (str == null) {
return appendNull();
}
final int strLen = str.length();
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
System.arraycopy(str.buffer, 0, buffer, len, strLen);
size += strLen;
}
return this;
}
/**
* Appends part of a string builder to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final TextStringBuilder str, final int startIndex, final int length) {
if (str == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > str.length()) {
throw new StringIndexOutOfBoundsException("startIndex must be valid");
}
if (length < 0 || startIndex + length > str.length()) {
throw new StringIndexOutOfBoundsException("length must be valid");
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
str.getChars(startIndex, startIndex + length, buffer, len);
size += length;
}
return this;
}
/**
* Appends a char array to the string builder. Appending null will call {@link #appendNull()}.
*
* @param chars
* the char array to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final char[] chars) {
if (chars == null) {
return appendNull();
}
final int strLen = chars.length;
if (strLen > 0) {
final int len = length();
ensureCapacity(len + strLen);
System.arraycopy(chars, 0, buffer, len, strLen);
size += strLen;
}
return this;
}
/**
* Appends a char array to the string builder. Appending null will call {@link #appendNull()}.
*
* @param chars
* the char array to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder append(final char[] chars, final int startIndex, final int length) {
if (chars == null) {
return appendNull();
}
if (startIndex < 0 || startIndex > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid startIndex: " + length);
}
if (length < 0 || startIndex + length > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid length: " + length);
}
if (length > 0) {
final int len = length();
ensureCapacity(len + length);
System.arraycopy(chars, startIndex, buffer, len, length);
size += length;
}
return this;
}
/**
* Appends a boolean value to the string builder.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final boolean value) {
if (value) {
ensureCapacity(size + TRUE_STRING_SIZE);
buffer[size++] = 't';
buffer[size++] = 'r';
buffer[size++] = 'u';
buffer[size++] = 'e';
} else {
ensureCapacity(size + FALSE_STRING_SIZE);
buffer[size++] = 'f';
buffer[size++] = 'a';
buffer[size++] = 'l';
buffer[size++] = 's';
buffer[size++] = 'e';
}
return this;
}
/**
* Appends a char value to the string builder.
*
* @param ch
* the value to append
* @return this, to enable chaining
*/
@Override
public TextStringBuilder append(final char ch) {
final int len = length();
ensureCapacity(len + 1);
buffer[size++] = ch;
return this;
}
/**
* Appends an int value to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final int value) {
return append(String.valueOf(value));
}
/**
* Appends a long value to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final long value) {
return append(String.valueOf(value));
}
/**
* Appends a float value to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final float value) {
return append(String.valueOf(value));
}
/**
* Appends a double value to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder append(final double value) {
return append(String.valueOf(value));
}
// -----------------------------------------------------------------------
/**
* Appends an object followed by a new line to this string builder. Appending null will call {@link #appendNull()}.
*
* @param obj
* the object to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final Object obj) {
return append(obj).appendNewLine();
}
/**
* Appends a string followed by a new line to this string builder. Appending null will call {@link #appendNull()}.
*
* @param str
* the string to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final String str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final String str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Calls {@link String#format(String, Object...)} and appends the result.
*
* @param format
* the format string
* @param objs
* the objects to use in the format string
* @return {@code this} to enable chaining
* @see String#format(String, Object...)
*/
public TextStringBuilder appendln(final String format, final Object... objs) {
return append(format, objs).appendNewLine();
}
/**
* Appends a string buffer followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string buffer to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final StringBuffer str) {
return append(str).appendNewLine();
}
/**
* Appends a string builder followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string builder to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final StringBuilder str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string builder followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string builder to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final StringBuilder str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends part of a string buffer followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final StringBuffer str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends another string builder followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string builder to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final TextStringBuilder str) {
return append(str).appendNewLine();
}
/**
* Appends part of a string builder followed by a new line to this string builder. Appending null will call
* {@link #appendNull()}.
*
* @param str
* the string to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final TextStringBuilder str, final int startIndex, final int length) {
return append(str, startIndex, length).appendNewLine();
}
/**
* Appends a char array followed by a new line to the string builder. Appending null will call
* {@link #appendNull()}.
*
* @param chars
* the char array to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final char[] chars) {
return append(chars).appendNewLine();
}
/**
* Appends a char array followed by a new line to the string builder. Appending null will call
* {@link #appendNull()}.
*
* @param chars
* the char array to append
* @param startIndex
* the start index, inclusive, must be valid
* @param length
* the length to append, must be valid
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final char[] chars, final int startIndex, final int length) {
return append(chars, startIndex, length).appendNewLine();
}
/**
* Appends a boolean value followed by a new line to the string builder.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final boolean value) {
return append(value).appendNewLine();
}
/**
* Appends a char value followed by a new line to the string builder.
*
* @param ch
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final char ch) {
return append(ch).appendNewLine();
}
/**
* Appends an int value followed by a new line to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final int value) {
return append(value).appendNewLine();
}
/**
* Appends a long value followed by a new line to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final long value) {
return append(value).appendNewLine();
}
/**
* Appends a float value followed by a new line to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final float value) {
return append(value).appendNewLine();
}
/**
* Appends a double value followed by a new line to the string builder using String.valueOf.
*
* @param value
* the value to append
* @return this, to enable chaining
*/
public TextStringBuilder appendln(final double value) {
return append(value).appendNewLine();
}
// -----------------------------------------------------------------------
/**
* Appends each item in an array to the builder without any separators. Appending a null array will have no effect.
* Each object is appended using {@link #append(Object)}.
*
* @param
* for (Iterator it = list.iterator(); it.hasNext();) {
* appendSeparator(",");
* append(it.next());
* }
*
*
* Note that for this simple example, you should use {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator
* the separator to use, null means no separator
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final String separator) {
return appendSeparator(separator, null);
}
/**
* Appends one of both separators to the StrBuilder. If the builder is currently empty it will append the
* defaultIfEmpty-separator Otherwise it will append the standard-separator
*
* Appending a null separator will have no effect. The separator is appended using {@link #append(String)}.
*
* StrBuilder whereClause = new StrBuilder();
* if(searchCommand.getPriority() != null) {
* whereClause.appendSeparator(" and", " where");
* whereClause.append(" priority = ?")
* }
* if(searchCommand.getComponent() != null) {
* whereClause.appendSeparator(" and", " where");
* whereClause.append(" component = ?")
* }
* selectClause.append(whereClause)
*
*
* @param standard
* the separator if builder is not empty, null means no separator
* @param defaultIfEmpty
* the separator if builder is empty, null means no separator
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final String standard, final String defaultIfEmpty) {
final String str = isEmpty() ? defaultIfEmpty : standard;
if (str != null) {
append(str);
}
return this;
}
/**
* Appends a separator if the builder is currently non-empty. The separator is appended using {@link #append(char)}.
*
* for (Iterator it = list.iterator(); it.hasNext();) {
* appendSeparator(',');
* append(it.next());
* }
*
*
* Note that for this simple example, you should use {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator
* the separator to use
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final char separator) {
if (size() > 0) {
append(separator);
}
return this;
}
/**
* Append one of both separators to the builder If the builder is currently empty it will append the
* defaultIfEmpty-separator Otherwise it will append the standard-separator
*
* The separator is appended using {@link #append(char)}.
*
* @param standard
* the separator if builder is not empty
* @param defaultIfEmpty
* the separator if builder is empty
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final char standard, final char defaultIfEmpty) {
if (size() > 0) {
append(standard);
} else {
append(defaultIfEmpty);
}
return this;
}
/**
* Appends a separator to the builder if the loop index is greater than zero. Appending a null separator will have
* no effect. The separator is appended using {@link #append(String)}.
*
* for (int i = 0; i < list.size(); i++) {
* appendSeparator(",", i);
* append(list.get(i));
* }
*
*
* Note that for this simple example, you should use {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator
* the separator to use, null means no separator
* @param loopIndex
* the loop index
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final String separator, final int loopIndex) {
if (separator != null && loopIndex > 0) {
append(separator);
}
return this;
}
/**
* Appends a separator to the builder if the loop index is greater than zero. The separator is appended using
* {@link #append(char)}.
*
* for (int i = 0; i < list.size(); i++) {
* appendSeparator(",", i);
* append(list.get(i));
* }
*
*
* Note that for this simple example, you should use {@link #appendWithSeparators(Iterable, String)}.
*
* @param separator
* the separator to use
* @param loopIndex
* the loop index
* @return this, to enable chaining
*/
public TextStringBuilder appendSeparator(final char separator, final int loopIndex) {
if (loopIndex > 0) {
append(separator);
}
return this;
}
// -----------------------------------------------------------------------
/**
* Appends the pad character to the builder the specified number of times.
*
* @param length
* the length to append, negative means no append
* @param padChar
* the character to append
* @return this, to enable chaining
*/
public TextStringBuilder appendPadding(final int length, final char padChar) {
if (length >= 0) {
ensureCapacity(size + length);
for (int i = 0; i < length; i++) {
buffer[size++] = padChar;
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Appends an object to the builder padding on the left to a fixed width. The toString of the object is
* used. If the object is larger than the length, the left hand side is lost. If the object is null, the null text
* value is used.
*
* @param obj
* the object to append, null uses null text
* @param width
* the fixed field width, zero or negative has no effect
* @param padChar
* the pad character to use
* @return this, to enable chaining
*/
public TextStringBuilder appendFixedWidthPadLeft(final Object obj, final int width, final char padChar) {
if (width > 0) {
ensureCapacity(size + width);
String str = obj == null ? getNullText() : obj.toString();
if (str == null) {
str = "";
}
final int strLen = str.length();
if (strLen >= width) {
str.getChars(strLen - width, strLen, buffer, size);
} else {
final int padLen = width - strLen;
for (int i = 0; i < padLen; i++) {
buffer[size + i] = padChar;
}
str.getChars(0, strLen, buffer, size + padLen);
}
size += width;
}
return this;
}
/**
* Appends an object to the builder padding on the left to a fixed width. The String.valueOf of the
* int value is used. If the formatted value is larger than the length, the left hand side is lost.
*
* @param value
* the value to append
* @param width
* the fixed field width, zero or negative has no effect
* @param padChar
* the pad character to use
* @return this, to enable chaining
*/
public TextStringBuilder appendFixedWidthPadLeft(final int value, final int width, final char padChar) {
return appendFixedWidthPadLeft(String.valueOf(value), width, padChar);
}
/**
* Appends an object to the builder padding on the right to a fixed length. The toString of the object
* is used. If the object is larger than the length, the right hand side is lost. If the object is null, null text
* value is used.
*
* @param obj
* the object to append, null uses null text
* @param width
* the fixed field width, zero or negative has no effect
* @param padChar
* the pad character to use
* @return this, to enable chaining
*/
public TextStringBuilder appendFixedWidthPadRight(final Object obj, final int width, final char padChar) {
if (width > 0) {
ensureCapacity(size + width);
String str = obj == null ? getNullText() : obj.toString();
if (str == null) {
str = "";
}
final int strLen = str.length();
if (strLen >= width) {
str.getChars(0, width, buffer, size);
} else {
final int padLen = width - strLen;
str.getChars(0, strLen, buffer, size);
for (int i = 0; i < padLen; i++) {
buffer[size + strLen + i] = padChar;
}
}
size += width;
}
return this;
}
/**
* Appends an object to the builder padding on the right to a fixed length. The String.valueOf of the
* int value is used. If the object is larger than the length, the right hand side is lost.
*
* @param value
* the value to append
* @param width
* the fixed field width, zero or negative has no effect
* @param padChar
* the pad character to use
* @return this, to enable chaining
*/
public TextStringBuilder appendFixedWidthPadRight(final int value, final int width, final char padChar) {
return appendFixedWidthPadRight(String.valueOf(value), width, padChar);
}
// -----------------------------------------------------------------------
/**
* Inserts the string representation of an object into this builder. Inserting null will use the stored null text
* value.
*
* @param index
* the index to add at, must be valid
* @param obj
* the object to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final Object obj) {
if (obj == null) {
return insert(index, nullText);
}
return insert(index, obj.toString());
}
/**
* Inserts the string into this builder. Inserting null will use the stored null text value.
*
* @param index
* the index to add at, must be valid
* @param str
* the string to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, String str) {
validateIndex(index);
if (str == null) {
str = nullText;
}
if (str != null) {
final int strLen = str.length();
if (strLen > 0) {
final int newSize = size + strLen;
ensureCapacity(newSize);
System.arraycopy(buffer, index, buffer, index + strLen, size - index);
size = newSize;
str.getChars(0, strLen, buffer, index);
}
}
return this;
}
/**
* Inserts the character array into this builder. Inserting null will use the stored null text value.
*
* @param index
* the index to add at, must be valid
* @param chars
* the char array to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final char[] chars) {
validateIndex(index);
if (chars == null) {
return insert(index, nullText);
}
final int len = chars.length;
if (len > 0) {
ensureCapacity(size + len);
System.arraycopy(buffer, index, buffer, index + len, size - index);
System.arraycopy(chars, 0, buffer, index, len);
size += len;
}
return this;
}
/**
* Inserts part of the character array into this builder. Inserting null will use the stored null text value.
*
* @param index
* the index to add at, must be valid
* @param chars
* the char array to insert
* @param offset
* the offset into the character array to start at, must be valid
* @param length
* the length of the character array part to copy, must be positive
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if any index is invalid
*/
public TextStringBuilder insert(final int index, final char[] chars, final int offset, final int length) {
validateIndex(index);
if (chars == null) {
return insert(index, nullText);
}
if (offset < 0 || offset > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid offset: " + offset);
}
if (length < 0 || offset + length > chars.length) {
throw new StringIndexOutOfBoundsException("Invalid length: " + length);
}
if (length > 0) {
ensureCapacity(size + length);
System.arraycopy(buffer, index, buffer, index + length, size - index);
System.arraycopy(chars, offset, buffer, index, length);
size += length;
}
return this;
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(int index, final boolean value) {
validateIndex(index);
if (value) {
ensureCapacity(size + TRUE_STRING_SIZE);
System.arraycopy(buffer, index, buffer, index + TRUE_STRING_SIZE, size - index);
buffer[index++] = 't';
buffer[index++] = 'r';
buffer[index++] = 'u';
buffer[index] = 'e';
size += TRUE_STRING_SIZE;
} else {
ensureCapacity(size + FALSE_STRING_SIZE);
System.arraycopy(buffer, index, buffer, index + FALSE_STRING_SIZE, size - index);
buffer[index++] = 'f';
buffer[index++] = 'a';
buffer[index++] = 'l';
buffer[index++] = 's';
buffer[index] = 'e';
size += FALSE_STRING_SIZE;
}
return this;
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final char value) {
validateIndex(index);
ensureCapacity(size + 1);
System.arraycopy(buffer, index, buffer, index + 1, size - index);
buffer[index] = value;
size++;
return this;
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final int value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final long value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final float value) {
return insert(index, String.valueOf(value));
}
/**
* Inserts the value into this builder.
*
* @param index
* the index to add at, must be valid
* @param value
* the value to insert
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder insert(final int index, final double value) {
return insert(index, String.valueOf(value));
}
// -----------------------------------------------------------------------
/**
* Internal method to delete a range without validation.
*
* @param startIndex
* the start index, must be valid
* @param endIndex
* the end index (exclusive), must be valid
* @param len
* the length, must be valid
* @throws IndexOutOfBoundsException
* if any index is invalid
*/
private void deleteImpl(final int startIndex, final int endIndex, final int len) {
System.arraycopy(buffer, endIndex, buffer, startIndex, size - endIndex);
size -= len;
}
/**
* Deletes the characters between the two specified indices.
*
* @param startIndex
* the start index, inclusive, must be valid
* @param endIndex
* the end index, exclusive, must be valid except that if too large it is treated as end of string
* @return this, to enable chaining
* @throws IndexOutOfBoundsException
* if the index is invalid
*/
public TextStringBuilder delete(final int startIndex, int endIndex) {
endIndex = validateRange(startIndex, endIndex);
final int len = endIndex - startIndex;
if (len > 0) {
deleteImpl(startIndex, endIndex, len);
}
return this;
}
// -----------------------------------------------------------------------
/**
* Deletes the character wherever it occurs in the builder.
*
* @param ch
* the character to delete
* @return this, to enable chaining
*/
public TextStringBuilder deleteAll(final char ch) {
for (int i = 0; i < size; i++) {
if (buffer[i] == ch) {
final int start = i;
while (++i < size) {
if (buffer[i] != ch) {
break;
}
}
final int len = i - start;
deleteImpl(start, i, len);
i -= len;
}
}
return this;
}
/**
* Deletes the character wherever it occurs in the builder.
*
* @param ch
* the character to delete
* @return this, to enable chaining
*/
public TextStringBuilder deleteFirst(final char ch) {
for (int i = 0; i < size; i++) {
if (buffer[i] == ch) {
deleteImpl(i, i + 1, 1);
break;
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Deletes the string wherever it occurs in the builder.
*
* @param str
* the string to delete, null causes no action
* @return this, to enable chaining
*/
public TextStringBuilder deleteAll(final String str) {
final int len = str == null ? 0 : str.length();
if (len > 0) {
int index = indexOf(str, 0);
while (index >= 0) {
deleteImpl(index, index + len, len);
index = indexOf(str, index);
}
}
return this;
}
/**
* Deletes the string wherever it occurs in the builder.
*
* @param str
* the string to delete, null causes no action
* @return this, to enable chaining
*/
public TextStringBuilder deleteFirst(final String str) {
final int len = str == null ? 0 : str.length();
if (len > 0) {
final int index = indexOf(str, 0);
if (index >= 0) {
deleteImpl(index, index + len, len);
}
}
return this;
}
// -----------------------------------------------------------------------
/**
* Deletes all parts of the builder that the matcher matches.
* length characters from the builder. If this many characters are not
* available, the whole builder is returned. Thus the returned string may be shorter than the length requested.
*
* @param length
* the number of characters to extract, negative returns empty string
* @return The new string
*/
public String leftString(final int length) {
if (length <= 0) {
return "";
} else if (length >= size) {
return new String(buffer, 0, size);
} else {
return new String(buffer, 0, length);
}
}
/**
* Extracts the rightmost characters from the string builder without throwing an exception.
* length characters from the builder. If this many characters are not
* available, the whole builder is returned. Thus the returned string may be shorter than the length requested.
*
* @param length
* the number of characters to extract, negative returns empty string
* @return The new string
*/
public String rightString(final int length) {
if (length <= 0) {
return "";
} else if (length >= size) {
return new String(buffer, 0, size);
} else {
return new String(buffer, size - length, length);
}
}
/**
* Extracts some characters from the middle of the string builder without throwing an exception.
* length characters from the builder at the specified index. If the index is
* negative it is treated as zero. If the index is greater than the builder size, it is treated as the builder size.
* If the length is negative, the empty string is returned. If insufficient characters are available in the builder,
* as much as possible is returned. Thus the returned string may be shorter than the length requested.
*
* @param index
* the index to start at, negative means zero
* @param length
* the number of characters to extract, negative returns empty string
* @return The new string
*/
public String midString(int index, final int length) {
if (index < 0) {
index = 0;
}
if (length <= 0 || index >= size) {
return "";
}
if (size <= index + length) {
return new String(buffer, index, size - index);
}
return new String(buffer, index, length);
}
// -----------------------------------------------------------------------
/**
* Checks if the string builder contains the specified char.
*
* @param ch
* the character to find
* @return true if the builder contains the character
*/
public boolean contains(final char ch) {
final char[] thisBuf = buffer;
for (int i = 0; i < this.size; i++) {
if (thisBuf[i] == ch) {
return true;
}
}
return false;
}
/**
* Checks if the string builder contains the specified string.
*
* @param str
* the string to find
* @return true if the builder contains the string
*/
public boolean contains(final String str) {
return indexOf(str, 0) >= 0;
}
/**
* Checks if the string builder contains a string matched using the specified matcher.
*
* StrBuilder b = new StrBuilder();
* b.append("a b ");
* StrTokenizer t = b.asTokenizer();
* String[] tokens1 = t.getTokenArray(); // returns a,b
* b.append("c d ");
* String[] tokens2 = t.getTokenArray(); // returns a,b (c and d ignored)
* t.reset(); // reset causes builder changes to be picked up
* String[] tokens3 = t.getTokenArray(); // returns a,b,c,d
*
*
* In addition to simply intermixing appends and tokenization, you can also call the set methods on the tokenizer to
* alter how it tokenizes. Just remember to call reset when you want to pickup builder changes.
* StrBuilder, populate it with data, call asReader, and then read
* away.
* StrBuilder, call asWriter, and populate away. The data is
* available at any time using the methods of the StrBuilder.
* StrBuilder to the provided {@link Appendable}.
* null input gracefully. An exception will not be thrown for a
* null input. Each method documents its behavior in more detail.
* WordUtils instances should NOT be constructed in
* standard programming. Instead, the class should be used as
* WordUtils.wrap("foo bar", 20);.' '.
*
*
* (assuming that '\n' is the systems line separator)
*
* @param str the String to be word wrapped, may be null
* @param wrapLength the column to wrap the words at, less than 1 is treated as 1
* @return a line with newlines inserted,
*
* input
* wrapLength
* result
*
*
* null
* *
* null
*
*
* ""
* *
* ""
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* "Here is one line of\ntext that is going\nto be wrapped after\n20 columns."
*
*
* "Click here to jump to the commons website - https://commons.apache.org"
* 20
* "Click here to jump\nto the commons\nwebsite -\nhttps://commons.apache.org"
*
*
* "Click here, https://commons.apache.org, to jump to the commons website"
* 20
* "Click here,\nhttps://commons.apache.org,\nto jump to the\ncommons website"
* null if null input
*/
public static String wrap(final String str, final int wrapLength) {
return wrap(str, wrapLength, null, false);
}
/**
* ' '.
*
*
* @param str the String to be word wrapped, may be null
* @param wrapLength the column to wrap the words at, less than 1 is treated as 1
* @param newLineStr the string to insert for a new line,
*
*
* input
* wrapLength
* newLineString
* wrapLongWords
* result
*
*
* null
* *
* *
* true/false
* null
*
*
* ""
* *
* *
* true/false
* ""
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* "\n"
* true/false
* "Here is one line of\ntext that is going\nto be wrapped after\n20 columns."
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* "<br />"
* true/false
* "Here is one line of<br />text that is going<
* br />to be wrapped after<br />20 columns."
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* null
* true/false
* "Here is one line of" + systemNewLine + "text that is going"
* + systemNewLine + "to be wrapped after" + systemNewLine + "20 columns."
*
*
* "Click here to jump to the commons website - https://commons.apache.org"
* 20
* "\n"
* false
* "Click here to jump\nto the commons\nwebsite -\nhttps://commons.apache.org"
*
*
* "Click here to jump to the commons website - https://commons.apache.org"
* 20
* "\n"
* true
* "Click here to jump\nto the commons\nwebsite -\nhttp://commons.apach\ne.org"
* null uses the system property line separator
* @param wrapLongWords true if long words (such as URLs) should be wrapped
* @return a line with newlines inserted, null if null input
*/
public static String wrap(final String str,
final int wrapLength,
final String newLineStr,
final boolean wrapLongWords) {
return wrap(str, wrapLength, newLineStr, wrapLongWords, " ");
}
/**
* wrapOn.
*
* @param str the String to be word wrapped, may be null
* @param wrapLength the column to wrap the words at, less than 1 is treated as 1
* @param newLineStr the string to insert for a new line,
*
*
* input
* wrapLength
* newLineString
* wrapLongWords
* wrapOn
* result
*
*
* null
* *
* *
* true/false
* *
* null
*
*
* ""
* *
* *
* true/false
* *
* ""
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* "\n"
* true/false
* " "
* "Here is one line of\ntext that is going\nto be wrapped after\n20 columns."
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* "<br />"
* true/false
* " "
* "Here is one line of<br />text that is going<br />
* to be wrapped after<br />20 columns."
*
*
* "Here is one line of text that is going to be wrapped after 20 columns."
* 20
* null
* true/false
* " "
* "Here is one line of" + systemNewLine + "text that is going"
* + systemNewLine + "to be wrapped after" + systemNewLine + "20 columns."
*
*
* "Click here to jump to the commons website - https://commons.apache.org"
* 20
* "\n"
* false
* " "
* "Click here to jump\nto the commons\nwebsite -\nhttps://commons.apache.org"
*
*
* "Click here to jump to the commons website - https://commons.apache.org"
* 20
* "\n"
* true
* " "
* "Click here to jump\nto the commons\nwebsite -\nhttp://commons.apach\ne.org"
*
*
* "flammable/inflammable"
* 20
* "\n"
* true
* "/"
* "flammable\ninflammable"
* null uses the system property line separator
* @param wrapLongWords true if long words (such as URLs) should be wrapped
* @param wrapOn regex expression to be used as a breakable characters,
* if blank string is provided a space character will be used
* @return a line with newlines inserted, null if null input
*/
public static String wrap(final String str,
int wrapLength,
String newLineStr,
final boolean wrapLongWords,
String wrapOn) {
if (str == null) {
return null;
}
if (newLineStr == null) {
newLineStr = System.lineSeparator();
}
if (wrapLength < 1) {
wrapLength = 1;
}
if (StringUtils.isBlank(wrapOn)) {
wrapOn = " ";
}
final Pattern patternToWrapOn = Pattern.compile(wrapOn);
final int inputLineLength = str.length();
int offset = 0;
final StringBuilder wrappedLine = new StringBuilder(inputLineLength + 32);
int matcherSize = -1;
while (offset < inputLineLength) {
int spaceToWrapAt = -1;
Matcher matcher = patternToWrapOn.matcher(str.substring(offset,
Math.min((int) Math.min(Integer.MAX_VALUE, offset + wrapLength + 1L), inputLineLength)));
if (matcher.find()) {
if (matcher.start() == 0) {
matcherSize = matcher.end() - matcher.start();
if (matcherSize != 0) {
offset += matcher.end();
continue;
}
offset += 1;
}
spaceToWrapAt = matcher.start() + offset;
}
// only last line without leading spaces is left
if (inputLineLength - offset <= wrapLength) {
break;
}
while (matcher.find()) {
spaceToWrapAt = matcher.start() + offset;
}
if (spaceToWrapAt >= offset) {
// normal case
wrappedLine.append(str, offset, spaceToWrapAt);
wrappedLine.append(newLineStr);
offset = spaceToWrapAt + 1;
} else {
// really long word or URL
if (wrapLongWords) {
if (matcherSize == 0) {
offset--;
}
// wrap really long word one line at a time
wrappedLine.append(str, offset, wrapLength + offset);
wrappedLine.append(newLineStr);
offset += wrapLength;
matcherSize = -1;
} else {
// do not wrap really long word, just extend beyond limit
matcher = patternToWrapOn.matcher(str.substring(offset + wrapLength));
if (matcher.find()) {
matcherSize = matcher.end() - matcher.start();
spaceToWrapAt = matcher.start() + offset + wrapLength;
}
if (spaceToWrapAt >= 0) {
if (matcherSize == 0 && offset != 0) {
offset--;
}
wrappedLine.append(str, offset, spaceToWrapAt);
wrappedLine.append(newLineStr);
offset = spaceToWrapAt + 1;
} else {
if (matcherSize == 0 && offset != 0) {
offset--;
}
wrappedLine.append(str, offset, str.length());
offset = inputLineLength;
matcherSize = -1;
}
}
}
}
if (matcherSize == 0 && offset < inputLineLength) {
offset--;
}
// Whatever is left in line is short enough to just pass through
wrappedLine.append(str, offset, str.length());
return wrappedLine.toString();
}
// Capitalizing
//-----------------------------------------------------------------------
/**
* null input String returns null.
* Capitalization uses the Unicode title case, normally equivalent to
* upper case.
* WordUtils.capitalize(null) = null
* WordUtils.capitalize("") = ""
* WordUtils.capitalize("i am FINE") = "I Am FINE"
*
*
* @param str the String to capitalize, may be null
* @return capitalized String, null if null String input
* @see #uncapitalize(String)
* @see #capitalizeFully(String)
*/
public static String capitalize(final String str) {
return capitalize(str, null);
}
/**
* null input String returns null.
* Capitalization uses the Unicode title case, normally equivalent to
* upper case.
* WordUtils.capitalize(null, *) = null
* WordUtils.capitalize("", *) = ""
* WordUtils.capitalize(*, new char[0]) = *
* WordUtils.capitalize("i am fine", null) = "I Am Fine"
* WordUtils.capitalize("i aM.fine", {'.'}) = "I aM.Fine"
* WordUtils.capitalize("i am fine", new char[]{}) = "I am fine"
*
*
* @param str the String to capitalize, may be null
* @param delimiters set of characters to determine capitalization, null means whitespace
* @return capitalized String, null if null String input
* @see #uncapitalize(String)
* @see #capitalizeFully(String)
*/
public static String capitalize(final String str, final char... delimiters) {
if (StringUtils.isEmpty(str)) {
return str;
}
final Setnull input String returns null.
* Capitalization uses the Unicode title case, normally equivalent to
* upper case.
* WordUtils.capitalizeFully(null) = null
* WordUtils.capitalizeFully("") = ""
* WordUtils.capitalizeFully("i am FINE") = "I Am Fine"
*
*
* @param str the String to capitalize, may be null
* @return capitalized String, null if null String input
*/
public static String capitalizeFully(final String str) {
return capitalizeFully(str, null);
}
/**
* null input String returns null.
* Capitalization uses the Unicode title case, normally equivalent to
* upper case.
* WordUtils.capitalizeFully(null, *) = null
* WordUtils.capitalizeFully("", *) = ""
* WordUtils.capitalizeFully(*, null) = *
* WordUtils.capitalizeFully(*, new char[0]) = *
* WordUtils.capitalizeFully("i aM.fine", {'.'}) = "I am.Fine"
*
*
* @param str the String to capitalize, may be null
* @param delimiters set of characters to determine capitalization, null means whitespace
* @return capitalized String, null if null String input
*/
public static String capitalizeFully(String str, final char... delimiters) {
if (StringUtils.isEmpty(str)) {
return str;
}
str = str.toLowerCase();
return capitalize(str, delimiters);
}
//-----------------------------------------------------------------------
/**
* null input String returns null.
* WordUtils.uncapitalize(null) = null
* WordUtils.uncapitalize("") = ""
* WordUtils.uncapitalize("I Am FINE") = "i am fINE"
*
*
* @param str the String to uncapitalize, may be null
* @return uncapitalized String, null if null String input
* @see #capitalize(String)
*/
public static String uncapitalize(final String str) {
return uncapitalize(str, null);
}
/**
* null input String returns null.
* WordUtils.uncapitalize(null, *) = null
* WordUtils.uncapitalize("", *) = ""
* WordUtils.uncapitalize(*, null) = *
* WordUtils.uncapitalize(*, new char[0]) = *
* WordUtils.uncapitalize("I AM.FINE", {'.'}) = "i AM.fINE"
* WordUtils.uncapitalize("I am fine", new char[]{}) = "i am fine"
*
*
* @param str the String to uncapitalize, may be null
* @param delimiters set of characters to determine uncapitalization, null means whitespace
* @return uncapitalized String, null if null String input
* @see #capitalize(String)
*/
public static String uncapitalize(final String str, final char... delimiters) {
if (StringUtils.isEmpty(str)) {
return str;
}
final Set
*
*
* null input String returns null.
* StringUtils.swapCase(null) = null
* StringUtils.swapCase("") = ""
* StringUtils.swapCase("The dog has a BONE") = "tHE DOG HAS A bone"
*
*
* @param str the String to swap case, may be null
* @return The changed String, null if null String input
*/
public static String swapCase(final String str) {
if (StringUtils.isEmpty(str)) {
return str;
}
final int strLen = str.length();
final int[] newCodePoints = new int[strLen];
int outOffset = 0;
boolean whitespace = true;
for (int index = 0; index < strLen;) {
final int oldCodepoint = str.codePointAt(index);
final int newCodePoint;
if (Character.isUpperCase(oldCodepoint) || Character.isTitleCase(oldCodepoint)) {
newCodePoint = Character.toLowerCase(oldCodepoint);
whitespace = false;
} else if (Character.isLowerCase(oldCodepoint)) {
if (whitespace) {
newCodePoint = Character.toTitleCase(oldCodepoint);
whitespace = false;
} else {
newCodePoint = Character.toUpperCase(oldCodepoint);
}
} else {
whitespace = Character.isWhitespace(oldCodepoint);
newCodePoint = oldCodepoint;
}
newCodePoints[outOffset++] = newCodePoint;
index += Character.charCount(newCodePoint);
}
return new String(newCodePoints, 0, outOffset);
}
//-----------------------------------------------------------------------
/**
* null input String returns null.
* WordUtils.initials(null) = null
* WordUtils.initials("") = ""
* WordUtils.initials("Ben John Lee") = "BJL"
* WordUtils.initials("Ben J.Lee") = "BJ"
*
*
* @param str the String to get initials from, may be null
* @return String of initial letters, null if null String input
* @see #initials(String,char[])
*/
public static String initials(final String str) {
return initials(str, null);
}
/**
* null input String returns null.
* An empty delimiter array returns an empty String.
* WordUtils.initials(null, *) = null
* WordUtils.initials("", *) = ""
* WordUtils.initials("Ben John Lee", null) = "BJL"
* WordUtils.initials("Ben J.Lee", null) = "BJ"
* WordUtils.initials("Ben J.Lee", [' ','.']) = "BJL"
* WordUtils.initials(*, new char[0]) = ""
*
*
* @param str the String to get initials from, may be null
* @param delimiters set of characters to determine words, null means whitespace
* @return String of initial characters, null if null String input
* @see #initials(String)
*/
public static String initials(final String str, final char... delimiters) {
if (StringUtils.isEmpty(str)) {
return str;
}
if (delimiters != null && delimiters.length == 0) {
return "";
}
final Set
* WordUtils.containsAllWords(null, *) = false
* WordUtils.containsAllWords("", *) = false
* WordUtils.containsAllWords(*, null) = false
* WordUtils.containsAllWords(*, []) = false
* WordUtils.containsAllWords("abcd", "ab", "cd") = false
* WordUtils.containsAllWords("abc def", "def", "abc") = true
*
*
* @param word The CharSequence to check, may be null
* @param words The array of String words to search for, may be null
* @return {@code true} if all search words are found, {@code false} otherwise
*/
public static boolean containsAllWords(final CharSequence word, final CharSequence... words) {
if (StringUtils.isEmpty(word) || ArrayUtils.isEmpty(words)) {
return false;
}
for (final CharSequence w : words) {
if (StringUtils.isBlank(w)) {
return false;
}
final Pattern p = Pattern.compile(".*\\b" + w + "\\b.*");
if (!p.matcher(word).matches()) {
return false;
}
}
return true;
}
//-----------------------------------------------------------------------
/**
* Is the character a delimiter.
*
* @param ch the character to check
* @param delimiters the delimiters
* @return true if it is a delimiter
* @deprecated as of 1.2 and will be removed in 2.0
*/
@Deprecated
public static boolean isDelimiter(final char ch, final char[] delimiters) {
if (delimiters == null) {
return Character.isWhitespace(ch);
}
for (final char delimiter : delimiters) {
if (ch == delimiter) {
return true;
}
}
return false;
}
//-----------------------------------------------------------------------
/**
* Is the codePoint a delimiter.
*
* @param codePoint the codePint to check
* @param delimiters the delimiters
* @return true if it is a delimiter
* @deprecated as of 1.2 and will be removed in 2.0
*/
@Deprecated
public static boolean isDelimiter(final int codePoint, final char[] delimiters) {
if (delimiters == null) {
return Character.isWhitespace(codePoint);
}
for (int index = 0; index < delimiters.length; index++) {
final int delimiterCodePoint = Character.codePointAt(delimiters, index);
if (delimiterCodePoint == codePoint) {
return true;
}
}
return false;
}
//-----------------------------------------------------------------------
/**
* Abbreviates the words nicely.
*
* This method searches for the first space after the lower limit and abbreviates
* the String there. It will also append any String passed as a parameter
* to the end of the String. The upper limit can be specified to forcibly
* abbreviate a String.
*
* @param str the string to be abbreviated. If null is passed, null is returned.
* If the empty String is passed, the empty string is returned.
* @param lower the lower limit.
* @param upper the upper limit; specify -1 if no limit is desired.
* If the upper limit is lower than the lower limit, it will be
* adjusted to be the same as the lower limit.
* @param appendToEnd String to be appended to the end of the abbreviated string.
* This is appended ONLY if the string was indeed abbreviated.
* The append does not count towards the lower or upper limits.
* @return The abbreviated String.
*
*
* WordUtils.abbreviate("Now is the time for all good men", 0, 40, null)); = "Now"
* WordUtils.abbreviate("Now is the time for all good men", 10, 40, null)); = "Now is the"
* WordUtils.abbreviate("Now is the time for all good men", 20, 40, null)); = "Now is the time for all"
* WordUtils.abbreviate("Now is the time for all good men", 0, 40, "")); = "Now"
* WordUtils.abbreviate("Now is the time for all good men", 10, 40, "")); = "Now is the"
* WordUtils.abbreviate("Now is the time for all good men", 20, 40, "")); = "Now is the time for all"
* WordUtils.abbreviate("Now is the time for all good men", 0, 40, " ...")); = "Now ..."
* WordUtils.abbreviate("Now is the time for all good men", 10, 40, " ...")); = "Now is the ..."
* WordUtils.abbreviate("Now is the time for all good men", 20, 40, " ...")); = "Now is the time for all ..."
* WordUtils.abbreviate("Now is the time for all good men", 0, -1, "")); = "Now"
* WordUtils.abbreviate("Now is the time for all good men", 10, -1, "")); = "Now is the"
* WordUtils.abbreviate("Now is the time for all good men", 20, -1, "")); = "Now is the time for all"
* WordUtils.abbreviate("Now is the time for all good men", 50, -1, "")); = "Now is the time for all good men"
* WordUtils.abbreviate("Now is the time for all good men", 1000, -1, "")); = "Now is the time for all good men"
* WordUtils.abbreviate("Now is the time for all good men", 9, -10, null)); = IllegalArgumentException
* WordUtils.abbreviate("Now is the time for all good men", 10, 5, null)); = IllegalArgumentException
*
*/
public static String abbreviate(final String str, int lower, int upper, final String appendToEnd) {
Validate.isTrue(upper >= -1, "upper value cannot be less than -1");
Validate.isTrue(upper >= lower || upper == -1, "upper value is less than lower value");
if (StringUtils.isEmpty(str)) {
return str;
}
// if the lower value is greater than the length of the string,
// set to the length of the string
if (lower > str.length()) {
lower = str.length();
}
// if the upper value is -1 (i.e. no limit) or is greater
// than the length of the string, set to the length of the string
if (upper == -1 || upper > str.length()) {
upper = str.length();
}
final StringBuilder result = new StringBuilder();
final int index = StringUtils.indexOf(str, " ", lower);
if (index == -1) {
result.append(str, 0, upper);
// only if abbreviation has occurred do we append the appendToEnd value
if (upper != str.length()) {
result.append(StringUtils.defaultString(appendToEnd));
}
} else if (index > upper) {
result.append(str, 0, upper);
result.append(StringUtils.defaultString(appendToEnd));
} else {
result.append(str, 0, index);
result.append(StringUtils.defaultString(appendToEnd));
}
return result.toString();
}
// -----------------------------------------------------------------------
/**
*
* import org.apache.commons.text.diff.CommandVisitor;
*
* import java.util.ArrayList;
*
* public class LongestCommonSubSequence implements CommandVisitor {
*
* public LongestCommonSubSequence() {
* a = new ArrayList();
* }
*
* public void visitInsertCommand(Object object) {
* }
*
* public void visitKeepCommand(Object object) {
* a.add(object);
* }
*
* public void visitDeleteCommand(Object object) {
* }
*
* public Object[] getSubSequence() {
* return a.toArray();
* }
*
* private ArrayList a;
*
* }
*
*
* import org.apache.commons.text.diff.CommandVisitor;
*
* import java.util.Arrays;
* import java.util.ArrayList;
* import java.util.Iterator;
*
* public class ShowVisitor implements CommandVisitor {
*
* public ShowVisitor(Object[] sequence1) {
* v = new ArrayList();
* v.addAll(Arrays.asList(sequence1));
* index = 0;
* }
*
* public void visitInsertCommand(Object object) {
* v.insertElementAt(object, index++);
* display("insert", object);
* }
*
* public void visitKeepCommand(Object object) {
* ++index;
* display("keep ", object);
* }
*
* public void visitDeleteCommand(Object object) {
* v.remove(index);
* display("delete", object);
* }
*
* private void display(String commandName, Object object) {
* System.out.println(commandName + " " + object + ": " + this);
* }
*
* public String toString() {
* StringBuffer buffer = new StringBuffer();
* for (Iterator iter = v.iterator(); iter.hasNext();) {
* buffer.append(' ').append(iter.next());
* }
* return buffer.toString();
* }
*
* private ArrayList v;
* private int index;
*
* }
*
*
* @param DeleteCommand accepts a visitor, it calls
* its {@link CommandVisitor#visitDeleteCommand visitDeleteCommand} method.
*
* @param visitor the visitor to be accepted
*/
@Override
public void accept(final CommandVisitorequals an object in the second sequence. It is
* guaranteed that comparison is always performed this way (i.e. the
* equals method of the object from the first sequence is used and
* the object passed as an argument comes from the second sequence) ; this can
* be important if subclassing is used for some elements in the first sequence
* and the equals method is specialized.
* equals
* method is specialized.
*
* @see StringsComparator
* @see EditCommand
* @see CommandVisitor
* @see ReplacementsHandler
*
* @param InsertCommand accepts a visitor,
* it calls its {@link CommandVisitor#visitInsertCommand visitInsertCommand}
* method.
*
* @param visitor the visitor to be accepted
*/
@Override
public void accept(final CommandVisitorequals another objects in
* the second sequence at the right place, the {@link EditScript edit script}
* transforming the first sequence into the second sequence uses an instance of
* this class to represent the keeping of this object. The objects embedded in
* these type of commands always come from the first sequence.
* KeepCommand accepts a visitor, it
* calls its {@link CommandVisitor#visitKeepCommand visitKeepCommand} method.
*
* @param visitor the visitor to be accepted
*/
@Override
public void accept(final CommandVisitorfrom
* sub-sequence into the to sub-sequence.
*
* @param skipped number of tokens skipped since the last call (i.e. number of
* tokens that were in both sequences), this number should be strictly positive
* except on the very first call where it can be zero (if the first object of
* the two sequences are different)
* @param from sub-sequence of objects coming from the first sequence
* @param to sub-sequence of objects coming from the second sequence
*/
void handleReplacement(int skipped, Listo1.equals(o2) where o1 belongs to the first
* sequence and o2 belongs to the second sequence. This can
* be important if subclassing is used for some elements in the first
* sequence and the equals method is specialized.
* equals method is used to compare objects, so any
* object can be put into sequences. Modifications include deleting, inserting
* or keeping one object, starting from the beginning of the first sequence.
* o1.equals(o2) where o1 belongs to the first
* sequence and o2 belongs to the second sequence. This can be
* important if subclassing is used for some elements in the first sequence
* and the equals method is specialized.
* equals method is specialized.
* ch in value.
*
* @param value
* The source string.
* @param ch
* The character to search.
* @return a new string.
*/
protected String substringAfter(final String value, final char ch) {
final int indexOf = value.indexOf(ch);
return indexOf > -1 ? value.substring(indexOf + 1) : EMPTY;
}
/**
* Returns the substring after the first occurrence of ch in value.
*
* @param value
* The source string.
* @param ch
* The character to search.
* @return a new string.
*/
protected String substringAfterLast(final String value, final char ch) {
final int indexOf = value.lastIndexOf(ch);
return indexOf > -1 ? value.substring(indexOf + 1) : EMPTY;
}
/**
* Returns the substring after the first occurrence of str in value.
*
* @param value
* The source string.
* @param str
* The string to search.
* @return a new string.
*/
protected String substringAfter(final String value, final String str) {
final int indexOf = value.indexOf(str);
return indexOf > -1 ? value.substring(indexOf + str.length()) : EMPTY;
}
}
Base64DecoderStringLookup.java 0000664 0000000 0000000 00000003772 13532277265 0034572 0 ustar 00root root 0000000 0000000 commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.nio.charset.StandardCharsets;
import java.util.Base64;
import org.apache.commons.text.StringSubstitutor;
/**
* Decodes Base64 Strings.
*
* StringLookupFactory.INSTANCE.base64DecoderStringLookup().lookup("SGVsbG9Xb3JsZCE=");
*
*
* StringSubstitutor.createInterpolator().replace("... ${base64Decoder:SGVsbG9Xb3JsZCE=} ..."));
*
*
* StringLookupFactory.INSTANCE.base64EncoderStringLookup().lookup("HelloWorld!");
*
*
* StringSubstitutor.createInterpolator().replace("... ${base64Encoder:HelloWorld!} ..."));
*
*
* StringLookupFactory.INSTANCE.constantStringLookup().lookup("java.awt.event.KeyEvent.VK_ESCAPE");
*
*
* StringSubstitutor.createInterpolator().replace("... ${const:java.awt.event.KeyEvent.VK_ESCAPE} ..."));
*
*
* ClassUtils.
*
* @param className the name of the class to be loaded
* @return The corresponding class object
* @throws ClassNotFoundException if the class cannot be loaded
*/
protected Class fetchClass(final String className) throws ClassNotFoundException {
return ClassUtils.getClass(className);
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup/DateStringLookup.java 0000664 0000000 0000000 00000006254 13532277265 0033212 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.Date;
import org.apache.commons.lang3.time.FastDateFormat;
import org.apache.commons.text.StringSubstitutor;
/**
* Formats the current date with the format given in the key in a format compatible with
* {@link java.text.SimpleDateFormat}.
*
* StringLookupFactory.INSTANCE.dateStringLookup().lookup("yyyy-MM-dd");
*
*
* StringSubstitutor.createInterpolator().replace("... ${date:yyyy-MM-dd} ..."));
*
*
*
*
*
* StringLookupFactory.INSTANCE.dnsStringLookup().lookup("address|apache.org");
*
*
* StringSubstitutor.createInterpolator().replace("... ${dns:address|apache.org} ..."));
*
*
* StringLookupFactory.INSTANCE.dateStringLookup().lookup("USER");
*
*
* StringSubstitutor.createInterpolator().replace("... ${env:USER} ..."));
*
* name is null
return key != null ? System.getenv(key) : null;
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup/FileStringLookup.java 0000664 0000000 0000000 00000005556 13532277265 0033220 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.nio.file.Files;
import java.nio.file.Paths;
import org.apache.commons.text.StringSubstitutor;
/**
* Looks up keys from an XML document.
*
* StringLookupFactory.INSTANCE.fileStringLookup().lookup(UTF-8:com/domain/document.properties");
*
*
* StringSubstitutor.createInterpolator().replace("... ${file:UTF-8:com/domain/document.properties} ..."));
*
*
*
*
*
* StringLookupFactory.INSTANCE.javaPlatformStringLookup().lookup("version");
*
*
* StringSubstitutor.createInterpolator().replace("... ${java:version} ..."));
*
* locale key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_LOCALE = "locale";
/** hardware key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_HARDWARE = "hardware";
/** os key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_OS = "os";
/** vm key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_VM = "vm";
/** runtime key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_RUNTIME = "runtime";
/** version key for driving {@link JavaPlatformStringLookup#lookup(String)}. */
private static final String KEY_VERSION = "version";
/**
* Defines the singleton for this class.
*/
static final JavaPlatformStringLookup INSTANCE = new JavaPlatformStringLookup();
/**
* The main method for running the JavaPlatformStringLookup.
*
* @param args the standard java main method parameter which is unused for our running of this class.
*/
public static void main(final String[] args) {
System.out.println(JavaPlatformStringLookup.class);
System.out.printf("%s = %s%n", KEY_VERSION, JavaPlatformStringLookup.INSTANCE.lookup(KEY_VERSION));
System.out.printf("%s = %s%n", KEY_RUNTIME, JavaPlatformStringLookup.INSTANCE.lookup(KEY_RUNTIME));
System.out.printf("%s = %s%n", KEY_VM, JavaPlatformStringLookup.INSTANCE.lookup(KEY_VM));
System.out.printf("%s = %s%n", KEY_OS, JavaPlatformStringLookup.INSTANCE.lookup(KEY_OS));
System.out.printf("%s = %s%n", KEY_HARDWARE, JavaPlatformStringLookup.INSTANCE.lookup(KEY_HARDWARE));
System.out.printf("%s = %s%n", KEY_LOCALE, JavaPlatformStringLookup.INSTANCE.lookup(KEY_LOCALE));
}
/**
* No need to build instances for now.
*/
private JavaPlatformStringLookup() {
// empty
}
/**
* Accessible through the Lookup key {@code hardware}.
*
* @return hardware processor information.
*/
String getHardware() {
return "processors: " + Runtime.getRuntime().availableProcessors() + ", architecture: "
+ getSystemProperty("os.arch") + this.getSystemProperty("-", "sun.arch.data.model")
+ this.getSystemProperty(", instruction sets: ", "sun.cpu.isalist");
}
/**
* Accessible through the Lookup key {@code locale}.
*
* @return system locale and file encoding information.
*/
String getLocale() {
return "default locale: " + Locale.getDefault() + ", platform encoding: " + getSystemProperty("file.encoding");
}
/**
* Accessible through the Lookup key {@code os}.
*
* @return operating system information.
*/
String getOperatingSystem() {
return getSystemProperty("os.name") + " " + getSystemProperty("os.version")
+ getSystemProperty(" ", "sun.os.patch.level") + ", architecture: " + getSystemProperty("os.arch")
+ getSystemProperty("-", "sun.arch.data.model");
}
/**
* Accessible through the Lookup key {@code runtime}.
*
* @return Java Runtime Environment information.
*/
String getRuntime() {
return getSystemProperty("java.runtime.name") + " (build " + getSystemProperty("java.runtime.version")
+ ") from " + getSystemProperty("java.vendor");
}
/**
* Gets the given system property.
*
* @param name a system property name.
* @return a system property value.
*/
private String getSystemProperty(final String name) {
return SystemPropertyStringLookup.INSTANCE.lookup(name);
}
/**
* Gets the given system property.
*
* @param prefix the prefix to use for the result string
* @param name a system property name.
* @return The prefix + a system property value.
*/
private String getSystemProperty(final String prefix, final String name) {
final String value = getSystemProperty(name);
if (StringUtils.isEmpty(value)) {
return StringUtils.EMPTY;
}
return prefix + value;
}
/**
* Accessible through the Lookup key {@code vm}.
*
* @return Java Virtual Machine information.
*/
String getVirtualMachine() {
return getSystemProperty("java.vm.name") + " (build " + getSystemProperty("java.vm.version") + ", "
+ getSystemProperty("java.vm.info") + ")";
}
/**
* Looks up the value of the Java platform key.
*
*
*
* @param key the key to be looked up, may be null
* @return The value of the environment variable.
*/
@Override
public String lookup(final String key) {
if (key == null) {
return null;
}
switch (key) {
case KEY_VERSION:
return "Java version " + getSystemProperty("java.version");
case KEY_RUNTIME:
return getRuntime();
case KEY_VM:
return getVirtualMachine();
case KEY_OS:
return getOperatingSystem();
case KEY_HARDWARE:
return getHardware();
case KEY_LOCALE:
return getLocale();
default:
throw new IllegalArgumentException(key);
}
}
}
LocalHostStringLookup.java 0000664 0000000 0000000 00000004775 13532277265 0034154 0 ustar 00root root 0000000 0000000 commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.net.InetAddress;
import java.net.UnknownHostException;
/**
* Looks up keys related to the local host: host name, canonical host name, host address.
*
*
*
* @since 1.3
*/
final class LocalHostStringLookup extends AbstractStringLookup {
/**
* Defines the singleton for this class.
*/
static final LocalHostStringLookup INSTANCE = new LocalHostStringLookup();
/**
* No need to build instances for now.
*/
private LocalHostStringLookup() {
// empty
}
/**
* Looks up the value of a local host key.
*
* @param key the key to be looked up, may be null.
* @return The value of the environment variable.
*/
@Override
public String lookup(final String key) {
if (key == null) {
return null;
}
try {
switch (key) {
case InetAddressKeys.KEY_NAME:
return InetAddress.getLocalHost().getHostName();
case InetAddressKeys.KEY_CANONICAL_NAME:
return InetAddress.getLocalHost().getCanonicalHostName();
case InetAddressKeys.KEY_ADDRESS:
return InetAddress.getLocalHost().getHostAddress();
default:
throw new IllegalArgumentException(key);
}
} catch (UnknownHostException e) {
return null;
}
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup/MapStringLookup.java 0000664 0000000 0000000 00000005634 13532277265 0033053 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.util.Map;
/**
* A map-based lookup where the request for a lookup is answered with the value for that key.
*
* @param
* StringSubstitutor.createInterpolator().replace("${script:javascript:3 + 4}"));
*
* @since 1.5
*/
final class ScriptStringLookup extends AbstractStringLookup {
/**
* Defines the singleton for this class.
*/
static final ScriptStringLookup INSTANCE = new ScriptStringLookup();
/**
* No need to build instances for now.
*/
private ScriptStringLookup() {
// empty
}
/**
* Looks up the value for the key in the format "DocumentPath:XPath".
*
* Map<String, Object> map = new HashMap<String, Object>();
* map.put("number", new Integer(2));
* assertEquals("2", StringLookupFactory.mapStringLookup(map).lookup("number"));
*
*
* @param key
* the key to look up, may be null
* @return The matching value, null if no match
*/
String lookup(String key);
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/lookup/StringLookupFactory.java 0000664 0000000 0000000 00000073774 13532277265 0033757 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.lookup;
import java.util.Map;
import org.apache.commons.text.StringSubstitutor;
/**
* Provides access to lookups defined in this package.
*
*
*
* @since 1.3
*/
public final class StringLookupFactory {
/**
* Defines the singleton for this class.
*/
public static final StringLookupFactory INSTANCE = new StringLookupFactory();
/**
* Default lookup key for interpolation {@value #KEY_BASE64_DECODER}.
*
* @since 1.6
*/
public static final String KEY_BASE64_DECODER = "base64Decoder";
/**
* Default lookup key for interpolation {@value #KEY_BASE64_ENCODER}.
*
* @since 1.6
*/
public static final String KEY_BASE64_ENCODER = "base64Encoder";
/**
* Default lookup key for interpolation {@value #KEY_CONST}.
*
* @since 1.6
*/
public static final String KEY_CONST = "const";
/**
* Default lookup key for interpolation {@value #KEY_DATE}.
*
* @since 1.6
*/
public static final String KEY_DATE = "date";
/**
* Default lookup key for interpolation {@value #KEY_DNS}.
*
* @since 1.8
*/
public static final String KEY_DNS = "dns";
/**
* Default lookup key for interpolation {@value #KEY_ENV}.
*
* @since 1.6
*/
public static final String KEY_ENV = "env";
/**
* Default lookup key for interpolation {@value #KEY_FILE}.
*
* @since 1.6
*/
public static final String KEY_FILE = "file";
/**
* Default lookup key for interpolation {@value #KEY_JAVA}.
*
* @since 1.6
*/
public static final String KEY_JAVA = "java";
/**
* Default lookup key for interpolation {@value #KEY_LOCALHOST}.
*
* @since 1.6
*/
public static final String KEY_LOCALHOST = "localhost";
/**
* Default lookup key for interpolation {@value #KEY_PROPERTIES}.
*
* @since 1.6
*/
public static final String KEY_PROPERTIES = "properties";
/**
* Default lookup key for interpolation {@value #KEY_RESOURCE_BUNDLE}.
*
* @since 1.6
*/
public static final String KEY_RESOURCE_BUNDLE = "resourceBundle";
/**
* Default lookup key for interpolation {@value #KEY_SCRIPT}.
*
* @since 1.6
*/
public static final String KEY_SCRIPT = "script";
/**
* Default lookup key for interpolation {@value #KEY_SYS}.
*
* @since 1.6
*/
public static final String KEY_SYS = "sys";
/**
* Default lookup key for interpolation {@value #KEY_URL}.
*
* @since 1.6
*/
public static final String KEY_URL = "url";
/**
* Default lookup key for interpolation {@value #KEY_URL_DECODER}.
*
* @since 1.6
*/
public static final String KEY_URL_DECODER = "urlDecoder";
/**
* Default lookup key for interpolation {@value #KEY_URL_ENCODER}.
*
* @since 1.6
*/
public static final String KEY_URL_ENCODER = "urlEncoder";
/**
* Default lookup key for interpolation {@value #KEY_XML}.
*
* @since 1.6
*/
public static final String KEY_XML = "xml";
/**
* Clears any static resources.
*
* @since 1.5
*/
public static void clear() {
ConstantStringLookup.clear();
}
/**
* No need to build instances for now.
*/
private StringLookupFactory() {
// empty
}
/**
* Adds the {@link StringLookupFactory default lookups}.
*
* @param stringLookupMap the map of string lookups.
* @since 1.5
*/
public void addDefaultStringLookups(final Map
*
* Key
* Implementation
* Factory Method
* Since
*
*
* {@value #KEY_BASE64_DECODER}
* {@link Base64DecoderStringLookup}
* {@link #base64DecoderStringLookup()}
* 1.6
*
*
* {@value #KEY_BASE64_ENCODER}
* {@link Base64EncoderStringLookup}
* {@link #base64EncoderStringLookup()}
* 1.6
*
*
* {@value #KEY_CONST}
* {@link ConstantStringLookup}
* {@link #constantStringLookup()}
* 1.5
*
*
* {@value #KEY_DATE}
* {@link DateStringLookup}
* {@link #dateStringLookup()}
* 1.5
*
*
* {@value #KEY_DNS}
* {@link DnsStringLookup}
* {@link #dnsStringLookup()}
* 1.8
*
*
* {@value #KEY_ENV}
* {@link EnvironmentVariableStringLookup}
* {@link #environmentVariableStringLookup()}
* 1.3
*
*
* {@value #KEY_FILE}
* {@link FileStringLookup}
* {@link #fileStringLookup()}
* 1.5
*
*
* {@value #KEY_JAVA}
* {@link JavaPlatformStringLookup}
* {@link #javaPlatformStringLookup()}
* 1.5
*
*
* {@value #KEY_LOCALHOST}
* {@link LocalHostStringLookup}
* {@link #localHostStringLookup()}
* 1.3
*
*
* {@value #KEY_PROPERTIES}
* {@link PropertiesStringLookup}
* {@link #propertiesStringLookup()}
* 1.5
*
*
* {@value #KEY_RESOURCE_BUNDLE}
* {@link ResourceBundleStringLookup}
* {@link #resourceBundleStringLookup()}
* 1.6
*
*
* {@value #KEY_SCRIPT}
* {@link ScriptStringLookup}
* {@link #scriptStringLookup()}
* 1.5
*
*
* {@value #KEY_SYS}
* {@link SystemPropertyStringLookup}
* {@link #systemPropertyStringLookup()}
* 1.3
*
*
* {@value #KEY_URL}
* {@link UrlStringLookup}
* {@link #urlStringLookup()}
* 1.5
*
*
* {@value #KEY_URL_DECODER}
* {@link UrlDecoderStringLookup}
* {@link #urlDecoderStringLookup()}
* 1.5
*
*
* {@value #KEY_URL_ENCODER}
* {@link UrlEncoderStringLookup}
* {@link #urlEncoderStringLookup()}
* 1.5
*
*
* {@value #KEY_XML}
* {@link XmlStringLookup}
* {@link #xmlStringLookup()}
* 1.5
*
* StringLookupFactory.INSTANCE.base64DecoderStringLookup().lookup("SGVsbG9Xb3JsZCE=");
*
*
* StringSubstitutor.createInterpolator().replace("... ${base64Decoder:SGVsbG9Xb3JsZCE=} ..."));
*
*
* StringLookupFactory.INSTANCE.base64EncoderStringLookup().lookup("HelloWorld!");
*
*
* StringSubstitutor.createInterpolator().replace("... ${base64Encoder:HelloWorld!} ..."));
*
*
* StringLookupFactory.INSTANCE.base64DecoderStringLookup().lookup("SGVsbG9Xb3JsZCE=");
*
*
* StringSubstitutor.createInterpolator().replace("... ${base64Decoder:SGVsbG9Xb3JsZCE=} ..."));
*
*
* StringLookupFactory.INSTANCE.constantStringLookup().lookup("java.awt.event.KeyEvent.VK_ESCAPE");
*
*
* StringSubstitutor.createInterpolator().replace("... ${const:java.awt.event.KeyEvent.VK_ESCAPE} ..."));
*
*
* StringLookupFactory.INSTANCE.dateStringLookup().lookup("yyyy-MM-dd");
*
*
* StringSubstitutor.createInterpolator().replace("... ${date:yyyy-MM-dd} ..."));
*
*
* StringLookupFactory.INSTANCE.dateStringLookup().lookup("USER");
*
*
* StringSubstitutor.createInterpolator().replace("... ${env:USER} ..."));
*
*
* StringLookupFactory.INSTANCE.fileStringLookup().lookup("UTF-8:com/domain/document.properties");
*
*
* StringSubstitutor.createInterpolator().replace("... ${file:UTF-8:com/domain/document.properties} ..."));
*
*
* StringLookupFactory.INSTANCE.interpolatorStringLookup().lookup("${sys:os.name}, ${env:USER}");
*
*
* StringSubstitutor.createInterpolator().replace("... ${sys:os.name}, ${env:USER} ..."));
*
*
*
*
*
* StringLookupFactory.INSTANCE.javaPlatformStringLookup().lookup("version");
*
*
* StringSubstitutor.createInterpolator().replace("... ${java:version} ..."));
*
*
*
*
*
* StringLookupFactory.INSTANCE.localHostStringLookup().lookup("canonical-name");
*
*
* StringSubstitutor.createInterpolator().replace("... ${localhost:canonical-name} ..."));
*
*
*
*
*
* StringLookupFactory.INSTANCE.dnsStringLookup().lookup("address|apache.org");
*
*
* StringSubstitutor.createInterpolator().replace("... ${dns:address|apache.org} ..."));
*
*
* StringLookupFactory.INSTANCE.propertiesStringLookup().lookup("com/domain/document.properties::MyKey");
*
*
* StringSubstitutor.createInterpolator().replace("... ${properties:com/domain/document.properties::MyKey} ..."));
*
*
* StringLookupFactory.INSTANCE.resourceBundleStringLookup().lookup("com.domain.messages:MyKey");
*
*
* StringSubstitutor.createInterpolator().replace("... ${resourceBundle:com.domain.messages:MyKey} ..."));
*
*
* StringLookupFactory.INSTANCE.resourceBundleStringLookup("com.domain.messages").lookup("MyKey");
*
*
* StringLookupFactory.INSTANCE.scriptStringLookup().lookup("javascript:3 + 4");
*
*
* StringSubstitutor.createInterpolator().replace("... ${javascript:3 + 4} ..."));
*
*
* StringLookupFactory.INSTANCE.systemPropertyStringLookup().lookup("os.name");
*
*
* StringSubstitutor.createInterpolator().replace("... ${sys:os.name} ..."));
*
*
* StringLookupFactory.INSTANCE.urlDecoderStringLookup().lookup("Hello%20World%21");
*
*
* StringSubstitutor.createInterpolator().replace("... ${urlDecoder:Hello%20World%21} ..."));
*
*
* StringLookupFactory.INSTANCE.urlEncoderStringLookup().lookup("Hello World!");
*
*
* StringSubstitutor.createInterpolator().replace("... ${urlEncoder:Hello World!} ..."));
*
*
* StringLookupFactory.INSTANCE.urlStringLookup().lookup("UTF-8:https://www.apache.org");
*
*
* StringSubstitutor.createInterpolator().replace("... ${url:UTF-8:https://www.apache.org} ..."));
*
*
* StringLookupFactory.INSTANCE.xmlStringLookup().lookup("com/domain/document.xml:/path/to/node");
*
*
* StringSubstitutor.createInterpolator().replace("... ${xml:com/domain/document.xml:/path/to/node} ..."));
*
* NoMatcher.
*/
NoMatcher() {
super();
}
/**
* Always returns false.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index of the active buffer, valid for buffer
* @return The number of matching characters, zero for no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return 0;
}
}
/**
* Class used to define a set of characters for matching purposes.
*/
static final class StringMatcher extends AbstractStringMatcher {
/** The string to match, as a character array. */
private final char[] chars;
/**
* Constructor that creates a matcher from a String.
*
* @param str
* the string to match, must not be null
*/
StringMatcher(final String str) {
super();
chars = str.toCharArray();
}
/**
* Returns whether or not the given text matches the stored string.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index of the active buffer, valid for buffer
* @return The number of matching characters, zero for no match
*/
@Override
public int isMatch(final char[] buffer, int pos, final int bufferStart, final int bufferEnd) {
final int len = chars.length;
if (pos + len > bufferEnd) {
return 0;
}
for (int i = 0; i < chars.length; i++, pos++) {
if (chars[i] != buffer[pos]) {
return 0;
}
}
return len;
}
@Override
public String toString() {
return super.toString() + ' ' + Arrays.toString(chars);
}
}
/**
* Class used to match whitespace as per trim().
*/
static final class TrimMatcher extends AbstractStringMatcher {
/**
* The space character.
*/
private static final int SPACE_INT = 32;
/**
* Constructs a new instance of TrimMatcher.
*/
TrimMatcher() {
super();
}
/**
* Returns whether or not the given character matches.
*
* @param buffer
* the text content to match against, do not change
* @param pos
* the starting position for the match, valid for buffer
* @param bufferStart
* the first active index in the buffer, valid for buffer
* @param bufferEnd
* the end index of the active buffer, valid for buffer
* @return The number of matching characters, zero for no match
*/
@Override
public int isMatch(final char[] buffer, final int pos, final int bufferStart, final int bufferEnd) {
return buffer[pos] <= SPACE_INT ? 1 : 0;
}
}
/**
* Constructor.
*/
protected AbstractStringMatcher() {
super();
}
/**
* Returns the number of matching characters, zero for no match.
* pos represents the current position to be
* checked in the string buffer (a character array which must not be changed). The API guarantees that
* pos is a valid index for buffer.
* pos as well as
* those after.
* pos represents the current position to be
* checked in the string buffer (a character array which must not be changed). The API guarantees that
* pos is a valid index for buffer.
* pos as well as
* those after, so long as no checks exceed the bounds specified.
* X*) over an
* alphabet (X). Note, that a metric
* on a set S is a function d: [S * S] -> [0, INFINITY) such
* that the following hold for x,y,z in
* the set S:
*
*
*
*
* d(x,y) >= 0, non-negativity or separation axiomd(x,y) == 0, if and only if, x == yd(x,y) == d(y,x), symmetry, andd(x,z) <= d(x,y) + d(y,z), the triangle inequalityapply method
* accepts a pair of {@link CharSequence} parameters
* and returns an R type similarity score.
*
* EditDistance<Integer> editDistance = new LevenshteinDistance();
* String target = "Apache";
* EditDistanceFrom<Integer> editDistanceFrom =
* new EditDistanceFrom<Integer>(editDistance, target);
* String mostSimilar = null;
* Integer shortestDistance = null;
*
* for (String test : new String[] { "Appaloosa", "a patchy", "apple" }) {
* Integer distance = editDistanceFrom.apply(test);
* if (shortestDistance == null || distance < shortestDistance) {
* shortestDistance = distance;
* mostSimilar = test;
* }
* }
*
* System.out.println("The string most similar to \"" + target + "\" "
* + "is \"" + mostSimilar + "\" because "
* + "its distance is only " + shortestDistance + ".");
*
*
* @param
* score.fuzzyScore(null, null, null) = IllegalArgumentException
* score.fuzzyScore("", "", Locale.ENGLISH) = 0
* score.fuzzyScore("Workshop", "b", Locale.ENGLISH) = 0
* score.fuzzyScore("Room", "o", Locale.ENGLISH) = 1
* score.fuzzyScore("Workshop", "w", Locale.ENGLISH) = 1
* score.fuzzyScore("Workshop", "ws", Locale.ENGLISH) = 2
* score.fuzzyScore("Workshop", "wo", Locale.ENGLISH) = 4
* score.fuzzyScore("Apache Software Foundation", "asf", Locale.ENGLISH) = 3
*
*
* @param term a full term that should be matched against, must not be null
* @param query the query that will be matched against a term, must not be
* null
* @return result score
* @throws IllegalArgumentException if either CharSequence input is {@code null}
*/
public Integer fuzzyScore(final CharSequence term, final CharSequence query) {
if (term == null || query == null) {
throw new IllegalArgumentException("CharSequences must not be null");
}
// fuzzy logic is case insensitive. We normalize the Strings to lower
// case right from the start. Turning characters to lower case
// via Character.toLowerCase(char) is unfortunately insufficient
// as it does not accept a locale.
final String termLowerCase = term.toString().toLowerCase(locale);
final String queryLowerCase = query.toString().toLowerCase(locale);
// the resulting score
int score = 0;
// the position in the term which will be scanned next for potential
// query character matches
int termIndex = 0;
// index of the previously matched character in the term
int previousMatchingCharacterIndex = Integer.MIN_VALUE;
for (int queryIndex = 0; queryIndex < queryLowerCase.length(); queryIndex++) {
final char queryChar = queryLowerCase.charAt(queryIndex);
boolean termCharacterMatchFound = false;
for (; termIndex < termLowerCase.length()
&& !termCharacterMatchFound; termIndex++) {
final char termChar = termLowerCase.charAt(termIndex);
if (queryChar == termChar) {
// simple character matches result in one point
score++;
// subsequent character matches further improve
// the score.
if (previousMatchingCharacterIndex + 1 == termIndex) {
score += 2;
}
previousMatchingCharacterIndex = termIndex;
// we can leave the nested loop. Every character in the
// query can match at most one character in the term.
termCharacterMatchFound = true;
}
}
}
return score;
}
/**
* Gets the locale.
*
* @return The locale
*/
public Locale getLocale() {
return locale;
}
}
commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/similarity/HammingDistance.java 0000664 0000000 0000000 00000005453 13532277265 0033664 0 ustar 00root root 0000000 0000000 /*
* 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.
*/
package org.apache.commons.text.similarity;
/**
* The hamming distance between two strings of equal length is the number of
* positions at which the corresponding symbols are different.
*
*
* distance.apply("", "") = 0
* distance.apply("pappa", "pappa") = 0
* distance.apply("1011101", "1011111") = 1
* distance.apply("ATCG", "ACCC") = 2
* distance.apply("karolin", "kerstin" = 3
*
*
* @param left the first CharSequence, must not be null
* @param right the second CharSequence, must not be null
* @return distance
* @throws IllegalArgumentException if either input is {@code null} or
* if they do not have the same length
*/
@Override
public Integer apply(final CharSequence left, final CharSequence right) {
if (left == null || right == null) {
throw new IllegalArgumentException("CharSequences must not be null");
}
if (left.length() != right.length()) {
throw new IllegalArgumentException("CharSequences must have the same length");
}
int distance = 0;
for (int i = 0; i < left.length(); i++) {
if (left.charAt(i) != right.charAt(i)) {
distance++;
}
}
return distance;
}
}
IntersectionResult.java 0000664 0000000 0000000 00000007062 13532277265 0034415 0 ustar 00root root 0000000 0000000 commons-text-commons-text-1.8/src/main/java/org/apache/commons/text/similarity /*
* 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.
*/
package org.apache.commons.text.similarity;
import java.util.Objects;
/**
* Represents the intersection result between two sets.
*
*