https://bugs.exim.org/show_bug.cgi?id=2793
--- Comment #5 from Thomas Tempelmann <tempelmann@???> ---
Alright, it's as I suspected:
First off, the code already does what I suggested to do: Scan for both "e" and
"E" and then process the nearer one.
The "bug" is that the found locations are not cached, so the next time both
chars are searched again from the current position, even if it has already been
determined that there's no such char for a while.
Adding some caching for both found locations should fix this.
--
You are receiving this mail because:
You are on the CC list for the bug.
