Re: Case mapping of sharp s

[Ulrich Mueller]

>>>>> On Wed, 18 Nov 2009, Stefan Monnier wrote:

> Given the fact that all the strings in the set are very similar,
> it should be possible to come up with an efficient algorithm for it.
> The basic idea I'd try is to build the BM table for each of the
> alternative strings and then merge them into a single table that
> takes for each entry the smallest shift distance of each table.

So if the string has n characters and each of them has two case
variants, then 2^n keys would be needed for the search? (Or even more,
if the extra slots of the case table are used.)

Ulrich