doc/html/test_sortperm.html

 // ========================================================================= //
 // This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
 // and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
 // ========================================================================= //

 #include <myramath/utility/random.h>
 #include <myramath/utility/sortperm.h>
 #include <myramath/utility/stlprint.h>

 #include <tests/myratest.h>

 using namespace myra;
 using namespace myra_stlprint;

 ADD_TEST("sortperm","[utility]")
   {
   int V = 10;
   // Fill vector v1 with random values.
   std::vector<float> v1;
   for (int v = 0; v < V; ++v)
     v1.push_back( random<float>() );
   myra::out() << "v1 = " << v1 << std::endl;
   // Get a sortperm() for v1.
   std::vector<int> perm = sortperm(v1.begin(), v1.end(), std::less<float>());
   myra::out() << "perm = " << perm << std::endl;
   // Fill vector v2 with sorted values from v1.
   std::vector<float> v2;
   for (int v = 0; v < V; ++v)
     v2.push_back( v1[perm[v]] );
   myra::out() << "v2 = " << v2 << std::endl;
   // Verify v2 is sorted.
   bool sorted = true;
   for (int v = 0; v < V-1; ++v)
     if (v2[v] > v2[v+1])
       sorted = false;
   REQUIRE(sorted);
   };
myra::sortperm
std::vector< int > sortperm(Iterator begin, Iterator end, const Comparator &cmp)
Given a range, returns the permutation that will place it in sorted order according to cmp()...
Definition: sortperm.h:50

sortperm.h
Given a range, returns the permutation that will place it in sorted order.

myra
Definition: syntax.dox:1

myra_stlprint
Definition: stlprint.h:32

stlprint.h
Routines for printing the contents of various std::container&#39;s to a std::ostream using operator <<...

random.h
Simplistic random number functions.