max@0
|
1 // Copyright (C) 2009-2010 NICTA (www.nicta.com.au)
|
max@0
|
2 // Copyright (C) 2009-2010 Conrad Sanderson
|
max@0
|
3 //
|
max@0
|
4 // This file is part of the Armadillo C++ library.
|
max@0
|
5 // It is provided without any warranty of fitness
|
max@0
|
6 // for any purpose. You can redistribute this file
|
max@0
|
7 // and/or modify it under the terms of the GNU
|
max@0
|
8 // Lesser General Public License (LGPL) as published
|
max@0
|
9 // by the Free Software Foundation, either version 3
|
max@0
|
10 // of the License or (at your option) any later version.
|
max@0
|
11 // (see http://www.opensource.org/licenses for more info)
|
max@0
|
12
|
max@0
|
13
|
max@0
|
14 //! \addtogroup fn_sort_index
|
max@0
|
15 //! @{
|
max@0
|
16
|
max@0
|
17
|
max@0
|
18
|
max@0
|
19
|
max@0
|
20 template<typename T1, typename T2>
|
max@0
|
21 struct arma_sort_index_packet_ascend
|
max@0
|
22 {
|
max@0
|
23 T1 val;
|
max@0
|
24 T2 index;
|
max@0
|
25 };
|
max@0
|
26
|
max@0
|
27
|
max@0
|
28
|
max@0
|
29 template<typename T1, typename T2>
|
max@0
|
30 struct arma_sort_index_packet_descend
|
max@0
|
31 {
|
max@0
|
32 T1 val;
|
max@0
|
33 T2 index;
|
max@0
|
34 };
|
max@0
|
35
|
max@0
|
36
|
max@0
|
37
|
max@0
|
38 template<typename T1, typename T2>
|
max@0
|
39 inline
|
max@0
|
40 bool
|
max@0
|
41 operator< (const arma_sort_index_packet_ascend<T1,T2>& A, const arma_sort_index_packet_ascend<T1,T2>& B)
|
max@0
|
42 {
|
max@0
|
43 return A.val < B.val;
|
max@0
|
44 }
|
max@0
|
45
|
max@0
|
46
|
max@0
|
47
|
max@0
|
48 template<typename T1, typename T2>
|
max@0
|
49 inline
|
max@0
|
50 bool
|
max@0
|
51 operator< (const arma_sort_index_packet_descend<T1,T2>& A, const arma_sort_index_packet_descend<T1,T2>& B)
|
max@0
|
52 {
|
max@0
|
53 return A.val > B.val;
|
max@0
|
54 }
|
max@0
|
55
|
max@0
|
56
|
max@0
|
57
|
max@0
|
58 template<typename umat_elem_type, typename packet_type, typename eT>
|
max@0
|
59 void
|
max@0
|
60 inline
|
max@0
|
61 sort_index_helper(umat_elem_type* out_mem, std::vector<packet_type>& packet_vec, const eT* in_mem)
|
max@0
|
62 {
|
max@0
|
63 arma_extra_debug_sigprint();
|
max@0
|
64
|
max@0
|
65 const uword n_elem = packet_vec.size();
|
max@0
|
66
|
max@0
|
67 for(uword i=0; i<n_elem; ++i)
|
max@0
|
68 {
|
max@0
|
69 packet_vec[i].val = in_mem[i];
|
max@0
|
70 packet_vec[i].index = i;
|
max@0
|
71 }
|
max@0
|
72
|
max@0
|
73 std::sort( packet_vec.begin(), packet_vec.end() );
|
max@0
|
74
|
max@0
|
75 for(uword i=0; i<n_elem; ++i)
|
max@0
|
76 {
|
max@0
|
77 out_mem[i] = packet_vec[i].index;
|
max@0
|
78 }
|
max@0
|
79 }
|
max@0
|
80
|
max@0
|
81
|
max@0
|
82
|
max@0
|
83 template<typename T1>
|
max@0
|
84 inline
|
max@0
|
85 umat
|
max@0
|
86 sort_index(const Base<typename T1::elem_type,T1>& X, const uword sort_type = 0)
|
max@0
|
87 {
|
max@0
|
88 arma_extra_debug_sigprint();
|
max@0
|
89
|
max@0
|
90 typedef typename T1::elem_type eT;
|
max@0
|
91
|
max@0
|
92 arma_type_check(( is_complex<eT>::value == true ));
|
max@0
|
93
|
max@0
|
94 const unwrap<T1> tmp(X.get_ref());
|
max@0
|
95 const Mat<eT>& A = tmp.M;
|
max@0
|
96
|
max@0
|
97 if(A.is_empty() == true)
|
max@0
|
98 {
|
max@0
|
99 return umat();
|
max@0
|
100 }
|
max@0
|
101
|
max@0
|
102 arma_debug_check( (A.is_vec() == false), "sort_index(): currently only handles vectors");
|
max@0
|
103
|
max@0
|
104 typedef typename umat::elem_type out_elem_type;
|
max@0
|
105
|
max@0
|
106 umat out(A.n_rows, A.n_cols);
|
max@0
|
107
|
max@0
|
108 if(sort_type == 0)
|
max@0
|
109 {
|
max@0
|
110 std::vector< arma_sort_index_packet_ascend<eT,out_elem_type> > packet_vec(A.n_elem);
|
max@0
|
111
|
max@0
|
112 sort_index_helper(out.memptr(), packet_vec, A.mem);
|
max@0
|
113 }
|
max@0
|
114 else
|
max@0
|
115 {
|
max@0
|
116 std::vector< arma_sort_index_packet_descend<eT,out_elem_type> > packet_vec(A.n_elem);
|
max@0
|
117
|
max@0
|
118 sort_index_helper(out.memptr(), packet_vec, A.mem);
|
max@0
|
119 }
|
max@0
|
120
|
max@0
|
121 return out;
|
max@0
|
122 }
|
max@0
|
123
|
max@0
|
124
|
max@0
|
125 //! @}
|