TestComb.cxx File Reference

#include <gtest/gtest.h>
#include <comb.hxx>
#include <functional>
#include <vector>
#include <string>

Include dependency graph for TestComb.cxx:

Go to the source code of this file.

Functions
	TEST (TestComb, CombSorts)
	TEST (TestComb, CombGreaterComparator)

Function Documentation

TEST	(	TestComb	,
		CombSorts
	)

Definition at line 44 of file TestComb.cxx.

{
  // Normal Run
  {
    Container randomdArray(ArrayRand);
    Comb<IT>(randomdArray.begin(), randomdArray.end());

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

  // Already Sorted Array - Array should not be affected
  {
    Container vector(ArraySort);
    Comb<IT>(vector.begin(), vector.end());

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

  // Inverse iterator order - Array should not be affected
  {
    Container randomdArray(ArrayRand);
    Comb<IT>(randomdArray.end(), randomdArray.begin());

    int i = 0;
    for (auto it = randomdArray.begin(); it < randomdArray.end(); ++it, ++i)
      EXPECT_EQ(ArrayRand[i], *it);
  }

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

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

  // String - String should be sorted as an array
  {
    std::string stringToSort = RandomStr;
    Comb<std::string::iterator, std::less<char>>(stringToSort.begin(), stringToSort.end());
    for (auto it = stringToSort.begin(); it < stringToSort.end() - 1; ++it)
      EXPECT_LE(*it, *(it + 1));
  }
}

TEST	(	TestComb	,
		CombGreaterComparator
	)

Definition at line 99 of file TestComb.cxx.

{
  // Normal Run - Elements should be sorted in inverse order
  {
    Container randomdArray(ArrayRand);
    Comb<IT, GE_Comparator>(randomdArray.begin(), randomdArray.end());

    // All elements are sorted in inverse order
    for (auto it = randomdArray.begin(); it < randomdArray.end() - 1; ++it)
      EXPECT_GE(*it, *(it + 1));
  }

  // Already sorted Array in inverse order - Array should not be affected
  {
    Container invArraySort(ArraySort);
    Comb<IT, GE_Comparator>(invArraySort.begin(), invArraySort.end());

    // All elements are still sorted in inverse order
    for (auto it = invArraySort.begin(); it < invArraySort.end() - 1; ++it)
      EXPECT_GE(*it, *(it + 1));
  }

  // String - String should be sorted in inverse order
  {
    std::string stringToSort = RandomStr;
    Comb<std::string::iterator, std::greater<char>>(stringToSort.begin(), stringToSort.end());

    // All elements are sorted in inverse order
    for (auto it = stringToSort.begin(); it < stringToSort.end() - 1; ++it)
      EXPECT_GE(*it, *(it + 1));
  }
}