From 67e22973a77e2fc1dbfc4baff8db10aa4006c6cf Mon Sep 17 00:00:00 2001
From: Jameson Nash <vtjnash@gmail.com>
Date: Fri, 7 Apr 2023 16:10:37 -0400
Subject: [PATCH] fixup! fixup! some algorithm layout cleanup

Correct test for some other improvement also now on master.
---
 test/subtype.jl | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/subtype.jl b/test/subtype.jl
index be924149e12ba..148648173de99 100644
--- a/test/subtype.jl
+++ b/test/subtype.jl
@@ -2502,5 +2502,5 @@ let T = Tuple{Union{Type{T}, Type{S}}, Union{Val{T}, Val{S}}, Union{Val{T}, S}}
     S = Tuple{Type{T}, T, Val{T}} where T<:(Val{S} where S<:Val)
     # optimal = Union{}?
     @test typeintersect(T, S) == Tuple{Type{T}, T, Val{T}} where T<:(Val{S} where S<:Val)
-    @test typeintersect(S, T) == Tuple{Union{Type{T}, Type{T1}}, Union{Val{T1}, Val{S1}, T}, Union{S, S1}} where {T<:(Val{S} where S<:Val), S<:Union{Val{T}, T}, T1<:Val, S1<:Val{T1}}
+    @test typeintersect(S, T) == Tuple{Union{Type{T}, Type{T1}}, Union{Val{T1}, Val{S1}, T}, Union{S, S1}} where {T<:(Val{S} where S<:Val), S<:Val{T}, T1<:Val, S1<:Val{T1}}
 end