From faae4b3b1015f875f7a95c4883dfee20579ec3a6 Mon Sep 17 00:00:00 2001 From: Matthew Jason Benson Date: Thu, 7 Apr 2011 19:47:43 +0000 Subject: [PATCH] formatting git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1089963 13f79535-47bb-0310-9956-ffa450edef68 --- .../commons/lang3/CharSequenceUtils.java | 27 +++++++++---------- 1 file changed, 13 insertions(+), 14 deletions(-) diff --git a/src/main/java/org/apache/commons/lang3/CharSequenceUtils.java b/src/main/java/org/apache/commons/lang3/CharSequenceUtils.java index 06ef2e90b..ca88080d6 100644 --- a/src/main/java/org/apache/commons/lang3/CharSequenceUtils.java +++ b/src/main/java/org/apache/commons/lang3/CharSequenceUtils.java @@ -72,11 +72,11 @@ static int indexOf(CharSequence cs, int searchChar, int start) { return ((String) cs).indexOf(searchChar, start); } else { int sz = cs.length(); - if ( start < 0 ) { + if (start < 0) { start = 0; } - for ( int i=start; i < sz; i++ ) { - if ( cs.charAt(i) == searchChar) { + for (int i = start; i < sz; i++) { + if (cs.charAt(i) == searchChar) { return i; } } @@ -97,7 +97,7 @@ static int indexOf(CharSequence cs, CharSequence searchChar, int start) { // TODO: Do we assume searchChar is usually relatively small; // If so then calling toString() on it is better than reverting to // the green implementation in the else block - return ((String) cs).indexOf( (String) searchChar, start); + return ((String) cs).indexOf((String) searchChar, start); } else { // TODO: Implement rather than convert to String return cs.toString().indexOf(searchChar.toString(), start); @@ -117,14 +117,14 @@ static int lastIndexOf(CharSequence cs, int searchChar, int start) { return ((String) cs).lastIndexOf(searchChar, start); } else { int sz = cs.length(); - if ( start < 0 ) { + if (start < 0) { return -1; } - if ( start >= sz ) { + if (start >= sz) { start = sz - 1; } - for ( int i=start; i >= 0; --i ) { - if ( cs.charAt(i) == searchChar) { + for (int i = start; i >= 0; --i) { + if (cs.charAt(i) == searchChar) { return i; } } @@ -145,7 +145,7 @@ static int lastIndexOf(CharSequence cs, CharSequence searchChar, int start) { // TODO: Do we assume searchChar is usually relatively small; // If so then calling toString() on it is better than reverting to // the green implementation in the else block - return ((String) cs).lastIndexOf( (String) searchChar, start); + return ((String) cs).lastIndexOf((String) searchChar, start); } else { // TODO: Implement rather than convert to String return cs.toString().lastIndexOf(searchChar.toString(), start); @@ -164,7 +164,7 @@ static char[] toCharArray(CharSequence cs) { } else { int sz = cs.length(); char[] array = new char[cs.length()]; - for (int i=0; i < sz; i++) { + for (int i = 0; i < sz; i++) { array[i] = cs.charAt(i); } return array; @@ -182,11 +182,10 @@ static char[] toCharArray(CharSequence cs) { * @param length character length of the region * @return whether the region matched */ - static boolean regionMatches(CharSequence cs, boolean ignoreCase, int thisStart, - CharSequence substring, int start, int length) - { + static boolean regionMatches(CharSequence cs, boolean ignoreCase, int thisStart, + CharSequence substring, int start, int length) { if (cs instanceof String && substring instanceof String) { - return ((String) cs).regionMatches(ignoreCase, thisStart, ((String)substring), start, length); + return ((String) cs).regionMatches(ignoreCase, thisStart, ((String) substring), start, length); } else { // TODO: Implement rather than convert to String return cs.toString().regionMatches(ignoreCase, thisStart, substring.toString(), start, length);