1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162 |
- //---------------------------------------------------------------------------//
- // Copyright (c) 2013 Kyle Lutz <[email protected]>
- //
- // 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_COUNT_HPP
- #define BOOST_COMPUTE_ALGORITHM_COUNT_HPP
- #include <boost/static_assert.hpp>
- #include <boost/compute/lambda.hpp>
- #include <boost/compute/system.hpp>
- #include <boost/compute/command_queue.hpp>
- #include <boost/compute/algorithm/count_if.hpp>
- #include <boost/compute/type_traits/vector_size.hpp>
- #include <boost/compute/type_traits/is_device_iterator.hpp>
- namespace boost {
- namespace compute {
- /// Returns the number of occurrences of \p value in the range
- /// [\p first, \p last).
- ///
- /// Space complexity on CPUs: \Omega(1)<br>
- /// Space complexity on GPUs: \Omega(n)
- ///
- /// \see count_if()
- template<class InputIterator, class T>
- inline size_t count(InputIterator first,
- InputIterator last,
- const T &value,
- command_queue &queue = system::default_queue())
- {
- BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
- typedef typename std::iterator_traits<InputIterator>::value_type value_type;
- using ::boost::compute::_1;
- using ::boost::compute::lambda::all;
- if(vector_size<value_type>::value == 1){
- return ::boost::compute::count_if(first,
- last,
- _1 == value,
- queue);
- }
- else {
- return ::boost::compute::count_if(first,
- last,
- all(_1 == value),
- queue);
- }
- }
- } // end compute namespace
- } // end boost namespace
- #endif // BOOST_COMPUTE_ALGORITHM_COUNT_HPP
|