http://www.reenigne.org/blog/lispy-composable-compiler/ Stuff I think about Sun, 22 Jan 2012 21:39:31 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://www.reenigne.org/blog/lispy-composable-compiler/comment-page-1/#comment-1442 Reenigne blog » Blog Archive » String storage Sun, 17 Aug 2008 23:01:09 +0000 http://www.reenigne.org/blog/?p=514#comment-1442 [...] An alternative that might work better (especially for something like a compiler) would be to do the concatenation lazily. Actual character data comes from just a few places (the input files which are kept in memory in their entirety, static character data, and program argument data). There are two subtypes of string - one consists of a pointer to the first character and an integer recording the number of characters in the string. The other subtype consists of a vector of strings which are to be concatenated together. Integers (and maybe also formatting information) could be kept in other subtypes. The resulting tree-like data structure has a lot in common with the one I described in Lispy composable compiler. [...] [...] An alternative that might work better (especially for something like a compiler) would be to do the concatenation lazily. Actual character data comes from just a few places (the input files which are kept in memory in their entirety, static character data, and program argument data). There are two subtypes of string - one consists of a pointer to the first character and an integer recording the number of characters in the string. The other subtype consists of a vector of strings which are to be concatenated together. Integers (and maybe also formatting information) could be kept in other subtypes. The resulting tree-like data structure has a lot in common with the one I described in Lispy composable compiler. [...]

]]>