refactor: rename

config.yml

@@ -1149,10 +1149,10 @@ notebook:
     - conv_lcm: 卷积(LCM)
       code_ext: hpp
       test_ext: cpp
-    - conv_minplus_ca: 卷积(min-plus,一个凸序列)
+    - conv_minplus_cv: 卷积(min-plus,一个凸序列)
       code_ext: hpp
       test_ext: cpp
-    - conv_minplus_cc: 卷积(min-plus,两个凸序列)
+    - conv_minplus_cv_cv: 卷积(min-plus,两个凸序列)
       code_ext: hpp
       test_ext: cpp
     poly:

src/code/conv/conv_minplus_ca.hpp → src/code/conv/conv_minplus_cv.hpp

@@ -1,5 +1,5 @@
-#ifndef TIFALIBS_CONV_CONV_MINPLUS_CA
-#define TIFALIBS_CONV_CONV_MINPLUS_CA
+#ifndef TIFALIBS_CONV_CONV_MINPLUS_CV
+#define TIFALIBS_CONV_CONV_MINPLUS_CV
 
 #include "../opt/smawk.hpp"
 
@@ -8,7 +8,7 @@ namespace tifa_libs::math {
 //! assume a is convex, aka. $a_{i-1} - a_{i-2} \leq a_i - a_{i-1}$
 //! assume b is arbitary, aka. $b_i = b_j \iff i = j$
 template <class T>
-CEXP vec<T> conv_minplus_ca(vec<T> CR a, vec<T> CR b) NE {
+CEXP vec<T> conv_minplus_cv(vec<T> CR a, vec<T> CR b) NE {
   const u32 n = (u32)a.size(), m = (u32)b.size();
   const vecu argmin = opt::smawk(
       n + m - 1,

src/code/conv/conv_minplus_cc.hpp → src/code/conv/conv_minplus_cv_cv.hpp

@@ -1,13 +1,13 @@
-#ifndef TIFALIBS_CONV_CONV_MINPLUS_CC
-#define TIFALIBS_CONV_CONV_MINPLUS_CC
+#ifndef TIFALIBS_CONV_CONV_MINPLUS_CV_CV
+#define TIFALIBS_CONV_CONV_MINPLUS_CV_CV
 
 #include "../util/util.hpp"
 
 namespace tifa_libs::math {
 
 //! assume a and b are convex, aka. $a_{i-1} - a_{i-2} \leq a_i - a_{i-1}$ and it also holds for b
 template <class T>
-CEXP vec<T> conv_minplus_cc(vec<T> CR a, vec<T> CR b) NE {
+CEXP vec<T> conv_minplus_cv_cv(vec<T> CR a, vec<T> CR b) NE {
   const u32 n = (u32)a.size(), m = (u32)b.size();
   vec<T> c(n + m - 1);
   c[0] = a[0] + b[0];

src/doc_md/conv/conv_minplus_cv.md

@@ -0,0 +1,4 @@
+---
+title: conv_minplus_cv
+documentation_of: //src/code/conv/conv_minplus_cv.hpp
+---

src/doc_md/conv/conv_minplus_cv_cv.md

@@ -0,0 +1,4 @@
+---
+title: conv_minplus_cv_cv
+documentation_of: //src/code/conv/conv_minplus_cv_cv.hpp
+---

src/test_cpverifier/library-checker-convolution/min_plus_convolution_convex_arbitrary.test.cpp

@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/min_plus_convolution_convex_arbitrary"
 
-#include "../../code/conv/conv_minplus_ca.hpp"
+#include "../../code/conv/conv_minplus_cv.hpp"
 #include "../../code/io/ios_container.hpp"
 
 int main() {
@@ -9,6 +9,6 @@ int main() {
   std::cin >> n >> m;
   vecu a(n), b(m);
   std::cin >> a >> b;
-  std::cout << tifa_libs::math::conv_minplus_ca(a, b) << '\n';
+  std::cout << tifa_libs::math::conv_minplus_cv(a, b) << '\n';
   return 0;
 }

src/test_cpverifier/library-checker-convolution/min_plus_convolution_convex_convex.test.cpp

@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/min_plus_convolution_convex_convex"
 
-#include "../../code/conv/conv_minplus_cc.hpp"
+#include "../../code/conv/conv_minplus_cv_cv.hpp"
 #include "../../code/io/ios_container.hpp"
 
 int main() {
@@ -9,6 +9,6 @@ int main() {
   std::cin >> n >> m;
   vecu a(n), b(m);
   std::cin >> a >> b;
-  std::cout << tifa_libs::math::conv_minplus_cc(a, b) << '\n';
+  std::cout << tifa_libs::math::conv_minplus_cv_cv(a, b) << '\n';
   return 0;
 }