add inbounds

OptimalBranching · Jan 10, 2025 · 97ebb32 · 97ebb32
1 parent 52ce869
commit 97ebb32
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/lib/OptimalBranchingCore/src/greedymerge.jl b/lib/OptimalBranchingCore/src/greedymerge.jl
@@ -21,7 +21,7 @@ end
 function greedymerge(cls::Vector{Vector{Clause{INT}}}, problem::AbstractProblem, variables::Vector, m::AbstractMeasure) where {INT}
     function reduction_merge(cli, clj)
         clmax, iimax, jjmax, reductionmax = Clause(zero(INT), zero(INT)), -1, -1, 0.0
-        for ii = 1:length(cli), jj = 1:length(clj)
+        @inbounds for ii = 1:length(cli), jj = 1:length(clj)
             cl12 = gather2(length(variables), cli[ii], clj[jj])
             iszero(cl12.mask) && continue
             reduction = Float64(size_reduction(problem, m, cl12, variables))
@@ -33,7 +33,7 @@ function greedymerge(cls::Vector{Vector{Clause{INT}}}, problem::AbstractProblem,
     end
     cls = copy(cls)
     size_reductions = [Float64(size_reduction(problem, m, first(candidate), variables)) for candidate in cls]
-    while true
+    @inbounds while true
         nc = length(cls)
         mask = trues(nc)
         γ = complexity_bv(size_reductions)