Searched refs:SkTHeapSort (Results 1 – 8 of 8) sorted by relevance
/external/chromium_org/third_party/skia/src/core/ |
D | SkTSort.h | 102 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) { in SkTHeapSort() function 114 template <typename T> void SkTHeapSort(T array[], size_t count) { in SkTHeapSort() function 115 SkTHeapSort(array, count, SkTCompareLT<T>()); in SkTHeapSort() 171 SkTHeapSort<T>(left, right - left + 1, lessThan); in SkTIntroSort()
|
/external/skia/src/core/ |
D | SkTSort.h | 102 template <typename T, typename C> void SkTHeapSort(T array[], size_t count, C lessThan) { in SkTHeapSort() function 114 template <typename T> void SkTHeapSort(T array[], size_t count) { in SkTHeapSort() function 115 SkTHeapSort(array, count, SkTCompareLT<T>()); in SkTHeapSort() 171 SkTHeapSort<T>(left, right - left + 1, lessThan); in SkTIntroSort()
|
/external/skia/tests/ |
D | SortTest.cpp | 53 SkTHeapSort<int>(workingArray, count); in DEF_TEST()
|
D | UtilsTest.cpp | 130 SkTHeapSort<int>(array, kSEARCH_COUNT); in test_search()
|
/external/chromium_org/third_party/skia/tests/ |
D | SortTest.cpp | 53 SkTHeapSort<int>(workingArray, count); in DEF_TEST()
|
D | UtilsTest.cpp | 130 SkTHeapSort<int>(array, kSEARCH_COUNT); in test_search()
|
/external/skia/bench/ |
D | SortBench.cpp | 71 SkTHeapSort<int>(array, N); in skheap_sort()
|
/external/chromium_org/third_party/skia/bench/ |
D | SortBench.cpp | 71 SkTHeapSort<int>(array, N); in skheap_sort()
|