apply clang-format-19

hitonanode · hitonanode · commit 2287709aff17 · 2024-09-22T15:59:27.000+09:00
diff --git a/convolution/fft_double.hpp b/convolution/fft_double.hpp
@@ -3,16 +3,14 @@
 #include <utility>
 #include <vector>
 
-// CUT begin
 // Convolution by FFT (Fast Fourier Transform)
 // Algorithm based on http://kirika-comp.hatenablog.com/entry/2018/03/12/210446
 // Verified: ATC001C (168 ms) https://atcoder.jp/contests/atc001/submissions/9243440
 using cmplx = std::complex<double>;
 void fft(int N, std::vector<cmplx> &a, double dir) {
     int i = 0;
     for (int j = 1; j < N - 1; j++) {
-        for (int k = N >> 1; k > (i ^= k); k >>= 1)
-            ;
+        for (int k = N >> 1; k > (i ^= k); k >>= 1) {}
         if (j < i) std::swap(a[i], a[j]);
     }
 
diff --git a/convolution/hadamard.hpp b/convolution/hadamard.hpp
@@ -2,7 +2,6 @@
 #include <cassert>
 #include <vector>
 
-// CUT begin
 // Fast Walsh-Hadamard transform and its abstraction
 // Tutorials: <https://codeforces.com/blog/entry/71899>
 //            <https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it>
@@ -50,13 +49,11 @@ template <typename T> std::vector<T> xorconv(std::vector<T> x, std::vector<T> y)
 // bitwise AND conolution
 // ret[i] = \sum_{(j & k) == i} x[j] * y[k]
 template <typename T> std::vector<T> andconv(std::vector<T> x, std::vector<T> y) {
-    return bitwise_conv(
-        x, y, [](T &lo, T &hi) { lo += hi; }, [](T &lo, T &hi) { lo -= hi; });
+    return bitwise_conv(x, y, [](T &lo, T &hi) { lo += hi; }, [](T &lo, T &hi) { lo -= hi; });
 }
 
 // bitwise OR convolution
 // ret[i] = \sum_{(j | k) == i} x[j] * y[k]
 template <typename T> std::vector<T> orconv(std::vector<T> x, std::vector<T> y) {
-    return bitwise_conv(
-        x, y, [](T &lo, T &hi) { hi += lo; }, [](T &lo, T &hi) { hi -= lo; });
+    return bitwise_conv(x, y, [](T &lo, T &hi) { hi += lo; }, [](T &lo, T &hi) { hi -= lo; });
 }
diff --git a/flow/networksimplex.hpp b/flow/networksimplex.hpp
@@ -1270,7 +1270,7 @@ template <typename Capacity = long long, typename Weight = long long> struct mcf
         int E;
         std::vector<std::vector<int>> in_eids, out_eids;
         std::vector<std::pair<int, int>> arcs;
-        Digraph(int V = 0) : V(V), E(0), in_eids(V), out_eids(V){};
+        Digraph(int V = 0) : V(V), E(0), in_eids(V), out_eids(V) {};
         int add_edge(int s, int t) {
             assert(0 <= s and s < V);
             assert(0 <= t and t < V);
diff --git a/multithread/multithread_example.cpp b/multithread/multithread_example.cpp
@@ -3,7 +3,7 @@
 using namespace std;
 using pint = pair<int, int>;
 #define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
-#define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
+#define IFOR(i, begin, end) for (int i = (end) - 1, i##_begin_ = (begin); i >= i##_begin_; i--)
 #define REP(i, n) FOR(i, 0, n)
 #define IREP(i, n) IFOR(i, 0, n)
 #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
@@ -21,8 +21,7 @@ vector<string> ret;
 mutex mtx;
 vector<int> done;
 
-void solve(int tc) { /* tc個目のテストケースを処理する関数 */
-}
+void solve(int tc) { /* tc個目のテストケースを処理する関数 */ }
 
 void run() {
     /* 未完了で最も番号が若いテストケースを処理 */
diff --git a/string/palindromic_tree.hpp b/string/palindromic_tree.hpp
@@ -9,7 +9,7 @@ namespace palindromic_tree {
 
 template <class Key> class Node {
     int suffix_link_; // このノードからのsuffix link （suffix の最長回文）
-    int length_; // このノードが表す回文の長さ。 -1 となる場合もあるので注意
+    int length_;      // このノードが表す回文の長さ。 -1 となる場合もあるので注意
     std::map<Key, int> children;
 
 public:
