Chris@49: // Copyright (C) 2008-2012 NICTA (www.nicta.com.au) Chris@49: // Copyright (C) 2008-2012 Conrad Sanderson Chris@49: // Copyright (C) 2012 Ryan Curtin 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: //! \addtogroup operator_schur Chris@49: //! @{ Chris@49: Chris@49: Chris@49: // operator %, which we define it to do a schur product (element-wise multiplication) Chris@49: Chris@49: Chris@49: //! element-wise multiplication of user-accessible Armadillo objects with same element type Chris@49: template Chris@49: arma_inline Chris@49: typename Chris@49: enable_if2 Chris@49: < Chris@49: is_arma_type::value && is_arma_type::value && is_same_type::value, Chris@49: const eGlue Chris@49: >::result Chris@49: operator% Chris@49: ( Chris@49: const T1& X, Chris@49: const T2& Y Chris@49: ) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: return eGlue(X, Y); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: //! element-wise multiplication of user-accessible Armadillo objects with different element types Chris@49: template Chris@49: inline Chris@49: typename Chris@49: enable_if2 Chris@49: < Chris@49: (is_arma_type::value && is_arma_type::value && (is_same_type::value == false)), Chris@49: const mtGlue::result, T1, T2, glue_mixed_schur> Chris@49: >::result Chris@49: operator% Chris@49: ( Chris@49: const T1& X, Chris@49: const T2& Y Chris@49: ) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: typedef typename T1::elem_type eT1; Chris@49: typedef typename T2::elem_type eT2; Chris@49: Chris@49: typedef typename promote_type::result out_eT; Chris@49: Chris@49: promote_type::check(); Chris@49: Chris@49: return mtGlue( X, Y ); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: //! element-wise multiplication of two sparse matrices Chris@49: template Chris@49: inline Chris@49: typename Chris@49: enable_if2 Chris@49: < Chris@49: (is_arma_sparse_type::value && is_arma_sparse_type::value && is_same_type::value), Chris@49: SpMat Chris@49: >::result Chris@49: operator% Chris@49: ( Chris@49: const SpBase& x, Chris@49: const SpBase& y Chris@49: ) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: const SpProxy pa(x.get_ref()); Chris@49: const SpProxy pb(y.get_ref()); Chris@49: Chris@49: arma_debug_assert_same_size(pa.get_n_rows(), pa.get_n_cols(), pb.get_n_rows(), pb.get_n_cols(), "element-wise multiplication"); Chris@49: Chris@49: SpMat result(pa.get_n_rows(), pa.get_n_cols()); Chris@49: Chris@49: if( (pa.get_n_nonzero() != 0) && (pb.get_n_nonzero() != 0) ) Chris@49: { Chris@49: // Resize memory to correct size. Chris@49: result.mem_resize(n_unique(x, y, op_n_unique_mul())); Chris@49: Chris@49: // Now iterate across both matrices. Chris@49: typename SpProxy::const_iterator_type x_it = pa.begin(); Chris@49: typename SpProxy::const_iterator_type y_it = pb.begin(); Chris@49: Chris@49: typename SpProxy::const_iterator_type x_end = pa.end(); Chris@49: typename SpProxy::const_iterator_type y_end = pb.end(); Chris@49: Chris@49: uword cur_val = 0; Chris@49: while((x_it != x_end) || (y_it != y_end)) Chris@49: { Chris@49: if(x_it == y_it) Chris@49: { Chris@49: const eT val = (*x_it) * (*y_it); Chris@49: Chris@49: if (val != eT(0)) Chris@49: { Chris@49: access::rw(result.values[cur_val]) = val; Chris@49: access::rw(result.row_indices[cur_val]) = x_it.row(); Chris@49: ++access::rw(result.col_ptrs[x_it.col() + 1]); Chris@49: ++cur_val; Chris@49: } Chris@49: Chris@49: ++x_it; Chris@49: ++y_it; Chris@49: } Chris@49: else Chris@49: { Chris@49: const uword x_it_row = x_it.row(); Chris@49: const uword x_it_col = x_it.col(); Chris@49: Chris@49: const uword y_it_row = y_it.row(); Chris@49: const uword y_it_col = y_it.col(); Chris@49: Chris@49: if((x_it_col < y_it_col) || ((x_it_col == y_it_col) && (x_it_row < y_it_row))) // if y is closer to the end Chris@49: { Chris@49: ++x_it; Chris@49: } Chris@49: else Chris@49: { Chris@49: ++y_it; Chris@49: } Chris@49: } Chris@49: } Chris@49: Chris@49: // Fix column pointers to be cumulative. Chris@49: for(uword c = 1; c <= result.n_cols; ++c) Chris@49: { Chris@49: access::rw(result.col_ptrs[c]) += result.col_ptrs[c - 1]; Chris@49: } Chris@49: } Chris@49: Chris@49: return result; Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: //! element-wise multiplication of one dense and one sparse object Chris@49: template Chris@49: inline Chris@49: typename Chris@49: enable_if2 Chris@49: < Chris@49: (is_arma_type::value && is_arma_sparse_type::value && is_same_type::value), Chris@49: SpMat Chris@49: >::result Chris@49: operator% Chris@49: ( Chris@49: const T1& x, Chris@49: const T2& y Chris@49: ) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: const Proxy pa(x); Chris@49: const SpProxy pb(y); Chris@49: Chris@49: arma_debug_assert_same_size(pa.get_n_rows(), pa.get_n_cols(), pb.get_n_rows(), pb.get_n_cols(), "element-wise multiplication"); Chris@49: Chris@49: SpMat result(pa.get_n_rows(), pa.get_n_cols()); Chris@49: Chris@49: // count new size Chris@49: uword new_n_nonzero = 0; Chris@49: Chris@49: typename SpProxy::const_iterator_type it = pb.begin(); Chris@49: typename SpProxy::const_iterator_type it_end = pb.end(); Chris@49: Chris@49: while(it != it_end) Chris@49: { Chris@49: if( ((*it) * pa.at(it.row(), it.col())) != eT(0) ) Chris@49: { Chris@49: ++new_n_nonzero; Chris@49: } Chris@49: Chris@49: ++it; Chris@49: } Chris@49: Chris@49: // Resize memory accordingly. Chris@49: result.mem_resize(new_n_nonzero); Chris@49: Chris@49: uword cur_val = 0; Chris@49: Chris@49: typename SpProxy::const_iterator_type it2 = pb.begin(); Chris@49: Chris@49: while(it2 != it_end) Chris@49: { Chris@49: const uword it2_row = it2.row(); Chris@49: const uword it2_col = it2.col(); Chris@49: Chris@49: const eT val = (*it2) * pa.at(it2_row, it2_col); Chris@49: Chris@49: if(val != eT(0)) Chris@49: { Chris@49: access::rw(result.values[cur_val]) = val; Chris@49: access::rw(result.row_indices[cur_val]) = it2_row; Chris@49: ++access::rw(result.col_ptrs[it2_col + 1]); Chris@49: ++cur_val; Chris@49: } Chris@49: Chris@49: ++it2; Chris@49: } Chris@49: Chris@49: // Fix column pointers. Chris@49: for(uword c = 1; c <= result.n_cols; ++c) Chris@49: { Chris@49: access::rw(result.col_ptrs[c]) += result.col_ptrs[c - 1]; Chris@49: } Chris@49: Chris@49: return result; Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: //! element-wise multiplication of one sparse and one dense object Chris@49: template Chris@49: inline Chris@49: typename Chris@49: enable_if2 Chris@49: < Chris@49: (is_arma_sparse_type::value && is_arma_type::value && is_same_type::value), Chris@49: SpMat Chris@49: >::result Chris@49: operator% Chris@49: ( Chris@49: const T1& x, Chris@49: const T2& y Chris@49: ) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: // This operation is commutative. Chris@49: return (y % x); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: //! @}