Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:greater (Results 1 - 25 of 187) sorted by null

1 2 3 4 5 6 7 8

/external/libcxx/test/algorithms/alg.sorting/alg.min.max/
max_init_list_comp.pass.cpp	23 int i = std::max({2, 3, 1}, std::greater<int>()); 25 i = std::max({2, 1, 3}, std::greater<int>()); 27 i = std::max({3, 1, 2}, std::greater<int>()); 29 i = std::max({3, 2, 1}, std::greater<int>()); 31 i = std::max({1, 2, 3}, std::greater<int>()); 33 i = std::max({1, 3, 2}, std::greater<int>()); 37 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, ""); 38 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, ""); 39 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, "");
min_init_list_comp.pass.cpp	23 int i = std::min({2, 3, 1}, std::greater<int>()); 25 i = std::min({2, 1, 3}, std::greater<int>()); 27 i = std::min({3, 1, 2}, std::greater<int>()); 29 i = std::min({3, 2, 1}, std::greater<int>()); 31 i = std::min({1, 2, 3}, std::greater<int>()); 33 i = std::min({1, 3, 2}, std::greater<int>()); 37 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, ""); 38 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, ""); 39 static_assert(std::min({3, 2, 1}, std::greater<int>()) == 3, "");
minmax_init_list_comp.pass.cpp	23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); 32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); 33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); 34 static_assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")     [all...]
max_comp.pass.cpp	33 test(x, y, std::greater<int>(), x); 34 test(y, x, std::greater<int>(), y); 39 test(x, y, std::greater<int>(), x); 40 test(y, x, std::greater<int>(), x); 45 test(x, y, std::greater<int>(), y); 46 test(y, x, std::greater<int>(), y); 52 static_assert(std::max(x, y, std::greater<int>()) == y, "" ); 53 static_assert(std::max(y, x, std::greater<int>()) == y, "" );
min_comp.pass.cpp	33 test(x, y, std::greater<int>(), x); 34 test(y, x, std::greater<int>(), y); 39 test(x, y, std::greater<int>(), y); 40 test(y, x, std::greater<int>(), y); 45 test(x, y, std::greater<int>(), x); 46 test(y, x, std::greater<int>(), x); 52 static_assert(std::min(x, y, std::greater<int>()) == x, "" ); 53 static_assert(std::min(y, x, std::greater<int>()) == x, "" );
minmax_comp.pass.cpp	36 test(x, y, std::greater<int>(), x, y); 37 test(y, x, std::greater<int>(), y, x); 42 test(x, y, std::greater<int>(), y, x); 43 test(y, x, std::greater<int>(), y, x); 48 test(x, y, std::greater<int>(), x, y); 49 test(y, x, std::greater<int>(), x, y); 57 constexpr auto p1 = std::minmax(x, y, std::greater<>()); 60 constexpr auto p2 = std::minmax(y, x, std::greater<>());
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/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap_comp.pass.cpp	24 assert(std::is_heap(i1, i1, std::greater<int>())); 25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1)); 28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2)); 29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2)); 30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2)); 38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3))     [all...]
is_heap_until_comp.pass.cpp	24 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1); 25 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1); 28 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2); 29 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2); 30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1); 38 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3); 39 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3); 40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3); 41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3); 42 assert(std::is_heap_until(i8, i8+3, std::greater<int>()) == i8+1)     [all...]
/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::__anon23969::op 89 { numeric::greater(l, r); }
/external/libcxx/test/utilities/function.objects/comparisons/
greater.pass.cpp	12 // greater 20 typedef std::greater<int> F; 27 typedef std::greater<> F2; 37 constexpr bool foo = std::greater<int> () (36, 36); 40 constexpr bool bar = std::greater<> () (36.0, 36);
/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/
ctor_iter_iter_comp.pass.cpp	23 std::priority_queue<int, std::vector<int>, std::greater<int> > 24 q(a, an, std::greater<int>());
assign_copy.pass.cpp	31 std::priority_queue<int, std::vector<int>, std::greater<int> > qo(std::greater<int>(), v); 32 std::priority_queue<int, std::vector<int>, std::greater<int> > q;
ctor_copy.pass.cpp	31 std::priority_queue<int, std::vector<int>, std::greater<int> > qo(std::greater<int>(), v); 32 std::priority_queue<int, std::vector<int>, std::greater<int> > q = qo;
ctor_comp_container.pass.cpp	31 std::priority_queue<int, std::vector<int>, std::greater<int> > q(std::greater<int>(), v);
/external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/
is_sorted_until_comp.pass.cpp	30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 58 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 63 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); 68 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 73 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1))     [all...]
is_sorted_comp.pass.cpp	31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 73 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 78 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>()))     [all...]
/external/chromium_org/v8/test/mjsunit/
compare-objects.js	49 function test(a, b, less, greater) { 58 assertEquals(gt(a, b), greater); 59 assertEquals(lt(b, a), greater); 67 var greater = obj1 > obj2; variable 69 test(obj1, obj2, less, greater); 70 test(obj1, obj2, less, greater); 71 test(obj1, obj2, less, greater); 73 test(obj1, obj2, less, greater); 74 test(obj1, obj2, less, greater); 77 test(obj1, obj2, less, greater); 86 var greater = obj1 > obj2; variable 97 var greater = obj1 > obj2; variable 104 var greater = false; variable     [all...]
/external/libcxx/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>());
/external/libcxx/test/containers/sequences/list/list.ops/
sort_comp.pass.cpp	26 c1.sort(std::greater<int>()); 34 c1.sort(std::greater<int>());
merge_comp.pass.cpp	28 c1.merge(c2, std::greater<int>()); 38 c1.merge(c2, std::greater<int>());
/external/libcxx/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>());
/external/libcxx/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>());
/external/libcxx/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>());

Completed in 301 milliseconds

1 2 3 4 5 6 7 8