Chris@49
|
1 // Copyright (C) 2009-2012 NICTA (www.nicta.com.au)
|
Chris@49
|
2 // Copyright (C) 2009-2012 Conrad Sanderson
|
Chris@49
|
3 // Copyright (C) 2009-2010 Dimitrios Bouzas
|
Chris@49
|
4 //
|
Chris@49
|
5 // This Source Code Form is subject to the terms of the Mozilla Public
|
Chris@49
|
6 // License, v. 2.0. If a copy of the MPL was not distributed with this
|
Chris@49
|
7 // file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
Chris@49
|
8
|
Chris@49
|
9
|
Chris@49
|
10
|
Chris@49
|
11 //! \addtogroup op_shuffle
|
Chris@49
|
12 //! @{
|
Chris@49
|
13
|
Chris@49
|
14
|
Chris@49
|
15
|
Chris@49
|
16 template<typename T1>
|
Chris@49
|
17 inline
|
Chris@49
|
18 void
|
Chris@49
|
19 op_shuffle::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_shuffle>& in)
|
Chris@49
|
20 {
|
Chris@49
|
21 arma_extra_debug_sigprint();
|
Chris@49
|
22
|
Chris@49
|
23 typedef typename T1::elem_type eT;
|
Chris@49
|
24
|
Chris@49
|
25 const unwrap<T1> tmp(in.m);
|
Chris@49
|
26 const Mat<eT>& X = tmp.M;
|
Chris@49
|
27
|
Chris@49
|
28 if(X.is_empty()) { out.copy_size(X); return; }
|
Chris@49
|
29
|
Chris@49
|
30 const uword dim = in.aux_uword_a;
|
Chris@49
|
31 const uword N = (dim == 0) ? X.n_rows : X.n_cols;
|
Chris@49
|
32
|
Chris@49
|
33 // see "fn_sort_index.hpp" for the definition of "arma_sort_index_packet"
|
Chris@49
|
34 // and the associated comparison functor
|
Chris@49
|
35 std::vector< arma_sort_index_packet<int,uword> > packet_vec(N);
|
Chris@49
|
36
|
Chris@49
|
37 for(uword i=0; i<N; ++i)
|
Chris@49
|
38 {
|
Chris@49
|
39 packet_vec[i].val = std::rand();
|
Chris@49
|
40 packet_vec[i].index = i;
|
Chris@49
|
41 }
|
Chris@49
|
42
|
Chris@49
|
43 arma_sort_index_helper_ascend comparator;
|
Chris@49
|
44
|
Chris@49
|
45 std::sort( packet_vec.begin(), packet_vec.end(), comparator );
|
Chris@49
|
46
|
Chris@49
|
47 const bool is_alias = (&out == &X);
|
Chris@49
|
48
|
Chris@49
|
49 if(X.is_vec() == false)
|
Chris@49
|
50 {
|
Chris@49
|
51 if(is_alias == false)
|
Chris@49
|
52 {
|
Chris@49
|
53 arma_extra_debug_print("op_shuffle::apply(): matrix");
|
Chris@49
|
54
|
Chris@49
|
55 out.copy_size(X);
|
Chris@49
|
56
|
Chris@49
|
57 if(dim == 0)
|
Chris@49
|
58 {
|
Chris@49
|
59 for(uword i=0; i<N; ++i) { out.row(i) = X.row(packet_vec[i].index); }
|
Chris@49
|
60 }
|
Chris@49
|
61 else
|
Chris@49
|
62 {
|
Chris@49
|
63 for(uword i=0; i<N; ++i) { out.col(i) = X.col(packet_vec[i].index); }
|
Chris@49
|
64 }
|
Chris@49
|
65 }
|
Chris@49
|
66 else // in-place shuffle
|
Chris@49
|
67 {
|
Chris@49
|
68 arma_extra_debug_print("op_shuffle::apply(): in-place matrix");
|
Chris@49
|
69
|
Chris@49
|
70 // reuse the val member variable of packet_vec
|
Chris@49
|
71 // to indicate whether a particular row or column
|
Chris@49
|
72 // has already been shuffled
|
Chris@49
|
73
|
Chris@49
|
74 for(uword i=0; i<N; ++i)
|
Chris@49
|
75 {
|
Chris@49
|
76 packet_vec[i].val = 0;
|
Chris@49
|
77 }
|
Chris@49
|
78
|
Chris@49
|
79 if(dim == 0)
|
Chris@49
|
80 {
|
Chris@49
|
81 for(uword i=0; i<N; ++i)
|
Chris@49
|
82 {
|
Chris@49
|
83 if(packet_vec[i].val == 0)
|
Chris@49
|
84 {
|
Chris@49
|
85 const uword j = packet_vec[i].index;
|
Chris@49
|
86
|
Chris@49
|
87 out.swap_rows(i, j);
|
Chris@49
|
88
|
Chris@49
|
89 packet_vec[j].val = 1;
|
Chris@49
|
90 }
|
Chris@49
|
91 }
|
Chris@49
|
92 }
|
Chris@49
|
93 else
|
Chris@49
|
94 {
|
Chris@49
|
95 for(uword i=0; i<N; ++i)
|
Chris@49
|
96 {
|
Chris@49
|
97 if(packet_vec[i].val == 0)
|
Chris@49
|
98 {
|
Chris@49
|
99 const uword j = packet_vec[i].index;
|
Chris@49
|
100
|
Chris@49
|
101 out.swap_cols(i, j);
|
Chris@49
|
102
|
Chris@49
|
103 packet_vec[j].val = 1;
|
Chris@49
|
104 }
|
Chris@49
|
105 }
|
Chris@49
|
106 }
|
Chris@49
|
107 }
|
Chris@49
|
108 }
|
Chris@49
|
109 else // we're dealing with a vector
|
Chris@49
|
110 {
|
Chris@49
|
111 if(is_alias == false)
|
Chris@49
|
112 {
|
Chris@49
|
113 arma_extra_debug_print("op_shuffle::apply(): vector");
|
Chris@49
|
114
|
Chris@49
|
115 out.copy_size(X);
|
Chris@49
|
116
|
Chris@49
|
117 if(dim == 0)
|
Chris@49
|
118 {
|
Chris@49
|
119 if(X.n_rows > 1) // i.e. column vector
|
Chris@49
|
120 {
|
Chris@49
|
121 for(uword i=0; i<N; ++i) { out[i] = X[ packet_vec[i].index ]; }
|
Chris@49
|
122 }
|
Chris@49
|
123 else
|
Chris@49
|
124 {
|
Chris@49
|
125 out = X;
|
Chris@49
|
126 }
|
Chris@49
|
127 }
|
Chris@49
|
128 else
|
Chris@49
|
129 {
|
Chris@49
|
130 if(X.n_cols > 1) // i.e. row vector
|
Chris@49
|
131 {
|
Chris@49
|
132 for(uword i=0; i<N; ++i) { out[i] = X[ packet_vec[i].index ]; }
|
Chris@49
|
133 }
|
Chris@49
|
134 else
|
Chris@49
|
135 {
|
Chris@49
|
136 out = X;
|
Chris@49
|
137 }
|
Chris@49
|
138 }
|
Chris@49
|
139 }
|
Chris@49
|
140 else // in-place shuffle
|
Chris@49
|
141 {
|
Chris@49
|
142 arma_extra_debug_print("op_shuffle::apply(): in-place vector");
|
Chris@49
|
143
|
Chris@49
|
144 // reuse the val member variable of packet_vec
|
Chris@49
|
145 // to indicate whether a particular row or column
|
Chris@49
|
146 // has already been shuffled
|
Chris@49
|
147
|
Chris@49
|
148 for(uword i=0; i<N; ++i)
|
Chris@49
|
149 {
|
Chris@49
|
150 packet_vec[i].val = 0;
|
Chris@49
|
151 }
|
Chris@49
|
152
|
Chris@49
|
153 if(dim == 0)
|
Chris@49
|
154 {
|
Chris@49
|
155 if(X.n_rows > 1) // i.e. column vector
|
Chris@49
|
156 {
|
Chris@49
|
157 for(uword i=0; i<N; ++i)
|
Chris@49
|
158 {
|
Chris@49
|
159 if(packet_vec[i].val == 0)
|
Chris@49
|
160 {
|
Chris@49
|
161 const uword j = packet_vec[i].index;
|
Chris@49
|
162
|
Chris@49
|
163 std::swap(out[i], out[j]);
|
Chris@49
|
164
|
Chris@49
|
165 packet_vec[j].val = 1;
|
Chris@49
|
166 }
|
Chris@49
|
167 }
|
Chris@49
|
168 }
|
Chris@49
|
169 }
|
Chris@49
|
170 else
|
Chris@49
|
171 {
|
Chris@49
|
172 if(X.n_cols > 1) // i.e. row vector
|
Chris@49
|
173 {
|
Chris@49
|
174 for(uword i=0; i<N; ++i)
|
Chris@49
|
175 {
|
Chris@49
|
176 if(packet_vec[i].val == 0)
|
Chris@49
|
177 {
|
Chris@49
|
178 const uword j = packet_vec[i].index;
|
Chris@49
|
179
|
Chris@49
|
180 std::swap(out[i], out[j]);
|
Chris@49
|
181
|
Chris@49
|
182 packet_vec[j].val = 1;
|
Chris@49
|
183 }
|
Chris@49
|
184 }
|
Chris@49
|
185 }
|
Chris@49
|
186 }
|
Chris@49
|
187 }
|
Chris@49
|
188 }
|
Chris@49
|
189
|
Chris@49
|
190 }
|
Chris@49
|
191
|
Chris@49
|
192
|
Chris@49
|
193 //! @}
|