mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-02-12 02:19:56 +08:00
2014-12-22 Ville Voutilainen <ville.voutilainen@gmail.com> PR libstdc++/60271 C++14 constexpr min, max, minmax, min_element, max_element and minmax_element. Also constexpr for 20.9.5-20.9.9, aka various library functors. * include/bits/c++config: Add _GLIBCXX14_CONSTEXPR. * include/bits/algorithmfwd.h (min, max, minmax, min_element, max_element): Use it. * include/bits/predefined_ops.h (_Iter_less_iter, __iter_less_iter, _Iter_comp_iter, __iter_comp_iter): Likewise. * include/bits/stl_algo.h (minmax, __minmax_element, minmax_element, min, max, __min_element, min_element, __max_element, max_element) Likewise. * include/bits/stl_algobase.h (min, max): Likewise. * include/bits/stl_function.h (plus, minus, multiplies, divides, modulus, negate, equal_to, not_equal_to, greater, less, greater_equal, less_equal, logical_and, logical_or, logical_not, bit_and, bit_or, bit_xor, bit_not, unary_negate, not1, binary_negate, not2): Likewise. * testsuite/20_util/function_objects/constexpr.cc: New. * testsuite/25_algorithms/max/constexpr.cc: Likewise. * testsuite/25_algorithms/max_element/constexpr.cc: Likewise. * testsuite/25_algorithms/min/constexpr.cc: Likewise. * testsuite/25_algorithms/min_element/constexpr.cc: Likewise. * testsuite/25_algorithms/minmax/constexpr.cc: Likewise. * testsuite/25_algorithms/minmax_element/constexpr.cc: Likewise. * testsuite/ext/profile/mutex_extensions_neg.cc: Adjust dg-error. From-SVN: r219015
308 lines
7.8 KiB
C++
308 lines
7.8 KiB
C++
// Default predicates for internal use -*- C++ -*-
|
|
|
|
// Copyright (C) 2013-2014 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 3, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
|
// permissions described in the GCC Runtime Library Exception, version
|
|
// 3.1, as published by the Free Software Foundation.
|
|
|
|
// You should have received a copy of the GNU General Public License and
|
|
// a copy of the GCC Runtime Library Exception along with this program;
|
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
/** @file predefined_ops.h
|
|
* This is an internal header file, included by other library headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef _GLIBCXX_PREDEFINED_OPS_H
|
|
#define _GLIBCXX_PREDEFINED_OPS_H 1
|
|
|
|
namespace __gnu_cxx
|
|
{
|
|
namespace __ops
|
|
{
|
|
struct _Iter_less_iter
|
|
{
|
|
template<typename _Iterator1, typename _Iterator2>
|
|
_GLIBCXX14_CONSTEXPR
|
|
bool
|
|
operator()(_Iterator1 __it1, _Iterator2 __it2) const
|
|
{ return *__it1 < *__it2; }
|
|
};
|
|
_GLIBCXX14_CONSTEXPR
|
|
inline _Iter_less_iter
|
|
__iter_less_iter()
|
|
{ return _Iter_less_iter(); }
|
|
|
|
struct _Iter_less_val
|
|
{
|
|
template<typename _Iterator, typename _Value>
|
|
bool
|
|
operator()(_Iterator __it, _Value& __val) const
|
|
{ return *__it < __val; }
|
|
};
|
|
|
|
inline _Iter_less_val
|
|
__iter_less_val()
|
|
{ return _Iter_less_val(); }
|
|
|
|
inline _Iter_less_val
|
|
__iter_comp_val(_Iter_less_iter)
|
|
{ return _Iter_less_val(); }
|
|
|
|
struct _Val_less_iter
|
|
{
|
|
template<typename _Value, typename _Iterator>
|
|
bool
|
|
operator()(_Value& __val, _Iterator __it) const
|
|
{ return __val < *__it; }
|
|
};
|
|
|
|
inline _Val_less_iter
|
|
__val_less_iter()
|
|
{ return _Val_less_iter(); }
|
|
|
|
inline _Val_less_iter
|
|
__val_comp_iter(_Iter_less_iter)
|
|
{ return _Val_less_iter(); }
|
|
|
|
struct _Iter_equal_to_iter
|
|
{
|
|
template<typename _Iterator1, typename _Iterator2>
|
|
bool
|
|
operator()(_Iterator1 __it1, _Iterator2 __it2) const
|
|
{ return *__it1 == *__it2; }
|
|
};
|
|
|
|
inline _Iter_equal_to_iter
|
|
__iter_equal_to_iter()
|
|
{ return _Iter_equal_to_iter(); }
|
|
|
|
struct _Iter_equal_to_val
|
|
{
|
|
template<typename _Iterator, typename _Value>
|
|
bool
|
|
operator()(_Iterator __it, _Value& __val) const
|
|
{ return *__it == __val; }
|
|
};
|
|
|
|
inline _Iter_equal_to_val
|
|
__iter_equal_to_val()
|
|
{ return _Iter_equal_to_val(); }
|
|
|
|
inline _Iter_equal_to_val
|
|
__iter_comp_val(_Iter_equal_to_iter)
|
|
{ return _Iter_equal_to_val(); }
|
|
|
|
template<typename _Compare>
|
|
struct _Iter_comp_iter
|
|
{
|
|
_Compare _M_comp;
|
|
_GLIBCXX14_CONSTEXPR
|
|
_Iter_comp_iter(_Compare __comp)
|
|
: _M_comp(__comp)
|
|
{ }
|
|
|
|
template<typename _Iterator1, typename _Iterator2>
|
|
_GLIBCXX14_CONSTEXPR
|
|
bool
|
|
operator()(_Iterator1 __it1, _Iterator2 __it2)
|
|
{ return bool(_M_comp(*__it1, *__it2)); }
|
|
};
|
|
|
|
template<typename _Compare>
|
|
_GLIBCXX14_CONSTEXPR
|
|
inline _Iter_comp_iter<_Compare>
|
|
__iter_comp_iter(_Compare __comp)
|
|
{ return _Iter_comp_iter<_Compare>(__comp); }
|
|
|
|
template<typename _Compare>
|
|
struct _Iter_comp_val
|
|
{
|
|
_Compare _M_comp;
|
|
|
|
_Iter_comp_val(_Compare __comp)
|
|
: _M_comp(__comp)
|
|
{ }
|
|
|
|
template<typename _Iterator, typename _Value>
|
|
bool
|
|
operator()(_Iterator __it, _Value& __val)
|
|
{ return bool(_M_comp(*__it, __val)); }
|
|
};
|
|
|
|
template<typename _Compare>
|
|
inline _Iter_comp_val<_Compare>
|
|
__iter_comp_val(_Compare __comp)
|
|
{ return _Iter_comp_val<_Compare>(__comp); }
|
|
|
|
template<typename _Compare>
|
|
inline _Iter_comp_val<_Compare>
|
|
__iter_comp_val(_Iter_comp_iter<_Compare> __comp)
|
|
{ return _Iter_comp_val<_Compare>(__comp._M_comp); }
|
|
|
|
template<typename _Compare>
|
|
struct _Val_comp_iter
|
|
{
|
|
_Compare _M_comp;
|
|
|
|
_Val_comp_iter(_Compare __comp)
|
|
: _M_comp(__comp)
|
|
{ }
|
|
|
|
template<typename _Value, typename _Iterator>
|
|
bool
|
|
operator()(_Value& __val, _Iterator __it)
|
|
{ return bool(_M_comp(__val, *__it)); }
|
|
};
|
|
|
|
template<typename _Compare>
|
|
inline _Val_comp_iter<_Compare>
|
|
__val_comp_iter(_Compare __comp)
|
|
{ return _Val_comp_iter<_Compare>(__comp); }
|
|
|
|
template<typename _Compare>
|
|
inline _Val_comp_iter<_Compare>
|
|
__val_comp_iter(_Iter_comp_iter<_Compare> __comp)
|
|
{ return _Val_comp_iter<_Compare>(__comp._M_comp); }
|
|
|
|
template<typename _Value>
|
|
struct _Iter_equals_val
|
|
{
|
|
_Value& _M_value;
|
|
|
|
_Iter_equals_val(_Value& __value)
|
|
: _M_value(__value)
|
|
{ }
|
|
|
|
template<typename _Iterator>
|
|
bool
|
|
operator()(_Iterator __it)
|
|
{ return *__it == _M_value; }
|
|
};
|
|
|
|
template<typename _Value>
|
|
inline _Iter_equals_val<_Value>
|
|
__iter_equals_val(_Value& __val)
|
|
{ return _Iter_equals_val<_Value>(__val); }
|
|
|
|
template<typename _Iterator1>
|
|
struct _Iter_equals_iter
|
|
{
|
|
typename std::iterator_traits<_Iterator1>::reference _M_ref;
|
|
|
|
_Iter_equals_iter(_Iterator1 __it1)
|
|
: _M_ref(*__it1)
|
|
{ }
|
|
|
|
template<typename _Iterator2>
|
|
bool
|
|
operator()(_Iterator2 __it2)
|
|
{ return *__it2 == _M_ref; }
|
|
};
|
|
|
|
template<typename _Iterator>
|
|
inline _Iter_equals_iter<_Iterator>
|
|
__iter_comp_iter(_Iter_equal_to_iter, _Iterator __it)
|
|
{ return _Iter_equals_iter<_Iterator>(__it); }
|
|
|
|
template<typename _Predicate>
|
|
struct _Iter_pred
|
|
{
|
|
_Predicate _M_pred;
|
|
|
|
_Iter_pred(_Predicate __pred)
|
|
: _M_pred(__pred)
|
|
{ }
|
|
|
|
template<typename _Iterator>
|
|
bool
|
|
operator()(_Iterator __it)
|
|
{ return bool(_M_pred(*__it)); }
|
|
};
|
|
|
|
template<typename _Predicate>
|
|
inline _Iter_pred<_Predicate>
|
|
__pred_iter(_Predicate __pred)
|
|
{ return _Iter_pred<_Predicate>(__pred); }
|
|
|
|
template<typename _Compare, typename _Value>
|
|
struct _Iter_comp_to_val
|
|
{
|
|
_Compare _M_comp;
|
|
_Value& _M_value;
|
|
|
|
_Iter_comp_to_val(_Compare __comp, _Value& __value)
|
|
: _M_comp(__comp), _M_value(__value)
|
|
{ }
|
|
|
|
template<typename _Iterator>
|
|
bool
|
|
operator()(_Iterator __it)
|
|
{ return bool(_M_comp(*__it, _M_value)); }
|
|
};
|
|
|
|
template<typename _Compare, typename _Value>
|
|
_Iter_comp_to_val<_Compare, _Value>
|
|
__iter_comp_val(_Compare __comp, _Value &__val)
|
|
{ return _Iter_comp_to_val<_Compare, _Value>(__comp, __val); }
|
|
|
|
template<typename _Compare, typename _Iterator1>
|
|
struct _Iter_comp_to_iter
|
|
{
|
|
_Compare _M_comp;
|
|
typename std::iterator_traits<_Iterator1>::reference _M_ref;
|
|
|
|
_Iter_comp_to_iter(_Compare __comp, _Iterator1 __it1)
|
|
: _M_comp(__comp), _M_ref(*__it1)
|
|
{ }
|
|
|
|
template<typename _Iterator2>
|
|
bool
|
|
operator()(_Iterator2 __it2)
|
|
{ return bool(_M_comp(*__it2, _M_ref)); }
|
|
};
|
|
|
|
template<typename _Compare, typename _Iterator>
|
|
inline _Iter_comp_to_iter<_Compare, _Iterator>
|
|
__iter_comp_iter(_Iter_comp_iter<_Compare> __comp, _Iterator __it)
|
|
{ return _Iter_comp_to_iter<_Compare, _Iterator>(__comp._M_comp, __it); }
|
|
|
|
template<typename _Predicate>
|
|
struct _Iter_negate
|
|
{
|
|
_Predicate _M_pred;
|
|
|
|
_Iter_negate(_Predicate __pred)
|
|
: _M_pred(__pred)
|
|
{ }
|
|
|
|
template<typename _Iterator>
|
|
bool
|
|
operator()(_Iterator __it)
|
|
{ return !bool(_M_pred(*__it)); }
|
|
};
|
|
|
|
template<typename _Predicate>
|
|
inline _Iter_negate<_Predicate>
|
|
__negate(_Iter_pred<_Predicate> __pred)
|
|
{ return _Iter_negate<_Predicate>(__pred._M_pred); }
|
|
|
|
} // namespace __ops
|
|
} // namespace __gnu_cxx
|
|
|
|
#endif
|