/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | reduction.f90 | 7 logical :: equal(3) variable in program:reduction_mask 14 equal = (/ .true., .true., .false. /) 21 val( 4) = maxval((/ 1, 2, 3 /), equal) 22 val( 5) = maxval((/ 1, 2, 3 /), mask=equal) 23 val( 6) = maxval((/ 1, 2, 3 /), 1, equal) 24 val( 7) = maxval((/ 1, 2, 3 /), 1, mask=equal) 25 val( 8) = maxval((/ 1, 2, 3 /), dim=1, mask=equal) 26 val( 9) = maxval((/ 1, 2, 3 /), mask=equal, dim=1) 31 val(13) = minval((/ 1, 2, 3 /), equal) 32 val(14) = minval((/ 1, 2, 3 /), mask=equal) [all...] |
H A D | minmax_char_1.f90 | 18 if (.not. equal(min("foo", "bar"), "bar")) call abort 19 if (.not. equal(max("foo", "bar"), "foo")) call abort 20 if (.not. equal(min("bar", "foo"), "bar")) call abort 21 if (.not. equal(max("bar", "foo"), "foo")) call abort 23 if (.not. equal(min("bar", "foo", sp), "bar")) call abort 24 if (.not. equal(max("bar", "foo", sp), "gee")) call abort 25 if (.not. equal(min("bar", sp, "foo"), "bar")) call abort 26 if (.not. equal(max("bar", sp, "foo"), "gee")) call abort 27 if (.not. equal(min(sp, "bar", "foo"), "bar")) call abort 28 if (.not. equal(ma 66 pure function equal function in program:test 68 logical :: equal local in function:equal [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
H A D | pr57411.C | 18 test01 (int equal) argument 21 if (equal)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/other/ |
H A D | const3.C | 4 extern bool equal (int[], int[], const int[]); 5 extern bool equal (wchar_t[], wchar_t[], const wchar_t[]); 13 if (equal(i1, i1 + N1, A1)) 21 if (equal(i3, i3 + N3, A3))
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/copy_n/ |
H A D | 1.cc | 37 VERIFY( equal(i1, i1 + N, A) ); 41 VERIFY( equal(v1.begin(), v1.end(), A) ); 45 VERIFY( equal(s1, s1 + N, A) );
|
H A D | 3.cc | 39 VERIFY( equal(i1, i1 + N, a.begin()) ); 43 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 47 VERIFY( equal(s1, s1 + N, a.begin()) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/bool/capacity/ |
H A D | 1.cc | 86 VERIFY( std::equal(v.begin(), v.end(), A1) ); 90 VERIFY( std::equal(v.begin(), v.end(), A2) ); 94 VERIFY( std::equal(v.begin(), v.end(), A3) ); 98 VERIFY( std::equal(v.begin(), v.end(), A4) ); 102 VERIFY( std::equal(v.begin(), v.end(), A5) ); 106 VERIFY( std::equal(v.begin(), v.end(), A6) ); 110 VERIFY( std::equal(v.begin(), v.end(), A7) ); 114 VERIFY( std::equal(v.begin(), v.end(), A8) ); 118 VERIFY( std::equal(v.begin(), v.end(), A9) ); 122 VERIFY( std::equal( [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/cons/ |
H A D | 3.cc | 38 VERIFY(std::equal(v3.begin(), v3.end(), A)); 41 VERIFY(std::equal(v4.begin(), v4.end(), A)); 44 VERIFY(std::equal(v5.begin(), v5.end(), B)); 45 VERIFY(std::equal(B, B + M, v5.begin()));
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/ |
H A D | 55043.cc | 33 using equal = std::equal_to<int>; 36 using test_type = std::unordered_multimap<int, MoveOnly, hash, equal, Alloc>;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multiset/ |
H A D | 55043.cc | 32 struct equal { struct 40 using test_type = std::unordered_multiset<MoveOnly, hash, equal, Alloc>;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/ |
H A D | 55043.cc | 32 struct equal struct 47 using test_type = std::unordered_set<MoveOnly, hash, equal, Alloc>;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/equal/ |
H A D | check_type.cc | 18 // 25.1.8 [lib.alg.equal] 42 { return std::equal(lhs1, lhs1, rhs1); } 47 { return std::equal(lhs2, lhs2, rhs2, predicate); }
|
H A D | check_type2.cc | 18 // 25.2.11 [alg.equal] 43 { return std::equal(lhs1, lhs1, rhs1, rhs1); } 48 { return std::equal(lhs2, lhs2, rhs2, rhs2, predicate); }
|
H A D | 2.cc | 18 // 25.2.11 [alg.equal] 58 VERIFY( std::equal(c1.begin(), c1.end(), c2.begin(), c2.end()) ); 63 VERIFY( std::equal(c1.begin(), c1.end(), c2.begin(), c2.end(), eq) ); 74 VERIFY( !std::equal(c1.begin(), c1.end(), c2.begin(), c2.end()) ); 78 VERIFY( !std::equal(c1.begin(), c1.end(), c2.begin(), c2.end(), eq) ); 83 VERIFY( !std::equal(c2.begin(), c2.end(), c1.begin(), c1.end()) ); 87 VERIFY( !std::equal(c2.begin(), c2.end(), c1.begin(), c1.end(), eq) ); 98 VERIFY( !std::equal(c1.begin(), c1.end(), c2.begin(), c2.end()) ); 102 VERIFY( !std::equal(c1.begin(), c1.end(), c2.begin(), c2.end(), eq) ); 108 VERIFY( !std::equal(c [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/iota/ |
H A D | 1.cc | 37 VERIFY( std::equal(A, A + N, B) ); 40 VERIFY( std::equal(A, A + N, C) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/ |
H A D | 55043.cc | 33 using equal = std::equal_to<int>; 36 using test_type = std::unordered_map<int, MoveOnly, hash, equal, Alloc>;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/copy/ |
H A D | 4.cc | 37 VERIFY( equal(i1, i1 + N, a.begin()) ); 41 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 45 VERIFY( equal(s1, s1 + N, a.begin()) ); 49 VERIFY( equal(i2, i2 + N, a.begin()) ); 53 VERIFY( equal(v2.begin(), v2.end(), a.begin()) ); 57 VERIFY( equal(s2, s2 + N, a.begin()) );
|
H A D | 3.cc | 37 VERIFY( equal(i1, i1 + N, a.begin()) ); 41 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 45 VERIFY( equal(s1, s1 + N, a.begin()) ); 49 VERIFY( equal(i2, i2 + N, a.begin()) ); 53 VERIFY( equal(v2.begin(), v2.end(), a.begin()) ); 57 VERIFY( equal(s2, s2 + N, a.begin()) );
|
H A D | 2.cc | 36 VERIFY( equal(i1, i1 + N, a.begin()) ); 40 VERIFY( equal(v1.begin(), v1.end(), a.begin()) ); 44 VERIFY( equal(s1, s1 + N, a.begin()) ); 48 VERIFY( equal(i2, i2 + N, a.begin()) ); 52 VERIFY( equal(v2.begin(), v2.end(), a.begin()) ); 56 VERIFY( equal(s2, s2 + N, a.begin()) );
|
H A D | 1.cc | 35 VERIFY( equal(i1, i1 + N, A) ); 39 VERIFY( equal(v1.begin(), v1.end(), A) ); 43 VERIFY( equal(s1, s1 + N, A) ); 47 VERIFY( equal(i2, i2 + N, A) ); 51 VERIFY( equal(v2.begin(), v2.end(), A) ); 55 VERIFY( equal(s2, s2 + N, A) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/fill/ |
H A D | 4.cc | 37 VERIFY( equal(i1, i1 + N1, A1) ); 41 VERIFY( equal(v1.begin(), v1.end(), A1) ); 49 VERIFY( equal(i2, i2 + N2, A2) ); 53 VERIFY( equal(v2.begin(), v2.end(), A2) ); 62 VERIFY( equal(i3, i3 + N3, A3) ); 66 VERIFY( equal(v3.begin(), v3.end(), A3) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/fill_n/ |
H A D | 1.cc | 37 VERIFY( equal(i1, i1 + N1, A1) ); 41 VERIFY( equal(v1.begin(), v1.end(), A1) ); 49 VERIFY( equal(i2, i2 + N2, A2) ); 53 VERIFY( equal(v2.begin(), v2.end(), A2) ); 62 VERIFY( equal(i3, i3 + N3, A3) ); 66 VERIFY( equal(v3.begin(), v3.end(), A3) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/rotate/ |
H A D | rotate.cc | 42 VERIFY(std::equal(a.begin(), a.end(), A)); 46 VERIFY(std::equal(a.begin(), a.end(), B)); 50 VERIFY(std::equal(a.begin(), a.end(), C)); 55 VERIFY(std::equal(a.begin(), a.end(), D)); 64 VERIFY(std::equal(A, A + N, B)); 67 VERIFY(std::equal(A, A + N, C)); 70 VERIFY(std::equal(A, A + N, D));
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/bool/modifiers/insert/ |
H A D | 1.cc | 132 VERIFY( std::equal(v.begin(), v.end(), A1) ); 136 VERIFY( std::equal(v.begin(), v.end(), A2) ); 140 VERIFY( std::equal(v.begin(), v.end(), A3) ); 144 VERIFY( std::equal(v.begin(), v.end(), A4) ); 148 VERIFY( std::equal(v.begin(), v.end(), A5) ); 152 VERIFY( std::equal(v.begin(), v.end(), A6) ); 156 VERIFY( std::equal(v.begin(), v.end(), A7) ); 160 VERIFY( std::equal(v.begin(), v.end(), A8) ); 164 VERIFY( std::equal(v.begin(), v.end(), A9) );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/vector/modifiers/ |
H A D | 2.cc | 41 VERIFY(std::equal(v3.begin(), v3.end(), A)); 47 VERIFY(std::equal(v4.begin(), v4.end(), A)); 48 VERIFY(std::equal(A, A + N, v4.begin())); 52 VERIFY(std::equal(v4.begin(), v4.end(), B)); 53 VERIFY(std::equal(B, B + M, v4.begin()));
|