Chris@49: // Copyright (C) 2012 NICTA (www.nicta.com.au)
Chris@49: // Copyright (C) 2012 Conrad Sanderson
Chris@49: // Copyright (C) 2012 Arnold Wiliem
Chris@49: // 
Chris@49: // This Source Code Form is subject to the terms of the Mozilla Public
Chris@49: // License, v. 2.0. If a copy of the MPL was not distributed with this
Chris@49: // file, You can obtain one at http://mozilla.org/MPL/2.0/.
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //! \addtogroup op_unique
Chris@49: //! @{
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: // TODO: add an efficient implementation for complex numbers
Chris@49: 
Chris@49: template<typename T1>
Chris@49: inline
Chris@49: void
Chris@49: op_unique::apply(Mat<typename T1::elem_type>& out, const Op<T1, op_unique>& X)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   typedef typename T1::elem_type eT;
Chris@49:   
Chris@49:   const Proxy<T1> P(X.m);
Chris@49:   
Chris@49:   const uword in_n_rows = P.get_n_rows();
Chris@49:   const uword in_n_cols = P.get_n_cols();
Chris@49:   const uword in_n_elem = P.get_n_elem();
Chris@49:   
Chris@49:   
Chris@49:   if(in_n_elem <= 1)
Chris@49:     {
Chris@49:     if(in_n_elem == 1)
Chris@49:       {
Chris@49:       const eT tmp = P[0];
Chris@49:       
Chris@49:       out.set_size(in_n_rows, in_n_cols);
Chris@49:       
Chris@49:       out[0] = tmp;
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       out.set_size(in_n_rows, in_n_cols);
Chris@49:       }
Chris@49:     
Chris@49:     return;
Chris@49:     }
Chris@49:   
Chris@49:   
Chris@49:   std::vector<eT> lvec(in_n_elem);
Chris@49:   
Chris@49:   
Chris@49:   if(Proxy<T1>::prefer_at_accessor == false)
Chris@49:     {
Chris@49:     typename Proxy<T1>::ea_type Pea = P.get_ea();
Chris@49:     
Chris@49:     uword i,j;
Chris@49:     for(i=0, j=1; j < in_n_elem; i+=2, j+=2)
Chris@49:       {
Chris@49:       const eT tmp_i = Pea[i];
Chris@49:       const eT tmp_j = Pea[j];
Chris@49:       
Chris@49:       lvec[i] = tmp_i;
Chris@49:       lvec[j] = tmp_j;
Chris@49:       }
Chris@49:     
Chris@49:     if(i < in_n_elem)
Chris@49:       {
Chris@49:       lvec[i] = Pea[i];
Chris@49:       }
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     uword i = 0;
Chris@49:     
Chris@49:     for(uword col=0; col < in_n_cols; ++col)
Chris@49:     for(uword row=0; row < in_n_rows; ++row, ++i)
Chris@49:       {
Chris@49:       lvec[i] = P.at(row,col);
Chris@49:       }
Chris@49:     }
Chris@49:   
Chris@49:   std::sort( lvec.begin(), lvec.end() );
Chris@49:   
Chris@49:   uword N_unique = 1;
Chris@49:   
Chris@49:   for(uword i=1; i < in_n_elem; ++i)
Chris@49:     {
Chris@49:     const eT a = lvec[i-1];
Chris@49:     const eT b = lvec[i  ];
Chris@49:     
Chris@49:     const eT diff = a - b;
Chris@49:     
Chris@49:     if(diff != eT(0)) { ++N_unique; }
Chris@49:     }
Chris@49:   
Chris@49:   uword out_n_rows;
Chris@49:   uword out_n_cols;
Chris@49:   
Chris@49:   if( (in_n_rows == 1) || (in_n_cols == 1) )
Chris@49:     {
Chris@49:     if(in_n_rows == 1)
Chris@49:       {
Chris@49:       out_n_rows = 1;
Chris@49:       out_n_cols = N_unique;
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       out_n_rows = N_unique;
Chris@49:       out_n_cols = 1;
Chris@49:       }
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     out_n_rows = N_unique;
Chris@49:     out_n_cols = 1;
Chris@49:     }
Chris@49:   
Chris@49:   // we don't need to worry about aliasing at this stage, as all the data is stored in lvec
Chris@49:   out.set_size(out_n_rows, out_n_cols);
Chris@49:   
Chris@49:   eT* out_mem = out.memptr();
Chris@49:   
Chris@49:   if(in_n_elem > 0) { out_mem[0] = lvec[0]; }
Chris@49:   
Chris@49:   N_unique = 1;
Chris@49:   
Chris@49:   for(uword i=1; i < in_n_elem; ++i)
Chris@49:     {
Chris@49:     const eT a = lvec[i-1];
Chris@49:     const eT b = lvec[i  ];
Chris@49:     
Chris@49:     const eT diff = a - b;
Chris@49:     
Chris@49:     if(diff != eT(0))
Chris@49:       {
Chris@49:       out_mem[N_unique] = b;
Chris@49:       ++N_unique;
Chris@49:       }
Chris@49:     }
Chris@49:   
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //! @}