tensor-0.1.0
 All Data Structures Namespaces Functions Variables Typedefs Enumerations Enumerator Groups Pages
tensor_sort_d.cc
1 // -*- mode: c++; fill-column: 80; c-basic-offset: 2; indent-tabs-mode: nil -*-
2 /*
3  Copyright (c) 2010 Juan Jose Garcia Ripoll
4 
5  Tensor is free software; you can redistribute it and/or modify it
6  under the terms of the GNU Library General Public License as published
7  by the Free Software Foundation; either version 2 of the License, or
8  (at your option) any later version.
9 
10  This program is distributed in the hope that it will be useful,
11  but WITHOUT ANY WARRANTY; without even the implied warranty of
12  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13  GNU Library General Public License for more details.
14 
15  You should have received a copy of the GNU General Public License along
16  with this program; if not, write to the Free Software Foundation, Inc.,
17  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
18 */
19 
20 #include <algorithm>
21 #include <functional>
22 #include <tensor/tensor.h>
23 
24 namespace tensor {
25 
26  const RTensor
27  sort(const RTensor &v, bool reverse)
28  {
29  RTensor output(v);
30  if (reverse) {
31  std::sort(output.begin(), output.end(), std::greater<double>());
32  } else {
33  std::sort(output.begin(), output.end(), std::less<double>());
34  }
35  return output;
36  }
37 
38  template<typename elt_t>
39  struct Compare {
40  const elt_t *p;
41 
42  Compare(const elt_t *newp) : p(newp) {};
43  int operator()(size_t i1, size_t i2) {
44  return p[i1] < p [i2];
45  }
46  };
47 
48  template<typename elt_t>
49  struct CompareInv {
50  const elt_t *p;
51 
52  CompareInv(const elt_t *newp) : p(newp) {};
53  int operator()(size_t i1, size_t i2) {
54  return p[i1] > p[i2];
55  }
56  };
57 
58  const Indices
59  sort_indices(const RTensor &v, bool reverse)
60  {
61  if (v.size()) {
62  Indices output = iota(0,v.size()-1);
63  if (reverse) {
64  CompareInv<double> c(v.begin());
65  std::sort(output.begin(), output.end(), c);
66  } else {
67  Compare<double> c(v.begin());
68  std::sort(output.begin(), output.end(), c);
69  }
70  return output;
71  } else {
72  return Indices();
73  }
74  }
75 
76 }