Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
8302877: Speed up latin1 case conversions
Reviewed-by: naoto, redestad
- Loading branch information
Showing
5 changed files
with
165 additions
and
22 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,92 @@ | ||
/* | ||
* Copyright (c) 2023, 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. | ||
*/ | ||
|
||
import org.testng.annotations.Test; | ||
|
||
import static org.testng.Assert.assertEquals; | ||
import static org.testng.Assert.fail; | ||
|
||
/** | ||
* @test | ||
* @bug 8302877 | ||
* @summary Provides exhaustive verification of Character.toUpperCase and Character.toLowerCase | ||
* for all code points in the latin1 range 0-255. | ||
* @run testng Latin1CaseConversion | ||
*/ | ||
public class Latin1CaseConversion { | ||
|
||
@Test | ||
public void shouldUpperCaseAndLowerCaseLatin1() { | ||
for (int c = 0; c < 256; c++) { | ||
int upper = Character.toUpperCase(c); | ||
int lower = Character.toLowerCase(c); | ||
|
||
if (c < 0x41) { // Before A | ||
assertUnchanged(upper, lower, c); | ||
} else if (c <= 0x5A) { // A-Z | ||
assertEquals(upper, c); | ||
assertEquals(lower, c + 32); | ||
} else if (c < 0x61) { // Between Z and a | ||
assertUnchanged(upper, lower, c); | ||
} else if (c <= 0x7A) { // a-z | ||
assertEquals(upper, c - 32); | ||
assertEquals(lower, c); | ||
} else if (c < 0xB5) { // Between z and Micro Sign | ||
assertUnchanged(upper, lower, c); | ||
} else if (c == 0xB5) { // Special case for Micro Sign | ||
assertEquals(upper, 0x39C); | ||
assertEquals(lower, c); | ||
} else if (c < 0xC0) { // Between my and A-grave | ||
assertUnchanged(upper, lower, c); | ||
} else if (c < 0xD7) { // A-grave - O with Diaeresis | ||
assertEquals(upper, c); | ||
assertEquals(lower, c + 32); | ||
} else if (c == 0xD7) { // Multiplication | ||
assertUnchanged(upper, lower, c); | ||
} else if (c <= 0xDE) { // O with slash - Thorn | ||
assertEquals(upper, c); | ||
assertEquals(lower, c + 32); | ||
} else if (c == 0xDF) { // Sharp s | ||
assertUnchanged(upper, lower, c); | ||
} else if (c < 0xF7) { // a-grave - divsion | ||
assertEquals(upper, c - 32); | ||
assertEquals(lower, c); | ||
} else if (c == 0xF7) { // Division | ||
assertUnchanged(upper, lower, c); | ||
} else if (c < 0xFF) { // o with slash - thorn | ||
assertEquals(upper, c - 32); | ||
assertEquals(lower, c); | ||
} else if (c == 0XFF) { // Special case for y with Diaeresis | ||
assertEquals(upper, 0x178); | ||
assertEquals(lower, c); | ||
} else { | ||
fail("Uncovered code point: " + Integer.toHexString(c)); | ||
} | ||
} | ||
} | ||
|
||
private static void assertUnchanged(int upper, int lower, int c) { | ||
assertEquals(upper, c); | ||
assertEquals(lower, c); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
ef1f7bd
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Review
Issues