op_prod_meat.hpp 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. // Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
  2. // Copyright 2008-2016 National ICT Australia (NICTA)
  3. //
  4. // Licensed under the Apache License, Version 2.0 (the "License");
  5. // you may not use this file except in compliance with the License.
  6. // You may obtain a copy of the License at
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. // ------------------------------------------------------------------------
  15. //! \addtogroup op_prod
  16. //! @{
  17. template<typename eT>
  18. inline
  19. void
  20. op_prod::apply_noalias(Mat<eT>& out, const Mat<eT>& X, const uword dim)
  21. {
  22. arma_extra_debug_sigprint();
  23. const uword X_n_rows = X.n_rows;
  24. const uword X_n_cols = X.n_cols;
  25. if(dim == 0) // traverse across rows (i.e. find the product in each column)
  26. {
  27. out.set_size(1, X_n_cols);
  28. eT* out_mem = out.memptr();
  29. for(uword col=0; col < X_n_cols; ++col)
  30. {
  31. out_mem[col] = arrayops::product(X.colptr(col), X_n_rows);
  32. }
  33. }
  34. else // traverse across columns (i.e. find the product in each row)
  35. {
  36. out.ones(X_n_rows, 1);
  37. eT* out_mem = out.memptr();
  38. for(uword col=0; col < X_n_cols; ++col)
  39. {
  40. const eT* X_col_mem = X.colptr(col);
  41. for(uword row=0; row < X_n_rows; ++row)
  42. {
  43. out_mem[row] *= X_col_mem[row];
  44. }
  45. }
  46. }
  47. }
  48. template<typename T1>
  49. inline
  50. void
  51. op_prod::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_prod>& in)
  52. {
  53. arma_extra_debug_sigprint();
  54. typedef typename T1::elem_type eT;
  55. const uword dim = in.aux_uword_a;
  56. arma_debug_check( (dim > 1), "prod(): parameter 'dim' must be 0 or 1" );
  57. const quasi_unwrap<T1> U(in.m);
  58. if(U.is_alias(out))
  59. {
  60. Mat<eT> tmp;
  61. op_prod::apply_noalias(tmp, U.M, dim);
  62. out.steal_mem(tmp);
  63. }
  64. else
  65. {
  66. op_prod::apply_noalias(out, U.M, dim);
  67. }
  68. }
  69. template<typename eT>
  70. inline
  71. eT
  72. op_prod::prod(const subview<eT>& X)
  73. {
  74. arma_extra_debug_sigprint();
  75. eT val = eT(1);
  76. const uword X_n_rows = X.n_rows;
  77. const uword X_n_cols = X.n_cols;
  78. if(X_n_rows == 1)
  79. {
  80. const Mat<eT>& A = X.m;
  81. const uword start_row = X.aux_row1;
  82. const uword start_col = X.aux_col1;
  83. const uword end_col_p1 = start_col + X_n_cols;
  84. uword i,j;
  85. for(i=start_col, j=start_col+1; j < end_col_p1; i+=2, j+=2)
  86. {
  87. val *= A.at(start_row, i);
  88. val *= A.at(start_row, j);
  89. }
  90. if(i < end_col_p1)
  91. {
  92. val *= A.at(start_row, i);
  93. }
  94. }
  95. else
  96. {
  97. for(uword col=0; col < X_n_cols; ++col)
  98. {
  99. val *= arrayops::product( X.colptr(col), X_n_rows );
  100. }
  101. }
  102. return val;
  103. }
  104. template<typename T1>
  105. inline
  106. typename T1::elem_type
  107. op_prod::prod(const Base<typename T1::elem_type,T1>& X)
  108. {
  109. arma_extra_debug_sigprint();
  110. typedef typename T1::elem_type eT;
  111. const Proxy<T1> P(X.get_ref());
  112. eT val = eT(1);
  113. if(Proxy<T1>::use_at == false)
  114. {
  115. typedef typename Proxy<T1>::ea_type ea_type;
  116. const ea_type A = P.get_ea();
  117. const uword n_elem = P.get_n_elem();
  118. uword i,j;
  119. for(i=0, j=1; j < n_elem; i+=2, j+=2)
  120. {
  121. val *= A[i];
  122. val *= A[j];
  123. }
  124. if(i < n_elem)
  125. {
  126. val *= A[i];
  127. }
  128. }
  129. else
  130. {
  131. const uword n_rows = P.get_n_rows();
  132. const uword n_cols = P.get_n_cols();
  133. if(n_rows == 1)
  134. {
  135. uword i,j;
  136. for(i=0, j=1; j < n_cols; i+=2, j+=2)
  137. {
  138. val *= P.at(0,i);
  139. val *= P.at(0,j);
  140. }
  141. if(i < n_cols)
  142. {
  143. val *= P.at(0,i);
  144. }
  145. }
  146. else
  147. {
  148. for(uword col=0; col < n_cols; ++col)
  149. {
  150. uword i,j;
  151. for(i=0, j=1; j < n_rows; i+=2, j+=2)
  152. {
  153. val *= P.at(i,col);
  154. val *= P.at(j,col);
  155. }
  156. if(i < n_rows)
  157. {
  158. val *= P.at(i,col);
  159. }
  160. }
  161. }
  162. }
  163. return val;
  164. }
  165. //! @}