Re: Make backward-word and backward-char as efficient as forward versions.
On Wed, Nov 22, 2000 at 06:12:39PM +0900, Martin Buchholz wrote:
No actual bug fixes here, just efficiency, consistency and
convenience.
Just FYI[1] if you play with benchmarking this, backward and forward
moves have completely different efficiency patterns. Forwards lookups
the first byte in a 256-entry table and adds the result to the pointer
while backwards decrements the pointers until a byte <= 0xa0 is found.
So, well, they are hard to compare...
OG.
[1] Large Y.