spglue_merge_meat.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  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 spglue_merge
  16. //! @{
  17. template<typename eT>
  18. arma_hot
  19. inline
  20. void
  21. spglue_merge::subview_merge(SpSubview<eT>& sv, const SpMat<eT>& B)
  22. {
  23. arma_extra_debug_sigprint();
  24. if(sv.n_elem == 0) { return; }
  25. if(B.n_nonzero == 0) { sv.zeros(); return; }
  26. SpMat<eT>& A = access::rw(sv.m);
  27. const uword merge_n_nonzero = A.n_nonzero - sv.n_nonzero + B.n_nonzero;
  28. const uword sv_row_start = sv.aux_row1;
  29. const uword sv_col_start = sv.aux_col1;
  30. const uword sv_row_end = sv.aux_row1 + sv.n_rows - 1;
  31. const uword sv_col_end = sv.aux_col1 + sv.n_cols - 1;
  32. if(A.n_nonzero == sv.n_nonzero)
  33. {
  34. // A is either all zeros or has all of its elements in the subview
  35. // so the merge is equivalent to overwrite of A
  36. SpMat<eT> tmp(arma_reserve_indicator(), A.n_rows, A.n_cols, B.n_nonzero);
  37. typename SpMat<eT>::const_iterator B_it = B.begin();
  38. typename SpMat<eT>::const_iterator B_it_end = B.end();
  39. uword tmp_count = 0;
  40. for(; B_it != B_it_end; ++B_it)
  41. {
  42. access::rw(tmp.values[tmp_count]) = (*B_it);
  43. access::rw(tmp.row_indices[tmp_count]) = B_it.row() + sv_row_start;
  44. access::rw(tmp.col_ptrs[B_it.col() + sv_col_start + 1])++;
  45. ++tmp_count;
  46. }
  47. for(uword i=0; i < tmp.n_cols; ++i)
  48. {
  49. access::rw(tmp.col_ptrs[i + 1]) += tmp.col_ptrs[i];
  50. }
  51. A.steal_mem(tmp);
  52. access::rw(sv.n_nonzero) = B.n_nonzero;
  53. return;
  54. }
  55. if(sv.n_nonzero > (A.n_nonzero/2))
  56. {
  57. // A has most of its elements in the subview,
  58. // so regenerate A with zeros in the subview region
  59. // in order to increase merging efficiency
  60. sv.zeros();
  61. }
  62. SpMat<eT> out(arma_reserve_indicator(), A.n_rows, A.n_cols, merge_n_nonzero);
  63. typename SpMat<eT>::const_iterator x_it = A.begin();
  64. typename SpMat<eT>::const_iterator x_end = A.end();
  65. typename SpMat<eT>::const_iterator y_it = B.begin();
  66. typename SpMat<eT>::const_iterator y_end = B.end();
  67. uword count = 0;
  68. bool x_it_valid = (x_it != x_end);
  69. bool y_it_valid = (y_it != y_end);
  70. while(x_it_valid || y_it_valid)
  71. {
  72. eT out_val = eT(0);
  73. const uword x_it_row = (x_it_valid) ? uword(x_it.row()) : uword(0);
  74. const uword x_it_col = (x_it_valid) ? uword(x_it.col()) : uword(0);
  75. const uword y_it_row = (y_it_valid) ? uword(sv_row_start + y_it.row()) : uword(0);
  76. const uword y_it_col = (y_it_valid) ? uword(sv_col_start + y_it.col()) : uword(0);
  77. bool use_y_loc = false;
  78. if(x_it_valid && y_it_valid)
  79. {
  80. if( (x_it_row == y_it_row) && (x_it_col == y_it_col) )
  81. {
  82. out_val = (*y_it);
  83. ++x_it;
  84. ++y_it;
  85. }
  86. else
  87. {
  88. 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
  89. {
  90. const bool x_inside_box = ((x_it_row >= sv_row_start) && (x_it_row <= sv_row_end)) && ((x_it_col >= sv_col_start) && (x_it_col <= sv_col_end));
  91. out_val = (x_inside_box) ? eT(0) : (*x_it);
  92. ++x_it;
  93. }
  94. else
  95. {
  96. out_val = (*y_it);
  97. ++y_it;
  98. use_y_loc = true;
  99. }
  100. }
  101. }
  102. else
  103. if(x_it_valid)
  104. {
  105. const bool x_inside_box = ((x_it_row >= sv_row_start) && (x_it_row <= sv_row_end)) && ((x_it_col >= sv_col_start) && (x_it_col <= sv_col_end));
  106. out_val = (x_inside_box) ? eT(0) : (*x_it);
  107. ++x_it;
  108. }
  109. else
  110. if(y_it_valid)
  111. {
  112. out_val = (*y_it);
  113. ++y_it;
  114. use_y_loc = true;
  115. }
  116. if(out_val != eT(0))
  117. {
  118. access::rw(out.values[count]) = out_val;
  119. const uword out_row = (use_y_loc == false) ? x_it_row : y_it_row;
  120. const uword out_col = (use_y_loc == false) ? x_it_col : y_it_col;
  121. access::rw(out.row_indices[count]) = out_row;
  122. access::rw(out.col_ptrs[out_col + 1])++;
  123. ++count;
  124. }
  125. x_it_valid = (x_it != x_end);
  126. y_it_valid = (y_it != y_end);
  127. }
  128. arma_check( (count != merge_n_nonzero), "internal error: spglue_merge::subview_merge(): count != merge_n_nonzero" );
  129. const uword out_n_cols = out.n_cols;
  130. uword* col_ptrs = access::rwp(out.col_ptrs);
  131. for(uword c = 1; c <= out_n_cols; ++c)
  132. {
  133. col_ptrs[c] += col_ptrs[c - 1];
  134. }
  135. A.steal_mem(out);
  136. access::rw(sv.n_nonzero) = B.n_nonzero;
  137. }
  138. template<typename eT>
  139. arma_hot
  140. inline
  141. void
  142. spglue_merge::subview_merge(SpSubview<eT>& sv, const Mat<eT>& B)
  143. {
  144. arma_extra_debug_sigprint();
  145. if(sv.n_elem == 0) { return; }
  146. const eT* B_memptr = B.memptr();
  147. const uword B_n_elem = B.n_elem;
  148. uword B_n_nonzero = 0;
  149. for(uword i=0; i < B_n_elem; ++i)
  150. {
  151. B_n_nonzero += (B_memptr[i] != eT(0)) ? uword(1) : uword(0);
  152. }
  153. if(B_n_nonzero == 0) { sv.zeros(); return; }
  154. SpMat<eT>& A = access::rw(sv.m);
  155. const uword merge_n_nonzero = A.n_nonzero - sv.n_nonzero + B_n_nonzero;
  156. const uword sv_row_start = sv.aux_row1;
  157. const uword sv_col_start = sv.aux_col1;
  158. const uword sv_row_end = sv.aux_row1 + sv.n_rows - 1;
  159. const uword sv_col_end = sv.aux_col1 + sv.n_cols - 1;
  160. if(A.n_nonzero == sv.n_nonzero)
  161. {
  162. // A is either all zeros or has all of its elements in the subview
  163. // so the merge is equivalent to overwrite of A
  164. SpMat<eT> tmp(arma_reserve_indicator(), A.n_rows, A.n_cols, B_n_nonzero);
  165. typename Mat<eT>::const_row_col_iterator B_it = B.begin_row_col();
  166. typename Mat<eT>::const_row_col_iterator B_it_end = B.end_row_col();
  167. uword tmp_count = 0;
  168. for(; B_it != B_it_end; ++B_it)
  169. {
  170. const eT val = (*B_it);
  171. if(val != eT(0))
  172. {
  173. access::rw(tmp.values[tmp_count]) = val;
  174. access::rw(tmp.row_indices[tmp_count]) = B_it.row() + sv_row_start;
  175. access::rw(tmp.col_ptrs[B_it.col() + sv_col_start + 1])++;
  176. ++tmp_count;
  177. }
  178. }
  179. for(uword i=0; i < tmp.n_cols; ++i)
  180. {
  181. access::rw(tmp.col_ptrs[i + 1]) += tmp.col_ptrs[i];
  182. }
  183. A.steal_mem(tmp);
  184. access::rw(sv.n_nonzero) = B_n_nonzero;
  185. return;
  186. }
  187. if(sv.n_nonzero > (A.n_nonzero/2))
  188. {
  189. // A has most of its elements in the subview,
  190. // so regenerate A with zeros in the subview region
  191. // in order to increase merging efficiency
  192. sv.zeros();
  193. }
  194. SpMat<eT> out(arma_reserve_indicator(), A.n_rows, A.n_cols, merge_n_nonzero);
  195. typename SpMat<eT>::const_iterator x_it = A.begin();
  196. typename SpMat<eT>::const_iterator x_end = A.end();
  197. typename Mat<eT>::const_row_col_iterator y_it = B.begin_row_col();
  198. typename Mat<eT>::const_row_col_iterator y_end = B.end_row_col();
  199. uword count = 0;
  200. bool x_it_valid = (x_it != x_end);
  201. bool y_it_valid = (y_it != y_end);
  202. while(x_it_valid || y_it_valid)
  203. {
  204. eT out_val = eT(0);
  205. const uword x_it_row = (x_it_valid) ? uword(x_it.row()) : uword(0);
  206. const uword x_it_col = (x_it_valid) ? uword(x_it.col()) : uword(0);
  207. const uword y_it_row = (y_it_valid) ? uword(sv_row_start + y_it.row()) : uword(0);
  208. const uword y_it_col = (y_it_valid) ? uword(sv_col_start + y_it.col()) : uword(0);
  209. bool use_y_loc = false;
  210. if(x_it_valid && y_it_valid)
  211. {
  212. if( (x_it_row == y_it_row) && (x_it_col == y_it_col) )
  213. {
  214. out_val = (*y_it);
  215. ++x_it;
  216. ++y_it;
  217. }
  218. else
  219. {
  220. 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
  221. {
  222. const bool x_inside_box = ((x_it_row >= sv_row_start) && (x_it_row <= sv_row_end)) && ((x_it_col >= sv_col_start) && (x_it_col <= sv_col_end));
  223. out_val = (x_inside_box) ? eT(0) : (*x_it);
  224. ++x_it;
  225. }
  226. else
  227. {
  228. out_val = (*y_it);
  229. ++y_it;
  230. use_y_loc = true;
  231. }
  232. }
  233. }
  234. else
  235. if(x_it_valid)
  236. {
  237. const bool x_inside_box = ((x_it_row >= sv_row_start) && (x_it_row <= sv_row_end)) && ((x_it_col >= sv_col_start) && (x_it_col <= sv_col_end));
  238. out_val = (x_inside_box) ? eT(0) : (*x_it);
  239. ++x_it;
  240. }
  241. else
  242. if(y_it_valid)
  243. {
  244. out_val = (*y_it);
  245. ++y_it;
  246. use_y_loc = true;
  247. }
  248. if(out_val != eT(0))
  249. {
  250. access::rw(out.values[count]) = out_val;
  251. const uword out_row = (use_y_loc == false) ? x_it_row : y_it_row;
  252. const uword out_col = (use_y_loc == false) ? x_it_col : y_it_col;
  253. access::rw(out.row_indices[count]) = out_row;
  254. access::rw(out.col_ptrs[out_col + 1])++;
  255. ++count;
  256. }
  257. x_it_valid = (x_it != x_end);
  258. y_it_valid = (y_it != y_end);
  259. }
  260. arma_check( (count != merge_n_nonzero), "internal error: spglue_merge::subview_merge(): count != merge_n_nonzero" );
  261. const uword out_n_cols = out.n_cols;
  262. uword* col_ptrs = access::rwp(out.col_ptrs);
  263. for(uword c = 1; c <= out_n_cols; ++c)
  264. {
  265. col_ptrs[c] += col_ptrs[c - 1];
  266. }
  267. A.steal_mem(out);
  268. access::rw(sv.n_nonzero) = B_n_nonzero;
  269. }
  270. template<typename eT>
  271. arma_hot
  272. inline
  273. void
  274. spglue_merge::symmat_merge(SpMat<eT>& out, const SpMat<eT>& A, const SpMat<eT>& B)
  275. {
  276. arma_extra_debug_sigprint();
  277. out.reserve(A.n_rows, A.n_cols, 2*A.n_nonzero); // worst case scenario
  278. typename SpMat<eT>::const_iterator x_it = A.begin();
  279. typename SpMat<eT>::const_iterator x_end = A.end();
  280. typename SpMat<eT>::const_iterator y_it = B.begin();
  281. typename SpMat<eT>::const_iterator y_end = B.end();
  282. uword count = 0;
  283. while( (x_it != x_end) || (y_it != y_end) )
  284. {
  285. eT out_val;
  286. const uword x_it_col = x_it.col();
  287. const uword x_it_row = x_it.row();
  288. const uword y_it_col = y_it.col();
  289. const uword y_it_row = y_it.row();
  290. bool use_y_loc = false;
  291. if(x_it == y_it)
  292. {
  293. // this can only happen on the diagonal
  294. out_val = (*x_it);
  295. ++x_it;
  296. ++y_it;
  297. }
  298. else
  299. {
  300. 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
  301. {
  302. out_val = (*x_it);
  303. ++x_it;
  304. }
  305. else
  306. {
  307. out_val = (*y_it);
  308. ++y_it;
  309. use_y_loc = true;
  310. }
  311. }
  312. access::rw(out.values[count]) = out_val;
  313. const uword out_row = (use_y_loc == false) ? x_it_row : y_it_row;
  314. const uword out_col = (use_y_loc == false) ? x_it_col : y_it_col;
  315. access::rw(out.row_indices[count]) = out_row;
  316. access::rw(out.col_ptrs[out_col + 1])++;
  317. ++count;
  318. }
  319. const uword out_n_cols = out.n_cols;
  320. uword* col_ptrs = access::rwp(out.col_ptrs);
  321. // Fix column pointers to be cumulative.
  322. for(uword c = 1; c <= out_n_cols; ++c)
  323. {
  324. col_ptrs[c] += col_ptrs[c - 1];
  325. }
  326. // quick resize without reallocating memory and copying data
  327. access::rw( out.n_nonzero) = count;
  328. access::rw( out.values[count]) = eT(0);
  329. access::rw(out.row_indices[count]) = uword(0);
  330. }
  331. template<typename eT>
  332. arma_hot
  333. inline
  334. void
  335. spglue_merge::diagview_merge(SpMat<eT>& out, const SpMat<eT>& A, const SpMat<eT>& B)
  336. {
  337. arma_extra_debug_sigprint();
  338. // NOTE: assuming that B has non-zero elements only on the main diagonal
  339. out.reserve(A.n_rows, A.n_cols, A.n_nonzero + B.n_nonzero); // worst case scenario
  340. typename SpMat<eT>::const_iterator x_it = A.begin();
  341. typename SpMat<eT>::const_iterator x_end = A.end();
  342. typename SpMat<eT>::const_iterator y_it = B.begin();
  343. typename SpMat<eT>::const_iterator y_end = B.end();
  344. uword count = 0;
  345. while( (x_it != x_end) || (y_it != y_end) )
  346. {
  347. eT out_val = eT(0);
  348. const uword x_it_col = x_it.col();
  349. const uword x_it_row = x_it.row();
  350. const uword y_it_col = y_it.col();
  351. const uword y_it_row = y_it.row();
  352. bool use_y_loc = false;
  353. if(x_it == y_it)
  354. {
  355. // this can only happen on the diagonal
  356. out_val = (*y_it);
  357. ++x_it;
  358. ++y_it;
  359. }
  360. else
  361. {
  362. 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
  363. {
  364. if(x_it_col != x_it_row) { out_val = (*x_it); } // don't take values from the main diagonal of A
  365. ++x_it;
  366. }
  367. else
  368. {
  369. if(y_it_col == y_it_row) { out_val = (*y_it); use_y_loc = true; } // take values only from the main diagonal of B
  370. ++y_it;
  371. }
  372. }
  373. if(out_val != eT(0))
  374. {
  375. access::rw(out.values[count]) = out_val;
  376. const uword out_row = (use_y_loc == false) ? x_it_row : y_it_row;
  377. const uword out_col = (use_y_loc == false) ? x_it_col : y_it_col;
  378. access::rw(out.row_indices[count]) = out_row;
  379. access::rw(out.col_ptrs[out_col + 1])++;
  380. ++count;
  381. }
  382. }
  383. const uword out_n_cols = out.n_cols;
  384. uword* col_ptrs = access::rwp(out.col_ptrs);
  385. // Fix column pointers to be cumulative.
  386. for(uword c = 1; c <= out_n_cols; ++c)
  387. {
  388. col_ptrs[c] += col_ptrs[c - 1];
  389. }
  390. // quick resize without reallocating memory and copying data
  391. access::rw( out.n_nonzero) = count;
  392. access::rw( out.values[count]) = eT(0);
  393. access::rw(out.row_indices[count]) = uword(0);
  394. }
  395. //! @}