ceph/src/boost/boost/compute/algorithm/partition.hpp

   1 //---------------------------------------------------------------------------//
   2 // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
   3 //
   4 // Distributed under the Boost Software License, Version 1.0
   5 // See accompanying file LICENSE_1_0.txt or copy at
   6 // http://www.boost.org/LICENSE_1_0.txt
   7 //
   8 // See http://boostorg.github.com/compute for more information.
   9 //---------------------------------------------------------------------------//
  10
  11 #ifndef BOOST_COMPUTE_ALGORITHM_PARTITION_HPP
  12 #define BOOST_COMPUTE_ALGORITHM_PARTITION_HPP
  13
  14 #include <boost/static_assert.hpp>
  15
  16 #include <boost/compute/system.hpp>
  17 #include <boost/compute/command_queue.hpp>
  18 #include <boost/compute/algorithm/stable_partition.hpp>
  19 #include <boost/compute/type_traits/is_device_iterator.hpp>
  20
  21 namespace boost {
  22 namespace compute {
  23
  24 ///
  25 /// Partitions the elements in the range [\p first, \p last) according to
  26 /// \p predicate. Order of the elements need not be preserved.
  27 ///
  28 /// Space complexity: \Omega(3n)
  29 ///
  30 /// \see is_partitioned() and stable_partition()
  31 ///
  32 template<class Iterator, class UnaryPredicate>
  33 inline Iterator partition(Iterator first,
  34                           Iterator last,
  35                           UnaryPredicate predicate,
  36                           command_queue &queue = system::default_queue())
  37 {
  38     BOOST_STATIC_ASSERT(is_device_iterator<Iterator>::value);
  39     return stable_partition(first, last, predicate, queue);
  40 }
  41
  42 } // end compute namespace
  43 } // end boost namespace
  44
  45 #endif // BOOST_COMPUTE_ALGORITHM_PARTITION_HPP