refactor: [search] Use tests.h

Author: manid2

cpp/search/binary-search-01.cpp

@@ -9,112 +9,57 @@
  * https://leetcode.com/problems/binary-search/
  */
 
-#include <bits/stdc++.h>
-
-using namespace std;
-
-/* ===========================================================================
- * Test helpers
- * ===========================================================================
- */
-class _00_test
-{
-public:
-	_00_test(const string &name) : name(name) {}
-
-	string getName(void) const { return name; }
-
-	virtual int search(vector<int> &nums, int target) = 0;
-
-private:
-	string name;
-};
+#include "tests.h"
 
 /* ===========================================================================
  * Algorithms implementation
  * ===========================================================================
  */
 
+#define _bs_desc "Binary search"
+
 /* TC : Best O(1), Average O(log n), Worst O(log n)
  * SC : O(1)
  */
-class _01_binary_search : public _00_test
+int search(const vi_t &a, int t)
 {
-public:
-	_01_binary_search() : _00_test("Binary search") {}
-
-	int search(vector<int> &a, int t) override
-	{
-		int l = 0, r = a.size() - 1;
-		while (l <= r) {
-			int m = (l + r) / 2;
-			if (t == a[m])
-				return m;
-			else if (t < a[m])
-				r = m - 1;
-			else
-				l = m + 1;
-		}
-		return -1;
+	int n = size(a), l = 0, r = n - 1;
+	while (l <= r) {
+		int m = (l + r) / 2;
+		if (t == a[m])
+			return m;
+		else if (t < a[m])
+			r = m - 1;
+		else
+			l = m + 1;
 	}
-};
+	return -1;
+}
 
 /* ===========================================================================
  * Test code
  * ===========================================================================
  */
