| /external/stlport/test/unit/ |
| 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);
|
| /frameworks/base/libs/hwui/ |
| Stencil.h | 71 void enableDebugTest(GLint value, bool greater = false);
|
| Stencil.cpp | 80 void Stencil::enableDebugTest(GLint value, bool greater) {
82 glStencilFunc(greater ? GL_LESS : GL_EQUAL, value, 0xffffffff);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.merge/ |
| inplace_merge_comp.pass.cpp | 44 std::sort(ia, ia+M, std::greater<int>());
45 std::sort(ia+M, ia+N, std::greater<int>());
46 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::greater<int>());
51 assert(std::is_sorted(ia, ia+N, std::greater<int>()));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.ops/ |
| merge_pred.pass.cpp | 29 c1.merge(c2, std::greater<T>());
|
| sort_pred.pass.cpp | 31 c.sort(std::greater<T>());
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| 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/ |
| 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/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.binary.search/binary.search/ |
| binary_search_comp.pass.cpp | 29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
46 std::sort(v.begin(), v.end(), std::greater<int>());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>());
39 assert(std::is_heap(ia, ia+N, std::greater<int>()));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| push_heap_comp.pass.cpp | 41 std::push_heap(ia, ia+i, std::greater<int>());
42 assert(std::is_heap(ia, ia+i, std::greater<int>()));
|
| /external/clang/lib/Parse/ |
| ParseTemplate.cpp | 303 if (!Tok.is(tok::greater) && !Tok.is(tok::greatergreater))
312 Tok.setKind(tok::greater);
315 } else if (Tok.is(tok::greater))
342 SkipUntil(tok::comma, tok::greater, tok::greatergreater, true, true);
348 } else if (Tok.is(tok::greater) || Tok.is(tok::greatergreater)) {
356 SkipUntil(tok::comma, tok::greater, tok::greatergreater, true, true);
372 case tok::greater:
389 case tok::greater:
416 case tok::greater:
491 Tok.is(tok::greater) || Tok.is(tok::greatergreater))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation_comp.pass.cpp | 38 typedef std::greater<int> C;
|
| prev_permutation_comp.pass.cpp | 38 typedef std::greater<int> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.min.max/ |
| minmax_element_comp.pass.cpp | 27 typedef std::greater<int> Compare;
73 typedef std::greater<int> Compare;
|
| /prebuilts/gcc/linux-x86/host/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)
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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)
|
