| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| D | is_heap_comp.pass.cpp | 24 assert(std::is_heap(i1, i1, std::greater<int>())); in test()
25 …assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<i… in test()
28 …assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<i… in test()
29 …assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<i… in test()
30 …assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<i… in test()
38 …assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<i… in test()
39 …assert(std::is_heap(i5, i5+3, std::greater<int>()) == (std::is_heap_until(i5, i5+3, std::greater<i… in test()
40 …assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<i… in test()
41 …assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<i… in test()
42 …assert(std::is_heap(i8, i8+3, std::greater<int>()) == (std::is_heap_until(i8, i8+3, std::greater<i… in test()
[all …]
|
| D | is_heap_until_comp.pass.cpp | 24 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1); in test()
25 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1); in test()
28 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2); in test()
29 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2); in test()
30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1); in test()
38 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3); in test()
39 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3); in test()
40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3); in test()
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3); in test()
42 assert(std::is_heap_until(i8, i8+3, std::greater<int>()) == i8+1); in test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_init_list_comp.pass.cpp | 23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
34 static_assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
[all …]
|
| D | max_init_list_comp.pass.cpp | 23 int i = std::max({2, 3, 1}, std::greater<int>()); in main()
25 i = std::max({2, 1, 3}, std::greater<int>()); in main()
27 i = std::max({3, 1, 2}, std::greater<int>()); in main()
29 i = std::max({3, 2, 1}, std::greater<int>()); in main()
31 i = std::max({1, 2, 3}, std::greater<int>()); in main()
33 i = std::max({1, 3, 2}, std::greater<int>()); in main()
37 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, ""); in main()
38 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, ""); in main()
39 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, ""); in main()
|
| D | min_init_list_comp.pass.cpp | 23 int i = std::min({2, 3, 1}, std::greater<int>()); in main()
25 i = std::min({2, 1, 3}, std::greater<int>()); in main()
27 i = std::min({3, 1, 2}, std::greater<int>()); in main()
29 i = std::min({3, 2, 1}, std::greater<int>()); in main()
31 i = std::min({1, 2, 3}, std::greater<int>()); in main()
33 i = std::min({1, 3, 2}, std::greater<int>()); in main()
37 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, ""); in main()
38 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, ""); in main()
39 static_assert(std::min({3, 2, 1}, std::greater<int>()) == 3, ""); in main()
|
| D | min_comp.pass.cpp | 33 test(x, y, std::greater<int>(), x); in main()
34 test(y, x, std::greater<int>(), y); in main()
39 test(x, y, std::greater<int>(), y); in main()
40 test(y, x, std::greater<int>(), y); in main()
45 test(x, y, std::greater<int>(), x); in main()
46 test(y, x, std::greater<int>(), x); in main()
52 static_assert(std::min(x, y, std::greater<int>()) == x, "" ); in main()
53 static_assert(std::min(y, x, std::greater<int>()) == x, "" ); in main()
|
| D | max_comp.pass.cpp | 33 test(x, y, std::greater<int>(), x); in main()
34 test(y, x, std::greater<int>(), y); in main()
39 test(x, y, std::greater<int>(), x); in main()
40 test(y, x, std::greater<int>(), x); in main()
45 test(x, y, std::greater<int>(), y); in main()
46 test(y, x, std::greater<int>(), y); in main()
52 static_assert(std::max(x, y, std::greater<int>()) == y, "" ); in main()
53 static_assert(std::max(y, x, std::greater<int>()) == y, "" ); in main()
|
| D | minmax_comp.pass.cpp | 36 test(x, y, std::greater<int>(), x, y); in main()
37 test(y, x, std::greater<int>(), y, x); in main()
42 test(x, y, std::greater<int>(), y, x); in main()
43 test(y, x, std::greater<int>(), y, x); in main()
48 test(x, y, std::greater<int>(), x, y); in main()
49 test(y, x, std::greater<int>(), x, y); in main()
57 constexpr auto p1 = std::minmax(x, y, std::greater<>()); in main()
60 constexpr auto p2 = std::minmax(y, x, std::greater<>()); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_comp.pass.cpp | 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
73 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
78 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); in test()
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
58 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
63 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); in test()
68 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
73 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
[all …]
|
| /ndk/tests/device/test-stlport/unit/ |
| D | heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
60 pop_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
62 pop_heap(numbers, numbers + 5, greater<int>()); in mkheap1()
64 pop_heap(numbers, numbers + 4, greater<int>()); in mkheap1()
66 pop_heap(numbers, numbers + 3, greater<int>()); in mkheap1()
68 pop_heap(numbers, numbers + 2, greater<int>()); in mkheap1()
97 make_heap(v.begin(), v.end(), greater<int>()); in pheap2()
100 push_heap(v.begin(), v.end(), greater<int>()); in pheap2()
102 sort_heap(v.begin(), v.end(), greater<int>()); in pheap2()
|
| D | bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); in bnegate1()
43 sort(array, array + 4, not2(greater<int>())); in bnegate2()
|
| D | perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
102 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
106 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
110 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
114 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
118 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
122 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
126 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
130 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
60 pop_heap(numbers, numbers + 6, greater<int>()); in mkheap1()
62 pop_heap(numbers, numbers + 5, greater<int>()); in mkheap1()
64 pop_heap(numbers, numbers + 4, greater<int>()); in mkheap1()
66 pop_heap(numbers, numbers + 3, greater<int>()); in mkheap1()
68 pop_heap(numbers, numbers + 2, greater<int>()); in mkheap1()
97 make_heap(v.begin(), v.end(), greater<int>()); in pheap2()
100 push_heap(v.begin(), v.end(), greater<int>()); in pheap2()
102 sort_heap(v.begin(), v.end(), greater<int>()); in pheap2()
|
| D | bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>())); in bnegate1()
43 sort(array, array + 4, not2(greater<int>())); in bnegate2()
|
| D | perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
102 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
106 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
110 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
114 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
118 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
122 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
126 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
130 prev_permutation(v1.begin(), v1.end(), greater<int>()); in prevprm2()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| D | equal_range_comp.pass.cpp | 29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); in test()
31 assert(std::greater<int>()(*j, value)); in test()
33 assert(!std::greater<int>()(*j, value)); in test()
35 assert(!std::greater<int>()(value, *j)); in test()
37 assert(std::greater<int>()(value, *j)); in test()
54 std::sort(v.begin(), v.end(), std::greater<int>()); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/comparisons/ |
| D | greater.pass.cpp | 20 typedef std::greater<int> F; in main()
27 typedef std::greater<> F2; in main()
37 constexpr bool foo = std::greater<int> () (36, 36); in main()
40 constexpr bool bar = std::greater<> () (36.0, 36); in main()
|
| D | transparent.pass.cpp | 48 static_assert ( !is_transparent<std::greater<int>>::value, "" ); in main()
49 static_assert ( !is_transparent<std::greater<std::string>>::value, "" ); in main()
50 static_assert ( is_transparent<std::greater<void>>::value, "" ); in main()
51 static_assert ( is_transparent<std::greater<>>::value, "" ); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| D | ctor_copy.pass.cpp | 31 std::priority_queue<int, std::vector<int>, std::greater<int> > qo(std::greater<int>(), v); in main()
32 std::priority_queue<int, std::vector<int>, std::greater<int> > q = qo; in main()
|
| D | assign_copy.pass.cpp | 31 std::priority_queue<int, std::vector<int>, std::greater<int> > qo(std::greater<int>(), v); in main()
32 std::priority_queue<int, std::vector<int>, std::greater<int> > q; in main()
|
| D | ctor_iter_iter_comp.pass.cpp | 23 std::priority_queue<int, std::vector<int>, std::greater<int> > in main()
24 q(a, an, std::greater<int>()); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| D | lower_bound_comp.pass.cpp | 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); in test()
30 assert(std::greater<int>()(*j, value)); in test()
32 assert(!std::greater<int>()(*j, value)); in test()
49 std::sort(v.begin(), v.end(), std::greater<int>()); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| D | upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
30 assert(!std::greater<int>()(value, *j)); in test()
32 assert(std::greater<int>()(value, *j)); in test()
49 std::sort(v.begin(), v.end(), std::greater<int>()); in test()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); in test()
41 std::pop_heap(ia, ia+i, std::greater<int>()); in test()
42 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); in test()
44 std::pop_heap(ia, ia, std::greater<int>()); in test()
|