]> git.proxmox.com Git - ceph.git/blob - ceph/src/boost/boost/compute/algorithm/count.hpp
update sources to v12.2.3
[ceph.git] / ceph / src / boost / boost / compute / algorithm / count.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_COUNT_HPP
12 #define BOOST_COMPUTE_ALGORITHM_COUNT_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/count_if.hpp>
18 #include <boost/compute/type_traits/vector_size.hpp>
19
20 namespace boost {
21 namespace compute {
22
23 /// Returns the number of occurrences of \p value in the range
24 /// [\p first, \p last).
25 ///
26 /// Space complexity on CPUs: \Omega(1)<br>
27 /// Space complexity on GPUs: \Omega(n)
28 ///
29 /// \see count_if()
30 template<class InputIterator, class T>
31 inline size_t count(InputIterator first,
32 InputIterator last,
33 const T &value,
34 command_queue &queue = system::default_queue())
35 {
36 typedef typename std::iterator_traits<InputIterator>::value_type value_type;
37
38 using ::boost::compute::_1;
39 using ::boost::compute::lambda::all;
40
41 if(vector_size<value_type>::value == 1){
42 return ::boost::compute::count_if(first,
43 last,
44 _1 == value,
45 queue);
46 }
47 else {
48 return ::boost::compute::count_if(first,
49 last,
50 all(_1 == value),
51 queue);
52 }
53 }
54
55 } // end compute namespace
56 } // end boost namespace
57
58 #endif // BOOST_COMPUTE_ALGORITHM_COUNT_HPP