sorting.h

Go to the documentation of this file.

/* Copyright (C) 2003-2008 Oliver Lemke  <olemke@core-dump.info>

   This program is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by the
   Free Software Foundation; either version 2, or (at your option) any
   later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
   USA.
   */



//   File description

#ifndef sorting_h
#define sorting_h

#include <algorithm>
#include <functional>

#include "matpack.h"
#include "array.h"

template <typename T>
class IndexComp : public binary_function<Index, Index, bool>
{
   const T      &m_data;

public:
   IndexComp (const T& data ) : m_data (data) {}

   bool operator()(Index a, Index b) const
   {
      return (m_data[a] < m_data[b]);
   }
};

template <typename T> void
get_sorted_indexes (ArrayOfIndex& sorted, const T& data)
{
  sorted.resize (0);

  Index i = 0;
  for (typename T::const_iterator it = data.begin (); it != data.end (); ++it)
    {
      sorted.push_back (i);
      i++;
    }

  sort (sorted.begin(), sorted.end(), IndexComp<T>(data));
}

#endif /* sorting_h */

---