> The core problem is: given a string "foo", find a string "fop" that
> is greater than any possible extension "foobar" of "foo". We need
> not find the least such string (else it would indeed be a hard
> problem), just a reasonably close upper bound. The algorithm we have
> in 7.0.* increments
Peter Eisentraut <[EMAIL PROTECTED]> writes:
> The real
> problem lies with multi-character collating elements, context dependent
> collation order, multi-pass sorting algorithms, etc. I'm almost convinced
> that it is not possible to do any such optimization as we had for the most
> general case
Bruce Momjian writes:
> Why don't we just spin through all 255 locale values, and find the
> lowest value that is greater than comparison target.
The issue is not that the 255 extended ASCII characters have a different
ordering in various locales (although that's part of it). The real
problem l
