Thanks, added a quote from you on that; see if it looks ok.
Mark
On Sat, Sep 8, 2018 at 9:20 PM John Cowan <cowan_at_ccil.org> wrote:
> This paper makes the default assumption that the internal storage of a
> string is a featureless array. If this assumption is abandoned, it is
> possible to get O(1) indexes with fairly low space overhead. The Scheme
> language has recently adopted immutable strings called "texts" as a
> supplement to its pre-existing mutable strings, and the sample
> implementation for this feature uses a vector of either native strings or
> bytevectors (char[] vectors in C/Java terms). I would urge anyone
> interested in the question of storing and accessing mutable strings to read
> the following parts of SRFI 135 at <
> https://srfi.schemers.org/srfi-135/srfi-135.html>: Abstract, Rationale,
> Specification / Basic concepts, and Implementation. In addition, the
> design notes at <https://github.com/larcenists/larceny/wiki/ImmutableTexts>,
> though not up to date (in particular, UTF-16 internals are now allowed as
> an alternative to UTF-8), are of interest: unfortunately, the link to the
> span API has rotted.
>
> On Sat, Sep 8, 2018 at 12:53 PM Mark Davis ☕️ via Unicore <
> unicore_at_unicode.org> wrote:
>
>> I recently did some extensive revisions of a paper on Unicode string
>> models (APIs). Comments are welcome.
>>
>>
>> https://docs.google.com/document/d/1wuzzMOvKOJw93SWZAqoim1VUl9mloUxE0W6Ki_G23tw/edit#
>>
>> Mark
>>
>
Received on Tue Oct 02 2018 - 07:05:03 CDT
This archive was generated by hypermail 2.2.0 : Tue Oct 02 2018 - 07:05:04 CDT