cuda_std Namespace Reference

Classes
struct	less
struct	less< void >

Functions
template<typename RandomIt , typename T , typename Compare = cuda_std::less<T>>
__host__ constexpr __device__ RandomIt	binary_find (RandomIt first, RandomIt last, const T &value, Compare comp={})
template<typename RandomIt , typename T , typename Compare = less<T>>
__host__ constexpr __device__ RandomIt	lower_bound (RandomIt first, RandomIt last, const T &value, Compare comp={})
template<typename RandomIt , typename T , typename Compare = less<T>>
__host__ constexpr __device__ RandomIt	upper_bound (RandomIt first, RandomIt last, const T &value, Compare comp={})

Function Documentation

binary_find()

template<typename RandomIt , typename T , typename Compare = cuda_std::less<T>>

__host__ constexpr __device__ RandomIt cuda_std::binary_find ( RandomIt  first, RandomIt  last, const T &  value, Compare  comp = {}  )

constexpr

Definition at line 63 of file cudastdAlgorithm.h.

                                                                                                                   {}) {
    first = cuda_std::lower_bound(first, last, value, comp);
    return first != last && !comp(value, *first) ? first : last;
  }

lower_bound()

template<typename RandomIt , typename T , typename Compare = less<T>>

__host__ constexpr __device__ RandomIt cuda_std::lower_bound ( RandomIt  first, RandomIt  last, const T &  value, Compare  comp = {}  )

constexpr

Definition at line 27 of file cudastdAlgorithm.h.

                                                                                                                   {}) {
    auto count = last - first;
 
    while (count > 0) {
      auto it = first;
      auto step = count / 2;
      it += step;
      if (comp(*it, value)) {
        first = ++it;
        count -= step + 1;
      } else {
        count = step;
      }
    }
    return first;
  }

upper_bound()

template<typename RandomIt , typename T , typename Compare = less<T>>

__host__ constexpr __device__ RandomIt cuda_std::upper_bound ( RandomIt  first, RandomIt  last, const T &  value, Compare  comp = {}  )

constexpr

Definition at line 45 of file cudastdAlgorithm.h.

                                                                                                                   {}) {
    auto count = last - first;
 
    while (count > 0) {
      auto it = first;
      auto step = count / 2;
      it += step;
      if (!comp(value, *it)) {
        first = ++it;
        count -= step + 1;
      } else {
        count = step;
      }
    }
    return first;
  }

Referenced by cms::cuda::for().