Re: string_char_to_byte and string_byte_to_char micro-optimisation

[Noam Postavsky]

On Sat, 15 Jun 2019 at 03:49, Stefan Monnier <address@hidden> wrote:

> be noticeably slowed down by charpos<->bytepos conversion in
> "pathological" cases where we `start` in the middle of a longish string
> and we immediately find a short match.

Would this include cases where you iterate through string-match
results in a loop, incrementing the `start` argument each time, as in
replace-regexp-in-string? (I guess if its REP argument is a function
which aref's another multibyte string, then it should miss the cache
each time).