From bbec09408867e82fb9dd9b242e6d99014f9534b6 Mon Sep 17 00:00:00 2001
From: mzuenni <michi.zuendorf@gmail.com>
Date: Mon, 5 Aug 2024 20:10:57 +0200
Subject: more tests

---
 test/datastructures/dynamicConvexHull.cpp   | 72 +++++++++++++++++++++++++++++
 test/datastructures/monotonicConvexHull.cpp |  7 +--
 2 files changed, 73 insertions(+), 6 deletions(-)
 create mode 100644 test/datastructures/dynamicConvexHull.cpp

(limited to 'test/datastructures')

diff --git a/test/datastructures/dynamicConvexHull.cpp b/test/datastructures/dynamicConvexHull.cpp
new file mode 100644
index 0000000..e0e56ef
--- /dev/null
+++ b/test/datastructures/dynamicConvexHull.cpp
@@ -0,0 +1,72 @@
+#include "../util.h"
+namespace dch {
+	constexpr ll INF = LL::INF;
+	#include <datastructures/dynamicConvexHull.cpp>
+}
+
+struct Line {
+	ll m, c;
+	Line(ll m_, ll c_) : m(m_), c(c_) {}
+	ll operator()(ll x) {return m*x+c;}
+};
+
+void stress_test(ll range) {
+	ll queries = 0;
+	for (int tries = 0; tries < 1000; tries++) {
+		int n = Random::integer<int>(1, 100);
+
+		vector<Line> naive;
+
+		dch::HullDynamic hd;
+		for (int i = 0; i < n; i++) {
+			ll m = Random::integer<ll>(-range, range);
+			ll c = Random::integer<ll>(-range, range);
+			hd.add(m, c);
+			naive.emplace_back(m, c);
+
+			for (int j = 0; j < 100; j++) {
+				ll x = Random::integer<ll>(-range, range);
+
+				ll got = hd.query(x);
+				ll expected = naive[0](x);
+				for (auto l : naive) expected = max(expected, l(x));
+
+				if (got != expected) {
+					for (auto l : naive) cerr << l.m << "*x+" << l.c << endl;
+					cerr << x << ": " << got << " " << expected << endl;
+				}
+
+				if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
+				queries++;
+			}
+		}
+	}
+	cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 1'000'000;
+void performance_test() {
+	timer t;
+	dch::HullDynamic hd;
+
+	hash_t hash = 0;
+	for (int operations = 0; operations < N; operations++) {
+		ll m = Random::integer<ll>(-1'000'000'000, 1'000'000'000);
+		ll c = Random::integer<ll>(-1'000'000'000, 1'000'000'000);
+		ll x = Random::integer<ll>(-1'000'000'000, 1'000'000'000);
+		
+		t.start();
+		hd.add(m, c);
+		hash += hd.query(x);
+		t.stop();
+	}
+	if (t.time > 100) cerr << "too slow: " << t.time << FAIL;
+	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+	stress_test(100);
+	stress_test(1'000);
+	stress_test(1'000'000);
+	performance_test();
+}
diff --git a/test/datastructures/monotonicConvexHull.cpp b/test/datastructures/monotonicConvexHull.cpp
index 0d4e10d..4dafbd4 100644
--- a/test/datastructures/monotonicConvexHull.cpp
+++ b/test/datastructures/monotonicConvexHull.cpp
@@ -23,7 +23,7 @@ void stress_test(ll range) {
 
 		MCH mch;
 		for (ll m : ms) {
-			ll c = Random::integer<ll>(-1000, 1000);
+			ll c = Random::integer<ll>(-range, range);
 			mch.add(m, c);
 			naive.emplace_back(m, c);
 
@@ -34,11 +34,6 @@ void stress_test(ll range) {
 				ll expected = naive[0](x);
 				for (auto l : naive) expected = min(expected, l(x));
 
-				if (got != expected) {
-					for (auto l : naive) cerr << l.m << "*x+" << l.c << endl;
-					cerr << x << ": " << got << " " << expected << endl;
-				}
-
 				if (got != expected) cerr << "got: " << got << ", expected: " << expected << FAIL;
 				queries++;
 			}
-- 
cgit v1.2.3