summaryrefslogtreecommitdiff
path: root/test/geometry
diff options
context:
space:
mode:
Diffstat (limited to 'test/geometry')
-rw-r--r--test/geometry/antipodalPoints.cpp2
-rw-r--r--test/geometry/closestPair.cpp2
-rw-r--r--test/geometry/closestPair.double.cpp2
-rw-r--r--test/geometry/convexHull.cpp2
-rw-r--r--test/geometry/delaunay.cpp18
-rw-r--r--test/geometry/polygon.cpp69
-rw-r--r--test/geometry/segmentIntersection.cpp2
-rw-r--r--test/geometry/sortAround.cpp2
8 files changed, 53 insertions, 46 deletions
diff --git a/test/geometry/antipodalPoints.cpp b/test/geometry/antipodalPoints.cpp
index d20dfb6..66f063b 100644
--- a/test/geometry/antipodalPoints.cpp
+++ b/test/geometry/antipodalPoints.cpp
@@ -66,5 +66,5 @@ void performance_test() {
int main() {
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
diff --git a/test/geometry/closestPair.cpp b/test/geometry/closestPair.cpp
index 5959b21..99f9d5e 100644
--- a/test/geometry/closestPair.cpp
+++ b/test/geometry/closestPair.cpp
@@ -65,5 +65,5 @@ void performance_test() {
int main() {
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
diff --git a/test/geometry/closestPair.double.cpp b/test/geometry/closestPair.double.cpp
index 2f8a1ab..427fcf8 100644
--- a/test/geometry/closestPair.double.cpp
+++ b/test/geometry/closestPair.double.cpp
@@ -62,5 +62,5 @@ void performance_test() {
int main() {
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
diff --git a/test/geometry/convexHull.cpp b/test/geometry/convexHull.cpp
index 788a634..8a5ad9b 100644
--- a/test/geometry/convexHull.cpp
+++ b/test/geometry/convexHull.cpp
@@ -75,5 +75,5 @@ void performance_test() {
int main() {
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
diff --git a/test/geometry/delaunay.cpp b/test/geometry/delaunay.cpp
index 5740b95..06ad6b5 100644
--- a/test/geometry/delaunay.cpp
+++ b/test/geometry/delaunay.cpp
@@ -69,9 +69,9 @@ bool inOutCirc(pt a, pt b, pt c, pt p) {
}
-void stress_test(ll range) {
+void stress_test(ll LIM, ll range) {
ll queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer<int>(3, 30);
auto ps = Random::points<lll>(n, -range, range);
bool skip = true;
@@ -137,8 +137,14 @@ void performance_test() {
}
int main() {
- stress_test(10);
- stress_test(10'000);
- stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) {
+ stress_test(100'000, 10);
+ stress_test(100'000, 10'000);
+ stress_test(100'000, 1'000'000'000);
+ performance_test();
+ } else {
+ stress_test(10'000, 10);
+ stress_test(10'000, 10'000);
+ stress_test(10'000, 1'000'000'000);
+ }
}
diff --git a/test/geometry/polygon.cpp b/test/geometry/polygon.cpp
index 643ea70..2653dbd 100644
--- a/test/geometry/polygon.cpp
+++ b/test/geometry/polygon.cpp
@@ -26,9 +26,9 @@ double distToSegment(pt a, pt b, pt p) {
#include <geometry/polygon.cpp>
#include "../geometry.h"
-void test_area(ll range) {
+void test_area(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 30);
auto ps = Random::polygon(n, range);
ps.push_back(ps[0]);
@@ -49,9 +49,9 @@ bool ptLess(pt a, pt b) {
return imag(a) < imag(b);
}
-void test_windingNumber(ll range) {
+void test_windingNumber(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 8);
auto ps = Random::polygon(n, range);
ps.push_back(ps[0]);
@@ -62,7 +62,7 @@ void test_windingNumber(ll range) {
ll expected = 0;
bool onBorder = false;
for (int j = 0; j < n; j++) {
- int cur = details::lineSegmentIntersection(p, p + pt(1, 2'000'000'007), ps[j], ps[j+1]);
+ int cur = details::lineSegmentIntersection(p, {real(p)+1, 1'000'000'007}, ps[j], ps[j+1]);
if (ptLess(ps[j], ps[j+1])) expected -= cur;
else expected += cur;
onBorder |= pointOnSegment(ps[j], ps[j+1], p);
@@ -79,9 +79,9 @@ void test_windingNumber(ll range) {
cerr << "tested windingNumber: " << queries << endl;
}
-void test_inside(ll range) {
+void test_inside(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 30);
auto ps = Random::polygon(n, range);
ps.push_back(ps[0]);
@@ -92,7 +92,7 @@ void test_inside(ll range) {
ll count = 0;
bool onBorder = false;
for (int j = 0; j < n; j++) {
- count += details::lineSegmentIntersection(p, p + pt(1, 2'000'000'007), ps[j], ps[j+1]);
+ count += details::lineSegmentIntersection(p, {real(p)+1, 1'000'000'007}, ps[j], ps[j+1]);
onBorder |= pointOnSegment(ps[j], ps[j+1], p);
}
bool expected = (count % 2) && !onBorder;
@@ -105,9 +105,9 @@ void test_inside(ll range) {
cerr << "tested inside: " << queries << endl;
}
-void test_insideConvex(ll range) {
+void test_insideConvex(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 30);
auto ps = Random::convex(n, range);
@@ -145,9 +145,9 @@ bool insideOrOnConvex(pt p, const vector<pt>& hull) {
return cross(hull[l], hull[r], p) >= 0;
}
-void test_minkowski(ll range) {
+void test_minkowski(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 30);
auto A = Random::convex(n, range);
int m = Random::integer(3, 30);
@@ -192,10 +192,10 @@ double naive_dist(const vector<pt>& ps, const vector<pt>& qs) {
return res;
}
-void test_dist(ll range) {
+void test_dist(ll LIM, ll range) {
int queries = 0;
int pos = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 10);
auto A = Random::convex(n, range / 3);
int m = Random::integer(3, 10);
@@ -215,9 +215,9 @@ void test_dist(ll range) {
cerr << "tested dist: " << queries << " (" << pos << ")" << endl;
}
-void test_extremal(ll range) {
+void test_extremal(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 30);
auto ps = Random::convex(n, range);
ps.push_back(ps[0]);
@@ -238,9 +238,9 @@ void test_extremal(ll range) {
cerr << "tested extremal: " << queries << endl;
}
-void test_intersect(ll range) {
+void test_intersect(ll LIM, ll range) {
int queries = 0;
- for (int tries = 0; tries < 100'000; tries++) {
+ for (int tries = 0; tries < LIM; tries++) {
int n = Random::integer(3, 10);
auto ps = Random::convex(n, range);
ps.push_back(ps[0]);
@@ -277,20 +277,21 @@ void test_intersect(ll range) {
}
int main() {
- test_area(100);
- test_area(1'000'000'000);
- test_windingNumber(100);
- test_windingNumber(1'000'000'000);
- test_inside(100);
- test_inside(1'000'000'000);
- test_insideConvex(100);
- test_insideConvex(1'000'000'000);
- test_minkowski(100);
- test_minkowski(500'000'000);
- test_dist(100);
- test_dist(1'000'000'000);
- test_extremal(100);
- test_extremal(1'000'000'000);
- test_intersect(100);
- test_intersect(1'000'000'000);
+ ll LIM = sanitize ? 4'000 : 100'000;
+ test_area(LIM, 100);
+ test_area(LIM, 1'000'000'000);
+ test_windingNumber(LIM, 100);
+ test_windingNumber(LIM, 1'000'000'000);
+ test_inside(LIM, 100);
+ test_inside(LIM, 1'000'000'000);
+ test_insideConvex(LIM, 100);
+ test_insideConvex(LIM, 1'000'000'000);
+ test_minkowski(LIM, 100);
+ test_minkowski(LIM, 500'000'000);
+ test_dist(LIM, 100);
+ test_dist(LIM, 1'000'000'000);
+ test_extremal(LIM, 100);
+ test_extremal(LIM, 1'000'000'000);
+ test_intersect(LIM, 100);
+ test_intersect(LIM, 1'000'000'000);
}
diff --git a/test/geometry/segmentIntersection.cpp b/test/geometry/segmentIntersection.cpp
index 6d3ddd6..0f67eb2 100644
--- a/test/geometry/segmentIntersection.cpp
+++ b/test/geometry/segmentIntersection.cpp
@@ -84,5 +84,5 @@ void performance_test() {
int main() {
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
diff --git a/test/geometry/sortAround.cpp b/test/geometry/sortAround.cpp
index a27edc8..abd803e 100644
--- a/test/geometry/sortAround.cpp
+++ b/test/geometry/sortAround.cpp
@@ -79,5 +79,5 @@ int main() {
test_tiny();
stress_test(100);
stress_test(1'000'000'000);
- performance_test();
+ if (!sanitize) performance_test();
}
generated by cgit v1.2.3 (git 2.39.1) at 2025-12-23 16:28:00 +0000