kc3-lang/freetype/src/bdf

Branch : - branch - master v2.13 - tag -

• Show log

  Commit

• Author : Alexei Podtelezhnikov
  Date : 2022-11-06 13:12:47
  Hash : 6139f2b6
  Message : [bdf, pfr, psnames] Accelarate charmap searches. The binary searches within charmaps can be accelerated because they often contain dense continuous blocks of character codes. Within such blocks, you can predict matches based on misses. This method has been deployed in `bdf` since 0f122fef34; we only refactor it there. We now use it in `pfr` and `psnames`, which speeds up the unicode charmap access by about 50% in PFR and Type 1 fonts. * src/bdf/bdfdrivr.c (bdf_cmap_char_{index,next}): Refactor. * src/pfr/pfrcmap.c (pfr_cmap_char_{index,next}): Predict `mid` based on the mismatch distance. * src/psnames/psmodule.c (ps_unicodes_char_{index,next}): Ditto.

• Files
• README
• bdf.c
• bdf.h
• bdfdrivr.c
• bdfdrivr.h
• bdferror.h
• bdflib.c
• module.mk
• rules.mk