projects / platform / upstream / libHarfBuzzSharp.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: e9f5c65) | patch
When matching second glyph of kerning pairs, use bsearch
authorBehdad Esfahbod <behdad@behdad.org>
Tue, 20 Jan 2015 01:00:31 +0000 (17:00 -0800)
committerBehdad Esfahbod <behdad@behdad.org>
Tue, 20 Jan 2015 01:00:31 +0000 (17:00 -0800)
commit67dfa8c7c2f2e9040a9c60c680f739ada4a35fb5
tree5cc51bff54a2589c84ff7db3cfca7a619df88b8etree | snapshot
parente9f5c65be027eb7759ab819e267e24dff3b017b6commit | diff
When matching second glyph of kerning pairs, use bsearch

Roboto has glyphs (like 'F') that have 200 kerning pairs.
Add a handcoded bsearch instead of previous linear search.

This doesn't show much speedup though, apparently we spend the
bulk of the time somewhere before here.
src/hb-ot-layout-gpos-table.hh diff | blob | history
Domain: Dotnet / API;