Skip to content

Add hash for FusionTreeBlock to fix cacheing behind AdjointTensorMap permutes #518

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 3 commits into from
Aug 31, 2026
Merged

Add hash for FusionTreeBlock to fix cacheing behind AdjointTensorMap permutes #518

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
d04adc9
Add `hash` for `FusionTreeBlock`
leburgel Aug 27, 2026
cae6b3a
rework hash
lkdvos Aug 31, 2026
cfd7bc2
Include first tree pair in FusionTreeBlock hash
lkdvos Aug 31, 2026
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
4 changes: 4 additions & 0 deletions src/fusiontrees/fusiontrees.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -214,6 +214,10 @@ function Base.hash(f::FusionTree{I}, h::UInt) where {I}
end
return h
end
# Hashing the first tree pair covers the block's defining data `(uncoupled, isdual)`, while
# also disambiguating the ad-hoc single-pair blocks constructed in `planar_trace`
Base.hash(b::FusionTreeBlock, h::UInt) = isempty(b) ? h : hash(first(fusiontrees(b)), h)

function Base.:(==)(f₁::FusionTree{I, N}, f₂::FusionTree{I, N}) where {I <: Sector, N}
f₁.coupled == f₂.coupled || return false
@inbounds for i in 1:N
Expand Down
Loading