🤖 Format .jl files (#100)

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

Author: github-actions[bot]

src/presolve/empty_rows.jl

@@ -8,7 +8,7 @@ function empty_rows!(
 ) where {T, S}
   qmp.empty_row_pass = false
   lcon, ucon, row_cnt, kept_rows = qmp.lcon, qmp.ucon, qmp.row_cnt, qmp.kept_rows
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     (kept_rows[i] && (row_cnt[i] == 0)) || continue
     qmp.empty_row_pass = true
     @assert (lcon[i] ≤ zero(T) ≤ ucon[i])

src/presolve/free_rows.jl

@@ -9,7 +9,7 @@ function free_rows!(
   lcon, ucon = qmp.lcon, qmp.ucon
   row_cnt, kept_rows = qmp.row_cnt, qmp.kept_rows
   qmp.free_row_pass = false
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     (kept_rows[i] && lcon[i] == -T(Inf) && ucon[i] == T(Inf)) || continue
     qmp.free_row_pass = true
     row_cnt[i] = -1

src/presolve/linear_singleton_columns.jl

@@ -17,7 +17,7 @@ function free_linear_singleton_columns!(
   row_cnt, col_cnt = qmp.row_cnt, qmp.col_cnt
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
 
-  for j = 1:qmp.nvar
+  for j = 1:(qmp.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)
@@ -76,7 +76,7 @@ function postsolve!(
   # x[j] = (coival - Σₖ Aik x[k]) / aij , where k ≂̸ j
   x[j] = operation.conival
   for (l, ail) in zip(arowi.nzind, arowi.nzval)
-    (l != j && kept_cols[l]) || continue 
+    (l != j && kept_cols[l]) || continue
     x[j] -= ail * x[l]
   end
   x[j] /= operation.aij

src/presolve/presolve.jl

@@ -145,14 +145,14 @@ end
 function check_bounds!(qmp::QuadraticModelPresolveData)
   lvar, uvar, lcon, ucon = qmp.lvar, qmp.uvar, qmp.lcon, qmp.ucon
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     if kept_rows[i] && lcon[i] > ucon[i]
       @warn "row $i primal infeasible"
       qmp.infeasible_bnd = true
       return nothing
     end
   end
-  for j = 1:qmp.nvar
+  for j = 1:(qmp.nvar)
     if kept_cols[j] && lvar[j] > uvar[j]
       @warn "col $j primal infeasible"
       qmp.infeasible_bnd = true
@@ -197,7 +197,7 @@ The presolve operations are inspired from [`MathOptPresolve.jl`](https://github.
 function presolve(
   qm::QuadraticModel{T, S, M1, M2};
   fixed_vars_only::Bool = false,
-  kwargs...
+  kwargs...,
 ) where {T <: Real, S, M1 <: SparseMatrixCOO, M2 <: SparseMatrixCOO}
   start_time = time()
   psqm = copy_qm(qm)

src/presolve/presolve_utils.jl

@@ -8,7 +8,7 @@ function switch_H_to_max!(data::QPData)
   data.H = -data.H
 end
 
-check_reductions(qmp::QuadraticModelPresolveData) = 
+check_reductions(qmp::QuadraticModelPresolveData) =
   qmp.empty_row_pass ||
   qmp.singl_row_pass ||
   qmp.ifix_pass ||
@@ -60,15 +60,15 @@ function remove_rowscols_A_H!(A, H, qmp::QuadraticModelPresolveData)
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
   ps_rows_idx = zeros(Int, qmp.ncon)
   ci = 0
-  for i in 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     if kept_rows[i]
       ci += 1
       ps_rows_idx[i] = ci
     end
   end
   ps_cols_idx = zeros(Int, qmp.nvar)
   cj = 0
-  for j in 1:qmp.nvar
+  for j = 1:(qmp.nvar)
     if kept_cols[j]
       cj += 1
       ps_cols_idx[j] = cj
@@ -79,7 +79,7 @@ function remove_rowscols_A_H!(A, H, qmp::QuadraticModelPresolveData)
   Annz = length(Arows)
   Arm = 0
   Awritepos = 0
-  for k in 1:Annz
+  for k = 1:Annz
     i, j = Arows[k], Acols[k]
     if (kept_rows[i] && kept_cols[j])
       Awritepos += 1
@@ -101,7 +101,7 @@ function remove_rowscols_A_H!(A, H, qmp::QuadraticModelPresolveData)
   Hnnz = length(Hrows)
   Hrm = 0
   Hwritepos = 0
-  for k in 1:Hnnz
+  for k = 1:Hnnz
     i, j = Hrows[k], Hcols[k]
     if (kept_cols[i] && kept_cols[j])
       Hwritepos += 1
@@ -125,15 +125,15 @@ function update_vectors!(qmp::QuadraticModelPresolveData)
   lcon, ucon, lvar, uvar = qmp.lcon, qmp.ucon, qmp.lvar, qmp.uvar
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
   nconps = 0
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     if kept_rows[i]
       nconps += 1
       lcon[nconps] = lcon[i]
       ucon[nconps] = ucon[i]
     end
   end
   nvarps = 0
-  for j = 1:qmp.nvar
+  for j = 1:(qmp.nvar)
     if kept_cols[j]
       nvarps += 1
       lvar[nvarps] = lvar[j]

src/presolve/primal_constraints.jl

@@ -5,7 +5,7 @@ function primal_constraints!(
   arows, lcon, ucon, lvar, uvar = qmp.arows, qmp.lcon, qmp.ucon, qmp.lvar, qmp.uvar
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
   row_cnt, col_cnt = qmp.row_cnt, qmp.col_cnt
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     (kept_rows[i] && !(lcon[i] == -T(Inf) && ucon[i] == T(Inf))) || continue
     rowi = arows[i]
     uconi2 = zero(T)

src/presolve/remove_ifix.jl

@@ -19,7 +19,7 @@ function remove_ifix!(
   xps = qmp.xps
   c0_offset = zero(T)
 
-  for j = 1:qmp.nvar
+  for j = 1:(qmp.nvar)
     (kept_cols[j] && (lvar[j] == uvar[j])) || continue
     qmp.ifix_pass = true
     xj = lvar[j]
@@ -81,7 +81,7 @@ function postsolve!(
     psd.kept_cols[i] || continue
     Hxj += hij * x[i]
   end
-  
+
   s = operation.cj + Hxj - ATyj
   if s > zero(T)
     sol.s_l[j] = s

src/presolve/singleton_rows.jl

@@ -16,7 +16,7 @@ function singleton_rows!(
   row_cnt, col_cnt = qmp.row_cnt, qmp.col_cnt
   kept_rows, kept_cols = qmp.kept_rows, qmp.kept_cols
 
-  for i = 1:qmp.ncon
+  for i = 1:(qmp.ncon)
     (kept_rows[i] && (row_cnt[i] == 1)) || continue
     qmp.singl_row_pass = true
     tightened_lvar = false
@@ -56,7 +56,11 @@ function singleton_rows!(
   end
 end
 
-function postsolve!(sol::QMSolution, operation::SingletonRow{T, S}, psd::PresolvedData{T, S}) where {T, S}
+function postsolve!(
+  sol::QMSolution,
+  operation::SingletonRow{T, S},
+  psd::PresolvedData{T, S},
+) where {T, S}
   i, j = operation.i, operation.j
   psd.kept_rows[i] = true
   aij = operation.aij

src/presolve/unconstrained_reductions.jl

@@ -12,7 +12,7 @@ function unconstrained_reductions!(
   col_cnt, kept_cols = qmp.col_cnt, qmp.kept_cols
 
   # assume Hcols sorted
-  for j = 1:qmp.nvar
+  for j = 1:(qmp.nvar)
     (kept_cols[j] && (col_cnt[j] == 0)) || continue
     # check empty rows/col j in H
     if isempty(hcols[j].nzind)
@@ -43,4 +43,4 @@ end
 
 function postsolve!(sol::QMSolution, operation::UnconstrainedReduction, psd::PresolvedData)
   psd.kept_cols[operation.j] = true
-end
+end