/*
* Copyright ( c ) 2015 , Oracle and / or its affiliates . All rights reserved .
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER .
*
* This code is free software ; you can redistribute it and / or modify it
* under the terms of the GNU General Public License version 2 only , as
* published by the Free Software Foundation .
*
* This code is distributed in the hope that it will be useful , but WITHOUT
* ANY WARRANTY ; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE . See the GNU General Public License
* version 2 for more details ( a copy is included in the LICENSE file that
* accompanied this code ) .
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work ; if not , write to the Free Software Foundation ,
* Inc . , 51 Franklin St , Fifth Floor , Boston , MA 02110 - 1301 USA .
*
* Please contact Oracle , 500 Oracle Parkway , Redwood Shores , CA 94065 USA
* or visit www . oracle . com if you need additional information or have any
* questions .
*/
/* @test
* @ bug 8138824
* @ summary Test expected equalsIgnoreCase behavior for some known asymmetric case mappings
*/
public class EqualsIgnoreCase {
private static final String SMALL_I = "i" ;
private static final String CAPITAL_I = "I" ;
// Characters that do not map symmetrically between upper/lower case
private static final String SMALL_DOTLESS_I = "\u0131" ;
private static final String CAPITAL_I_WITH_DOT = "\u0130" ;
private static final String LOWER_GREEK_THETA = "\u03D1" ;
private static final String CAPITAL_GREEK_THETA = "\u03F4" ;
public static void main(String[] args) {
compareFuncs(SMALL_I, CAPITAL_I, true , true );
compareFuncs(CAPITAL_I_WITH_DOT, SMALL_DOTLESS_I, true , false );
compareFuncs(LOWER_GREEK_THETA, CAPITAL_GREEK_THETA, true , false );
}
/**
* Compare the actual results of equalsIgnoreCase ( ) :
* toUpperCase ( toLowerCase ( eachChar ) )
* to the behavior described in the equalsIgnoreCase ( ) spec prior to 8138824 :
* toUpperCase ( eachChar )
* toLowerCase ( eachChar )
*
* @ param s1 A string
* @ param s2 Another string
* @ param expectEquals Expected result of equalsIgnoreCase ( )
* @ param expectTuTl Expected result of toUpperToLowerOriginals ( )
*/
private static void compareFuncs(String s1, String s2, boolean expectEquals, boolean expectTuTl) {
System.out.println(s1 + ", " + s2);
boolean equalsResult = s1.equalsIgnoreCase(s2);
System.out.println("equalsIgnoreCase:" + equalsResult);
boolean tuTlResult = toUpperToLowerOriginals(s1, s2);
System.out.println("tUtLO:" + tuTlResult);
boolean failed = false ;
if (equalsResult != expectEquals) {
System.out.println("Expected " + expectEquals + " from equalsIgnoreCase() but got " + equalsResult);
failed = true ;
}
if (tuTlResult != expectTuTl) {
System.out.println("Expected " + expectTuTl + " from toUpperToLowerOriginals() but got " + tuTlResult);
failed = true ;
}
if (failed) { throw new RuntimeException("Test Failed" ); }
}
/**
* Apply toUpperCase ( ) and toLowerCase ( ) to corresponding chars of both
* Strings . Returns true if each pair of corresponding chars are either :
* 1 . = = after both are converted to upper case
* or
* 2 . = = after both are converted to lower case
* and the String lengths are equal .
*/
private static boolean toUpperToLowerOriginals(String str1, String str2) {
if (str1.length() != str2.length()) { return false ; }
for (int i = 0 ; i < str1.length(); i++) {
char c1 = str1.charAt(i);
char c2 = str2.charAt(i);
char uc1 = Character.toUpperCase(c1);
char uc2 = Character.toUpperCase(c2);
boolean upperMatch = uc1 == uc2;
char lc1 = Character.toLowerCase(c1);
char lc2 = Character.toLowerCase(c2);
boolean lowerMatch = lc1 == lc2;
if (!(upperMatch || lowerMatch)) {
return false ;
}
}
return true ;
}
}
Messung V0.5 in Prozent C=96 H=97 G=96
¤ Dauer der Verarbeitung: 0.8 Sekunden
(vorverarbeitet am 2026-10-11)
¤
*© Formatika GbR, Deutschland