TestRaddix.cxx File Reference

#include <gtest/gtest.h>
#include <raddix.hxx>

Include dependency graph for TestRaddix.cxx:

Go to the source code of this file.

Functions
	TEST (TestRaddix, RaddixSorts)

Function Documentation

TEST	(	TestRaddix	,
		RaddixSorts
	)

Definition at line 39 of file TestRaddix.cxx.

{
  // Normal Run - array should be sorted in order
  {
    Container randomdArrayPos(RandomArrayIntPos, RandomArrayIntPos + sizeof(RandomArrayIntPos) / sizeof(int));
    RaddixSort<IT>(randomdArrayPos.begin(), randomdArrayPos.end());

    // All elements are sorted
    for (IT it = randomdArrayPos.begin(); it < randomdArrayPos.end() - 1; ++it)
      EXPECT_LE(*it, *(it + 1));
  }

  // Already sortedArray - Array should not be affected
  {
    Container sortedArrayPos(SortedArrayIntPos, SortedArrayIntPos + sizeof(SortedArrayIntPos) / sizeof(int));
    RaddixSort<IT>(sortedArrayPos.begin(), sortedArrayPos.end());

    // All elements are still sorted
    for (IT it = sortedArrayPos.begin(); it < sortedArrayPos.end() - 1; ++it)
      EXPECT_LE(*it, *(it + 1));
  }

  // Inverse iterator order - Array should not be affected
  {
    Container randomArrayPos(RandomArrayIntPos, RandomArrayIntPos + sizeof(RandomArrayIntPos) / sizeof(int));
    RaddixSort<IT>(randomArrayPos.end(), randomArrayPos.begin());

    int i = 0;
    for (IT it = randomArrayPos.begin(); it < randomArrayPos.end(); ++it, ++i)
      EXPECT_EQ(RandomArrayIntPos[i], *it);
  }

  // No error empty array
  {
    Container emptyArray;
    RaddixSort<IT>(emptyArray.begin(), emptyArray.end());
  }

  // Unique value array - Array should not be affected
  {
    Container uniqueValueArray(1, 511);
    RaddixSort<IT>(uniqueValueArray.begin(), uniqueValueArray.end());
    EXPECT_EQ(511, uniqueValueArray[0]);
  }
}