diff armadillo-3.900.4/include/armadillo_bits/spop_min_meat.hpp @ 49:1ec0e2823891

Switch to using subrepo copies of qm-dsp, nnls-chroma, vamp-plugin-sdk; update Armadillo version; assume build without external BLAS/LAPACK

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/armadillo-3.900.4/include/armadillo_bits/spop_min_meat.hpp	Thu Jun 13 10:25:24 2013 +0100
@@ -0,0 +1,469 @@
+// Copyright (C) 2012 Ryan Curtin
+// Copyright (C) 2012 Conrad Sanderson
+// 
+// This Source Code Form is subject to the terms of the Mozilla Public
+// License, v. 2.0. If a copy of the MPL was not distributed with this
+// file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+
+//! \addtogroup spop_min
+//! @{
+
+
+
+template<typename T1>
+inline
+void
+spop_min::apply(SpMat<typename T1::elem_type>& out, const SpOp<T1,spop_min>& in)
+  {
+  arma_extra_debug_sigprint();
+  
+  typedef typename T1::elem_type eT;
+  
+  const uword dim = in.aux_uword_a;
+  arma_debug_check((dim > 1), "min(): incorrect usage. dim must be 0 or 1");
+  
+  const SpProxy<T1> p(in.m);
+  
+  if(p.is_alias(out) == false)
+    {
+    spop_min::apply_noalias(out, p, dim);
+    }
+  else
+    {
+    SpMat<eT> tmp;
+    
+    spop_min::apply_noalias(tmp, p, dim);
+    
+    out.steal_mem(tmp);
+    }
+  }
+
+
+
+template<typename T1>
+inline
+void
+spop_min::apply_noalias
+  (
+        SpMat<typename T1::elem_type>& result,
+  const SpProxy<T1>&                   p,
+  const uword                          dim,
+  const typename arma_not_cx<typename T1::elem_type>::result* junk
+  )
+  {
+  arma_extra_debug_sigprint();
+  arma_ignore(junk);
+  
+  typedef typename T1::elem_type eT;
+
+  if(dim == 0)
+    {
+    // minimum in each column
+    result.set_size(1, p.get_n_cols());
+  
+    if(p.get_n_nonzero() == 0)
+      {
+      return;
+      }
+    
+    typename SpProxy<T1>::const_iterator_type it = p.begin();
+
+    uword cur_col = it.col();
+    uword elem_in_col = 1;
+    eT cur_min = (*it);
+    ++it;
+
+    while(it != p.end())
+      {
+      if(it.col() != cur_col)
+        {
+        // was the column full?
+        if(elem_in_col == p.get_n_rows())
+          {
+          result.at(0, cur_col) = cur_min;
+          }
+        else
+          {
+          result.at(0, cur_col) = std::min(eT(0), cur_min);
+          }
+
+        cur_col = it.col();
+        elem_in_col = 0;
+        cur_min = (*it);
+        }
+      else
+        {
+        cur_min = std::min(cur_min, *it);
+        }
+
+      ++elem_in_col;
+      ++it;
+      }
+
+    if(elem_in_col == p.get_n_rows())
+      {
+      result.at(0, cur_col) = cur_min;
+      }
+    else
+      {
+      result.at(0, cur_col) = std::min(eT(0), cur_min);
+      }
+    }
+  else
+    {
+    // minimum in each row
+    result.set_size(p.get_n_rows(), 1);
+  
+    if(p.get_n_nonzero() == 0)
+      {
+      return;
+      }
+
+    typename SpProxy<T1>::const_row_iterator_type it = p.begin_row();
+
+    uword cur_row = it.row();
+    uword elem_in_row = 1;
+    eT cur_min = (*it);
+    ++it;
+
+    while(it.pos() < p.get_n_nonzero())
+      {
+      if(it.row() != cur_row)
+        {
+        // was the row full?
+        if(elem_in_row == p.get_n_cols())
+          {
+          result.at(cur_row, 0) = cur_min;
+          }
+        else
+          {
+          result.at(cur_row, 0) = std::min(eT(0), cur_min);
+          }
+
+        cur_row = it.row();
+        elem_in_row = 0;
+        cur_min = (*it);
+        }
+      else
+        {
+        cur_min = std::min(cur_min, *it);
+        }
+
+      ++elem_in_row;
+      ++it;
+      }
+
+    if(elem_in_row == p.get_n_cols())
+      {
+      result.at(cur_row, 0) = cur_min;
+      }
+    else
+      {
+      result.at(cur_row, 0) = std::min(eT(0), cur_min);
+      }
+    }
+  }
+
+
+
+template<typename T1>
+inline
+void
+spop_min::apply_noalias
+  (
+        SpMat<typename T1::elem_type>& result,
+  const SpProxy<T1>&                   p,
+  const uword                          dim,
+  const typename arma_cx_only<typename T1::elem_type>::result* junk
+  )
+  {
+  arma_extra_debug_sigprint();
+  arma_ignore(junk);
+  
+  typedef typename T1::elem_type            eT;
+  typedef typename get_pod_type<eT>::result  T;
+  
+  if(dim == 0)
+    {
+    // minimum in each column
+    result.set_size(1, p.get_n_cols());
+    
+    if(p.get_n_nonzero() == 0)
+      {
+      return;
+      }
+
+    typename SpProxy<T1>::const_iterator_type it = p.begin();
+    
+    uword cur_col = it.col();
+    uword elem_in_col = 1;
+    
+    eT cur_min_orig = *it;
+     T cur_min_abs  = std::abs(cur_min_orig);
+    
+    ++it;
+    
+    while(it != p.end())
+      {
+      if(it.col() != cur_col)
+        {
+        // was the column full?
+        if(elem_in_col == p.get_n_rows())
+          {
+          result.at(0, cur_col) = cur_min_orig;
+          }
+        else
+          {
+          eT val1 = eT(0);
+          
+          result.at(0, cur_col) = ( std::abs(val1) < cur_min_abs ) ? val1 : cur_min_orig;
+          }
+        
+        cur_col = it.col();
+        elem_in_col = 0;
+        
+        cur_min_orig = *it;
+        cur_min_abs  = std::abs(cur_min_orig);
+        }
+      else
+        {
+        eT val1_orig = *it;
+         T val1_abs  = std::abs(val1_orig);
+        
+        if( val1_abs < cur_min_abs )
+          {
+          cur_min_abs  = val1_abs;
+          cur_min_orig = val1_orig;
+          }
+        }
+
+      ++elem_in_col;
+      ++it;
+      }
+
+    if(elem_in_col == p.get_n_rows())
+      {
+      result.at(0, cur_col) = cur_min_orig;
+      }
+    else
+      {
+      eT val1 = eT(0);
+      
+      result.at(0, cur_col) = ( std::abs(val1) < cur_min_abs ) ? val1 : cur_min_orig;
+      }
+    }
+  else
+    {
+    // minimum in each row
+    result.set_size(p.get_n_rows(), 1);
+    
+    if(p.get_n_nonzero() == 0)
+      {
+      return;
+      }
+
+    typename SpProxy<T1>::const_row_iterator_type it = p.begin_row();
+    
+    uword cur_row = it.row();
+    uword elem_in_row = 1;
+    
+    eT cur_min_orig = *it;
+     T cur_min_abs  = std::abs(cur_min_orig);
+    
+    ++it;
+    
+    while(it.pos() < p.get_n_nonzero())
+      {
+      if(it.row() != cur_row)
+        {
+        // was the row full?
+        if(elem_in_row == p.get_n_cols())
+          {
+          result.at(cur_row, 0) = cur_min_orig;
+          }
+        else
+          {
+          eT val1 = eT(0);
+          
+          result.at(cur_row, 0) = ( std::abs(val1) < cur_min_abs ) ? val1 : cur_min_orig;
+          }
+
+        cur_row = it.row();
+        elem_in_row = 0;
+        
+        cur_min_orig = *it;
+        cur_min_abs  = std::abs(cur_min_orig);
+        }
+      else
+        {
+        eT val1_orig = *it;
+         T val1_abs  = std::abs(val1_orig);
+        
+        if( val1_abs < cur_min_abs )
+          {
+          cur_min_abs  = val1_abs;
+          cur_min_orig = val1_orig;
+          }
+        }
+
+      ++elem_in_row;
+      ++it;
+      }
+
+    if(elem_in_row == p.get_n_cols())
+      {
+      result.at(cur_row, 0) = cur_min_orig;
+      }
+    else
+      {
+      eT val1 = eT(0);
+      
+      result.at(cur_row, 0) = ( std::abs(val1) < cur_min_abs ) ? val1 : cur_min_orig;
+      }
+    }
+  }
+
+
+
+template<typename T1>
+inline
+typename T1::elem_type
+spop_min::vector_min
+  (
+  const T1& x,
+  const typename arma_not_cx<typename T1::elem_type>::result* junk
+  )
+  {
+  arma_extra_debug_sigprint();
+  arma_ignore(junk);
+  
+  typedef typename T1::elem_type eT;
+  
+  const SpProxy<T1> p(x);
+  
+  if(p.get_n_nonzero() == 0)
+    {
+    return eT(0);
+    }
+  
+  if(SpProxy<T1>::must_use_iterator == false)
+    {
+    // direct access of values
+    if(p.get_n_nonzero() == p.get_n_elem())
+      {
+      return op_min::direct_min(p.get_values(), p.get_n_nonzero());
+      }
+    else
+      {
+      return std::min(eT(0), op_min::direct_min(p.get_values(), p.get_n_nonzero()));
+      }
+    }
+  else
+    {
+    // use iterator
+    typename SpProxy<T1>::const_iterator_type it = p.begin();
+
+    eT result = (*it);
+    ++it;
+
+    while(it != p.end())
+      {
+      if((*it) < result)
+        {
+        result = (*it);
+        }
+
+      ++it;
+      }
+
+    if(p.get_n_nonzero() == p.get_n_elem())
+      {
+      return result;
+      }
+    else
+      {
+      return std::min(eT(0), result);
+      }
+    }
+  }
+
+
+
+template<typename T1>
+inline
+typename T1::elem_type
+spop_min::vector_min
+  (
+  const T1& x,
+  const typename arma_cx_only<typename T1::elem_type>::result* junk
+  )
+  {
+  arma_extra_debug_sigprint();
+  arma_ignore(junk);
+  
+  typedef typename T1::elem_type            eT;
+  typedef typename get_pod_type<eT>::result  T;
+
+  const SpProxy<T1> p(x);
+
+  if(p.get_n_nonzero() == 0)
+    {
+    return eT(0);
+    }
+
+  if(SpProxy<T1>::must_use_iterator == false)
+    {
+    // direct access of values
+    if(p.get_n_nonzero() == p.get_n_elem())
+      {
+      return op_min::direct_min(p.get_values(), p.get_n_nonzero());
+      }
+    else
+      {
+      const eT val1 = eT(0);
+      const eT val2 = op_min::direct_min(p.get_values(), p.get_n_nonzero());
+      
+      return ( std::abs(val1) < std::abs(val2) ) ? val1 : val2;
+      }
+    }
+  else
+    {
+    // use iterator
+    typename SpProxy<T1>::const_iterator_type it = p.begin();
+
+    eT best_val_orig = *it;
+     T best_val_abs  = std::abs(best_val_orig);
+    
+    ++it;
+    
+    while(it != p.end())
+      {
+      eT val_orig = *it;
+       T val_abs  = std::abs(val_orig);
+      
+      if(val_abs < best_val_abs)
+        {
+        best_val_abs  = val_abs;
+        best_val_orig = val_orig;
+        }
+
+      ++it;
+      }
+
+    if(p.get_n_nonzero() == p.get_n_elem())
+      {
+      return best_val_orig;
+      }
+    else
+      {
+      const eT val1 = eT(0);
+      
+      return ( std::abs(val1) < best_val_abs ) ? val1 : best_val_orig;
+      }
+    }
+  }
+
+
+
+//! @}