FM / detail

/usr/include/boost/compute/detail

Name	Size	Mode	Actions
assert_cl_success.hpp	851	0644	edit dl rm
buffer_value.hpp	4062	0644	edit dl rm
cl_versions.hpp	3130	0644	edit dl rm
device_ptr.hpp	5394	0644	edit dl rm
diagnostic.hpp	5196	0644	edit dl rm
duration.hpp	1641	0644	edit dl rm
getenv.hpp	936	0644	edit dl rm
get_object_info.hpp	8316	0644	edit dl rm
global_static.hpp	1437	0644	edit dl rm
is_buffer_iterator.hpp	960	0644	edit dl rm
is_contiguous_iterator.hpp	3720	0644	edit dl rm
iterator_plus_distance.hpp	1662	0644	edit dl rm
iterator_range_size.hpp	1414	0644	edit dl rm
iterator_traits.hpp	1158	0644	edit dl rm
literal.hpp	1444	0644	edit dl rm
lru_cache.hpp	3467	0644	edit dl rm
meta_kernel.hpp	32043	0644	edit dl rm
mpl_vector_to_tuple.hpp	2270	0644	edit dl rm
nvidia_compute_capability.hpp	2073	0644	edit dl rm
parameter_cache.hpp	7191	0644	edit dl rm
path.hpp	2100	0644	edit dl rm
print_range.hpp	2588	0644	edit dl rm
read_write_single_value.hpp	2542	0644	edit dl rm
sha1.hpp	1545	0644	edit dl rm
variadic_macros.hpp	1836	0644	edit dl rm
vendor.hpp	1491	0644	edit dl rm
work_size.hpp	1242	0644	edit dl rm

Edit: /usr/include/boost/compute/detail/iterator_range_size.hpp (1414B)

//---------------------------------------------------------------------------//
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
//
// 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_DETAIL_ITERATOR_RANGE_SIZE_H
#define BOOST_COMPUTE_DETAIL_ITERATOR_RANGE_SIZE_H

#include <cstddef>
#include <algorithm>
#include <iterator>

namespace boost {
namespace compute {
namespace detail {

// This is a convenience function which returns the size of a range
// bounded by two iterators. This function has two differences from
// the std::distance() function: 1) the return type (size_t) is
// unsigned, and 2) the return value is always positive.
template<class Iterator>
inline size_t iterator_range_size(Iterator first, Iterator last)
{
    typedef typename
        std::iterator_traits<Iterator>::difference_type
        difference_type;

difference_type difference = std::distance(first, last);

return static_cast<size_t>(
        (std::max)(difference, static_cast<difference_type>(0))
    );
}

} // end detail namespace
} // end compute namespace
} // end boost namespace

#endif // BOOST_COMPUTE_DETAIL_ITERATOR_RANGE_SIZE_H

//---------------------------------------------------------------------------// // 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_DETAIL_ITERATOR_RANGE_SIZE_H #define BOOST_COMPUTE_DETAIL_ITERATOR_RANGE_SIZE_H #include #include #include namespace boost { namespace compute { namespace detail { // This is a convenience function which returns the size of a range // bounded by two iterators. This function has two differences from // the std::distance() function: 1) the return type (size_t) is // unsigned, and 2) the return value is always positive. template inline size_t iterator_range_size(Iterator first, Iterator last) { typedef typename std::iterator_traits::difference_type difference_type; difference_type difference = std::distance(first, last); return static_cast( (std::max)(difference, static_cast(0)) ); } } // end detail namespace } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_DETAIL_ITERATOR_RANGE_SIZE_H