sort_index.h

#ifndef _theplu_yat_utility_sort_index_
#define _theplu_yat_utility_sort_index_ 

// $Id: sort_index.h 2202 2010-02-21 18:39:13Z peter $

/*
  Copyright (C) 2008, 2010 Peter Johansson

  This file is part of the yat library, http://dev.thep.lu.se/yat

  The yat library 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 3 of the
  License, or (at your option) any later version.

  The yat library 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 yat. If not, see <http://www.gnu.org/licenses/>.
*/

#include "StrideIterator.h"

#include <boost/concept_check.hpp>

#include <algorithm>
#include <iterator>
#include <vector>

namespace theplu {
namespace yat {
namespace utility {

  template<typename ForwardIterator>
  void sort_index(ForwardIterator first, ForwardIterator last, 
                  std::vector<size_t>& sort_index);
    
    
  void sort_index(StrideIterator<double*> first, 
                  StrideIterator<double*> last, 
                  std::vector<size_t>& sort_index);

  void sort_index(StrideIterator<const double*> first, 
                  StrideIterator<const double*> last, 
                  std::vector<size_t>& sort_index);

  void sort_index(std::vector<double>::iterator first, 
                  std::vector<double>::iterator last, 
                  std::vector<size_t>& sort_index);

  void sort_index(std::vector<double>::const_iterator first, 
                  std::vector<double>::const_iterator last, 
                  std::vector<size_t>& sort_index);


  //  template implementation

  template<typename ForwardIterator>
  void sort_index(ForwardIterator first, ForwardIterator last, 
                  std::vector<size_t>& result)
  {
    BOOST_CONCEPT_ASSERT((boost::ForwardIterator<ForwardIterator>));
    std::vector<double> vec;
    vec.reserve(std::distance(first, last));
    std::copy(first, last, 
              std::back_insert_iterator<std::vector<double> >(vec));
    sort_index(vec.begin(), vec.end(), result);
  }

}}} // of namespace utility, yat, and theplu

#endif