Searched refs:are_ordered (Results 1 - 5 of 5) sorted by relevance
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/inplace_merge/ |
H A D | moveable2.cc | 34 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) function 46 std::inplace_merge(con1.begin(), con1.it(3), con1.end(), are_ordered); 54 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered); 62 std::inplace_merge(con3.begin(), con3.it(3), con3.end(), are_ordered); 70 std::inplace_merge(con4.begin(), con4.it(4), con4.end(), are_ordered); 78 std::inplace_merge(con5.begin(), con5.it(2), con5.end(), are_ordered); 86 std::inplace_merge(con6.begin(), con6.it(0), con6.end(), are_ordered); 93 std::inplace_merge(con7.begin(), con7.it(2), con7.end(), are_ordered);
|
H A D | 49559.cc | 40 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) function 60 std::inplace_merge(con2.begin(), con2.it(4), con2.end(), are_ordered);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/next_permutation/ |
H A D | moveable.cc | 95 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) function 109 VERIFY( next_permutation(array, array + 6, are_ordered) ); 115 array, array + 6, are_ordered) ); 118 VERIFY( !next_permutation(array,array + 6, are_ordered) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/prev_permutation/ |
H A D | moveable.cc | 95 are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) function 109 VERIFY( prev_permutation(array, array + 6, are_ordered) ); 115 array, array + 6, are_ordered) ); 118 VERIFY( !prev_permutation(array,array + 6, are_ordered) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/heap/ |
H A D | moveable2.cc | 42 bool are_ordered(const rvalstruct& lhs, const rvalstruct& rhs) function 59 std::make_heap(makecon.begin(), makecon.end(), are_ordered); 63 VERIFY( std::__is_heap(makecon.begin(), makecon.end(), are_ordered) ); 79 std::pop_heap(popcon.begin(), popcon.end(), are_ordered); 83 VERIFY( (std::__is_heap(popheap, popheap + length - 1), are_ordered) ); 99 std::sort_heap(sortcon.begin(), sortcon.end(), are_ordered); 121 std::push_heap(pushcon.begin(), pushcon.end(), are_ordered);
|
Completed in 93 milliseconds