🤖 Format .jl files (#86)

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

Author: github-actions[bot]

src/presolve/postsolve_utils.jl

@@ -2,7 +2,7 @@ function restore_ifix!(kept_cols, xps, x, xout)
   # put x and xps inside xout according to kept_cols
   nvar = length(xout)
   cx = 0
-  for i=1:nvar
+  for i = 1:nvar
     if kept_cols[i]
       cx += 1
       xout[i] = x[cx]
@@ -33,7 +33,7 @@ function restore_ilow_iupp!(ilow, iupp, kept_cols)
   for i = 1:nvar
     if kept_cols[i] == false
       offset += 1
-    end 
+    end
     if c_low ≤ nlow && ilow[c_low] + offset == i
       ilow[c_low] += 1
       c_low += 1

src/presolve/presolve_utils.jl

@@ -25,4 +25,4 @@ function update_kept_v!(kept_v::Vector{Bool}, vec_to_rm::Vector{Int}, n::Int)
       end
     end
   end
-end
+end

src/presolve/unconstrained_reductions.jl

@@ -22,14 +22,14 @@ function unconstrained_reductions!(
     # check diagonal H or 
     idx_deb = findfirst(isequal(var), Hcols)
     if idx_deb === nothing
-      if c[var] < zero(T) 
+      if c[var] < zero(T)
         xps[var] = uvar[var]
         lvar[var] = uvar[var]
       else
         xps[var] = lvar[var]
         uvar[var] = lvar[var]
       end
-        xps[var] == -T(Inf) && (unbounded = true)
+      xps[var] == -T(Inf) && (unbounded = true)
     else
       continue
       # todo : QP 
@@ -41,4 +41,4 @@ function unconstrained_reductions!(
   end
 
   return unbounded
-end
+end

test/test_presolve.jl

@@ -34,9 +34,7 @@
     6.0 1.0
     1.0 4.0
   ]
-  Aps_true = [
-    1.0 1.0
-  ]
+  Aps_true = [1.0 1.0]
   lvarps_true, uvarps_true = [0.0; 0.0], [Inf; Inf]
 
   @test psqp.data.c == [-4.0; 1.0]