format

Author: borisdevos

src/spaces/gradedspace.jl

@@ -144,7 +144,7 @@ end
 Return the corresponding vector space of type `GradedSpace{I}` that represents the trivial
 one-dimensional space consisting of the left unit of the objects in  `Sector` `I`.
 """
-function leftunitspace(S::GradedSpace{I}) where {I<:Sector}
+function leftunitspace(S::GradedSpace{I}) where {I <: Sector}
     if UnitStyle(I) isa SimpleUnit
         return unitspace(typeof(S))
     else
@@ -163,7 +163,7 @@ end
 Return the corresponding vector space of type `GradedSpace{I}` that represents the trivial
 one-dimensional space consisting of the right unit of the objects in `Sector` `I`.
 """
-function rightunitspace(S::GradedSpace{I}) where {I<:Sector}
+function rightunitspace(S::GradedSpace{I}) where {I <: Sector}
     if UnitStyle(I) isa SimpleUnit
         return unitspace(typeof(S))
     else
@@ -183,7 +183,7 @@ Return the corresponding vector space of type `GradedSpace{I}` that represents t
  space consisting of the unit(s) of the objects in `Sector` `I`. For `I` with simple unit,
 this is a one-dimensional space.
 """
-function unitspace(S::Type{<:GradedSpace{I}}) where {I<:Sector}
+function unitspace(S::Type{<:GradedSpace{I}}) where {I <: Sector}
     return S(unit => 1 for unit in allunits(I))
 end
 zerospace(S::Type{<:GradedSpace}) = S()

src/spaces/productspace.jl

@@ -256,8 +256,10 @@ More specifically, adds a left monoidal unit or its dual.
 
 See also [`insertrightunit`](@ref insertrightunit(::ProductSpace, ::Val{i}) where {i}), [`removeunit`](@ref removeunit(::ProductSpace, ::Val{i}) where {i}).
 """
-function insertleftunit(P::ProductSpace, ::Val{i}=Val(length(P) + 1);
-                        conj::Bool=false, dual::Bool=false) where {i}
+function insertleftunit(
+        P::ProductSpace, ::Val{i} = Val(length(P) + 1);
+        conj::Bool = false, dual::Bool = false
+    ) where {i}
     N = length(P)
     I = sectortype(P)
     if UnitStyle(I) isa SimpleUnit
@@ -285,8 +287,10 @@ More specifically, adds a right monoidal unit or its dual.
 
 See also [`insertleftunit`](@ref insertleftunit(::ProductSpace, ::Val{i}) where {i}), [`removeunit`](@ref removeunit(::ProductSpace, ::Val{i}) where {i}).
 """
-function insertrightunit(P::ProductSpace, ::Val{i}=Val(length(P));
-                         conj::Bool=false, dual::Bool=false) where {i}
+function insertrightunit(
+        P::ProductSpace, ::Val{i} = Val(length(P));
+        conj::Bool = false, dual::Bool = false
+    ) where {i}
     N = length(P)
     I = sectortype(P)
     if UnitStyle(I) isa SimpleUnit

src/tensors/indexmanipulations.jl

@@ -318,8 +318,10 @@ If `copy=false`, `tdst` might share data with `tsrc` whenever possible. Otherwis
 See also [`insertrightunit`](@ref insertrightunit(::AbstractTensorMap, ::Val{i}) where {i}),
 [`removeunit`](@ref removeunit(::AbstractTensorMap, ::Val{i}) where {i}).
 """
-function insertleftunit(t::AbstractTensorMap, ::Val{i}=Val(numind(t) + 1);
-                        copy::Bool=false, conj::Bool=false, dual::Bool=false) where {i}
+function insertleftunit(
+        t::AbstractTensorMap, ::Val{i} = Val(numind(t) + 1);
+        copy::Bool = false, conj::Bool = false, dual::Bool = false
+    ) where {i}
     W = insertleftunit(space(t), Val(i); conj, dual)
     if t isa TensorMap
         return TensorMap{scalartype(t)}(copy ? Base.copy(t.data) : t.data, W)
