Searched defs:SkTSearch (Results 1 - 2 of 2) sorted by relevance
/external/skia/include/private/ |
H A D | SkTSearch.h | 16 * All of the SkTSearch variants want to return the index (0...N-1) of the 24 * int index = SkTSearch(...); 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) function 78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { function 80 return SkTSearch(base, count, target, elemSize, functor); 90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { function 92 return SkTSearch(base, count, target, elemSize, functor); 103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { function 105 return SkTSearch(bas [all...] |
/external/skqp/include/private/ |
H A D | SkTSearch.h | 16 * All of the SkTSearch variants want to return the index (0...N-1) of the 24 * int index = SkTSearch(...); 34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is 39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less) function 78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { function 80 return SkTSearch(base, count, target, elemSize, functor); 90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) { function 92 return SkTSearch(base, count, target, elemSize, functor); 103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) { function 105 return SkTSearch(bas [all...] |
Completed in 1009 milliseconds