diff --git a/include/boost/multi_array/multi_array_ref.hpp b/include/boost/multi_array/multi_array_ref.hpp index 98c10c0f..4b076b8b 100644 --- a/include/boost/multi_array/multi_array_ref.hpp +++ b/include/boost/multi_array/multi_array_ref.hpp @@ -103,7 +103,7 @@ class const_multi_array_ref : boost::function_requires< CollectionConcept >(); - index_base_list_.assign(0); + index_base_list_.fill(0); init_multi_array_ref(extents.begin()); } @@ -340,7 +340,7 @@ class const_multi_array_ref : init_multi_array_ref(extents); } else { boost::array extent_list; - extent_list.assign(0); + extent_list.fill(0); init_multi_array_ref(extent_list.begin()); } } diff --git a/include/boost/multi_array/storage_order.hpp b/include/boost/multi_array/storage_order.hpp index 5ede677e..314eb72b 100644 --- a/include/boost/multi_array/storage_order.hpp +++ b/include/boost/multi_array/storage_order.hpp @@ -48,14 +48,14 @@ namespace boost { for (size_type i=0; i != NumDims; ++i) { ordering_[i] = NumDims - 1 - i; } - ascending_.assign(true); + ascending_.fill(true); } general_storage_order(const fortran_storage_order&) { for (size_type i=0; i != NumDims; ++i) { ordering_[i] = i; } - ascending_.assign(true); + ascending_.fill(true); } size_type ordering(size_type dim) const { return ordering_[dim]; } diff --git a/include/boost/multi_array/view.hpp b/include/boost/multi_array/view.hpp index e6379118..cae5a005 100644 --- a/include/boost/multi_array/view.hpp +++ b/include/boost/multi_array/view.hpp @@ -90,7 +90,7 @@ class const_multi_array_view : } void reindex(index value) { - index_base_list_.assign(value); + index_base_list_.fill(value); origin_offset_ = this->calculate_indexing_offset(stride_list_,index_base_list_); } @@ -231,7 +231,7 @@ class const_multi_array_view : const boost::array& strides): base_(base), origin_offset_(0) { - index_base_list_.assign(0); + index_base_list_.fill(0); // Get the extents and strides boost::detail::multi_array::