Fix some tiny issues and bump version to 4.0.1 (#97)

* fix some tiny issues and bump version

* fix doctest

Author: GiggleLiu

Project.toml

@@ -1,7 +1,7 @@
 name = "GenericTensorNetworks"
 uuid = "3521c873-ad32-4bb4-b63d-f4f178f42b49"
 authors = ["GiggleLiu <[email protected]> and contributors"]
-version = "4.0.0"
+version = "4.0.1"
 
 [deps]
 AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"

src/Mods.jl/src/Mods.jl

@@ -31,8 +31,6 @@ function Mod{N}(x::T) where {T<:Complex{<:Integer},N}
     Mod{N,S}(v)
 end
 
-
-
 # type casting
 Mod{N,T}(x::Mod{N,T2}) where {T,N,T2} = Mod{N,T}(T(x.val))
 Mod{N,T}(x::Mod{N,T}) where {T,N} = x
@@ -49,12 +47,12 @@ julia> modulus(a)
 13
 ```
 """
-modulus(a::Mod{N}) where {N} = N
+modulus(::Mod{N}) where {N} = N
 
 """
 `value(a::Mod)` returns the value of this `Mod` number.
 ```
-julia> a = Mod{13}(11);
+julia> a = Mod{13}(24);
 
 julia> value(a)
 11
@@ -73,7 +71,6 @@ end
 # Test for equality
 iszero(x::Mod{N}) where {N} = iszero(value(x))
 ==(x::Mod, y::Mod) = modulus(x) == modulus(y) && value(x) == value(y)
-# ==(x::Mod{N}, y::Mod{N}) where {N} = iszero(value(x - y))
 
 # Apporximate equality
 rtoldefault(::Type{Mod{N,T}}) where {N,T} = rtoldefault(T)

src/Mods.jl/test/runtests.jl

@@ -3,6 +3,8 @@ using GenericTensorNetworks.Mods
 
 @testset "Constructors" begin
     @test one(Mod{17}) == Mod{17}(1)
+    @test one(Mod{17}) != Mod{17}(2)
+    @test one(Mod{17}) == Mod{17}(18)
     @test oneunit(Mod{17}) == Mod{17}(1)
     @test zero(Mod{17}) == 0
     @test iszero(zero(Mod{17}))

src/arithematics.jl

@@ -90,13 +90,13 @@ Examples
 ------------------------
 ```jldoctest; setup=(using GenericTensorNetworks)
 julia> TruncatedPoly((1,2,3), 6)
-x^4 + 2*x^5 + 3*x^6
+x⁴ + 2*x⁵ + 3*x⁶
 
 julia> TruncatedPoly((1,2,3), 6) * TruncatedPoly((5,2,1), 3)
-20*x^7 + 8*x^8 + 3*x^9
+20*x⁷ + 8*x⁸ + 3*x⁹
 
 julia> TruncatedPoly((1,2,3), 6) + TruncatedPoly((5,2,1), 3)
-x^4 + 2*x^5 + 3*x^6
+x⁴ + 2*x⁵ + 3*x⁶
 ```
 """
 struct TruncatedPoly{K,T,TO} <: Number
@@ -163,7 +163,7 @@ function Base.show(io::IO, ::MIME"text/plain", x::TruncatedPoly{K}) where K
     if isinf(x.maxorder)
         print(io, 0)
     else
-        print(io, Polynomial(x))
+        print(io, LaurentPolynomial(x))
     end
 end
 Polynomials.Polynomial(x::TruncatedPoly{K, T}) where {K, T} = Polynomial(vcat(zeros(T, Int(x.maxorder)-K+1), [x.coeffs...]))