mirror of
https://github.com/ecency/ecency-mobile.git
synced 2024-12-23 05:13:04 +03:00
40 lines
1.3 KiB
C++
40 lines
1.3 KiB
C++
|
//---------------------------------------------------------------------------//
|
||
|
|
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@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_HPP
|
||
|
|
#define BOOST_COMPUTE_ALGORITHM_PARTITION_HPP
|
||
|
|
|
||
|
|
#include <boost/compute/system.hpp>
|
||
|
|
#include <boost/compute/command_queue.hpp>
|
||
|
|
#include <boost/compute/algorithm/stable_partition.hpp>
|
||
|
|
|
||
|
|
namespace boost {
|
||
|
|
namespace compute {
|
||
|
|
|
||
|
|
///
|
||
|
|
/// Partitions the elements in the range [\p first, \p last) according to
|
||
|
|
/// \p predicate. Order of the elements need not be preserved.
|
||
|
|
///
|
||
|
|
/// \see is_partitioned() and stable_partition()
|
||
|
|
///
|
||
|
|
template<class Iterator, class UnaryPredicate>
|
||
|
|
inline Iterator partition(Iterator first,
|
||
|
|
Iterator last,
|
||
|
|
UnaryPredicate predicate,
|
||
|
|
command_queue &queue = system::default_queue())
|
||
|
|
{
|
||
|
|
return stable_partition(first, last, predicate, queue);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // end compute namespace
|
||
|
|
} // end boost namespace
|
||
|
|
|
||
|
|
#endif // BOOST_COMPUTE_ALGORITHM_PARTITION_HPP
|