@@ -166,8 +166,8 @@ operation is the inverse of `insertat` in the sense that if
166166 return f₁, f₂
167167 elseif M === 0
168168 # TODO : evaluate diagrams to see which unit is used here
169- f₁ = FusionTree {I} ((), one (I), (), ())
170- uncoupled2 = (one (I), f. uncoupled... )
169+ f₁ = FusionTree {I} ((), one (I), (), ())
170+ uncoupled2 = (one (I), f. uncoupled... )
171171 coupled2 = f. coupled
172172 isdual2 = (false , f. isdual... )
173173 innerlines2 = N >= 2 ? (f. uncoupled[1 ], f. innerlines... ) : ()
@@ -290,7 +290,8 @@ function bendright(f₁::FusionTree{I,N₁}, f₂::FusionTree{I,N₂}) where {I<
290290 # map final splitting vertex (a, b)<-c to fusion vertex a<-(c, dual(b))
291291 @assert N₁ > 0
292292 c = f₁. coupled
293- a = N₁ == 1 ? leftone (f₁. uncoupled[1 ]) : (N₁ == 2 ? f₁. uncoupled[1 ] : f₁. innerlines[end ])
293+ a = N₁ == 1 ? leftone (f₁. uncoupled[1 ]) :
294+ (N₁ == 2 ? f₁. uncoupled[1 ] : f₁. innerlines[end ])
294295 b = f₁. uncoupled[N₁]
295296
296297 uncoupled1 = TupleTools. front (f₁. uncoupled)
@@ -641,8 +642,8 @@ function planar_trace(f₁::FusionTree{I}, f₂::FusionTree{I},
641642 F₂ = fusiontreetype (I, N₂)
642643 newtrees = FusionTreeDict {Tuple{F₁,F₂},T} ()
643644 for ((f₁′, f₂′), coeff′) in repartition (f₁, f₂, N)
644- for (f₁′′, coeff′′) in planar_trace (f₁′, q1′, q2′) # errors in this planar_trace first
645- for (f12′′′, coeff′′′) in transpose (f₁′′, f₂′, p1′, p2′) # for a different unit errors here
645+ for (f₁′′, coeff′′) in planar_trace (f₁′, q1′, q2′)
646+ for (f12′′′, coeff′′′) in transpose (f₁′′, f₂′, p1′, p2′)
646647 coeff = coeff′ * coeff′′ * coeff′′′
647648 if ! iszero (coeff)
648649 newtrees[f12′′′] = get (newtrees, f12′′′, zero (coeff)) + coeff
@@ -695,7 +696,7 @@ function planar_trace(f::FusionTree{I,N},
695696 q2′ = let i = i, j = j
696697 map (l -> (l - (l > i) - (l > j)), TupleTools. deleteat (q2, k))
697698 end
698- for (f′, coeff′) in elementary_trace (f, i) # errors then here
699+ for (f′, coeff′) in elementary_trace (f, i)
699700 for (f′′, coeff′′) in planar_trace (f′, q1′, q2′)
700701 coeff = coeff′ * coeff′′
701702 if ! iszero (coeff)
@@ -723,15 +724,16 @@ function elementary_trace(f::FusionTree{I,N}, i) where {I<:Sector,N}
723724 T = sectorscalartype (I)
724725 F = fusiontreetype (I, N - 2 )
725726 newtrees = FusionTreeDict {F,T} ()
726- _one = f. coupled # otherwise ArgumentError above thrown
727+ _one = f. coupled
727728
728729 j = mod1 (i + 1 , N)
729730 b = f. uncoupled[i]
730731 b′ = f. uncoupled[j]
731732 # if trace is zero, return empty dict
732733 (b == dual (b′) && f. isdual[i] != f. isdual[j]) || return newtrees
733734 if i < N
734- inner_extended = (leftone (f. uncoupled[1 ]), f. uncoupled[1 ], f. innerlines... , f. coupled)
735+ inner_extended = (leftone (f. uncoupled[1 ]), f. uncoupled[1 ], f. innerlines... ,
736+ f. coupled)
735737 a = inner_extended[i]
736738 d = inner_extended[i + 2 ]
737739 a == d || return newtrees
0 commit comments