use c++20 ranges and views in remaining full-range spots

Author: Cameron Custer

library/data_structures_[l,r)/uncommon/deque_op.hpp

@@ -31,7 +31,7 @@ template<class T, class F> struct deq {
   void pop_back() {
     if (empty(r)) {
       vector<T> a(sz(l));
-      transform(all(l), rbegin(a),
+      ranges::transform(l, rbegin(a),
         [](dt& x) { return x[0]; });
       rebuild(a, sz(a) / 2);
     }
@@ -44,7 +44,7 @@ template<class T, class F> struct deq {
   void pop_front() {
     if (empty(l)) {
       vector<T> a(sz(r));
-      transform(all(r), begin(a),
+      ranges::transform(r, begin(a),
         [](dt& x) { return x[0]; });
       rebuild(a, (sz(a) + 1) / 2);
     }

library/math/matrix_related/solve_linear_mod.hpp

@@ -17,12 +17,12 @@ struct solve_linear_mod {
     int n = sz(mat), m = sz(mat[0]);
     rep(i, 0, n) mat[i].push_back(rhs[i]);
     tie(rank, det) = row_reduce(mat, m);
-    if (any_of(rank + all(mat),
+    if (ranges::any_of(mat | views::drop(rank),
           [](vi& v) { return v.back(); }))
       return;
     sol.resize(m);
     int j = 0;
-    for_each(begin(mat), begin(mat) + rank, [&](vi& v) {
+    ranges::for_each(mat | views::take(rank), [&](vi& v) {
       while (!v[j]) j++;
       sol[j] = v.back();
     });

library/trees/extra_members/virtual_tree.hpp

@@ -16,7 +16,7 @@ array<vi, 2> compress_tree(vi subset) {
   rep(i, 1, len)
     subset.push_back(lca(subset[i - 1], subset[i]));
   ranges::sort(subset, {}, proj);
-  subset.erase(unique(all(subset)), end(subset));
+  subset.erase(begin(ranges::unique(subset)), end(subset));
   return {
     mono_st(subset,
       [&](int u, int v) { return in_subtree(u, v); }),