[EMAIL PROTECTED] scripsit:
> The other ideas on the table seem to be UCS-4 strings or O(n) string-ref
> for UTF-8/UTF-16 strings. O(n) string-ref would make something as simple
> as searching for a substring in a string rather slow. And there would be
> no standard way of making it faster.
There is nothing, however, that prevents an implementation from providing
a faster implementation that breaks the encapsulation of strings.
--
A poetical purist named Cowan [that's me: [EMAIL PROTECTED]
Once put the rest of us dowan. [on xml-dev]
"Your verse would be sweeter http://www.ccil.org/~cowan
If it only had metre
And rhymes that didn't force me to frowan." [overpacked line!] --Michael Kay
_______________________________________________
r6rs-discuss mailing list
[email protected]
http://lists.r6rs.org/cgi-bin/mailman/listinfo/r6rs-discuss
