Counting graphemes and detecting "the nearest complete grapheme" are basically the same problem. The only reason counting graphemes is hard is because detectin

Counting graphemes and detecting "the nearest complete grapheme" are basically the same problem. The only reason counting graphemes is hard is because detecting grapheme boundaries is hard.