Comment by codedokode 15 days ago I think you rarely need it. May I know what is your usecase that you need this often? 1 comment codedokode Reply rswail 12 days ago Extract the nth grapheme from a string of Unicode codepoints. Codepoints are 32-bit values.Take into account that some Unicode codepoints work together to combine to form a grapheme which then links to a glyph for display.If you use UTF-8 internally, you will be expanding out to full 32 bits when scanning the vector anyway.So if memory isn't an issue (and most of the time it's not), indexing a vector by codepoint (ie 32 bits) makes more sense from a processing POV.
rswail 12 days ago Extract the nth grapheme from a string of Unicode codepoints. Codepoints are 32-bit values.Take into account that some Unicode codepoints work together to combine to form a grapheme which then links to a glyph for display.If you use UTF-8 internally, you will be expanding out to full 32 bits when scanning the vector anyway.So if memory isn't an issue (and most of the time it's not), indexing a vector by codepoint (ie 32 bits) makes more sense from a processing POV.
Extract the nth grapheme from a string of Unicode codepoints. Codepoints are 32-bit values.
Take into account that some Unicode codepoints work together to combine to form a grapheme which then links to a glyph for display.
If you use UTF-8 internally, you will be expanding out to full 32 bits when scanning the vector anyway.
So if memory isn't an issue (and most of the time it's not), indexing a vector by codepoint (ie 32 bits) makes more sense from a processing POV.