Lines Matching refs:sequence
235 @Override public int indexIn(CharSequence sequence) {
236 return (sequence.length() == 0) ? -1 : 0;
238 @Override public int indexIn(CharSequence sequence, int start) {
239 int length = sequence.length();
243 @Override public int lastIndexIn(CharSequence sequence) {
244 return sequence.length() - 1;
246 @Override public boolean matchesAllOf(CharSequence sequence) {
247 checkNotNull(sequence);
250 @Override public boolean matchesNoneOf(CharSequence sequence) {
251 return sequence.length() == 0;
253 @Override public String removeFrom(CharSequence sequence) {
254 checkNotNull(sequence);
258 CharSequence sequence, char replacement) {
259 char[] array = new char[sequence.length()];
264 CharSequence sequence, CharSequence replacement) {
265 StringBuilder retval = new StringBuilder(sequence.length() * replacement.length());
266 for (int i = 0; i < sequence.length(); i++) {
271 @Override public String collapseFrom(CharSequence sequence, char replacement) {
272 return (sequence.length() == 0) ? "" : String.valueOf(replacement);
274 @Override public String trimFrom(CharSequence sequence) {
275 checkNotNull(sequence);
278 @Override public int countIn(CharSequence sequence) {
279 return sequence.length();
302 @Override public int indexIn(CharSequence sequence) {
303 checkNotNull(sequence);
306 @Override public int indexIn(CharSequence sequence, int start) {
307 int length = sequence.length();
311 @Override public int lastIndexIn(CharSequence sequence) {
312 checkNotNull(sequence);
315 @Override public boolean matchesAllOf(CharSequence sequence) {
316 return sequence.length() == 0;
318 @Override public boolean matchesNoneOf(CharSequence sequence) {
319 checkNotNull(sequence);
322 @Override public String removeFrom(CharSequence sequence) {
323 return sequence.toString();
326 CharSequence sequence, char replacement) {
327 return sequence.toString();
330 CharSequence sequence, CharSequence replacement) {
332 return sequence.toString();
335 CharSequence sequence, char replacement) {
336 return sequence.toString();
338 @Override public String trimFrom(CharSequence sequence) {
339 return sequence.toString();
341 @Override public int countIn(CharSequence sequence) {
342 checkNotNull(sequence);
374 CharSequence sequence, char replacement) {
375 return sequence.toString().replace(match, replacement);
421 * given character sequence.
423 public static CharMatcher anyOf(final CharSequence sequence) {
424 switch (sequence.length()) {
428 return is(sequence.charAt(0));
430 final char match1 = sequence.charAt(0);
431 final char match2 = sequence.charAt(1);
446 final char[] chars = sequence.toString().toCharArray();
463 * the given character sequence.
465 public static CharMatcher noneOf(CharSequence sequence) {
466 return anyOf(sequence).negate();
536 @Override public boolean matchesAllOf(CharSequence sequence) {
537 return original.matchesNoneOf(sequence);
539 @Override public boolean matchesNoneOf(CharSequence sequence) {
540 return original.matchesAllOf(sequence);
542 @Override public int countIn(CharSequence sequence) {
543 return sequence.length() - original.countIn(sequence);
704 * Returns {@code true} if a character sequence contains only matching
707 * <p>The default implementation iterates over the sequence, invoking {@link
711 * @param sequence the character sequence to examine, possibly empty
713 * sequence, including when the sequence is empty
715 public boolean matchesAllOf(CharSequence sequence) {
716 for (int i = sequence.length() - 1; i >= 0; i--) {
717 if (!matches(sequence.charAt(i))) {
725 * Returns {@code true} if a character sequence contains no matching
728 * <p>The default implementation iterates over the sequence, invoking {@link
732 * @param sequence the character sequence to examine, possibly empty
734 * sequence, including when the sequence is empty
736 public boolean matchesNoneOf(CharSequence sequence) {
737 return indexIn(sequence) == -1;
743 * Returns the index of the first matching character in a character sequence,
746 * <p>The default implementation iterates over the sequence in forward order
749 * @param sequence the character sequence to examine from the beginning
752 public int indexIn(CharSequence sequence) {
753 int length = sequence.length();
755 if (matches(sequence.charAt(i))) {
763 * Returns the index of the first matching character in a character sequence,
767 * <p>The default implementation iterates over the sequence in forward order,
770 * @param sequence the character sequence to examine
772 * greater than {@code sequence.length()}
776 * {@code sequence.length()}
778 public int indexIn(CharSequence sequence, int start) {
779 int length = sequence.length();
782 if (matches(sequence.charAt(i))) {
790 * Returns the index of the last matching character in a character sequence,
793 * <p>The default implementation iterates over the sequence in reverse order
796 * @param sequence the character sequence to examine from the end
799 public int lastIndexIn(CharSequence sequence) {
800 for (int i = sequence.length() - 1; i >= 0; i--) {
801 if (matches(sequence.charAt(i))) {
809 * Returns the number of matching characters found in a character sequence.
811 public int countIn(CharSequence sequence) {
813 for (int i = 0; i < sequence.length(); i++) {
814 if (matches(sequence.charAt(i))) {
823 * sequence, in order. For example: <pre> {@code
829 public String removeFrom(CharSequence sequence) {
830 String string = sequence.toString();
860 * sequence, in order. For example: <pre> {@code
866 public String retainFrom(CharSequence sequence) {
867 return negate().removeFrom(sequence);
871 * Returns a string copy of the input character sequence, with each character
880 * the first matching character, then iterates the remainder of the sequence
883 * @param sequence the character sequence to replace matching characters in
885 * each matching character in {@code sequence}
888 public String replaceFrom(CharSequence sequence, char replacement) {
889 String string = sequence.toString();
905 * Returns a string copy of the input character sequence, with each character
906 * that matches this matcher replaced by a given replacement sequence. For
916 * @param sequence the character sequence to replace matching characters in
918 * of each matching character in {@code sequence}
921 public String replaceFrom(CharSequence sequence, CharSequence replacement) {
924 return removeFrom(sequence);
927 return replaceFrom(sequence, replacement.charAt(0));
930 String string = sequence.toString();
952 * Returns a substring of the input character sequence that omits all
966 public String trimFrom(CharSequence sequence) {
967 int len = sequence.length();
972 if (!matches(sequence.charAt(first))) {
977 if (!matches(sequence.charAt(last))) {
982 return sequence.subSequence(first, last + 1).toString();
986 * Returns a substring of the input character sequence that omits all
994 public String trimLeadingFrom(CharSequence sequence) {
995 int len = sequence.length();
999 if (!matches(sequence.charAt(first))) {
1004 return sequence.subSequence(first, len).toString();
1008 * Returns a substring of the input character sequence that omits all
1016 public String trimTrailingFrom(CharSequence sequence) {
1017 int len = sequence.length();
1021 if (!matches(sequence.charAt(last))) {
1026 return sequence.subSequence(0, last + 1).toString();
1030 * Returns a string copy of the input character sequence, with each group of
1039 * the first matching character, then iterates the remainder of the sequence
1042 * @param sequence the character sequence to replace matching groups of
1045 * each group of matching characters in {@code sequence}
1048 public String collapseFrom(CharSequence sequence, char replacement) {
1049 int first = indexIn(sequence);
1051 return sequence.toString();
1056 StringBuilder builder = new StringBuilder(sequence.length())
1057 .append(sequence.subSequence(0, first))
1060 for (int i = first + 1; i < sequence.length(); i++) {
1061 char c = sequence.charAt(i);
1078 * sequence are removed without replacement.
1080 public String trimAndCollapseFrom(CharSequence sequence, char replacement) {
1081 int first = negate().indexIn(sequence);
1085 StringBuilder builder = new StringBuilder(sequence.length());
1087 for (int i = first; i < sequence.length(); i++) {
1088 char c = sequence.charAt(i);
