| /external/clang/test/SemaCXX/ |
| namespace.cpp | 75 struct greater {}; struct in namespace:PR6620::numeric::op
78 extern op::greater const greater;
84 op::greater const greater = op::greater(); member in class:PR6620::numeric::__anon5003::op
89 { numeric::greater(l, r); }
|
| /external/stlport/test/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| 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>() );
|
| lexcmp_test.cpp | 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>());
102 prev_permutation(v1.begin(), v1.end(), greater<int>());
106 prev_permutation(v1.begin(), v1.end(), greater<int>());
110 prev_permutation(v1.begin(), v1.end(), greater<int>());
114 prev_permutation(v1.begin(), v1.end(), greater<int>());
118 prev_permutation(v1.begin(), v1.end(), greater<int>());
122 prev_permutation(v1.begin(), v1.end(), greater<int>());
126 prev_permutation(v1.begin(), v1.end(), greater<int>());
130 prev_permutation(v1.begin(), v1.end(), greater<int>());
|
| bind_test.cpp | 76 replace_if(array, array + 3, binder2nd<greater<int> >(greater<int>(), 2), 4);
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| 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>() );
|
| lexcmp_test.cpp | 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>());
102 prev_permutation(v1.begin(), v1.end(), greater<int>());
106 prev_permutation(v1.begin(), v1.end(), greater<int>());
110 prev_permutation(v1.begin(), v1.end(), greater<int>());
114 prev_permutation(v1.begin(), v1.end(), greater<int>());
118 prev_permutation(v1.begin(), v1.end(), greater<int>());
122 prev_permutation(v1.begin(), v1.end(), greater<int>());
126 prev_permutation(v1.begin(), v1.end(), greater<int>());
130 prev_permutation(v1.begin(), v1.end(), greater<int>());
|
| bind_test.cpp | 76 replace_if(array, array + 3, binder2nd<greater<int> >(greater<int>(), 2), 4);
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
|
| /ndk/tests/device/test-stlport/unit/ |
| bnegate_test.cpp | 34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
43 sort(array, array + 4, not2(greater<int>()));
|
| 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>() );
|
| lexcmp_test.cpp | 46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
|
| perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>());
102 prev_permutation(v1.begin(), v1.end(), greater<int>());
106 prev_permutation(v1.begin(), v1.end(), greater<int>());
110 prev_permutation(v1.begin(), v1.end(), greater<int>());
114 prev_permutation(v1.begin(), v1.end(), greater<int>());
118 prev_permutation(v1.begin(), v1.end(), greater<int>());
122 prev_permutation(v1.begin(), v1.end(), greater<int>());
126 prev_permutation(v1.begin(), v1.end(), greater<int>());
130 prev_permutation(v1.begin(), v1.end(), greater<int>());
|
| bind_test.cpp | 76 replace_if(array, array + 3, binder2nd<greater<int> >(greater<int>(), 2), 4);
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
|
| /external/astl/tests/ |
| test_functional.cpp | 45 EXPECT_TRUE(std::greater<int>()(10, 5));
|
| /prebuilt/linux-x86/toolchain/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)
|
| /prebuilt/ndk/android-ndk-r5/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)
|
| /prebuilt/ndk/android-ndk-r6/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)
|
| /external/astl/include/ |
| functional | 65 FUNCTIONAL_BINARY_COMPARAISON(greater, >)
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/bin_search_tree_/ |
| split_join_fn_imps.hpp | 57 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), PB_DS_V2F(other.m_p_head->m_p_left->m_value)); local
61 if (!greater && !lesser)
|
