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 operator_schur
//! @{
// operator %, which we define it to do a schur product (element-wise multiplication)
//! element-wise multiplication of user-accessible Armadillo objects with same element type
template<typename T1, typename T2>
arma_inline
typename
enable_if2
<
is_arma_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value,
const eGlue<T1, T2, eglue_schur>
>::result
operator%
(
const T1& X,
const T2& Y
)
{
arma_extra_debug_sigprint();
return eGlue<T1, T2, eglue_schur>(X, Y);
}
//! element-wise multiplication of user-accessible Armadillo objects with different element types
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_type<T1>::value && is_arma_type<T2>::value && (is_same_type<typename T1::elem_type, typename T2::elem_type>::no)),
const mtGlue<typename promote_type<typename T1::elem_type, typename T2::elem_type>::result, T1, T2, glue_mixed_schur>
>::result
operator%
(
const T1& X,
const T2& Y
)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT1;
typedef typename T2::elem_type eT2;
typedef typename promote_type<eT1,eT2>::result out_eT;
promote_type<eT1,eT2>::check();
return mtGlue<out_eT, T1, T2, glue_mixed_schur>( X, Y );
}
//! element-wise multiplication of two sparse matrices
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_sparse_type<T1>::value && is_arma_sparse_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
SpGlue<T1,T2,spglue_schur>
>::result
operator%
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
return SpGlue<T1,T2,spglue_schur>(x, y);
}
//! element-wise multiplication of one dense and one sparse object
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_type<T1>::value && is_arma_sparse_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
SpMat<typename T1::elem_type>
>::result
operator%
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
SpMat<typename T1::elem_type> out;
spglue_schur_misc::dense_schur_sparse(out, x, y);
return out;
}
//! element-wise multiplication of one sparse and one dense object
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_sparse_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::value),
SpMat<typename T1::elem_type>
>::result
operator%
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
SpMat<typename T1::elem_type> out;
// Just call the other order (these operations are commutative)
// TODO: if there is a matrix size mismatch, the debug assert will print the matrix sizes in wrong order
spglue_schur_misc::dense_schur_sparse(out, y, x);
return out;
}
//! optimization: sparse % (sparse +/- scalar) can be done without forming the dense result of the (sparse +/- scalar) term
template<typename T1, typename T2, typename op_type>
inline
typename
enable_if2
<
(
is_arma_sparse_type<T1>::value && is_arma_sparse_type<T2>::value &&
is_same_type<typename T1::elem_type, typename T2::elem_type>::yes &&
(is_same_type<op_type, op_sp_plus>::value ||
is_same_type<op_type, op_sp_minus_pre>::value ||
is_same_type<op_type, op_sp_minus_post>::value)
),
SpMat<typename T1::elem_type>
>::result
operator%
(
const T1& x,
const SpToDOp<T2, op_type>& y
)
{
arma_extra_debug_sigprint();
SpMat<typename T1::elem_type> out;
op_type::apply_inside_schur(out, x, y);
return out;
}
//! optimization: (sparse +/- scalar) % sparse can be done without forming the dense result of the (sparse +/- scalar) term
template<typename T1, typename T2, typename op_type>
inline
typename
enable_if2
<
(
is_arma_sparse_type<T1>::value && is_arma_sparse_type<T2>::value &&
is_same_type<typename T1::elem_type, typename T2::elem_type>::yes &&
(is_same_type<op_type, op_sp_plus>::value ||
is_same_type<op_type, op_sp_minus_pre>::value ||
is_same_type<op_type, op_sp_minus_post>::value)
),
SpMat<typename T1::elem_type>
>::result
operator%
(
const SpToDOp<T1, op_type>& x,
const T2& y
)
{
arma_extra_debug_sigprint();
SpMat<typename T1::elem_type> out;
// Just call the other order (these operations are commutative)
// TODO: if there is a matrix size mismatch, the debug assert will print the matrix sizes in wrong order
op_type::apply_inside_schur(out, y, x);
return out;
}
//! element-wise multiplication of two sparse objects with different element types
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_sparse_type<T1>::value && is_arma_sparse_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::no),
const mtSpGlue< typename promote_type<typename T1::elem_type, typename T2::elem_type>::result, T1, T2, spglue_schur_mixed >
>::result
operator%
(
const T1& X,
const T2& Y
)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT1;
typedef typename T2::elem_type eT2;
typedef typename promote_type<eT1,eT2>::result out_eT;
promote_type<eT1,eT2>::check();
return mtSpGlue<out_eT, T1, T2, spglue_schur_mixed>( X, Y );
}
//! element-wise multiplication of one dense and one sparse object with different element types
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_type<T1>::value && is_arma_sparse_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::no),
SpMat< typename promote_type<typename T1::elem_type, typename T2::elem_type>::result >
>::result
operator%
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
SpMat< typename promote_type<typename T1::elem_type, typename T2::elem_type>::result > out;
spglue_schur_mixed::dense_schur_sparse(out, x, y);
return out;
}
//! element-wise multiplication of one sparse and one dense object with different element types
template<typename T1, typename T2>
inline
typename
enable_if2
<
(is_arma_sparse_type<T1>::value && is_arma_type<T2>::value && is_same_type<typename T1::elem_type, typename T2::elem_type>::no),
SpMat< typename promote_type<typename T1::elem_type, typename T2::elem_type>::result >
>::result
operator%
(
const T1& x,
const T2& y
)
{
arma_extra_debug_sigprint();
SpMat< typename promote_type<typename T1::elem_type, typename T2::elem_type>::result > out;
// Just call the other order (these operations are commutative)
// TODO: if there is a matrix size mismatch, the debug assert will print the matrix sizes in wrong order
spglue_schur_mixed::dense_schur_sparse(out, y, x);
return out;
}
template<typename parent, unsigned int mode, typename T2>
inline
Mat<typename parent::elem_type>
operator%
(
const subview_each1<parent,mode>& X,
const Base<typename parent::elem_type,T2>& Y
)
{
arma_extra_debug_sigprint();
return subview_each1_aux::operator_schur(X, Y.get_ref());
}
template<typename T1, typename parent, unsigned int mode>
arma_inline
Mat<typename parent::elem_type>
operator%
(
const Base<typename parent::elem_type,T1>& X,
const subview_each1<parent,mode>& Y
)
{
arma_extra_debug_sigprint();
return subview_each1_aux::operator_schur(Y, X.get_ref()); // NOTE: swapped order
}
template<typename parent, unsigned int mode, typename TB, typename T2>
inline
Mat<typename parent::elem_type>
operator%
(
const subview_each2<parent,mode,TB>& X,
const Base<typename parent::elem_type,T2>& Y
)
{
arma_extra_debug_sigprint();
return subview_each2_aux::operator_schur(X, Y.get_ref());
}
template<typename T1, typename parent, unsigned int mode, typename TB>
arma_inline
Mat<typename parent::elem_type>
operator%
(
const Base<typename parent::elem_type,T1>& X,
const subview_each2<parent,mode,TB>& Y
)
{
arma_extra_debug_sigprint();
return subview_each2_aux::operator_schur(Y, X.get_ref()); // NOTE: swapped order
}
//! @}
|
