Searched refs:con (Results 1 - 25 of 145) sorted by relevance

123456

/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/count/
H A D1.cc33 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);
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/count/
H A D1.cc34 Container con(array, array);
35 VERIFY(std::count(con.begin(), con.end(), 1) == 0);
41 Container con(array, array + 1);
42 VERIFY(std::count(con.begin(), con.end(), 1) == 0);
48 Container con(array, array + 6);
49 VERIFY(std::count(con.begin(), con.end(), 1) == 2);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/nth_element/
H A D1.cc35 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...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/nth_element/
H A D1.cc35 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...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/adjacent_find/
H A D1.cc34 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...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/max_element/
H A D1.cc36 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...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/min_element/
H A D1.cc36 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...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/adjacent_find/
H A D1.cc35 Container con(array, array);
36 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array);
42 Container con(array, array + 1);
43 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array + 1);
49 Container con(array, array + 2);
50 VERIFY(adjacent_find(con.begin(), con.end()).ptr == array);
56 Container con(arra
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/max_element/
H A D1.cc37 Container con(array, array);
38 VERIFY(max_element(con.begin(), con.end()).ptr == array);
45 Container con(array, array + 1);
46 VERIFY(max_element(con.begin(), con.end()).ptr == array);
53 Container con(array, array + 2);
54 VERIFY(max_element(con.begin(), con.end()).ptr == array);
61 Container con(arra
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/min_element/
H A D1.cc37 Container con(array, array);
38 VERIFY(min_element(con.begin(), con.end()).ptr == array);
45 Container con(array, array + 1);
46 VERIFY(min_element(con.begin(), con.end()).ptr == array);
53 Container con(array, array + 2);
54 VERIFY(min_element(con.begin(), con.end()).ptr == array);
61 Container con(arra
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/binary_search/
H A D1.cc34 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));
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/binary_search/
H A D1.cc35 Container con(array, array);
36 VERIFY(!binary_search(con.begin(), con.end(), 1));
43 Container con(array, array + 5);
45 VERIFY(binary_search(con.begin(), con.end(), i));
47 VERIFY(!binary_search(con.begin(), con.end(), i));
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/remove/
H A D1.cc33 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...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/remove/
H A D1.cc34 Container con(array, array);
35 VERIFY(std::remove(con.begin(), con.end(), 1).ptr == array);
42 Container con(array, array + 1);
43 VERIFY(std::remove(con.begin(), con.end(), 0).ptr == array + 1);
44 VERIFY(std::remove(con.begin(), con.end(), 1).ptr == array);
51 Container con(array, array + 8);
52 VERIFY(std::remove(con
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/equal_range/
H A D1.cc38 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...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/25_algorithms/equal_range/
H A D1.cc39 Container con(array + i, array + j);
40 VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr ==
42 VERIFY(equal_range(con.begin(), con.end(), 1).second.ptr ==
51 Container con(array, array + 5);
52 VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr ==
54 VERIFY(equal_range(con.begin(), con
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/partition_point/
H A D1.cc41 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...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/all_of/
H A D1.cc41 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) );
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/any_of/
H A D1.cc41 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) );
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/count_if/
H A D1.cc37 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(),
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/find/
H A D1.cc33 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);
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/find_if/
H A D1.cc39 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(),
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/find_if_not/
H A D1.cc41 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(),
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/none_of/
H A D1.cc41 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) );
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/25_algorithms/replace/
H A D1.cc33 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);

Completed in 88 milliseconds

123456