🤖 Format .jl files (#91)

Co-authored-by: geoffroyleconte <[email protected]>

Author: github-actions[bot]

src/presolve/free_rows.jl

@@ -21,4 +21,4 @@ function free_rows!(
   return free_row_pass
 end
 
-postsolve!(pt::OutputPoint, operation::FreeRow) = nothing
+postsolve!(pt::OutputPoint, operation::FreeRow) = nothing

src/presolve/presolve.jl

@@ -250,7 +250,8 @@ function presolve(
     infeasible_bnd = check_bounds(lvar, uvar, lcon, ucon, nvar, ncon, kept_rows, kept_cols)
 
     infeasible = infeasible_bnd || infeasible_cst
-    reduction_pass = empty_row_pass || singl_row_pass || ifix_pass || free_lsc_pass || free_rows_pass
+    reduction_pass =
+      empty_row_pass || singl_row_pass || ifix_pass || free_lsc_pass || free_rows_pass
     keep_iterating = reduction_pass && !unbounded && !infeasible
     keep_iterating && (nb_pass += 1)
   end
@@ -314,8 +315,7 @@ function presolve(
       multipliers_U = s_u,
       iter = 0,
       elapsed_time = time() - start_time,
-      solver_specific = Dict(:presolvedQM => nothing,
-                             :psoperations => operations),
+      solver_specific = Dict(:presolvedQM => nothing, :psoperations => operations),
     )
   else
     psmeta = NLPModelMeta{T, S}(

src/presolve/primal_constraints.jl

@@ -12,8 +12,7 @@ function primal_constraints!(
   row_cnt,
   col_cnt,
 ) where {T, S}
-
-  for i=1:ncon
+  for i = 1:ncon
     (kept_rows[i] && !(lcon[i] == -T(Inf) && ucon[i] == T(Inf))) || continue
     rowi = arows[i]
     uconi2 = zero(T)
@@ -59,4 +58,4 @@ function primal_constraints!(
     end
   end
   return false
-end
+end

src/presolve/remove_ifix.jl

@@ -58,7 +58,7 @@ function remove_ifix!(
     # store acolj for postsolve
     acolj = Col(zeros(Int, c_acolj), zeros(T, c_acolj))
     c_acolj = 1
-    for k in 1:length(acols[j].nzind)
+    for k = 1:length(acols[j].nzind)
       i = acols[j].nzind[k]
       kept_rows[i] || continue
       aij = acols[j].nzval[k]

src/presolve/singleton_rows.jl

@@ -67,8 +67,8 @@ function postsolve!(pt::OutputPoint{T, S}, operation::SingletonRow{T, S}) where
   i, j = operation.i, operation.j
   Aij = operation.Aij
   pt.y[i] = zero(T)
-  if operation.tightened_lvar 
-    pt.y[i] += pt.s_l[j] / Aij 
+  if operation.tightened_lvar
+    pt.y[i] += pt.s_l[j] / Aij
     pt.s_l[j] = zero(T)
   end
   if operation.tightened_uvar