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
|
// 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 op_reshape
//! @{
template<typename T1>
inline
void
op_reshape::apply(Mat<typename T1::elem_type>& actual_out, const Op<T1,op_reshape>& in)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
const uword new_n_rows = in.aux_uword_a;
const uword new_n_cols = in.aux_uword_b;
if(is_Mat<T1>::value || (arma_config::openmp && Proxy<T1>::use_mp))
{
const unwrap<T1> U(in.m);
const Mat<eT>& A = U.M;
if(&actual_out == &A)
{
op_reshape::apply_mat_inplace(actual_out, new_n_rows, new_n_cols);
}
else
{
op_reshape::apply_mat_noalias(actual_out, A, new_n_rows, new_n_cols);
}
}
else
{
const Proxy<T1> P(in.m);
const bool is_alias = P.is_alias(actual_out);
Mat<eT> tmp;
Mat<eT>& out = (is_alias) ? tmp : actual_out;
if(is_Mat<typename Proxy<T1>::stored_type>::value)
{
const quasi_unwrap<typename Proxy<T1>::stored_type> U(P.Q);
op_reshape::apply_mat_noalias(out, U.M, new_n_rows, new_n_cols);
}
else
{
op_reshape::apply_proxy_noalias(out, P, new_n_rows, new_n_cols);
}
if(is_alias) { actual_out.steal_mem(tmp); }
}
}
template<typename eT>
inline
void
op_reshape::apply_mat_inplace(Mat<eT>& A, const uword new_n_rows, const uword new_n_cols)
{
arma_extra_debug_sigprint();
const uword new_n_elem = new_n_rows * new_n_cols;
if(A.n_elem == new_n_elem) { A.set_size(new_n_rows, new_n_cols); return; }
Mat<eT> B;
op_reshape::apply_mat_noalias(B, A, new_n_rows, new_n_cols);
A.steal_mem(B);
}
template<typename eT>
inline
void
op_reshape::apply_mat_noalias(Mat<eT>& out, const Mat<eT>& A, const uword new_n_rows, const uword new_n_cols)
{
arma_extra_debug_sigprint();
out.set_size(new_n_rows, new_n_cols);
const uword n_elem_to_copy = (std::min)(A.n_elem, out.n_elem);
eT* out_mem = out.memptr();
arrayops::copy( out_mem, A.memptr(), n_elem_to_copy );
if(n_elem_to_copy < out.n_elem)
{
const uword n_elem_leftover = out.n_elem - n_elem_to_copy;
arrayops::fill_zeros(&(out_mem[n_elem_to_copy]), n_elem_leftover);
}
}
template<typename T1>
inline
void
op_reshape::apply_proxy_noalias(Mat<typename T1::elem_type>& out, const Proxy<T1>& P, const uword new_n_rows, const uword new_n_cols)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
out.set_size(new_n_rows, new_n_cols);
const uword n_elem_to_copy = (std::min)(P.get_n_elem(), out.n_elem);
eT* out_mem = out.memptr();
if(Proxy<T1>::use_at == false)
{
typename Proxy<T1>::ea_type Pea = P.get_ea();
for(uword i=0; i < n_elem_to_copy; ++i) { out_mem[i] = Pea[i]; }
}
else
{
uword i = 0;
const uword P_n_rows = P.get_n_rows();
const uword P_n_cols = P.get_n_cols();
for(uword col=0; col < P_n_cols; ++col)
for(uword row=0; row < P_n_rows; ++row)
{
if(i >= n_elem_to_copy) { goto nested_loop_end; }
out_mem[i] = P.at(row,col);
++i;
}
nested_loop_end: ;
}
if(n_elem_to_copy < out.n_elem)
{
const uword n_elem_leftover = out.n_elem - n_elem_to_copy;
arrayops::fill_zeros(&(out_mem[n_elem_to_copy]), n_elem_leftover);
}
}
template<typename T1>
inline
void
op_reshape::apply(Cube<typename T1::elem_type>& out, const OpCube<T1,op_reshape>& in)
{
arma_extra_debug_sigprint();
typedef typename T1::elem_type eT;
const unwrap_cube<T1> U(in.m);
const Cube<eT>& A = U.M;
const uword new_n_rows = in.aux_uword_a;
const uword new_n_cols = in.aux_uword_b;
const uword new_n_slices = in.aux_uword_c;
if(&out == &A)
{
op_reshape::apply_cube_inplace(out, new_n_rows, new_n_cols, new_n_slices);
}
else
{
op_reshape::apply_cube_noalias(out, A, new_n_rows, new_n_cols, new_n_slices);
}
}
template<typename eT>
inline
void
op_reshape::apply_cube_inplace(Cube<eT>& A, const uword new_n_rows, const uword new_n_cols, const uword new_n_slices)
{
arma_extra_debug_sigprint();
const uword new_n_elem = new_n_rows * new_n_cols * new_n_slices;
if(A.n_elem == new_n_elem) { A.set_size(new_n_rows, new_n_cols, new_n_slices); return; }
Cube<eT> B;
op_reshape::apply_cube_noalias(B, A, new_n_rows, new_n_cols, new_n_slices);
A.steal_mem(B);
}
template<typename eT>
inline
void
op_reshape::apply_cube_noalias(Cube<eT>& out, const Cube<eT>& A, const uword new_n_rows, const uword new_n_cols, const uword new_n_slices)
{
arma_extra_debug_sigprint();
out.set_size(new_n_rows, new_n_cols, new_n_slices);
const uword n_elem_to_copy = (std::min)(A.n_elem, out.n_elem);
eT* out_mem = out.memptr();
arrayops::copy( out_mem, A.memptr(), n_elem_to_copy );
if(n_elem_to_copy < out.n_elem)
{
const uword n_elem_leftover = out.n_elem - n_elem_to_copy;
arrayops::fill_zeros(&(out_mem[n_elem_to_copy]), n_elem_leftover);
}
}
//! @}
|
