Dear Suzuki > BTW, if the 64kByte array to check CID availability can be > reduced to a 64kBit (= 8kByte for most architecture) array > by a bitshift calculation, is it the way to go?
I agree that bitshift is too complicated. If the glyphs are sorted by CID, you might not need the temporary storage if you keep track of the previous CID and some format string tricks. I can work on that later by adopting the lines 676-707 (if the CIDs are sorted indeed). Thanks, Alexei
