ceph/src/boost/boost/compute/algorithm/upper_bound.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_UPPER_BOUND_HPP
  12 #define BOOST_COMPUTE_ALGORITHM_UPPER_BOUND_HPP
  13
  14 #include <boost/compute/lambda.hpp>
  15 #include <boost/compute/system.hpp>
  16 #include <boost/compute/command_queue.hpp>
  17 #include <boost/compute/algorithm/detail/binary_find.hpp>
  18
  19 namespace boost {
  20 namespace compute {
  21
  22 /// Returns an iterator pointing to the first element in the sorted
  23 /// range [\p first, \p last) that is not less than or equal to
  24 /// \p value.
  25 ///
  26 /// Space complexity: \Omega(1)
  27 template<class InputIterator, class T>
  28 inline InputIterator
  29 upper_bound(InputIterator first,
  30             InputIterator last,
  31             const T &value,
  32             command_queue &queue = system::default_queue())
  33 {
  34     using ::boost::compute::_1;
  35
  36     InputIterator position =
  37         detail::binary_find(first, last, _1 > value, queue);
  38
  39     return position;
  40 }
  41
  42 } // end compute namespace
  43 } // end boost namespace
  44
  45 #endif // BOOST_COMPUTE_ALGORITHM_UPPER_BOUND_HPP