Skip to content

Attempt to fix #262 #273

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
lkdvos merged 1 commit into from
Aug 21, 2025
Merged

Attempt to fix #262 #273

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/planar/preprocessors.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -211,7 +211,7 @@ function _construct_braidingtensors!(ex, preargs, indexmap) # ex is guaranteed t
newargs = Vector{Any}(undef, length(args))
newargs[1] = args[1]
success = true
indices = TO.getindices(ex)
indices = [TO.getindices(arg) for arg in args]
for i in 2:length(ex.args)
indexmapa = copy(indexmap)
newargs[i], successa = _construct_braidingtensors!(args[i], preargs, indexmapa)
Expand Down
9 changes: 9 additions & 0 deletions test/planar.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -284,4 +284,13 @@ end

@test tr1 ≈ tr2 ≈ tr3 ≈ tr4 ≈ tr5 ≈ tr6 ≈ tr7
end
@testset "Issue 262" begin
V = ℂ^2
A = rand(T, V ← V)
B = rand(T, V ← V')
C = rand(T, V' ← V)
@planar D1[i; j] := A[i; j] + B[i; k] * C[k; j]
@planar D2[i; j] := B[i; k] * C[k; j] + A[i; j]
@test D1 ≈ D2
end
end
Loading