HomeSort by relevance Sort by last modified time
    Searched defs:SkTSearch (Results 1 - 2 of 2) sorted by null

  /external/skia/include/private/
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)
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) {
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) {
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) {
105 return SkTSearch(base, count, target, elemSize, functor)
    [all...]
  /external/skqp/include/private/
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)
78 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) {
80 return SkTSearch(base, count, target, elemSize, functor);
90 int SkTSearch(const T base[], int count, const T& target, size_t elemSize) {
92 return SkTSearch(base, count, target, elemSize, functor);
103 int SkTSearch(T* base[], int count, T* target, size_t elemSize) {
105 return SkTSearch(base, count, target, elemSize, functor)
    [all...]

Completed in 372 milliseconds