walkero
/
harfbuzz
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Use linear search for small counts 

I see about 8% speedup with long strings with DejaVu Sans.
This commit is contained in:
Behdad Esfahbod 2012-06-09 00:50:40 -04:00
parent caf0412690
commit 99159e52a3
1 changed files with 14 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/hb-open-type-private.hh
View File

@ -698,12 +698,21 @@ struct SortedArrayOf : ArrayOf<Type> {
template <typename SearchType> template <typename SearchType>
inline int search (const SearchType &x) const { inline int search (const SearchType &x) const {
unsigned int count = this->len;
/* Linear search is *much* faster for small counts. */
if (likely (count < 32)) {
for (unsigned int i = 0; i < count; i++)
if (this->array[i].cmp (x) == 0)
return i;
return -1;
} else {
struct Cmp { struct Cmp {
static int cmp (const SearchType *a, const Type *b) { return b->cmp (*a); } static int cmp (const SearchType *a, const Type *b) { return b->cmp (*a); }
}; };
const Type *p = (const Type *) bsearch (&x, this->array, this->len, sizeof (this->array[0]), (hb_compare_func_t) Cmp::cmp); const Type *p = (const Type *) bsearch (&x, this->array, this->len, sizeof (this->array[0]), (hb_compare_func_t) Cmp::cmp);
return p ? p - this->array : -1; return p ? p - this->array : -1;
} }
}
}; };