import new upstream nautilus stable release 14.2.8

[ceph.git] / ceph / src / boost / boost / algorithm / cxx11 / find_if_not.hpp

diff --git a/ceph/src/boost/boost/algorithm/cxx11/find_if_not.hpp b/ceph/src/boost/boost/algorithm/cxx11/find_if_not.hpp
index 02ff4dce7b08c75ed7aaf87b8de0a30703ea72f3..cc81d2975006768f5a65d2b67b739220bb9f98de 100644 (file)
--- a/ceph/src/boost/boost/algorithm/cxx11/find_if_not.hpp
+++ b/ceph/src/boost/boost/algorithm/cxx11/find_if_not.hpp
@@ -12,6 +12,7 @@
 #ifndef BOOST_ALGORITHM_FIND_IF_NOT_HPP
 #define BOOST_ALGORITHM_FIND_IF_NOT_HPP
 
+#include <boost/config.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 
@@ -26,7 +27,7 @@ namespace boost { namespace algorithm {
 /// \param p        A predicate for testing the elements of the range
 /// \note           This function is part of the C++2011 standard library.
 template<typename InputIterator, typename Predicate> 
-InputIterator find_if_not ( InputIterator first, InputIterator last, Predicate p )
+BOOST_CXX14_CONSTEXPR InputIterator find_if_not ( InputIterator first, InputIterator last, Predicate p )
 {
     for ( ; first != last; ++first )
         if ( !p(*first))
@@ -42,7 +43,7 @@ InputIterator find_if_not ( InputIterator first, InputIterator last, Predicate p
 /// \param p        A predicate for testing the elements of the range
 ///
 template<typename Range, typename Predicate>
-typename boost::range_iterator<const Range>::type find_if_not ( const Range &r, Predicate p )
+BOOST_CXX14_CONSTEXPR typename boost::range_iterator<const Range>::type find_if_not ( const Range &r, Predicate p )
 {
     return boost::algorithm::find_if_not (boost::begin (r), boost::end(r), p);
 }