On Saturday, 8 March 2014 at 02:04:12 UTC, bearophile wrote:
Vladimir Panteleev:
It's not about types, it's about algorithms.
Given sufficiently refined types, it can be about types :-)
Bye,
bearophile
I think Bear is onto something, we already solved an analogous
problem in an elegant
On Friday, 7 March 2014 at 20:43:45 UTC, Vladimir Panteleev wrote:
No, it doesn't.
import std.algorithm;
void main()
{
auto s = cassé;
assert(s.canFind('é'));
}
Hm, I'm not following? Works perfectly fine on my system?
On Friday, 7 March 2014 at 21:58:40 UTC, Vladimir Panteleev wrote:
On Friday, 7 March 2014 at 21:56:45 UTC, Eyrk wrote:
On Friday, 7 March 2014 at 20:43:45 UTC, Vladimir Panteleev
wrote:
No, it doesn't.
import std.algorithm;
void main()
{
auto s = cassé;
assert(s.canFind('é'));
}
Hm
On Friday, 7 March 2014 at 22:27:35 UTC, H. S. Teoh wrote:
This illustrates one of my objections to Andrei's post: by
auto-decoding
behind the user's back and hiding the intricacies of unicode
from him,
it has masked the fact that codepoint-for-codepoint comparison
of a
unicode string is not
