TestBinary.cxx File Reference

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

Include dependency graph for TestBinary.cxx:

Go to the source code of this file.

Functions
	TEST (TestSearch, BinarySearchBasics)
	TEST (TestSearch, BinarySearchDoubles)

Function Documentation

TEST	(	TestSearch	,
		BinarySearchBasics
	)

Definition at line 55 of file TestBinary.cxx.

{
  Container sortedArray(SortedArrayInt, SortedArrayInt + sizeof(SortedArrayInt) / sizeof(int));

  // Empty array
  {
    Container emptyArray = Container();
    const auto index = BinarySearch<IT, EQUAL<int>>(emptyArray.begin(), emptyArray.end(), 0);
    EXPECT_EQ(-1, index); // Should return -1 on empty array
  }

  // First element
  {
    const auto index = BinarySearch<IT, EQUAL<int>>(sortedArray.begin(), sortedArray.end(), -3);
    EXPECT_EQ(0, index);
  }

  // Existing random value
  {
    const auto index = BinarySearch<IT, EQUAL<int>>(sortedArray.begin(), sortedArray.end(), 8);
    EXPECT_EQ(4, index);
  }

  // Non-existing element
  {
    const auto index = BinarySearch<IT, EQUAL<int>>(sortedArray.begin(), sortedArray.end(), 1);
    EXPECT_EQ(-1, index);
  }

  // String collection - Find letter
  {
    const auto index = BinarySearch<std::string::const_iterator, EQUAL<char>>
      (OrderedStr.begin(), OrderedStr.end(), 'm');
    EXPECT_EQ(4, index);
  }
}

TEST	(	TestSearch	,
		BinarySearchDoubles
	)

Definition at line 93 of file TestBinary.cxx.

{
   std::vector<double> sortedDoubleArray
     (SortedDoubleArray, SortedDoubleArray + sizeof(SortedDoubleArray) / sizeof(double));

  // First element
  {
    const auto index = BinarySearch<IT_DL, EQUIVALENT<double>>
      (sortedDoubleArray.begin(), sortedDoubleArray.end(), static_cast<const double>(-.3));
    EXPECT_EQ(0, index);
  }

  // Existing element
  {
    const auto index = BinarySearch<IT_DL, EQUIVALENT<double>>
      (sortedDoubleArray.begin(), sortedDoubleArray.end(), static_cast<const double>(0.12));
    EXPECT_EQ(2, index);
  }

  // Non Existing element
  {
    const auto index = BinarySearch<IT_DL, EQUIVALENT<double>>
      (sortedDoubleArray.begin(), sortedDoubleArray.end(), static_cast<const double>(8.1));
    EXPECT_EQ(-1, index);
  }

  // Value in the middle when identical values
  {
    std::vector<double> identicalArray = std::vector<double>(10, 3.);
    const auto index = BinarySearch<IT_DL, EQUIVALENT<double>>
      (identicalArray.begin(), identicalArray.end(), static_cast<const double>(3.));
    EXPECT_EQ(5, index);
  }
}