[perl #125927] नि -- a grapheme cluster boundary algo problem (CCC = 0 can be a valid combiner?)

On Thu Aug 27 16:37:21 2015, raiph wrote: > jnthn++ and others are busy with work that is far more important and > urgent than dealing with this right now. I'm filing this bug now > because there are reasons to consider addressing it before christmas > as explained below. > > What I did >

[perl #125927] नि -- a grapheme cluster boundary algo problem (CCC = 0 can be a valid combiner?)

On Mon Oct 26 11:44:45 2015, FROGGS.de wrote: > Here are more examples (by novapatch++ via irc): > > m: say «நி กำ षि "\r\n"»».chars > rakudo-moar cd7766: OUTPUT«(2 2 2 2)␤» These now all report as 1, with the exception of \r\n. -- Will "Coke" Coleda

[perl #125927] नि -- a grapheme cluster boundary algo problem (CCC = 0 can be a valid combiner?)

Here are more examples (by novapatch++ via irc): m: say «நி กำ षि "\r\n"»».chars rakudo-moar cd7766: OUTPUT«(2 2 2 2)␤»

[perl #125927] नि -- a grapheme cluster boundary algo problem (CCC = 0 can be a valid combiner?)

# New Ticket Created by raiph # Please include the string: [perl #125927] # in the subject line of all future correspondence about this issue. # URL: https://rt.perl.org/Ticket/Display.html?id=125927 jnthn++ and others are busy with work that is far more important and urgent than dealing