Auto-format code changes (#672)

Auto-format code using Clang-Format

Co-authored-by: GitHub Actions <[email protected]>

include/micm/jit/solver/jit_linear_solver.hpp

@@ -42,10 +42,7 @@ namespace micm
 
     /// @brief Decompose the matrix into upper and lower triangular matrices and general JIT functions
     /// @param matrix Matrix that will be factored into lower and upper triangular matrices
-    void Factor(
-        SparseMatrixPolicy& matrix,
-        SparseMatrixPolicy& lower_matrix,
-        SparseMatrixPolicy& upper_matrix) const;
+    void Factor(SparseMatrixPolicy& matrix, SparseMatrixPolicy& lower_matrix, SparseMatrixPolicy& upper_matrix) const;
 
     /// @brief Solve for x in Ax = b
     template<class MatrixPolicy>

include/micm/jit/solver/jit_lu_decomposition.hpp

@@ -40,8 +40,7 @@ namespace micm
     /// @param lower The lower triangular matrix created by decomposition
     /// @param upper The upper triangular matrix created by decomposition
     template<class SparseMatrixPolicy>
-    void Decompose(const SparseMatrixPolicy &A, SparseMatrixPolicy &lower, SparseMatrixPolicy &upper)
-        const;
+    void Decompose(const SparseMatrixPolicy &A, SparseMatrixPolicy &lower, SparseMatrixPolicy &upper) const;
 
    private:
     /// @brief Generates a function to perform the LU decomposition for a specific matrix sparsity structure

include/micm/jit/solver/jit_lu_decomposition.inl

@@ -206,10 +206,8 @@ namespace micm
 
   template<std::size_t L>
   template<class SparseMatrixPolicy>
-  void JitLuDecomposition<L>::Decompose(
-      const SparseMatrixPolicy &A,
-      SparseMatrixPolicy &lower,
-      SparseMatrixPolicy &upper) const
+  void JitLuDecomposition<L>::Decompose(const SparseMatrixPolicy &A, SparseMatrixPolicy &lower, SparseMatrixPolicy &upper)
+      const
   {
     decompose_function_(A.AsVector().data(), lower.AsVector().data(), upper.AsVector().data());
     for (size_t block = 0; block < A.NumberOfBlocks(); ++block)

include/micm/solver/linear_solver.hpp

@@ -78,10 +78,7 @@ namespace micm
 
     /// @brief Decompose the matrix into upper and lower triangular matrices
     /// @param matrix Matrix to decompose into lower and upper triangular matrices
-    void Factor(
-        const SparseMatrixPolicy& matrix,
-        SparseMatrixPolicy& lower_matrix,
-        SparseMatrixPolicy& upper_matrix) const;
+    void Factor(const SparseMatrixPolicy& matrix, SparseMatrixPolicy& lower_matrix, SparseMatrixPolicy& upper_matrix) const;
 
     /// @brief Solve for x in Ax = b. x should be a copy of b and after Solve finishes x will contain the result
     template<class MatrixPolicy>

include/micm/solver/rosenbrock.hpp

@@ -108,12 +108,7 @@ namespace micm
     /// @param number_densities The number densities
     /// @param stats The solver stats
     /// @param state The state
-    void LinearFactor(
-        double& H,
-        const double gamma,
-        const auto& number_densities,
-        SolverStats& stats,
-        auto& state) const;
+    void LinearFactor(double& H, const double gamma, const auto& number_densities, SolverStats& stats, auto& state) const;
 
     /// @brief Computes the scaled norm of the vector errors
     /// @param y the original vector

src/process/process_set.cu

@@ -26,7 +26,7 @@ namespace micm
       const double* const d_yields = devstruct.yields_;
       const size_t number_of_grid_cells = rate_constants_param.number_of_grid_cells_;
       const size_t number_of_reactions =
-           rate_constants_param.number_of_elements_ / rate_constants_param.number_of_grid_cells_;
+          rate_constants_param.number_of_elements_ / rate_constants_param.number_of_grid_cells_;
       const double* const d_rate_constants = rate_constants_param.d_data_;
       const double* const d_state_variables = state_variables_param.d_data_;
       double* const d_forcing = forcing_param.d_data_;