Mercurial > hg > segmenter-vamp-plugin
view armadillo-2.4.4/include/armadillo_bits/op_shuffle_meat.hpp @ 0:8b6102e2a9b0
Armadillo Library
author | maxzanoni76 <max.zanoni@eecs.qmul.ac.uk> |
---|---|
date | Wed, 11 Apr 2012 09:27:06 +0100 |
parents | |
children |
line wrap: on
line source
// Copyright (C) 2009-2011 NICTA (www.nicta.com.au) // Copyright (C) 2009-2011 Conrad Sanderson // Copyright (C) 2009-2010 Dimitrios Bouzas // // This file is part of the Armadillo C++ library. // It is provided without any warranty of fitness // for any purpose. You can redistribute this file // and/or modify it under the terms of the GNU // Lesser General Public License (LGPL) as published // by the Free Software Foundation, either version 3 // of the License or (at your option) any later version. // (see http://www.opensource.org/licenses for more info) //! \addtogroup op_shuffle //! @{ template<typename T1> inline void op_shuffle::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_shuffle>& in) { arma_extra_debug_sigprint(); typedef typename T1::elem_type eT; const unwrap<T1> tmp(in.m); const Mat<eT>& X = tmp.M; if(X.is_empty()) { out.copy_size(X); return; } const uword dim = in.aux_uword_a; const uword N = (dim == 0) ? X.n_rows : X.n_cols; // see "fn_sort_index.hpp" for the definition of "arma_sort_index_packet_ascend" // and the associated "operator<" std::vector< arma_sort_index_packet_ascend<int,uword> > packet_vec(N); for(uword i=0; i<N; ++i) { packet_vec[i].val = std::rand(); packet_vec[i].index = i; } std::sort( packet_vec.begin(), packet_vec.end() ); if(X.is_vec() == false) { if(&out != &X) { arma_extra_debug_print("op_shuffle::apply(): matrix"); out.copy_size(X); if(dim == 0) { for(uword i=0; i<N; ++i) { out.row(i) = X.row(packet_vec[i].index); } } else { for(uword i=0; i<N; ++i) { out.col(i) = X.col(packet_vec[i].index); } } } else // in-place shuffle { arma_extra_debug_print("op_shuffle::apply(): in-place matrix"); // reuse the val member variable of packet_vec // to indicate whether a particular row or column // has already been shuffled for(uword i=0; i<N; ++i) { packet_vec[i].val = 0; } if(dim == 0) { for(uword i=0; i<N; ++i) { if(packet_vec[i].val == 0) { const uword j = packet_vec[i].index; out.swap_rows(i, j); packet_vec[j].val = 1; } } } else { for(uword i=0; i<N; ++i) { if(packet_vec[i].val == 0) { const uword j = packet_vec[i].index; out.swap_cols(i, j); packet_vec[j].val = 1; } } } } } else // we're dealing with a vector { if(&out != &X) { arma_extra_debug_print("op_shuffle::apply(): vector"); out.copy_size(X); if(dim == 0) { if(X.n_rows > 1) // i.e. column vector { for(uword i=0; i<N; ++i) { out[i] = X[ packet_vec[i].index ]; } } else { out = X; } } else { if(X.n_cols > 1) // i.e. row vector { for(uword i=0; i<N; ++i) { out[i] = X[ packet_vec[i].index ]; } } else { out = X; } } } else // in-place shuffle { arma_extra_debug_print("op_shuffle::apply(): in-place vector"); // reuse the val member variable of packet_vec // to indicate whether a particular row or column // has already been shuffled for(uword i=0; i<N; ++i) { packet_vec[i].val = 0; } if(dim == 0) { if(X.n_rows > 1) // i.e. column vector { for(uword i=0; i<N; ++i) { if(packet_vec[i].val == 0) { const uword j = packet_vec[i].index; std::swap(out[i], out[j]); packet_vec[j].val = 1; } } } } else { if(X.n_cols > 1) // i.e. row vector { for(uword i=0; i<N; ++i) { if(packet_vec[i].val == 0) { const uword j = packet_vec[i].index; std::swap(out[i], out[j]); packet_vec[j].val = 1; } } } } } } } //! @}