baa14e1814
Currently: - Initializing skippy is very expensive, - Our lookup accelerator (using set-digests) can be very ineffecite, As such, we end up many times initializing skippy but then failing coverage check. Reordering fixes that. When, later, we fix our accelerator to have truly small false-positive rate (for example by using the frozen-sets), then we might want to reorder these checks such that we wouldn't calculate coverage number if skippy is going to fail. This shows a 5% speedup with Roboto already. |
||
---|---|---|
docs | ||
m4 | ||
src | ||
test | ||
util | ||
.travis.yml | ||
Android.mk | ||
AUTHORS | ||
autogen.sh | ||
configure.ac | ||
COPYING | ||
git.mk | ||
harfbuzz.doap | ||
Makefile.am | ||
NEWS | ||
README | ||
README.md | ||
README.python | ||
THANKS | ||
TODO |
This is HarfBuzz, a text shaping library.
For bug reports, mailing list, and other information please visit:
For license information, see the file COPYING.