---

CTBsortS.icc

Go to the documentation of this file.

/*----------------------------------------------------------------------------*/
/* C Tool Box: Designed and implemented by:                                   */
/*    Walter F.J. Mueller   Gesellschaft fuer Schwerionenforschung (GSI)      */
/*                          Planckstrasse 1, D-64291 Darmstadt, Germany       */
/*                  Email:  W.F.J.Mueller@gsi.de                              */
/*                  WWW:    http://www-kp3.gsi.de/www/kp3/people/mueller.html */
/*------------------------------------------+---------------------------------*/

#include "CTBgrab.hxx"



template <class T, class C>
inline void CTBsortS<T,C>::operator()(CTBvector<T>& v)
{
  CTBgrab<T>  grab;
  C           compare;
  T           tmp;

  for (CTBint m = v.Size()/2; m > 0; m = m/2) {

    for (CTBint i = m; i < v.Size(); i++) {
      grab(tmp,v[i]);
      CTBint j = i-m;
      
      while (j >= 0 && compare(tmp,v[j])) {
        grab(v[j+m],v[j]);
        j -= m;
      }
      grab(v[j+m],tmp);
    }
  }
  
  return;
}

// Note:
//  1. This implementation was inspired by the one given in Numerical Recipes
//     in C, Chapter 8.1

//------------------------------------------+-----------------------------------

template <class T, class C>
inline void CTBsortS<T,C>::operator()(CTBvector<CTBint>& ind,
                                      const CTBvector<T>& v)
{
  C      compare;
  
  ind.Resize(v.Size());
  for (CTBint i = 0; i < v.Size(); i++) ind[i] = i;
  
  for (CTBint m = v.Size()/2; m > 0; m = m/2) {

    for (CTBint i = m; i < v.Size(); i++) {
      CTBint tmp = ind[i];
      CTBint j   = i-m;
      
      while (j >= 0 && compare(v[tmp],v[ind[j]])) {
        ind[j+m] = ind[j];
        j -= m;
      }
      ind[j+m] = tmp;
    }
  }
  
  return;
}

---