Home | History | Annotate | Download | only in core

Lines Matching refs:LESS

34 // The most general form of SkTSearch takes an array of T and a key of type K. A functor, less, is
38 template <typename T, typename K, typename LESS>
39 int SkTSearch(const T base[], int count, const K& key, size_t elemSize, LESS& less)
55 if (less(*elem, key))
62 if (less(*elem, key)) {
65 } else if (less(key, *elem)) {
71 // Adapts a less-than function to a functor.
72 template <typename T, bool (LESS)(const T&, const T&)> struct SkTLessFunctionToFunctorAdaptor {
73 bool operator()(const T& a, const T& b) { return LESS(a, b); }
77 template <typename T, bool (LESS)(const T&, const T&)>
79 static SkTLessFunctionToFunctorAdaptor<T, LESS> functor;
96 template <typename T, bool (LESS)(const T&, const T&)> struct SkTLessFunctionToPtrFunctorAdaptor {
97 bool operator() (const T* t, const T* k) { return LESS(*t, *k); }
102 template <typename T, bool (LESS)(const T&, const T&)>
104 static SkTLessFunctionToPtrFunctorAdaptor<T, LESS> functor;