| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/minmax/ |
| H A D | constexpr.cc | 25 static_assert(std::minmax(2, 1) ==
27 static_assert(std::minmax(2, 1, std::greater<int>()) ==
29 static_assert(std::minmax({2, 1}) ==
31 static_assert(std::minmax({2, 1}, std::greater<int>())==
|
| H A D | 1.cc | 30 std::pair<const int, const int> z = std::minmax(1, 2);
31 std::pair<const int, const int> w = std::minmax(4, 3);
37 std::pair<const int, const int> zc = std::minmax(1, 2, std::greater<int>());
38 std::pair<const int, const int> wc = std::minmax(4, 3, std::greater<int>());
|
| H A D | 2.cc | 30 std::pair<int, int> z = std::minmax({1, 2, 3});
31 std::pair<int, int> w = std::minmax({4, 3, 5, 4});
32 std::pair<int, int> y = std::minmax({4, 5, 3, 7, 3});
41 std::minmax({1, 2, 3}, std::greater<int>());
44 std::minmax({4, 3, 5, 4}, std::greater<int>());
47 std::minmax({4, 5, 3, 7, 3}, std::greater<int>());
|
| H A D | 3.cc | 44 std::minmax({1, 2, 3, 4, 5, 6, 7, 8}, compare_counter());
46 // If N is the number of arguments in the minmax function call,
|
| H A D | 37547.cc | 31 auto p = std::minmax({v});
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/minmax/requirements/explicit_instantiation/ |
| H A D | 2.cc | 37 minmax(const value_type&, const value_type&);
39 minmax(const value_type&, const value_type&, compare_type);
|
| H A D | pod.cc | 36 minmax(const value_type&, const value_type&);
38 minmax(const value_type&, const value_type&, compare_type);
|
| H A D | 3.cc | 36 template pair<value_type, value_type> minmax(initializer_list<value_type>);
37 template pair<value_type, value_type> minmax(initializer_list<value_type>,
|
| H A D | pod2.cc | 36 template pair<value_type, value_type> minmax(initializer_list<value_type>);
37 template pair<value_type, value_type> minmax(initializer_list<value_type>,
|
| /haiku-buildtools/isl/ |
| H A D | bound.c | 71 const char *minmax; local
80 minmax = "ub";
83 minmax = "lb";
131 p = isl_printer_print_str(p, minmax);
|
| /haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/headers/algorithm/ |
| H A D | synopsis.cc | 520 minmax(const _Tp&, const _Tp&);
524 minmax(const _Tp&, const _Tp&, _Compare);
552 minmax(initializer_list<_Tp>);
556 minmax(initializer_list<_Tp>, _Compare);
|
| /haiku-buildtools/gcc/gcc/ |
| H A D | tree-ssa-phiopt.c | 933 /* The function minmax_replacement does the main work of doing the minmax
948 enum tree_code cmp, minmax, ass_code; local
1011 minmax = MIN_EXPR;
1015 minmax = MAX_EXPR;
1064 minmax = MIN_EXPR;
1089 minmax = MAX_EXPR;
1123 minmax = MAX_EXPR;
1148 minmax = MIN_EXPR;
1173 new_stmt = gimple_build_assign (result, minmax, arg0, arg1);
|
| H A D | tree-ssa-ccp.c | 1438 int minmax, maxmin; local
1456 minmax = wi::cmp (o1val.and_not (o1mask), o2val | o2mask, sgn);
1462 else if (minmax > 0) /* o1 is not less or equal to o2. */
1467 else if (maxmin == minmax) /* o1 and o2 are equal. */
|
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | algorithmfwd.h | 85 minmax (C++0x)
383 minmax(const _Tp&, const _Tp&);
388 minmax(const _Tp&, const _Tp&, _Compare);
423 minmax(initializer_list<_Tp>);
428 minmax(initializer_list<_Tp>, _Compare);
|
| H A D | stl_algo.h | 3299 minmax(const _Tp& __a, const _Tp& __b) function
3320 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) function
3469 minmax(initializer_list<_Tp> __l) function
3479 minmax(initializer_list<_Tp> __l, _Compare __comp) function
|
| /haiku-buildtools/cloog/source/ |
| H A D | clast.c | 1032 int minmax = -1; local
1077 minmax = 1;
1081 minmax = 0;
1087 d->g->eq[d->n].RHS = clast_minmax(d->copy, d->i, minmax, guarded, 0, 1,
|
| /haiku-buildtools/gcc/gcc/config/frv/ |
| H A D | frv.c | 5146 rtx minmax = operands[1];
5158 switch (GET_CODE (minmax))
5096 rtx minmax = operands[1]; local
|