3 ms·
If you're truncating by character (or WHATEVER) counts, you are guaranteed to be doing it wrong - maybe not in your native language, but in somebody's. Heck, e
by al2o3cr 13y ago
If you're truncating by character (or WHATEVER) counts, you are guaranteed to be doing it wrong - maybe not in your native language, but in somebody's.
Heck, even in one graphemically-straightforward language you can get silliness: http://www.images.generallyawesome2.com/photos/funny/photos/testimonial-fail.png http://www.images.generallyawesome2.com/photos/funny/photos/...
- millstone 13y agoBut truncation is very often needed when you have more text than space. What's the alternative?
- gliese1337 13y agoIf it's storage space, you truncate by bytes, rounding down to the nearest complete grapheme- no need to count graphemes. If it's display space, truncate by pixels, in which case you need "size in device units of the output text from a rendering engine". Again, no need to count graphemes.
- dustyleary 13y agoCounting 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.
- oneeyedpigeon 13y agoOf course, neither of those approaches solves the 'ass-' problem, which is possibly a red herring.