Branch elimination in Bidiagonal indexing with BandIndex

JuliaLang · Sep 23, 2024 · e0732e7 · e0732e7
1 parent ec7dcb6
commit e0732e7
Showing 1 changed file with 3 additions and 2 deletions.
diff --git a/stdlib/LinearAlgebra/src/bidiag.jl b/stdlib/LinearAlgebra/src/bidiag.jl
@@ -166,10 +166,11 @@ end
 end
 
 @inline function getindex(A::Bidiagonal{T}, b::BandIndex) where T
- @boundscheck checkbounds(A, _cartinds(b))
+ @boundscheck checkbounds(A, b)
  if b.band == 0
  return @inbounds A.dv[b.index]
- elseif b.band == _offdiagind(A.uplo)
+ elseif b.band ∈ (-1,1) && b.band == _offdiagind(A.uplo)
+ # we explicitly compare the possible bands as b.band may be constant-propagated
  return @inbounds A.ev[b.index]
  else
  return bidiagzero(A, Tuple(_cartinds(b))...)