123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387 |
- // 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 eT>
- inline
- void
- op_reshape::apply_unwrap(Mat<eT>& out, const Mat<eT>& A, const uword in_n_rows, const uword in_n_cols, const uword in_dim)
- {
- arma_extra_debug_sigprint();
-
- const bool is_alias = (&out == &A);
-
- const uword in_n_elem = in_n_rows * in_n_cols;
-
- if(A.n_elem == in_n_elem)
- {
- if(in_dim == 0)
- {
- if(is_alias == false)
- {
- out.set_size(in_n_rows, in_n_cols);
- arrayops::copy( out.memptr(), A.memptr(), out.n_elem );
- }
- else // &out == &A, i.e. inplace reshape
- {
- out.set_size(in_n_rows, in_n_cols);
- // set_size() doesn't destroy data as long as the number of elements in the matrix remains the same
- }
- }
- else
- {
- unwrap_check< Mat<eT> > B_tmp(A, is_alias);
- const Mat<eT>& B = B_tmp.M;
-
- out.set_size(in_n_rows, in_n_cols);
-
- eT* out_mem = out.memptr();
-
- const uword B_n_rows = B.n_rows;
- const uword B_n_cols = B.n_cols;
-
- for(uword row=0; row<B_n_rows; ++row)
- {
- uword i,j;
- for(i=0, j=1; j < B_n_cols; i+=2, j+=2)
- {
- const eT tmp_i = B.at(row,i);
- const eT tmp_j = B.at(row,j);
-
- *out_mem = tmp_i; out_mem++;
- *out_mem = tmp_j; out_mem++;
- }
-
- if(i < B_n_cols)
- {
- *out_mem = B.at(row,i); out_mem++;
- }
- }
- }
- }
- else
- {
- const unwrap_check< Mat<eT> > B_tmp(A, is_alias);
- const Mat<eT>& B = B_tmp.M;
-
- const uword n_elem_to_copy = (std::min)(B.n_elem, in_n_elem);
-
- out.set_size(in_n_rows, in_n_cols);
-
- eT* out_mem = out.memptr();
-
- if(in_dim == 0)
- {
- arrayops::copy( out_mem, B.memptr(), n_elem_to_copy );
- }
- else
- {
- uword row = 0;
- uword col = 0;
-
- const uword B_n_cols = B.n_cols;
-
- for(uword i=0; i<n_elem_to_copy; ++i)
- {
- out_mem[i] = B.at(row,col);
-
- ++col;
-
- if(col >= B_n_cols)
- {
- col = 0;
- ++row;
- }
- }
- }
-
- for(uword i=n_elem_to_copy; i<in_n_elem; ++i)
- {
- out_mem[i] = eT(0);
- }
-
- }
- }
- template<typename T1>
- inline
- void
- op_reshape::apply_proxy(Mat<typename T1::elem_type>& out, const Proxy<T1>& P, const uword in_n_rows, const uword in_n_cols)
- {
- arma_extra_debug_sigprint();
-
- typedef typename T1::elem_type eT;
-
- out.set_size(in_n_rows, in_n_cols);
-
- eT* out_mem = out.memptr();
-
- const uword in_n_elem = in_n_rows * in_n_cols;
-
- if(P.get_n_elem() == in_n_elem)
- {
- if(Proxy<T1>::use_at == false)
- {
- typename Proxy<T1>::ea_type Pea = P.get_ea();
-
- for(uword i=0; i<in_n_elem; ++i)
- {
- out_mem[i] = Pea[i];
- }
- }
- else
- {
- 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)
- {
- uword i,j;
-
- for(i=0, j=1; j < P_n_rows; i+=2, j+=2)
- {
- const eT tmp_i = P.at(i,col);
- const eT tmp_j = P.at(j,col);
-
- *out_mem = tmp_i; out_mem++;
- *out_mem = tmp_j; out_mem++;
- }
-
- if(i < P_n_rows)
- {
- *out_mem = P.at(i,col); out_mem++;
- }
- }
- }
- }
- else
- {
- const uword n_elem_to_copy = (std::min)(P.get_n_elem(), in_n_elem);
-
- 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: ;
- }
-
- for(uword i=n_elem_to_copy; i<in_n_elem; ++i)
- {
- out_mem[i] = eT(0);
- }
- }
- }
- template<typename T1>
- inline
- void
- op_reshape::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_reshape>& in)
- {
- arma_extra_debug_sigprint();
-
- typedef typename T1::elem_type eT;
-
- const uword in_n_rows = in.aux_uword_a;
- const uword in_n_cols = in.aux_uword_b;
-
- // allow detection of in-place reshape
- if(is_Mat<T1>::value || is_Mat<typename Proxy<T1>::stored_type>::value)
- {
- const unwrap<T1> U(in.m);
-
- op_reshape::apply_unwrap(out, U.M, in_n_rows, in_n_cols, uword(0));
- }
- else
- {
- const Proxy<T1> P(in.m);
-
- if(P.is_alias(out))
- {
- Mat<eT> tmp;
-
- op_reshape::apply_proxy(tmp, P, in_n_rows, in_n_cols);
-
- out.steal_mem(tmp);
- }
- else
- {
- op_reshape::apply_proxy(out, P, in_n_rows, in_n_cols);
- }
- }
- }
- template<typename T1>
- inline
- void
- op_reshape_ext::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_reshape_ext>& in)
- {
- arma_extra_debug_sigprint();
-
- const unwrap<T1> tmp(in.m);
-
- const uword in_n_rows = in.aux_uword_a;
- const uword in_n_cols = in.aux_uword_b;
- const uword in_dim = in.aux_uword_c;
-
- op_reshape::apply_unwrap(out, tmp.M, in_n_rows, in_n_cols, in_dim);
- }
- template<typename T1>
- inline
- void
- op_reshape_ext::apply(Cube<typename T1::elem_type>& out, const OpCube<T1,op_reshape_ext>& in)
- {
- arma_extra_debug_sigprint();
-
- typedef typename T1::elem_type eT;
-
- const unwrap_cube<T1> A_tmp(in.m);
- const Cube<eT>& A = A_tmp.M;
-
- const uword in_n_rows = in.aux_uword_a;
- const uword in_n_cols = in.aux_uword_b;
- const uword in_n_slices = in.aux_uword_c;
- const uword in_dim = in.aux_uword_d;
-
- const uword in_n_elem = in_n_rows * in_n_cols * in_n_slices;
-
- if(A.n_elem == in_n_elem)
- {
- if(in_dim == 0)
- {
- if(&out != &A)
- {
- out.set_size(in_n_rows, in_n_cols, in_n_slices);
- arrayops::copy( out.memptr(), A.memptr(), out.n_elem );
- }
- else // &out == &A, i.e. inplace resize
- {
- out.set_size(in_n_rows, in_n_cols, in_n_slices);
- // set_size() doesn't destroy data as long as the number of elements in the cube remains the same
- }
- }
- else
- {
- unwrap_cube_check< Cube<eT> > B_tmp(A, out);
- const Cube<eT>& B = B_tmp.M;
-
- out.set_size(in_n_rows, in_n_cols, in_n_slices);
-
- eT* out_mem = out.memptr();
-
- const uword B_n_rows = B.n_rows;
- const uword B_n_cols = B.n_cols;
- const uword B_n_slices = B.n_slices;
-
- for(uword slice = 0; slice < B_n_slices; ++slice)
- for(uword row = 0; row < B_n_rows; ++row )
- for(uword col = 0; col < B_n_cols; ++col )
- {
- *out_mem = B.at(row,col,slice);
- out_mem++;
- }
- }
- }
- else
- {
- const unwrap_cube_check< Cube<eT> > B_tmp(A, out);
- const Cube<eT>& B = B_tmp.M;
-
- const uword n_elem_to_copy = (std::min)(B.n_elem, in_n_elem);
-
- out.set_size(in_n_rows, in_n_cols, in_n_slices);
-
- eT* out_mem = out.memptr();
-
- if(in_dim == 0)
- {
- arrayops::copy( out_mem, B.memptr(), n_elem_to_copy );
- }
- else
- {
- uword row = 0;
- uword col = 0;
- uword slice = 0;
-
- const uword B_n_rows = B.n_rows;
- const uword B_n_cols = B.n_cols;
-
- for(uword i=0; i<n_elem_to_copy; ++i)
- {
- out_mem[i] = B.at(row,col,slice);
-
- ++col;
-
- if(col >= B_n_cols)
- {
- col = 0;
- ++row;
-
- if(row >= B_n_rows)
- {
- row = 0;
- ++slice;
- }
- }
- }
- }
-
- for(uword i=n_elem_to_copy; i<in_n_elem; ++i)
- {
- out_mem[i] = eT(0);
- }
-
- }
- }
- //! @}
|