🤖 Format .jl files

Author: geoffroyleconte

src/presolve/empty_rows.jl

@@ -1,5 +1,5 @@
 function row_cnt!(Arows, row_cnt::Vector{Int})
-  for k=1:length(Arows)
+  for k = 1:length(Arows)
     i = Arows[k]
     row_cnt[i] += 1
   end
@@ -16,10 +16,17 @@ Removes the empty rows of A, and the corresponding elements in lcon and ucon tha
 
 Returns the new number of constraints `new_ncon` and updates in-place `Arows`, `lcon`, `ucon`.
 """
-function empty_rows!(Arows, lcon::Vector{T}, ucon::Vector{T}, ncon, row_cnt::Vector{Int}, 
-                     empty_rows::Vector{Int}, Arows_s) where {T}
+function empty_rows!(
+  Arows,
+  lcon::Vector{T},
+  ucon::Vector{T},
+  ncon,
+  row_cnt::Vector{Int},
+  empty_rows::Vector{Int},
+  Arows_s,
+) where {T}
   new_ncon = 0
-  for i=1:ncon
+  for i = 1:ncon
     if row_cnt[i] == 0
       @assert lcon[i] ≤ zero(T) ≤ ucon[i]
     else
@@ -33,9 +40,9 @@ function empty_rows!(Arows, lcon::Vector{T}, ucon::Vector{T}, ncon, row_cnt::Vec
 
   c_rm = 1
   nrm = length(empty_rows)
-  for k=1:length(Arows)
+  for k = 1:length(Arows)
     while c_rm ≤ nrm && Arows_s[k] ≥ empty_rows[c_rm]
-      c_rm += 1 
+      c_rm += 1
     end
     Arows_s[k] -= c_rm - 1
   end

src/presolve/postsolve_utils.jl

@@ -30,7 +30,7 @@ function restore_ilow_iupp!(ilow, iupp, ifix)
   nfix = length(ifix)
 
   nlow = length(ilow)
-  for i in 1:nlow
+  for i = 1:nlow
     while c_fix ≤ nfix && ilow[i] ≤ ifix[c_fix]
       c_fix += 1
     end
@@ -39,10 +39,10 @@ function restore_ilow_iupp!(ilow, iupp, ifix)
 
   c_fix = 1
   nupp = length(iupp)
-  for i in 1:nupp
+  for i = 1:nupp
     while c_fix ≤ nfix && iupp[i] ≤ ifix[c_fix]
       c_fix += 1
     end
     iupp[i] += c_fix - 1
   end
-end
+end

src/presolve/presolve.jl

@@ -22,7 +22,7 @@ function update_kept_rows!(kept_rows::Vector{Bool}, vec_to_rm::Vector{Int})
   n_rm = length(vec_to_rm)
   offset = 0
   c_v = 1
-  for i=1:ncon
+  for i = 1:ncon
     if !kept_rows[i]
       offset += 1
     else
@@ -99,7 +99,19 @@ function presolve(
   if length(singl_rows) > 0
     singl_row_pass = true
     update_kept_rows!(kept_rows, singl_rows)
-    nconps = singleton_rows!(psdata.A.rows, psdata.A.cols, psdata.A.vals, lcon, ucon, lvar, uvar, nvar, nconps, row_cnt, singl_rows)
+    nconps = singleton_rows!(
+      psdata.A.rows,
+      psdata.A.cols,
+      psdata.A.vals,
+      lcon,
+      ucon,
+      lvar,
+      uvar,
+      nvar,
+      nconps,
+      row_cnt,
+      singl_rows,
+    )
   else
     singl_row_pass = false
     nconps = nconps
@@ -232,4 +244,4 @@ function postsolve(
   y_out = similar(qm.meta.y0)
   s_l_out, s_u_out = postsolve!(qm, psqm, x_in, x_out, y_in, y_out, s_l, s_u)
   return x_out, y_out, s_l_out, s_u_out
-end
+end

src/presolve/singleton_rows.jl

@@ -9,9 +9,19 @@ Removes the singleton rows of A, and the corresponding elements in lcon and ucon
 
 Returns the new number of constraints `new_ncon` and updates in-place `Arows`, `Acols`, `Avals`, `lcon`, `ucon`, `lvar`, `uvar`.
 """
-function singleton_rows!(Arows, Acols, Avals, lcon::Vector{T}, ucon::Vector{T}, lvar, uvar,
-                         nvar, ncon, row_cnt::Vector{Int}, 
-                         singl_rows::Vector{Int}) where {T}
+function singleton_rows!(
+  Arows,
+  Acols,
+  Avals,
+  lcon::Vector{T},
+  ucon::Vector{T},
+  lvar,
+  uvar,
+  nvar,
+  ncon,
+  row_cnt::Vector{Int},
+  singl_rows::Vector{Int},
+) where {T}
 
   # assume Acols is sorted
   Annz = length(Arows)
@@ -59,4 +69,4 @@ function singleton_rows!(Arows, Acols, Avals, lcon::Vector{T}, ucon::Vector{T},
   deleteat!(lcon, singl_rows)
   deleteat!(ucon, singl_rows)
   return ncon - nsingl
-end
+end

test/test_presolve.jl

@@ -226,5 +226,5 @@ end
   s_u = sparse([3.0; 0.0])
   x_out, y_out, s_l, s_u = postsolve(qp, psqp, x_in, y_in, s_l, s_u)
   @test y_out == [2.0; 0.0; 0.0; 0.0; 0.0; 4.0]
-  @test x_out == [4.0/3.0; 7.0; 4.0]
-end
+  @test x_out == [4.0 / 3.0; 7.0; 4.0]
+end