Rename methods of Li-Chao tree

hitonanode · hitonanode · commit e75dba676022 · 2021-09-20T19:53:17.000+09:00
diff --git a/convex_hull_trick/li_chao_tree.hpp b/convex_hull_trick/li_chao_tree.hpp
@@ -6,7 +6,7 @@
 
 // Li-Chao tree
 // init() : set x's where we will execute get(x) queries
-// add_segment(l, r, a, b): update by ax + b in [l, r)
+// insert_segment(l, r, a, b): update by ax + b in [l, r)
 // get(x): get min
 template <class T, class T_MP> struct li_chao_tree {
     int _n, _head;
@@ -78,12 +78,12 @@ template <class T, class T_MP> struct li_chao_tree {
         }
     }
 
-    void add_line(T a, T b, int idx = -1) {
+    void insert_line(T a, T b, int idx = -1) {
         il = 0, ir = _n;
         if (il >= ir) return;
         _rec(1, 0, _head, _Line{a, b, idx, true});
     }
-    void add_segment(T xl, T xr, T a, T b, int idx = -1) {
+    void insert_segment(T xl, T xr, T a, T b, int idx = -1) {
         il = std::lower_bound(xs.begin(), xs.end(), xl) - xs.begin();
         ir = std::lower_bound(xs.begin(), xs.end(), xr) - xs.begin();
         if (il >= ir) return;
diff --git a/convex_hull_trick/li_chao_tree.md b/convex_hull_trick/li_chao_tree.md
@@ -13,7 +13,7 @@ vector<long long> xs;
 li_chao_tree<long long, __int128> tree;
 tree.init(xs); // xs が昇順である必要はない
 
-tree.add_segment(l, r, a, b, 0); // chmin by ax + b in [l, r)
+tree.insert_segment(l, r, a, b, 0); // chmin by ax + b in [l, r)
 
 ret = tree.get(x);
 cout << ret.minval << endl;
diff --git a/convex_hull_trick/test/li_chao_tree.test.cpp b/convex_hull_trick/test/li_chao_tree.test.cpp
@@ -36,7 +36,7 @@ int main() {
 
     for (auto q : qs) {
         tie(tp, l, r, a, b) = q;
-        if (tp == 0) tree.add_segment(l, r, a, b, 0);
+        if (tp == 0) tree.insert_segment(l, r, a, b, 0);
         if (tp == 1) {
             auto ret = tree.get(l);
             if (ret.is_valid) {
