case 逻辑java,java – 了解CaseInsensitiveComparator中的逻辑

通常情况下，我们期望将案例转换一次并进行比较并完成。然而，代码转换的情况下两次，原因是在不同的方法的注释中说明

public boolean regionMatches(boolean ignoreCase, int toffset, String other, int ooffset, int len)：

Unfortunately, conversion to uppercase does not work properly for the Georgian alphabet, which has strange rules about case conversion. So we need to make one last check before exiting.

附录

区域匹配的代码与CaseInsenstiveComparator中的代码有一些区别，但本质上也是一样的。以下引用了该方法的完整代码，以便进行交叉检查：

public boolean regionMatches(boolean ignoreCase, int toffset,

String other, int ooffset, int len) {

char ta[] = value;

int to = offset + toffset;

char pa[] = other.value;

int po = other.offset + ooffset;

// Note: toffset, ooffset, or len might be near -1>>>1.

if ((ooffset < 0) || (toffset < 0) || (toffset > (long)count - len) ||

(ooffset > (long)other.count - len)) {

return false;

}

while (len-- > 0) {

char c1 = ta[to++];

char c2 = pa[po++];

if (c1 == c2) {

continue;

}

if (ignoreCase) {

// If characters don't match but case may be ignored,

// try converting both characters to uppercase.

// If the results match, then the comparison scan should

// continue.

char u1 = Character.toUpperCase(c1);

char u2 = Character.toUpperCase(c2);

if (u1 == u2) {

continue;

}

// Unfortunately, conversion to uppercase does not work properly

// for the Georgian alphabet, which has strange rules about case

// conversion. So we need to make one last check before

// exiting.

if (Character.toLowerCase(u1) == Character.toLowerCase(u2)) {

continue;

}

}

return false;

}

return true;

}