47 lines
1.7 KiB
Plaintext
47 lines
1.7 KiB
Plaintext
|
//---------------------------------------------------------------------------//
|
||
|
|
// Copyright (c) 2014 Roshan <thisisroshansmail@gmail.com>
|
||
|
|
//
|
||
|
|
// 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
|
||
|
|
//
|
||
|
|
// See http://boostorg.github.com/compute for more information.
|
||
|
|
//---------------------------------------------------------------------------//
|
||
|
|
|
||
|
|
#ifndef BOOST_COMPUTE_ALGORITHM_PARTITION_POINT_HPP
|
||
|
|
#define BOOST_COMPUTE_ALGORITHM_PARTITION_POINT_HPP
|
||
|
|
|
||
|
|
#include <boost/compute/system.hpp>
|
||
|
|
#include <boost/compute/command_queue.hpp>
|
||
|
|
#include <boost/compute/algorithm/detail/binary_find.hpp>
|
||
|
|
|
||
|
|
namespace boost {
|
||
|
|
namespace compute {
|
||
|
|
|
||
|
|
///
|
||
|
|
/// \brief Partition point algorithm
|
||
|
|
///
|
||
|
|
/// Finds the end of true values in the partitioned range [first, last)
|
||
|
|
/// \return Iterator pointing to end of true values
|
||
|
|
///
|
||
|
|
/// \param first Iterator pointing to start of range
|
||
|
|
/// \param last Iterator pointing to end of range
|
||
|
|
/// \param predicate Unary predicate to be applied on each element
|
||
|
|
/// \param queue Queue on which to execute
|
||
|
|
///
|
||
|
|
/// \see partition() and stable_partition()
|
||
|
|
///
|
||
|
|
template<class InputIterator, class UnaryPredicate>
|
||
|
|
inline InputIterator partition_point(InputIterator first,
|
||
|
|
InputIterator last,
|
||
|
|
UnaryPredicate predicate,
|
||
|
|
command_queue &queue = system::default_queue())
|
||
|
|
{
|
||
|
|
return detail::binary_find(first, last, not1(predicate), queue);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // end compute namespace
|
||
|
|
} // end boost namespace
|
||
|
|
|
||
|
|
#endif // BOOST_COMPUTE_ALGORITHM_PARTITION_POINT_HPP
|