go back to old interface of undo

Author: lrvideckis

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

@@ -3,20 +3,20 @@
 //! @code
 //!   vector<pair<int, int>> updates;
 //!   pq_updates pq([&](int update_id) {},
-//!                 [&](int t) {});
+//!                 [&]() {});
 //!   updates.push_back({u, v});
 //!   pq.push(pri, ssize(updates) - 1);
 //! @endcode
 //! @time O(n log n)
 //! @space O(n)
 template<class F, class G> struct pq_updates {
   F update;
-  G rollback;
+  G undo;
   using upd = pair<multimap<int, int>::iterator, int>;
   vector<upd> st;
   multimap<int, int> mp;
-  pq_updates(F update, G rollback):
-    update(update), rollback(rollback) {}
+  pq_updates(F update, G undo):
+    update(update), undo(undo) {}
   void pop() {
     vector<upd> extra;
     int t = sz(st) - 1;
@@ -26,7 +26,7 @@ template<class F, class G> struct pq_updates {
       t = min(t, it->second);
       it->second = -1;
     }
-    rollback(t);
+    rep(i, t, sz(st)) undo();
     ranges::reverse_copy(extra,
       remove_if(t + all(st),
         [](upd& x) { return x.first->second == -1; }));

tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp

@@ -11,7 +11,7 @@ struct stack_with_get_max {
     st.emplace_back(val,
       empty(st) ? val : min(val, st.back().second));
   }
-  void rollback(int siz) { st.resize(siz); }
+  void undo() { st.pop_back(); }
   int get_max() const { return st.back().second; }
 };
 int main() {
@@ -23,7 +23,7 @@ int main() {
   vector<int> updates;
   stack_with_get_max stm;
   pq_updates pq([&](int id) { stm.join(updates[id]); },
-    [&](int t) { stm.rollback(t); });
+    [&]() { stm.undo(); });
   int pri = (n - l) / 2;
   rep(i, 0, l) {
     updates.push_back(arr[i]);

tests/library_checker_aizu_tests/handmade_tests/pq_updates.test.cpp

@@ -11,8 +11,8 @@ int main() {
       auto update = [&](int id) {
         ds_history.push_back(id);
       };
-      auto rollback = [&](int t) { ds_history.resize(t); };
-      pq_updates solver(update, rollback);
+      auto undo = [&]() { ds_history.pop_back(); };
+      pq_updates solver(update, undo);
       map<pair<int, int>, int> naive_mp;
       int upd_id_counter = 0;
       rep(op, 0, 200) {