sort.cpp File Reference

#include <ossim/matrix/include.h>
#include <ossim/matrix/newmatap.h>

Go to the source code of this file.

Macros
#define	WANT_MATH
#define	REPORT   {}
#define	DoSimpleSort   17
#define	MaxDepth   50

Functions
void	SortDescending (GeneralMatrix &GM)
void	SortAscending (GeneralMatrix &GM)
void	SortSV (DiagonalMatrix &D, Matrix &U, bool ascending)
void	SortSV (DiagonalMatrix &D, Matrix &U, Matrix &V, bool ascending)

Macro Definition Documentation

DoSimpleSort

#define DoSimpleSort   17

Definition at line 32 of file sort.cpp.

Referenced by SortAscending(), and SortDescending().

MaxDepth

#define MaxDepth   50

Definition at line 33 of file sort.cpp.

REPORT

#define REPORT   {}

Definition at line 18 of file sort.cpp.

Referenced by SortAscending(), and SortDescending().

WANT_MATH

#define WANT_MATH

Definition at line 5 of file sort.cpp.

Function Documentation

SortAscending()

void SortAscending

(

GeneralMatrix &

GM

)

Definition at line 121 of file sort.cpp.

References DoSimpleSort, max, REPORT, GeneralMatrix::Storage(), and GeneralMatrix::Store().

{
   REPORT
   Tracer et("QuickSortAscending");

   Real* data = GM.Store(); int max = GM.Storage();

   if (max > DoSimpleSort) MyQuickSortAscending(data, data + max - 1, 0);
   InsertionSortAscending(data, max, DoSimpleSort);

}

SortDescending()

void SortDescending

(

GeneralMatrix &

GM

)

Definition at line 45 of file sort.cpp.

References DoSimpleSort, max, REPORT, GeneralMatrix::Storage(), and GeneralMatrix::Store().

Referenced by SVD().

{
   REPORT
   Tracer et("QuickSortDescending");

   Real* data = GM.Store(); int max = GM.Storage();

   if (max > DoSimpleSort) MyQuickSortDescending(data, data + max - 1, 0);
   InsertionSortDescending(data, max, DoSimpleSort);

}

SortSV() [1/2]

void SortSV	(	DiagonalMatrix &	D,
		Matrix &	U,
		bool	ascending
	)

Definition at line 190 of file sort.cpp.

Referenced by SVD().

{
   REPORT
   Tracer trace("SortSV_DU");
   int m = U.Nrows(); int n = U.Ncols();
   if (n != D.Nrows()) Throw(IncompatibleDimensionsException(D,U));
   Real* u = U.Store();
   for (int i=0; i<n; i++)
   {
      int k = i; Real p = D.element(i);
      if (ascending)
      {
         for (int j=i+1; j<n; j++)
            { if (D.element(j) < p) { k = j; p = D.element(j); } }
      }
      else
      {
         for (int j=i+1; j<n; j++)
         { if (D.element(j) > p) { k = j; p = D.element(j); } }
      }
      if (k != i)
      {
         D.element(k) = D.element(i); D.element(i) = p; int j = m;
         Real* uji = u + i; Real* ujk = u + k;
         if (j) for(;;)
         {
            p = *uji; *uji = *ujk; *ujk = p;
            if (!(--j)) break;
            uji += n; ujk += n;
         }
      }
   }
}

SortSV() [2/2]

void SortSV	(	DiagonalMatrix &	D,
		Matrix &	U,
		Matrix &	V,
		bool	ascending
	)

Definition at line 224 of file sort.cpp.

{
   REPORT
   Tracer trace("SortSV_DUV");
   int mu = U.Nrows(); int mv = V.Nrows(); int n = D.Nrows();
   if (n != U.Ncols()) Throw(IncompatibleDimensionsException(D,U));
   if (n != V.Ncols()) Throw(IncompatibleDimensionsException(D,V));
   Real* u = U.Store(); Real* v = V.Store();
   for (int i=0; i<n; i++)
   {
      int k = i; Real p = D.element(i);
      if (ascending)
      {
         for (int j=i+1; j<n; j++)
            { if (D.element(j) < p) { k = j; p = D.element(j); } }
      }
      else
      {
         for (int j=i+1; j<n; j++)
         { if (D.element(j) > p) { k = j; p = D.element(j); } }
      }
      if (k != i)
      {
         D.element(k) = D.element(i); D.element(i) = p;
         Real* uji = u + i; Real* ujk = u + k;
         Real* vji = v + i; Real* vjk = v + k;
         int j = mu;
         if (j) for(;;)
         {
            p = *uji; *uji = *ujk; *ujk = p; if (!(--j)) break;
            uji += n; ujk += n;
         }
         j = mv;
         if (j) for(;;)
         {
            p = *vji; *vji = *vjk; *vjk = p; if (!(--j)) break;
            vji += n; vjk += n;
         }
      }
   }
}