test/java/util/regex/GraphemeTest.java

Print this page

        

*** 140,150 **** private static final int LAST_TYPE = 12; private static boolean[][] rules; static { rules = new boolean[LAST_TYPE + 1][LAST_TYPE + 1]; ! // default, any ÷ any for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) for (int j = FIRST_TYPE; j <= LAST_TYPE; j++) rules[i][j] = true; // GB 6 L x (L | V | LV | VT) rules[L][L] = false; --- 140,150 ---- private static final int LAST_TYPE = 12; private static boolean[][] rules; static { rules = new boolean[LAST_TYPE + 1][LAST_TYPE + 1]; ! // default, any + any for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) for (int j = FIRST_TYPE; j <= LAST_TYPE; j++) rules[i][j] = true; // GB 6 L x (L | V | LV | VT) rules[L][L] = false;
*** 167,186 **** for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) { rules[i][EXTEND] = false; rules[i][SPACINGMARK] = false; rules[PREPEND][i] = false; } ! // GB 4 (Control | CR | LF) ÷ ! // GB 5 ÷ (Control | CR | LF) for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) for (int j = CR; j <= CONTROL; j++) { rules[i][j] = true; rules[j][i] = true; } // GB 3 CR x LF rules[CR][LF] = false; ! // GB 10 Any ÷ Any -> default } // Hangul syllables private static final int SYLLABLE_BASE = 0xAC00; private static final int LCOUNT = 19; --- 167,186 ---- for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) { rules[i][EXTEND] = false; rules[i][SPACINGMARK] = false; rules[PREPEND][i] = false; } ! // GB 4 (Control | CR | LF) + ! // GB 5 + (Control | CR | LF) for (int i = FIRST_TYPE; i <= LAST_TYPE; i++) for (int j = CR; j <= CONTROL; j++) { rules[i][j] = true; rules[j][i] = true; } // GB 3 CR x LF rules[CR][LF] = false; ! // GB 10 Any + Any -> default } // Hangul syllables private static final int SYLLABLE_BASE = 0xAC00; private static final int LCOUNT = 19;