H A D | algorithm_tests.cpp | 146 int values[] = { 1, 3, 7, -2, 5, 7 }; local 147 constexpr size_t count = fbl::count_of(values); 148 int* first = values; 149 int* last = values + count; 150 EXPECT_EQ(fbl::max_element(first, last), values + 2); local 167 int values[] = { 1, 3, 7, -2, 5, 7 }; local 168 constexpr size_t count = fbl::count_of(values); 169 int* first = values; 170 int* last = values + count; 171 EXPECT_EQ(fbl::max_element(first, last, max_compare), values local 184 int values[] = { 1, 3, -7, -2, 5, -7 }; local 188 EXPECT_EQ(fbl::min_element(first, last), values + 2); local 205 int values[] = { 1, 3, -7, -2, 5, -7 }; local 209 EXPECT_EQ(fbl::min_element(first, last, min_compare), values + 2); local 230 int values[count] = { 1, 3, 5, 7 }; local 275 int values[count] = { 1, 3, 5, 7 }; local 398 int values[] = { 9, 11, 8, 12 }; local 420 int values[] = { 9, 11, 8, 12 }; local [all...] |