61 lines
2.1 KiB
C++
61 lines
2.1 KiB
C++
/*
|
|
Copyright (c) Marshall Clow 2011-2012.
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
|
|
/// \file find_if_not.hpp
|
|
/// \brief Find the first element in a sequence that does not satisfy a predicate.
|
|
/// \author Marshall Clow
|
|
|
|
#ifndef BOOST_ALGORITHM_FIND_IF_NOT_HPP
|
|
#define BOOST_ALGORITHM_FIND_IF_NOT_HPP
|
|
|
|
#include <algorithm> // for std::find_if_not, if it exists
|
|
|
|
#include <boost/range/begin.hpp>
|
|
#include <boost/range/end.hpp>
|
|
|
|
namespace boost { namespace algorithm {
|
|
|
|
#if __cplusplus >= 201103L
|
|
// Use the C++11 versions of find_if_not if it is available
|
|
using std::find_if_not; // Section 25.2.5
|
|
#else
|
|
/// \fn find_if_not(InputIterator first, InputIterator last, Predicate p)
|
|
/// \brief Finds the first element in the sequence that does not satisfy the predicate.
|
|
/// \return The iterator pointing to the desired element.
|
|
///
|
|
/// \param first The start of the input sequence
|
|
/// \param last One past the end of the input sequence
|
|
/// \param p A predicate for testing the elements of the range
|
|
/// \note This function is part of the C++2011 standard library.
|
|
/// We will use the standard one if it is available,
|
|
/// otherwise we have our own implementation.
|
|
template<typename InputIterator, typename Predicate>
|
|
InputIterator find_if_not ( InputIterator first, InputIterator last, Predicate p )
|
|
{
|
|
for ( ; first != last; ++first )
|
|
if ( !p(*first))
|
|
break;
|
|
return first;
|
|
}
|
|
#endif
|
|
|
|
/// \fn find_if_not ( const Range &r, Predicate p )
|
|
/// \brief Finds the first element in the sequence that does not satisfy the predicate.
|
|
/// \return The iterator pointing to the desired element.
|
|
///
|
|
/// \param r The input range
|
|
/// \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 )
|
|
{
|
|
return boost::algorithm::find_if_not (boost::begin (r), boost::end(r), p);
|
|
}
|
|
|
|
}}
|
|
#endif // BOOST_ALGORITHM_FIND_IF_NOT_HPP
|