Searched refs:kSEARCH_COUNT (Results 1 – 2 of 2) sorted by relevance
| /external/skqp/tests/ |
| D | UtilsTest.cpp | 119 #define kSEARCH_COUNT 91 macro
122 int i, array[kSEARCH_COUNT]; in test_search()
125 for (i = 0; i < kSEARCH_COUNT; i++) { in test_search()
129 SkTHeapSort<int>(array, kSEARCH_COUNT); in test_search()
131 for (i = 1; i < kSEARCH_COUNT; i++) { in test_search()
136 for (i = 0; i < kSEARCH_COUNT; i++) { in test_search()
137 int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int)); in test_search()
145 int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int)); in test_search()
149 index < kSEARCH_COUNT && array[index] == value); in test_search()
152 REPORTER_ASSERT(reporter, index <= kSEARCH_COUNT); in test_search()
[all …]
|
| /external/skia/tests/ |
| D | UtilsTest.cpp | 119 #define kSEARCH_COUNT 91 macro
122 int i, array[kSEARCH_COUNT]; in test_search()
125 for (i = 0; i < kSEARCH_COUNT; i++) { in test_search()
129 SkTHeapSort<int>(array, kSEARCH_COUNT); in test_search()
131 for (i = 1; i < kSEARCH_COUNT; i++) { in test_search()
136 for (i = 0; i < kSEARCH_COUNT; i++) { in test_search()
137 int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int)); in test_search()
145 int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int)); in test_search()
149 index < kSEARCH_COUNT && array[index] == value); in test_search()
152 REPORTER_ASSERT(reporter, index <= kSEARCH_COUNT); in test_search()
[all …]
|