new: log2i, BitInt (#61)

Author: GiggleLiu

src/longlonguint.jl

@@ -23,6 +23,7 @@ Base.zero(::Type{LongLongUInt{C}}) where {C} = LongLongUInt{C}(ntuple(_->UInt(0)
 Base.zero(::LongLongUInt{C}) where {C} = zero(LongLongUInt{C})
 # convert from integers
 LongLongUInt{C}(x::T) where {C, T<:Integer} = LongLongUInt{C}(ntuple(i->i==C ? UInt(x) : zero(UInt), Val{C}()))
+LongLongUInt{C}(x::LongLongUInt{C}) where {C} = x
 Base.promote_rule(::Type{LongLongUInt{C}}, ::Type{Int}) where {C} = LongLongUInt{C}
 Base.promote_rule(::Type{LongLongUInt{C}}, ::Type{UInt}) where {C} = LongLongUInt{C}
 function Base.mod(x::LongLongUInt{C}, D::Int) where {C}
@@ -135,3 +136,7 @@ end
 
 Base.hash(x::LongLongUInt{1}) = hash(x.content[1])
 Base.hash(x::LongLongUInt{C}) where{C} = hash(x.content)
+
+# these APIs will are used in SparseTN
+BitBasis.log2i(x::LongLongUInt{C}) where C = floor(Int, log2(Float64(BigInt(x))))
+Base.BigInt(x::LongLongUInt{C}) where C = mapfoldl(x -> BigInt(x), (x, y) -> ((x << 64) | y), x.content)

test/longlonguint.jl

@@ -2,6 +2,7 @@ using Test, BitBasis
 
 @testset "longlonguint" begin
     x = LongLongUInt((3,))
+    @test LongLongUInt{1}(x) == x
     @test Int(x) === 3
     @test bsizeof(x) == 64
     @test BitBasis.nint(x) == 1
@@ -124,3 +125,14 @@ end
     sorted_xs = sort(xs)
     @test sorted_xs == [LongLongUInt((2, 4)), LongLongUInt((3, 6)), LongLongUInt((3, 7))]
 end
+
+@testset "patch" begin
+    @test BigInt(LongLongUInt((3,))) == 3
+    @test BigInt(LongLongUInt((3, 0))) == BigInt(3) << 64
+    @test BigInt(LongLongUInt((0, 3))) == 3
+    @test BigInt(LongLongUInt((1,2))) == (BigInt(1) << 64) + BigInt(2)
+    @test log2i(LongLongUInt((3,))) == 1
+    @test log2i(LongLongUInt((1,2))) == 64
+    @test log2i(LongLongUInt((0,2))) == 1
+    @test log2i(LongLongUInt((1,0))) == 64
+end