InsertSortedVector.h

Go to the documentation of this file.

#ifndef INCLUDE_InsertSortedVector_h
#define INCLUDE_InsertSortedVector_h

#ifndef INCLUDE_vector
#define INCLUDE_vector
#include <vector>
#endif

#ifndef INCLUDE_map
#define INCLUDE_map
#include <map>
#endif

template< typename FIRST, typename SECOND>
void tf_InsertSortedVector( std::vector< std::pair<FIRST,SECOND> >& vect_pair_data, std::map< FIRST, SECOND>& mp)
{
  std::vector<bool> is_used( vect_pair_data.size(), false);
  std::vector<bool>::iterator p_is_used;
  size_t i, j;

  if (!mp.empty()) mp.clear();

  for (i= vect_pair_data.size()/2; i!=0; i/=2) {
    for (j=0; j<vect_pair_data.size(); j+=i) {
      if (!is_used[j]) {
        is_used[j] = true;
        //mp[vect_pair_data[j].first] = vect_pair_data[j].second();
        mp.insert( mp.begin(), vect_pair_data[j]);
      }
    }
  }
}

#endif

---