even better test set names

Author: nsajko

test/no_invalidations.jl

@@ -50,8 +50,8 @@ function test_expr(f, supertype::Type = Integer)
     ThereAreNoInvalidations.there_are_no_invalidations(e)
 end
 
-@testset "invalidations test set" begin
-    @testset "primitive type construction" begin
+@testset "no invalidations test set" begin
+    @testset "construction of old int types from new type" begin
         @test test_expr(n -> :(Base.Bool(::$n) = false))
         @test test_expr(n -> :(Base.Int8(::$n) = Int8(0))) broken=true
         @test test_expr(n -> :(Base.UInt8(::$n) = UInt8(0))) broken=true
@@ -60,7 +60,7 @@ end
         @test test_expr(n -> :(Base.Int(::$n) = 0)) broken=true
         @test test_expr(n -> :(Base.UInt(::$n) = 0x0)) broken=true
     end
-    @testset "arithmetic with primitive types" begin
+    @testset "arithmetic between old int types and new int type" begin
         @test test_expr(n -> :(Base.:(+)(::$n, m::Bool) = m))
         @test test_expr(n -> :(Base.:(+)(m::Bool, ::$n) = m))
         @test test_expr(n -> :(Base.:(+)(::$n, m::Int8) = m))
@@ -76,7 +76,7 @@ end
         @test test_expr(n -> :(Base.:(+)(::$n, m::UInt) = m))
         @test test_expr(n -> :(Base.:(+)(m::UInt, ::$n) = m))
     end
-    @testset "promotion with primitive types" begin
+    @testset "promotion between old int types and new int type" begin
         @test (
             test_expr(n -> :(Base.promote_rule(::Type{Bool}, ::Type{$n}) = Bool)) &&
             test_expr(n -> :(Base.promote_rule(::Type{$n}, ::Type{Bool}) = Bool))