Dnia 05-11-2007, Pn o godzinie 16:23 +0100, Tomasz Sterna pisze: > Alternatively we could invent binary-2-utf mapping which has less > overhead than BASE64.
Simplest that comes to mind: Let's take first 256 allowable UTF-8 characters and assign them to 256 values of a single byte. That would be less than 33% BASE64 overhead. But I'm sure one of the more knowledgeable in the UTF internals would come up with better mapping. -- /\_./o__ Tomasz Sterna (/^/(_^^' Xiaoka.com ._.(_.)_ XMPP: [EMAIL PROTECTED]
