Re: Character group folding in searches

[Stefan Monnier]

>> 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.

Elsewhere:
> It will, if you only pay attention to the base character.

Hmm... could you characterize the kinds of equivalence classes you
intend to handle?

Could it handle for example an equivalence class which includes
→, ⇒, ->, and => ?


        Stefan