Formatting

Author: scheinerman

docs/make.jl

@@ -2,4 +2,4 @@
 # julia --color=yes --project make.jl
 
 using Documenter, Mods
-makedocs(; sitename="Mods")
+makedocs(; sitename = "Mods")

extras/CRT.jl

@@ -38,4 +38,4 @@ end
 function CRT(::Type{T}, rs::Mod...) where {T}
     CRT(T, value.(rs), modulus.(rs))
 end
-CRT(rs::Mod...) = CRT(BigInt, rs...)
+CRT(rs::Mod...) = CRT(BigInt, rs...)

extras/mod_approx.jl

@@ -7,4 +7,4 @@ import Base: isapprox, rtoldefault
 rtoldefault(::Type{Mod{N,T}}) where {N,T} = rtoldefault(T)
 isapprox(x::Mod, y::Mod; kwargs...) = false
 isapprox(x::Mod{N}, y::Mod{N}; kwargs...) where {N} =
-    isapprox(value(x), value(y); kwargs...) || isapprox(value(y), value(x); kwargs...)
+    isapprox(value(x), value(y); kwargs...) || isapprox(value(y), value(x); kwargs...)

src/arithmetic.jl

@@ -6,8 +6,7 @@ function (+)(a::Mod{N}, b::Mod{N}) where {N}
 end
 
 function (+)(a::GaussMod{N}, b::GaussMod{N}) where {N}
-    N <= max_add ? Mod{N}((a.val) + (b.val)) :
-    GaussMod{N}(widen(a.val) + widen(b.val))
+    N <= max_add ? Mod{N}((a.val) + (b.val)) : GaussMod{N}(widen(a.val) + widen(b.val))
 end
 
 

src/basic_functions.jl

@@ -24,5 +24,4 @@ iszero(x::AbstractMod) = iszero(value(x))
 isone(x::AbstractMod) = isone(value(x))
 (==)(x::AbstractMod, y::AbstractMod) = modulus(x) == modulus(y) && value(x) == value(y)
 (==)(x::AbstractMod, y::T) where {T<:CZQ} = x == Mod{modulus(x)}(y)
-(==)(x::T, y::AbstractMod) where {T<:CZQ} = y==x
-
+(==)(x::T, y::AbstractMod) where {T<:CZQ} = y == x

src/iterate.jl

@@ -34,5 +34,3 @@ end
 Base.IteratorSize(::Type{GaussMod{m}}) where {m} = Base.HasLength()
 
 Base.length(::Type{GaussMod{m}}) where {m} = m * m
-
-

src/promotion.jl

@@ -2,28 +2,27 @@ import Base: promote_rule
 
 promo_error = "Cannot promote types with different moduli"
 
-promote_rule(::Type{Mod{M}}, ::Type{Mod{N}}) where {M,N} =
-    error(promo_error)
+promote_rule(::Type{Mod{M}}, ::Type{Mod{N}}) where {M,N} = error(promo_error)
 
-promote_rule(::Type{GaussMod{M}}, ::Type{GaussMod{N}}) where {M,N} =
-    error(promo_error)
+promote_rule(::Type{GaussMod{M}}, ::Type{GaussMod{N}}) where {M,N} = error(promo_error)
 
-promote_rule(::Type{Mod{M}}, ::Type{GaussMod{N}}) where {M,N} =
-    error(promo_error)
+promote_rule(::Type{Mod{M}}, ::Type{GaussMod{N}}) where {M,N} = error(promo_error)
 
 promote_rule(::Type{Mod{N}}, ::Type{Mod{N}}) where {N} = Mod{N}
 promote_rule(::Type{GaussMod{N}}, ::Type{Mod{N}}) where {N} = GaussMod{N}
 promote_rule(::Type{Mod{N}}, ::Type{GaussMod{N}}) where {N} = GaussMod{N}
 
-promote_rule(::Type{Mod{N}}, ::Type{T}) where {N, T<:Integer} = Mod{N}
-promote_rule(::Type{Mod{N}}, ::Type{Complex{T}}) where {N, T<:Integer} = GaussMod{N}
+promote_rule(::Type{Mod{N}}, ::Type{T}) where {N,T<:Integer} = Mod{N}
+promote_rule(::Type{Mod{N}}, ::Type{Complex{T}}) where {N,T<:Integer} = GaussMod{N}
 
-promote_rule(::Type{GaussMod{N}}, ::Type{T}) where {N, T<:Union{Integer,Complex}} = GaussMod{N}
+promote_rule(::Type{GaussMod{N}}, ::Type{T}) where {N,T<:Union{Integer,Complex}} =
+    GaussMod{N}
 
 
-promote_rule(::Type{Mod{N}}, ::Type{Rational{T}}) where {N, T<:Integer} = Mod{N}
-promote_rule(::Type{GaussMod{N}}, ::Type{Rational{T}}) where {N, T<:Integer} = GaussMod{N}
-
-promote_rule(::Type{Mod{N}}, ::Type{Complex{Rational{T}}}) where {N, T<:Integer} = GaussMod{N}
-promote_rule(::Type{GaussMod{N}}, ::Type{Complex{Rational{T}}}) where {N, T<:Integer} = GaussMod{N}
+promote_rule(::Type{Mod{N}}, ::Type{Rational{T}}) where {N,T<:Integer} = Mod{N}
+promote_rule(::Type{GaussMod{N}}, ::Type{Rational{T}}) where {N,T<:Integer} = GaussMod{N}
 
+promote_rule(::Type{Mod{N}}, ::Type{Complex{Rational{T}}}) where {N,T<:Integer} =
+    GaussMod{N}
+promote_rule(::Type{GaussMod{N}}, ::Type{Complex{Rational{T}}}) where {N,T<:Integer} =
+    GaussMod{N}

test/speed_test.jl

@@ -68,4 +68,4 @@ end
 #   409.250 μs (5 allocations: 10.19 KiB)
 # [ Info: Multiplication
 #   359.625 μs (8 allocations: 47.53 KiB)
-# A ^ 3 == AA ^ 3 = false
+# A ^ 3 == AA ^ 3 = false