Re: Char-folding: how can we implement matching multiple characters as a single "thing"?

[John Wiegley]

>>>>> Eli Zaretskii <address@hidden> writes:

> Volunteers are welcome to work on the ultimate solution, which should indeed
> include normalization of both the search string and the buffer/string text
> that is searched.

I imagine this would be done iteratively, with caching of what had been
normalized if we happen to back-track within a certain bound.

Any takers for working on the "ultimate solution"?

John