| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.min.max/ |
| minmax_comp.pass.cpp | 35 test(x, y, std::greater<int>(), x, y);
36 test(y, x, std::greater<int>(), y, x);
41 test(x, y, std::greater<int>(), y, x);
42 test(y, x, std::greater<int>(), y, x);
47 test(x, y, std::greater<int>(), x, y);
48 test(y, x, std::greater<int>(), x, y);
|
| max_element_comp.pass.cpp | 27 Iter i = std::max_element(first, last, std::greater<int>());
31 assert(!std::greater<int>()(*i, *j));
|
| min_element_comp.pass.cpp | 27 Iter i = std::min_element(first, last, std::greater<int>());
31 assert(!std::greater<int>()(*j, *i));
|
| /external/stlport/test/unit/ |
| heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>());
60 pop_heap(numbers, numbers + 6, greater<int>());
62 pop_heap(numbers, numbers + 5, greater<int>());
64 pop_heap(numbers, numbers + 4, greater<int>());
66 pop_heap(numbers, numbers + 3, greater<int>());
68 pop_heap(numbers, numbers + 2, greater<int>());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| greater_test.cpp | 34 sort(array, array + 4, greater<int>() );
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>());
60 pop_heap(numbers, numbers + 6, greater<int>());
62 pop_heap(numbers, numbers + 5, greater<int>());
64 pop_heap(numbers, numbers + 4, greater<int>());
66 pop_heap(numbers, numbers + 3, greater<int>());
68 pop_heap(numbers, numbers + 2, greater<int>());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| /ndk/tests/device/test-stlport/unit/ |
| heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>());
60 pop_heap(numbers, numbers + 6, greater<int>());
62 pop_heap(numbers, numbers + 5, greater<int>());
64 pop_heap(numbers, numbers + 4, greater<int>());
66 pop_heap(numbers, numbers + 3, greater<int>());
68 pop_heap(numbers, numbers + 2, greater<int>());
97 make_heap(v.begin(), v.end(), greater<int>());
100 push_heap(v.begin(), v.end(), greater<int>());
102 sort_heap(v.begin(), v.end(), greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range_comp.pass.cpp | 29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>());
31 assert(std::greater<int>()(*j, value));
33 assert(!std::greater<int>()(*j, value));
35 assert(!std::greater<int>()(value, *j));
37 assert(std::greater<int>()(value, *j));
54 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound_comp.pass.cpp | 28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
30 assert(std::greater<int>()(*j, value));
32 assert(!std::greater<int>()(*j, value));
49 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
| upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
30 assert(!std::greater<int>()(value, *j));
32 assert(std::greater<int>()(value, *j));
49 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>());
41 std::pop_heap(ia, ia+i, std::greater<int>());
42 assert(std::is_heap(ia, ia+i-1, std::greater<int>()));
44 std::pop_heap(ia, ia, std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
| sort_comp.pass.cpp | 23 c1.sort(std::greater<int>());
|
| merge_comp.pass.cpp | 25 c1.merge(c2, std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/function.objects/comparisons/ |
| greater.pass.cpp | 12 // greater
20 typedef std::greater<int> F;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| sort_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>());
39 std::sort_heap(ia, ia+N, std::greater<int>());
40 assert(std::is_sorted(ia, ia+N, std::greater<int>()));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 109 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
115 if (!greater && !lesser)
120 if (greater)
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/ov_tree_map_/ |
| split_join_fn_imps.hpp | 113 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(*(end() - 1)), local
119 if (!greater && !lesser)
124 if (greater)
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 101 std::greater<Scalar> greater; local
102 return selectComplexRoot_withRespectToNorm( greater );
213 std::greater<Scalar> greater; local
214 return selectRealRoot_withRespectToAbsRealPart( greater, hasArealRoot, absImaginaryThreshold );
259 std::greater<Scalar> greater; local
260 return selectRealRoot_withRespectToRealPart( greater, hasArealRoot, absImaginaryThreshold );
|
