|
|
|
|
|
by kevin_thibedeau
1600 days ago
|
|
Consider you have to split a string with 20 flags in sequence at a given offset. That's 40 codepoints with no readily discernible boundaries. To parse that you have to scan backwards to find the first non-flag codepoint. Otherwise you could split the middle of a flag pair. You also have to handle rendering invalid combinations as two glyphs and unpaired codes. For normal codepoints with combining characters you can scan forwards until you reach a non-combining character. |
|
So consider that you have [a really bad idea], it’s not convenient?
You do realise essentially the same issue occurs if you have a stack of diacritics right?