Mathias Bynens <mathias at qiwi dot be> wrote:
> Let's say I'm writing a program that strips combining characters and
> grapheme extenders from an input string.
>
> For combining marks, I'm looking for any non-combining marks (e.g.
> 'a') followed by one or more combining marks (e.g. ' ̃'), and then I
> remove everything but the non-combining mark (e.g. leaving only 'a').
> Is this a correct approach?
It's entirely up to you. This is a rather unusual thing to want to do
with text. Fr mn lnggs, t wld b qvlnt t strppng ll vwls t f th txt.
-- Doug Ewell | Thornton, CO, USA http://ewellic.org | @DougEwell _______________________________________________ Unicode mailing list Unicode_at_unicode.org http://unicode.org/mailman/listinfo/unicodeReceived on Thu Apr 24 2014 - 14:26:58 CDT
This archive was generated by hypermail 2.2.0 : Thu Apr 24 2014 - 14:26:58 CDT