[MLton] Unicode / WideChar

[Stephen Weeks]

> With regards to tables, I really am torn by this.  I agree that 1.1
> million bytes is a bit much.  I suspect though that it would still
> be the fastest method.  This is based on the fact that at least for
> English, almost all characters are ASCII, which means that only 128
> bytes has to be in the cache to get a VERY good hit rate.

Can't we do a single test against 128, use a table for 0..128, and
binary search above 128?