work around #56698

JuliaLang · Nov 27, 2024 · b89f6ca · b89f6ca
1 parent 9f2c4eb
commit b89f6ca
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 0 deletions.
diff --git a/test/ambiguous.jl b/test/ambiguous.jl
@@ -355,6 +355,7 @@ end
         pop!(need_to_handle_undef_sparam, which(Base._totuple, (Type{Tuple{Vararg{E}}} where E, Any, Any)))
         pop!(need_to_handle_undef_sparam, which(Base.eltype, Tuple{Type{Tuple{Any}}}))
         pop!(need_to_handle_undef_sparam, first(methods(Base.same_names)))
+        pop!(need_to_handle_undef_sparam, which(which(sort, Tuple{Tuple{}}))
         @test_broken isempty(need_to_handle_undef_sparam)
         pop!(need_to_handle_undef_sparam, which(Base._cat, Tuple{Any, AbstractArray}))
         pop!(need_to_handle_undef_sparam, which(Base.byteenv, (Union{AbstractArray{Pair{T,V}, 1}, Tuple{Vararg{Pair{T,V}}}} where {T<:AbstractString,V},)))

diff --git a/test/sorting.jl b/test/sorting.jl
@@ -100,6 +100,7 @@ function tuple_sort_test(x)
     @test 0 == @allocated sort(x)
 end
 @testset "sort(::NTuple)" begin
+    @test sort(()) == ()
     @test sort((9,8,3,3,6,2,0,8)) == (0,2,3,3,6,8,8,9)
     @test sort((9,8,3,3,6,2,0,8), by=x->x÷3) == (2,0,3,3,8,6,8,9)
     for i in 1:40