BitonicSort.h File Reference

#include <cstdint>
#include <vector>

Go to the source code of this file.

Enumerations
enum	sort_direction { up, down }

Functions
template<typename T >
void	BitonicCompare (sort_direction aDir, typename std::vector< T >::iterator &aDataStart, typename std::vector< T >::iterator &aDataEnd)
template<typename T >
void	BitonicMerge (sort_direction aDir, typename std::vector< T >::iterator &aDataStart, typename std::vector< T >::iterator &aDataEnd)
template<typename T >
void	BitonicSort (sort_direction aDir, typename std::vector< T >::iterator &aDataStart, typename std::vector< T >::iterator &aDataEnd)

Enumeration Type Documentation

enum sort_direction

Enumerator
up
down

Definition at line 8 of file BitonicSort.h.

{up, down};

Function Documentation

template<typename T >

void BitonicCompare	(	sort_direction	aDir,
		typename std::vector< T >::iterator &	aDataStart,
		typename std::vector< T >::iterator &	aDataEnd
	)

Definition at line 73 of file BitonicSort.h.

References down, std::swap(), and up.

{

  uint32_t lSize( aDataEnd - aDataStart );
  
  typename std::vector<T>::iterator lFirst( aDataStart );
  typename std::vector<T>::iterator lSecond( aDataStart+(lSize>>1) );

  for( ; lSecond != aDataEnd ; ++lFirst , ++lSecond ){
    bool lComp( *lFirst > *lSecond );
    if( ( lComp && (aDir == up) ) || ( !lComp && (aDir == down) ) ) {
      std::swap( *lFirst , *lSecond );
    }
  }

}

template<typename T >

void BitonicMerge	(	sort_direction	aDir,
		typename std::vector< T >::iterator &	aDataStart,
		typename std::vector< T >::iterator &	aDataEnd
	)

Definition at line 55 of file BitonicSort.h.

{
  uint32_t lSize( aDataEnd - aDataStart );

  if( lSize > 1 ){
    BitonicCompare<T> ( aDir, aDataStart , aDataEnd );
    typename std::vector<T>::iterator lMidpoint( aDataStart+(lSize>>1) );
    BitonicMerge<T> ( aDir, aDataStart , lMidpoint );
    BitonicMerge<T> ( aDir, lMidpoint , aDataEnd );
  }
}

template<typename T >

void BitonicSort	(	sort_direction	aDir,
		typename std::vector< T >::iterator &	aDataStart,
		typename std::vector< T >::iterator &	aDataEnd
	)

Definition at line 37 of file BitonicSort.h.

References down, and up.

{
  uint32_t lSize( aDataEnd - aDataStart );

  if( lSize > 1 ){
    typename std::vector<T>::iterator lMidpoint( aDataStart+(lSize>>1) );
    BitonicSort<T> ( up, aDataStart , lMidpoint );
    BitonicSort<T> ( down, lMidpoint , aDataEnd );
    BitonicMerge<T> (aDir, aDataStart , aDataEnd );
  }

}