Re: why is reverse a string in-place so much slower than a vector?

[Leo Liu]

On 2014-04-25 11:14 +0200, Andreas Schwab wrote:
> String random access has linear complexity: there is a single element
> cache for the last known char->byte mapping for the last accessed
> string, and the runtime depends on the distance from this point.  Your
> rev function represents the worst case behaviour.

Thanks for this piece of critical information. I guess this is all due
to `string_char_to_byte'?

Leo