Support Vcat(1,2:∞) in sortedunion

Project.toml

@@ -1,6 +1,6 @@
 name = "InfiniteLinearAlgebra"
 uuid = "cde9dba0-b1de-11e9-2c62-0bab9446c55c"
-version = "0.6.3"
+version = "0.6.4"
 
 [deps]
 ArrayLayouts = "4c555306-a7a7-4459-81d9-ec55ddd5c99a"

src/blockbanded/blockbanded.jl

@@ -13,15 +13,15 @@ function BlockArrays.sortedunion(b, ::AbstractVector{<:PosInfinity})
 end
 BlockArrays.sortedunion(a::OneToInfCumsum, ::OneToInfCumsum) = a
 BlockArrays.sortedunion(a::OneToCumsum, ::OneToCumsum) = a
-function BlockArrays.sortedunion(a::RangeCumsum{<:Any,<:InfStepRange}, b::RangeCumsum{<:Any,<:InfStepRange})
+function BlockArrays.sortedunion(a::RangeCumsum{<:Any,<:AbstractRange}, b::RangeCumsum{<:Any,<:AbstractRange})
     @assert a == b
     a
 end
 
 
-function BlockArrays.sortedunion(a::Vcat{Int,1,<:Tuple{<:AbstractVector{Int},InfStepRange{Int,Int}}},
-                                 b::Vcat{Int,1,<:Tuple{<:AbstractVector{Int},InfStepRange{Int,Int}}})
-    @assert a == b
+function BlockArrays.sortedunion(a::Vcat{Int,1,<:Tuple{Union{Int,AbstractVector{Int}},<:AbstractRange}},
+                                 b::Vcat{Int,1,<:Tuple{Union{Int,AbstractVector{Int}},<:AbstractRange}})
+    @assert a == b # TODO: generailse? Not sure how to do so in a type stable fashion
     a
 end
 

test/runtests.jl

@@ -186,6 +186,11 @@ include("test_infbanded.jl")
         @test BlockArrays.sortedunion(a,a) ≡ a
         @test BlockArrays.sortedunion([∞],a) ≡ BlockArrays.sortedunion(a,[∞]) ≡ a
         @test BlockArrays.sortedunion([∞],[∞]) == [∞]
+
+        b = Vcat([1,2],3:∞)
+        c = Vcat(1,3:∞)
+        @test BlockArrays.sortedunion(b,b) ≡ b
+        @test BlockArrays.sortedunion(c,c) ≡ c
     end
 end