| /external/skqp/src/core/ |
| D | SkTSort.h | 197 template <typename T, typename C> void SkTQSort(T* left, T* right, C lessThan) { in SkTQSort() function
207 template <typename T> void SkTQSort(T* left, T* right) { in SkTQSort() function
208 SkTQSort(left, right, SkTCompareLT<T>()); in SkTQSort()
212 template <typename T> void SkTQSort(T** left, T** right) { in SkTQSort() function
213 SkTQSort(left, right, SkTPointerCompareLT<T>()); in SkTQSort()
|
| D | SkScan_DAAPath.cpp | 178 SkTQSort(list, list + count - 1, lessThan); in gen_alpha_deltas()
224 SkTQSort(list, list + count - 1, lessThan); in gen_alpha_deltas()
|
| D | SkTDPQueue.h | 114 SkTQSort<T>(fArray.begin(), fArray.end() - 1, LESS); in sort()
|
| D | SkCoverageDelta.h | 72 SkTQSort(fRows[y], fRows[y] + fCounts[y] - 1); in sort()
|
| /external/skia/src/core/ |
| D | SkTSort.h | 197 template <typename T, typename C> void SkTQSort(T* left, T* right, C lessThan) { in SkTQSort() function
207 template <typename T> void SkTQSort(T* left, T* right) { in SkTQSort() function
208 SkTQSort(left, right, SkTCompareLT<T>()); in SkTQSort()
212 template <typename T> void SkTQSort(T** left, T** right) { in SkTQSort() function
213 SkTQSort(left, right, SkTPointerCompareLT<T>()); in SkTQSort()
|
| D | SkScan_DAAPath.cpp | 178 SkTQSort(list, list + count - 1, lessThan); in gen_alpha_deltas()
224 SkTQSort(list, list + count - 1, lessThan); in gen_alpha_deltas()
|
| D | SkTDPQueue.h | 114 SkTQSort<T>(fArray.begin(), fArray.end() - 1, LESS); in sort()
|
| D | SkCoverageDelta.h | 72 SkTQSort(fRows[y], fRows[y] + fCounts[y] - 1); in sort()
|
| /external/skqp/src/gpu/vk/ |
| D | GrVkExtensions.cpp | 49 SkTQSort(&fExtensions.front(), &fExtensions.back(), cmp); in init()
57 SkTQSort(&fExtensions.front(), &fExtensions.back(), cmp); in init()
|
| /external/skia/src/gpu/vk/ |
| D | GrVkExtensions.cpp | 49 SkTQSort(&fExtensions.front(), &fExtensions.back(), cmp); in init()
57 SkTQSort(&fExtensions.front(), &fExtensions.back(), cmp); in init()
|
| /external/skqp/tests/ |
| D | SortTest.cpp | 59 SkTQSort<int>(workingArray, workingArray + count - 1); in DEF_TEST()
|
| D | RandomTest.cpp | 18 SkTQSort<double>(p, p + 31); in anderson_darling_test()
|
| /external/skia/tests/ |
| D | SortTest.cpp | 59 SkTQSort<int>(workingArray, workingArray + count - 1); in DEF_TEST()
|
| D | RandomTest.cpp | 18 SkTQSort<double>(p, p + 31); in anderson_darling_test()
|
| /external/skqp/tools/ |
| D | Stats.h | 50 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
|
| /external/skia/tools/ |
| D | Stats.h | 50 SkTQSort(sorted.get(), sorted.get() + n - 1); in Stats()
|
| /external/skqp/src/gpu/gl/ |
| D | GrGLExtensions.cpp | 115 SkTQSort(&fStrings.front(), &fStrings.back(), cmp); in init()
|
| /external/skia/src/gpu/gl/ |
| D | GrGLExtensions.cpp | 115 SkTQSort(&fStrings.front(), &fStrings.back(), cmp); in init()
|
| /external/skqp/tools/sk_app/ |
| D | CommandSet.cpp | 102 SkTQSort(fCommands.begin(), fCommands.end() - 1, in drawHelp()
|
| /external/skqp/bench/ |
| D | SortBench.cpp | 70 SkTQSort<int>(array, array + N - 1); in skqsort_sort()
|
| /external/skia/tools/sk_app/ |
| D | CommandSet.cpp | 102 SkTQSort(fCommands.begin(), fCommands.end() - 1, in drawHelp()
|
| /external/skia/bench/ |
| D | SortBench.cpp | 70 SkTQSort<int>(array, array + N - 1); in skqsort_sort()
|
| /external/skia/src/pathops/ |
| D | SkPathOpsCommon.cpp | 168 SkTQSort<SkOpContour>(list.begin(), list.end() - 1); in SortContourList()
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsCommon.cpp | 168 SkTQSort<SkOpContour>(list.begin(), list.end() - 1); in SortContourList()
|
| /external/skia/src/codec/ |
| D | SkIcoCodec.cpp | 108 SkTQSort(directoryEntries, &directoryEntries[numImages - 1], lessThan); in MakeFromStream()
|