parent
a6e83bfe76
commit
5d97e709f5
@ -19,7 +19,7 @@
|
|||||||
# the BCP tool:
|
# the BCP tool:
|
||||||
# http://www.boost.org/doc/libs/1_52_0/tools/bcp/doc/html/index.html
|
# http://www.boost.org/doc/libs/1_52_0/tools/bcp/doc/html/index.html
|
||||||
#
|
#
|
||||||
# bcp call: bcp boost/utility.hpp boost/python.hpp boost/bind.hpp boost/lambda/lambda.hpp boost/exception/all.hpp boost/tuple/tuple_io.hpp boost/tuple/tuple_comparison.hpp boost/regex.hpp boost/foreach.hpp boost/smart_ptr.hpp boost/algorithm/string_regex.hpp boost/thread.hpp boost/unordered_map.hpp boost/unordered_set.hpp boost/format.hpp boost/ptr_container/ptr_container.hpp boost/filesystem.hpp boost/filesystem/fstream.hpp boost/utility.hpp ../BoostParts
|
# bcp call: bcp boost/utility.hpp boost/python.hpp boost/bind.hpp boost/lambda/lambda.hpp boost/exception/all.hpp boost/tuple/tuple_io.hpp boost/tuple/tuple_comparison.hpp boost/regex.hpp boost/foreach.hpp boost/smart_ptr.hpp boost/algorithm/string_regex.hpp boost/thread.hpp boost/unordered_map.hpp boost/unordered_set.hpp boost/format.hpp boost/ptr_container/ptr_container.hpp boost/filesystem.hpp boost/filesystem/fstream.hpp boost/utility.hpp boost/algorithm/cxx11/any_of.hpp ../BoostParts
|
||||||
|
|
||||||
cmake_minimum_required( VERSION 2.8 )
|
cmake_minimum_required( VERSION 2.8 )
|
||||||
|
|
||||||
|
90
cpp/BoostParts/boost/algorithm/cxx11/any_of.hpp
Normal file
90
cpp/BoostParts/boost/algorithm/cxx11/any_of.hpp
Normal file
@ -0,0 +1,90 @@
|
|||||||
|
/*
|
||||||
|
Copyright (c) Marshall Clow 2008-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)
|
||||||
|
|
||||||
|
For more information, see http://www.boost.org
|
||||||
|
*/
|
||||||
|
|
||||||
|
/// \file
|
||||||
|
/// \brief Test ranges to see if any elements match a value or predicate.
|
||||||
|
/// \author Marshall Clow
|
||||||
|
|
||||||
|
#ifndef BOOST_ALGORITHM_ANY_OF_HPP
|
||||||
|
#define BOOST_ALGORITHM_ANY_OF_HPP
|
||||||
|
|
||||||
|
#include <algorithm> // for std::any_of, if available
|
||||||
|
#include <boost/range/begin.hpp>
|
||||||
|
#include <boost/range/end.hpp>
|
||||||
|
|
||||||
|
namespace boost { namespace algorithm {
|
||||||
|
|
||||||
|
// Use the C++11 versions of any_of if it is available
|
||||||
|
#if __cplusplus >= 201103L
|
||||||
|
using std::any_of; // Section 25.2.2
|
||||||
|
#else
|
||||||
|
/// \fn any_of ( InputIterator first, InputIterator last, Predicate p )
|
||||||
|
/// \return true if any of the elements in [first, last) satisfy the predicate
|
||||||
|
/// \note returns false on an empty range
|
||||||
|
///
|
||||||
|
/// \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 sequence
|
||||||
|
///
|
||||||
|
template<typename InputIterator, typename Predicate>
|
||||||
|
bool any_of ( InputIterator first, InputIterator last, Predicate p )
|
||||||
|
{
|
||||||
|
for ( ; first != last; ++first )
|
||||||
|
if ( p(*first))
|
||||||
|
return true;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/// \fn any_of ( const Range &r, Predicate p )
|
||||||
|
/// \return true if any elements in the range satisfy the predicate 'p'
|
||||||
|
/// \note returns false on an empty range
|
||||||
|
///
|
||||||
|
/// \param r The input range
|
||||||
|
/// \param p A predicate for testing the elements of the range
|
||||||
|
///
|
||||||
|
template<typename Range, typename Predicate>
|
||||||
|
bool any_of ( const Range &r, Predicate p )
|
||||||
|
{
|
||||||
|
return boost::algorithm::any_of (boost::begin (r), boost::end (r), p);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// \fn any_of_equal ( InputIterator first, InputIterator last, const V &val )
|
||||||
|
/// \return true if any of the elements in [first, last) are equal to 'val'
|
||||||
|
/// \note returns false on an empty range
|
||||||
|
///
|
||||||
|
/// \param first The start of the input sequence
|
||||||
|
/// \param last One past the end of the input sequence
|
||||||
|
/// \param val A value to compare against
|
||||||
|
///
|
||||||
|
template<typename InputIterator, typename V>
|
||||||
|
bool any_of_equal ( InputIterator first, InputIterator last, const V &val )
|
||||||
|
{
|
||||||
|
for ( ; first != last; ++first )
|
||||||
|
if ( val == *first )
|
||||||
|
return true;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// \fn any_of_equal ( const Range &r, const V &val )
|
||||||
|
/// \return true if any of the elements in the range are equal to 'val'
|
||||||
|
/// \note returns false on an empty range
|
||||||
|
///
|
||||||
|
/// \param r The input range
|
||||||
|
/// \param val A value to compare against
|
||||||
|
///
|
||||||
|
template<typename Range, typename V>
|
||||||
|
bool any_of_equal ( const Range &r, const V &val )
|
||||||
|
{
|
||||||
|
return boost::algorithm::any_of_equal (boost::begin (r), boost::end (r), val);
|
||||||
|
}
|
||||||
|
|
||||||
|
}} // namespace boost and algorithm
|
||||||
|
|
||||||
|
#endif // BOOST_ALGORITHM_ANY_OF_HPP
|
Loading…
Reference in New Issue
Block a user