use c++20 ranges where shorter

Author: Cameron Custer

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

@@ -43,7 +43,7 @@ template<class DS, class... ARGS> struct pq_updates {
       remove_if(idx + all(upd_st), [&](auto& curr) {
         return curr.second->first >= lowest_pri;
       });
-    reverse_copy(all(extra), it);
+    ranges::reverse_copy(extra, it);
     rep(i, idx, sz(upd_st)) ds.undo();
     upd_st.pop_back();
     mp.erase(prev(end(mp)));

library/graphs/mst.hpp

@@ -11,9 +11,8 @@ pair<ll, vi> mst(const vector<array<int, 3>>& w_eds,
   int n) {
   vi order(sz(w_eds));
   iota(all(order), 0);
-  ranges::sort(order, [&](int i, int j) {
-    return w_eds[i][2] < w_eds[j][2];
-  });
+  ranges::sort(order, {},
+    [&](int i) { return w_eds[i][2]; });
   DSU dsu(n);
   vi ids;
   ll cost = 0;

library/strings/suffix_array/find/find_string_bs_fast.hpp

@@ -16,7 +16,7 @@ match find_str_fast(const T& t) {
     return lexicographical_compare(it_s, end(s), it_t,
       end(t));
   };
-  int sa_le = lower_bound(all(sa), 0, cmp) - begin(sa),
+  int sa_le = ranges::lower_bound(sa, 0, cmp) - begin(sa),
       sa_ri = sa_le;
   if (s_len == sz(t))
     sa_ri = lower_bound(sa_le + all(sa), 0,

library/strings/wildcard_pattern_matching.hpp

@@ -25,7 +25,7 @@ vector<bool> wildcard_pattern_matching(const vl& s,
   int n = sz(s), m = sz(t);
   auto s_pws = make_powers(s);
   auto t_pws = make_powers(t);
-  for (auto& t_pw : t_pws) reverse(all(t_pw));
+  for (auto& t_pw : t_pws) ranges::reverse(t_pw);
   vector<vl> res(3);
   rep(pw_hay, 0, 3)
     res[pw_hay] = conv(s_pws[pw_hay], t_pws[2 - pw_hay]);