Re: Case mapping of sharp s

[Kenichi Handa]

In article <address@hidden>, Eli Zaretskii <address@hidden> writes:

> > That kind of setting surely makes the searching of ß and ẞ
> > slow because we can't use BM search when case-fold-search is
> > non-nil.  BM search is possible only when all
> > case-equivalent characters are represented by the same byte
> > length, and differ only in the last byte.

> I think we need to solve this limitation anyway, if we want a decent
> support for Unicode.  There are many more pairs of characters that
> should normally be considered equal in search.

I agree.

> Wouldn't the technique described in UTS 18
> (http://www.unicode.org/reports/tr18/) help here?

Which technique do you mean?  That report mostly describes
just rules of matching, not about fast implementation.

---
Kenichi Handa
address@hidden