1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
|
/*
* Copyright (c) 2007, Michael Lehn
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3) Neither the name of the FLENS development group nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef FLENS_STORAGE_FULLSTORAGE_CONSTFULLSTORAGEVIEW_TCC
#define FLENS_STORAGE_FULLSTORAGE_CONSTFULLSTORAGEVIEW_TCC 1
#include <flens/storage/fullstorage/constfullstorageview.h>
#include <flens/auxiliary/macros.h>
#include <flens/typedefs.h>
namespace flens {
template <typename T, StorageOrder NVOrder, typename I, typename A>
ConstFullStorageView<T, NVOrder, I, A>::ConstFullStorageView(
IndexType numRows,
IndexType numCols,
IndexType leadingDimension,
const ElementType *data,
IndexType firstRow,
IndexType firstCol,
const Allocator &allocator)
: data_(data), allocator_(allocator),
numRows_(numRows), numCols_(numCols),
strideRow_((NVOrder==ColMajor) ? IndexType(1) : leadingDimension),
strideCol_((NVOrder==ColMajor) ? leadingDimension : IndexType(1)),
firstRow_(0), firstCol_(0)
{
# ifndef NDEBUG
ASSERT(numRows_>=0);
ASSERT(numCols_>=0);
if (NVOrder==ColMajor) {
ASSERT(leadingDimension>=numRows);
}
if (NVOrder==RowMajor) {
ASSERT(leadingDimension>=numCols);
}
# endif
changeIndexBase(firstRow, firstCol);
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
ConstFullStorageView<T, NVOrder, I, A>::ConstFullStorageView(
IndexType numRows,
IndexType numCols,
const ElementType *data,
IndexType strideRow,
IndexType strideCol,
IndexType firstRow,
IndexType firstCol,
const Allocator &allocator)
: data_(data), allocator_(allocator),
numRows_(numRows), numCols_(numCols),
strideRow_(strideRow), strideCol_(strideCol),
firstRow_(0), firstCol_(0)
{
ASSERT(numRows_>=0);
ASSERT(numCols_>=0);
changeIndexBase(firstRow, firstCol);
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
ConstFullStorageView<T, NVOrder, I, A>::ConstFullStorageView(
const ConstFullStorageView &rhs)
: data_(rhs.data_),
allocator_(rhs.allocator_),
numRows_(rhs.numRows_), numCols_(rhs.numCols_),
strideRow_(rhs.strideRow()), strideCol_(rhs.strideCol()),
firstRow_(rhs.firstRow_), firstCol_(rhs.firstCol_)
{
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
template <typename RHS>
ConstFullStorageView<T, NVOrder, I, A>::ConstFullStorageView(const RHS &rhs)
: data_(rhs.data()),
allocator_(rhs.allocator()),
numRows_(rhs.numRows()), numCols_(rhs.numCols()),
strideRow_(rhs.strideRow()), strideCol_(rhs.strideCol()),
firstRow_(0), firstCol_(0)
{
changeIndexBase(rhs.firstRow(), rhs.firstCol());
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
ConstFullStorageView<T, NVOrder, I, A>::~ConstFullStorageView()
{
}
//-- operators -----------------------------------------------------------------
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ElementType &
ConstFullStorageView<T, NVOrder, I, A>::operator()(IndexType row,
IndexType col) const
{
# ifndef NDEBUG
if (numRows()>0 && numCols()>0) {
ASSERT(row>=firstRow_);
ASSERT(row<firstRow_+numRows_);
ASSERT(col>=firstCol_);
ASSERT(col<firstCol_+numCols_);
} else {
ASSERT(row==firstRow_);
ASSERT(col==firstCol_);
ASSERT(data_);
}
# endif
if (strideRow_==IndexType(1)) {
return data_[row+col*strideCol_];
}
if (strideCol_==IndexType(1)) {
return data_[row*strideRow_+col];
}
return data_[row*strideRow_+col*strideCol_];
}
//-- methods -------------------------------------------------------------------
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::firstRow() const
{
return firstRow_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::firstCol() const
{
return firstCol_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::lastRow() const
{
return firstRow_+numRows_-1;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::lastCol() const
{
return firstCol_+numCols_-1;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::numRows() const
{
return numRows_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::numCols() const
{
return numCols_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
StorageOrder
ConstFullStorageView<T, NVOrder, I, A>::order() const
{
if (strideRow_==IndexType(1)) {
return ColMajor;
}
if (strideCol_==IndexType(1)) {
return RowMajor;
}
return Grid;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::leadingDimension() const
{
if (strideRow_==IndexType(1)) {
return strideCol_;
}
if (strideCol_==IndexType(1)) {
return strideRow_;
}
ASSERT(0); // Grid views do not have a leading dimension
return 0;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::strideRow() const
{
return strideRow_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
typename ConstFullStorageView<T, NVOrder, I, A>::IndexType
ConstFullStorageView<T, NVOrder, I, A>::strideCol() const
{
return strideCol_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ElementType *
ConstFullStorageView<T, NVOrder, I, A>::data() const
{
return &(this->operator()(firstRow_, firstCol_));
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::Allocator &
ConstFullStorageView<T, NVOrder, I, A>::allocator() const
{
return allocator_;
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
void
ConstFullStorageView<T, NVOrder, I, A>::changeIndexBase(IndexType firstRow,
IndexType firstCol)
{
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if ((numRows()==0) || (numCols()==0)) {
firstRow_ = firstRow;
firstCol_ = firstCol;
return;
}
# endif
if (data_) {
data_ = data() - (firstRow*strideRow() + firstCol*strideCol());
}
firstRow_ = firstRow;
firstCol_ = firstCol;
}
/// view of fullstorage scheme as an array
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::arrayView(IndexType firstViewIndex
) const
{
# ifndef NDEBUG
if (numRows()*strideRow()!=strideCol()
&& numCols()*strideCol()!=strideRow())
{
ASSERT(0);
}
# endif
return ConstArrayView(numCols()*numRows(),
data(),
std::min(strideRow(), strideCol()),
firstViewIndex,
allocator());
}
// view of rectangular part
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstView
ConstFullStorageView<T, NVOrder, I, A>::view(IndexType fromRow,
IndexType fromCol,
IndexType toRow,
IndexType toCol,
IndexType strideRow,
IndexType strideCol,
IndexType firstViewRow,
IndexType firstViewCol) const
{
const IndexType numRows = (toRow-fromRow)/strideRow+1;
const IndexType numCols = (toCol-fromCol)/strideCol+1;
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if ((numRows==0) || (numCols==0)) {
return ConstView(numRows, numCols, 0,
this->strideRow(), this->strideCol(),
firstViewRow, firstViewCol, allocator());
}
# endif
ASSERT(fromRow>=firstRow());
ASSERT(fromRow<=toRow);
ASSERT(toRow<=lastRow());
ASSERT(fromCol>=firstCol());
ASSERT(fromCol<=toCol);
ASSERT(toCol<=lastCol());
return ConstView(numRows, // # rows
numCols, // # cols
&(operator()(fromRow, fromCol)), // data
this->strideRow()*strideRow, // strideRow
this->strideCol()*strideCol, // strideCol
firstViewRow, // firstRow
firstViewCol, // firstCol
allocator()); // allocator
}
// view of single row
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewRow(IndexType row,
IndexType firstViewIndex) const
{
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if (numCols()==0) {
return ConstArrayView(numCols(), 0, strideCol(),
firstViewIndex, allocator());
}
# endif
ASSERT(row>=firstRow());
ASSERT(row<=lastRow());
return ConstArrayView(numCols(),
&(this->operator()(row, firstCol_)),
strideCol(),
firstViewIndex,
allocator());
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewRow(IndexType row,
IndexType firstCol,
IndexType lastCol,
IndexType stride,
IndexType firstViewIndex) const
{
const IndexType length = (lastCol-firstCol)/stride+1;
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if (length==0) {
return ConstArrayView(length, 0, strideCol()*stride,
firstViewIndex, allocator());
}
# endif
ASSERT(row>=firstRow());
ASSERT(row<=lastRow());
return ConstArrayView(length,
&(this->operator()(row, firstCol)),
strideCol()*stride,
firstViewIndex,
allocator());
}
// view of single columns
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewCol(IndexType col,
IndexType firstViewIndex) const
{
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if (numRows()==0) {
return ConstArrayView(numRows(), 0, strideRow(),
firstViewIndex, allocator());
}
# endif
ASSERT(col>=firstCol());
ASSERT(col<=lastCol());
return ConstArrayView(numRows(),
&(this->operator()(firstRow_, col)),
strideRow(),
firstViewIndex,
allocator());
}
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewCol(IndexType firstRow,
IndexType lastRow,
IndexType stride,
IndexType col,
IndexType firstViewIndex) const
{
const IndexType length = (lastRow-firstRow)/stride+1;
# ifndef NDEBUG
// prevent an out-of-bound assertion in case a view is empty anyway
if (length==0) {
return ConstArrayView(length, 0, strideRow()*stride,
firstViewIndex, allocator());
}
# endif
ASSERT(col>=firstCol());
ASSERT(col<=lastCol());
return ConstArrayView(length,
&(this->operator()(firstRow, col)),
strideRow()*stride,
firstViewIndex,
allocator());
}
// view of d-th diagonal
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewDiag(IndexType d,
IndexType firstViewIndex) const
{
IndexType row_ = (d>0) ? 0 : -d;
IndexType col_ = (d>0) ? d : 0;
IndexType row = firstRow() + row_;
IndexType col = firstCol() + col_;
return ConstArrayView(std::min(numRows()-row_, numCols()-col_),
&(this->operator()(row,col)),
strideRow()+strideCol(),
firstViewIndex,
allocator());
}
// view of d-th anti-diagonal
template <typename T, StorageOrder NVOrder, typename I, typename A>
const typename ConstFullStorageView<T, NVOrder, I, A>::ConstArrayView
ConstFullStorageView<T, NVOrder, I, A>::viewAntiDiag(IndexType d,
IndexType firstViewIndex
) const
{
IndexType row_ = (d>0) ? 0 : -d;
IndexType col_ = (d>0) ? d : 0;
IndexType row = firstRow() + row_;
IndexType col = firstCol() + col_;
return ConstArrayView(std::min(numRows()-row_, numCols()-col_),
&(this->operator()(row,lastCol()-col+1)),
-strideCol()+strideRow(),
firstViewIndex,
allocator());
}
} // namespace flens
#endif // FLENS_STORAGE_FULLSTORAGE_CONSTFULLSTORAGEVIEW_TCC
|