316 lines
7.0 KiB
C++
316 lines
7.0 KiB
C++
// Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
|
|
// Copyright 2008-2016 National ICT Australia (NICTA)
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
// ------------------------------------------------------------------------
|
|
|
|
|
|
//! \addtogroup Gen
|
|
//! @{
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
arma_inline
|
|
Gen<T1, gen_type>::Gen(const uword in_n_rows, const uword in_n_cols)
|
|
: n_rows(in_n_rows)
|
|
, n_cols(in_n_cols)
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
arma_inline
|
|
Gen<T1, gen_type>::~Gen()
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
arma_inline
|
|
typename T1::elem_type
|
|
Gen<T1, gen_type>::operator[](const uword ii) const
|
|
{
|
|
typedef typename T1::elem_type eT;
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
return ((ii % n_rows) == (ii / n_rows)) ? eT(1) : eT(0);
|
|
}
|
|
else
|
|
{
|
|
return (*this).generate();
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
arma_inline
|
|
typename T1::elem_type
|
|
Gen<T1, gen_type>::at(const uword row, const uword col) const
|
|
{
|
|
typedef typename T1::elem_type eT;
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
return (row == col) ? eT(1) : eT(0);
|
|
}
|
|
else
|
|
{
|
|
return (*this).generate();
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
arma_inline
|
|
typename T1::elem_type
|
|
Gen<T1, gen_type>::at_alt(const uword ii) const
|
|
{
|
|
return operator[](ii);
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply(Mat<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
// NOTE: we're assuming that the matrix has already been set to the correct size;
|
|
// this is done by either the Mat contructor or operator=()
|
|
|
|
if(is_same_type<gen_type, gen_eye >::yes) { out.eye(); }
|
|
else if(is_same_type<gen_type, gen_ones >::yes) { out.ones(); }
|
|
else if(is_same_type<gen_type, gen_zeros>::yes) { out.zeros(); }
|
|
else if(is_same_type<gen_type, gen_randu>::yes) { out.randu(); }
|
|
else if(is_same_type<gen_type, gen_randn>::yes) { out.randn(); }
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply_inplace_plus(Mat<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "addition");
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
const uword N = (std::min)(n_rows, n_cols);
|
|
|
|
for(uword iq=0; iq < N; ++iq)
|
|
{
|
|
out.at(iq,iq) += eT(1);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
eT* out_mem = out.memptr();
|
|
const uword n_elem = out.n_elem;
|
|
|
|
uword iq,jq;
|
|
for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2)
|
|
{
|
|
const eT tmp_i = (*this).generate();
|
|
const eT tmp_j = (*this).generate();
|
|
|
|
out_mem[iq] += tmp_i;
|
|
out_mem[jq] += tmp_j;
|
|
}
|
|
|
|
if(iq < n_elem)
|
|
{
|
|
out_mem[iq] += (*this).generate();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply_inplace_minus(Mat<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "subtraction");
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
const uword N = (std::min)(n_rows, n_cols);
|
|
|
|
for(uword iq=0; iq < N; ++iq)
|
|
{
|
|
out.at(iq,iq) -= eT(1);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
eT* out_mem = out.memptr();
|
|
const uword n_elem = out.n_elem;
|
|
|
|
uword iq,jq;
|
|
for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2)
|
|
{
|
|
const eT tmp_i = (*this).generate();
|
|
const eT tmp_j = (*this).generate();
|
|
|
|
out_mem[iq] -= tmp_i;
|
|
out_mem[jq] -= tmp_j;
|
|
}
|
|
|
|
if(iq < n_elem)
|
|
{
|
|
out_mem[iq] -= (*this).generate();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply_inplace_schur(Mat<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "element-wise multiplication");
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
const uword N = (std::min)(n_rows, n_cols);
|
|
|
|
for(uword iq=0; iq < N; ++iq)
|
|
{
|
|
for(uword row=0; row < iq; ++row) { out.at(row,iq) = eT(0); }
|
|
for(uword row=iq+1; row < n_rows; ++row) { out.at(row,iq) = eT(0); }
|
|
}
|
|
}
|
|
else
|
|
{
|
|
eT* out_mem = out.memptr();
|
|
const uword n_elem = out.n_elem;
|
|
|
|
uword iq,jq;
|
|
for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2)
|
|
{
|
|
const eT tmp_i = (*this).generate();
|
|
const eT tmp_j = (*this).generate();
|
|
|
|
out_mem[iq] *= tmp_i;
|
|
out_mem[jq] *= tmp_j;
|
|
}
|
|
|
|
if(iq < n_elem)
|
|
{
|
|
out_mem[iq] *= (*this).generate();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply_inplace_div(Mat<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
arma_debug_assert_same_size(out.n_rows, out.n_cols, n_rows, n_cols, "element-wise division");
|
|
|
|
typedef typename T1::elem_type eT;
|
|
|
|
|
|
if(is_same_type<gen_type, gen_eye>::yes)
|
|
{
|
|
const uword N = (std::min)(n_rows, n_cols);
|
|
|
|
for(uword iq=0; iq < N; ++iq)
|
|
{
|
|
const eT zero = eT(0);
|
|
|
|
for(uword row=0; row < iq; ++row) { out.at(row,iq) /= zero; }
|
|
for(uword row=iq+1; row < n_rows; ++row) { out.at(row,iq) /= zero; }
|
|
}
|
|
}
|
|
else
|
|
{
|
|
eT* out_mem = out.memptr();
|
|
const uword n_elem = out.n_elem;
|
|
|
|
uword iq,jq;
|
|
for(iq=0, jq=1; jq < n_elem; iq+=2, jq+=2)
|
|
{
|
|
const eT tmp_i = (*this).generate();
|
|
const eT tmp_j = (*this).generate();
|
|
|
|
out_mem[iq] /= tmp_i;
|
|
out_mem[jq] /= tmp_j;
|
|
}
|
|
|
|
if(iq < n_elem)
|
|
{
|
|
out_mem[iq] /= (*this).generate();
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
|
|
template<typename T1, typename gen_type>
|
|
inline
|
|
void
|
|
Gen<T1, gen_type>::apply(subview<typename T1::elem_type>& out) const
|
|
{
|
|
arma_extra_debug_sigprint();
|
|
|
|
// NOTE: we're assuming that the submatrix has the same dimensions as the Gen object
|
|
// this is checked by subview::operator=()
|
|
|
|
if(is_same_type<gen_type, gen_eye >::yes) { out.eye(); }
|
|
else if(is_same_type<gen_type, gen_ones >::yes) { out.ones(); }
|
|
else if(is_same_type<gen_type, gen_zeros>::yes) { out.zeros(); }
|
|
else if(is_same_type<gen_type, gen_randu>::yes) { out.randu(); }
|
|
else if(is_same_type<gen_type, gen_randn>::yes) { out.randn(); }
|
|
}
|
|
|
|
|
|
|
|
//! @}
|