http://codereview.chromium.org/10975/diff/1/4 File src/unicode.h (right):
http://codereview.chromium.org/10975/diff/1/4#newcode253 Line 253: static int Convert(uchar c, Ok. Have we checked this always give the correct result? If I understand it correctly, the Unicode folding algorithm converts to lower-case (with extra complications like context sensitivity, and equivalence classes that can contain several upper-case letters), whereas Canonicalize converts all characters to a single character, upper-case if possible, otherwise the character itself. If there are two upper-case characters that fold to the same lower-case character (i.e., are in the same equivalence class), they would be equivalent modulo folding, but at most one of the upper-case characters can be "the upper-case equivalent" of the lower-case character wrt. Canonicalize. http://codereview.chromium.org/10975 --~--~---------~--~----~------------~-------~--~----~ v8-dev mailing list [email protected] http://groups.google.com/group/v8-dev -~----------~----~----~----~------~----~------~--~---
