| /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);
|
| func_test.cpp | 71 sort(v.begin(), v.end(), greater<int>());
|
| inplace_test.cpp | 49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>());
|
| nthelm_test.cpp | 72 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end(), greater<int>());
|
| alg_test.cpp | 54 c = min('a', 'z', greater<char>());
56 i = max(4, 7, greater<int>());
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
|
| /ndk/sources/android/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);
|
| func_test.cpp | 71 sort(v.begin(), v.end(), greater<int>());
|
| inplace_test.cpp | 49 inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater<size_t>());
|
| nthelm_test.cpp | 72 nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end(), greater<int>());
|
| alg_test.cpp | 54 c = min('a', 'z', greater<char>());
56 i = max(4, 7, greater<int>());
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
|
| /external/astl/tests/ |
| test_functional.cpp | 45 EXPECT_TRUE(std::greater<int>()(10, 5));
|
| /external/astl/include/ |
| functional | 65 FUNCTIONAL_BINARY_COMPARAISON(greater, >)
|
| /dalvik/vm/mterp/x86-atom/ |
| OP_CMPL_FLOAT.S | 60 movl $$0x1, (rFP, rINST, 4) # vAA<- greater than
|
| OP_CMP_LONG.S | 54 movl $$0x1, (rFP, rINST, 4) # vAA<- greater than
|
| /external/webkit/JavaScriptCore/jit/ |
| ExecutableAllocatorFixedVMPool.cpp | 56 , greater(0)
70 FreeListEntry* greater; member in struct:JSC::FreeListEntry
84 handle get_greater(handle h) { return h->greater; }
85 void set_greater(handle h, handle gh) { h->greater = gh; }
|
