On Fri, Mar 27, 2020 at 09:46:29PM +0100, Laslo Hunhold wrote:
> thanks for your feedback! I'm glad you like it. This is still at
> version "0", so if you have any suggestions for the API that might come
> to mind, let me know.
Huho!
How about making it "work" with "One Compilation Unit" projects
On Sat, 28 Mar 2020 00:32:24 +0100
Mattias Andrée wrote:
Dear Mattias,
> This sounds absolutely horrible. Non-pre-composed characters are not
> widely well support and are often rendered terribly, some software
> (like the Linux VT) cannot even rendering them.
yes, the Linux VT is a good exampl
On Fri, 27 Mar 2020 22:24:22 +
wrote:
> On Fri, Mar 27, 2020 at 10:24:52PM +0100, Laslo Hunhold wrote:
> > ... This will cover 99.5% of all cases...
>
> What do you mean? They managed to add in grapheme cluster definition some
> weird
> edge cases up to 0.5%??
>
> About string comparison
On Fri, 27 Mar 2020 22:24:22 +
sylvain.bertr...@gmail.com wrote:
Dear Sylvain,
> On Fri, Mar 27, 2020 at 10:24:52PM +0100, Laslo Hunhold wrote:
> > ... This will cover 99.5% of all cases...
>
> What do you mean? They managed to add in grapheme cluster definition
> some weird edge cases up
On Fri, Mar 27, 2020 at 10:24:52PM +0100, Laslo Hunhold wrote:
> ... This will cover 99.5% of all cases...
What do you mean? They managed to add in grapheme cluster definition some weird
edge cases up to 0.5%??
About string comparison: if I recall well, after utf-8 normalization (n11n),
strings
On Fri, 27 Mar 2020 22:03:48 +0100
v4hn wrote:
Dear Michael,
> On Fri, Mar 27, 2020 at 09:49:46PM +0100, Laslo Hunhold wrote:
> > thank you very much! Especially regarding understandability, given
> > this topic is really a bit "specific". :)
>
> On that note, do you work on this very specifi
On Fri, Mar 27, 2020 at 09:49:46PM +0100, Laslo Hunhold wrote:
> thank you very much! Especially regarding understandability, given this
> topic is really a bit "specific". :)
On that note, do you work on this very specific subproblem out of curiosity
or do you work on concrete software projects t
On Fri, 27 Mar 2020 20:58:16 +
sylvain.bertr...@gmail.com wrote:
Dear Sylvain,
> On this very mailing list we already had some exchange of thoughts
> about the unicode grapheme cluster.
> One question which was stuck into my head after this exchange was:
> how many of unicode "scripts" can b
On Fri, Mar 27, 2020 at 08:00:58PM +, Tait Hoyem wrote:
> I would also like to avoid Warnock's dilemma.
+1
On this very mailing list we already had some exchange of thoughts about the
unicode grapheme cluster.
One question which was stuck into my head after this exchange was: how many of
uni
On Fri, 27 Mar 2020 20:00:58 +
Tait Hoyem wrote:
Dear Tait,
> I would also like to avoid Warnock's dilemma.
> Looks very interesting! And even a complete newb like me can
> understand it :) Well done!
thank you very much! Especially regarding understandability, given this
topic is really a
I'd like to join in and say this is a wonderful work you made. I'm
looking forward to the updates.
Best luck,
Dominik.
On 27/03/2020, Laslo Hunhold wrote:
> On Fri, 27 Mar 2020 18:53:30 +
> Michael Hendricks wrote:
>
> Dear Michael,
>
>> To avoid Warnock's dilemma, let me just say that thi
On Fri, 27 Mar 2020 18:53:30 +
Michael Hendricks wrote:
Dear Michael,
> To avoid Warnock's dilemma, let me just say that this looks
> excellent. The API and implementation is clean and focused. Thank you
> for publishing this library.
thanks for your feedback! I'm glad you like it. This is
I would also like to avoid Warnock's dilemma.
Looks very interesting! And even a complete newb like me can understand it :)
Well done!
Sent with ProtonMail Secure Email.
‐‐‐ Original Message ‐‐‐
On Friday, March 27, 2020 6:53 PM, Michael Hendricks wrote:
> > I'm very glad to announce l
> I'm very glad to announce libgrapheme[0], a library for handling grapheme
> clusters.
To avoid Warnock's dilemma, let me just say that this looks excellent. The
API and implementation is clean and focused. Thank you for publishing this
library.
14 matches
Mail list logo
