| OLD | NEW |
| 1 | |
| 2 /* | 1 /* |
| 3 * Copyright 2006 The Android Open Source Project | 2 * Copyright 2006 The Android Open Source Project |
| 4 * | 3 * |
| 5 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
| 6 * found in the LICENSE file. | 5 * found in the LICENSE file. |
| 7 */ | 6 */ |
| 8 | 7 |
| 9 | 8 |
| 10 #ifndef SkTSort_DEFINED | 9 #ifndef SkTSort_DEFINED |
| 11 #define SkTSort_DEFINED | 10 #define SkTSort_DEFINED |
| (...skipping 189 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 201 template <typename T> void SkTQSort(T* left, T* right) { | 200 template <typename T> void SkTQSort(T* left, T* right) { |
| 202 SkTQSort(left, right, SkTCompareLT<T>()); | 201 SkTQSort(left, right, SkTCompareLT<T>()); |
| 203 } | 202 } |
| 204 | 203 |
| 205 /** Sorts the region from left to right using comparator '* < *' using a Quick S
ort algorithm. */ | 204 /** Sorts the region from left to right using comparator '* < *' using a Quick S
ort algorithm. */ |
| 206 template <typename T> void SkTQSort(T** left, T** right) { | 205 template <typename T> void SkTQSort(T** left, T** right) { |
| 207 SkTQSort(left, right, SkTPointerCompareLT<T>()); | 206 SkTQSort(left, right, SkTPointerCompareLT<T>()); |
| 208 } | 207 } |
| 209 | 208 |
| 210 #endif | 209 #endif |
| OLD | NEW |