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, 63 insertions, 0 deletions

diff --git a/content/geometry/segmentIntersection.cpp b/content/geometry/segmentIntersection.cpp
new file mode 100644
index 0000000..4262ddc
--- /dev/null
+++ b/content/geometry/segmentIntersection.cpp
@@ -0,0 +1,63 @@
+struct seg {
+	pt a, b;
+	int id;
+	bool operator<(const seg& o) const {
+		if (real(a) < real(o.a)) {
+			int s = ccw(a, b, o.a);
+			return (s > 0 || (s == 0 && imag(a) < imag(o.a)));
+		} else if (real(a) > real(o.a)) {
+			int s = ccw(o.a, o.b, a);
+			return (s < 0 || (s == 0 && imag(a) < imag(o.a)));
+		}
+		return imag(a) < imag(o.a);
+	}
+};
+
+struct event {
+	pt p;
+	int id, type;
+	bool operator<(const event& o) const {
+		if (real(p) != real(o.p)) return real(p) < real(o.p);
+		if (type != o.type) return type > o.type;
+		return imag(p) < imag(o.p);
+	}
+};
+
+bool lessPT(const pt& a, const pt& b) {
+	return real(a) != real(b) ? real(a) < real(b)
+	                          : imag(a) < imag(b);
+}
+
+bool intersect(const seg& a, const seg& b) {
+	return lineSegmentIntersection(a.a, a.b, b.a, b.b);
+}
+
+pair<int, int> intersect(vector<seg>& segs) {
+	vector<event> events;
+	for (seg& s : segs) {
+		if (lessPT(s.b, s.a)) swap(s.b, s.a);
+		events.push_back({s.a, s.id, 1});
+		events.push_back({s.b, s.id, -1});
+	}
+	sort(all(events));
+
+	set<seg> q;
+	vector<set<seg>::iterator> where(sz(segs));
+	for (auto e : events) {
+		int id = e.id;
+		if (e.type > 0) {
+			auto it = q.lower_bound(segs[id]);
+			if (it != q.end() && intersect(*it, segs[id]))
+				return {it->id, segs[id].id};
+			if (it != q.begin() && intersect(*prev(it), segs[id]))
+				return {prev(it)->id, segs[id].id};
+			where[id] = q.insert(it, segs[id]);
+		} else {
+			auto it = where[id];
+			if (it != q.begin() && next(it) != q.end() && intersect(*next(it), *prev(it)))
+				return {next(it)->id, prev(it)->id};
+			q.erase(it);
+		}
+	}
+	return {-1, -1};
+}