On Wed, 2009-04-15 at 11:08 -0400, Marc Feeley wrote:
Are you talking about the Unicode character class tables? If I'm not mistaken Will Clinger wrote a fairly compact and fast implementation of those tables. The code must be in Larceny somewhere. I believe it is also part of the reference implementation for R6RS.
I'm just talking about manipulating general subsets of $0,...,2^{21}-1$ (which is what charsets are in unicode) efficiently without throwing around bit-vectors of length 256 kB.
Perhaps Clinger's code does this, I don't know.
Brad