sorttest1.cpp

Go to the documentation of this file.

#include <iostream>

#include <boost/timer.hpp>
#include <boost/numeric/ublas/vector.hpp>
#include <boost/numeric/ublas/storage.hpp>
#include <boost/numeric/ublas/io.hpp>

using std::size_t;
using std::cout;
using std::endl;

using namespace boost::numeric::ublas;

int main(size_t argc, char *argv[])
{
  size_t size = 20;

  if (argc > 1)
        size = ::atoi (argv [1]);

  typedef vector <size_t> V1;
  typedef vector <size_t> V2;
  typedef vector <double> V3;

  V1 v1(size);
  V2 v2(size);
  V3 v3(size);

  for (size_t i=0; i<size; ++i) {
        v1(i) = (5*i+3) % size;
        v2(i) = (7*i+1) % size;
        v3(i) = i;
  }

  if (size < 200) {
        cout << v1 << endl;
        cout << v2 << endl;
        cout << v3 << endl;
  }

  boost::timer t;

  t.restart();
  index_triple_array<V1, V2, V3>  ita(size,v1,v2,v3);
  std::sort(ita.begin(), ita.end());

  cout << "sort time " << t.elapsed() << endl;

  if (size < 200) {
        cout << v1 << endl;
        cout << v2 << endl;
        cout << v3 << endl;
  }

  std::sort(v3.begin(), v3.end());
  bool ok = true;
  if (v3(0) == 0) {
        for (size_t i=1; i < size; ++i) {
          if ( (v1(i-1) > v1(i)) || 
                   (v1(i-1) == v1(i) && v2(i-1) > v2(i) ) ) {
                cout << "wrong order: " << i << endl;
                ok = false;
                break;
          }
          if (v3(i) != i) {
                ok = false;
                cout << "lost data: " << i << endl;
                break;
          }
        }
  } else {
        ok = false;
        cout << "lost data: 0" << endl;
  }

  cout << (ok?"ok":"not ok") << endl;

};

---