[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Case mapping of sharp s
From: |
Ulrich Mueller |
Subject: |
Re: Case mapping of sharp s |
Date: |
Wed, 18 Nov 2009 20:05:05 +0100 |
>>>>> 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
- Re: Case mapping of sharp s, (continued)
Re: Case mapping of sharp s, Eli Zaretskii, 2009/11/16
- Re: Case mapping of sharp s, Kenichi Handa, 2009/11/17
- Re: Case mapping of sharp s, Eli Zaretskii, 2009/11/17
- Re: Case mapping of sharp s, Kenichi Handa, 2009/11/17
- Re: Case mapping of sharp s, Eli Zaretskii, 2009/11/17
- Re: Case mapping of sharp s, Stephen J. Turnbull, 2009/11/18
- Re: Case mapping of sharp s, Kenichi Handa, 2009/11/18
- Re: Case mapping of sharp s, Stefan Monnier, 2009/11/18
- Re: Case mapping of sharp s,
Ulrich Mueller <=
- Re: Case mapping of sharp s, Stefan Monnier, 2009/11/18
Re: Case mapping of sharp s, Eli Zaretskii, 2009/11/18
Re: Case mapping of sharp s, Stephen J. Turnbull, 2009/11/18
Re: Case mapping of sharp s, martin rudalics, 2009/11/17
Re: Case mapping of sharp s, grischka, 2009/11/19