Skip to content

Commit e36e9ee

Browse files
Apply JuliaFormatter with SciMLStyle to basic.jl
1 parent e995a85 commit e36e9ee

File tree

1 file changed

+8
-7
lines changed

1 file changed

+8
-7
lines changed

src/basic.jl

Lines changed: 8 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -899,13 +899,13 @@ end
899899
for i in N:-1:1
900900
if i == N
901901
# Last operator: mul!(L.cache[N-1], L.ops[N], v)
902-
push!(exprs, :(mul!(L.cache[$(N-1)], L.ops[$i], v)))
902+
push!(exprs, :(mul!(L.cache[$(N - 1)], L.ops[$i], v)))
903903
elseif i == 1
904904
# First operator: mul!(w, L.ops[1], L.cache[1])
905905
push!(exprs, :(mul!(w, L.ops[$i], L.cache[1])))
906906
else
907907
# Middle operators: mul!(L.cache[i-1], L.ops[i], L.cache[i])
908-
push!(exprs, :(mul!(L.cache[$(i-1)], L.ops[$i], L.cache[$i])))
908+
push!(exprs, :(mul!(L.cache[$(i - 1)], L.ops[$i], L.cache[$i])))
909909
end
910910
end
911911

@@ -947,13 +947,13 @@ end
947947
for i in 1:N
948948
if i == 1
949949
# First operator: ldiv!(L.cache[N-1], L.ops[1], v)
950-
push!(exprs, :(ldiv!(L.cache[$(N-1)], L.ops[$i], v)))
950+
push!(exprs, :(ldiv!(L.cache[$(N - 1)], L.ops[$i], v)))
951951
elseif i == N
952952
# Last operator: ldiv!(w, L.ops[N], L.cache[1])
953953
push!(exprs, :(ldiv!(w, L.ops[$i], L.cache[1])))
954954
else
955955
# Middle operators: ldiv!(L.cache[N-i], L.ops[i], L.cache[N-i+1])
956-
push!(exprs, :(ldiv!(L.cache[$(N-i)], L.ops[$i], L.cache[$(N-i+1)])))
956+
push!(exprs, :(ldiv!(L.cache[$(N - i)], L.ops[$i], L.cache[$(N - i + 1)])))
957957
end
958958
end
959959

@@ -984,7 +984,8 @@ function (L::ComposedOperator)(v::AbstractVecOrMat, u, p, t; kwargs...)
984984
end
985985

986986
# In-place: w is destination, v is action vector, u is update vector
987-
@generated function (L::ComposedOperator)(w::AbstractVecOrMat, v::AbstractVecOrMat, u, p, t; kwargs...)
987+
@generated function (L::ComposedOperator)(
988+
w::AbstractVecOrMat, v::AbstractVecOrMat, u, p, t; kwargs...)
988989
N = length(L.parameters[2].parameters) # Number of operators
989990

990991
# Generate the operator call expressions in reverse order
@@ -996,13 +997,13 @@ end
996997
for i in N:-1:1
997998
if i == N
998999
# Last operator: L.ops[N](L.cache[N-1], v, u, p, t; kwargs...)
999-
push!(exprs, :(L.ops[$i](L.cache[$(N-1)], v, u, p, t; kwargs...)))
1000+
push!(exprs, :(L.ops[$i](L.cache[$(N - 1)], v, u, p, t; kwargs...)))
10001001
elseif i == 1
10011002
# First operator: L.ops[1](w, L.cache[1], u, p, t; kwargs...)
10021003
push!(exprs, :(L.ops[$i](w, L.cache[1], u, p, t; kwargs...)))
10031004
else
10041005
# Middle operators: L.ops[i](L.cache[i-1], L.cache[i], u, p, t; kwargs...)
1005-
push!(exprs, :(L.ops[$i](L.cache[$(i-1)], L.cache[$i], u, p, t; kwargs...)))
1006+
push!(exprs, :(L.ops[$i](L.cache[$(i - 1)], L.cache[$i], u, p, t; kwargs...)))
10061007
end
10071008
end
10081009

0 commit comments

Comments
 (0)