allow any range in sortedunion special cases

Author: dlfivefifty

src/blockbanded/blockbanded.jl

@@ -13,14 +13,14 @@ 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{Union{Int,AbstractVector{Int}},InfStepRange{Int,Int}}},
-                                 b::Vcat{Int,1,<:Tuple{Union{Int,AbstractVector{Int}},InfStepRange{Int,Int}}})
+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

@@ -188,7 +188,9 @@ include("test_infbanded.jl")
         @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