For Development HEAD DRAFTSearch (procedure/syntax/module):

2.2 Multibyte strings

Traditionally, a string is considered as a simple array of bytes. Programmers tend to imagine a string as a simple array of characters (though a character may occupy more than one byte). It’s not the case in Gauche.

Gauche supports multibyte string natively, which means characters are represented by variable number of bytes in a string. Gauche retains semantic compatibility of Scheme string, so such details can be hidden, but it’ll be helpful if you know a few points.

A string object keeps a type tag and a pointer to the storage of the string body. The storage of the body is managed in a sort of “copy-on-write” way—if you take substring, e.g. using directly by substring or using regular expression matcher, or even if you copy a string by copy-string, the underlying storage is shared (the “anchor” of the string is different, so the copied string is not eq? to the original string). The actual string is copied only if you destructively modify it.

Consequently the algorithm like pre-allocating a string by make-string and filling it with string-set! becomes extremely inefficient in Gauche. Don’t do it. (It doesn’t work with mulitbyte strings anyway). Sequential access of string is much more efficient using string ports (see String ports).

String search primitives such as string-scan (see String utilities) and regular expression matcher (see Regular expressions) can return a matched string directly, without using index access at all.

Conversions from other encoding scheme is provided as a special port. See gauche.charconv - Character Code Conversion, for details.

The way to specify the encoding of source programs will be explained in the next section.



For Development HEAD DRAFTSearch (procedure/syntax/module):
DRAFT