Support 4-args merge function in lazy_segment_tree_from_node and typical_segment_tree_from_node; release 0.5.1

Author: Mr-Python-in-China

library/example/Luogu_P3373.cpp

@@ -1,5 +1,5 @@
 // mp-oi-library extension note: start. Do not modify this part.
-// mp-oi-library extension header: library version: @MrPython-0.4.2
+// mp-oi-library extension header: library version: @MrPython-0.5.1
 // mp-oi-library extension note: file bits.hpp
 #ifndef MP_LIBRARY_BITS
 #define MP_LIBRARY_BITS
@@ -284,18 +284,24 @@ template <typename NodeStruct> class lazy_segment_tree_from_node {
   using T = typename NodeStruct::T;
   using Lazy = typename NodeStruct::Lazy;
   struct MergeFunction {
-    T operator()(T const& a, T const& b) const {
-      return NodeStruct::merge_data(a, b);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::merge_data(std::forward<Args>(args)...)) {
+      return NodeStruct::merge_data(std::forward<Args>(args)...);
     }
   };
   struct OperateFunction {
-    T operator()(Lazy const& lazy, T const& data, size_t size) const {
-      return NodeStruct::operate(lazy, data, size);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::operate(std::forward<Args>(args)...)) {
+      return NodeStruct::operate(std::forward<Args>(args)...);
     }
   };
   struct MergeLazyFunction {
-    Lazy operator()(Lazy const& a, Lazy const& b) const {
-      return NodeStruct::merge_lazy(a, b);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::merge_lazy(std::forward<Args>(args)...)) {
+      return NodeStruct::merge_lazy(std::forward<Args>(args)...);
     }
   };
   lazy_segment_tree_from_node() = delete;

library/mrpython/lazy_segment_tree.hpp

@@ -227,18 +227,24 @@ template <typename NodeStruct> class lazy_segment_tree_from_node {
   using T = typename NodeStruct::T;
   using Lazy = typename NodeStruct::Lazy;
   struct MergeFunction {
-    T operator()(T const& a, T const& b) const {
-      return NodeStruct::merge_data(a, b);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::merge_data(std::forward<Args>(args)...)) {
+      return NodeStruct::merge_data(std::forward<Args>(args)...);
     }
   };
   struct OperateFunction {
-    T operator()(Lazy const& lazy, T const& data, size_t size) const {
-      return NodeStruct::operate(lazy, data, size);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::operate(std::forward<Args>(args)...)) {
+      return NodeStruct::operate(std::forward<Args>(args)...);
     }
   };
   struct MergeLazyFunction {
-    Lazy operator()(Lazy const& a, Lazy const& b) const {
-      return NodeStruct::merge_lazy(a, b);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::merge_lazy(std::forward<Args>(args)...)) {
+      return NodeStruct::merge_lazy(std::forward<Args>(args)...);
     }
   };
   lazy_segment_tree_from_node() = delete;

library/mrpython/typical_segment_tree.hpp

@@ -35,7 +35,7 @@ template <typename T, typename MergeFunction> class typical_segment_tree {
       size_t d = 2 * n - 1 - i;
       size_t l = d * 2, r = d * 2 + 1;
       data.emplace_back(doMerge(data[2 * n - 1 - l], size[2 * n - 1 - l],
-                                 data[2 * n - 1 - r], size[2 * n - 1 - r]));
+                                data[2 * n - 1 - r], size[2 * n - 1 - r]));
       size.emplace_back(size[2 * n - 1 - l] + size[2 * n - 1 - r]);
     }
     std::reverse(data.begin(), data.end());
@@ -52,15 +52,15 @@ template <typename T, typename MergeFunction> class typical_segment_tree {
       set_impl(c, operate, pos * 2 + 1);
     else
       set_impl(c - m, operate, pos * 2 + 2);
-    data[pos] = doMerge(data[pos * 2 + 1], size[pos * 2 + 1],
-                         data[pos * 2 + 2], size[pos * 2 + 2]);
+    data[pos] = doMerge(data[pos * 2 + 1], size[pos * 2 + 1], data[pos * 2 + 2],
+                        size[pos * 2 + 2]);
   }
   std::pair<T, size_t> get_impl(size_t l, size_t r, size_t pos) {
     if (l == 0 && r == size[pos]) return {data[pos], size[pos]};
     size_t m = size[pos * 2 + 1];
     if (l < m && r > m)
       return doMerge(get_impl(l, m, pos * 2 + 1),
-                      get_impl(0, r - m, pos * 2 + 2));
+                     get_impl(0, r - m, pos * 2 + 2));
     else if (l < m)
       return get_impl(l, r, pos * 2 + 1);
     else if (r > m)
@@ -170,8 +170,10 @@ using typical_segment_tree_min = typical_segment_tree<T, min>;
 template <typename NodeStruct> class typical_segment_tree_from_node {
   using T = typename NodeStruct::T;
   struct MergeFunction {
-    T operator()(T const& a, T const& b) const {
-      return NodeStruct::merge_data(a, b);
+    template <typename... Args>
+    auto operator()(Args&&... args) const
+        -> decltype(NodeStruct::merge_data(std::forward<Args>(args)...)) {
+      return NodeStruct::merge_data(std::forward<Args>(args)...);
     }
   };
   typical_segment_tree_from_node() = delete;

package.json

@@ -2,7 +2,7 @@
   "name": "mp-oi-library",
   "displayName": "mp-oi-library",
   "description": "Some algorithms and data structures template for competitive programming.",
-  "version": "0.5.0",
+  "version": "0.5.1",
   "repository": "https://github.com/Mr-Python-in-China/mp-oi-library",
   "license": "LGPL-3.0-only",
   "author": {
@@ -69,5 +69,5 @@
     "bracketSpacing": true,
     "arrowParens": "avoid"
   },
-  "packageManager": "yarn@4.9.1"
+  "packageManager": "yarn@4.10.3"
 }