Chris@49: // Copyright (C) 2011-2013 NICTA (www.nicta.com.au) Chris@49: // Copyright (C) 2011-2013 Conrad Sanderson 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 Gen Chris@49: //! @{ Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: Gen::Gen(const uword in_n_rows, const uword in_n_cols) Chris@49: : n_rows(in_n_rows) Chris@49: , n_cols(in_n_cols) Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: Gen::~Gen() Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: typename T1::elem_type Chris@49: Gen::generate() Chris@49: { Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: if(is_same_type::value == true) { return eT(1); } Chris@49: else if(is_same_type::value == true) { return eT(0); } Chris@49: else if(is_same_type::value == true) { return eT(eop_aux_randu()); } Chris@49: else if(is_same_type::value == true) { return eT(eop_aux_randn()); } Chris@49: else { return eT(); } Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: typename T1::elem_type Chris@49: Gen::operator[](const uword ii) const Chris@49: { Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: return ((ii % n_rows) == (ii / n_rows)) ? eT(1) : eT(0); Chris@49: } Chris@49: else Chris@49: { Chris@49: return Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: typename T1::elem_type Chris@49: Gen::at(const uword row, const uword col) const Chris@49: { Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: return (row == col) ? eT(1) : eT(0); Chris@49: } Chris@49: else Chris@49: { Chris@49: return Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: arma_inline Chris@49: typename T1::elem_type Chris@49: Gen::at_alt(const uword ii) const Chris@49: { Chris@49: return operator[](ii); Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: inline Chris@49: void Chris@49: Gen::apply(Mat& out) const Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: // NOTE: we're assuming that the matrix has already been set to the correct size; Chris@49: // this is done by either the Mat contructor or operator=() Chris@49: Chris@49: if(is_same_type::value == true) { out.eye(); } Chris@49: else if(is_same_type::value == true) { out.ones(); } Chris@49: else if(is_same_type::value == true) { out.zeros(); } Chris@49: else if(is_same_type::value == true) { out.randu(); } Chris@49: else if(is_same_type::value == true) { out.randn(); } Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: inline Chris@49: void Chris@49: Gen::apply_inplace_plus(Mat& out) const Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "addition"); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: const uword N = (std::min)(n_rows, n_cols); Chris@49: Chris@49: for(uword iq=0; iq < N; ++iq) Chris@49: { Chris@49: out.at(iq,iq) += eT(1); Chris@49: } Chris@49: } Chris@49: else Chris@49: { Chris@49: eT* out_mem = out.memptr(); Chris@49: const uword n_elem = out.n_elem; Chris@49: Chris@49: uword iq,jq; Chris@49: for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2) Chris@49: { Chris@49: const eT tmp_i = Gen::generate(); Chris@49: const eT tmp_j = Gen::generate(); Chris@49: Chris@49: out_mem[iq] += tmp_i; Chris@49: out_mem[jq] += tmp_j; Chris@49: } Chris@49: Chris@49: if(iq < n_elem) Chris@49: { Chris@49: out_mem[iq] += Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: inline Chris@49: void Chris@49: Gen::apply_inplace_minus(Mat& out) const Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "subtraction"); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: const uword N = (std::min)(n_rows, n_cols); Chris@49: Chris@49: for(uword iq=0; iq < N; ++iq) Chris@49: { Chris@49: out.at(iq,iq) -= eT(1); Chris@49: } Chris@49: } Chris@49: else Chris@49: { Chris@49: eT* out_mem = out.memptr(); Chris@49: const uword n_elem = out.n_elem; Chris@49: Chris@49: uword iq,jq; Chris@49: for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2) Chris@49: { Chris@49: const eT tmp_i = Gen::generate(); Chris@49: const eT tmp_j = Gen::generate(); Chris@49: Chris@49: out_mem[iq] -= tmp_i; Chris@49: out_mem[jq] -= tmp_j; Chris@49: } Chris@49: Chris@49: if(iq < n_elem) Chris@49: { Chris@49: out_mem[iq] -= Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: inline Chris@49: void Chris@49: Gen::apply_inplace_schur(Mat& out) const Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "element-wise multiplication"); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: const uword N = (std::min)(n_rows, n_cols); Chris@49: Chris@49: for(uword iq=0; iq < N; ++iq) Chris@49: { Chris@49: for(uword row=0; row < iq; ++row) { out.at(row,iq) = eT(0); } Chris@49: for(uword row=iq+1; row < n_rows; ++row) { out.at(row,iq) = eT(0); } Chris@49: } Chris@49: } Chris@49: else Chris@49: { Chris@49: eT* out_mem = out.memptr(); Chris@49: const uword n_elem = out.n_elem; Chris@49: Chris@49: uword iq,jq; Chris@49: for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2) Chris@49: { Chris@49: const eT tmp_i = Gen::generate(); Chris@49: const eT tmp_j = Gen::generate(); Chris@49: Chris@49: out_mem[iq] *= tmp_i; Chris@49: out_mem[jq] *= tmp_j; Chris@49: } Chris@49: Chris@49: if(iq < n_elem) Chris@49: { Chris@49: out_mem[iq] *= Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: Chris@49: template Chris@49: inline Chris@49: void Chris@49: Gen::apply_inplace_div(Mat& out) const Chris@49: { Chris@49: arma_extra_debug_sigprint(); Chris@49: Chris@49: arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "element-wise division"); Chris@49: Chris@49: typedef typename T1::elem_type eT; Chris@49: Chris@49: Chris@49: if(is_same_type::value == true) Chris@49: { Chris@49: const uword N = (std::min)(n_rows, n_cols); Chris@49: Chris@49: for(uword iq=0; iq < N; ++iq) Chris@49: { Chris@49: const eT zero = eT(0); Chris@49: Chris@49: for(uword row=0; row < iq; ++row) { out.at(row,iq) /= zero; } Chris@49: for(uword row=iq+1; row < n_rows; ++row) { out.at(row,iq) /= zero; } Chris@49: } Chris@49: } Chris@49: else Chris@49: { Chris@49: eT* out_mem = out.memptr(); Chris@49: const uword n_elem = out.n_elem; Chris@49: Chris@49: uword iq,jq; Chris@49: for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2) Chris@49: { Chris@49: const eT tmp_i = Gen::generate(); Chris@49: const eT tmp_j = Gen::generate(); Chris@49: Chris@49: out_mem[iq] /= tmp_i; Chris@49: out_mem[jq] /= tmp_j; Chris@49: } Chris@49: Chris@49: if(iq < n_elem) Chris@49: { Chris@49: out_mem[iq] /= Gen::generate(); Chris@49: } Chris@49: } Chris@49: Chris@49: } Chris@49: Chris@49: Chris@49: Chris@49: Chris@49: //! @} Chris@49: