TestMaxMElements.cxx File Reference

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

Include dependency graph for TestMaxMElements.cxx:

Go to the source code of this file.

Functions
	TEST (TestSearch, MaxMElements)
	TEST (TestSearch, MaxNElementsLowestValues)

Function Documentation

TEST	(	TestSearch	,
		MaxMElements
	)

Definition at line 38 of file TestMaxMElements.cxx.

{
  // Should return the max value [5] for a unique element search
  {
    Container kRandomElements(RandomArrayInt, RandomArrayInt + sizeof(RandomArrayInt) / sizeof(int));
    Container kMaxElements = MaxMElements<Container, IT>(kRandomElements.begin(), kRandomElements.end(), 1);
    EXPECT_EQ(5, kMaxElements[0]);
  }

  // Should return [5,5,4]
  {
    Container kRandomElements (RandomArrayInt, RandomArrayInt + sizeof(RandomArrayInt) / sizeof(int));
    Container kMaxElements =MaxMElements<Container, IT>(kRandomElements.begin(), kRandomElements.end(), 3);
    EXPECT_EQ(5, kMaxElements[0]);
    EXPECT_EQ(5, kMaxElements[1]);
    EXPECT_EQ(4, kMaxElements[2]);
  }

  // Should return the last elements on sorted vector
  {
    Container kSortedArray(SortedArrayInt, SortedArrayInt + sizeof(SortedArrayInt) / sizeof(int));
    Container kMaxElements = MaxMElements<Container, IT>(kSortedArray.begin(), kSortedArray.end(), 4);
    EXPECT_EQ(366, kMaxElements[0]);
    EXPECT_EQ(212, kMaxElements[1]);
    EXPECT_EQ(36, kMaxElements[2]);
    EXPECT_EQ(15, kMaxElements[3]);
  }

  // Should return empty vector on insufficient vector
  {
    Container uniqueEl = Container(1, 2);
    Container kMaxElements = MaxMElements<Container, IT>(uniqueEl.begin(), uniqueEl.end(), 2);
    EXPECT_EQ(0, static_cast<int>(kMaxElements.size()));
  }

  // Should return empty vector when looking for less than 1 elements
  {
    Container uniqueEl = Container(1, 2);
    Container kMaxElements = MaxMElements<Container, IT>(uniqueEl.begin(), uniqueEl.end(), 0);
    EXPECT_EQ(0, static_cast<int>(kMaxElements.size()));
  }
}

TEST	(	TestSearch	,
		MaxNElementsLowestValues
	)

Definition at line 82 of file TestMaxMElements.cxx.

{
  // Should return the min value [-18] for a unique element search
  {
    Container kRandomElements(RandomArrayInt, RandomArrayInt + sizeof(RandomArrayInt) / sizeof(int));
    Container kMaxElements =
      MaxMElements<Container, IT, std::less_equal<int>>
      (kRandomElements.begin(), kRandomElements.end(), 1);
    EXPECT_EQ(-18, kMaxElements[0]);
  }

  // Should return [5,5,4]
  {
    Container kRandomElements(RandomArrayInt, RandomArrayInt + sizeof(RandomArrayInt) / sizeof(int));
    Container kMaxElements = MaxMElements<Container, IT, std::less_equal<int>>
                                   (kRandomElements.begin(), kRandomElements.end(), 3);
    EXPECT_EQ(-18, kMaxElements[0]);
    EXPECT_EQ(-5, kMaxElements[1]);
    EXPECT_EQ(2, kMaxElements[2]);
  }

  // Should return the first elements on sorted vector
  {
    Container kSortedArray(SortedArrayInt, SortedArrayInt + sizeof(SortedArrayInt) / sizeof(int));
    Container kMaxElements = MaxMElements<Container, IT, std::less_equal<int>>
                                   (kSortedArray.begin(), kSortedArray.end(), 4);
    EXPECT_EQ(-3, kMaxElements[0]);
    EXPECT_EQ(-2, kMaxElements[1]);
    EXPECT_EQ(0, kMaxElements[2]);
    EXPECT_EQ(2, kMaxElements[3]);
  }
}