-string _vec2str(vector<int> &vec)
-{
-	ostringstream oss;
-	oss << "{";
-	copy(vec.begin(), vec.end() - 1, ostream_iterator<int>(oss, ", "));
-	oss << vec.back();
-	oss << "}";
-	return oss.str();
-}
-
-void test_impl(vector<pair<vector<int>, int>> &ip, vector<int> &op,
-               shared_ptr<_00_test> f)
-{
-	for (size_t i = 0; i < ip.size(); i++) {
-		int t = f->search(ip[i].first, ip[i].second);
-		if (t != op[i]) {
-			cerr << f->getName() << " test failed: "
-			     << "expected " << op[i] << ", actual " << t
-			     << "." << endl;
-			exit(1);
-		}
-
-		if (getenv("SHOW_TEST_OUTPUT"))
-			cout << "  test-" << i << ":  "
-			     << "input: nums = " << _vec2str(ip[i].first)
-			     << ", target = " << ip[i].second
-			     << "  output: index = " << t << "\n";
+#define _bs_check(arr, target, e)                                            \
+	{                                                                    \
+		int a = search(arr, target);                                 \
+		string im = format("array = {}, target = {}",                \
+		                   to_string(arr), target);                  \
+		SET_CUSTOM_SUCCESS_MSG(im, to_string(a));                    \
+		CHECK_EQ(e, a);                                              \
+		SHOW_OUTPUT(im, a);                                          \
 	}
-}
 
-int main(int, char **)
+TEST(search, _bs_desc)
 {
-	vector<pair<vector<int>, int>> ip{
-	    {{-1, 0, 3, 5, 9, 12}, 9},
-	    {{-1, 0, 3, 5, 9, 12}, 2},
+	vi2_t arrs{
+	    {-1, 0, 3, 5, 9, 12},
+	    {-1, 0, 3, 5, 9, 12},
 	};
-
-	vector<int> op{4, -1};
-
-	vector<shared_ptr<_00_test>> impls{
-	    make_shared<_01_binary_search>(),
-	};
-
-	for (size_t i = 0; i < impls.size(); i++) {
-		if (getenv("SHOW_TEST_OUTPUT"))
-			cout << "Testing implementation " << i + 1 << " "
-			     << impls[i]->getName() << "\n";
-
-		test_impl(ip, op, impls[i]);
-	}
-
-	cout << "Executed " << impls.size() << " implementations"
-	     << " with " << ip.size() << " tests." << endl;
-	return 0;
+	vi_t targets{9, 2};
+	vi_t exps{4, -1};
+	int n = size(arrs);
+	fii (i, n) _bs_check(arrs[i], targets[i], exps[i]);
 }
+
+INIT_TEST_MAIN();

cpp/search/binary-search-02.cpp

@@ -9,121 +9,65 @@
  * https://leetcode.com/problems/search-in-rotated-sorted-array
  */
 
-#include <bits/stdc++.h>
-
-using namespace std;
-
-/* ===========================================================================
- * Test helpers
- * ===========================================================================
- */
-class _00_test
-{
-public:
-	_00_test(const string &name) : name(name) {}
-
-	string getName(void) const { return name; }
-
-	virtual int search(vector<int> &nums, int target) = 0;
-
-private:
-	string name;
-};
+#include "tests.h"
 
 /* ===========================================================================
  * Algorithms implementation
  * ===========================================================================
  */
 
+#define _bs_desc "Binary search in sorted rotated array"
+
 /* TC : Best O(1), Average O(log n), Worst O(log n)
  * SC : O(1)
  */
-class _01_binary_search : public _00_test
+int search(const vi_t &a, int t)
 {
-public:
-	_01_binary_search()
-	    : _00_test("Binary search in sorted rotated array")
-	{
-	}
-
-	int search(vector<int> &a, int t) override
-	{
-		int l = 0, r = a.size() - 1;
-		while (l <= r) {
-			int m = (l + r) / 2;
-			if (t == a[m])
-				return m;
-			else if (a[l] <= a[m]) {
-				if (a[l] <= t && t < a[m])
-					r = m - 1;
-				else
-					l = m + 1;
-			} else {
-				if (a[m] < t && t <= a[r])
-					l = m + 1;
-				else
-					r = m - 1;
-			}
+	int n = size(a), l = 0, r = n - 1;
+	while (l <= r) {
+		int m = (l + r) / 2;
+		if (t == a[m])
+			return m;
+		else if (a[l] <= a[m]) {
+			if (a[l] <= t && t < a[m])
+				r = m - 1;
+			else
+				l = m + 1;
+		} else {
+			if (a[m] < t && t <= a[r])
+				l = m + 1;
+			else
+				r = m - 1;
 		}
-		return -1;
 	}
-};
+	return -1;
+}
 
 /* ===========================================================================
  * Test code
  * ===========================================================================
  */
-string _vec2str(vector<int> &vec)
-{
-	ostringstream oss;
-	copy(vec.begin(), vec.end() - 1, ostream_iterator<int>(oss, ", "));
-	oss << vec.back();
-	return oss.str();
-}
-
-void test_impl(vector<pair<vector<int>, int>> &ip, vector<int> &op,
-               shared_ptr<_00_test> f)
-{
-	for (size_t i = 0; i < ip.size(); i++) {
-		int t = f->search(ip[i].first, ip[i].second);
-		if (t != op[i]) {
-			cerr << f->getName() << " test failed: "
-			     << "expected " << op[i] << ", actual " << t
-			     << "." << endl;
-			exit(1);
-		}
-
-		if (getenv("SHOW_TEST_OUTPUT"))
-			cout << "  test-" << i << ":  "
-			     << "input: nums = " << _vec2str(ip[i].first)
-			     << ", target = " << ip[i].second
-			     << "  output: index = " << t << "\n";
+#define _bs_check(arr, target, e)                                            \
+	{                                                                    \
+		int a = search(arr, target);                                 \
+		string im = format("array = {}, target = {}",                \
+		                   to_string(arr), target);                  \
+		SET_CUSTOM_SUCCESS_MSG(im, to_string(a));                    \
+		CHECK_EQ(e, a);                                              \
+		SHOW_OUTPUT(im, a);                                          \
 	}
-}
 
-int main(int, char **)
+TEST(search, _bs_desc)
 {
-	vector<pair<vector<int>, int>> ip{
-	    {{4, 5, 6, 7, 0, 1, 2}, 0},
-	    {{4, 5, 6, 7, 0, 1, 2}, 3},
-	    {{1}, 0},
-	};
-
-	vector<int> op{4, -1, -1};
-
-	vector<shared_ptr<_00_test>> impls{
-	    make_shared<_01_binary_search>(),
+	vi2_t arrs{
+	    {4, 5, 6, 7, 0, 1, 2},
+	    {4, 5, 6, 7, 0, 1, 2},
+	    {1},
 	};
-
-	for (size_t i = 0; i < impls.size(); i++) {
-		if (getenv("SHOW_TEST_OUTPUT"))
-			cout << "Testing implementation " << i + 1 << " "
-			     << impls[i]->getName() << "\n";
-
-		test_impl(ip, op, impls[i]);
-	}
-
-	cout << "Executed " << impls.size() << " implementations"
-	     << " with " << ip.size() << " tests." << endl;
-	return 0;
+	vi_t targets{0, 3, 0};
+	vi_t exps{4, -1, -1};
+	int n = size(arrs);
+	fii (i, n) _bs_check(arrs[i], targets[i], exps[i]);
 }
+
+INIT_TEST_MAIN();