Test (#4)

* update

* moved content in subdir

* rename file

* add test setup

* add test setup

* add github action

* automaticly test all cpp files

* timeout after 10s

* setulimit and dont zero memory

* test build pdf

* install latexmk

* update

* update

* ngerman

* fonts

* removed old code

* add first test

* added tests

* test in sorted order

* more tests

* simplified test

* more tests

* fix suffix tree

* fixes and improvements

* done ust lst directly

* fix swap

* add links to pdf

* fix constants

* add primorial

* add comment

* various improvements

* more tests

* added missing stuf

* more tests

* fix tests

* more tests

* more tests

* more tests

* fix recursion?

* test trie

* more tests

* only use python temporarily for listings

* only use python temporarily for listings

* more tests

* fix longestCommonSubstring

* more tests

* more tests

* made code more similiar

* fix?

* more tests

* more tests

* more tests

* add ahoCorasick test + limit 4GB stack size

* more tests

* fix test

* add additional test

* more tests

* more tests

* fix?

* better fix

* fix virtual tree

* more tests

* more tests

* recursive closest pair

* more tests

* decrease limit

* new tests

* more tests

* fix name

* more tests

* add test

* new test

* more tests

* more tests

* more tests

* more tests

* new test and content

* new code

* new code

* larger tests

* fix and test

* new test

* new test

* update pdf

* remove comments

* new test

* more tests

* more testcases

* more tests

* increased limit

* more tests

* more tests

* more tests

* new tests

* more tests

* shortened code

* new test

* add basic tests for bigint

* more tests

* removed old files

* new test

* ignore some files

* more auto more ccw

* fix test

* more tests

* fix

* new tests

* more tests

* more tests

* stronger test

* actually verify delaunay...

* more tests

* fix header

* more tests

* run tests parallel?

* test parralel?

* add --missing

* separate workflows

* test

* is the pdf checked?

* separate workflows

* fix workflow

* more workflows

---------

Co-authored-by: Yidi <noob999noob999@gmail.com>

1 files changed, 116 insertions, 0 deletions

diff --git a/test/geometry/circle.cpp b/test/geometry/circle.cpp
new file mode 100644
index 0000000..3d3d27d
--- /dev/null
+++ b/test/geometry/circle.cpp
@@ -0,0 +1,116 @@
+#include "../util.h"
+constexpr double EPS = 1e-6;
+#define ll double
+double gcd(double x, double /**/) {return x;} //hacky
+#include <geometry/formulas.cpp>
+#undef ll
+#include <geometry/circle.cpp>
+
+// Entfernung von Punkt p zur Geraden durch a-b. 2d und 3d
+double distToLine(pt a, pt b, pt p) {
+	return abs(cross(p - a, b - a)) / abs(b - a);
+}
+
+pt randomIntegerPT(ll range) {
+	return pt(Random::integer<ll>(-range, range), Random::integer<ll>(-range, range));
+}
+
+ll sq(ll x) {
+	return x*x;
+}
+
+int expectedCount(ll x1, ll y1, ll r1, ll x2, ll y2, ll r2) {
+	if (x1 == x2 && y1 == y2){
+		return r1 == r2 ? -1 : 0;
+	} else {
+		ll d = sq(x1 - x2) + sq(y1 - y2);
+
+		if (d > sq(r1 + r2) || d < sq(r1 - r2)) {
+			return 0;
+		} else if (d == sq(r1 + r2) || d == sq(r1 - r2)) {
+			return 1;
+		} else{
+			return 2;
+		}
+	}
+}
+
+void test_circleIntersection(ll range) {
+	int queries = 0;
+	for (int tries = 0; tries < 1'000'000; tries++) {
+		auto c1 = randomIntegerPT(range);
+		auto c2 = c1;
+		while (c1 == c2) c2 = randomIntegerPT(range);
+		double r1 = Random::integer<ll>(1, range);
+		double r2 = Random::integer<ll>(1, range);
+
+		auto got = circleIntersection(c1, r1, c2, r2);
+
+		if (sz(got) != expectedCount(real(c1), imag(c1), r1, real(c2), imag(c2), r2)) cerr << "error: wrong count" << FAIL;
+
+		for (int i = 0; i < sz(got); i++) {
+			for (int j = 0; j < i; j++) {
+				if (abs(got[i] - got[j]) < 1e-6) cerr << "error: identical" << FAIL;
+			}
+		}
+
+		for (auto p : got) {
+			if (float_error(abs(c1 - p), r1) > 1e-6) cerr << "error: 1" << FAIL;
+			if (float_error(abs(c2 - p), r2) > 1e-6) cerr << "error: 2" << FAIL;
+		}
+		queries += sz(got);
+	}
+	cerr << "tested circleIntersection: " << queries << endl;
+}
+
+void test_circleRayIntersection(ll range) {
+	int queries = 0;
+	for (int tries = 0; tries < 1'000'000; tries++) {
+		auto c = randomIntegerPT(range);
+		double r = Random::integer<ll>(1, range);
+
+		pt orig = randomIntegerPT(range);
+		pt dir = 0;
+		while (abs(dir) < 0.5) dir = randomIntegerPT(range);
+
+		auto got = circleRayIntersection(c, r, orig, dir);
+
+		double dist = distToLine(orig, orig + dir, c);
+		int lineIntersections = 0;
+		if (dist <= r) lineIntersections = 2;
+		if (abs(dist - r) < 1e-9) lineIntersections = 1;
+
+		int expected = 0;
+		if (abs(orig - c) < r) expected = 1; //starts inside
+		if (abs(orig - c) > r) { //starts outside
+			if (dot(dir, c - orig) >= 0) expected = lineIntersections;
+			else expected = 0;
+		}
+		if (abs(abs(orig - c) - r) < 1e-9) { //starts on circle
+			if (dot(dir, c - orig) >= 0) expected = lineIntersections;
+			else expected = 1;
+		}
+
+		if (sz(got) != expected) cerr << "error: wrong count" << FAIL;
+
+		for (int i = 0; i < sz(got); i++) {
+			for (int j = 0; j < i; j++) {
+				if (abs(got[i] - got[j]) < 1e-6) cerr << "error: identical" << FAIL;
+			}
+		}
+
+		for (auto p : got) {
+			if (float_error(abs(c - p), r) > 1e-6) cerr << "error: 1" << FAIL;
+			if (distToLine(orig, orig + dir, p) > 1e-6) cerr << "error: 2" << FAIL;
+		}
+		queries += sz(got);
+	}
+	cerr << "tested circleIntersection: " << queries << endl;
+}
+
+int main() {
+	test_circleIntersection(10);
+	test_circleIntersection(100);
+	test_circleRayIntersection(10);
+	test_circleRayIntersection(100);
+}