Bug 12324 – std.uni.Grapheme / byGrapheme can't search for decomposed form

import std.uni; import std.algorithm; void main() { auto s = "casse\u0301"; // "é" ("e" + combining diacritic) assert(s.byGrapheme.canFind(Grapheme("\u00e9"))); // "é" } If you print Grapheme("\u00e9") and the last grapheme in s, many of the fields appear to be different: Grapheme(1000065, 3, 0, 33554432, [101, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 2) // last byGrapheme vs. Grapheme(E9, 0, 0, 16777216, [233, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], 1) // Grapheme("é") http://forum.dlang.org/post/[email protected]

Normalization is the answer here. Should I do it on grapheme construction? I don't think so.

THIS ISSUE HAS BEEN MOVED TO GITHUB https://github.com/dlang/phobos/issues/10037 DO NOT COMMENT HERE ANYMORE, NOBODY WILL SEE IT, THIS ISSUE HAS BEEN MOVED TO GITHUB