Re: Case mapping of sharp s

[Eli Zaretskii]

> From: Kenichi Handa <address@hidden>
> Cc: address@hidden, address@hidden
> Date: Wed, 18 Nov 2009 15:26:32 +0900
> 
> In article <address@hidden>, Eli Zaretskii <address@hidden> writes:
> 
> > My idea was to use the same technique to fold the text as you search
> > through it.  You could, for example, fold one character at a time, so
> > that instead of comparing against X you compare against fold(X).
> 
> BM-search already does it.  The problem is that the current
> `fold' function can be applicable only to the last byte of a
> character.

Yes, I know: you explained it earlier in this thread.  What I thought
would help is that fold("SS") and fold("ß") have the same number of
bytes, which I think was the problem that prevented the use of BM.