[
Lists Home |
Date Index |
Thread Index
]
Simon St.Laurent wrote:
> Surrogate pairs are very tricky critters that seem to me to require
> substantially more programming care than any other aspect of Unicode,
> and I suspect that developers will be cursing them for a long time to come.
When you are using a language that hard-codes "char" to mean "16 bits",
then yes.
> The testing I've been able to perform so far is pretty crude stuff. If
> anyone with more experience in Unicode or better tools for creating test
> documents has time to explore this work, I'd greatly appreciate it. As
> XML 1.0 parsers already perform some of this testing, creating tests
> that go outside of those bounds and reach gorille (not just the parser)
> is tricky.
IIRC, Aelfred (not Aelfred2) doesn't actually check these things.
A JAXP wrapper for it might be useful.
--
Not to perambulate || John Cowan <jcowan@reutershealth.com>
the corridors || http://www.reutershealth.com
during the hours of repose || http://www.ccil.org/~cowan
in the boots of ascension. \\ Sign in Austrian ski-resort hotel
|