@@ -345,8 +347,10 @@ If `copy=false`, `tdst` might share data with `tsrc` whenever possible. Otherwis
 See also [`insertleftunit`](@ref insertleftunit(::AbstractTensorMap, ::Val{i}) where {i}),
 [`removeunit`](@ref removeunit(::AbstractTensorMap, ::Val{i}) where {i}).
 """
-function insertrightunit(t::AbstractTensorMap, ::Val{i}=Val(numind(t));
-                         copy::Bool=false, conj::Bool=false, dual::Bool=false) where {i}
+function insertrightunit(
+        t::AbstractTensorMap, ::Val{i} = Val(numind(t));
+        copy::Bool = false, conj::Bool = false, dual::Bool = false
+    ) where {i}
     W = insertrightunit(space(t), Val(i); conj, dual)
     if t isa TensorMap
         return TensorMap{scalartype(t)}(copy ? Base.copy(t.data) : t.data, W)
@@ -371,7 +375,7 @@ If `copy=false`, `tdst` might share data with `tsrc` whenever possible. Otherwis
 This operation undoes the work of [`insertleftunit`](@ref insertleftunit(::AbstractTensorMap, ::Val{i}) where {i}) 
 and [`insertrightunit`](@ref insertrightunit(::AbstractTensorMap, ::Val{i}) where {i}).
 """
-function removeunit(t::AbstractTensorMap, ::Val{i}; copy::Bool=false) where {i}
+function removeunit(t::AbstractTensorMap, ::Val{i}; copy::Bool = false) where {i}
     W = removeunit(space(t), Val(i))
     if t isa TensorMap
         return TensorMap{scalartype(t)}(copy ? Base.copy(t.data) : t.data, W)

test/setup.jl

@@ -88,14 +88,14 @@ function random_fusiontree(I::Type{<:Sector}, N::Int) # for fusion tree tests
                 in = nothing
             else
                 rethrow(e)
-            end 
+            end
         end
     end
     return out
 end
 
 # for fusion tree merge test
-function safe_tensor_product(x::I, y::I) where {I<:Sector}
+function safe_tensor_product(x::I, y::I) where {I <: Sector}
     tp = x ⊗ y
     if isempty(tp)
         return nothing
@@ -194,21 +194,21 @@ C0, C1 = IsingBimodule(1, 1, 0), IsingBimodule(1, 1, 1)
 D0, D1 = IsingBimodule(2, 2, 0), IsingBimodule(2, 2, 1)
 M, Mop = IsingBimodule(1, 2, 0), IsingBimodule(2, 1, 0)
 VIB_diag = (
-        Vect[IsingBimodule](C0 => 1, C1 => 2),
-        Vect[IsingBimodule](C0 => 2, C1 => 1),
-        Vect[IsingBimodule](C0 => 3, C1 => 1),
-        Vect[IsingBimodule](C0 => 2, C1 => 3),
-        Vect[IsingBimodule](C0 => 3, C1 => 2)
+    Vect[IsingBimodule](C0 => 1, C1 => 2),
+    Vect[IsingBimodule](C0 => 2, C1 => 1),
+    Vect[IsingBimodule](C0 => 3, C1 => 1),
+    Vect[IsingBimodule](C0 => 2, C1 => 3),
+    Vect[IsingBimodule](C0 => 3, C1 => 2),
 )
 
 # not a random ordering! designed to make V1 ⊗ V2 ← V3 ⊗ V4 ⊗ V5 work (tensors)
 # while V1 ⊗ V2 ← V4 isn't empty (factorizations)
 VIB_M = (
     Vect[IsingBimodule](C0 => 1, C1 => 2),
-         Vect[IsingBimodule](M => 3),
-         Vect[IsingBimodule](C0 => 2, C1 => 3),
-         Vect[IsingBimodule](M => 4),
-         Vect[IsingBimodule](D0 => 3, D1 => 4)
+    Vect[IsingBimodule](M => 3),
+    Vect[IsingBimodule](C0 => 2, C1 => 3),
+    Vect[IsingBimodule](M => 4),
+    Vect[IsingBimodule](D0 => 3, D1 => 4),
 )
 
 end

test/symmetries/fusiontrees.jl

@@ -418,7 +418,7 @@ using .TestSetup
         else
             N = 4
         end
-    
+
         out = random_fusiontree(I, N)
         numtrees = count(n -> true, fusiontrees((out..., map(dual, out)...)))
         while !(0 < numtrees < 100)