Re: Character group folding in searches

[Eli Zaretskii]

> From: Stefan Monnier <address@hidden>
> Cc: address@hidden,  address@hidden
> Date: Fri, 06 Feb 2015 14:41:14 -0500
> 
> I don't see how turning single chars into char-sequences can help us
> handle multi-char sequences (unless maybe you restrict it so that there
> can only ever be one such sequence per equivalence class?).

The decomposition sequence is unique, yes.

> > And because matching "a" and "á" will be hard the other way.
> 
> I don't see what's hard about it: map them both to the same char (e.g. ?a).

Then you won't be able to match "á" with "á".