From 5cde13f21d36c7224b0e13d11c4b49379ae5210d Mon Sep 17 00:00:00 2001 From: DongHun Kwak Date: Thu, 6 Oct 2016 10:38:45 +0900 Subject: Imported Upstream version 1.61.0 Change-Id: I96a1f878d1e6164f01e9aadd5147f38fca448d90 Signed-off-by: DongHun Kwak --- boost/compute/algorithm/count.hpp | 55 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 55 insertions(+) create mode 100644 boost/compute/algorithm/count.hpp (limited to 'boost/compute/algorithm/count.hpp') diff --git a/boost/compute/algorithm/count.hpp b/boost/compute/algorithm/count.hpp new file mode 100644 index 0000000000..140d67379f --- /dev/null +++ b/boost/compute/algorithm/count.hpp @@ -0,0 +1,55 @@ +//---------------------------------------------------------------------------// +// Copyright (c) 2013 Kyle Lutz +// +// 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 +#include +#include +#include +#include + +namespace boost { +namespace compute { + +/// Returns the number of occurrences of \p value in the range +/// [\p first, \p last). +/// +/// \see count_if() +template +inline size_t count(InputIterator first, + InputIterator last, + const T &value, + command_queue &queue = system::default_queue()) +{ + typedef typename std::iterator_traits::value_type value_type; + + using ::boost::compute::_1; + using ::boost::compute::lambda::all; + + if(vector_size::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 -- cgit v1.2.3