Chris@49
|
1 // Copyright (C) 2008-2011 NICTA (www.nicta.com.au)
|
Chris@49
|
2 // Copyright (C) 2008-2011 Conrad Sanderson
|
Chris@49
|
3 //
|
Chris@49
|
4 // This Source Code Form is subject to the terms of the Mozilla Public
|
Chris@49
|
5 // License, v. 2.0. If a copy of the MPL was not distributed with this
|
Chris@49
|
6 // file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
Chris@49
|
7
|
Chris@49
|
8
|
Chris@49
|
9 //! \addtogroup glue_join
|
Chris@49
|
10 //! @{
|
Chris@49
|
11
|
Chris@49
|
12
|
Chris@49
|
13
|
Chris@49
|
14 template<typename T1, typename T2>
|
Chris@49
|
15 inline
|
Chris@49
|
16 void
|
Chris@49
|
17 glue_join::apply(Mat<typename T1::elem_type>& out, const Glue<T1,T2,glue_join>& X)
|
Chris@49
|
18 {
|
Chris@49
|
19 arma_extra_debug_sigprint();
|
Chris@49
|
20
|
Chris@49
|
21 typedef typename T1::elem_type eT;
|
Chris@49
|
22
|
Chris@49
|
23 const unwrap<T1> A_tmp(X.A);
|
Chris@49
|
24 const unwrap<T2> B_tmp(X.B);
|
Chris@49
|
25
|
Chris@49
|
26 const Mat<eT>& A = A_tmp.M;
|
Chris@49
|
27 const Mat<eT>& B = B_tmp.M;
|
Chris@49
|
28
|
Chris@49
|
29 const uword A_n_rows = A.n_rows;
|
Chris@49
|
30 const uword A_n_cols = A.n_cols;
|
Chris@49
|
31
|
Chris@49
|
32 const uword B_n_rows = B.n_rows;
|
Chris@49
|
33 const uword B_n_cols = B.n_cols;
|
Chris@49
|
34
|
Chris@49
|
35 const uword join_type = X.aux_uword;
|
Chris@49
|
36
|
Chris@49
|
37 if(join_type == 0)
|
Chris@49
|
38 {
|
Chris@49
|
39 arma_debug_check
|
Chris@49
|
40 (
|
Chris@49
|
41 ( (A_n_cols != B_n_cols) && ( (A_n_rows > 0) || (A_n_cols > 0) ) && ( (B_n_rows > 0) || (B_n_cols > 0) ) ),
|
Chris@49
|
42 "join_cols(): number of columns must be the same"
|
Chris@49
|
43 );
|
Chris@49
|
44 }
|
Chris@49
|
45 else
|
Chris@49
|
46 {
|
Chris@49
|
47 arma_debug_check
|
Chris@49
|
48 (
|
Chris@49
|
49 ( (A_n_rows != B.n_rows) && ( (A_n_rows > 0) || (A_n_cols > 0) ) && ( (B_n_rows > 0) || (B_n_cols > 0) ) ),
|
Chris@49
|
50 "join_rows(): number of rows must be the same"
|
Chris@49
|
51 );
|
Chris@49
|
52 }
|
Chris@49
|
53
|
Chris@49
|
54
|
Chris@49
|
55 if( (&out != &A) && (&out != &B) )
|
Chris@49
|
56 {
|
Chris@49
|
57 if(join_type == 0) // join columns (i.e. result matrix has more rows)
|
Chris@49
|
58 {
|
Chris@49
|
59 out.set_size( A_n_rows + B_n_rows, (std::max)(A_n_cols, B_n_cols) );
|
Chris@49
|
60
|
Chris@49
|
61 if( out.n_elem > 0 )
|
Chris@49
|
62 {
|
Chris@49
|
63 if(A.is_empty() == false)
|
Chris@49
|
64 {
|
Chris@49
|
65 out.submat(0, 0, A_n_rows-1, out.n_cols-1) = A;
|
Chris@49
|
66 }
|
Chris@49
|
67
|
Chris@49
|
68 if(B.is_empty() == false)
|
Chris@49
|
69 {
|
Chris@49
|
70 out.submat(A_n_rows, 0, out.n_rows-1, out.n_cols-1) = B;
|
Chris@49
|
71 }
|
Chris@49
|
72 }
|
Chris@49
|
73 }
|
Chris@49
|
74 else // join rows (i.e. result matrix has more columns)
|
Chris@49
|
75 {
|
Chris@49
|
76 out.set_size( (std::max)(A_n_rows, B_n_rows), A_n_cols + B_n_cols );
|
Chris@49
|
77
|
Chris@49
|
78 if( out.n_elem > 0 )
|
Chris@49
|
79 {
|
Chris@49
|
80 if(A.is_empty() == false)
|
Chris@49
|
81 {
|
Chris@49
|
82 out.submat(0, 0, out.n_rows-1, A.n_cols-1) = A;
|
Chris@49
|
83 }
|
Chris@49
|
84
|
Chris@49
|
85 if(B.is_empty() == false)
|
Chris@49
|
86 {
|
Chris@49
|
87 out.submat(0, A_n_cols, out.n_rows-1, out.n_cols-1) = B;
|
Chris@49
|
88 }
|
Chris@49
|
89 }
|
Chris@49
|
90 }
|
Chris@49
|
91 }
|
Chris@49
|
92 else // we have aliasing
|
Chris@49
|
93 {
|
Chris@49
|
94 Mat<eT> C;
|
Chris@49
|
95
|
Chris@49
|
96 if(join_type == 0)
|
Chris@49
|
97 {
|
Chris@49
|
98 C.set_size( A_n_rows + B_n_rows, (std::max)(A_n_cols, B_n_cols) );
|
Chris@49
|
99
|
Chris@49
|
100 if( C.n_elem > 0 )
|
Chris@49
|
101 {
|
Chris@49
|
102 if(A.is_empty() == false)
|
Chris@49
|
103 {
|
Chris@49
|
104 C.submat(0, 0, A_n_rows-1, C.n_cols-1) = A;
|
Chris@49
|
105 }
|
Chris@49
|
106
|
Chris@49
|
107 if(B.is_empty() == false)
|
Chris@49
|
108 {
|
Chris@49
|
109 C.submat(A_n_rows, 0, C.n_rows-1, C.n_cols-1) = B;
|
Chris@49
|
110 }
|
Chris@49
|
111 }
|
Chris@49
|
112 }
|
Chris@49
|
113 else
|
Chris@49
|
114 {
|
Chris@49
|
115 C.set_size( (std::max)(A_n_rows, B_n_rows), A_n_cols + B_n_cols );
|
Chris@49
|
116
|
Chris@49
|
117 if( C.n_elem > 0 )
|
Chris@49
|
118 {
|
Chris@49
|
119 if(A.is_empty() == false)
|
Chris@49
|
120 {
|
Chris@49
|
121 C.submat(0, 0, C.n_rows-1, A_n_cols-1) = A;
|
Chris@49
|
122 }
|
Chris@49
|
123
|
Chris@49
|
124 if(B.is_empty() == false)
|
Chris@49
|
125 {
|
Chris@49
|
126 C.submat(0, A_n_cols, C.n_rows-1, C.n_cols-1) = B;
|
Chris@49
|
127 }
|
Chris@49
|
128 }
|
Chris@49
|
129 }
|
Chris@49
|
130
|
Chris@49
|
131 out.steal_mem(C);
|
Chris@49
|
132 }
|
Chris@49
|
133
|
Chris@49
|
134 }
|
Chris@49
|
135
|
Chris@49
|
136
|
Chris@49
|
137
|
Chris@49
|
138 template<typename T1, typename T2>
|
Chris@49
|
139 inline
|
Chris@49
|
140 void
|
Chris@49
|
141 glue_join::apply(Cube<typename T1::elem_type>& out, const GlueCube<T1,T2,glue_join>& X)
|
Chris@49
|
142 {
|
Chris@49
|
143 arma_extra_debug_sigprint();
|
Chris@49
|
144
|
Chris@49
|
145 typedef typename T1::elem_type eT;
|
Chris@49
|
146
|
Chris@49
|
147 const unwrap_cube<T1> A_tmp(X.A);
|
Chris@49
|
148 const unwrap_cube<T2> B_tmp(X.B);
|
Chris@49
|
149
|
Chris@49
|
150 const Cube<eT>& A = A_tmp.M;
|
Chris@49
|
151 const Cube<eT>& B = B_tmp.M;
|
Chris@49
|
152
|
Chris@49
|
153 if(A.n_elem == 0)
|
Chris@49
|
154 {
|
Chris@49
|
155 out = B;
|
Chris@49
|
156 return;
|
Chris@49
|
157 }
|
Chris@49
|
158
|
Chris@49
|
159 if(B.n_elem == 0)
|
Chris@49
|
160 {
|
Chris@49
|
161 out = A;
|
Chris@49
|
162 return;
|
Chris@49
|
163 }
|
Chris@49
|
164
|
Chris@49
|
165
|
Chris@49
|
166 arma_debug_check( ( (A.n_rows != B.n_rows) || (A.n_cols != B.n_cols) ), "join_slices(): size of slices must be the same" );
|
Chris@49
|
167
|
Chris@49
|
168
|
Chris@49
|
169 if( (&out != &A) && (&out != &B) )
|
Chris@49
|
170 {
|
Chris@49
|
171 out.set_size(A.n_rows, A.n_cols, A.n_slices + B.n_slices);
|
Chris@49
|
172
|
Chris@49
|
173 out.slices(0, A.n_slices-1 ) = A;
|
Chris@49
|
174 out.slices(A.n_slices, out.n_slices-1) = B;
|
Chris@49
|
175 }
|
Chris@49
|
176 else // we have aliasing
|
Chris@49
|
177 {
|
Chris@49
|
178 Cube<eT> C(A.n_rows, A.n_cols, A.n_slices + B.n_slices);
|
Chris@49
|
179
|
Chris@49
|
180 C.slices(0, A.n_slices-1) = A;
|
Chris@49
|
181 C.slices(A.n_slices, C.n_slices-1) = B;
|
Chris@49
|
182
|
Chris@49
|
183 out.steal_mem(C);
|
Chris@49
|
184 }
|
Chris@49
|
185
|
Chris@49
|
186 }
|
Chris@49
|
187
|
Chris@49
|
188
|
Chris@49
|
189
|
Chris@49
|
190 //! @}
|