TestMaxSubSequence.cxx File Reference

#include <gtest/gtest.h>
#include <max_sub_sequence.hxx>
#include <functional>

Include dependency graph for TestMaxSubSequence.cxx:

Go to the source code of this file.

Functions
	TEST (TestSearch, MaxSubSequence)

Function Documentation

TEST	(	TestSearch	,
		MaxSubSequence
	)

Definition at line 42 of file TestMaxSubSequence.cxx.

{
  // Should return <5,9> (maximal sum of 17)
  {
  Container kMarketPrices(RandomArrayInt, RandomArrayInt + sizeof(RandomArrayInt) / sizeof(int));
    const auto kMaxBeneficeIndexes = MaxSubSequence<IT>(kMarketPrices.begin(), kMarketPrices.end());
    EXPECT_EQ(5, kMaxBeneficeIndexes.first);
    EXPECT_EQ(9, kMaxBeneficeIndexes.second);
  }

  // Should return <FirstPositiveIdx, idxEnd> on sorted array
  {
    Container kSortedArray(SortedArrayInt, SortedArrayInt + sizeof(SortedArrayInt) / sizeof(int));
    const auto kIndexes = MaxSubSequence<IT>(kSortedArray.begin(), kSortedArray.end());
    EXPECT_EQ(2, kIndexes.first);
    EXPECT_EQ(static_cast<int>(kSortedArray.size()) - 1, kIndexes.second);
  }

  // Should return <-1,-1> on insufficient array
  {
    Container insufficientArray = Container(1, 2);
    const auto kIndexes = MaxSubSequence<IT>(insufficientArray.begin(), insufficientArray.end());
    EXPECT_EQ(-1, kIndexes.first);
    EXPECT_EQ(-1, kIndexes.second);
  }

  // Should return <0,1> on array containing only two positive elements
  {
    Container twoElementArray = Container(2, 2);
    const auto kIndexes = MaxSubSequence<IT>(twoElementArray.begin(), twoElementArray.end());
    EXPECT_EQ(0, kIndexes.first);
    EXPECT_EQ(1, kIndexes.second);
  }

  // Should return <0, idxEnd> on array containing the same positive value
  {
    const int kSize = 10;
    Container sameElementArray = Container(kSize, 2);
    const auto indexes = MaxSubSequence<IT>(sameElementArray.begin(), sameElementArray.end());
    EXPECT_EQ(0, indexes.first);
    EXPECT_EQ(kSize - 1, indexes.second);
  }
}