[Jenkins] auto-formatting by clang-format version 10.0.0-4ubuntu1

stan-dev · Aug 16, 2023 · 4a71d4f · 4a71d4f
1 parent 24c8f0f
commit 4a71d4f
Show file tree

Hide file tree

Showing 7 changed files with 12 additions and 15 deletions.
diff --git a/stan/math/prim/fun/complex_schur_decompose.hpp b/stan/math/prim/fun/complex_schur_decompose.hpp
@@ -82,7 +82,7 @@ inline std::tuple<Eigen::Matrix<complex_return_t<scalar_type_t<M>>, -1, -1>,
                   Eigen::Matrix<complex_return_t<scalar_type_t<M>>, -1, -1>>
 complex_schur_decompose(const M& m) {
   if (m.size() == 0)
-    return std::make_tuple(m,m);
+    return std::make_tuple(m, m);
   check_square("complex_schur_decompose", "m", m);
   using MatType = Eigen::Matrix<scalar_type_t<M>, -1, -1>;
   // copy because ComplexSchur requires Eigen::Matrix type

diff --git a/stan/math/rev/fun/eigendecompose_sym.hpp b/stan/math/rev/fun/eigendecompose_sym.hpp
@@ -39,14 +39,15 @@ inline auto eigendecompose_sym(const T& m) {
 
   reverse_pass_callback([eigenvals, arena_m, eigenvecs]() mutable {
     // eigenvalue reverse calculation
-    arena_m.adj()
-        += eigenvecs.val_op() * eigenvals.adj().asDiagonal() * eigenvecs.val_op().transpose();
+    arena_m.adj() += eigenvecs.val_op() * eigenvals.adj().asDiagonal()
+                     * eigenvecs.val_op().transpose();
     // eigenvector reverse calculation
     const int p = arena_m.val().cols();
-    Eigen::MatrixXd f = (1
-                         / (eigenvals.val_op().rowwise().replicate(p).transpose()
-                            - eigenvals.val_op().rowwise().replicate(p))
-                               .array());
+    Eigen::MatrixXd f
+        = (1
+           / (eigenvals.val_op().rowwise().replicate(p).transpose()
+              - eigenvals.val_op().rowwise().replicate(p))
+                 .array());
     f.diagonal().setZero();
     arena_m.adj()
         += eigenvecs.val_op()

diff --git a/test/unit/math/mix/fun/complex_schur_decompose_test.cpp b/test/unit/math/mix/fun/complex_schur_decompose_test.cpp
@@ -51,9 +51,9 @@ TEST(mathMixFun, complexSchurDecompose) {
 
 template <typename V>
 void test_complex_schur_decompose(const Eigen::MatrixXd& x) {
+  using stan::math::complex_schur_decompose;
   using stan::math::complex_schur_decompose_t;
   using stan::math::complex_schur_decompose_u;
-  using stan::math::complex_schur_decompose;
   using stan::math::get_real;
   using stan::math::value_of_rec;
   Eigen::Matrix<V, -1, -1> X = x;
@@ -67,14 +67,13 @@ void test_complex_schur_decompose(const Eigen::MatrixXd& x) {
   std::tie(U, T) = complex_schur_decompose(X);
   auto X3 = U * T * U.adjoint();
   EXPECT_MATRIX_NEAR(x, value_of_rec(get_real(X3)), 1e-8);
-
 }
 
 template <typename V>
 void test_complex_schur_decompose_complex(const Eigen::MatrixXd& x) {
+  using stan::math::complex_schur_decompose;
   using stan::math::complex_schur_decompose_t;
   using stan::math::complex_schur_decompose_u;
-  using stan::math::complex_schur_decompose;
   using stan::math::value_of_rec;
   Eigen::Matrix<std::complex<V>, -1, -1> X(x.rows(), x.cols());
   for (int i = 0; i < x.size(); ++i)

diff --git a/test/unit/math/mix/fun/eigendecompose_identity_complex_test.cpp b/test/unit/math/mix/fun/eigendecompose_identity_complex_test.cpp
@@ -27,7 +27,7 @@ void expectComplexEigenvectorsId() {
 
   std::tie(eigenvectors, eigenvalues) = stan::math::eigendecompose(c22);
   auto I2 = (eigenvectors.inverse() * c22 * eigenvectors
-       * eigenvalues.asDiagonal().inverse());
+             * eigenvalues.asDiagonal().inverse());
 
   expect_identity_matrix_complex(I2);
 }

diff --git a/test/unit/math/mix/fun/eigendecompose_identity_test.cpp b/test/unit/math/mix/fun/eigendecompose_identity_test.cpp
@@ -19,7 +19,7 @@ void expectEigenvectorsId() {
     auto I = (vecs.inverse() * m * vecs * vals.asDiagonal().inverse()).real();
     expect_identity_matrix(I);
 
-    std::tie(vecs,vals) = eigendecompose(m);
+    std::tie(vecs, vals) = eigendecompose(m);
     auto I2 = (vecs.inverse() * m * vecs * vals.asDiagonal().inverse()).real();
     expect_identity_matrix(I2);
   }

diff --git a/test/unit/math/prim/fun/complex_schur_decompose_test.cpp b/test/unit/math/prim/fun/complex_schur_decompose_test.cpp
@@ -26,8 +26,6 @@ TEST(primFun, complex_schur_decompose_ut) {
   EXPECT_MATRIX_COMPLEX_NEAR(B, B_recovered, 1e-8);
 }
 
-
-
 TEST(primFun, complex_schur_decompose) {
   using c_t = std::complex<double>;
   using stan::math::complex_schur_decompose;

diff --git a/test/unit/math/prim/fun/qr_thin_test.cpp b/test/unit/math/prim/fun/qr_thin_test.cpp
@@ -34,5 +34,4 @@ TEST(MathMatrixPrimMat, qr_thin) {
       EXPECT_NEAR(m1(i, j), m3(j, i), 1e-12);
     }
   }
-
 }