[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Case mapping of sharp s
From: |
Kenichi Handa |
Subject: |
Re: Case mapping of sharp s |
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.
---
Kenichi Handa
address@hidden
- Re: Case mapping of sharp s, (continued)
- Re: Case mapping of sharp s, Kenichi Handa, 2009/11/16
- 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 <=
- Re: Case mapping of sharp s, Stefan Monnier, 2009/11/18
- Re: Case mapping of sharp s, Ulrich Mueller, 2009/11/18
- 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