update boost on linux

linx64/include/boost/compute/algorithm/search.hpp

@@ -11,12 +11,15 @@
 #ifndef BOOST_COMPUTE_ALGORITHM_SEARCH_HPP
 #define BOOST_COMPUTE_ALGORITHM_SEARCH_HPP
 
+#include <boost/static_assert.hpp>
+
 #include <boost/compute/algorithm/detail/search_all.hpp>
 #include <boost/compute/algorithm/find.hpp>
 #include <boost/compute/container/vector.hpp>
 #include <boost/compute/detail/iterator_range_size.hpp>
 #include <boost/compute/detail/meta_kernel.hpp>
 #include <boost/compute/system.hpp>
+#include <boost/compute/type_traits/is_device_iterator.hpp>
 
 namespace boost {
 namespace compute {
@@ -34,6 +37,7 @@ namespace compute {
 /// \param p_last Iterator pointing to end of pattern
 /// \param queue Queue on which to execute
 ///
+/// Space complexity: \Omega(distance(\p t_first, \p t_last))
 template<class TextIterator, class PatternIterator>
 inline TextIterator search(TextIterator t_first,
                            TextIterator t_last,
@@ -41,6 +45,9 @@ inline TextIterator search(TextIterator t_first,
                            PatternIterator p_last,
                            command_queue &queue = system::default_queue())
 {
+    BOOST_STATIC_ASSERT(is_device_iterator<TextIterator>::value);
+    BOOST_STATIC_ASSERT(is_device_iterator<PatternIterator>::value);
+
     // there is no need to check if pattern starts at last n - 1 indices
     vector<uint_> matching_indices(
         detail::iterator_range_size(t_first, t_last)