| commit | 161c7385477b9520fc4c63e3f09789d217c5cd67 | [log] [tgz] |
|---|---|---|
| author | Behdad Esfahbod <behdad@behdad.org> | Wed Sep 27 18:36:25 2017 -0400 |
| committer | Behdad Esfahbod <behdad@behdad.org> | Wed Sep 27 18:47:42 2017 -0400 |
| tree | 66b0e0774317d378fb664b9578ba08b3f75b4201 | |
| parent | 261464e0e2b0348187448fd86cde7d1e36124fc6 [diff] |
Use binary-search for finding name table entries VotoSerifGX has over 500 named instances, which means it also has over a thousand name table entries. So we were looking for names for over 500 pattern, looking for some thirty different name-ids, and using linear search across the 1000 entries! Makes scanning VotoSerifGX three times faster. The rest is probably the lang matching, which can also be shared across named-instances. Upcoming.