From 03788f48be2634c36cd19ba25b0a851685b9c877 Mon Sep 17 00:00:00 2001
From: MZuenni <michi.zuendorf@gmail.com>
Date: Wed, 30 Nov 2022 12:43:27 +0100
Subject: use all macro

---
 geometry/convexHull.cpp | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

(limited to 'geometry/convexHull.cpp')

diff --git a/geometry/convexHull.cpp b/geometry/convexHull.cpp
index e988977..9245acc 100644
--- a/geometry/convexHull.cpp
+++ b/geometry/convexHull.cpp
@@ -1,18 +1,18 @@
-vector<pt> convexHull(vector<pt> p){
-	sort(p.begin(), p.end(), [](const pt& a, const pt& b){
+vector<pt> convexHull(vector<pt> pts){
+	sort(all(pts), [](const pt& a, const pt& b){
 		return real(a) == real(b) ? imag(a) < imag(b)
 															: real(a) < real(b);
 	});
-	p.erase(unique(p.begin(), p.end()), p.end());
+	pts.erase(unique(all(pts)), pts.end());
 	int k = 0;
-	vector<pt> h(2 * sz(p));
-	for (int i = 0; i < sz(p); i++) {// Untere Hülle.
-		while (k > 1 && cross(h[k-2], h[k-1], p[i]) <= 0) k--;
-		h[k++] = p[i];
+	vector<pt> h(2 * sz(pts));
+	for (int i = 0; i < sz(pts); i++) {// Untere Hülle.
+		while (k > 1 && cross(h[k-2], h[k-1], pts[i]) <= 0) k--;
+		h[k++] = pts[i];
 	}
-	for (int i = sz(p)-2, t = k; i >= 0; i--) {// Obere Hülle.
-		while (k > t && cross(h[k-2], h[k-1], p[i]) <= 0) k--;
-		h[k++] = p[i];
+	for (int i = sz(pts)-2, t = k; i >= 0; i--) {// Obere Hülle.
+		while (k > t && cross(h[k-2], h[k-1], pts[i]) <= 0) k--;
+		h[k++] = pts[i];
 	}
 	h.resize(k);
 	return h;
-- 
cgit v1.2.3