fix pre-existing dev clang-format violations

Reformat 5 files that violated the dev clang-format config
(ColumnLimit 59) so the grep_clangformat_cppcheck CI job passes.
Line-wrapping only; no behavior change.

- library/dsu/kruskal_tree.hpp
- library/strings/longest_common_subsequence/lcs_dp.hpp
- library/strings/manacher/manacher.hpp
- tests/.../data_structures/bit_ordered_set.test.cpp
- tests/.../strings/sa_sort_pairs.test.cpp

Author: cameroncuster

library/dsu/kruskal_tree.hpp

@@ -1,6 +1,7 @@
 #pragma once
 //! https://mzhang2021.github.io/cp-blog/kruskal/
-//! requires n >= 1 (2*n-1 allocation underflows when n == 0)
+//! requires n >= 1 (2*n-1 allocation underflows when n ==
+//! 0)
 //! @time O(n log n)
 //! @space O(n)
 struct kr_tree {

library/strings/longest_common_subsequence/lcs_dp.hpp

@@ -10,7 +10,9 @@
 template<class T> struct lcs_dp {
   T t;
   vi dp;
-  lcs_dp(const T& t): t(t), dp(sz(t)) { ranges::iota(dp, 0); }
+  lcs_dp(const T& t): t(t), dp(sz(t)) {
+    ranges::iota(dp, 0);
+  }
   void push_onto_s(int c) {
     int v = -1;
     rep(i, 0, sz(t)) if (c == t[i] || dp[i] < v)

library/strings/manacher/manacher.hpp

@@ -14,7 +14,8 @@
 //! string b a a b a
 //! center  1 3 5 7
 //!
-//! requires n >= 1 (2*n-1 allocation underflows when n == 0)
+//! requires n >= 1 (2*n-1 allocation underflows when n ==
+//! 0)
 //! @time O(n)
 //! @space O(n)
 vi manacher(const auto& s) {

tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp

@@ -17,7 +17,8 @@ int main() {
     compress.push_back(x);
   }
   ranges::sort(compress);
-  compress.erase(begin(ranges::unique(compress)), end(compress));
+  compress.erase(begin(ranges::unique(compress)),
+    end(compress));
   BIT bit(sz(compress));
   auto get_compressed_idx = [&](int val) -> int {
     int l = 0, r = sz(compress);

tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp

@@ -10,7 +10,8 @@ int main() {
   for (int& x : arr) cin >> x;
   vi compress(arr);
   ranges::sort(compress);
-  compress.erase(begin(ranges::unique(compress)), end(compress));
+  compress.erase(begin(ranges::unique(compress)),
+    end(compress));
   for (int& x : arr) {
     int l = -1, r = int(sz(compress));
     while (r - l > 1) {