williamr@2
|
1 |
// Copyright 2002 The Trustees of Indiana University.
|
williamr@2
|
2 |
|
williamr@2
|
3 |
// Use, modification and distribution is subject to the Boost Software
|
williamr@2
|
4 |
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
5 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
6 |
|
williamr@2
|
7 |
// Boost.MultiArray Library
|
williamr@2
|
8 |
// Authors: Ronald Garcia
|
williamr@2
|
9 |
// Jeremy Siek
|
williamr@2
|
10 |
// Andrew Lumsdaine
|
williamr@2
|
11 |
// See http://www.boost.org/libs/multi_array for documentation.
|
williamr@2
|
12 |
|
williamr@2
|
13 |
#ifndef BOOST_MULTI_ARRAY_REF_RG071801_HPP
|
williamr@2
|
14 |
#define BOOST_MULTI_ARRAY_REF_RG071801_HPP
|
williamr@2
|
15 |
|
williamr@2
|
16 |
//
|
williamr@2
|
17 |
// multi_array_ref.hpp - code for creating "views" of array data.
|
williamr@2
|
18 |
//
|
williamr@2
|
19 |
|
williamr@2
|
20 |
#include "boost/multi_array/base.hpp"
|
williamr@2
|
21 |
#include "boost/multi_array/collection_concept.hpp"
|
williamr@2
|
22 |
#include "boost/multi_array/concept_checks.hpp"
|
williamr@2
|
23 |
#include "boost/multi_array/iterator.hpp"
|
williamr@2
|
24 |
#include "boost/multi_array/storage_order.hpp"
|
williamr@2
|
25 |
#include "boost/multi_array/subarray.hpp"
|
williamr@2
|
26 |
#include "boost/multi_array/view.hpp"
|
williamr@2
|
27 |
#include "boost/multi_array/algorithm.hpp"
|
williamr@2
|
28 |
#include "boost/type_traits/is_integral.hpp"
|
williamr@2
|
29 |
#include "boost/array.hpp"
|
williamr@2
|
30 |
#include "boost/concept_check.hpp"
|
williamr@2
|
31 |
#include "boost/functional.hpp"
|
williamr@2
|
32 |
#include "boost/limits.hpp"
|
williamr@2
|
33 |
#include <algorithm>
|
williamr@2
|
34 |
#include <cassert>
|
williamr@2
|
35 |
#include <cstddef>
|
williamr@2
|
36 |
#include <functional>
|
williamr@2
|
37 |
#include <numeric>
|
williamr@2
|
38 |
|
williamr@2
|
39 |
namespace boost {
|
williamr@2
|
40 |
|
williamr@2
|
41 |
template <typename T, std::size_t NumDims,
|
williamr@2
|
42 |
typename TPtr = const T*
|
williamr@2
|
43 |
>
|
williamr@2
|
44 |
class const_multi_array_ref :
|
williamr@2
|
45 |
public detail::multi_array::multi_array_impl_base<T,NumDims>
|
williamr@2
|
46 |
{
|
williamr@2
|
47 |
typedef detail::multi_array::multi_array_impl_base<T,NumDims> super_type;
|
williamr@2
|
48 |
public:
|
williamr@2
|
49 |
typedef typename super_type::value_type value_type;
|
williamr@2
|
50 |
typedef typename super_type::const_reference const_reference;
|
williamr@2
|
51 |
typedef typename super_type::const_iterator const_iterator;
|
williamr@2
|
52 |
typedef typename super_type::const_reverse_iterator const_reverse_iterator;
|
williamr@2
|
53 |
typedef typename super_type::element element;
|
williamr@2
|
54 |
typedef typename super_type::size_type size_type;
|
williamr@2
|
55 |
typedef typename super_type::difference_type difference_type;
|
williamr@2
|
56 |
typedef typename super_type::index index;
|
williamr@2
|
57 |
typedef typename super_type::extent_range extent_range;
|
williamr@2
|
58 |
typedef general_storage_order<NumDims> storage_order_type;
|
williamr@2
|
59 |
|
williamr@2
|
60 |
// template typedefs
|
williamr@2
|
61 |
template <std::size_t NDims>
|
williamr@2
|
62 |
struct const_array_view {
|
williamr@2
|
63 |
typedef boost::detail::multi_array::const_multi_array_view<T,NDims> type;
|
williamr@2
|
64 |
};
|
williamr@2
|
65 |
|
williamr@2
|
66 |
template <std::size_t NDims>
|
williamr@2
|
67 |
struct array_view {
|
williamr@2
|
68 |
typedef boost::detail::multi_array::multi_array_view<T,NDims> type;
|
williamr@2
|
69 |
};
|
williamr@2
|
70 |
|
williamr@2
|
71 |
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
|
williamr@2
|
72 |
// make const_multi_array_ref a friend of itself
|
williamr@2
|
73 |
template <typename,std::size_t,typename>
|
williamr@2
|
74 |
friend class const_multi_array_ref;
|
williamr@2
|
75 |
#endif
|
williamr@2
|
76 |
|
williamr@2
|
77 |
// This ensures that const_multi_array_ref types with different TPtr
|
williamr@2
|
78 |
// types can convert to each other
|
williamr@2
|
79 |
template <typename OPtr>
|
williamr@2
|
80 |
const_multi_array_ref(const const_multi_array_ref<T,NumDims,OPtr>& other)
|
williamr@2
|
81 |
: base_(other.base_), storage_(other.storage_),
|
williamr@2
|
82 |
extent_list_(other.extent_list_),
|
williamr@2
|
83 |
stride_list_(other.stride_list_),
|
williamr@2
|
84 |
index_base_list_(other.index_base_list_),
|
williamr@2
|
85 |
origin_offset_(other.origin_offset_),
|
williamr@2
|
86 |
directional_offset_(other.directional_offset_),
|
williamr@2
|
87 |
num_elements_(other.num_elements_) { }
|
williamr@2
|
88 |
|
williamr@2
|
89 |
template <typename ExtentList>
|
williamr@2
|
90 |
explicit const_multi_array_ref(TPtr base, const ExtentList& extents) :
|
williamr@2
|
91 |
base_(base), storage_(c_storage_order()) {
|
williamr@2
|
92 |
boost::function_requires<
|
williamr@2
|
93 |
detail::multi_array::CollectionConcept<ExtentList> >();
|
williamr@2
|
94 |
|
williamr@2
|
95 |
index_base_list_.assign(0);
|
williamr@2
|
96 |
init_multi_array_ref(extents.begin());
|
williamr@2
|
97 |
}
|
williamr@2
|
98 |
|
williamr@2
|
99 |
template <typename ExtentList>
|
williamr@2
|
100 |
explicit const_multi_array_ref(TPtr base, const ExtentList& extents,
|
williamr@2
|
101 |
const general_storage_order<NumDims>& so) :
|
williamr@2
|
102 |
base_(base), storage_(so) {
|
williamr@2
|
103 |
boost::function_requires<
|
williamr@2
|
104 |
detail::multi_array::CollectionConcept<ExtentList> >();
|
williamr@2
|
105 |
|
williamr@2
|
106 |
index_base_list_.assign(0);
|
williamr@2
|
107 |
init_multi_array_ref(extents.begin());
|
williamr@2
|
108 |
}
|
williamr@2
|
109 |
|
williamr@2
|
110 |
explicit const_multi_array_ref(TPtr base,
|
williamr@2
|
111 |
const detail::multi_array::
|
williamr@2
|
112 |
extent_gen<NumDims>& ranges) :
|
williamr@2
|
113 |
base_(base), storage_(c_storage_order()) {
|
williamr@2
|
114 |
|
williamr@2
|
115 |
init_from_extent_gen(ranges);
|
williamr@2
|
116 |
}
|
williamr@2
|
117 |
|
williamr@2
|
118 |
explicit const_multi_array_ref(TPtr base,
|
williamr@2
|
119 |
const detail::multi_array::
|
williamr@2
|
120 |
extent_gen<NumDims>& ranges,
|
williamr@2
|
121 |
const general_storage_order<NumDims>& so) :
|
williamr@2
|
122 |
base_(base), storage_(so) {
|
williamr@2
|
123 |
|
williamr@2
|
124 |
init_from_extent_gen(ranges);
|
williamr@2
|
125 |
}
|
williamr@2
|
126 |
|
williamr@2
|
127 |
template <class InputIterator>
|
williamr@2
|
128 |
void assign(InputIterator begin, InputIterator end) {
|
williamr@2
|
129 |
boost::function_requires<InputIteratorConcept<InputIterator> >();
|
williamr@2
|
130 |
|
williamr@2
|
131 |
InputIterator in_iter = begin;
|
williamr@2
|
132 |
T* out_iter = base_;
|
williamr@2
|
133 |
std::size_t copy_count=0;
|
williamr@2
|
134 |
while (in_iter != end && copy_count < num_elements_) {
|
williamr@2
|
135 |
*out_iter++ = *in_iter++;
|
williamr@2
|
136 |
copy_count++;
|
williamr@2
|
137 |
}
|
williamr@2
|
138 |
}
|
williamr@2
|
139 |
|
williamr@2
|
140 |
template <class BaseList>
|
williamr@2
|
141 |
#ifdef BOOST_NO_SFINAE
|
williamr@2
|
142 |
void
|
williamr@2
|
143 |
#else
|
williamr@2
|
144 |
typename
|
williamr@2
|
145 |
disable_if<typename boost::is_integral<BaseList>::type,void >::type
|
williamr@2
|
146 |
#endif // BOOST_NO_SFINAE
|
williamr@2
|
147 |
reindex(const BaseList& values) {
|
williamr@2
|
148 |
boost::function_requires<
|
williamr@2
|
149 |
detail::multi_array::CollectionConcept<BaseList> >();
|
williamr@2
|
150 |
boost::detail::multi_array::
|
williamr@2
|
151 |
copy_n(values.begin(),num_dimensions(),index_base_list_.begin());
|
williamr@2
|
152 |
origin_offset_ =
|
williamr@2
|
153 |
this->calculate_origin_offset(stride_list_,extent_list_,
|
williamr@2
|
154 |
storage_,index_base_list_);
|
williamr@2
|
155 |
}
|
williamr@2
|
156 |
|
williamr@2
|
157 |
void reindex(index value) {
|
williamr@2
|
158 |
index_base_list_.assign(value);
|
williamr@2
|
159 |
origin_offset_ =
|
williamr@2
|
160 |
this->calculate_origin_offset(stride_list_,extent_list_,
|
williamr@2
|
161 |
storage_,index_base_list_);
|
williamr@2
|
162 |
}
|
williamr@2
|
163 |
|
williamr@2
|
164 |
template <typename SizeList>
|
williamr@2
|
165 |
void reshape(const SizeList& extents) {
|
williamr@2
|
166 |
boost::function_requires<
|
williamr@2
|
167 |
detail::multi_array::CollectionConcept<SizeList> >();
|
williamr@2
|
168 |
assert(num_elements_ ==
|
williamr@2
|
169 |
std::accumulate(extents.begin(),extents.end(),
|
williamr@2
|
170 |
size_type(1),std::multiplies<size_type>()));
|
williamr@2
|
171 |
|
williamr@2
|
172 |
std::copy(extents.begin(),extents.end(),extent_list_.begin());
|
williamr@2
|
173 |
this->compute_strides(stride_list_,extent_list_,storage_);
|
williamr@2
|
174 |
|
williamr@2
|
175 |
origin_offset_ =
|
williamr@2
|
176 |
this->calculate_origin_offset(stride_list_,extent_list_,
|
williamr@2
|
177 |
storage_,index_base_list_);
|
williamr@2
|
178 |
}
|
williamr@2
|
179 |
|
williamr@2
|
180 |
size_type num_dimensions() const { return NumDims; }
|
williamr@2
|
181 |
|
williamr@2
|
182 |
size_type size() const { return extent_list_.front(); }
|
williamr@2
|
183 |
|
williamr@2
|
184 |
// given reshaping functionality, this is the max possible size.
|
williamr@2
|
185 |
size_type max_size() const { return num_elements(); }
|
williamr@2
|
186 |
|
williamr@2
|
187 |
bool empty() const { return size() == 0; }
|
williamr@2
|
188 |
|
williamr@2
|
189 |
const size_type* shape() const {
|
williamr@2
|
190 |
return extent_list_.data();
|
williamr@2
|
191 |
}
|
williamr@2
|
192 |
|
williamr@2
|
193 |
const index* strides() const {
|
williamr@2
|
194 |
return stride_list_.data();
|
williamr@2
|
195 |
}
|
williamr@2
|
196 |
|
williamr@2
|
197 |
const element* origin() const { return base_+origin_offset_; }
|
williamr@2
|
198 |
const element* data() const { return base_; }
|
williamr@2
|
199 |
|
williamr@2
|
200 |
size_type num_elements() const { return num_elements_; }
|
williamr@2
|
201 |
|
williamr@2
|
202 |
const index* index_bases() const {
|
williamr@2
|
203 |
return index_base_list_.data();
|
williamr@2
|
204 |
}
|
williamr@2
|
205 |
|
williamr@2
|
206 |
|
williamr@2
|
207 |
const storage_order_type& storage_order() const {
|
williamr@2
|
208 |
return storage_;
|
williamr@2
|
209 |
}
|
williamr@2
|
210 |
|
williamr@2
|
211 |
template <typename IndexList>
|
williamr@2
|
212 |
const element& operator()(IndexList indices) const {
|
williamr@2
|
213 |
boost::function_requires<
|
williamr@2
|
214 |
detail::multi_array::CollectionConcept<IndexList> >();
|
williamr@2
|
215 |
return super_type::access_element(boost::type<const element&>(),
|
williamr@2
|
216 |
indices,origin(),
|
williamr@2
|
217 |
shape(),strides(),index_bases());
|
williamr@2
|
218 |
}
|
williamr@2
|
219 |
|
williamr@2
|
220 |
// Only allow const element access
|
williamr@2
|
221 |
const_reference operator[](index idx) const {
|
williamr@2
|
222 |
return super_type::access(boost::type<const_reference>(),
|
williamr@2
|
223 |
idx,origin(),
|
williamr@2
|
224 |
shape(),strides(),index_bases());
|
williamr@2
|
225 |
}
|
williamr@2
|
226 |
|
williamr@2
|
227 |
// see generate_array_view in base.hpp
|
williamr@2
|
228 |
#if !defined(BOOST_MSVC) || BOOST_MSVC > 1300
|
williamr@2
|
229 |
template <int NDims>
|
williamr@2
|
230 |
#else
|
williamr@2
|
231 |
template <int NumDims, int NDims> // else ICE
|
williamr@2
|
232 |
#endif // BOOST_MSVC
|
williamr@2
|
233 |
typename const_array_view<NDims>::type
|
williamr@2
|
234 |
operator[](const detail::multi_array::
|
williamr@2
|
235 |
index_gen<NumDims,NDims>& indices)
|
williamr@2
|
236 |
const {
|
williamr@2
|
237 |
typedef typename const_array_view<NDims>::type return_type;
|
williamr@2
|
238 |
return
|
williamr@2
|
239 |
super_type::generate_array_view(boost::type<return_type>(),
|
williamr@2
|
240 |
indices,
|
williamr@2
|
241 |
shape(),
|
williamr@2
|
242 |
strides(),
|
williamr@2
|
243 |
index_bases(),
|
williamr@2
|
244 |
origin());
|
williamr@2
|
245 |
}
|
williamr@2
|
246 |
|
williamr@2
|
247 |
const_iterator begin() const {
|
williamr@2
|
248 |
return const_iterator(*index_bases(),origin(),
|
williamr@2
|
249 |
shape(),strides(),index_bases());
|
williamr@2
|
250 |
}
|
williamr@2
|
251 |
|
williamr@2
|
252 |
const_iterator end() const {
|
williamr@2
|
253 |
return const_iterator(*index_bases()+(index)*shape(),origin(),
|
williamr@2
|
254 |
shape(),strides(),index_bases());
|
williamr@2
|
255 |
}
|
williamr@2
|
256 |
|
williamr@2
|
257 |
const_reverse_iterator rbegin() const {
|
williamr@2
|
258 |
return const_reverse_iterator(end());
|
williamr@2
|
259 |
}
|
williamr@2
|
260 |
|
williamr@2
|
261 |
const_reverse_iterator rend() const {
|
williamr@2
|
262 |
return const_reverse_iterator(begin());
|
williamr@2
|
263 |
}
|
williamr@2
|
264 |
|
williamr@2
|
265 |
|
williamr@2
|
266 |
template <typename OPtr>
|
williamr@2
|
267 |
bool operator==(const
|
williamr@2
|
268 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
269 |
const {
|
williamr@2
|
270 |
if(std::equal(extent_list_.begin(),
|
williamr@2
|
271 |
extent_list_.end(),
|
williamr@2
|
272 |
rhs.extent_list_.begin()))
|
williamr@2
|
273 |
return std::equal(begin(),end(),rhs.begin());
|
williamr@2
|
274 |
else return false;
|
williamr@2
|
275 |
}
|
williamr@2
|
276 |
|
williamr@2
|
277 |
template <typename OPtr>
|
williamr@2
|
278 |
bool operator<(const
|
williamr@2
|
279 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
280 |
const {
|
williamr@2
|
281 |
return std::lexicographical_compare(begin(),end(),rhs.begin(),rhs.end());
|
williamr@2
|
282 |
}
|
williamr@2
|
283 |
|
williamr@2
|
284 |
template <typename OPtr>
|
williamr@2
|
285 |
bool operator!=(const
|
williamr@2
|
286 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
287 |
const {
|
williamr@2
|
288 |
return !(*this == rhs);
|
williamr@2
|
289 |
}
|
williamr@2
|
290 |
|
williamr@2
|
291 |
template <typename OPtr>
|
williamr@2
|
292 |
bool operator>(const
|
williamr@2
|
293 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
294 |
const {
|
williamr@2
|
295 |
return rhs < *this;
|
williamr@2
|
296 |
}
|
williamr@2
|
297 |
|
williamr@2
|
298 |
template <typename OPtr>
|
williamr@2
|
299 |
bool operator<=(const
|
williamr@2
|
300 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
301 |
const {
|
williamr@2
|
302 |
return !(*this > rhs);
|
williamr@2
|
303 |
}
|
williamr@2
|
304 |
|
williamr@2
|
305 |
template <typename OPtr>
|
williamr@2
|
306 |
bool operator>=(const
|
williamr@2
|
307 |
const_multi_array_ref<T,NumDims,OPtr>& rhs)
|
williamr@2
|
308 |
const {
|
williamr@2
|
309 |
return !(*this < rhs);
|
williamr@2
|
310 |
}
|
williamr@2
|
311 |
|
williamr@2
|
312 |
|
williamr@2
|
313 |
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
|
williamr@2
|
314 |
protected:
|
williamr@2
|
315 |
#else
|
williamr@2
|
316 |
public:
|
williamr@2
|
317 |
#endif
|
williamr@2
|
318 |
|
williamr@2
|
319 |
typedef boost::array<size_type,NumDims> size_list;
|
williamr@2
|
320 |
typedef boost::array<index,NumDims> index_list;
|
williamr@2
|
321 |
|
williamr@2
|
322 |
// This is used by multi_array, which is a subclass of this
|
williamr@2
|
323 |
void set_base_ptr(TPtr new_base) { base_ = new_base; }
|
williamr@2
|
324 |
|
williamr@2
|
325 |
|
williamr@2
|
326 |
// This constructor supports multi_array's default constructor
|
williamr@2
|
327 |
// and constructors from multi_array_ref, subarray, and array_view
|
williamr@2
|
328 |
explicit
|
williamr@2
|
329 |
const_multi_array_ref(TPtr base,
|
williamr@2
|
330 |
const storage_order_type& so,
|
williamr@2
|
331 |
const index * index_bases,
|
williamr@2
|
332 |
const size_type* extents) :
|
williamr@2
|
333 |
base_(base), storage_(so), origin_offset_(0), directional_offset_(0)
|
williamr@2
|
334 |
{
|
williamr@2
|
335 |
// If index_bases or extents is null, then initialize the corresponding
|
williamr@2
|
336 |
// private data to zeroed lists.
|
williamr@2
|
337 |
if(index_bases) {
|
williamr@2
|
338 |
boost::detail::multi_array::
|
williamr@2
|
339 |
copy_n(index_bases,NumDims,index_base_list_.begin());
|
williamr@2
|
340 |
} else {
|
williamr@2
|
341 |
std::fill_n(index_base_list_.begin(),NumDims,0);
|
williamr@2
|
342 |
}
|
williamr@2
|
343 |
if(extents) {
|
williamr@2
|
344 |
init_multi_array_ref(extents);
|
williamr@2
|
345 |
} else {
|
williamr@2
|
346 |
boost::array<index,NumDims> extent_list;
|
williamr@2
|
347 |
extent_list.assign(0);
|
williamr@2
|
348 |
init_multi_array_ref(extent_list.begin());
|
williamr@2
|
349 |
}
|
williamr@2
|
350 |
}
|
williamr@2
|
351 |
|
williamr@2
|
352 |
|
williamr@2
|
353 |
TPtr base_;
|
williamr@2
|
354 |
storage_order_type storage_;
|
williamr@2
|
355 |
size_list extent_list_;
|
williamr@2
|
356 |
index_list stride_list_;
|
williamr@2
|
357 |
index_list index_base_list_;
|
williamr@2
|
358 |
index origin_offset_;
|
williamr@2
|
359 |
index directional_offset_;
|
williamr@2
|
360 |
size_type num_elements_;
|
williamr@2
|
361 |
|
williamr@2
|
362 |
private:
|
williamr@2
|
363 |
// const_multi_array_ref cannot be assigned to (no deep copies!)
|
williamr@2
|
364 |
const_multi_array_ref& operator=(const const_multi_array_ref& other);
|
williamr@2
|
365 |
|
williamr@2
|
366 |
void init_from_extent_gen(const
|
williamr@2
|
367 |
detail::multi_array::
|
williamr@2
|
368 |
extent_gen<NumDims>& ranges) {
|
williamr@2
|
369 |
|
williamr@2
|
370 |
typedef boost::array<index,NumDims> extent_list;
|
williamr@2
|
371 |
|
williamr@2
|
372 |
// get the index_base values
|
williamr@2
|
373 |
std::transform(ranges.ranges_.begin(),ranges.ranges_.end(),
|
williamr@2
|
374 |
index_base_list_.begin(),
|
williamr@2
|
375 |
boost::mem_fun_ref(&extent_range::start));
|
williamr@2
|
376 |
|
williamr@2
|
377 |
// calculate the extents
|
williamr@2
|
378 |
extent_list extents;
|
williamr@2
|
379 |
std::transform(ranges.ranges_.begin(),ranges.ranges_.end(),
|
williamr@2
|
380 |
extents.begin(),
|
williamr@2
|
381 |
boost::mem_fun_ref(&extent_range::size));
|
williamr@2
|
382 |
|
williamr@2
|
383 |
init_multi_array_ref(extents.begin());
|
williamr@2
|
384 |
}
|
williamr@2
|
385 |
|
williamr@2
|
386 |
|
williamr@2
|
387 |
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
|
williamr@2
|
388 |
protected:
|
williamr@2
|
389 |
#else
|
williamr@2
|
390 |
public:
|
williamr@2
|
391 |
#endif
|
williamr@2
|
392 |
// RG - move me!
|
williamr@2
|
393 |
template <class InputIterator>
|
williamr@2
|
394 |
void init_multi_array_ref(InputIterator extents_iter) {
|
williamr@2
|
395 |
boost::function_requires<InputIteratorConcept<InputIterator> >();
|
williamr@2
|
396 |
|
williamr@2
|
397 |
boost::detail::multi_array::
|
williamr@2
|
398 |
copy_n(extents_iter,num_dimensions(),extent_list_.begin());
|
williamr@2
|
399 |
|
williamr@2
|
400 |
// Calculate the array size
|
williamr@2
|
401 |
num_elements_ = std::accumulate(extent_list_.begin(),extent_list_.end(),
|
williamr@2
|
402 |
size_type(1),std::multiplies<size_type>());
|
williamr@2
|
403 |
|
williamr@2
|
404 |
this->compute_strides(stride_list_,extent_list_,storage_);
|
williamr@2
|
405 |
|
williamr@2
|
406 |
origin_offset_ =
|
williamr@2
|
407 |
this->calculate_origin_offset(stride_list_,extent_list_,
|
williamr@2
|
408 |
storage_,index_base_list_);
|
williamr@2
|
409 |
directional_offset_ =
|
williamr@2
|
410 |
this->calculate_descending_dimension_offset(stride_list_,extent_list_,
|
williamr@2
|
411 |
storage_);
|
williamr@2
|
412 |
}
|
williamr@2
|
413 |
};
|
williamr@2
|
414 |
|
williamr@2
|
415 |
template <typename T, std::size_t NumDims>
|
williamr@2
|
416 |
class multi_array_ref :
|
williamr@2
|
417 |
public const_multi_array_ref<T,NumDims,T*>
|
williamr@2
|
418 |
{
|
williamr@2
|
419 |
typedef const_multi_array_ref<T,NumDims,T*> super_type;
|
williamr@2
|
420 |
public:
|
williamr@2
|
421 |
typedef typename super_type::value_type value_type;
|
williamr@2
|
422 |
typedef typename super_type::reference reference;
|
williamr@2
|
423 |
typedef typename super_type::iterator iterator;
|
williamr@2
|
424 |
typedef typename super_type::reverse_iterator reverse_iterator;
|
williamr@2
|
425 |
typedef typename super_type::const_reference const_reference;
|
williamr@2
|
426 |
typedef typename super_type::const_iterator const_iterator;
|
williamr@2
|
427 |
typedef typename super_type::const_reverse_iterator const_reverse_iterator;
|
williamr@2
|
428 |
typedef typename super_type::element element;
|
williamr@2
|
429 |
typedef typename super_type::size_type size_type;
|
williamr@2
|
430 |
typedef typename super_type::difference_type difference_type;
|
williamr@2
|
431 |
typedef typename super_type::index index;
|
williamr@2
|
432 |
typedef typename super_type::extent_range extent_range;
|
williamr@2
|
433 |
|
williamr@2
|
434 |
typedef typename super_type::storage_order_type storage_order_type;
|
williamr@2
|
435 |
typedef typename super_type::index_list index_list;
|
williamr@2
|
436 |
typedef typename super_type::size_list size_list;
|
williamr@2
|
437 |
|
williamr@2
|
438 |
template <std::size_t NDims>
|
williamr@2
|
439 |
struct const_array_view {
|
williamr@2
|
440 |
typedef boost::detail::multi_array::const_multi_array_view<T,NDims> type;
|
williamr@2
|
441 |
};
|
williamr@2
|
442 |
|
williamr@2
|
443 |
template <std::size_t NDims>
|
williamr@2
|
444 |
struct array_view {
|
williamr@2
|
445 |
typedef boost::detail::multi_array::multi_array_view<T,NDims> type;
|
williamr@2
|
446 |
};
|
williamr@2
|
447 |
|
williamr@2
|
448 |
template <class ExtentList>
|
williamr@2
|
449 |
explicit multi_array_ref(T* base, const ExtentList& extents) :
|
williamr@2
|
450 |
super_type(base,extents) {
|
williamr@2
|
451 |
boost::function_requires<
|
williamr@2
|
452 |
detail::multi_array::CollectionConcept<ExtentList> >();
|
williamr@2
|
453 |
}
|
williamr@2
|
454 |
|
williamr@2
|
455 |
template <class ExtentList>
|
williamr@2
|
456 |
explicit multi_array_ref(T* base, const ExtentList& extents,
|
williamr@2
|
457 |
const general_storage_order<NumDims>& so) :
|
williamr@2
|
458 |
super_type(base,extents,so) {
|
williamr@2
|
459 |
boost::function_requires<
|
williamr@2
|
460 |
detail::multi_array::CollectionConcept<ExtentList> >();
|
williamr@2
|
461 |
}
|
williamr@2
|
462 |
|
williamr@2
|
463 |
|
williamr@2
|
464 |
explicit multi_array_ref(T* base,
|
williamr@2
|
465 |
const detail::multi_array::
|
williamr@2
|
466 |
extent_gen<NumDims>& ranges) :
|
williamr@2
|
467 |
super_type(base,ranges) { }
|
williamr@2
|
468 |
|
williamr@2
|
469 |
|
williamr@2
|
470 |
explicit multi_array_ref(T* base,
|
williamr@2
|
471 |
const detail::multi_array::
|
williamr@2
|
472 |
extent_gen<NumDims>&
|
williamr@2
|
473 |
ranges,
|
williamr@2
|
474 |
const general_storage_order<NumDims>& so) :
|
williamr@2
|
475 |
super_type(base,ranges,so) { }
|
williamr@2
|
476 |
|
williamr@2
|
477 |
|
williamr@2
|
478 |
// Assignment from other ConstMultiArray types.
|
williamr@2
|
479 |
template <typename ConstMultiArray>
|
williamr@2
|
480 |
multi_array_ref& operator=(const ConstMultiArray& other) {
|
williamr@2
|
481 |
function_requires<
|
williamr@2
|
482 |
detail::multi_array::
|
williamr@2
|
483 |
ConstMultiArrayConcept<ConstMultiArray,NumDims> >();
|
williamr@2
|
484 |
|
williamr@2
|
485 |
// make sure the dimensions agree
|
williamr@2
|
486 |
assert(other.num_dimensions() == this->num_dimensions());
|
williamr@2
|
487 |
assert(std::equal(other.shape(),other.shape()+this->num_dimensions(),
|
williamr@2
|
488 |
this->shape()));
|
williamr@2
|
489 |
// iterator-based copy
|
williamr@2
|
490 |
std::copy(other.begin(),other.end(),this->begin());
|
williamr@2
|
491 |
return *this;
|
williamr@2
|
492 |
}
|
williamr@2
|
493 |
|
williamr@2
|
494 |
multi_array_ref& operator=(const multi_array_ref& other) {
|
williamr@2
|
495 |
if (&other != this) {
|
williamr@2
|
496 |
// make sure the dimensions agree
|
williamr@2
|
497 |
|
williamr@2
|
498 |
assert(other.num_dimensions() == this->num_dimensions());
|
williamr@2
|
499 |
assert(std::equal(other.shape(),other.shape()+this->num_dimensions(),
|
williamr@2
|
500 |
this->shape()));
|
williamr@2
|
501 |
// iterator-based copy
|
williamr@2
|
502 |
std::copy(other.begin(),other.end(),this->begin());
|
williamr@2
|
503 |
}
|
williamr@2
|
504 |
return *this;
|
williamr@2
|
505 |
}
|
williamr@2
|
506 |
|
williamr@2
|
507 |
element* origin() { return super_type::base_+super_type::origin_offset_; }
|
williamr@2
|
508 |
|
williamr@2
|
509 |
element* data() { return super_type::base_; }
|
williamr@2
|
510 |
|
williamr@2
|
511 |
template <class IndexList>
|
williamr@2
|
512 |
element& operator()(const IndexList& indices) {
|
williamr@2
|
513 |
boost::function_requires<
|
williamr@2
|
514 |
detail::multi_array::CollectionConcept<IndexList> >();
|
williamr@2
|
515 |
return super_type::access_element(boost::type<element&>(),
|
williamr@2
|
516 |
indices,origin(),
|
williamr@2
|
517 |
this->shape(),this->strides(),
|
williamr@2
|
518 |
this->index_bases());
|
williamr@2
|
519 |
}
|
williamr@2
|
520 |
|
williamr@2
|
521 |
|
williamr@2
|
522 |
reference operator[](index idx) {
|
williamr@2
|
523 |
return super_type::access(boost::type<reference>(),
|
williamr@2
|
524 |
idx,origin(),
|
williamr@2
|
525 |
this->shape(),this->strides(),
|
williamr@2
|
526 |
this->index_bases());
|
williamr@2
|
527 |
}
|
williamr@2
|
528 |
|
williamr@2
|
529 |
|
williamr@2
|
530 |
// See note attached to generate_array_view in base.hpp
|
williamr@2
|
531 |
#if !defined(BOOST_MSVC) || BOOST_MSVC > 1300
|
williamr@2
|
532 |
template <int NDims>
|
williamr@2
|
533 |
#else
|
williamr@2
|
534 |
template <int NumDims, int NDims> // else ICE
|
williamr@2
|
535 |
#endif // BOOST_MSVC
|
williamr@2
|
536 |
typename array_view<NDims>::type
|
williamr@2
|
537 |
operator[](const detail::multi_array::
|
williamr@2
|
538 |
index_gen<NumDims,NDims>& indices) {
|
williamr@2
|
539 |
typedef typename array_view<NDims>::type return_type;
|
williamr@2
|
540 |
return
|
williamr@2
|
541 |
super_type::generate_array_view(boost::type<return_type>(),
|
williamr@2
|
542 |
indices,
|
williamr@2
|
543 |
this->shape(),
|
williamr@2
|
544 |
this->strides(),
|
williamr@2
|
545 |
this->index_bases(),
|
williamr@2
|
546 |
origin());
|
williamr@2
|
547 |
}
|
williamr@2
|
548 |
|
williamr@2
|
549 |
|
williamr@2
|
550 |
iterator begin() {
|
williamr@2
|
551 |
return iterator(*this->index_bases(),origin(),this->shape(),
|
williamr@2
|
552 |
this->strides(),this->index_bases());
|
williamr@2
|
553 |
}
|
williamr@2
|
554 |
|
williamr@2
|
555 |
iterator end() {
|
williamr@2
|
556 |
return iterator(*this->index_bases()+(index)*this->shape(),origin(),
|
williamr@2
|
557 |
this->shape(),this->strides(),
|
williamr@2
|
558 |
this->index_bases());
|
williamr@2
|
559 |
}
|
williamr@2
|
560 |
|
williamr@2
|
561 |
// rbegin() and rend() written naively to thwart MSVC ICE.
|
williamr@2
|
562 |
reverse_iterator rbegin() {
|
williamr@2
|
563 |
reverse_iterator ri(end());
|
williamr@2
|
564 |
return ri;
|
williamr@2
|
565 |
}
|
williamr@2
|
566 |
|
williamr@2
|
567 |
reverse_iterator rend() {
|
williamr@2
|
568 |
reverse_iterator ri(begin());
|
williamr@2
|
569 |
return ri;
|
williamr@2
|
570 |
}
|
williamr@2
|
571 |
|
williamr@2
|
572 |
// Using declarations don't seem to work for g++
|
williamr@2
|
573 |
// These are the proxies to work around this.
|
williamr@2
|
574 |
|
williamr@2
|
575 |
const element* origin() const { return super_type::origin(); }
|
williamr@2
|
576 |
const element* data() const { return super_type::data(); }
|
williamr@2
|
577 |
|
williamr@2
|
578 |
template <class IndexList>
|
williamr@2
|
579 |
const element& operator()(const IndexList& indices) const {
|
williamr@2
|
580 |
boost::function_requires<
|
williamr@2
|
581 |
detail::multi_array::CollectionConcept<IndexList> >();
|
williamr@2
|
582 |
return super_type::operator()(indices);
|
williamr@2
|
583 |
}
|
williamr@2
|
584 |
|
williamr@2
|
585 |
const_reference operator[](index idx) const {
|
williamr@2
|
586 |
return super_type::access(boost::type<const_reference>(),
|
williamr@2
|
587 |
idx,origin(),
|
williamr@2
|
588 |
this->shape(),this->strides(),
|
williamr@2
|
589 |
this->index_bases());
|
williamr@2
|
590 |
}
|
williamr@2
|
591 |
|
williamr@2
|
592 |
// See note attached to generate_array_view in base.hpp
|
williamr@2
|
593 |
#if !defined(BOOST_MSVC) || BOOST_MSVC > 1300
|
williamr@2
|
594 |
template <int NDims>
|
williamr@2
|
595 |
#else
|
williamr@2
|
596 |
template <int NumDims, int NDims> // else ICE
|
williamr@2
|
597 |
#endif // BOOST_MSVC
|
williamr@2
|
598 |
typename const_array_view<NDims>::type
|
williamr@2
|
599 |
operator[](const detail::multi_array::
|
williamr@2
|
600 |
index_gen<NumDims,NDims>& indices)
|
williamr@2
|
601 |
const {
|
williamr@2
|
602 |
return super_type::operator[](indices);
|
williamr@2
|
603 |
}
|
williamr@2
|
604 |
|
williamr@2
|
605 |
const_iterator begin() const {
|
williamr@2
|
606 |
return super_type::begin();
|
williamr@2
|
607 |
}
|
williamr@2
|
608 |
|
williamr@2
|
609 |
const_iterator end() const {
|
williamr@2
|
610 |
return super_type::end();
|
williamr@2
|
611 |
}
|
williamr@2
|
612 |
|
williamr@2
|
613 |
const_reverse_iterator rbegin() const {
|
williamr@2
|
614 |
return super_type::rbegin();
|
williamr@2
|
615 |
}
|
williamr@2
|
616 |
|
williamr@2
|
617 |
const_reverse_iterator rend() const {
|
williamr@2
|
618 |
return super_type::rend();
|
williamr@2
|
619 |
}
|
williamr@2
|
620 |
|
williamr@2
|
621 |
protected:
|
williamr@2
|
622 |
// This is only supplied to support multi_array's default constructor
|
williamr@2
|
623 |
explicit multi_array_ref(T* base,
|
williamr@2
|
624 |
const storage_order_type& so,
|
williamr@2
|
625 |
const index* index_bases,
|
williamr@2
|
626 |
const size_type* extents) :
|
williamr@2
|
627 |
super_type(base,so,index_bases,extents) { }
|
williamr@2
|
628 |
|
williamr@2
|
629 |
};
|
williamr@2
|
630 |
|
williamr@2
|
631 |
} // namespace boost
|
williamr@2
|
632 |
|
williamr@2
|
633 |
#endif // BOOST_MULTI_ARRAY_REF_RG071801_HPP
|