> We than declare that GrayFontGlyphInfo[] contains glyphs in ascending > order, but with skipping permitted. First min(255, lastChar-firstChar) > glyphs has to be continuous, without skipping - this makes new fonts > compatible with older plucker, and older fonts will be usable with > new plucker too (if they do not exceed 256 characters). Plucker, when > drawing character N will first test if N<256. If yes, it will read > GrayFontGlyphInfo directly from corresponding slot of > GrayFontGlyphInfo[] array. If N>=256, GrayFontGlyphInfo will be binary > searched in the rest of the array.
I'd like to see some benchmark data on how fast things work with the binary search, or whether speed requires a resource with a translation table. Of course, one doesn't need the binary search for the first 256 characters, so that's a nice optimization one can do. One can also tweak the binary search to optimize for contiguous ranges, the way the binary search in vfsfile.c is tweaked. Alex _______________________________________________ plucker-dev mailing list [EMAIL PROTECTED] http://lists.rubberchicken.org/mailman/listinfo/plucker-dev
