🤖 Format .jl files (#88)

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

Author: github-actions[bot]

src/presolve/empty_rows.jl

@@ -11,7 +11,7 @@ function empty_rows!(
   kept_rows::Vector{Bool},
 ) where {T, S}
   empty_row_pass = false
-  for i=1:ncon
+  for i = 1:ncon
     (kept_rows[i] && (row_cnt[i] == 0)) || continue
     empty_row_pass = true
     @assert (lcon[i] ≤ zero(T) ≤ ucon[i])
@@ -22,4 +22,4 @@ function empty_rows!(
   return empty_row_pass
 end
 
-postsolve!(pt::OutputPoint, operation::EmptyRow) = nothing
+postsolve!(pt::OutputPoint, operation::EmptyRow) = nothing

src/presolve/linear_singleton_columns.jl

@@ -27,7 +27,7 @@ function free_linear_singleton_columns!(
   free_lsc_pass = false
   c0_offset = zero(T)
 
-  for j=1:nvar
+  for j = 1:nvar
     (kept_cols[j] && (col_cnt[j] == 1)) || continue
     # check infinity bounds and no hessian contribution
     if lvar[j] == -T(Inf) && uvar[j] == T(Inf) && isempty(hcols[j].nzind)
@@ -56,7 +56,7 @@ function free_linear_singleton_columns!(
         # new row to store for postsolve:
         rowi2 = Row(zeros(Int, nb_elem_i), zeros(T, nb_elem_i))
         c_i = 1
-        for k in 1:length(rowi.nzind)
+        for k = 1:length(rowi.nzind)
           j2 = rowi.nzind[k]
           # add all col elements to rowi2 except the col j2 == j
           if kept_cols[j2] && j2 != j
@@ -93,4 +93,4 @@ function postsolve!(pt::OutputPoint{T, S}, operation::FreeLinearSingletonColumn{
   pt.s_l[j] = zero(T)
   pt.s_u[j] = zero(T)
   pt.y[operation.i] = operation.yi
-end
+end

src/presolve/postsolve_utils.jl

@@ -1,4 +1,4 @@
-function restore_x!(kept_cols, xin::S, xout::S, nvar) where S
+function restore_x!(kept_cols, xin::S, xout::S, nvar) where {S}
   # put x and xps inside xout according to kept_cols
   cx = 0
   for i = 1:nvar

src/presolve/presolve.jl

@@ -20,17 +20,17 @@ end
 function get_arows_acols(A::SparseMatrixCOO{T}, row_cnt, col_cnt, nvar, ncon) where {T}
   Arows, Acols, Avals = A.rows, A.cols, A.vals
   cnt_vec_rows = ones(Int, ncon)
-  arows = [Row{T}(zeros(Int, row_cnt[i]), fill(T(Inf), row_cnt[i])) for i in 1:ncon]
-  for k in 1:length(Arows)
+  arows = [Row{T}(zeros(Int, row_cnt[i]), fill(T(Inf), row_cnt[i])) for i = 1:ncon]
+  for k = 1:length(Arows)
     i, j, Ax = Arows[k], Acols[k], Avals[k]
     arows[i].nzind[cnt_vec_rows[i]] = j
     arows[i].nzval[cnt_vec_rows[i]] = Ax
     cnt_vec_rows[i] += 1
   end
 
   cnt_vec_cols = ones(Int, nvar)
-  acols = [Col{T}(zeros(Int, col_cnt[j]), fill(T(Inf), col_cnt[j])) for j in 1:nvar]
-  for k in 1:length(Arows)
+  acols = [Col{T}(zeros(Int, col_cnt[j]), fill(T(Inf), col_cnt[j])) for j = 1:nvar]
+  for k = 1:length(Arows)
     i, j, Ax = Arows[k], Acols[k], Avals[k]
     acols[j].nzind[cnt_vec_cols[j]] = i
     acols[j].nzval[cnt_vec_cols[j]] = Ax
@@ -42,15 +42,15 @@ end
 function get_hcols(H::SparseMatrixCOO{T}, nvar) where {T}
   Hrows, Hcols, Hvals = H.rows, H.cols, H.vals
   hcol_cnt = zeros(Int, nvar)
-  for k in 1:length(Hrows)
+  for k = 1:length(Hrows)
     i, j = Hrows[k], Hcols[k]
     hcol_cnt[i] += 1
     (i != j) && (hcol_cnt[j] += 1)
   end
-  hcols = [Col{T}(zeros(Int, hcol_cnt[i]), fill(T(Inf), hcol_cnt[i])) for i in 1:nvar]
+  hcols = [Col{T}(zeros(Int, hcol_cnt[i]), fill(T(Inf), hcol_cnt[i])) for i = 1:nvar]
 
   cnt_vec_cols = ones(Int, nvar)
-  for k in 1:length(Hrows)
+  for k = 1:length(Hrows)
     i, j, Hx = Hrows[k], Hcols[k], Hvals[k]
     hcols[j].nzind[cnt_vec_cols[j]] = i
     hcols[j].nzval[cnt_vec_cols[j]] = Hx
@@ -89,13 +89,13 @@ mutable struct PresolvedQuadraticModel{T, S, M1, M2} <: AbstractQuadraticModel{T
 end
 
 function check_bounds(lvar, uvar, lcon, ucon, nvar, ncon, kept_rows, kept_cols)
-  for i in 1:ncon
+  for i = 1:ncon
     if kept_rows[i] && lcon[i] > ucon[i]
       @warn "row $i primal infeasible"
       return true
     end
   end
-  for j in 1:nvar
+  for j = 1:nvar
     if kept_cols[j] && lvar[j] > uvar[j]
       @warn "col $j primal infeasible"
       return true
@@ -189,17 +189,8 @@ function presolve(
       kept_cols,
     )
 
-    unbounded = unconstrained_reductions!(
-      operations,
-      c,
-      hcols,
-      lvar,
-      uvar,
-      xps,
-      nvar,
-      col_cnt,
-      kept_cols,
-    )
+    unbounded =
+      unconstrained_reductions!(operations, c, hcols, lvar, uvar, xps, nvar, col_cnt, kept_cols)
 
     free_lsc_pass, psdata.c0 = free_linear_singleton_columns!(
       operations,
@@ -239,12 +230,22 @@ function presolve(
 
     infeasible = check_bounds(lvar, uvar, lcon, ucon, nvar, ncon, kept_rows, kept_cols)
 
-    keep_iterating = (empty_row_pass || singl_row_pass || ifix_pass || free_lsc_pass) && (!unbounded || !infeasible)
+    keep_iterating =
+      (empty_row_pass || singl_row_pass || ifix_pass || free_lsc_pass) &&
+      (!unbounded || !infeasible)
     keep_iterating && (nb_pass += 1)
   end
 
   if !isempty(operations)
-    remove_rowscols_A!(psdata.A.rows, psdata.A.cols, psdata.A.vals, kept_rows, kept_cols, nvar, ncon)
+    remove_rowscols_A!(
+      psdata.A.rows,
+      psdata.A.cols,
+      psdata.A.vals,
+      kept_rows,
+      kept_cols,
+      nvar,
+      ncon,
+    )
     remove_rowscols_H!(psdata.H.rows, psdata.H.cols, psdata.H.vals, kept_cols, nvar)
     nconps, nvarps = update_vectors!(lcon, ucon, c, lvar, uvar, kept_rows, kept_cols, ncon, nvar)
   end
@@ -335,7 +336,7 @@ function postsolve!(
   restore_x!(psqm.psd.kept_cols, x_in, pt_out.x, nvar)
   ncon = length(pt_out.y)
   restore_y!(psqm.psd.kept_rows, y_in, pt_out.y, ncon)
-  for i=n_operations:-1:1
+  for i = n_operations:-1:1
     operation_i = psqm.psd.operations[i]
     postsolve!(pt_out, operation_i)
   end

src/presolve/presolve_utils.jl

@@ -13,7 +13,7 @@ function remove_rowscols_A!(Arows, Acols, Avals, kept_rows, kept_cols, nvar, nco
   Arm = 0
   nb_rm_rows = 0
   # remove rows
-  for i0=1:ncon
+  for i0 = 1:ncon
     kept_rows[i0] && continue
     i = i0 - nb_rm_rows # up idx according to already removed rows
     nb_rm_rows += 1
@@ -37,7 +37,7 @@ function remove_rowscols_A!(Arows, Acols, Avals, kept_rows, kept_cols, nvar, nco
 
   # remove cols
   nb_rm_cols = 0
-  for j0=1:nvar
+  for j0 = 1:nvar
     kept_cols[j0] && continue
     j = j0 - nb_rm_cols # up idx according to already removed cols
     nb_rm_cols += 1
@@ -58,7 +58,7 @@ function remove_rowscols_A!(Arows, Acols, Avals, kept_rows, kept_cols, nvar, nco
     end
     Arm += Arm_tmp
   end
-  
+
   if Arm > 0
     Annz -= Arm
     resize!(Arows, Annz)
@@ -72,7 +72,7 @@ function remove_rowscols_H!(Hrows, Hcols, Hvals, kept_cols, nvar)
   Hrm = 0
   nb_rm = 0
   # remove rows and cols
-  for j0=1:nvar
+  for j0 = 1:nvar
     kept_cols[j0] && continue
     j = j0 - nb_rm # up idx according to already removed cols
     nb_rm += 1
@@ -95,7 +95,7 @@ function remove_rowscols_H!(Hrows, Hcols, Hvals, kept_cols, nvar)
     end
     Hrm += Hrm_tmp
   end
-  
+
   if Hrm > 0
     Hnnz -= Hrm
     resize!(Hrows, Hnnz)
@@ -129,4 +129,4 @@ function update_vectors!(lcon, ucon, c, lvar, uvar, kept_rows, kept_cols, ncon,
   resize!(uvar, nvarps)
   resize!(c, nvarps)
   return nconps, nvarps
-end
+end

src/presolve/remove_ifix.jl

@@ -23,15 +23,14 @@ function remove_ifix!(
   kept_cols,
   xps,
 ) where {T, S}
-
   ifix_pass = false
   c0_offset = zero(T)
 
   for j = 1:nvar
     (kept_cols[j] && (lvar[j] == uvar[j])) || continue
     ifix_pass = true
     xj = lvar[j]
-    for k in 1:length(hcols[j].nzind)
+    for k = 1:length(hcols[j].nzind)
       i = hcols[j].nzind[k]
       Hx = hcols[j].nzval[k]
       if i == j
@@ -42,7 +41,7 @@ function remove_ifix!(
     end
 
     # remove ifix in A cols
-    for k in 1:length(acols[j].nzind)
+    for k = 1:length(acols[j].nzind)
       i = acols[j].nzind[k]
       if kept_rows[i]
         row_cnt[i] -= 1
@@ -68,4 +67,4 @@ end
 
 function postsolve!(pt::OutputPoint{T, S}, operation::RemoveIfix{T, S}) where {T, S}
   pt.x[operation.j] = operation.xj
-end
+end

src/presolve/singleton_rows.jl

@@ -22,7 +22,7 @@ function singleton_rows!(
   # assume Acols is sorted
   singl_row_pass = false
 
-  for i=1:ncon
+  for i = 1:ncon
     (kept_rows[i] && (row_cnt[i] == 1)) || continue
     singl_row_pass = true
     tightened_lvar = false
@@ -78,4 +78,4 @@ function postsolve!(pt::OutputPoint{T, S}, operation::SingletonRow{T, S}) where
   if !operation.tightened_lvar && !operation.tightened_uvar
     pt.y[i] = zero(T)
   end
-end
+end

src/presolve/unconstrained_reductions.jl

@@ -15,8 +15,8 @@ function unconstrained_reductions!(
 ) where {T, S}
   unbounded = false
   # assume Hcols sorted
-  for j in 1:nvar
-    (kept_cols[j] && (col_cnt[j] == 0)) || continue 
+  for j = 1:nvar
+    (kept_cols[j] && (col_cnt[j] == 0)) || continue
     # check empty rows/col j in H
     if isempty(hcols[j].nzind)
       if c[j] < zero(T)
@@ -41,4 +41,4 @@ function unconstrained_reductions!(
   return unbounded
 end
 
-postsolve!(pt::OutputPoint, operation::UnconstrainedReduction) = nothing
+postsolve!(pt::OutputPoint, operation::UnconstrainedReduction) = nothing