Re: Support regular expressions with nondeterministic collations

On Tue, 2024-10-22 at 10:40 -0400, Tom Lane wrote:
> I understand and agree with your conclusion
> that it's pretty much impossible to do what the SQL standard suggests
> should happen --- but maybe we're both missing something that would
> make it feasible.

It sounds feasible for case-insensitive collations, right? We just
casefold the pattern and the string, and then check for a match.

That's difficult given our current assumption that non-deterministic
collaitons can mean almost anything. But it's not necessarily a problem
with the standard, and perhaps some other systems do something like
that.

Regards,
	Jeff Davis