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:
parent
f4c4d5ab24
commit
faae4b3b10
|
@ -72,11 +72,11 @@ static int indexOf(CharSequence cs, int searchChar, int start) {
|
||||||
return ((String) cs).indexOf(searchChar, start);
|
return ((String) cs).indexOf(searchChar, start);
|
||||||
} else {
|
} else {
|
||||||
int sz = cs.length();
|
int sz = cs.length();
|
||||||
if ( start < 0 ) {
|
if (start < 0) {
|
||||||
start = 0;
|
start = 0;
|
||||||
}
|
}
|
||||||
for ( int i=start; i < sz; i++ ) {
|
for (int i = start; i < sz; i++) {
|
||||||
if ( cs.charAt(i) == searchChar) {
|
if (cs.charAt(i) == searchChar) {
|
||||||
return i;
|
return i;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -97,7 +97,7 @@ static int indexOf(CharSequence cs, CharSequence searchChar, int start) {
|
||||||
// TODO: Do we assume searchChar is usually relatively small;
|
// TODO: Do we assume searchChar is usually relatively small;
|
||||||
// If so then calling toString() on it is better than reverting to
|
// If so then calling toString() on it is better than reverting to
|
||||||
// the green implementation in the else block
|
// the green implementation in the else block
|
||||||
return ((String) cs).indexOf( (String) searchChar, start);
|
return ((String) cs).indexOf((String) searchChar, start);
|
||||||
} else {
|
} else {
|
||||||
// TODO: Implement rather than convert to String
|
// TODO: Implement rather than convert to String
|
||||||
return cs.toString().indexOf(searchChar.toString(), start);
|
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);
|
return ((String) cs).lastIndexOf(searchChar, start);
|
||||||
} else {
|
} else {
|
||||||
int sz = cs.length();
|
int sz = cs.length();
|
||||||
if ( start < 0 ) {
|
if (start < 0) {
|
||||||
return -1;
|
return -1;
|
||||||
}
|
}
|
||||||
if ( start >= sz ) {
|
if (start >= sz) {
|
||||||
start = sz - 1;
|
start = sz - 1;
|
||||||
}
|
}
|
||||||
for ( int i=start; i >= 0; --i ) {
|
for (int i = start; i >= 0; --i) {
|
||||||
if ( cs.charAt(i) == searchChar) {
|
if (cs.charAt(i) == searchChar) {
|
||||||
return i;
|
return i;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -145,7 +145,7 @@ static int lastIndexOf(CharSequence cs, CharSequence searchChar, int start) {
|
||||||
// TODO: Do we assume searchChar is usually relatively small;
|
// TODO: Do we assume searchChar is usually relatively small;
|
||||||
// If so then calling toString() on it is better than reverting to
|
// If so then calling toString() on it is better than reverting to
|
||||||
// the green implementation in the else block
|
// the green implementation in the else block
|
||||||
return ((String) cs).lastIndexOf( (String) searchChar, start);
|
return ((String) cs).lastIndexOf((String) searchChar, start);
|
||||||
} else {
|
} else {
|
||||||
// TODO: Implement rather than convert to String
|
// TODO: Implement rather than convert to String
|
||||||
return cs.toString().lastIndexOf(searchChar.toString(), start);
|
return cs.toString().lastIndexOf(searchChar.toString(), start);
|
||||||
|
@ -164,7 +164,7 @@ static char[] toCharArray(CharSequence cs) {
|
||||||
} else {
|
} else {
|
||||||
int sz = cs.length();
|
int sz = cs.length();
|
||||||
char[] array = new char[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);
|
array[i] = cs.charAt(i);
|
||||||
}
|
}
|
||||||
return array;
|
return array;
|
||||||
|
@ -182,11 +182,10 @@ static char[] toCharArray(CharSequence cs) {
|
||||||
* @param length character length of the region
|
* @param length character length of the region
|
||||||
* @return whether the region matched
|
* @return whether the region matched
|
||||||
*/
|
*/
|
||||||
static boolean regionMatches(CharSequence cs, boolean ignoreCase, int thisStart,
|
static boolean regionMatches(CharSequence cs, boolean ignoreCase, int thisStart,
|
||||||
CharSequence substring, int start, int length)
|
CharSequence substring, int start, int length) {
|
||||||
{
|
|
||||||
if (cs instanceof String && substring instanceof String) {
|
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 {
|
} else {
|
||||||
// TODO: Implement rather than convert to String
|
// TODO: Implement rather than convert to String
|
||||||
return cs.toString().regionMatches(ignoreCase, thisStart, substring.toString(), start, length);
|
return cs.toString().regionMatches(ignoreCase, thisStart, substring.toString(), start, length);
|
||||||
|
|
Loading…
Reference in New Issue