/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/count/ |
H A D | 1.cc | 33 Container con(array, array); 34 VERIFY(std::count(con.begin(), con.end(), 1) == 0); 40 Container con(array, array + 1); 41 VERIFY(std::count(con.begin(), con.end(), 1) == 0); 47 Container con(array, array + 6); 48 VERIFY(std::count(con.begin(), con.end(), 1) == 2);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/nth_element/ |
H A D | 1.cc | 35 Container con(array, array); 36 partial_sort(con.begin(), con.begin(), con.end()); 43 Container con(array, array + 2); 44 partial_sort(con.begin(), con.begin(), con.end()); 45 partial_sort(con.begin(), con [all...] |
H A D | random_test.cc | 38 void operator()(Container con, RandomGen& rg) argument 42 const int size = con.end() - con.begin(); 46 std::nth_element(con.begin(), con.begin() + element, con.end()); 51 VERIFY( con.val(i) <= con.val(element) ); 54 VERIFY( con.val(i) >= con [all...] |
H A D | 58800.cc | 44 Container con(v.data(), v.data() + 7); 46 std::nth_element(con.begin(), con.begin() + 3, con.end());
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/max_element/ |
H A D | 1.cc | 36 Container con(array, array); 37 VERIFY(max_element(con.begin(), con.end()).ptr == array); 44 Container con(array, array + 1); 45 VERIFY(max_element(con.begin(), con.end()).ptr == array); 52 Container con(array, array + 2); 53 VERIFY(max_element(con.begin(), con.end()).ptr == array); 60 Container con(arra [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/min_element/ |
H A D | 1.cc | 36 Container con(array, array); 37 VERIFY(min_element(con.begin(), con.end()).ptr == array); 44 Container con(array, array + 1); 45 VERIFY(min_element(con.begin(), con.end()).ptr == array); 52 Container con(array, array + 2); 53 VERIFY(min_element(con.begin(), con.end()).ptr == array); 60 Container con(arra [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/adjacent_find/ |
H A D | 1.cc | 34 Container con(array, array); 35 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array); 41 Container con(array, array + 1); 42 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array + 1); 48 Container con(array, array + 2); 49 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array); 55 Container con(arra [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/binary_search/ |
H A D | 1.cc | 34 Container con(array, array); 35 VERIFY(!binary_search(con.begin(), con.end(), 1)); 42 Container con(array, array + 5); 44 VERIFY(binary_search(con.begin(), con.end(), i)); 46 VERIFY(!binary_search(con.begin(), con.end(), i));
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/remove/ |
H A D | 1.cc | 33 Container con(array, array); 34 VERIFY(std::remove(con.begin(), con.end(), 1).ptr == array); 41 Container con(array, array + 1); 42 VERIFY(std::remove(con.begin(), con.end(), 0).ptr == array + 1); 43 VERIFY(std::remove(con.begin(), con.end(), 1).ptr == array); 50 Container con(array, array + 8); 51 VERIFY(std::remove(con [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/equal_range/ |
H A D | 1.cc | 38 Container con(array + i, array + j); 39 VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr == 41 VERIFY(equal_range(con.begin(), con.end(), 1).second.ptr == 50 Container con(array, array + 5); 51 VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr == 53 VERIFY(equal_range(con.begin(), con [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partial_sort/ |
H A D | random_test.cc | 38 void operator()(Container con, RandomGen& rg) argument 42 const int size = con.end() - con.begin(); 46 std::partial_sort(con.begin(), con.begin() + element, con.end()); 48 VERIFY( std::is_sorted(con.begin(), con.begin() + element) ); 53 VERIFY( con.val(element - 1) <= con [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partition_point/ |
H A D | 1.cc | 41 Container con(array, array); 44 std::partition_point(con.begin(), con.end(), predicate); 46 VERIFY( std::all_of(con.begin(), mid, predicate) ); 47 VERIFY( std::none_of(mid, con.end(), predicate) ); 55 Container con(array, array + 1); 58 std::partition_point(con.begin(), con.end(), predicate); 60 VERIFY( std::all_of(con.begin(), mid, predicate) ); 61 VERIFY( std::none_of(mid, con [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/all_of/ |
H A D | 1.cc | 41 Container con(array, array); 42 VERIFY( std::all_of(con.begin(), con.end(), predicate) ); 50 Container con(array, array + 1); 51 VERIFY( std::all_of(con.begin(), con.end(), predicate) ); 59 Container con(array, array + 6); 60 VERIFY( !std::all_of(con.begin(), con.end(), predicate) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/any_of/ |
H A D | 1.cc | 41 Container con(array, array); 42 VERIFY( !std::any_of(con.begin(), con.end(), predicate) ); 50 Container con(array, array + 1); 51 VERIFY( !std::any_of(con.begin(), con.end(), predicate) ); 59 Container con(array, array + 6); 60 VERIFY( std::any_of(con.begin(), con.end(), predicate) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/count_if/ |
H A D | 1.cc | 37 Container con(array, array); 38 VERIFY(std::count_if(con.begin(), con.end(), 45 Container con(array, array + 1); 46 VERIFY(std::count_if(con.begin(), con.end(), 53 Container con(array, array + 6); 54 VERIFY(std::count_if(con.begin(), con.end(),
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find/ |
H A D | 1.cc | 33 Container con(array, array); 34 VERIFY(std::find(con.begin(), con.end(), 1).ptr == array); 40 Container con(array, array + 1); 41 VERIFY(std::find(con.begin(), con.end(), 1).ptr == array + 1); 47 Container con(array, array + 6); 48 VERIFY(std::find(con.begin(), con.end(), 1).ptr == array + 3);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_if/ |
H A D | 1.cc | 39 Container con(array, array); 40 VERIFY( std::find_if(con.begin(), con.end(), 49 Container con(array, array + 1); 50 VERIFY( std::find_if(con.begin(), con.end(), 59 Container con(array, array + 6); 60 VERIFY( std::find_if(con.begin(), con.end(),
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_if_not/ |
H A D | 1.cc | 41 Container con(array, array); 42 VERIFY( std::find_if_not(con.begin(), con.end(), 51 Container con(array, array + 1); 52 VERIFY( std::find_if_not(con.begin(), con.end(), 61 Container con(array, array + 6); 62 VERIFY( std::find_if_not(con.begin(), con.end(),
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/replace_if/ |
H A D | 1.cc | 37 Container con(array, array); 38 std::replace_if(con.begin(), con.end(), predicate, 1); 44 Container con(array, array + 1); 45 std::replace_if(con.begin(), con.end(), predicate, 2); 52 Container con(array, array + 6); 53 std::replace_if(con.begin(), con.end(), predicate, 3);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/none_of/ |
H A D | 1.cc | 41 Container con(array, array); 42 VERIFY( std::none_of(con.begin(), con.end(), predicate) ); 50 Container con(array, array + 1); 51 VERIFY( std::none_of(con.begin(), con.end(), predicate) ); 59 Container con(array, array + 6); 60 VERIFY( !std::none_of(con.begin(), con.end(), predicate) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/replace/ |
H A D | 1.cc | 33 Container con(array, array); 34 std::replace(con.begin(), con.end(), 1, 1); 40 Container con(array, array + 1); 41 std::replace(con.begin(), con.end(), 0, 1); 48 Container con(array, array + 6); 49 std::replace(con.begin(), con.end(), 1, 2);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/is_heap/ |
H A D | 1.cc | 33 container con(array, array + i); 34 std::make_heap(con.begin(), con.end()); 35 VERIFY(std::__is_heap(con.begin(), con.end())); 36 VERIFY(std::__is_heap(con.begin(), i));
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/is_partitioned/ |
H A D | 1.cc | 41 Container con(array, array); 42 VERIFY( std::is_partitioned(con.begin(), con.end(), predicate) ); 50 Container con(array, array + 1); 51 VERIFY( std::is_partitioned(con.begin(), con.end(), predicate) ); 59 Container con(array, array + 8); 60 VERIFY( !std::is_partitioned(con.begin(), con.end(), predicate) ); 68 Container con(arra [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/next_permutation/ |
H A D | 1.cc | 36 Container con(array, array); 37 VERIFY(!next_permutation(con.begin(), con.end())); 44 Container con(array, array + 1); 45 VERIFY(!next_permutation(con.begin(), con.end())); 52 Container con(array, array + 2); 53 VERIFY(next_permutation(con.begin(), con.end())); 55 VERIFY(!next_permutation(con [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/prev_permutation/ |
H A D | 1.cc | 36 Container con(array, array); 37 VERIFY(!prev_permutation(con.begin(), con.end())); 44 Container con(array, array + 1); 45 VERIFY(!prev_permutation(con.begin(), con.end())); 52 Container con(array, array + 2); 53 VERIFY(prev_permutation(con.begin(), con.end())); 55 VERIFY(!prev_permutation(con [all...] |