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
|
// SPDX-License-Identifier: Apache-2.0
//
// Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
// Copyright 2008-2016 National ICT Australia (NICTA)
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ------------------------------------------------------------------------
//! \addtogroup spop_trimat
//! @{
template<typename T1>
inline
void
spop_trimat::apply_noalias(SpMat<typename T1::elem_type>& out, const SpProxy<T1>& P, const bool upper)
{
arma_extra_debug_sigprint();
typename SpProxy<T1>::const_iterator_type it = P.begin();
const uword old_n_nonzero = P.get_n_nonzero();
uword new_n_nonzero = 0;
if(upper)
{
// upper triangular: count elements on the diagonal and above the diagonal
for(uword i=0; i < old_n_nonzero; ++i)
{
new_n_nonzero += (it.row() <= it.col()) ? uword(1) : uword(0);
++it;
}
}
else
{
// lower triangular: count elements on the diagonal and below the diagonal
for(uword i=0; i < old_n_nonzero; ++i)
{
new_n_nonzero += (it.row() >= it.col()) ? uword(1) : uword(0);
++it;
}
}
const uword n_rows = P.get_n_rows();
const uword n_cols = P.get_n_cols();
out.reserve(n_rows, n_cols, new_n_nonzero);
uword new_index = 0;
it = P.begin();
if(upper)
{
// upper triangular: copy elements on the diagonal and above the diagonal
for(uword i=0; i < old_n_nonzero; ++i)
{
const uword row = it.row();
const uword col = it.col();
if(row <= col)
{
access::rw(out.values[new_index]) = (*it);
access::rw(out.row_indices[new_index]) = row;
access::rw(out.col_ptrs[col + 1])++;
++new_index;
}
++it;
}
}
else
{
// lower triangular: copy elements on the diagonal and below the diagonal
for(uword i=0; i < old_n_nonzero; ++i)
{
const uword row = it.row();
const uword col = it.col();
if(row >= col)
{
access::rw(out.values[new_index]) = (*it);
access::rw(out.row_indices[new_index]) = row;
access::rw(out.col_ptrs[col + 1])++;
++new_index;
}
++it;
}
}
for(uword i=0; i < n_cols; ++i)
{
access::rw(out.col_ptrs[i + 1]) += out.col_ptrs[i];
}
}
template<typename T1>
inline
void
spop_trimat::apply(SpMat<typename T1::elem_type>& out, const SpOp<T1,spop_trimat>& in)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
const SpProxy<T1> P(in.m);
arma_debug_check( (P.get_n_rows() != P.get_n_cols()), "trimatu()/trimatl(): given matrix must be square sized" );
const bool upper = (in.aux_uword_a == 0);
if(P.is_alias(out))
{
SpMat<eT> tmp;
spop_trimat::apply_noalias(tmp, P, upper);
out.steal_mem(tmp);
}
else
{
spop_trimat::apply_noalias(out, P, upper);
}
}
//
template<typename eT>
inline
void
spop_trimatu_ext::apply_noalias(SpMat<eT>& out, const SpMat<eT>& A, const uword row_offset, const uword col_offset)
{
arma_extra_debug_sigprint();
const uword n_rows = A.n_rows;
const uword n_cols = A.n_cols;
arma_debug_check_bounds( ((row_offset > 0) && (row_offset >= n_rows)) || ((col_offset > 0) && (col_offset >= n_cols)), "trimatu(): requested diagonal is out of bounds" );
if(A.n_nonzero == 0) { out.zeros(n_rows, n_cols); return; }
out.reserve(n_rows, n_cols, A.n_nonzero); // upper bound on n_nonzero
uword count = 0;
const uword N = (std::min)(n_rows - row_offset, n_cols - col_offset);
for(uword i=0; i < n_cols; ++i)
{
const uword col = i + col_offset;
if(i < N)
{
typename SpMat<eT>::const_col_iterator it = A.begin_col_no_sync(col);
typename SpMat<eT>::const_col_iterator it_end = A.end_col_no_sync(col);
const uword end_row = i + row_offset;
for(; it != it_end; ++it)
{
const uword it_row = it.row();
if(it_row <= end_row)
{
const uword it_col = it.col();
access::rw(out.values[count]) = (*it);
access::rw(out.row_indices[count]) = it_row;
access::rw(out.col_ptrs[it_col + 1])++;
++count;
}
else
{
break;
}
}
}
else
{
if(col < n_cols)
{
typename SpMat<eT>::const_col_iterator it = A.begin_col_no_sync(col);
typename SpMat<eT>::const_col_iterator it_end = A.end_col_no_sync(col);
for(; it != it_end; ++it)
{
const uword it_row = it.row();
const uword it_col = it.col();
access::rw(out.values[count]) = (*it);
access::rw(out.row_indices[count]) = it_row;
access::rw(out.col_ptrs[it_col + 1])++;
++count;
}
}
}
}
for(uword i=0; i < n_cols; ++i)
{
access::rw(out.col_ptrs[i + 1]) += out.col_ptrs[i];
}
if(count < A.n_nonzero) { out.mem_resize(count); }
}
template<typename T1>
inline
void
spop_trimatu_ext::apply(SpMat<typename T1::elem_type>& out, const SpOp<T1,spop_trimatu_ext>& in)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
const unwrap_spmat<T1> U(in.m);
const SpMat<eT>& A = U.M;
arma_debug_check( (A.is_square() == false), "trimatu(): given matrix must be square sized" );
const uword row_offset = in.aux_uword_a;
const uword col_offset = in.aux_uword_b;
if(U.is_alias(out))
{
SpMat<eT> tmp;
spop_trimatu_ext::apply_noalias(tmp, A, row_offset, col_offset);
out.steal_mem(tmp);
}
else
{
spop_trimatu_ext::apply_noalias(out, A, row_offset, col_offset);
}
}
//
template<typename eT>
inline
void
spop_trimatl_ext::apply_noalias(SpMat<eT>& out, const SpMat<eT>& A, const uword row_offset, const uword col_offset)
{
arma_extra_debug_sigprint();
const uword n_rows = A.n_rows;
const uword n_cols = A.n_cols;
arma_debug_check_bounds( ((row_offset > 0) && (row_offset >= n_rows)) || ((col_offset > 0) && (col_offset >= n_cols)), "trimatl(): requested diagonal is out of bounds" );
if(A.n_nonzero == 0) { out.zeros(n_rows, n_cols); return; }
out.reserve(n_rows, n_cols, A.n_nonzero); // upper bound on n_nonzero
uword count = 0;
if(col_offset > 0)
{
typename SpMat<eT>::const_col_iterator it = A.begin_col_no_sync(0);
typename SpMat<eT>::const_col_iterator it_end = A.end_col_no_sync(col_offset-1);
for(; it != it_end; ++it)
{
const uword it_row = it.row();
const uword it_col = it.col();
access::rw(out.values[count]) = (*it);
access::rw(out.row_indices[count]) = it_row;
access::rw(out.col_ptrs[it_col + 1])++;
++count;
}
}
const uword N = (std::min)(n_rows - row_offset, n_cols - col_offset);
for(uword i=0; i < N; ++i)
{
const uword start_row = i + row_offset;
const uword col = i + col_offset;
typename SpMat<eT>::const_col_iterator it = A.begin_col_no_sync(col);
typename SpMat<eT>::const_col_iterator it_end = A.end_col_no_sync(col);
for(; it != it_end; ++it)
{
const uword it_row = it.row();
if(it_row >= start_row)
{
const uword it_col = it.col();
access::rw(out.values[count]) = (*it);
access::rw(out.row_indices[count]) = it_row;
access::rw(out.col_ptrs[it_col + 1])++;
++count;
}
}
}
for(uword i=0; i < n_cols; ++i)
{
access::rw(out.col_ptrs[i + 1]) += out.col_ptrs[i];
}
if(count < A.n_nonzero) { out.mem_resize(count); }
}
template<typename T1>
inline
void
spop_trimatl_ext::apply(SpMat<typename T1::elem_type>& out, const SpOp<T1,spop_trimatl_ext>& in)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
const unwrap_spmat<T1> U(in.m);
const SpMat<eT>& A = U.M;
arma_debug_check( (A.is_square() == false), "trimatl(): given matrix must be square sized" );
const uword row_offset = in.aux_uword_a;
const uword col_offset = in.aux_uword_b;
if(U.is_alias(out))
{
SpMat<eT> tmp;
spop_trimatl_ext::apply_noalias(tmp, A, row_offset, col_offset);
out.steal_mem(tmp);
}
else
{
spop_trimatl_ext::apply_noalias(out, A, row_offset, col_offset);
}
}
//! @}
|
