Apache
/
commons-lang
mirror of https://github.com/apache/commons-lang.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

formatting 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1089963 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Matthew Jason Benson 2011-04-07 19:47:43 +00:00
parent f4c4d5ab24
commit faae4b3b10
1 changed files with 13 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/main/java/org/apache/commons/lang3/CharSequenceUtils.java
View File

@ -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);