get rid of all() and sz()

8 files changed, 28 insertions, 28 deletions

diff --git a/test/datastructures/LCT.cpp b/test/datastructures/LCT.cpp
index 58d76d7..68a952c 100644
--- a/test/datastructures/LCT.cpp
+++ b/test/datastructures/LCT.cpp
@@ -73,13 +73,13 @@ struct Naive {
 			}
 		};
 		dfs_comp(dfs_comp, x);
-		return seen[Random::integer<int>(sz(seen))];
+		return seen[Random::integer<int>(ssize(seen))];
 	}
 
 	int randomAdj(int x) {
 		if (adj[x].empty()) return -1;
-		vector<int> seen(all(adj[x]));
-		return seen[Random::integer<int>(sz(seen))];
+		vector<int> seen(begin(adj[x]), end(adj[x]));
+		return seen[Random::integer<int>(ssize(seen))];
 	}
 };
 
@@ -179,7 +179,7 @@ void performance_test() {
 		int a = Random::integer<int>(0, N);
 		int b = Random::integer<int>(0, N);
 		ll w = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		if (!lct.connected(&lct.nodes[a], &lct.nodes[b])) {
 			lct.link(&lct.nodes[a], &lct.nodes[b]);
diff --git a/test/datastructures/dynamicConvexHull.lichao.cpp b/test/datastructures/dynamicConvexHull.lichao.cpp
index d50ca60..9a6ffb9 100644
--- a/test/datastructures/dynamicConvexHull.lichao.cpp
+++ b/test/datastructures/dynamicConvexHull.lichao.cpp
@@ -8,7 +8,7 @@ void stress_test(ll range) {
 	for (int tries = 0; tries < 1000; tries++) {
 		int n = Random::integer<int>(1, 100);
 		xs = Random::distinct(n, -range, range);
-		sort(all(xs));
+		ranges::sort(xs);
 
 		HullDynamic hd;
 		Lichao lichao;
diff --git a/test/datastructures/lichao.cpp b/test/datastructures/lichao.cpp
index f4b797b..1639b3d 100644
--- a/test/datastructures/lichao.cpp
+++ b/test/datastructures/lichao.cpp
@@ -7,7 +7,7 @@ void stress_test(ll range) {
 	for (int tries = 0; tries < 1000; tries++) {
 		int n = Random::integer<int>(1, 100);
 		xs = Random::distinct<ll>(n, -range, range);
-		sort(all(xs));
+		ranges::sort(xs);
 
 		vector<ll> naive(n, INF);
 		Lichao tree;
@@ -42,7 +42,7 @@ constexpr int N = 200'000;
 void performance_test() {
 	timer t;
 	xs = Random::distinct<ll>(N, -1'000'000'000, 1'000'000'000);
-	sort(all(xs));
+	ranges::sort(xs);
 
 	t.start();
 	Lichao tree;
diff --git a/test/datastructures/monotonicConvexHull.cpp b/test/datastructures/monotonicConvexHull.cpp
index 3ae7c4d..98d74f8 100644
--- a/test/datastructures/monotonicConvexHull.cpp
+++ b/test/datastructures/monotonicConvexHull.cpp
@@ -12,12 +12,12 @@ void stress_test(ll range) {
 	for (int tries = 0; tries < 1000; tries++) {
 		int n = Random::integer<int>(1, 100);
 		auto ms = Random::integers<ll>(n, -range, range);
-		sort(all(ms), greater<>{});
+		ranges::sort(ms | views::reverse);
 		auto cs = ms;
 		for (int l = 0, r = 0; l < n;) {
 			while (r < n && ms[l] == ms[r]) r++;
 			auto tmp = Random::distinct<ll>(r - l, -range, range);
-			sort(all(tmp), greater<>{});
+			ranges::sort(tmp | views::reverse);
 			for (int c : tmp) {
 				cs[l] = c;
 				l++;
@@ -25,7 +25,7 @@ void stress_test(ll range) {
 		}
 
 		auto xs = Random::integers<ll>(n*100, -range*n, range*n);
-		sort(all(xs));
+		ranges::sort(xs);
 		int i = 0;
 
 		vector<Line> naive;
@@ -58,12 +58,12 @@ void stress_test_independent(ll range) {
 	for (int tries = 0; tries < 1000; tries++) {
 		int n = Random::integer<int>(1, 100);
 		auto ms = Random::integers<ll>(n, -range, range);
-		sort(all(ms), greater<>{});
+		ranges::sort(ms | views::reverse);
 		auto cs = ms;
 		for (int l = 0, r = 0; l < n;) {
 			while (r < n && ms[l] == ms[r]) r++;
 			auto tmp = Random::distinct<ll>(r - l, -range, range);
-			sort(all(tmp), greater<>{});
+			ranges::sort(tmp | views::reverse);
 			for (int c : tmp) {
 				cs[l] = c;
 				l++;
@@ -81,7 +81,7 @@ void stress_test_independent(ll range) {
 			naive.emplace_back(m, c);
 
 			auto xs = Random::integers<ll>(100, -range, range);
-			sort(all(xs));
+			ranges::sort(xs);
 			auto tmp = mch;
 
 			for (auto x : xs) {
@@ -101,9 +101,9 @@ constexpr int N = 1'000'000;
 void performance_test() {
 	timer t;
 	auto ms = Random::distinct<ll>(N, -1'000'000'000, 1'000'000'000);
-	sort(all(ms), greater<>{});
+	ranges::sort(ms | views::reverse);
 	auto xs = Random::distinct<ll>(N, -1'000'000'000, 1'000'000'000);
-	sort(all(xs));
+	ranges::sort(xs);
 	Envelope mch;
 
 	hash_t hash = 0;
diff --git a/test/datastructures/persistentArray.cpp b/test/datastructures/persistentArray.cpp
index 6712089..ef8e52b 100644
--- a/test/datastructures/persistentArray.cpp
+++ b/test/datastructures/persistentArray.cpp
@@ -24,19 +24,19 @@ void stress_test() {
 				cur[j] = x;
 				expected.emplace_back(t, cur);
 			} else if (op <= 16) {
-				if (sz(expected) < 1) continue;
-				int j = Random::integer<int>(0, sz(expected));
+				if (ssize(expected) < 1) continue;
+				int j = Random::integer<int>(0, ssize(expected));
 				for (int k = 0; k < m; k++) {
 					if (got.get(k, expected[j].first) != expected[j].second[k]) cerr << "got: " << got.get(k, expected[j].first) << ", expected: " << expected[j].second[k] << FAIL;
 				}
 			} else {
-				if (sz(expected) < 1) continue;
-				int j = Random::integer<int>(0, sz(expected));
+				if (ssize(expected) < 1) continue;
+				int j = Random::integer<int>(0, ssize(expected));
 				got.reset(expected[j].first);
 				expected.resize(j + 1);
 				cur = expected.back().second;
 			}
-			
+
 		}
 		queries += n;
 	}
diff --git a/test/datastructures/segmentTree.cpp b/test/datastructures/segmentTree.cpp
index fbac13e..2473724 100644
--- a/test/datastructures/segmentTree.cpp
+++ b/test/datastructures/segmentTree.cpp
@@ -47,7 +47,7 @@ void performance_test1() {
 		int i = Random::integer<int>(0, N);
 		auto [l, r] = Random::pair<int>(0, N + 1);
 		ll x = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		tree.update(i, x);
 		hash ^= tree.query(l, r);
@@ -68,7 +68,7 @@ void stress_test2() {
 		vector<ll> naive(n);
 		SegTree tree(naive);
 		naive = Random::integers<ll>(n, -1000, 1000);
-		copy(all(naive), tree.tree.begin() + n);
+		ranges::copy(naive, tree.tree.begin() + n);
 		for (int operations = 0; operations < 1000; operations++) {
 			{
 				int l = Random::integer<int>(0, n + 1);
@@ -102,7 +102,7 @@ void performance_test2() {
 		int i = Random::integer<int>(0, N);
 		auto [l, r] = Random::pair<int>(0, N + 1);
 		ll x = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		tree.modify(l, r, x);
 		hash ^= tree.query(i);
diff --git a/test/datastructures/treap.cpp b/test/datastructures/treap.cpp
index 2fc9d63..d93e0f4 100644
--- a/test/datastructures/treap.cpp
+++ b/test/datastructures/treap.cpp
@@ -26,14 +26,14 @@ void stress_test(int T, int n) {
             if (a.empty()) is_ins = true;
 
             if (is_ins) {
-                int ind = Random::integer<int>(0, (int)sz(a)+1);
+                int ind = Random::integer<int>(0, (int)ssize(a)+1);
                 ll val = Random::integer((ll)-1e18, (ll)1e18+1);
                 t.insert(ind, val);
                 a.insert(a.begin() + ind, val);
                 ins--;
             } else {
-                int ind = Random::integer<int>(0, (int)sz(a));
-                int cnt = Random::integer<int>(1, 1 + min<int>({(int)sz(a)-ind, rem, (int)sqrt(n)}));
+                int ind = Random::integer<int>(0, (int)ssize(a));
+                int cnt = Random::integer<int>(1, 1 + min<int>({(int)ssize(a)-ind, rem, (int)sqrt(n)}));
                 t.remove(ind, cnt);
                 a.erase(a.begin() + ind, a.begin() + ind + cnt);
                 rem -= cnt;
diff --git a/test/datastructures/waveletTree.cpp b/test/datastructures/waveletTree.cpp
index d294835..e70d57b 100644
--- a/test/datastructures/waveletTree.cpp
+++ b/test/datastructures/waveletTree.cpp
@@ -20,7 +20,7 @@ void stress_test() {
 				ll expected = -1;
 				if (x >= 0 && l + x < r) {
 					vector<ll> tmp(naive.begin() + l, naive.begin() + r);
-					std::sort(all(tmp));
+					ranges::sort(tmp);
 					expected = tmp[x];
 				}
 				if (got != expected) {
@@ -59,7 +59,7 @@ void performance_test() {
 		auto [l2, r2] = Random::pair<int>(0, N + 1);
 		int x1 = Random::integer<ll>(l1, r1 + 1);
 		ll x2 = Random::integer<ll>(-1000, 1000);
-		
+
 		t.start();
 		hash ^= tree.kth(l1, r1, x1);
 		hash ^= tree.countSmaller(l2, r2, x2);