Hi,
William D Clinger <will at ccs.neu.edu> writes:
> The representations that appear most attractive for Larceny
> are described at
>
> http://larceny.ccs.neu.edu/larceny-trac/wiki/StringRepresentations
Thanks for the link. So for UTF-*, the O(1) amortized time for
`string-ref' and `string-length' would stem from the use of memoization,
while `string-set!' would remain O(n).
Thanks,
Ludovic.
Received on Wed Aug 29 2007 - 10:17:29 UTC