On 12/02/2007, at 9:30 PM, Kem Tekinay wrote:
As for the why the native strings are slower, I know what it’s
doing now.
I’m asking why it can’t do it differently?
How could it do it differently and still have immutable strings, with
the same syntax?
As you have seen and is also demonstrated in the string utilities at
verex, RB allows you to use other techniques to provide this kind of
accumulation should your program require it.
Yes, it would be nice to have a compiler able to recognise such
patterns and optimise them but to be useful in more than just toy
examples, it would have to be very smart at contextual analysis.
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives:
<http://support.realsoftware.com/listarchives/lists.html>
