Revision a311f4d8327a5051b11a6bcd1c44ed931d4ab261 authored by Jacob Quinn on 20 October 2022, 02:44:43 UTC, committed by GitHub on 20 October 2022, 02:44:43 UTC
As reported [here](https://discourse.julialang.org/t/test-failures-for-sockets-base-runtests-sockets/88898). My guess on the original issue reported is that, for some reason, the host where the tests are run is unable to listen on any ports, so we end up cycling through the entire UInt16 range (the test starts at port 11011), but when we fail on port 65535, we do `addr.port + 1` and instead of wrapping around as I believe this function intends to happen (as noted by the `addr.port == default_port` check before we error), it gets promoted to `Int(65536)` which then throws an (unexpected) error in the `InetAddr` constructor. I'm not quite sure how to test this exactly though, because we'd need to simulate not being able to listen on any ports? If anyone has any ideas, I'm all ears.
1 parent 0d52506
core.jl
# This file is a part of Julia. License is MIT: https://julialang.org/license
# test core language features
using Random, InteractiveUtils
const Bottom = Union{}
# For curmod_*
include("testenv.jl")
## tests that `const` field declarations
# sanity tests that our built-in types are marked correctly for const fields
for (T, c) in (
(Core.CodeInfo, []),
(Core.CodeInstance, [:def, :min_world, :max_world, :rettype, :rettype_const, :ipo_purity_bits, :argescapes]),
(Core.Method, [#=:name, :module, :file, :line, :primary_world, :sig, :slot_syms, :external_mt, :nargs, :called, :nospecialize, :nkw, :isva, :pure, :is_for_opaque_closure, :constprop=#]),
(Core.MethodInstance, [#=:def, :specTypes, :sparam_vals]=#]),
(Core.MethodTable, [:module]),
(Core.TypeMapEntry, [:sig, :simplesig, :guardsigs, :min_world, :max_world, :func, :isleafsig, :issimplesig, :va]),
(Core.TypeMapLevel, []),
(Core.TypeName, [:name, :module, :names, :atomicfields, :constfields, :wrapper, :mt, :hash, :n_uninitialized, :flags]),
(DataType, [:name, :super, :parameters, :instance, :hash]),
)
@test Set((fieldname(T, i) for i in 1:fieldcount(T) if isconst(T, i))) == Set(c)
end
@test_throws(ErrorException("setfield!: const field .name of type DataType cannot be changed"),
setfield!(Int, :name, Int.name))
@test_throws(ErrorException("setfield!: const field .name of type DataType cannot be changed"),
(Base.Experimental.@force_compile; setfield!(Int, :name, Int.name)))
@test_throws(ErrorException("invalid field attribute const for immutable struct"),
@eval struct ABCDconst
const abcd
end)
mutable struct ABCDconst
const a
const b::Int
c
const d::Union{Int,Nothing}
end
@test_throws(ErrorException("invalid redefinition of constant ABCDconst"),
mutable struct ABCDconst
const a
const b::Int
c
d::Union{Int,Nothing}
end)
@test_throws(ErrorException("invalid redefinition of constant ABCDconst"),
mutable struct ABCDconst
a
b::Int
c
d::Union{Int,Nothing}
end)
let abcd = ABCDconst(1, 2, 3, 4)
@test (1, 2, 3, 4) === (abcd.a, abcd.b, abcd.c, abcd.d)
@test_throws(ErrorException("setfield!: const field .a of type ABCDconst cannot be changed"),
abcd.a = 0)
@test_throws(ErrorException("replacefield!: const field .a of type ABCDconst cannot be changed"),
replacefield!(abcd, :a, 1, 0))
@test_throws(ErrorException("modifyfield!: const field .a of type ABCDconst cannot be changed"),
modifyfield!(abcd, :a, +, 1))
@test_throws(ErrorException("swapfield!: const field .a of type ABCDconst cannot be changed"),
swapfield!(abcd, :a, 0))
@test_throws(ErrorException("setfield!: const field .b of type ABCDconst cannot be changed"),
abcd.b = 0)
abcd.c = "not constant"
@test_throws(ErrorException("setfield!: const field .d of type ABCDconst cannot be changed"),
abcd.d = nothing)
@test (1, 2, "not constant", 4) === (abcd.a, abcd.b, abcd.c, abcd.d)
end
# repeat with the compiler
let abcd = ABCDconst(1, 2, 3, 4)
Base.Experimental.@force_compile
@test (1, 2, 3, 4) === (abcd.a, abcd.b, abcd.c, abcd.d)
@test_throws(ErrorException("setfield!: const field .a of type ABCDconst cannot be changed"),
abcd.a = 0)
@test_throws(ErrorException("replacefield!: const field .a of type ABCDconst cannot be changed"),
replacefield!(abcd, :a, 1, 0))
@test_throws(ErrorException("modifyfield!: const field .a of type ABCDconst cannot be changed"),
modifyfield!(abcd, :a, +, 1))
@test_throws(ErrorException("swapfield!: const field .a of type ABCDconst cannot be changed"),
swapfield!(abcd, :a, 0))
@test_throws(ErrorException("setfield!: const field .b of type ABCDconst cannot be changed"),
abcd.b = 0)
abcd.c = "not constant"
@test_throws(ErrorException("setfield!: const field .d of type ABCDconst cannot be changed"),
abcd.d = nothing)
@test (1, 2, "not constant", 4) === (abcd.a, abcd.b, abcd.c, abcd.d)
end
# test `===` handling null pointer in struct #44712
struct N44712
a::Some{Any}
b::Int
N44712() = new()
end
let a = Int[0, 1], b = Int[0, 2]
GC.@preserve a b begin
@test unsafe_load(Ptr{N44712}(pointer(a))) !== unsafe_load(Ptr{N44712}(pointer(b)))
end
end
# another possible issue in #44712
@test (("", 0),) !== (("", 1),)
f47(x::Vector{Vector{T}}) where {T} = 0
@test_throws MethodError f47(Vector{Vector}())
@test f47(Vector{Vector{Int}}()) == 0
# checking unionall and typevar components
@test_throws TypeError ([] where T)
@test_throws TypeError ([T] where T)
@test_throws TypeError (Array{T} where T<:[])
@test_throws TypeError (Array{T} where T>:[])
@test_throws TypeError (Array{T} where T<:Vararg)
@test_throws TypeError (Array{T} where T>:Vararg)
@test_throws TypeError (Array{T} where T<:Vararg{Int})
@test_throws TypeError (Array{T} where T<:Vararg{Int,2})
@test_throws TypeError TypeVar(:T) <: Any
@test_throws TypeError TypeVar(:T) >: Any
# issue #28673
@test_throws TypeError Array{2}(undef, 1, 2)
# issue #12939
module Issue12939
abstract type Abs; end
struct Foo <: Abs; end
struct Bar; val::Int64; end
struct Baz; val::Int64; end
f(::Type{T}, x::T) where {T} = T(3)
f(::Type{Bar}, x::T) where {T <: Abs} = Bar(2)
f(::Type{Bar}, x) = Bar(1)
f(::Type{Baz}, x) = Baz(1)
f(::Type{Baz}, x::T) where {T <: Abs} = Baz(2)
end
@test Issue12939.f(Issue12939.Baz,Issue12939.Foo()) === Issue12939.Baz(2)
@test Issue12939.f(Issue12939.Bar,Issue12939.Foo()) === Issue12939.Bar(2)
# issue #11840
TT11840{T} = Tuple{T,T}
f11840(::Type) = "Type"
f11840(::DataType) = "DataType"
f11840(::UnionAll) = "UnionAll"
f11840(::Type{T}) where {T<:Tuple} = "Tuple"
@test f11840(Type) == "UnionAll"
@test f11840(Type.body) == "DataType"
@test f11840(Union{Int,Int8}) == "Type"
@test f11840(Tuple) == "Tuple"
@test f11840(TT11840) == "Tuple"
g11840(::DataType) = 1
g11840(::Type) = 2
g11840(sig::Type{T}) where {T<:Tuple} = 3
@test g11840(Vector.body) == 1
@test g11840(Vector) == 2
@test g11840(Vector.body) == 1
@test g11840(Vector) == 2
@test g11840(Tuple) == 3
@test g11840(TT11840) == 3
g11840b(::DataType) = 1
g11840b(::Type) = 2
g11840b(sig::Type{T}) where {T<:Tuple} = 3
@test g11840b(Vector) == 2
@test g11840b(Vector.body) == 1
@test g11840b(Vector) == 2
@test g11840b(Vector.body) == 1
@test g11840b(Tuple) == 3
@test g11840b(TT11840) == 3
h11840(::DataType) = '1'
h11840(::Type) = '2'
h11840(::UnionAll) = '3'
h11840(::Type{T}) where {T<:Tuple} = '4'
@test h11840(Vector) == '3'
@test h11840(Vector.body) == '1'
@test h11840(Vector) == '3'
@test h11840(Union{Vector, Matrix}) == '2'
@test h11840(Union{Vector.body, Matrix.body}) == '2'
@test h11840(Tuple) == '4'
@test h11840(TT11840) == '4'
# show that we don't make the cache confused by using alternative representations
# when specificity is reversed
j11840(::DataType) = '1'
j11840(::Union{Type{T}, T}) where {T} = '2' # force cache to contain leaftypes
@test j11840(Union{Tuple{Int32}, Tuple{Int64}}) == '2'
@test j11840(Tuple{Union{Int32, Int64}}) == '1' # DataType more specific than Type
# but show we can correctly match types with alternate equivalent representations
k11840(::Type{Union{Tuple{Int32}, Tuple{Int64}}}) = '2'
@test k11840(Tuple{Union{Int32, Int64}}) == '2'
@test k11840(Tuple{Union{Int32, Int64}}) == '2'
@test k11840(Union{Tuple{Int32}, Tuple{Int64}}) == '2'
# issue #20511
f20511(x::DataType) = 0
f20511(x) = 1
Type{Integer} # cache this
@test f20511(Union{Integer,T} where T <: Unsigned) == 1
# join
@test typejoin(Int8,Int16) === Signed
@test typejoin(Int,AbstractString) === Any
@test typejoin(Array{Float64},BitArray) <: AbstractArray
@test typejoin(Array{Bool},BitArray) <: AbstractArray{Bool}
@test typejoin(Tuple{Int,Int8},Tuple{Int8,Float64}) === Tuple{Signed,Real}
@test typejoin(Tuple{String,String}, Tuple{GenericString,String},
Tuple{String,GenericString}, Tuple{Int,String,Int}) ==
Tuple{Any,AbstractString,Vararg{Int}}
@test typejoin(Tuple{Int8,Vararg{Int}}, Tuple{Int8,Int8}) ==
Tuple{Int8,Vararg{Signed}}
@test typejoin(Tuple{Int8,Vararg{Int}}, Tuple{Int8,Vararg{Int8}}) ==
Tuple{Int8,Vararg{Signed}}
@test typejoin(Tuple{Int8,UInt8,Vararg{Int}}, Tuple{Int8,Vararg{Int8}}) ==
Tuple{Int8,Vararg{Integer}}
@test typejoin(Union{Int,AbstractString}, Int) == Union{Int,AbstractString}
@test typejoin(Union{Int,AbstractString}, Int8) == Any
@test typejoin(Tuple{}, Tuple{Int}) == Tuple{Vararg{Int}}
# typejoin associativity
abstract type Foo____{K} end
mutable struct Wow____{K,V} <: Foo____{K} end
mutable struct Bar____{K,V} <: Foo____{K} end
let
a = Wow____{Int64, Int64}
b = Wow____{Int64, Float64}
c = Bar____{Int64, Int64}
@test typejoin(typejoin(b,c), a) == typejoin(typejoin(b,a), c) == Foo____{Int64}
end
# typejoin with Vararg{T,N}
@test typejoin(Tuple{Vararg{Int,2}}, Tuple{Int,Int,Int}) === Tuple{Int,Int,Vararg{Int}}
@test typejoin(Tuple{Vararg{Int,2}}, Tuple{Vararg{Int}}) === Tuple{Vararg{Int}}
@test typejoin(NTuple{3,Tuple}, NTuple{2,T} where T) == Tuple{Any,Any,Vararg{Tuple}}
@test typejoin(Tuple{Tuple{T, T, Any}} where T, Tuple{T, T, Vector{T}} where T) == Tuple{Any,Vararg{Any}}
@test typejoin(Tuple{T, T, T} where T, Tuple{T, T, Vector{T}} where T) == Tuple{Any,Any,Any}
# issue #26321
struct T26321{N,S<:NTuple{N}}
t::S
end
let mi = T26321{3,NTuple{3,Int}}((1,2,3)), mf = T26321{3,NTuple{3,Float64}}((1.0,2.0,3.0))
J = T26321{3,S} where S<:(Tuple{T,T,T} where T)
@test typejoin(typeof(mi),typeof(mf)) == J
a = [mi, mf]
@test a[1] === mi
@test a[2] === mf
@test eltype(a) == J
@test a isa Vector{<:T26321{3}}
end
# promote_typejoin returns a Union only with Nothing/Missing combined with concrete types
for T in (Nothing, Missing)
@test Base.promote_typejoin(Int, Float64) === Real
@test Base.promote_typejoin(Int, T) === Union{Int, T}
@test Base.promote_typejoin(T, String) === Union{T, String}
@test Base.promote_typejoin(Vector{Int}, T) === Union{Vector{Int}, T}
@test Base.promote_typejoin(Vector, T) === Union{Vector, T}
@test Base.promote_typejoin(Real, T) === Union{Real, T}
for U in (String, Float64)
@test Base.promote_typejoin(Int, U) === typejoin(Int, U)
@test Base.promote_typejoin(Int, Union{U, T}) === Union{typejoin(Int, U), T}
@test Base.promote_typejoin(Union{Int, U}, T) === Union{Union{Int, U}, T}
@test Base.promote_typejoin(Union{T, U}, Int) === Union{typejoin(Int, U), T}
@test Base.promote_typejoin(Union{T, U}, Union{T, Int}) === Union{typejoin(Int, U), T}
@test Base.promote_typejoin(Union{T, U}, Union{Missing, Int}) ===
Union{typejoin(Int, U), T, Missing}
@test Base.promote_typejoin(Union{T, U}, Union{Nothing, Int}) ===
Union{typejoin(Int, U), T, Nothing}
@test Base.promote_typejoin(Union{T, Nothing, U}, Union{Nothing, Missing, Int}) ===
Union{typejoin(Int, U), T, Nothing, Missing}
end
@test Base.promote_typejoin(T, Union{}) === T
@test Base.promote_typejoin(Union{}, T) === T
end
@test promote_type(Bool,Bottom) === Bool
# type declarations
abstract type Sup_{A,B} end
abstract type Qux_{T} <: Sup_{Qux_{Int},T} end
@test Qux_{Int}.super <: Sup_
@test ===(Qux_{Int}, Qux_{Int}.super.parameters[1])
@test ===(Qux_{Int}.super.parameters[2], Int)
@test Qux_{Char}.super <: Sup_
@test ===(Qux_{Int}, Qux_{Char}.super.parameters[1])
@test ===(Qux_{Char}.super.parameters[2], Char)
@test Qux_.body.super.parameters[1].super <: Sup_
@test ===(Qux_{Int}, Qux_.body.super.parameters[1].super.parameters[1])
@test ===(Int, Qux_.body.super.parameters[1].super.parameters[2])
mutable struct Foo_{T} x::Foo_{Int} end
@test ===(Foo_.body.types[1], Foo_{Int})
@test ===(Foo_.body.types[1].types[1], Foo_{Int})
mutable struct Circ_{T} x::Circ_{T} end
@test ===(Circ_{Int}, Circ_{Int}.types[1])
abstract type Sup2a_ end
abstract type Sup2b_{A <: Sup2a_, B} <: Sup2a_ end
@test_throws ErrorException @eval abstract type Qux2_{T} <: Sup2b_{Qux2_{Int}, T} end # wrapped in eval to avoid #16793
# issue #21923
struct A21923{T,N}; v::Vector{A21923{T}}; end
@test fieldtype(A21923,1) == Vector{A21923{T}} where T
struct B21923{T,N}; v::Vector{B21923{T,M} where M}; end
@test fieldtype(B21923, 1) == Vector{B21923{T,M} where M} where T
struct C21923{T,N}; v::C21923{T,M} where M; end
@test fieldtype(C21923, 1) == C21923
struct D21923{T,N}; v::D21923{T}; end
@test fieldtype(D21923, 1) == D21923
# issue #22624, more circular definitions
struct T22624{A,B,C}; v::Vector{T22624{Int64,A}}; end
let ft = Base.datatype_fieldtypes
elT = T22624.body.body.body.types[1].parameters[1]
@test elT == T22624{Int64, T22624.var, C} where C
elT2 = ft(elT.body)[1].parameters[1]
@test elT2 == T22624{Int64, Int64, C} where C
@test ft(elT2.body)[1].parameters[1] === elT2
@test Base.isconcretetype(ft(elT2.body)[1])
end
#struct S22624{A,B,C} <: Ref{S22624{Int64,A}}; end
@test_broken @isdefined S22624
# issue #42297
mutable struct Node42297{T, V}
value::V
next::Union{Node42297{T, T}, Node42297{T, Val{T}}, Nothing}
Node42297{T}(value) where {T} = new{T, typeof(value)}(value, nothing)
end
@test fieldtype(Node42297{Int,Val{Int}}, 1) === Val{Int}
@test fieldtype(Node42297{Int,Int}, 1) === Int
# issue #3890
mutable struct A3890{T1}
x::Matrix{Complex{T1}}
end
@test A3890{Float64}.types[1] === Array{ComplexF64,2}
# make sure the field type Matrix{Complex{T1}} isn't cached
mutable struct B3890{T2}
x::Matrix{Complex{T2}}
end
@test B3890{Float64}.types[1] === Array{ComplexF64,2}
# issue #786
mutable struct Node{T}
v::Vector{Node}
end
@test ===(Node{Int}.types[1].parameters[1], Node)
mutable struct Node2{T}
v::Vector{Node2{T}}
end
@test ===(Node2{Int}.types[1].parameters[1], Node2{Int})
mutable struct FooFoo{A,B} y::FooFoo{A} end
@test FooFoo{Int} <: FooFoo{Int,AbstractString}.types[1]
let x = (2,3)
@test +(x...) == 5
end
# conversions
function fooo()
local x::Int8
x = 100
x
end
@test fooo() === convert(Int8,100)
function fooo_2()
local x::Int8
x = 100
end
@test fooo_2() === 100
function fooo_3()
local x::Int8
y = x = 100
@test isa(x,Int8)
y
end
@test fooo_3() === 100
let
function foo()
local x::Int8
function bar()
x = 100
end
bar()
x
end
@test foo() === convert(Int8,100)
end
function bar(x::T) where T
local z::Complex{T}
z = x
z
end
@test bar(3.0) == Complex(3.0,0.0)
z = convert(ComplexF64,2)
@test z == Complex(2.0,0.0)
function typeassert_instead_of_decl()
local x
x = 1
x::Float64
return 0
end
@test_throws TypeError typeassert_instead_of_decl()
y20327 = 1
@test_throws TypeError y20327::Float64
# misc
fib(n) = n < 2 ? n : fib(n-1) + fib(n-2)
@test fib(20) == 6765
# static parameters
sptest1(x::T, y::T) where {T} = 42
sptest1(x::T, y::S) where {T,S} = 43
@test sptest1(1,2) == 42
@test sptest1(1,"b") == 43
sptest2(x::T) where {T} = T
@test ===(sptest2(:a),Symbol)
sptest3(x::T) where {T} = y->T
let m = sptest3(:a)
@test ===(m(0),Symbol)
end
sptest4(x::T, y::T) where {T} = 42
sptest4(x::T, y) where {T} = 44
@test sptest4(1,2) == 42
@test sptest4(1, "cat") == 44
# closures
function clotest()
c = 0
function inc()
c += 1
end
function dec()
c -= 1
end
inc(); inc()
@test c == 2
dec()
@test c == 1
@test (()->c)() == 1
fibb(n) = n < 2 ? n : fibb(n-1)+fibb(n-2)
@test fibb(10) == 55
return (n->(c+=n), ()->c)
end
let T = clotest()
(inc, C) = T
inc(11)
@test C() == 12
end
Yc(f) = (h->f(x->h(h)(x)))(h->f(x->h(h)(x)))
yfib = Yc(fib->(n->(n < 2 ? n : fib(n-1) + fib(n-2))))
@test yfib(20) == 6765
function capt_before_def()
f() = y
y = 2
f
end
@test capt_before_def()() == 2
function i18408()
local i
return (x -> i)
end
let f = i18408()
@test_throws UndefVarError(:i) f(0)
end
# issue #23558
c23558(n,k) =
let fact(n) = if (n == 0) 1 else n*fact(n-1) end
fact(n)/fact(k)/fact(n-k)
end
@test c23558(10, 5) == 252
# issue #23996
function foo23996(xs...)
rets = []
bar(::Int) = push!(rets, 1)
foobar() = push!(rets, 3)
bar(::AbstractFloat) = push!(rets, 2)
bar(::Bool) = foobar()
for x in xs
bar(x)
end
rets
end
@test foo23996(1,2.0,false) == [1,2,3]
# variable scope, globals
glob_x = 23
function glotest()
global glob_x
glob_x = 24
loc_x = 8
function inner()
global loc_x = 10
glob_x = 88
end
function inner2()
local glob_x # override
global loc_x
glob_x = 2
@test glob_x == 2
@test loc_x == 10
end
inner()
inner2()
@test glob_x == 88
@test loc_x == 8
end
glotest()
@test glob_x == 88
@test loc_x == 10
# issue #7234
f7234_cnt = 0
begin
glob_x2 = 24
function f7234_a()
global f7234_cnt += 1
glob_x2 += 1
global f7234_cnt += -10000
end
end
@test_throws UndefVarError(:glob_x2) f7234_a()
@test f7234_cnt == 1
begin
global glob_x2 = 24
function f7234_b()
global f7234_cnt += 1
glob_x2 += 1
global f7234_cnt += -10000
end
end
@test_throws UndefVarError(:glob_x2) f7234_b()
@test f7234_cnt == 2
# globals can accessed if declared
for i = 1:2
global glob_x2 += 1
end
@test glob_x2 == 26
# globals declared as such in a non-global scope are inherited
let
global glob_x3 = 11
f7234_2() = (glob_x3 += 1)
f7234_2()
end
@test glob_x3 == 12
# interaction between local variable renaming and nested globals (#19333)
x19333 = 1
function f19333(x19333)
return let x19333 = x19333
g19333() = (global x19333 += 2)
g19333() + (x19333 += 1)
end + (x19333 += 1)
end
@test f19333(0) == 5
@test f19333(0) == 7
@test x19333 == 5
function h19333()
s = 0
for (i, j) in ((1, 2),)
s += i + j # use + as a global
end
for (k, +) in ((3, 4),)
s -= (k - +) # use + as a local
end
return s
end
@test h19333() == 4
# let - new variables, including undefinedness
let_undef_cnt = 0
function let_undef()
first = true
for i = 1:2
let x # new x
if first # not defined on second pass
x = 1
first = false
end
global let_undef_cnt += 1
x + 1
global let_undef_cnt += 23
end
end
end
@test_throws UndefVarError let_undef()
@test let_undef_cnt == 25
# const implies local in a local scope block
function const_implies_local()
let
x = 1
local y
let
# TODO: change back to `const` if that's ever allowed
local x = 0
y = x
end
x, y
end
end
@test const_implies_local() === (1, 0)
a_global_closure_vector = Vector{Any}(undef, 3)
for i = 1:3
let ii = i
a_global_closure_vector[i] = x -> x + ii
end
end
@test a_global_closure_vector[1](10) == 11
@test a_global_closure_vector[2](10) == 12
@test a_global_closure_vector[3](10) == 13
# issue #22032
let a = [], fs = []
for f() in 1:3
push!(a, f())
push!(fs, f)
end
@test a == [1,2,3]
@test [f() for f in fs] == [1,2,3]
end
let t = (22,33)
(g(), x) = t
@test g() == 22
@test x == 33
end
# issue #23091
let (f(), x) = (1, 2)
@test f() == 1
@test x == 2
end
# issue #21900
f21900_cnt = 0
function f21900()
for i = 1:1
x_global_undefined_error = 0
end
global f21900_cnt += 1
x_global_undefined_error # should be global
global f21900_cnt += -1000
nothing
end
@test_throws UndefVarError(:x_global_undefined_error) f21900()
@test f21900_cnt == 1
# use @eval so this runs as a toplevel scope block
@test_throws UndefVarError(:foo21900) @eval begin
for i21900 = 1:10
local bar21900
for j21900 = 1:10
foo21900 = 10
end
bar21900 = 0
bar21900 = foo21900 + 1
end
end
@test !@isdefined(foo21900)
@test !@isdefined(bar21900)
bar21900 = 0
@test_throws UndefVarError(:foo21900) @eval begin
for i21900 = 1:10
global bar21900
for j21900 = 1:10
foo21900 = 10
end
bar21900 = -1
bar21900 = foo21900 + 1
end
end
@test bar21900 == -1
@test !@isdefined foo21900
foo21900 = 0
@test nothing === begin
for i21900 = 1:10
global bar21900, foo21900
for j21900 = 1:10
foo21900 = 10
end
bar21900 = -1
bar21900 = foo21900 + 1
end
end
@test foo21900 == 10
@test bar21900 == 11
# ? syntax
@test (true ? 1 : false ? 2 : 3) == 1
# issue #7252
let
local a
1 > 0 ? a=2 : a=3
@test a == 2
1 < 0 ? a=2 : a=3
@test a == 3
end
# tricky space sensitive syntax cases
@test [-1 ~1] == [(-1) (~1)]
# undefinedness
mutable struct UndefField
field
UndefField() = new()
end
let
local a
a = UndefField()
@test !isdefined(a, :field)
@test !isdefined(a, :foo)
@test !isdefined(2, :a)
@test_throws TypeError isdefined(Base, 2)
@test_throws ArgumentError isdefined(2)
end
let
local a
a = Vector{Any}(undef, 2)
@test !isassigned(a,1) && !isassigned(a,2)
a[1] = 1
@test isassigned(a,1) && !isassigned(a,2)
a = Vector{Float64}(undef,1)
@test isassigned(a,1)
@test isassigned(a)
@test !isassigned(a,2)
a = Array{Float64}(undef, 2, 2, 2)
@test isassigned(a,1)
@test isassigned(a)
@test !isassigned(a,9)
a = Array{Float64}(undef, 1)
@test isassigned(a,1)
@test isassigned(a)
@test !isassigned(a,2)
a = Array{Float64}(undef, 2, 2, 2, 2)
@test isassigned(a,1)
@test isassigned(a)
@test !isassigned(a,17)
end
# isassigned, issue #11167
mutable struct Type11167{T,N} end
function count11167()
let cache = Type11167.body.body.name.cache
return count(!isnothing, cache)
end
end
@test count11167() == 0
Type11167{Int,2}
@test count11167() == 1
Type11167{Float32,5}
@test count11167() == 2
# dispatch
let
local foo, foo2, fooN, bar, baz
foo(x::Tuple{Vararg{Any}}) = 0
foo(x::Tuple{Vararg{Integer}}) = 1
@test foo((:a,)) == 0
@test foo(( 2,)) == 1
foo2(x::Vararg{Any,2}) = 2
@test foo2(1,2) == 2
@test_throws MethodError foo2(1)
@test_throws MethodError foo2(1,2,3)
fooN(A::Array{T,N}, x::Vararg{Any,N}) where {T,N} = -1
@test fooN([1,2], 1) == -1
@test_throws MethodError fooN([1,2], 1, 2) == -1
@test fooN([1 2; 3 4], 1, 2) == -1
@test_throws MethodError fooN([1 2; 3 4], 1)
@test_throws MethodError fooN([1 2; 3 4], 1, 2, 3)
bar(x::Tuple{T,T,T,T}) where {T} = 1
bar(x::Tuple{Any,Any,Any,Any})=2
@test bar((1,1,1,1)) == 1
@test bar((1,1,1,"a")) == 2
@test bar((:a,:a,:a,:a)) == 1
baz(::Type{Rational}) = 1
baz(::Type{Rational{T}}) where {T} = 2
@test baz(Rational) == 1
@test baz(Rational{Int}) == 2
end
let
local mytype
function mytype(vec)
convert(Vector{Tuple{String, DataType}}, vec)
end
some_data = Any[("a", Int32), ("b", Int32)]
@test isa(mytype(some_data),Vector{Tuple{String, DataType}})
end
mutable struct MyArray{N} <: AbstractArray{Int, N}
end
let
local x
x = MyArray{1}()
foob(x::AbstractArray) = 0
foob(x::AbstractVector{T}) where {T} = 1
@test foob(x) == 1
end
let
local f, g, a
f(a::Vector{Vector{T}}) where {T} = a
g(a::Vector{Vector{T}}) where {T} = a
a = Vector{Int}[]
@test ===(f(a), a)
@test ===(g(a), a)
end
mutable struct _AA{T}; a::T; end
_AoA{T} = _AA{_AA{T}}
let
local g, a
g(a::_AA{_AA{T}}) where {T} = a
a = _AA(_AA(1))
@test ===(g(a),a)
end
# dispatch using Val{T}. See discussion in #9452, #22475 for instances vs types
let
local firstlast
firstlast(::Val{true}) = "First"
firstlast(::Val{false}) = "Last"
@test firstlast(Val(true)) == "First"
@test firstlast(Val(false)) == "Last"
end
# x::Vararg{Any} declarations
let
local f1, f2, f3
f1(x...) = [x...]
f2(x::Vararg{Any}) = [x...]
f3(x::Vararg) = [x...]
@test f1(1,2,3) == [1,2,3]
@test f2(1,2,3) == [1,2,3]
@test f3(1,2,3) == [1,2,3]
end
# try/finally
begin
try_finally_glo_after = 0
try_finally_loc_after = 0
try_finally_glo_b = try
1+2
finally
# try_finally_loc_after = 1 # enable with #19324
global try_finally_glo_after = 1
end
@test try_finally_loc_after == 0
@test try_finally_glo_b == 3
@test try_finally_glo_after == 1
try_finally_glo_after = 0
gothere = 0
try
try
error(" ")
finally
# try_finally_loc_after = 1 # enable with #19324
global try_finally_glo_after = 1
end
global gothere = 1
catch
end
@test try_finally_loc_after == 0
@test try_finally_glo_after == 1
@test gothere == 0
try_finally_glo_after = 0
try_finally_glo_b = try
error(" ")
catch
42
finally
# try_finally_loc_after = 1 # enable with #19324
global try_finally_glo_after = 1
end
@test try_finally_loc_after == 0
@test try_finally_glo_b == 42
@test try_finally_glo_after == 1
global glo = 0
function retfinally()
try
return 5
finally
global glo = 18
end
end
@test retfinally() == 5
@test glo == 18
@test try error(); catch; end === nothing
end
# issue #12806
let i = 0, x = 0
for outer i = 1:10
try
break
finally
x = 1
end
end
@test i == 1
@test x == 1
end
let i = 1, a = []
while true
try
push!(a, i)
i += 1
i < 5 && continue
break
catch
push!(a, "catch")
finally
push!(a, "finally")
end
end
@test a == [1, "finally", 2, "finally", 3, "finally", 4, "finally"]
end
function _two_finally(n)
a = []
for i = 1:5
push!(a, i)
try
try
n == 1 && break
n == 2 && i > 1 && return [copy(a), a]
finally
push!(a, "finally 1")
end
finally
push!(a, "finally 2")
end
end
return a
end
@test _two_finally(1) == [1, "finally 1", "finally 2"]
@test _two_finally(2) == [[1, "finally 1", "finally 2", 2],
[1, "finally 1", "finally 2", 2, "finally 1", "finally 2"]]
let i = 0
caught = nothing
try
try
error("oops")
catch
throw(42)
finally
i = 1
end
catch e
caught = e
end
@test caught == 42
@test i == 1
end
let i = 0, a = []
for i = 1:2
try
continue
finally
push!(a, "finally")
end
push!(a, "oops")
end
@test a == ["finally", "finally"]
end
# test from #13660
let x = 0, y = 0, z = 0
for i = 1:2
try
i == 1 && continue
finally
x = 11
end
try
i == 2 && throw(42)
catch
break
finally
y = 12
end
end
for i = 1:2
try i == 1 && break
finally z = 13
end
end
@test x == 11
@test y == 12
@test z == 13
end
function test12806()
let catchb = false, catchc = false, catchr = false, a = []
for i in 1:3
try
throw("try err")
catch e
i == 1 && break
i == 2 && continue
i == 3 && return (catchb, catchc, catchr, a)
finally
i == 1 && (catchb = true; continue)
i == 2 && (catchc = true; )
i == 3 && (catchr = true; push!(a, 1))
end
end
end
end
@test test12806() == (true, true, false, [1])
# issue #24331
try
c24331 = 1
finally
end
@test !isdefined(@__MODULE__, :c24331)
function f24331()
try
x = [2]
finally
end
end
@test f24331() == [2]
# issue #26743
function f26743()
try
return 5
finally
end
end
@test @inferred(f26743()) == 5
# finalizers
let A = [1]
local x = 0
finalizer(a->(x+=1), A)
finalize(A)
@test x == 1
A = 0
GC.gc(); GC.gc()
@test x == 1
end
# Module() constructor
@test names(Module(:anonymous), all = true, imported = true) == [:anonymous]
@test names(Module(:anonymous, false), all = true, imported = true) == [:anonymous]
@test Module(:anonymous, false, true).Core == Core
@test_throws UndefVarError Module(:anonymous, false, false).Core
# exception from __init__()
let didthrow =
try
include_string(
@__MODULE__,
"""
module TestInitError
__init__() = error()
end
""")
false
catch ex
@test isa(ex, LoadError)
@test isa(ex.error, InitError)
true
end
@test didthrow
end
# issue #7307
function test7307(a, ret)
try
try
ret && return a
finally
push!(a, "inner")
end
finally
push!(a, "outer")
end
return a
end
@test test7307([], true) == ["inner","outer"]
@test test7307([], false) == ["inner","outer"]
# issue #8277
function test8277(a)
i = 0
for j=1:2
try
if i == 0
push!(a,0)
end
i += 1
error()
catch
end
end
end
let a = []
test8277(a)
@test length(a) == 1
end
# chained and multiple assignment behavior (issue #2913)
let
local x, a, b, c, d, e
x = (a,b,b,b,e) = (1,2,3,4,5)
@test x === (1,2,3,4,5)
@test a == 1
@test b == 4
@test e == 5
x = (a,b,b,e) = (1,2,3,4,5)
@test x === (1,2,3,4,5)
@test a == 1
@test b == 3
@test e == 4
a = complex(1,2)
b = 3
b, a = a.re, b
@test b == 1
@test a == 3
a = complex(1,2)
b = 3
a, b = b, a.re
@test a == 3
@test b == 1
end
# accessing fields by index
mutable struct TestMutable
file::String
line::Int
error
end
let
local z = complex(3, 4)
v = Int[0, 0]
for i = 1:2
v[i] = getfield(z, i)
end
@test v == [3, 4]
@test_throws BoundsError(z, -1) getfield(z, -1)
@test_throws BoundsError(z, 0) getfield(z, 0)
@test_throws BoundsError(z, 3) getfield(z, 3)
end
let strct = LoadError("yofile", 0, "bad")
@test nfields(strct) == 3 # sanity test
@test_throws BoundsError(strct, 10) getfield(strct, 10)
@test_throws ErrorException("setfield!: immutable struct of type LoadError cannot be changed") setfield!(strct, 0, "")
@test_throws ErrorException("setfield!: immutable struct of type LoadError cannot be changed") setfield!(strct, 4, "")
@test_throws ErrorException("setfield!: immutable struct of type LoadError cannot be changed") setfield!(strct, :line, 0)
@test strct.file == "yofile"
@test strct.line === 0
@test strct.error == "bad"
@test getfield(strct, 1) == "yofile"
@test getfield(strct, 2) === 0
@test getfield(strct, 3) == "bad"
end
let mstrct = TestMutable("melm", 1, nothing)
@test Base.setproperty!(mstrct, :line, 8.0) === 8
@test mstrct.line === 8
@test_throws TypeError(:setfield!, "", Int, 8.0) setfield!(mstrct, :line, 8.0)
@test_throws TypeError(:setfield!, "", Int, 8.0) setfield!(mstrct, 2, 8.0)
@test setfield!(mstrct, 3, "hi") == "hi"
@test mstrct.error == "hi"
@test setfield!(mstrct, 1, "yo") == "yo"
@test mstrct.file == "yo"
@test_throws BoundsError(mstrct, 10) getfield(mstrct, 10)
@test_throws BoundsError(mstrct, 0) setfield!(mstrct, 0, "")
@test_throws BoundsError(mstrct, 4) setfield!(mstrct, 4, "")
end
let strct = LoadError("yofile", 0, "bad")
@test_throws(ErrorException("setfield!: immutable struct of type LoadError cannot be changed"),
ccall(:jl_set_nth_field, Cvoid, (Any, Csize_t, Any), strct, 0, ""))
end
let mstrct = TestMutable("melm", 1, nothing)
@test_throws(BoundsError(mstrct, 4),
ccall(:jl_set_nth_field, Cvoid, (Any, Csize_t, Any), mstrct, 3, ""))
end
# test getfield-overloading
function Base.getproperty(mstrct::TestMutable, p::Symbol)
return (p, getfield(mstrct, :error))
end
function Base.setproperty!(mstrct::TestMutable, p::Symbol, v)
return setfield!(mstrct, :error, (p, v))
end
let
mstrct = TestMutable("melm", 1, nothing)
@test mstrct.line === (:line, nothing)
@test mstrct.bar === (:bar, nothing)
@test getfield(mstrct, 1) == "melm"
@test getfield(mstrct, :file) == "melm"
@test_throws MethodError Base.getproperty(mstrct, 1)
mstrct.error = 8.0
@test mstrct.bar === (:bar, (:error, 8.0))
mstrct.line = 8.0
@test getfield(mstrct, :line) === 1
@test getfield(mstrct, :error) === (:line, 8.0)
@test mstrct.bar === (:bar, (:line, 8.0))
@test mstrct.error === (:error, (:line, 8.0))
end
struct S29761
x
end
function S29761_world(i)
x = S29761(i)
@eval function Base.getproperty(x::S29761, sym::Symbol)
return sym => getfield(x, sym)
end
# ensure world updates are handled correctly for simple x.y expressions:
return x.x, @eval($x.x), x.x
end
@test S29761_world(1) == (1, :x => 1, 1)
# allow typevar in Union to match as long as the arguments contain
# sufficient information
# issue #814
let
local MatOrNot, my_func, M
MatOrNot{T} = Union{AbstractMatrix{T}, Vector{Union{}}}
my_func(A::MatOrNot{T}, B::MatOrNot{T}, C::MatOrNot{T}) where {T<:Real} = 0
M = [ 2. 1. ; 1. 1. ]
@test my_func(Union{}[], M, M) == 0
end
let
local my_func, a, c
my_func(P::Vector{T}, Q::Vector{T}) where {T} = 0
my_func(x::T, P::Vector{T}) where {T} = 1
my_func(P::Vector{T}, x::T) where {T} = 2
a = Int[3]
c = Vector[a]
@test my_func(c,c)==0
@test my_func(a,c)==1
end
let
local baar, foor, boor
# issue #1131
baar(x::DataType) = 0
baar(x::Union) = 1
baar(x::UnionAll) = 2
@test baar(StridedArray) == 2
@test baar(Base.unwrap_unionall(StridedArray)) == 1
@test baar(Vector) == 2
@test baar(Vector.body) == 0
boor(x) = 0
boor(x::Union) = 1
@test boor(StridedArray) == 0
@test boor(Base.unwrap_unionall(StridedArray)) == 1
# issue #1202
foor(x::Union) = 1
@test_throws MethodError foor(StridedArray)
@test foor(Base.unwrap_unionall(StridedArray)) == 1
@test_throws MethodError foor(StridedArray)
end
# issue #22842
f22842(x::UnionAll) = UnionAll
f22842(x::DataType) = length(x.parameters)
@test f22842(Tuple{Vararg{Int64}}) == 1
@test f22842(Tuple{Vararg{Int64,N}} where N) === UnionAll
# issue #1153
mutable struct SI{m, s, kg}
value::AbstractFloat
end
import Base.*
*(x::SI{m1, s1, kg1}, y::SI{m2, s2, kg2}) where {m1, m2, s1, s2, kg1, kg2} = SI{m1 + m2, s1 + s2, kg1 + kg2}(x.value * y.value)
let
local a,b
a = SI{0,0,1}(1.0) * SI{1,2,0}(2.0)
b = SI{0,0,1}(1.0) * SI{1,-2,0}(2.0)
@test typeof(a) === SI{1,2,1}
@test typeof(b) === SI{1,-2,1}
end
# pointer arithmetic
let
local a,b,c
a = C_NULL
b = C_NULL + 1
c = C_NULL - 1
d = 1 + C_NULL
@test eltype(a) == Nothing
@test a != b != c
@test b == d
@test UInt(a) == 0
@test UInt(b) == 1
@test UInt(c) == typemax(UInt)
@test b - a == -(a - b) == 1
@test c - a == -(a - c) == typemax(UInt)
@test c - b == -(b - c) == typemax(UInt) - 1
@test a < b < c
end
# pull request 1270
let
local a,p, a2,p2
a = [11,12,13]
p = pointer(a)
@test unsafe_load(p, 1) == 11
unsafe_store!(p, 99, 2)
@test a == [11,99,13]
a2 = Any[101,102,103]
p2 = pointer(a2)
@test unsafe_load(p2) == 101
unsafe_store!(p2, 909, 3)
@test a2 == [101,102,909]
end
@test unsafe_pointer_to_objref(ccall(:jl_call1, Ptr{Cvoid}, (Any,Any),
x -> x+1, 314158)) == 314159
let x = [1,2,3]
@test unsafe_pointer_to_objref(pointer_from_objref(x)) == x
@test unsafe_pointer_to_objref(pointer_from_objref(x)) === x
end
let
local a, aa
a = [1,2,3]
aa = unsafe_wrap(Array, pointer(a), length(a))
@test aa == a
aa = unsafe_wrap(Array, pointer(a), (length(a),))
@test aa == a
aa = unsafe_wrap(Array, pointer(a), UInt(length(a)))
@test aa == a
aa = unsafe_wrap(Array, pointer(a), UInt16(length(a)))
@test aa == a
aaa = unsafe_wrap(Array, pointer(a), (1, 1))
@test size(aaa) == (1, 1)
@test aaa[1] == a[1]
@test_throws InexactError unsafe_wrap(Array, pointer(a), -3)
# Misaligned pointer
res = @test_throws ArgumentError unsafe_wrap(Array, pointer(a) + 1, length(a))
@test occursin("is not properly aligned to $(sizeof(Int)) bytes", res.value.msg)
res = @test_throws ArgumentError unsafe_wrap(Array, pointer(a) + 1, (1, 1))
@test occursin("is not properly aligned to $(sizeof(Int)) bytes", res.value.msg)
res = @test_throws MethodError unsafe_wrap(Vector{UInt8}, pointer(Int32[1]), (sizeof(Int32),))
end
struct FooBar2515
foo::Int
bar::Int
end
let
local X, p
X = FooBar2515[ FooBar2515(3,1), FooBar2515(4,4) ]
p = pointer(X)
@test unsafe_load(p) == FooBar2515(3,1)
@test unsafe_load(p, 2) == FooBar2515(4,4)
unsafe_store!(p, FooBar2515(8,4))
@test X[1] == FooBar2515(8,4)
unsafe_store!(p, FooBar2515(7,3), 1)
@test X[1] == FooBar2515(7,3)
end
# issue #1287, combinations of try, catch, return
let
local f, g
function f()
try
return 1
catch
end
end
@test f() == 1
function g()
try
error("badness")
catch
return 2
end
end
@test g() == 2
end
# issue #1442
mutable struct S1442{T}
end
let
local f1442
f1442(::DataType) = 1
f1442(::Type{S1442{T}}) where {T} = 2
@test f1442(S1442{Int}) == 2
@test f1442(DataType) == 1
end
# issue #1727
abstract type Component end
mutable struct Transform <: Component
x
y
z
Transform() = new(0, 0, 0)
end
mutable struct Body <: Component
vel
curr_force
Body() = new(0, 0)
end
function NewEntity(components::Type{T}...) where T<:Component
map((c)->c(), components)
end
@test_throws MethodError NewEntity(Transform, Transform, Body, Body)
@test isa(NewEntity(Transform, Transform), Tuple{Transform, Transform})
@test_throws MethodError NewEntity(Transform, Transform, Body, Body)
# issue #1826
let
a = (1,2)
a,b = a
@test a==1 && b==2
end
@testset "issue #1876" begin
let
tst = 1
m1(i) = (tst+=1;i-1)
x = [1:4;]
x[1:end] *= 2
@test x == [2:2:8;]
x[m1(end)] += 3
@test x == [2,4,9,8]
@test tst == 2
# issue #1886
X = [1:4;]
r = Vector{UnitRange{Int}}(undef, 1)
r[1] = 2:3
X[r...] *= 2
@test X == [1,4,6,4]
end
end
# issue #1632
let
f1632(::R, ::S) where {R,S} = 1
f1632(::T, ::T) where {T} = 2
@test f1632(1, 2) == 2
@test f1632(:a, 2) == 1
g1632(::T, ::T) where {T} = 2
g1632(::R, ::S) where {R,S} = 1
@test g1632(1, 2) == 2
@test g1632(:a, 2) == 1
end
# issue #2098
let
i2098() = begin
c = Any[2.0]
[1:1:c[1];]
end
@test isequal(i2098(), [1.0,2.0])
end
# issue #2161
let
i2161_1() = promote(2,2,2.0,2)
i2161_2() = i2161_1()[1]
@test i2161_2() === 2.0
end
# issue #2169
let
i2169(a::Array{T}) where {T} = typemin(T)
@test invoke(i2169, Tuple{Array}, Int8[1]) === Int8(-128)
end
# issue #44227
struct F{T} end
F{Int32}(; y=1) = 1
F{Int64}(; y=1) = invoke(F{Int32}, Tuple{}; y)
@test F{Int64}() === 1
# issue #2365
mutable struct B2365{T}
v::Union{T, Nothing}
end
@test B2365{Int}(nothing).v === nothing
@test B2365{Int}(0).v === 0
# issue #2352
let
local Sum, n
Sum=0.0; for n=1:2:10000
Sum += -1/n + 1/(n+1)
end
@test Sum < -0.69
end
# issue #2509
struct Foo2509; foo::Int; end
@test Foo2509(1) != Foo2509(2)
@test Foo2509(42) == Foo2509(42)
# issue #2517
struct Foo2517; end
@test repr(Foo2517()) == "$(curmod_prefix)Foo2517()"
@test repr(Vector{Foo2517}(undef, 1)) == "[$(curmod_prefix)Foo2517()]"
@test Foo2517() === Foo2517()
# issue #1474
mutable struct X1474{a,b} end
let
local Y
Y(::Type{X1474{A,B}}) where {A,B} = 1
Y(::Type{X1474{A}}) where {A} = 2
Y(::Type{X1474}) = 3
@test Y(X1474) == 3
@test Y(X1474{Int}) == 2
@test Y(X1474{Int,AbstractString}) == 1
end
# issue #2562
mutable struct Node2562{T}
value::T
Node2562{T}(value::T) where T = new(value)
end
Node2562(value::T, args...) where {T} = Node2562{T}(value, args...)
makenode2562(value) = Node2562(value)
@test isa(Node2562(0), Node2562)
@test isa(makenode2562(0), Node2562)
# issue #2619
mutable struct I2619{T}
v::T
I2619{T}(v) where T = new(convert(T,v))
end
bad2619 = false
function i2619()
global e2619 = try
I2619{Float64}(0.0f)
global bad2619 = true
catch _e
_e
end
end
i2619()
@test !bad2619
@test isa(e2619,UndefVarError) && e2619.var === :f
# issue #2919
const Foo2919 = Int
mutable struct Baz2919; Foo2919::Foo2919; end
@test Baz2919(3).Foo2919 === 3
# issue #2982
module M2982
abstract type U end
macro bad(Y)
quote
mutable struct $(esc(Y)) <: U
end
end
end
export @bad
end
@M2982.bad(T2982)
@test T2982.super === M2982.U
# issue #3221
let x = fill(nothing, 1)
@test_throws MethodError x[1] = 1
end
# issue #3220
function x3220()
a = [1]
a::Vector{Int} += [1]
end
@test x3220() == [2]
# issue #3471
function f3471(y)
convert(Vector{typeof(y[1])}, y)
end
@test isa(f3471(Any[1.0,2.0]), Vector{Float64})
# issue #3729
A3729{B} = Vector{Vector{B}}
C3729{D} = Vector{Vector{D}}
@test Vector{Vector{Int}} === A3729{Int} === C3729{Int}
# issue #3789
x3789 = 0
while(all([false for idx in 1:10]))
global x3789 = 1
end
@test x3789 == 0
# issue #3852
function f3852()
local x
for i = 1:10
x = identity
end
x("hi")
end
@test f3852() == "hi"
# issue #3821
function f3821()
p = []
[x for x in p]
end
@test isa(f3821(), Array)
# issue #4075
struct Foo4075
x::Int64
y::Float64
end
function foo4075(f::Foo4075, s::Symbol)
x = getfield(f,s)
GC.gc()
x
end
@test isa(foo4075(Foo4075(Int64(1),2.0),:y), Float64)
# very likely to segfault the second time if this is broken
@test isa(foo4075(Foo4075(Int64(1),2.0),:y), Float64)
# issue #3167
let
function foo(x)
ret=Vector{typeof(x[1])}(undef, length(x))
for j = 1:length(x)
ret[j] = x[j]
end
return ret
end
x = Vector{Union{Dict{Int64,AbstractString},Array{Int64,3},Number,AbstractString,Nothing}}(undef, 3)
x[1] = 1.0
x[2] = 2.0
x[3] = 3.0
@test foo(x) == [1.0, 2.0, 3.0]
end
# issue #4115
mutable struct Foo4115 end
const Foo4115s = NTuple{3, Union{Foo4115, Type{Foo4115}}}
baz4115(x::Foo4115s) = x
let t = (Foo4115, Foo4115, Foo4115())
@test_throws MethodError baz4115(t)
end
# issue #4129
mutable struct Foo4129; end
abstract type Bar4129 end
mutable struct Bar41291 <: Bar4129
f::Foo4129
end
mutable struct Bar41292 <: Bar4129
f::Foo4129
end
mutable struct Baz4129
b::Bar4129
end
foo4129(a::Baz4129,c::Foo4129,b::Bar4129,@nospecialize(x),y) = (a,b,c,x,y)
foo4129(a::Baz4129,b::Bar41291,args...) = foo4129(a,b.f,b,args...)
foo4129(a::Baz4129,b::Bar41292,args...) = foo4129(a,b.f,b,args...)
foo4129(a::Baz4129,args...) = foo4129(a,a.b,args...)
@test isa(foo4129(Baz4129(Bar41291(Foo4129())),1,2), Tuple{Baz4129,Bar4129,Foo4129,Int,Int})
# issue #4141
mutable struct Vertex4141{N,T}; end
mutable struct Face4141{V}; end
mutable struct Hull4141{F<:Face4141}; end
g4141(N,T) = Hull4141{Face4141{Vertex4141{N,T}}}()
@test isa(g4141(4,Int), Hull4141{Face4141{Vertex4141{4,Int}}})
# issue #4154
mutable struct MyType4154{T}
a1::T
a2
end
foo4154(x) = MyType4154(x, [])
h4154() = typeof(foo4154(rand(2,2,2)))
g4154() = typeof(foo4154(rand(2,2,2,2,2,2,2,2,2)))
@test h4154() === MyType4154{Array{Float64,3}}
@test g4154() === MyType4154{Array{Float64,9}}
# issue #4208
mutable struct a4208
a4208
end
@test isa(a4208(5),a4208)
mutable struct b4208
b4208() = (local b4208=1;new())
end
@test isa(b4208(),b4208)
# make sure convert_default error isn't swallowed by typeof()
convert_default_should_fail_here() = similar([1],typeof(zero(typeof(rand(2,2)))))
@test_throws MethodError convert_default_should_fail_here()
# issue #4343
@test_throws ErrorException Array{Float64}{Int, 2}
mutable struct Foo4376{T}
x
Foo4376{T}(x::T) where T = new(x)
Foo4376{T}(a::Foo4376{Int}) where T = new(a.x)
end
@test isa(Foo4376{Float32}(Foo4376{Int}(2)), Foo4376{Float32})
mutable struct _0_test_ctor_syntax_
_0_test_ctor_syntax_(files::Vector{T},step) where {T<:AbstractString} = 0
end
# issue #4413
mutable struct A4413 end
mutable struct B4413 end
mutable struct C4413 end
f4413(::Union{A4413, B4413, C4413}) = "ABC"
f4413(::Union{A4413, B4413}) = "AB"
g4413(::Union{A4413, C4413}) = "AC"
g4413(::Union{A4413, B4413, C4413}) = "ABC"
@test f4413(A4413()) == "AB" && f4413(B4413()) == "AB"
@test g4413(A4413()) == "AC" && g4413(C4413()) == "AC"
# issue #4482
# what happens here: the method cache logic wants to widen the type of a
# tuple argument, but it shouldn't do that for an argument that a static
# parameter depends on.
f4482(x::T) where {T} = T
@test f4482((Ptr,Ptr)) === Tuple{UnionAll,UnionAll}
@test f4482((Ptr,)) === Tuple{UnionAll,}
# issue #4486
try
# note: this test expression must run at the top level,
# in the interpreter.
(function() end)(1)
# should throw an argument count error
@test false
catch
end
# issue #4526
f4526(x) = isa(x.a, Nothing)
@test_throws ErrorException f4526(1)
@test_throws ErrorException f4526(im)
@test_throws ErrorException f4526(1+2im)
# issue #4528
function f4528(A, B)
if A
reinterpret(UInt64, B)
end
end
@test f4528(false, Int32(12)) === nothing
@test_throws ErrorException f4528(true, Int32(12))
# issue #4518
f4518(x, y::Union{Int32,Int64}) = 0
f4518(x::String, y::Union{Int32,Int64}) = 1
@test f4518("",1) == 1
# issue #4645
i4645(x) = (println(zz); zz = x; zz)
@test_throws UndefVarError i4645(4)
# more undef var errors
function test_undef_var_9898(a)
a1 = a1
a
end
@test_throws UndefVarError test_undef_var_9898(1)
# issue #4505
let
g4505(::X) where {X} = 0
@test g4505(0) == 0
end
@test !@isdefined g4505
@test !isdefined(@__MODULE__, :g4505)
# issue #4681
# ccall should error if convert() returns something of the wrong type
mutable struct Z4681
x::Ptr{Cvoid}
Z4681() = new(C_NULL)
end
Base.unsafe_convert(::Type{Ptr{Z4681}},b::Z4681) = b.x
@test_throws TypeError ccall(:printf,Int,(Ptr{UInt8},Ptr{Z4681}),"",Z4681())
# issue #4479
f4479(::Real,c) = 1
f4479(::Int, ::Int, ::Bool) = 2
f4479(::Int, x, a...) = 0
@test f4479(1,1,true) == 2
# issue #4688
a4688(y) = "should be unreachable by calling b"
b4688(y) = "not an Int"
begin
a4688(y::Int) = "an Int"
let x = true
global b4688(y::Int) = x == true ? a4688(y) : a4688(y)
end
end
@test b4688(1) == "an Int"
# issue #4731
mutable struct SIQ{A,B} <: Number
x::A
end
import Base: promote_rule
promote_rule(A::Type{SIQ{T,T2}},B::Type{SIQ{S,S2}}) where {T,T2,S,S2} = SIQ{promote_type(T,S)}
@test promote_type(SIQ{Int},SIQ{Float64}) == SIQ
f4731(x::T...) where {T} = ""
f4731(x...) = 0
g4731() = f4731()
@test f4731() == ""
@test g4731() == ""
# issue #4675
f4675(x::StridedArray...) = 1
f4675(x::StridedArray{T}...) where {T} = 2
@test f4675(zeros(50,50), zeros(50,50)) == 2
g4675(x::StridedArray{T}...) where {T} = 2
g4675(x::StridedArray...) = 1
@test g4675(zeros(50,50), zeros(50,50)) == 2
# issue #4771
module Lib4771
export @make_closure
macro make_closure()
quote
f = (x)->1
end
end
end # module
@test (Lib4771.@make_closure)(0) == 1
# issue #4805
abstract type IT4805{N, T} end
let
test0(::Type{IT4805{1, T}}, x) where {T <: Int64} = x
test1() = test0(IT4805{1, Int64}, 1)
test2() = test0(IT4805{1+0, Int64}, 1)
test3(n) = test0(IT4805{n, Int64}, 1)
@test test1() == 1
@test test2() == 1
@test test3(1) == 1
@test_throws MethodError test3(2)
end
# issue #4873
macro myassert4873(ex)
:($ex ? nothing : error("Assertion failed: ", $(string(ex))))
end
x4873 = 1
@myassert4873 (x -> x)(x4873) == 1
# issue from IRC
function invalid_tupleref()
A = (1, "2", 3.0)
try
return A[0]
catch
return true
end
end
@test invalid_tupleref()==true
# issue #5150
f5150(T) = Vector{Rational{T}}(undef, 1)
@test typeof(f5150(Int)) === Vector{Rational{Int}}
# issue #5165
primitive type T5165{S} 64 end
make_t(x::Int64) = Core.Intrinsics.bitcast(T5165{Nothing}, x)
xs5165 = T5165[make_t(Int64(1))]
b5165 = IOBuffer()
for x in xs5165
println(b5165, x) # segfaulted
end
# issue #31486
f31486(x::Bool, y::Bool, z::Bool) = Core.Intrinsics.bitcast(UInt8, Core.Intrinsics.add_int(x, Core.Intrinsics.add_int(y, z)))
@test f31486(false, false, true) == 0x01
@test f31486(false, true, true) == 0x00
@test f31486(true, true, true) == 0x01
# support tuples as type parameters
mutable struct TupleParam{P}
x::Bool
end
tupledispatch(a::TupleParam{(1,:a)}) = a.x
tupledispatch(a::TupleParam{(1,(:a,))}) = 42
# tuples can be used as type params
let t1 = TupleParam{(1,:a)}(true),
t2 = TupleParam{(1,:b)}(true)
# tuple type params can't contain invalid type params
@test_throws TypeError t3 = TupleParam{(1,"nope")}(true)
# dispatch works properly
@test tupledispatch(t1) == true
@test_throws MethodError tupledispatch(t2)
@test tupledispatch(TupleParam{(1,(:a,))}(true)) === 42
@test_throws TypeError TupleParam{NamedTuple{(:a,), Tuple{Any}}((1,))}
@test_throws TypeError Val{NamedTuple{(:a,), Tuple{NamedTuple{<:Any,Tuple{Int}}}}(((x=2,),))}
end
# issue #5254
f5254(::Type{T}, b::T) where {T} = 0
f5254(a, b) = 1
@test f5254(Bottom, 1) == 1
# evaluate arguments left-to-right, including assignments. issue #4990
let i = 0, x = 65
@test (i, i+=1, i+=1) === (0, 1, 2)
@test i == 2
@test [x, x|=0x20] == [65, 97]
end
# issue #5312
let
local x = 0
global incr5312, foo5312
incr5312() = (x+=1; nothing)
foo5312() = (incr5312(),)
@test foo5312() === (nothing,)
@test x == 1
end
# issue #5319
cnvt(T, x) = convert_default(T, x, cnvt)
cnvt(::Type{Array{S, N}}, x::Array{T, N}) where {S, T, N} = convert(Array{S}, x)
function tighttypes!(adf)
T = Bottom
tt = Any[Int]
for t in tt
T = typejoin(T, t)
end
cnvt(Vector{T}, adf[1])
end
@test isequal(tighttypes!(Any[Any[1.0,2.0],]), [1,2])
# issue #5142
primitive type Int5142 64 end
function h5142(a::Bool)
x=a ? (Int64(0),reinterpret(Int5142,Int64(0))) : (Int64(1),reinterpret(Int5142,Int64(1)))
x[2]::Int5142
end
function h5142(a::Int)
x=(Int64(0),reinterpret(Int5142,Int64(0)))
x[a]::Int5142
end
h5142(true)
@test_throws TypeError h5142(1)
h5142(2)
f5142() = h5142(1)
try
# try running this code in a different context that triggers the codegen
# assertion `assert(isboxed || v.typ == typ)`.
f5142()
catch
end
primitive type Int5142b 8 end
function h5142b(a::Int)
x=((Int8(1),Int8(2)),(reinterpret(Int5142b,Int8(3)),reinterpret(Int5142b,Int8(4))))
x[a]::Tuple{Int8,Int8}
end
h5142b(1)
@test_throws TypeError h5142b(2)
# accessing bits tuples of structs
function test_bits_tuples()
a = (complex(1,2),complex(1,3));s=0
for i=1:10
s += a[rand(1:2)]
end
s
end
@test real(test_bits_tuples()) == 10
# issue #5374
mutable struct FileObj5374
io::IO
end
function read_file5374(fileobj)
read(fileobj.io, Float32)
end
@test isa(read_file5374(FileObj5374(IOBuffer(UInt8[0,0,0,0]))), Float32)
# issue #5457
function f5457(obj_ptr::Ptr{Float64}, f)
new_obj = convert(Float64, f(1.0))
unsafe_store!(obj_ptr, new_obj)
return Int32(1)
end
let
a = [1.0]
f5457(pointer(a,1), sin)
end
# issue #5584
# this is an intermittent memory bug, but this code is very likely to trigger it
mapshape_5584(s1::NTuple{N,Int}, s2::NTuple{N,Int}) where {N} =
(s1 == s2 || error("Argument dimensions are not map-compatible."); s1)
function f5584()
for i = 1:1000000
a = rand(1:1000, 3)
# the bug was a failure to root these tuples
mapshape_5584(tuple(a...), tuple(a...))
end
end
f5584()
# issue #5884
mutable struct Polygon5884{T<:Real}
points::Vector{Complex{T}}
end
function test5884()
star = Vector{Polygon5884}(undef, (3,))
star[1] = Polygon5884([Complex(1.0,1.0)])
p1 = star[1].points[1]
@test p1 == Complex(1.0,1.0)
@test p1.re == 1.0
@test star[1].points[1].re == 1.0
end
test5884()
# issue #5924
let
function test5924()
func = function () end
func
end
@test test5924()() === nothing
end
# issue #6031
macro m6031(x); x; end
@test @m6031([2,4,6])[3] == 6
@test (@m6031 [2,4,6])[2] == 4
# issue #6068
x6068 = 1
function test6068()
local a
while true
a = x6068
break
end
a + 1
end
@test test6068() == 2
# issue #6074
macro X6074()
quote
global x6074
let x6074 = x6074
x6074
end
end
end
x6074 = 6074
@test @X6074() == 6074
# issue #5536
test5536(a::Union{Real, AbstractArray}...) = "Splatting"
test5536(a::Union{Real, AbstractArray}) = "Non-splatting"
@test test5536(5) == "Non-splatting"
# multiline comments (#6139 and others raised in #6128) and embedded NUL chars (#10994)
@test 3 ==
include_string(@__MODULE__, "1 + 2") ==
include_string(@__MODULE__, "1 + #==# 2") ==
include_string(@__MODULE__, "1 + #===# 2") ==
include_string(@__MODULE__, "1 + #= #= blah =# =# 2") ==
include_string(@__MODULE__, "1 + #= #= #= nested =# =# =# 2") ==
include_string(@__MODULE__, "1 + #= \0 =# 2")
@test_throws LoadError include_string(@__MODULE__, "#=")
@test_throws LoadError include_string(@__MODULE__, "#= #= #= =# =# =")
# issue #6142
import Base: +
import LinearAlgebra: UniformScaling, I
mutable struct A6142 <: AbstractMatrix{Float64}; end
+(x::A6142, y::UniformScaling) = "UniformScaling method called"
+(x::A6142, y::AbstractArray) = "AbstractArray method called"
@test A6142() + I == "UniformScaling method called"
+(x::A6142, y::AbstractRange) = "AbstractRange method called" #16324 ambiguity
# issue #6175
function g6175(); GC.safepoint(); (); end
g6175(i::Real, I...) = g6175(I...)
g6175(i, I...) = tuple(length(i), g6175(I...)...)
@test g6175(1:5) === (5,)
# issue #6242
f6242(x::NTuple{N,Int}) where {N} = (N==0 ? 1 : ntuple(n->x[n],N))
@test f6242(()) === 1
# issue #6292
let i = 0
global g6292() = i+=1
end
@test g6292() == 1
@test g6292() == 2
# issue #6404
mutable struct type_2{T <: Integer, N} <: Number
x::T
type_2{T,N}(n::T) where {T<:Integer,N} = new(n)
end
mutable struct type_1{T <: Number} <: Number
x::Vector{T}
type_1{T}(x::Vector{T}) where T<:Number = new(x)
end
type_1(x::Vector{T}) where {T <: Number} = type_1{T}(x)
type_1(c::T) where {T <: Number} = type_1{T}([c])
Base.convert(::Type{type_1{T}}, x::S) where {T<:Number, S<:Number} = type_1(convert(T, x))
+(a::type_1{T}, b::type_1{T}) where {T <: Number} = a
function func1_6404(v1::Integer)
e1 = type_1([type_2{Int,v1}(0)])
e1+e1
end
@test isa(func1_6404(3), type_1)
# issue #5577
f5577(::Any) = false
f5577(::Type) = true
@test !f5577((Int,AbstractString,2))
@test !f5577(((Int,AbstractString),AbstractString))
@test f5577(Tuple{Tuple{Int,AbstractString},AbstractString})
@test f5577(Int)
@test !f5577(2)
# issue #6426
f6426(x,args...) = f6426(x,map(a->(isa(a,Type) ? Type{a} : typeof(a)), args))
f6426(x,t::Tuple{Vararg{Type}}) = string(t)
@test f6426(1, (1.,2.)) == "(Tuple{Float64, Float64},)"
# issue #6502
f6502() = convert(Tuple{Vararg{Int}}, (10,))
@test f6502() === (10,)
@test convert(Tuple{Bool,Vararg{Int}}, (true,10)) === (true,10)
@test convert(Tuple{Int,Vararg{Bool}}, (true,1,0)) === (1,true,false)
# issue #6611
function crc6611(spec)
direcn = spec ? 1 : 2
local remainder::blech
()->(remainder=1)
end
@test_throws UndefVarError crc6611(true)()
# issue #6634
function crc6634(spec)
A = UInt
remainder::A = 1
function handler(append)
remainder = append ? 1 : 2
end
end
@test crc6634(0x1)(true) == 1
@test crc6634(0x1)(false) == 2
# issue #5876
module A5876
macro x()
quote
function $(esc(:f5876))(::Type{T}) where T
T
end
42
end
end
end
let
local z = A5876.@x()
@test z == 42
@test f5876(Int) === Int
end
# issue #20524
macro m20524(ex)
quote
global f20524
function f20524()
$ex
end
end
end
@m20524 ((a,(b20524,c)) = (8,(1,5)); (a,b20524,c))
@test f20524() === (8,1,5)
@test !@isdefined b20524 # should not assign to a global
# issue #6387
primitive type Date6387{C} 64 end
mutable struct DateRange6387{C} <: AbstractRange{Date6387{C}}
end
mutable struct ObjMember
member::DateRange6387
end
obj6387 = ObjMember(DateRange6387{Int64}())
function v6387(r::AbstractRange{T}) where T
a = Vector{T}(undef, 1)
a[1] = Core.Intrinsics.bitcast(Date6387{Int64}, Int64(1))
return a
end
function day_in(obj::ObjMember)
x = v6387(obj.member)
@test isa(x, Vector{Date6387{Int64}})
@test isa(x[1], Date6387{Int64})
end
day_in(obj6387)
# issue #6784
@test ndims(Array{Array{Float64}}(undef, 3,5)) == 2
@test ndims(Array{Array}(undef, 3,5)) == 2
# issue #6793
function segfault6793(;gamma=1)
A = 1
B = 1
GC.safepoint()
return
-gamma
nothing
end
@test segfault6793() === nothing
# issue #6896
g6896(x) = x::Int=x
@test g6896(5.0) === 5.0
f6896(x) = y::Int=x
@test f6896(5.0) === 5.0
# issue #6938
module M6938
macro mac()
quote
let
y = 0
y
end
end
end
end
@test @M6938.mac() == 0
# issue #7012
let x = zeros(2)
x[1]::Float64 = 1
@test x == [1.0, 0.0]
@test_throws TypeError (x[1]::Int = 1)
x[1]::Float64 += 1
@test x == [2.0, 0.0]
@test_throws TypeError (x[1]::Int += 1)
end
# issue #6980
abstract type A6980 end
mutable struct B6980 <: A6980 end
f6980(::Union{Int, Float64}, ::A6980) = false
f6980(::Union{Int, Float64}, ::B6980) = true
@test f6980(1, B6980())
# issue #7049
Maybe7049{T} = Union{T,Nothing}
function ttt7049(;init::Maybe7049{Union{AbstractString,Tuple{Int,Char}}} = nothing)
string("init=", init)
end
@test ttt7049(init="a") == "init=a"
# issue #7074
let z(A::StridedMatrix{T}) where {T<:Union{Float64,ComplexF64,Float32,ComplexF32}} = T,
S = zeros(Complex,2,2)
@test_throws MethodError z(S)
end
# issue #7062
f7062(::Type{Array{t}} , ::Array{t,n}) where {t,n} = (t,n,1)
f7062(::Type{Array{t,n}}, ::Array{t,n}) where {t,n} = (t,n,2)
@test f7062(Array{Int,1}, [1,2,3]) === (Int,1,2)
@test f7062(Array{Int} , [1,2,3]) === (Int,1,1)
# issue #7302
function test7302()
t = [UInt64][1]
convert(t, "5")
end
@test_throws MethodError test7302()
macro let_with_uninit()
quote
let x
x = 1
x+1
end
end
end
@test @let_with_uninit() == 2
# issue #5154
let
v = []
for i=1:3, j=1:3
push!(v, (i, j))
i == 1 && j == 2 && break
end
@test v == Any[(1,1), (1,2)]
end
# addition of ¬ (\neg) parsing
const (¬) = !
@test ¬false
# issue #7652
mutable struct A7652
a :: Int
end
a7652 = A7652(0)
t_a7652 = A7652
f7652() = fieldtype(t_a7652, :a) <: Int
@test f7652() == (fieldtype(A7652, :a) <: Int) == true
g7652() = fieldtype(DataType, :types)
@test g7652() == fieldtype(DataType, :types) == Core.SimpleVector
@test fieldtype(t_a7652, 1) == Int
h7652() = setfield!(a7652, 1, 2)
@test h7652() === 2
@test a7652.a === 2
i7652() = Base.setproperty!(a7652, :a, 3.0)
@test i7652() === 3
@test a7652.a === 3
# issue #7679
@test map(f->f(), Any[ ()->i for i=1:3 ]) == Any[1,2,3]
# issue 7897
function issue7897!(data, arr)
data = reinterpret(UInt32, data)
a = arr[1]
end
let
a = fill(0x01, 10)
sa = view(a, 4:6)
# This can throw an error, but shouldn't segfault
try
issue7897!(sa, zeros(10))
catch
end
end
# issue #7582
aₜ = "a variable using Unicode 6"
struct My8156{A, B}
a::A
b::B
end
let m = My8156(nothing, 1)
@test sizeof(m) == sizeof(1)
@test m.a === nothing
@test m.b === 1
end
# issue #8184
struct Foo8184
x::Nothing
y::Nothing
z::Float64
end
let f = Foo8184(nothing,nothing,1.0)
g(x) = x.z
@test g(f) === 1.0
end
# issue #8213
@test map((x...)->x,(1,2),(3,4),(5,6)) === ((1,3,5),(2,4,6))
# issue #8338
let ex = Expr(:(=), :(f8338(x;y=4)), :(x*y))
eval(ex)
@test f8338(2) == 8
end
# call overloading (#2403)
issue2403func(f) = f(7)
mutable struct Issue2403
x
end
(i::Issue2403)(y) = i.x + 2y
let x = Issue2403(20)
@test x(3) == 26
@test x((3,)...) == 26
@test issue2403func(x) == 34
end
# issue #14919
abstract type A14919; end
struct B14919 <: A14919; end
struct C14919 <: A14919; end
struct D14919 <: Function; end
(::A14919)() = "It's a brand new world"
(::Union{C14919,D14919})() = "Boo."
@test B14919()() == "It's a brand new world"
@test C14919()() == D14919()() == "Boo."
for f in (:Any, :Function, :(Core.Builtin), :(Union{Nothing, Type}), :(Union{typeof(+), Type}), :(Union{typeof(+), typeof(-)}), :(Base.Callable))
@test_throws ErrorException("Method dispatch is unimplemented currently for this method signature") @eval (::$f)() = 1
end
for f in (:(Core.arrayref), :((::typeof(Core.arrayref))), :((::Core.IntrinsicFunction)))
@test_throws ErrorException("cannot add methods to a builtin function") @eval $f() = 1
end
# issue #33370
abstract type B33370 end
let n = gensym(), c(x) = B33370[x][1]()
@eval begin
struct $n <: B33370
end
function (::$n)()
end
end
@test c(eval(n)()) === nothing
end
# issue #8798
let
npy_typestrs = Dict("b1"=>Bool,
"i1"=>Int8, "u1"=>UInt8,
"i2"=>Int16, "u2"=>UInt16,
"i4"=>Int32, "u4"=>UInt32,
"i8"=>Int64, "u8"=>UInt64)
sizeof_lookup() = sizeof(npy_typestrs["i8"])
@test sizeof_lookup() == 8
end
# issue #8978
module I8978
y = 1
g() = f(y)
f(x) = 2
f(x::Int) = 3.0
module II8978
function callf(f)
try
f()
finally
end
end
end
h(f) = II8978.callf() do
local x
for i = 1:1
x = g()+f
end
x
end
end
@test I8978.h(4) === 7.0
# issue #9134
function f9134()
ii = zeros(Int32, 1)
let i
ii[1] = i
end
end
@test_throws UndefVarError f9134()
# issue #9475
module I9475
arr = Vector{Any}(undef, 1)
@eval @eval $arr[1] = 1
end
# issue #9520
f9520a(::Any, ::Any, args...) = 15
f9520b(::Any, ::Any, ::Any, args...) = 23
f9520c(::Any, ::Any, ::Any, ::Any, ::Any, ::Any, args...) = 46
@test invoke(f9520a, Tuple{Any, Any}, 1, 2) == 15
@test invoke(f9520a, Tuple{Any, Any, Any}, 1, 2, 3) == 15
@test invoke(f9520b, Tuple{Any, Any, Any}, 1, 2, 3) == 23
@test invoke(f9520b, Tuple{Any, Any, Any, Any, Any, Any}, 1, 2, 3, 4, 5, 6) == 23
@test invoke(f9520c, Tuple{Any, Any, Any, Any, Any, Any}, 1, 2, 3, 4, 5, 6) == 46
@test invoke(f9520c, Tuple{Any, Any, Any, Any, Any, Any, Any}, 1, 2, 3, 4, 5, 6, 7) == 46
# issue #24460
f24460(x, y) = 1
f24460(x::T, y::T) where {T} = 2.0
f24460(x::Int, y::Int) = "3"
@test f24460(1, 2) === "3"
@test invoke(f24460, Tuple{T,T} where T, 1, 2) === 2.0
const T24460 = Tuple{T,T} where T
g24460() = invoke(f24460, T24460, 1, 2)
@test @inferred(g24460()) === 2.0
# issue #30679
@noinline function f30679(::DataType)
b = IOBuffer()
write(b, 0x00)
2
end
@noinline function f30679(t::Type{Int})
x = invoke(f30679, Tuple{DataType}, t)
b = IOBuffer()
write(b, 0x00)
return x + 40
end
@test f30679(Int) == 42
call_lambda1() = (()->x)(1)
call_lambda2() = ((x)->x)()
call_lambda3() = ((x)->x)(1,2)
call_lambda4() = ((x,y...)->x)()
@test_throws MethodError call_lambda1()
@test_throws MethodError call_lambda2()
@test_throws MethodError call_lambda3()
@test_throws MethodError call_lambda4()
call_lambda5() = ((x...)->x)()
call_lambda6() = ((x...)->x)(1)
call_lambda7() = ((x...)->x)(1,2)
@test call_lambda5() == ()
@test call_lambda6() == (1,)
@test call_lambda7() == (1,2)
# jl_new_bits testing
let x = [1,2,3]
@test ccall(:jl_new_bits, Any, (Any,Ptr{Cvoid},), Int, x) === 1
@test ccall(:jl_new_bits, Any, (Any,Ptr{Cvoid},), Complex{Int}, x) === 1+2im
@test ccall(:jl_new_bits, Any, (Any,Ptr{Cvoid},), NTuple{3,Int}, x) === (1,2,3)
@test ccall(:jl_new_bits, Any, (Any,Ptr{Cvoid},), Tuple{Int,Int,Int}, x) === (1,2,3)
@test (ccall(:jl_new_bits, Any, (Any,Ptr{Cvoid},), Tuple{Int16,Tuple{Cvoid},Int8,Tuple{},Int,Cvoid,Int}, x)::Tuple)[[2,4,5,6,7]] === ((nothing,),(),2,nothing,3)
end
let
# Exception frame automatically restores sigatomic counter.
Base.sigatomic_begin()
@test_throws ErrorException begin
for i = 1:2
Base.sigatomic_end()
end
end
Base.sigatomic_end()
end
# pull request #9534
@test_throws BoundsError((1, 2), 3) begin; a, b, c = 1, 2; end
let a = []
@test try; a[]; catch ex; (ex::BoundsError).a === a && ex.i == (); end
@test_throws BoundsError(a, (1, 2)) a[1, 2]
@test_throws BoundsError(a, (10,)) a[10]
end
f9534a() = (a = 1 + 2im; getfield(a, -100))
f9534a(x) = (a = 1 + 2im; getfield(a, x))
@test_throws BoundsError(1 + 2im, -100) f9534a()
@test_throws BoundsError(1 + 2im, 3) f9534a(3)
f9534b() = (a = (1, 2., ""); a[5])
f9534b(x) = (a = (1, 2., ""); a[x])
@test_throws BoundsError((1, 2., ""), 5) f9534b()
@test_throws BoundsError((1, 2., ""), 4) f9534b(4)
f9534c() = (a = (1, 2.); a[3])
f9534c(x) = (a = (1, 2.); a[x])
@test_throws BoundsError((1, 2.), 3) f9534c()
@test_throws BoundsError((1, 2.), 0) f9534c(0)
f9534d() = (a = (1, 2, 4, 6, 7); a[7])
f9534d(x) = (a = (1, 2, 4, 6, 7); a[x])
@test_throws BoundsError((1, 2, 4, 6, 7), 7) f9534d()
@test_throws BoundsError((1, 2, 4, 6, 7), -1) f9534d(-1)
let a = IOBuffer()
f9534e(x) = setfield!(a, x, 3)
@test_throws BoundsError(a, -2) f9534e(-2)
f9534f() = getfield(a, -2)
f9534f(x) = getfield(a, x)
@test_throws BoundsError(a, -2) f9534f()
@test_throws BoundsError(a, typemin(Int) + 2) f9534f(typemin(Int) + 2)
end
x9634 = 3
@test_throws BoundsError(1 + 2im, 3) getfield(1 + 2im, x9634)
@test try; throw(BoundsError()); catch ex; !isdefined((ex::BoundsError), :a) && !isdefined((ex::BoundsError), :i); end
@test try; throw(BoundsError(Int)); catch ex; (ex::BoundsError).a == Int && !isdefined((ex::BoundsError), :i); end
@test_throws BoundsError(Int, typemin(Int)) throw(BoundsError(Int, typemin(Int)))
@test_throws BoundsError(Int, (:a,)) throw(BoundsError(Int, (:a,)))
f9534g(a, b, c...) = c[0]
@test_throws BoundsError((3, 4, 5, 6), 0) f9534g(1, 2, 3, 4, 5, 6)
f9534h(a, b, c...) = c[a]
@test f9534h(4, 2, 3, 4, 5, 6) == 6
@test_throws BoundsError((3, 4, 5, 6), 5) f9534h(5, 2, 3, 4, 5, 6)
# issue #7978, comment 332352438
f7978a() = 1
@test_throws BoundsError(1, 2) begin; a, b = f7978a(); end
f7978b() = 1, 2
@test_throws BoundsError((1, 2), 3) begin; a, b, c = f7978b(); end
# issue #9535
counter9535 = 0
f9535() = (global counter9535; counter9535 += 1; counter9535)
g9535() = (f9535(),f9535())
@test g9535() == (1,2)
@test g9535() == (3,4)
# weak references
mutable struct Obj; x; end
@testset "weak references" begin
@noinline function mk_wr(r, wr)
x = Obj(1)
push!(r, x)
push!(wr, WeakRef(x))
nothing
end
@noinline test_wr(r, wr) = @test r[1] == wr[1].value
function test_wr()
# we need to be very careful here that we never
# use the value directly in this function, so we aren't dependent
# on optimizations deleting the root for it before reaching the test
ref = []
wref = []
mk_wr(ref, wref)
test_wr(ref, wref)
GC.gc()
test_wr(ref, wref)
empty!(ref)
GC.gc()
@test wref[1].value === nothing
end
test_wr()
end
# issue #9947
function f9947()
if 1 == 0
1
else
min(UInt128(2),1)
end
end
@test f9947() == UInt128(1)
#issue #9835
module M9835
using Test
mutable struct A end; mutable struct B end
f() = (isa(A(), A) ? A : B)()
@test isa(f(), A)
end
#issue #10163
let a = :(()), b = :(())
@test a.args !== b.args
end
# issue caused by commit 189b00aef0376d1a998d36115cd11b17464d26ce and worked around
# by commit 24c64b86bd4e793dbfe9d85c067dc0579b320d14
let
g(x::T...) where {T} = T
g(x...) = 0
@test g((),Int) == 0
@test g((),()) == Tuple{}
end
# TODO: hopefully this issue is obsolete after the tuple type change
## issue #8631
#f8631(::(Type, Type...), ::(Any, Any...)) = 1
#f8631{T}(::Type{(T...)}, x::Tuple) = 2
#@test length(methods(f8631, ((Type, Type...), (Any, Any...)))) == 2
# issue caused by 8d0037cb377257fc4232c8526b12337dd7bdf0a7
args8d003 = (:x, :y)
@test eval(:(:(f($(($args8d003)...))))) == :(f(x,y))
x8d003 = Any[:y8d003]
y8d003 = 777
@test eval(:(string(:(f($($(x8d003...))))))) == "f(777)"
# issue #9378
abstract type Foo9378{T,S} end
struct B9378{T} end
FooB9378{T} = Foo9378{T,B9378}
struct CFoo9378 <: FooB9378{Float64} end
@test isa(CFoo9378(),FooB9378)
# issue #10281
const N10281 = 1000
@test if false
for i in 1:N10281
end
end === nothing
# issue #10221
module GCbrokentype
using InteractiveUtils
OLD_STDOUT = stdout
fname = tempname()
file = open(fname, "w")
redirect_stdout(file)
versioninfo()
try
mutable struct Foo{T}
val::Bar{T}
end
catch
end
GC.gc()
redirect_stdout(OLD_STDOUT)
close(file)
rm(fname)
end
# issue #10373
f10373(x) = x
g10373(x) = x
mutable struct newtype10373
end
let f
for f in (f10373,g10373)
(::typeof(f))(x::newtype10373) = println("$f")
end
end
for m in methods(f10373)
@test m.name === :f10373
end
for m in methods(g10373)
@test m.name === :g10373
end
# issue #7221
f7221(::T) where {T<:Number} = 1
f7221(::BitArray) = 2
f7221(::AbstractVecOrMat) = 3
@test f7221(trues(1)) == 2
# issue #10570
struct Array_512_Uint8
d1::UInt8
d2::UInt8
d3::UInt8
d4::UInt8
d5::UInt8
d6::UInt8
d7::UInt8
d8::UInt8
d9::UInt8
d10::UInt8
d11::UInt8
d12::UInt8
d13::UInt8
d14::UInt8
d15::UInt8
d16::UInt8
d17::UInt8
d18::UInt8
d19::UInt8
d20::UInt8
d21::UInt8
d22::UInt8
d23::UInt8
d24::UInt8
d25::UInt8
d26::UInt8
d27::UInt8
d28::UInt8
d29::UInt8
d30::UInt8
d31::UInt8
d32::UInt8
d33::UInt8
d34::UInt8
d35::UInt8
d36::UInt8
d37::UInt8
d38::UInt8
d39::UInt8
d40::UInt8
d41::UInt8
d42::UInt8
d43::UInt8
d44::UInt8
d45::UInt8
d46::UInt8
d47::UInt8
d48::UInt8
d49::UInt8
d50::UInt8
d51::UInt8
d52::UInt8
d53::UInt8
d54::UInt8
d55::UInt8
d56::UInt8
d57::UInt8
d58::UInt8
d59::UInt8
d60::UInt8
d61::UInt8
d62::UInt8
d63::UInt8
d64::UInt8
d65::UInt8
d66::UInt8
d67::UInt8
d68::UInt8
d69::UInt8
d70::UInt8
d71::UInt8
d72::UInt8
d73::UInt8
d74::UInt8
d75::UInt8
d76::UInt8
d77::UInt8
d78::UInt8
d79::UInt8
d80::UInt8
d81::UInt8
d82::UInt8
d83::UInt8
d84::UInt8
d85::UInt8
d86::UInt8
d87::UInt8
d88::UInt8
d89::UInt8
d90::UInt8
d91::UInt8
d92::UInt8
d93::UInt8
d94::UInt8
d95::UInt8
d96::UInt8
d97::UInt8
d98::UInt8
d99::UInt8
d100::UInt8
d101::UInt8
d102::UInt8
d103::UInt8
d104::UInt8
d105::UInt8
d106::UInt8
d107::UInt8
d108::UInt8
d109::UInt8
d110::UInt8
d111::UInt8
d112::UInt8
d113::UInt8
d114::UInt8
d115::UInt8
d116::UInt8
d117::UInt8
d118::UInt8
d119::UInt8
d120::UInt8
d121::UInt8
d122::UInt8
d123::UInt8
d124::UInt8
d125::UInt8
d126::UInt8
d127::UInt8
d128::UInt8
d129::UInt8
d130::UInt8
d131::UInt8
d132::UInt8
d133::UInt8
d134::UInt8
d135::UInt8
d136::UInt8
d137::UInt8
d138::UInt8
d139::UInt8
d140::UInt8
d141::UInt8
d142::UInt8
d143::UInt8
d144::UInt8
d145::UInt8
d146::UInt8
d147::UInt8
d148::UInt8
d149::UInt8
d150::UInt8
d151::UInt8
d152::UInt8
d153::UInt8
d154::UInt8
d155::UInt8
d156::UInt8
d157::UInt8
d158::UInt8
d159::UInt8
d160::UInt8
d161::UInt8
d162::UInt8
d163::UInt8
d164::UInt8
d165::UInt8
d166::UInt8
d167::UInt8
d168::UInt8
d169::UInt8
d170::UInt8
d171::UInt8
d172::UInt8
d173::UInt8
d174::UInt8
d175::UInt8
d176::UInt8
d177::UInt8
d178::UInt8
d179::UInt8
d180::UInt8
d181::UInt8
d182::UInt8
d183::UInt8
d184::UInt8
d185::UInt8
d186::UInt8
d187::UInt8
d188::UInt8
d189::UInt8
d190::UInt8
d191::UInt8
d192::UInt8
d193::UInt8
d194::UInt8
d195::UInt8
d196::UInt8
d197::UInt8
d198::UInt8
d199::UInt8
d200::UInt8
d201::UInt8
d202::UInt8
d203::UInt8
d204::UInt8
d205::UInt8
d206::UInt8
d207::UInt8
d208::UInt8
d209::UInt8
d210::UInt8
d211::UInt8
d212::UInt8
d213::UInt8
d214::UInt8
d215::UInt8
d216::UInt8
d217::UInt8
d218::UInt8
d219::UInt8
d220::UInt8
d221::UInt8
d222::UInt8
d223::UInt8
d224::UInt8
d225::UInt8
d226::UInt8
d227::UInt8
d228::UInt8
d229::UInt8
d230::UInt8
d231::UInt8
d232::UInt8
d233::UInt8
d234::UInt8
d235::UInt8
d236::UInt8
d237::UInt8
d238::UInt8
d239::UInt8
d240::UInt8
d241::UInt8
d242::UInt8
d243::UInt8
d244::UInt8
d245::UInt8
d246::UInt8
d247::UInt8
d248::UInt8
d249::UInt8
d250::UInt8
d251::UInt8
d252::UInt8
d253::UInt8
d254::UInt8
d255::UInt8
d256::UInt8
d257::UInt8
d258::UInt8
d259::UInt8
d260::UInt8
d261::UInt8
d262::UInt8
d263::UInt8
d264::UInt8
d265::UInt8
d266::UInt8
d267::UInt8
d268::UInt8
d269::UInt8
d270::UInt8
d271::UInt8
d272::UInt8
d273::UInt8
d274::UInt8
d275::UInt8
d276::UInt8
d277::UInt8
d278::UInt8
d279::UInt8
d280::UInt8
d281::UInt8
d282::UInt8
d283::UInt8
d284::UInt8
d285::UInt8
d286::UInt8
d287::UInt8
d288::UInt8
d289::UInt8
d290::UInt8
d291::UInt8
d292::UInt8
d293::UInt8
d294::UInt8
d295::UInt8
d296::UInt8
d297::UInt8
d298::UInt8
d299::UInt8
d300::UInt8
d301::UInt8
d302::UInt8
d303::UInt8
d304::UInt8
d305::UInt8
d306::UInt8
d307::UInt8
d308::UInt8
d309::UInt8
d310::UInt8
d311::UInt8
d312::UInt8
d313::UInt8
d314::UInt8
d315::UInt8
d316::UInt8
d317::UInt8
d318::UInt8
d319::UInt8
d320::UInt8
d321::UInt8
d322::UInt8
d323::UInt8
d324::UInt8
d325::UInt8
d326::UInt8
d327::UInt8
d328::UInt8
d329::UInt8
d330::UInt8
d331::UInt8
d332::UInt8
d333::UInt8
d334::UInt8
d335::UInt8
d336::UInt8
d337::UInt8
d338::UInt8
d339::UInt8
d340::UInt8
d341::UInt8
d342::UInt8
d343::UInt8
d344::UInt8
d345::UInt8
d346::UInt8
d347::UInt8
d348::UInt8
d349::UInt8
d350::UInt8
d351::UInt8
d352::UInt8
d353::UInt8
d354::UInt8
d355::UInt8
d356::UInt8
d357::UInt8
d358::UInt8
d359::UInt8
d360::UInt8
d361::UInt8
d362::UInt8
d363::UInt8
d364::UInt8
d365::UInt8
d366::UInt8
d367::UInt8
d368::UInt8
d369::UInt8
d370::UInt8
d371::UInt8
d372::UInt8
d373::UInt8
d374::UInt8
d375::UInt8
d376::UInt8
d377::UInt8
d378::UInt8
d379::UInt8
d380::UInt8
d381::UInt8
d382::UInt8
d383::UInt8
d384::UInt8
d385::UInt8
d386::UInt8
d387::UInt8
d388::UInt8
d389::UInt8
d390::UInt8
d391::UInt8
d392::UInt8
d393::UInt8
d394::UInt8
d395::UInt8
d396::UInt8
d397::UInt8
d398::UInt8
d399::UInt8
d400::UInt8
d401::UInt8
d402::UInt8
d403::UInt8
d404::UInt8
d405::UInt8
d406::UInt8
d407::UInt8
d408::UInt8
d409::UInt8
d410::UInt8
d411::UInt8
d412::UInt8
d413::UInt8
d414::UInt8
d415::UInt8
d416::UInt8
d417::UInt8
d418::UInt8
d419::UInt8
d420::UInt8
d421::UInt8
d422::UInt8
d423::UInt8
d424::UInt8
d425::UInt8
d426::UInt8
d427::UInt8
d428::UInt8
d429::UInt8
d430::UInt8
d431::UInt8
d432::UInt8
d433::UInt8
d434::UInt8
d435::UInt8
d436::UInt8
d437::UInt8
d438::UInt8
d439::UInt8
d440::UInt8
d441::UInt8
d442::UInt8
d443::UInt8
d444::UInt8
d445::UInt8
d446::UInt8
d447::UInt8
d448::UInt8
d449::UInt8
d450::UInt8
d451::UInt8
d452::UInt8
d453::UInt8
d454::UInt8
d455::UInt8
d456::UInt8
d457::UInt8
d458::UInt8
d459::UInt8
d460::UInt8
d461::UInt8
d462::UInt8
d463::UInt8
d464::UInt8
d465::UInt8
d466::UInt8
d467::UInt8
d468::UInt8
d469::UInt8
d470::UInt8
d471::UInt8
d472::UInt8
d473::UInt8
d474::UInt8
d475::UInt8
d476::UInt8
d477::UInt8
d478::UInt8
d479::UInt8
d480::UInt8
d481::UInt8
d482::UInt8
d483::UInt8
d484::UInt8
d485::UInt8
d486::UInt8
d487::UInt8
d488::UInt8
d489::UInt8
d490::UInt8
d491::UInt8
d492::UInt8
d493::UInt8
d494::UInt8
d495::UInt8
d496::UInt8
d497::UInt8
d498::UInt8
d499::UInt8
d500::UInt8
d501::UInt8
d502::UInt8
d503::UInt8
d504::UInt8
d505::UInt8
d506::UInt8
d507::UInt8
d508::UInt8
d509::UInt8
d510::UInt8
d511::UInt8
d512::UInt8
end
GC.gc()
# issue #10867
@test collect(enumerate((Tuple,Int))) == [(1,Tuple), (2,Int)]
@test collect(enumerate((Tuple,3))) == [(1,Tuple), (2,3)]
# issue #10978
TupleType10978{T<:Tuple} = Type{T}
f10978(T::TupleType10978) = isa(T, TupleType10978)
@test f10978(Tuple{Int})
# issue #10995
#TupleType{T<:Tuple} = Type{T}
f10995(::Any) = (while false; end; nothing)
f10995(T::TupleType10978) = (while false; end; @assert isa(T, TupleType10978))
g10995(x) = f10995(typeof(x))
g10995((1, 2))
@test g10995(UInt8) === nothing
# issue #11149
@noinline f11149(a,b,args...) = (a,b,args...)
@test f11149(1,2,3) == invoke(f11149, Tuple{Int,Int,Int}, 1,2,3)
# issue #11357
function f11357()
x = (1,2,3)
i = (1,)
x[i...]
end
@test f11357() === 1
# issue #11355
function f11355(sig::Type{T}) where T<:Tuple
f11355(sig.parameters[1])
end
function f11355(arg::DataType)
if arg <: Tuple
return 200
end
return 100
end
let t = Tuple{Type{Vector{Int}}}
@test f11355(t) == 100
t = Tuple{Type{Dict{K} where K}}
@test f11355(t) == 100
end
# issue #8283
function func8283 end
@test isa(func8283,Function)
@test_throws MethodError func8283()
# issue #11243
mutable struct Type11243{A, B}
x::A
y::B
end
let a = [Type11243(1,2), Type11243("a","b")]
@test typeof(a) == Vector{Type11243}
@test typeof(a) <: Vector{Type11243}
end
# issue #11065, #1571
function f11065()
for i = 1:2
if i == 1
z = "z is defined"
elseif i == 2
print(z) # z is undefined
end
end
end
@test_throws UndefVarError f11065()
# issue #25724
a25724 = Any[]
for i = 1:3
needX = false
try
X = X
X[1] = X[1] + 1
catch err
needX = true
end
if needX
X = [0]
end
push!(a25724, copy(X))
end
@test a25724 == [[0], [0], [0]]
# for loop iterator expression should be evaluated in outer scope
let
for i in (local a = 1:2)
end
@test a == 1:2
end
# `for outer`
let
function forouter()
i = 1
for outer i = 2:3
end
return i
end
@test forouter() == 3
end
@test_throws ErrorException("syntax: no outer local variable declaration exists for \"for outer\"") @eval function f()
for outer i = 1:2
end
end
# issue #11295
function f11295(x...)
call = Expr(x...)
end
@test isa(f11295(:a,:b), Expr)
# issue #11675
struct T11675{T}
x::T
T11675{T}() where T = new()
end
let x = T11675{Union{}}()
function f11675(x)
x.x + 1
end
@test_throws UndefRefError f11675(x)
end
# issue #7864
module M7864
export x7864
x7864 = 1
end
@test_throws UndefVarError x7864
using .M7864
@test x7864 == 1
# issue #11715
f11715(x) = (x === Tuple{Any})
@test f11715(Tuple{Any})
# part of #11597
# make sure invalid, partly-constructed types don't end up in the cache
abstract type C11597{T<:Union{Nothing, Int}} end
mutable struct D11597{T} <: C11597{T} d::T end
@test_throws TypeError D11597(1.0)
@test_throws TypeError repr(D11597(1.0))
# issue #11772
@test_throws UndefRefError (Vector{Any}(undef, 5)...,)
# issue #11813
let a = UInt8[1, 107, 66, 88, 2, 99, 254, 13, 0, 0, 0, 0]
u32 = UInt32[0x3]
a[9:end] = reinterpret(UInt8, u32)
p = pointer(a)
@test (Int8(1),(Int8(2),Int32(3))) === unsafe_load(convert(Ptr{Tuple{Int8,Tuple{Int8,Int32}}},p))
f11813(p) = (Int8(1),(Int8(2),Int32(3))) === unsafe_load(convert(Ptr{Tuple{Int8,Tuple{Int8,Int32}}},p))
@test f11813(p) === true # redundant comparison test seems to make this test more reliable, don't remove
end
# issue #13037
let a = UInt8[0, 0, 0, 0, 0x66, 99, 254, 13, 0, 0, 0, 0]
u32 = UInt32[0x3]
a[1:4] = reinterpret(UInt8, u32)
p = pointer(a)
@test ((Int32(3),UInt8(0x66)),Int32(0)) === unsafe_load(convert(Ptr{Tuple{Tuple{Int32,UInt8},Int32}},p))
f11813(p) = ((Int32(3),UInt8(0x66)),Int32(0)) === unsafe_load(convert(Ptr{Tuple{Tuple{Int32,UInt8},Int32}},p))
@test f11813(p) === true # redundant comparison test seems to make this test more reliable, don't remove
end
let a = (1:1000...,),
b = (1:1000...,)
@test a == b
@test a === b
@test (a == b) === true
@test (a === b) === true
end
# issue 11858
mutable struct Foo11858
x::Float64
Foo11858(x::Float64) = new(x)
end
mutable struct Bar11858
x::Float64
Bar11858(x::Float64) = new(x)
end
g11858(x::Float64) = x
f11858(a) = for Baz in a
@eval (f::$Baz)(x) = f(float(x))
end
f11858(Any[Type{Foo11858}, Type{Bar11858}, typeof(g11858)])
@test g11858(1) == 1.0
@test Foo11858(1).x == 1.0
@test Bar11858(1).x == 1.0
# issue 11904
struct Nullable11904{T}
value::T
hasvalue::Bool
end
@noinline throw_error() = error()
foo11904(x::Int) = x
@inline function foo11904(x::Nullable11904{S}) where S
if isbitstype(S)
Nullable11904(foo11904(x.value), x.hasvalue)
else
throw_error()
end
end
@test foo11904(Nullable11904(1, true)).hasvalue
# issue 11874
struct Foo11874
x::Int
end
function bar11874(x)
local y::Foo11874
y = x
nothing
end
Base.convert(::Type{Foo11874},x::Int) = float(x)
@test_throws TypeError bar11874(1)
# issue #9233
let
try
NTuple{Int, 1}
@test false
catch err
@test isa(err, TypeError)
@test err.func === :Vararg
@test err.expected == Int
@test err.got == Int
end
try
NTuple{0x1, Int}
@test false
catch err
@test isa(err, TypeError)
@test err.func === :Vararg
@test err.expected == Int
@test err.got == 0x1
end
end
# 11996
@test_throws ErrorException NTuple{-1, Int}
@test_throws TypeError Union{Int, 1}
@test_throws ErrorException Vararg{Any,-2}
# Disabled due to #39698, see src/jltypes.c
#@test_throws ErrorException Vararg{Int, N} where N<:T where T
#@test_throws ErrorException Vararg{Int, N} where N<:Integer
#@test_throws ErrorException Vararg{Int, N} where N>:Integer
mutable struct FooNTuple{N}
z::Tuple{Integer, Vararg{Int, N}}
end
for i in (-1, typemin(Int), 0x01)
T = FooNTuple{i}
@test T.parameters[1] == i
@test fieldtypes(T) == (Union{},)
end
@test fieldtype(FooNTuple{0}, 1) == Tuple{Integer}
mutable struct FooTupleT{T}
z::Tuple{Int, T, Int}
end
let R = Vararg{Int, 2}
@test_throws TypeError Val{R}
@test_throws TypeError Ref{R}
@test_throws TypeError FooTupleT{R}
@test_throws TypeError Union{R}
end
@test fieldtype(FooTupleT{Int}, 1) == NTuple{3, Int}
@test Tuple{} === NTuple{0, Any}
@test Tuple{Int} === Tuple{Int, Vararg{Integer, 0}}
# issue #12003
using Dates
const DATE12003 = DateTime(1917,1,1)
failure12003(dt=DATE12003) = Dates.year(dt)
@test isa(failure12003(), Integer)
# issue #12023 Test error checking in primitive type
@test_throws ErrorException (@eval primitive type 0 SPJa12023 end)
@test_throws ErrorException (@eval primitive type 4294967312 SPJb12023 end)
@test_throws ErrorException (@eval primitive type -4294967280 SPJc12023 end)
# issue #12089
mutable struct A12089{K, N}
sz::NTuple{N, Int}
A12089{K,N}(sz::NTuple{N, Int}) where {K,N} = new(sz)
end
A12089{-1, 1}((1,))
# issue #12092
f12092(x::Int, y) = 0
f12092(x::Int,) = 1
f12092(x::Int, y::Int...) = 2
@test f12092(1) == 1
# issue #12063
# NOTE: should have > MAX_TUPLETYPE_LEN arguments
f12063(tt, g, p, c, b, v, cu::T, d::AbstractArray{T, 2}, ve) where {T} = 1
f12063(args...) = 2
g12063() = f12063(0, 0, 0, 0, 0, 0, 0.0, zeros(0,0), Int[])
@test g12063() == 1
# issue #11587
mutable struct Sampler11587{N}
clampedpos::Array{Int,2}
buf::Array{Float64,N}
end
function Sampler11587()
a = tuple(Any[32,32]...,)
Sampler11587(zeros(Int,a), zeros(Float64,a))
end
@test isa(Sampler11587(), Sampler11587{2})
# issue #8010 - error when convert returns wrong type during new()
struct Vec8010{T}
x::T
y::T
end
Vec8010(a::AbstractVector) = Vec8010(ntuple(x->a[x],2)...)
Base.convert(::Type{Vec8010{T}},x::AbstractVector) where {T} = Vec8010(x)
Base.convert(::Type{Nothing},x::AbstractVector) = Vec8010(x)
struct MyType8010
m::Vec8010{Float32}
end
struct MyType8010_ghost
m::Nothing
end
@test_throws TypeError MyType8010([3.0;4.0])
@test_throws TypeError MyType8010_ghost([3.0;4.0])
module TestNewTypeError
using Test
struct A
end
struct B
a::A
end
@eval function f1()
# Emitting this direction is not recommended but it can come from `convert` that does not
# return the correct type.
$(Expr(:new, B, 1))
end
@eval function f2()
a = $(Expr(:new, B, 1))
a = a
return nothing
end
@generated function f3()
quote
$(Expr(:new, B, 1))
return nothing
end
end
@test_throws TypeError("new", A, 1) f1()
@test_throws TypeError("new", A, 1) f2()
@test_throws TypeError("new", A, 1) f3()
@test_throws TypeError("new", A, 1) eval(Expr(:new, B, 1))
# some tests for handling of malformed syntax--these cases should not be possible in normal code
@test eval(Expr(:new, B, A())) == B(A())
@test_throws ErrorException("invalid struct allocation") eval(Expr(:new, B))
@test_throws ErrorException("invalid struct allocation") eval(Expr(:new, B, A(), A()))
@test_throws TypeError("new", DataType, Complex) eval(Expr(:new, Complex))
@test_throws TypeError("new", DataType, Complex.body) eval(Expr(:new, Complex.body))
@test_throws TypeError("new", DataType, Complex) eval(Expr(:splatnew, Complex, ()))
@test_throws TypeError("new", DataType, Complex.body) eval(Expr(:splatnew, Complex.body, ()))
end
# don't allow redefining types if n_uninitialized changes
struct NInitializedTestType
a
end
@test_throws ErrorException @eval struct NInitializedTestType
a
NInitializedTestType() = new()
end
# issue #12394
mutable struct Empty12394 end
let x = Vector{Empty12394}(undef, 1), y = [Empty12394()]
@test_throws UndefRefError x==y
@test_throws UndefRefError y==x
end
module TestRecursiveConstGlobalStructCtor
const x = (1,2)
const y = (x,(3,4))
f() = (x,y,(5,6))
end
@test TestRecursiveConstGlobalStructCtor.f() == ((1,2),((1,2),(3,4)),(5,6))
const const_array_int1 = Array{Int}
const const_array_int2 = Array{Int}
test_eq_array_int() = ===(const_array_int1, const_array_int2)
@test test_eq_array_int()
# objectid of haspadding field
struct HasPadding
x::Bool
y::Int
end
struct HasHasPadding
x::HasPadding
end
let hashaspadding = Ref(HasHasPadding(HasPadding(true,1))),
hashaspadding2 = Ref(HasHasPadding(HasPadding(true,1)))
unsafe_store!(convert(Ptr{UInt8},pointer_from_objref(hashaspadding)), 0x12, 2)
unsafe_store!(convert(Ptr{UInt8},pointer_from_objref(hashaspadding2)), 0x21, 2)
@test objectid(hashaspadding[]) == objectid(hashaspadding2[])
end
# issue #12517
let x = (1,2)
@eval f12517() = Val{$x}
@test f12517() === Val{(1,2)}
end
# don't allow Vararg{} in Union{} type constructor
@test_throws TypeError Union{Int,Vararg{Int}}
@test_throws TypeError Union{Vararg{Int}}
# only allow Vararg{} in last position of Tuple{ }
@test_throws TypeError Tuple{Vararg{Int32},Int64,Float64}
@test_throws TypeError Tuple{Int64,Vararg{Int32},Float64}
@test_throws TypeError Array{Vararg}
# don't allow non-types in Union
@test_throws TypeError Union{1}
@test_throws TypeError Union{Int,0}
PossiblyInvalidUnion{T} = Union{T,Int}
@test_throws TypeError PossiblyInvalidUnion{1}
# issue #12569
@test Symbol("x") === Symbol("x")
@test split(string(gensym("abc")),'#')[3] == "abc"
# issue #13007
call13007(::Type{Array{T,N}}) where {T,N} = 0
call13007(::Type{Array}) = 1
@test length(Base._methods(call13007, Tuple{Type{x} where x<:Array}, 4, typemax(UInt))) == 2
# detecting cycles during type intersection, e.g. #1631
cycle_in_solve_tvar_constraints(::Type{Some{S}}, x::S) where {S} = 0
cycle_in_solve_tvar_constraints(::Type{T}, x::Val{T}) where {T} = 1
@test length(methods(cycle_in_solve_tvar_constraints)) == 2
# issue #12967
foo12967(x, @nospecialize y) = 1
TupleType12967{T<:Tuple} = Type{T}
foo12967(x, ::TupleType12967) = 2
@test foo12967(1, Int) == 1
@test foo12967(1, Tuple{}) == 2
# issue #13083
@test Nothing() === nothing
# issue discovered in #11973
for j = 1:1
x = try
error()
2
catch
continue
end
end
# PR 11888
struct A11888{T}
a::NTuple{16,T}
end
B11888{T} = A11888{A11888{A11888{T}}}
@test sizeof(B11888{B11888{Int64}}) == (1 << 24) * 8
# issue #13175
struct EmptyImmutable13175 end
struct EmptyIIOtherField13175
x::EmptyImmutable13175
y::Float64
end
@test EmptyIIOtherField13175(EmptyImmutable13175(), 1.0) == EmptyIIOtherField13175(EmptyImmutable13175(), 1.0)
@test EmptyIIOtherField13175(EmptyImmutable13175(), 1.0) != EmptyIIOtherField13175(EmptyImmutable13175(), 2.0)
# issue 8932 (llvm return type legalizer error)
struct Vec3_8932
x::Float32
y::Float32
z::Float32
end
f8932(a::Vec3_8932, b::Vec3_8932) = Vec3_8932(a.x % b.x, a.y % b.y, a.z % b.z)
a8932 = Vec3_8932(1,1,1)
b8932 = Vec3_8932(2,2,2)
@test f8932(a8932, b8932) == Vec3_8932(1.0, 1.0, 1.0)
# issue #13261
f13261() = (x = (error("oops"),); +(x...))
g13261() = f13261()
@test_throws ErrorException g13261()
# issue 13432
@noinline function f13432(x)
offset = x ? Base.Bottom : 1
return ===(offset, Base.Bottom)
end
@test f13432(true) == true
@test f13432(false) == false
@noinline function f13432b(x)
a = x ? 1 : 1.0
b = x ? 1 : 1.0f0
return ===(a, b)
end
@test f13432b(true) == true
@test f13432b(false) == false
#13433, read!(::IO, a::Vector{UInt8}) should return a
mutable struct IO13433 <: IO end
Base.read(::IO13433, ::Type{UInt8}) = 0x01
@test read!(IO13433(), Array{UInt8}(undef, 4)) == [0x01, 0x01, 0x01, 0x01]
# issue #13647, comparing boxed isbits immutables
struct X13647
a::Int
b::Bool
end
function f13647(x, y)
z = false
z = y
x === z
end
@test f13647(X13647(1, false), X13647(1, false))
@test !f13647(X13647(1, false), X13647(1, true))
@test !f13647(X13647(2, false), X13647(1, false))
# issue #13636
module I13636
foo(x) = 1
end
let cache = Dict()
function I13636.foo(y::Int;k::Int=1)
cache[1] = y+k
end
end
@test I13636.foo(1,k=2) == 3
# issue #11327 and #13547
@test_throws MethodError convert(Type{Int}, Float32)
@test_throws MethodError Array{Type{Int64}}([Float32])
abstract type A11327 end
abstract type B11327 <: A11327 end
f11327(::Type{T},x::T) where {T} = x
@test_throws MethodError f11327(Type{A11327},B11327)
# issue #8487
@test [x for x in 1:3] == [x for x ∈ 1:3] == [x for x = 1:3]
let A = Matrix{Int}(undef, 4,3)
for i ∈ 1:size(A,1), j ∈ 1:size(A,2)
A[i,j] = 17*i + 51*j
end
@test A == [17*i + 51*j for i ∈ 1:size(A,1), j ∈ 1:size(A,2)]
end
# check if finalizers for the old gen can be triggered manually
# issue #13986
let
obj = Ref(1)
finalized = 0
finalizer((obj) -> (finalized = 1), obj)
# obj should be marked for promotion after the second gc and be promoted
# after the third GC
# GC_CLEAN; age = 0
GC.gc(false)
# GC_CLEAN; age = 1
GC.gc(false)
# GC_QUEUED; age = 1
GC.gc(false)
# GC_MARKED; age = 1
finalize(obj)
@test finalized == 1
end
# check if finalizers for the old gen can be triggered manually
# PR #14181
let
# The following three `GC.gc(false)` clears the `finalizer_list`. It is
# not strictly necessary to make the test pass but should make the failure
# more repeatable if something breaks.
GC.gc(false)
# At least: GC_CLEAN; age = 1
GC.gc(false)
# At least: GC_QUEUED; age = 1
GC.gc(false)
# all objects in `finalizer_list` are now moved to `finalizer_list_marked`
obj1 = Ref(1)
obj2 = Ref(1)
finalized = 0
finalizer((obj) -> (finalized += 1), obj1)
finalizer((obj) -> (finalized += 1), obj1)
finalizer((obj) -> (finalized += 1; finalize(obj1)), obj2)
finalizer((obj) -> (finalized += 1; finalize(obj1)), obj2)
finalize(obj2)
@test finalized == 4
end
# issue #14323
@test eval(Expr(:block, :(1))) === 1
# issue #14339
f14339(x::T, y::T) where {T<:Union{}} = 0
@test_throws MethodError f14339(1, 2)
# Make sure jlcall objects are rooted
# PR #14301
module JLCall14301
# Define f
function f end
let i = Any[[1.23], [2.34]]
# f() with capture variables
# Intentionally type unstable so that the dynamic dispatch will
# read the corrupted tag if the object is incorrectly GC'd.
global @noinline f() = i[1][1] * i[2][1]
end
# Another function that use f()
g() = f() * 100
# Compile it
g()
let i = 9.0
# Override f()
global @noinline f() = i + 1
end
# Make sure the old f() method is GC'd if it was not rooted properly
GC.gc()
GC.gc()
GC.gc()
# Run again.
g()
end
# make sure codegen doesn't remove argument to `isa`
@noinline __g_isa_test_1(a) = push!(a,1)
function __f_isa_arg_1()
a = []
isa(__g_isa_test_1(a), Any)
length(a)
end
@test __f_isa_arg_1() == 1
# issue #14477
struct Z14477
fld::Z14477
Z14477() = new(new())
end
let z1 = Z14477()
@test isa(z1, Z14477)
@test isa(z1.fld, Z14477)
end
# issue #8846, generic macros
macro m8846(a, b=0)
a, b
end
@test @m8846(a) === (:a, 0)
@test @m8846(a, 1) === (:a, 1)
let nometh = try; @eval @m8846(a, b, c); false; catch ex; ex; end
__source__ = LineNumberNode(@__LINE__() - 1, Symbol(@__FILE__))
nometh::LoadError
@test nometh.file === string(__source__.file)
@test nometh.line === __source__.line
e = nometh.error::MethodError
@test e.f === getfield(@__MODULE__, Symbol("@m8846"))
@test e.args === (__source__, @__MODULE__, :a, :b, :c)
end
# a simple case of parametric dispatch with unions
let foo(x::Union{T, Nothing}, y::Union{T, Nothing}) where {T} = 1
@test foo(1, nothing) === 1
@test foo(nothing, nothing) === 1
end
let foo(x::Union{T, Nothing}, y::Union{T, Nothing}) where {T} = T
@test foo(1, nothing) === Int
@test_throws UndefVarError(:T) foo(nothing, nothing)
end
module TestMacroGlobalFunction
macro makefn(f,g)
quote
global $(f)
function $(f)(x)
x+1
end
global $(g)
$(g)(x) = x+2
end
end
@makefn ff gg
end
@test TestMacroGlobalFunction.ff(1) == 2
@test TestMacroGlobalFunction.gg(1) == 3
# issue #18672
macro x18672()
quote
function f
end
end
end
let
@test isa(@x18672, Function)
end
# issue #14564
@test isa(objectid(Tuple.name.cache), Integer)
# issue #14691
mutable struct T14691; a::UInt; end
@test (T14691(0).a = 0) === 0
# issue #14245
f14245() = (v = []; push!(v, length(v)); v)
@test f14245()[1] == 0
# issue #9677
@generated function foo9677(x::AbstractArray{T,N}) where {T,N}
quote
x=$N
y=x+1
return y
end
end
foo9677(x::Array) = invoke(foo9677, Tuple{AbstractArray}, x)
@test foo9677(1:5) == foo9677(randn(3))
# issue #6846
f6846() = (please6846; 2)
@test_throws UndefVarError(:please6846) f6846()
module M6846
macro f()
return esc(:(please6846; 2))
end
end
@test_throws UndefVarError(:please6846) @M6846.f()
# issue #14758
@test isa(@eval(f14758(; $([]...)) = ()), Function)
# issue #14767
@inline f14767(x) = x ? A14767 : ()
const A14767 = f14767(false)
@test A14767 === ()
# issue #10985
f10985(::Any...) = 1
@test f10985(1, 2, 3) == 1
# a tricky case for closure conversion
mutable struct _CaptureInCtor
yy
function _CaptureInCtor(list_file::AbstractString="")
y = 0
f = x->add_node(y)
new(f(2))
end
add_node(y) = y+1
end
@test _CaptureInCtor().yy == 1
# issue #14610
let sometypes = (Int,Int8)
f(::Union{ntuple(i->Type{sometypes[i]}, length(sometypes))...}) = 1
@test hasmethod(f, (Union{Type{Int},Type{Int8}},))
end
let
b=()->c
c=1
@test b() == 1
end
# issue #14825
abstract type abstest_14825 end
mutable struct t1_14825{A <: abstest_14825, B}
x::A
y::B
end
mutable struct t2_14825{C, B} <: abstest_14825
x::C
y::t1_14825{t2_14825{C, B}, B}
end
@test t2_14825{Int,Int}.types[2] <: t1_14825
# issue #14917
@test isa(let generic
function generic end
end,
Function)
# f.(x) vectorization syntax (#15032)
@test (x -> 2x).([1,2,3]) == [2,4,6]
@test ((x,y) -> 2x+y^2).([1,2,3],[3,4,5]) == [1,2,3]*2 + [3,4,5].^2
# let syntax with multiple lhs
let z = (3,9,42)
let (a,b,c) = z
@test a == 3 && b == 9 && c == 42
end
let (a,b::Float64,c::Int8) = z
@test a == 3 && b === 9.0 && c === Int8(42)
end
z = (1, z, 10)
let (a, (b,c,d), e) = z
@test (a,b,c,d,e) == (1,3,9,42,10)
end
end
# issue #15072
let grphtest = ((1, [2]),)
for (s, g) in grphtest
g_ = map(s -> s+1, g)
@test g_ == [3]
end
for s = 1:1
end
end
# issue #15186
let ex = quote
$(if true; :(test); end)
end
@test ex.args[2] === :test
end
# issue #15180
function f15180(x::T) where T
X = Vector{T}(undef, 1)
X[1] = x
@noinline ef(::J) where {J} = (J,X[1]) # Use T
ef(::J, ::Int) where {J} = (T,J)
return ef
end
@test map(f15180(1), [1,2]) == [(Int,1),(Int,1)]
struct ValueWrapper
vpadding::NTuple{2,VecElement{UInt}}
value
ValueWrapper(value) = new((typemax(UInt), typemax(UInt)), value)
end
Base.convert(::Type{ValueWrapper}, x) = ValueWrapper(x)
for T in (Any, ValueWrapper)
let ary = Vector{T}(undef, 10)
check_undef_and_fill(ary, rng) = for i in rng
@test !isassigned(ary, i)
ary[i] = (Float64(i), i) # some non-cached content
@test isassigned(ary, i)
end
# Check if the memory is initially zerod and fill it with value
# to check if these values are not reused later.
check_undef_and_fill(ary, 1:10)
# Check if the memory grown at the end are zerod
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, 10)
check_undef_and_fill(ary, 11:20)
# Make sure the content of the memory deleted at the end are not reused
ccall(:jl_array_del_end, Cvoid, (Any, Csize_t), ary, 5)
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, 5)
check_undef_and_fill(ary, 16:20)
# Now check grow/del_end
ary = Vector{T}(undef, 1010)
check_undef_and_fill(ary, 1:1010)
# This del_beg should move the buffer
ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), ary, 1000)
ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), ary, 1000)
check_undef_and_fill(ary, 1:1000)
ary = Vector{T}(undef, 1010)
check_undef_and_fill(ary, 1:1010)
# This del_beg should not move the buffer
ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), ary, 10)
ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), ary, 10)
check_undef_and_fill(ary, 1:10)
ary = Vector{T}(undef, 1010)
check_undef_and_fill(ary, 1:1010)
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, 10)
check_undef_and_fill(ary, 1011:1020)
ccall(:jl_array_del_end, Cvoid, (Any, Csize_t), ary, 10)
ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), ary, 10)
check_undef_and_fill(ary, 1:10)
# Make sure newly malloc'd buffers are filled with 0
# test this for a few different sizes since we need to make sure
# we are malloc'ing the buffer after the grow_end and malloc is not using
# mmap directly (which may return a zero'd new page).
for n in [50, 51, 100, 101, 200, 201, 300, 301]
ary = Vector{T}(undef, n)
# Try to free the previous buffer that was filled with random content
# and to increase the chance of getting a non-zero'd buffer next time
GC.gc()
GC.gc()
GC.gc()
ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), ary, 4)
ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), ary, 4)
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, n)
ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), ary, 4)
check_undef_and_fill(ary, 1:(2n + 4))
end
ary = Vector{T}(undef, 100)
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, 10000)
ary[:] = 1:length(ary)
ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), ary, 10000)
# grow on the back until a buffer reallocation happens
cur_ptr = pointer(ary)
while cur_ptr == pointer(ary)
len = length(ary)
ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), ary, 10)
for i in (len + 1):(len + 10)
@test !isassigned(ary, i)
end
end
ary = Vector{T}(undef, 100)
ary[:] = 1:length(ary)
ccall(:jl_array_grow_at, Cvoid, (Any, Csize_t, Csize_t), ary, 50, 10)
for i in 51:60
@test !isassigned(ary, i)
end
end
end
# check if we can run multiple finalizers at the same time
# Use a `@noinline` function to make sure the inefficient gc root generation
# doesn't keep the object alive.
@noinline function create_dead_object13995(finalized)
obj = Ref(1)
finalizer((x)->(finalized[1] = true), obj)
finalizer((x)->(finalized[2] = true), obj)
finalizer((x)->(finalized[3] = true), obj)
finalizer((x)->(finalized[4] = true), obj)
nothing
end
# disable GC to make sure no collection/promotion happens
# when we are constructing the objects
get_finalizers_inhibited() = ccall(:jl_gc_get_finalizers_inhibited, Int32, (Ptr{Cvoid},), C_NULL)
let gc_enabled13995 = GC.enable(false)
@assert gc_enabled13995
@assert get_finalizers_inhibited() == 0
finalized13995 = [false, false, false, false]
create_dead_object13995(finalized13995)
GC.enable(true)
# obj is unreachable and young, a single young gc should collect it
# and trigger all the finalizers.
GC.gc(false)
GC.enable(false)
@test finalized13995 == [true, true, true, true]
GC.enable(gc_enabled13995)
end
# Ensure an independent GC frame
@noinline outlined(f) = f()
@testset "finalizers must not change the sticky flag" begin
GC.enable(false)
try
outlined() do
local obj = Ref(0)
finalizer(obj) do _
@async nothing
end
Base.donotdelete(obj)
end
task = Threads.@spawn begin
GC.enable(true)
GC.gc()
end
wait(task)
@test !task.sticky
finally
GC.enable(true)
end
end
# issue #15283
j15283 = 0
let
global j15283
k15283 = (j15283 += 1)
end
@test j15283 == 1
@test !@isdefined k15283
# issue #15264
module Test15264
mod1(x::T) where {T} = x < 1 ? x : mod1(x-1)
end
@test Test15264.mod1 !== Base.mod1
module M15455
function rpm_provides(r::T) where T
push!([], partialsort(r,T))
end
partialsort(a,b) = 0
end
@test M15455.partialsort(1,2)==0
# check that medium-sized array is 64-byte aligned (#15139)
@test Int(pointer(Vector{Float64}(undef, 1024))) % 64 == 0
# PR #15413
# Make sure arrayset can handle `Array{T}` (where `T` is a type and not a
# `TypeVar`) without crashing
let
function arrayset_unknown_dim(::Type{T}, n) where T
Base.arrayset(true, reshape(Vector{T}(undef, 1), fill(1, n)...), 2, 1)
end
arrayset_unknown_dim(Any, 1)
arrayset_unknown_dim(Any, 2)
arrayset_unknown_dim(Any, 3)
arrayset_unknown_dim(Int, 1)
arrayset_unknown_dim(Int, 2)
arrayset_unknown_dim(Int, 3)
end
module TestSharedArrayResize
using Test
# Attempting to change the shape of a shared array should unshare it and
# not modify the original data
function test_shared_array_resize(::Type{T}) where T
len = 100
a = Vector{T}(undef, len)
function test_unshare(f)
a′ = reshape(reshape(a, (len ÷ 2, 2)), len)
a[:] = 1:length(a)
# The operation should fail on the owner shared array
# and has no side effect.
@test_throws ErrorException f(a)
@test a == [1:len;]
@test a′ == [1:len;]
@test pointer(a) == pointer(a′)
# The operation should pass on the non-owner shared array
# and should unshare the arrays with no effect on the original one.
f(a′)
@test a == [1:len;]
@test pointer(a) != pointer(a′)
end
test_unshare(a->ccall(:jl_array_del_end, Cvoid, (Any, Csize_t), a, 0))
test_unshare(a->ccall(:jl_array_del_end, Cvoid, (Any, Csize_t), a, 1))
test_unshare(a->ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), a, 0))
test_unshare(a->ccall(:jl_array_del_beg, Cvoid, (Any, Csize_t), a, 1))
test_unshare(a->deleteat!(a, 10))
test_unshare(a->deleteat!(a, 90))
test_unshare(a->ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), a, 0))
test_unshare(a->ccall(:jl_array_grow_end, Cvoid, (Any, Csize_t), a, 1))
test_unshare(a->ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), a, 0))
test_unshare(a->ccall(:jl_array_grow_beg, Cvoid, (Any, Csize_t), a, 1))
test_unshare(a->insert!(a, 10, 10))
test_unshare(a->insert!(a, 90, 90))
end
test_shared_array_resize(Int)
test_shared_array_resize(Any)
end
module TestArrayNUL
using Test
function check_nul(a::Vector{UInt8})
b = ccall(:jl_array_cconvert_cstring,
Ref{Vector{UInt8}}, (Vector{UInt8},), a)
@test unsafe_load(pointer(b), length(b) + 1) == 0x0
return b === a
end
a = UInt8[]
b = "aaa"
c = [0x2, 0x1, 0x3]
@test check_nul(a)
@test check_nul(unsafe_wrap(Vector{UInt8},b))
@test check_nul(c)
d = [0x2, 0x1, 0x3]
@test check_nul(d)
push!(d, 0x3)
@test check_nul(d)
push!(d, 0x3)
@test check_nul(d)
ccall(:jl_array_del_end, Cvoid, (Any, UInt), d, 2)
@test check_nul(d)
ccall(:jl_array_grow_end, Cvoid, (Any, UInt), d, 1)
@test check_nul(d)
ccall(:jl_array_grow_end, Cvoid, (Any, UInt), d, 1)
@test check_nul(d)
ccall(:jl_array_grow_end, Cvoid, (Any, UInt), d, 10)
@test check_nul(d)
ccall(:jl_array_del_beg, Cvoid, (Any, UInt), d, 8)
@test check_nul(d)
ccall(:jl_array_grow_beg, Cvoid, (Any, UInt), d, 8)
@test check_nul(d)
ccall(:jl_array_grow_beg, Cvoid, (Any, UInt), d, 8)
@test check_nul(d)
f = unsafe_wrap(Array, pointer(d), length(d))
@test !check_nul(f)
f = unsafe_wrap(Array, ccall(:malloc, Ptr{UInt8}, (Csize_t,), 10), 10, own = true)
@test !check_nul(f)
end
# Copy of `#undef`
copyto!(Vector{Any}(undef, 10), Vector{Any}(undef, 10))
function test_copy_alias(::Type{T}) where T
ary = T[1:100;]
unsafe_copyto!(ary, 1, ary, 11, 90)
@test ary == [11:100; 91:100]
ary = T[1:100;]
unsafe_copyto!(ary, 11, ary, 1, 90)
@test ary == [1:10; 1:90]
end
test_copy_alias(Int)
test_copy_alias(Any)
test_copy_alias(Union{Int,Nothing})
# issue #15370
@test isdefined(Core, :Box)
@test !isdefined(Base, :Box)
@test !isdefined(Main, :Box)
# issue #1784
let a = [false]
function foo1784()
(a,b) = try
return true
(0,1)
finally
a[1] = true
end
end
@test foo1784()
@test a[1] == true
end
# issue #14113
module A14113
using Test, Random
# show that making several thousand methods (and lots of AST constants)
# doesn't cause any serious issues (for example, for the serializer)
# although to keep runtime on the order of several seconds for this test,
# only several hundred of them are compiled / called
for i = 1:2^14 + 256
r = rand(2^4)
code = Expr(:tuple, r...)
f = @eval () -> $code
i > (2^14 - 256) && @test [f()...] == r
end
end
# issue #15425
@noinline function f15425(x)
end
@test f15425(1) === nothing
# issue #15809
# but note, direct global method defs inside functions have since been disallowed
function f15809()
@eval g15809(x::T) where {T} = T
end
f15809()
@test g15809(2) === Int
module Macro_Yielding_Global_Assignment
macro m()
quote
global x
x = 2
end
end
@m
end
@test Macro_Yielding_Global_Assignment.x == 2
# issue #15718
@test :(f($NaN)) == :(f($NaN))
@test isequal(:(f($NaN)), :(f($NaN)))
# PR #16011 Make sure dead code elimination doesn't delete push and pop
# of metadata
module TestDeadElim16011
using Test
function count_expr_push(ex::Expr, head::Symbol, counter)
if ex.head === head
if ex.args[1] === :pop
counter[] -= 1
else
counter[] += 1
end
return
end
for arg in ex.args
isa(arg, Expr) && count_expr_push(arg, head, counter)
end
return false
end
function metadata_matches(ast::Core.CodeInfo)
inbounds_cnt = Ref(0)
for ex in ast.code::Array{Any,1}
if isa(ex, Expr)
ex = ex::Expr
count_expr_push(ex, :inbounds, inbounds_cnt)
end
end
@test inbounds_cnt[] == 0
end
function test_metadata_matches(@nospecialize(f), @nospecialize(tt))
metadata_matches(code_typed(f, tt)[1][1])
end
function f1()
@inbounds return 1
end
function f2()
@boundscheck begin
error()
end
end
# No, don't write code this way...
@noinline function g(a)
end
@eval function f3()
g($(Expr(:inbounds, true)))
@goto out
g($(Expr(:inbounds, :pop)))
@label out
end
test_metadata_matches(f1, Tuple{})
test_metadata_matches(f2, Tuple{})
test_metadata_matches(f3, Tuple{})
end
# SSA value where the assignment is after the user in syntactic order
let f = function(a, b)
@goto a
@label b
return j[1] + j[2] * 2
@label a
j = (a, b)
@goto b
end
@test f(1, 2) == 5
end
# issue #8712
mutable struct Issue8712; end
@test isa(invoke(Issue8712, Tuple{}), Issue8712)
# issue #16089
f16089(args...) = typeof(args)
g16089() = f16089(UInt8)
@test g16089() === Tuple{DataType}
# issue #16023
function f16023()
x
x = 1
end
@test_throws UndefVarError f16023()
# issue #16158
function f16158(x)
bar(x) = length(x)==1 ? x : string(x, bar(x[1:end-1]))
bar(x)
end
@test f16158("abc") == "abcaba"
# LLVM verifier error for noreturn function
# the `code_llvm(devnull, ...)` tests are only meaningful on debug build
# with verifier on (but should still pass on release build).
module TestSSA16244
using Test, InteractiveUtils
@noinline k(a) = a
# unreachable branch due to `ccall(:jl_throw)`
function f1(a)
if a
b = (k(a) + 1, 3)
else
throw(DivideError())
end
b[1]
end
code_llvm(devnull, f1, Tuple{Bool})
@test f1(true) == 2
@test_throws DivideError f1(false)
# unreachable branch due to function that does not return
@noinline g() = error()
function f2(a)
if a
b = (k(a) + 1, 3)
else
# Make sure type inference can infer the type of `g`
g()
end
b[1]
end
code_llvm(devnull, f2, Tuple{Bool})
@test f2(true) == 2
@test_throws ErrorException f2(false)
# SA but not SSA
function f3(a)
if a
b = (k(a) + 1, 3)
end
b[1]
end
code_llvm(devnull, f3, Tuple{Bool})
@test f3(true) == 2
ex = try
f3(false)
catch _ex
_ex
end
@test isa(ex, UndefVarError)
@test ex.var === :b
# unreachable branch due to ccall that does not return
function f4(a, p)
if a
b = (k(a) + 1, 3)
else
ccall(p, Union{}, ())
end
b[1]
end
code_llvm(devnull, f4, Tuple{Bool,Ptr{Cvoid}})
@test f4(true, C_NULL) == 2
@test_throws UndefRefError f4(false, C_NULL)
# SSA due to const prop of condition
function f5(a)
c = true
if c
b = (k(a) + 1, 3)
end
b[1]
end
code_llvm(devnull, f5, Tuple{Bool})
@test f5(true) == 2
@test f5(false) == 1
# SSA due to const prop of condition
function f6(a)
if 1 === 1
b = (k(a) + 1, 3)
end
b[1]
end
code_llvm(devnull, f6, Tuple{Bool})
@test f6(true) == 2
@test f6(false) == 1
# unreachable branch due to typeassert
function f7(a)
if a
b = (k(a) + 1, 3)
else
a = a::Int
end
b[1]
end
code_llvm(devnull, f7, Tuple{Bool})
@test f7(true) == 2
@test_throws TypeError f7(false)
# unreachable branch due to non-Bool used in Bool context
function f8(a, c)
if a
b = (k(a) + 1, 3)
else
c && a
end
b[1]
end
code_llvm(devnull, f8, Tuple{Bool,Int})
@test f8(true, 1) == 2
@test_throws TypeError f8(false, 1)
# unreachable branch due to undef local variable
function f9(a)
if a
b = (k(a) + 1, 3)
else
d
d = 1
end
b[1]
end
code_llvm(devnull, f9, Tuple{Bool})
@test f9(true) == 2
ex = try
f9(false)
catch _ex
_ex
end
@test isa(ex, UndefVarError)
@test ex.var === :d
end
# issue #16153
f16153(x) = 1
f16153(@nospecialize(x), y...) = 2
@test f16153("") == 1
ff16153(@nospecialize(x), y...) = 2
ff16153(x) = 1
@test ff16153("") == 1
g16153(@nospecialize(x), y...) = 1
g16153(@nospecialize(x), @nospecialize(y)) = 2
@test g16153(1, 1) == 2
gg16153(@nospecialize(x), @nospecialize(y)) = 2
gg16153(@nospecialize(x), y...) = 1
@test gg16153(1, 1) == 2
# don't remove global variable accesses even if we "know" their type
# see #16090
f16090() = typeof(undefined_x16090::Tuple{Type{Int}})
@test_throws UndefVarError f16090()
undefined_x16090 = (Int,)
@test_throws TypeError f16090()
# issue #12238
struct A12238{T} end
mutable struct B12238{T,S}
a::A12238{B12238{Int,S}}
end
@test B12238.body.body.types[1] === A12238{B12238{Int}.body}
@test isa(A12238{B12238{Int}}.instance, A12238{B12238{Int}})
let ft = Base.datatype_fieldtypes
@test !isdefined(ft(B12238.body.body)[1], :instance) # has free type vars
end
# `where` syntax in constructor definitions
(A12238{T} where T<:Real)(x) = 0
@test A12238{<:Real}(0) == 0
@test_throws MethodError A12238{<:Integer}(0)
# issue #16315
let a = Any[]
@noinline f() = a[end]
@test (push!(a,10); f()) - (push!(a,2); f()) == 8
@test a == [10, 2]
end
# issue #12096
let a = Val{Val{TypeVar(:_, Int)}},
b = Val{Val{x} where x<:Int}
@test !isdefined(a, :instance)
@test isdefined(b, :instance)
@test Base.isconcretetype(b)
end
# A return type widened to Type{Union{T,Nothing}} should not confuse
# codegen
@noinline MaybeFunc(T) = Union{T, Nothing}
fMaybeFunc() = MaybeFunc(Int64)
@test fMaybeFunc() == Union{Int64, Nothing}
# issue #16431
function f16431(x)
z::Int = x * 2
g(y) = begin z = z + y; y + x end
z * g(x)
end
@test @inferred(f16431(1)) == 4
# issue #14878
mutable struct A14878
ext
end
A14878() = A14878(Dict())
mutable struct B14878
end
B14878(ng) = B14878()
function trigger14878()
w = A14878()
w.ext[:14878] = B14878(junk) # global junk not defined!
return w
end
@test_throws UndefVarError(:junk) trigger14878()
# issue #1090
function f1090(x)::Int
if x == 1
return 1
end
2.0
end
@test f1090(1) === 1
@test f1090(2) === 2
(g1090(x::T)::T) where {T} = x+1.0
@test g1090(1) === 2
@test g1090(Float32(3)) === Float32(4)
# error during conversion to return type
function f1090_err()::Int
try
return ""
catch
8
end
end
@test_throws MethodError f1090_err()
function f17613_2(x)::Float64
try
return x
catch
return x+1
end
end
@test isa(f17613_2(1), Float64)
# return type decl with `where`
function where1090(x::Array{T})::T where T<:Real
return x[1] + 2.0
end
@test where1090([4]) === 6
@test_throws MethodError where1090(String[])
mutable struct A1090 end
Base.convert(::Type{Int}, ::A1090) = "hey"
f1090()::Int = A1090()
@test_throws TypeError f1090()
# issue #19106
function f19106()::Nothing end
@test f19106() === nothing
# issue #16783
function f16783()
T = UInt32
x::T = 0
bar() = x+1
end
@test f16783()() == 1
# issue #16767
mutable struct A16767{T}
a::Base.RefValue{T}
end
mutable struct B16767{T}
b::A16767{B16767{T}}
end
mutable struct C16767{T}
b::A16767{C16767{:a}}
end
let ft = Base.datatype_fieldtypes
@test ft(ft(B16767.body.types[1])[1].parameters[1])[1] === A16767{B16767.body}
@test ft(C16767.body.types[1].types[1].parameters[1])[1] === A16767{C16767{:a}}
end
# issue #16340
function f16340(x::T) where T
function g(y::T) where T
return (T,T)
end
return g
end
let g = f16340(1)
@test isa(typeof(g).name.mt.defs.sig, UnionAll)
end
# issue #16793
try
abstract type T16793 end
catch
end
@test isa(T16793, Type)
@test isa(abstract type T16793_2 end, Nothing)
# issue #17147
f17147(::Tuple) = 1
f17147(::Vararg{Tuple,N}) where {N} = 2
@test f17147((), ()) == 2
# issue #17449, argument evaluation order
@noinline f17449(x, y) = nothing
@noinline function g17449(r)
r[] = :g
return 1
end
@noinline function k17449(r, v)
r[] = :k
return v ? 1 : 1.0
end
function h17449(v)
r = Ref(:h)
f17449(g17449(r), k17449(r, v))
return r[]
end
@test h17449(true) === :k
# make sure lowering agrees on sp order
function captsp(x::T, y::S) where {T, S}
subf(x2::Int) = T
subf(x2::UInt) = S
return subf(Int(1)), subf(UInt(1))
end
@test captsp(1, 2.0) == (Int, Float64)
# issue #15068
function sp_innersig(x::T) where {T}
subf(x2::T) = (x, x2, :a)
subf(x2) = (x, x2, :b)
return (subf(one(T)), subf(unsigned(one(T))))
end
@test sp_innersig(2) == ((2, 1, :a), (2, UInt(1), :b))
# TODO: also allow local variables?
#function local_innersig{T}(x::T)
# V = typeof(x)
# U = unsigned(T)
# subf(x2::T, x3::Complex{V}) = (x, x2, x3)
# subf(x2::U) = (x, x2)
# return (subf(one(T), x * im), subf(unsigned(one(T))))
#end
#@test local_innersig(Int32(2)) == ((Int32(2), Int32(1), Int32(2)im), (Int32(2), UInt32(1)))
#@test local_innersig(Int64(3)) == ((Int64(3), Int64(1), Int64(3)im), (Int64(3), UInt64(1)))
# Issue 4914
let
j(j) = j
@test j(1) == 1
k(x) = (k = x; k)
@test k(1) == 1
end
# issue #18085
f18085(a, x...) = (0, )
for (f, g) in ((:asin, :sin), (:acos, :cos))
gx = eval(g)
global f18085(::Type{Val{f}}, x...) = map(x -> 2gx(x), f18085(Val{g}, x...))
end
@test f18085(Val{:asin}, 3) === (0.0,)
# issue #18236 constant VecElement in ast triggers codegen assertion/undef
# VecElement of scalar
v18236 = VecElement(1.0)
ptr18236 = @cfunction(identity, VecElement{Float64}, (VecElement{Float64},))
@eval @noinline f18236(ptr) = ccall(ptr, VecElement{Float64},
(VecElement{Float64},), $v18236)
@test f18236(ptr18236) === v18236
@test !occursin("double undef", sprint(code_llvm, f18236, Tuple{Ptr{Cvoid}}))
# VecElement of struct, not necessarily useful but does have special
# ABI so should be handled correctly
# This struct should be small enough to be passed by value in C ABI
# in order to trigger the problematic code path.
# We should be at least testing this on some platforms.
# Not sure if there's a better way to trigger unboxing in codegen.
v18236_2 = VecElement((Int8(1), Int8(2)))
ptr18236_2 = @cfunction(identity, VecElement{NTuple{2,Int8}},
(VecElement{NTuple{2,Int8}},))
@eval @noinline f18236_2(ptr) = ccall(ptr, VecElement{NTuple{2,Int8}},
(VecElement{NTuple{2,Int8}},),
$v18236_2)
@test f18236_2(ptr18236_2) === v18236_2
# issue #18385
function f18385(g)
if g
a = (1, 2)
end
return a[1]
end
@test f18385(true) === 1
# variable name in the error is tested above in `TestSSA16244`
@test_throws UndefVarError f18385(false)
# Another similar issue, make sure newvar nodes are created for the fields
# variables too.
function f18386(a, b, second_pass)
s = 0
firstpass = true
for i in 1:2
if firstpass
x = (a, b)
firstpass = !second_pass
end
s += x[1]
end
s
end
@test f18386(1, 2, false) === 2
# variable name in the error is tested above in `TestSSA16244`
@test_throws UndefVarError f18386(1, 2, true)
Base.@propagate_inbounds function f18412(a)
@inbounds b = a[1]
return b
end
@test f18412([1]) == 1
# issue #18173
function f18173()
identity(()->successflag)
successflag = false
end
@test f18173() == false
fVararg(x) = Vararg{x}
gVararg(a::fVararg(Int)) = length(a)
@test gVararg(1,2,3,4,5) == 5
# issue #18577
@generated f18577() = quote ()->1 end
@test try
f18577()
false
catch e
(e::ErrorException).msg
end == "The function body AST defined by this @generated function is not pure. " *
"This likely means it contains a closure, a comprehension or a generator."
let x = 1
global g18444
@noinline g18444(a) = (x += 1; a[])
f18444_1(a) = invoke(sin, Tuple{Int}, g18444(a))
f18444_2(a) = invoke(sin, Tuple{Integer}, g18444(a))
@test_throws ErrorException("invoke: argument type error") f18444_1(Ref{Any}(1.0))
@test x == 2
@test_throws ErrorException("invoke: argument type error") f18444_2(Ref{Any}(1.0))
@test x == 3
@test f18444_1(Ref{Any}(1)) === sin(1)
@test x == 4
@test f18444_2(Ref{Any}(1)) === sin(1)
@test x == 5
end
f18095(::Int, ::Number) = 0x21
f18095(::Number, ::Int) = 0x12
@test_throws MethodError f18095(1, 2)
@test_throws MethodError invoke(f18095, Tuple{Int, Int}, 1, 2)
@test_throws MethodError invoke(f18095, Tuple{Int, Any}, 1, 2)
@test invoke(f18095, Tuple{Int, Real}, 1, 2) === 0x21
# `invoke` with non-constant function
struct CassetteLikeWrapper{F}
x
f::F
end
(foo::CassetteLikeWrapper)(args...) = foo.f(args...)
(foo::CassetteLikeWrapper)(x) = invoke(foo, Tuple{Vararg{Any}}, x)
@test CassetteLikeWrapper(1,-)(2) == -2
f26301(x) = 1
f26301(x::Int) = 2
function g26301()
f = Any[f26301][1]
invoke(f, Tuple{Any}, 0)
end
@test g26301() == 1
# issue #10981, long argument lists
let a = fill(["sdf"], 2*10^6), temp_vcat(x...) = vcat(x...)
# we introduce a new function `temp_vcat` to make sure there is no existing
# method cache match, leading to a path that allocates a large tuple type.
b = temp_vcat(a...)
@test isa(b, Vector{String})
@test length(b) == 2*10^6
@test b[1] == b[end] == "sdf"
end
# test for splatting of something fairly large and unusual (not builtin or pre-countable)
@noinline splat10981(a...) = a
for trail in ((), ntuple(_ -> (), 4 * 10^7)) # 150 / 300 MB of pointers
got = splat10981((1, 2, "3")..., (trail...)..., Core.svec("4",)..., (5 => 6)..., (trail...)..., ([i => j for i in 1:100, j=2.0:2:20]...)..., ntuple(identity, 1000)..., (trail...)...)
expected = (1,2,"3","4",5,6,1,2.0,2,2.0,3,2.0,4,2.0,5,2.0,6,2.0,7,2.0,8,2.0,9,2.0,10,2.0,11,2.0,12,2.0,13,2.0,14,2.0,15,2.0,16,2.0,17,2.0,18,2.0,19,2.0,20,2.0,21,2.0,22,2.0,23,2.0,24,2.0,25,2.0,26,2.0,27,2.0,28,2.0,29,2.0,30,2.0,31,2.0,32,2.0,33,2.0,34,2.0,35,2.0,36,2.0,37,2.0,38,2.0,39,2.0,40,2.0,41,2.0,42,2.0,43,2.0,44,2.0,45,2.0,46,2.0,47,2.0,48,2.0,49,2.0,50,2.0,51,2.0,52,2.0,53,2.0,54,2.0,55,2.0,56,2.0,57,2.0,58,2.0,59,2.0,60,2.0,61,2.0,62,2.0,63,2.0,64,2.0,65,2.0,66,2.0,67,2.0,68,2.0,69,2.0,70,2.0,71,2.0,72,2.0,73,2.0,74,2.0,75,2.0,76,2.0,77,2.0,78,2.0,79,2.0,80,2.0,81,2.0,82,2.0,83,2.0,84,2.0,85,2.0,86,2.0,87,2.0,88,2.0,89,2.0,90,2.0,91,2.0,92,2.0,93,2.0,94,2.0,95,2.0,96,2.0,97,2.0,98,2.0,99,2.0,100,2.0,1,4.0,2,4.0,3,4.0,4,4.0,5,4.0,6,4.0,7,4.0,8,4.0,9,4.0,10,4.0,11,4.0,12,4.0,13,4.0,14,4.0,15,4.0,16,4.0,17,4.0,18,4.0,19,4.0,20,4.0,21,4.0,22,4.0,23,4.0,24,4.0,25,4.0,26,4.0,27,4.0,28,4.0,29,4.0,30,4.0,31,4.0,32,4.0,33,4.0,34,4.0,35,4.0,36,4.0,37,4.0,38,4.0,39,4.0,40,4.0,41,4.0,42,4.0,43,4.0,44,4.0,45,4.0,46,4.0,47,4.0,48,4.0,49,4.0,50,4.0,51,4.0,52,4.0,53,4.0,54,4.0,55,4.0,56,4.0,57,4.0,58,4.0,59,4.0,60,4.0,61,4.0,62,4.0,63,4.0,64,4.0,65,4.0,66,4.0,67,4.0,68,4.0,69,4.0,70,4.0,71,4.0,72,4.0,73,4.0,74,4.0,75,4.0,76,4.0,77,4.0,78,4.0,79,4.0,80,4.0,81,4.0,82,4.0,83,4.0,84,4.0,85,4.0,86,4.0,87,4.0,88,4.0,89,4.0,90,4.0,91,4.0,92,4.0,93,4.0,94,4.0,95,4.0,96,4.0,97,4.0,98,4.0,99,4.0,100,4.0,1,6.0,2,6.0,3,6.0,4,6.0,5,6.0,6,6.0,7,6.0,8,6.0,9,6.0,10,6.0,11,6.0,12,6.0,13,6.0,14,6.0,15,6.0,16,6.0,17,6.0,18,6.0,19,6.0,20,6.0,21,6.0,22,6.0,23,6.0,24,6.0,25,6.0,26,6.0,27,6.0,28,6.0,29,6.0,30,6.0,31,6.0,32,6.0,33,6.0,34,6.0,35,6.0,36,6.0,37,6.0,38,6.0,39,6.0,40,6.0,41,6.0,42,6.0,43,6.0,44,6.0,45,6.0,46,6.0,47,6.0,48,6.0,49,6.0,50,6.0,51,6.0,52,6.0,53,6.0,54,6.0,55,6.0,56,6.0,57,6.0,58,6.0,59,6.0,60,6.0,61,6.0,62,6.0,63,6.0,64,6.0,65,6.0,66,6.0,67,6.0,68,6.0,69,6.0,70,6.0,71,6.0,72,6.0,73,6.0,74,6.0,75,6.0,76,6.0,77,6.0,78,6.0,79,6.0,80,6.0,81,6.0,82,6.0,83,6.0,84,6.0,85,6.0,86,6.0,87,6.0,88,6.0,89,6.0,90,6.0,91,6.0,92,6.0,93,6.0,94,6.0,95,6.0,96,6.0,97,6.0,98,6.0,99,6.0,100,6.0,1,8.0,2,8.0,3,8.0,4,8.0,5,8.0,6,8.0,7,8.0,8,8.0,9,8.0,10,8.0,11,8.0,12,8.0,13,8.0,14,8.0,15,8.0,16,8.0,17,8.0,18,8.0,19,8.0,20,8.0,21,8.0,22,8.0,23,8.0,24,8.0,25,8.0,26,8.0,27,8.0,28,8.0,29,8.0,30,8.0,31,8.0,32,8.0,33,8.0,34,8.0,35,8.0,36,8.0,37,8.0,38,8.0,39,8.0,40,8.0,41,8.0,42,8.0,43,8.0,44,8.0,45,8.0,46,8.0,47,8.0,48,8.0,49,8.0,50,8.0,51,8.0,52,8.0,53,8.0,54,8.0,55,8.0,56,8.0,57,8.0,58,8.0,59,8.0,60,8.0,61,8.0,62,8.0,63,8.0,64,8.0,65,8.0,66,8.0,67,8.0,68,8.0,69,8.0,70,8.0,71,8.0,72,8.0,73,8.0,74,8.0,75,8.0,76,8.0,77,8.0,78,8.0,79,8.0,80,8.0,81,8.0,82,8.0,83,8.0,84,8.0,85,8.0,86,8.0,87,8.0,88,8.0,89,8.0,90,8.0,91,8.0,92,8.0,93,8.0,94,8.0,95,8.0,96,8.0,97,8.0,98,8.0,99,8.0,100,8.0,1,10.0,2,10.0,3,10.0,4,10.0,5,10.0,6,10.0,7,10.0,8,10.0,9,10.0,10,10.0,11,10.0,12,10.0,13,10.0,14,10.0,15,10.0,16,10.0,17,10.0,18,10.0,19,10.0,20,10.0,21,10.0,22,10.0,23,10.0,24,10.0,25,10.0,26,10.0,27,10.0,28,10.0,29,10.0,30,10.0,31,10.0,32,10.0,33,10.0,34,10.0,35,10.0,36,10.0,37,10.0,38,10.0,39,10.0,40,10.0,41,10.0,42,10.0,43,10.0,44,10.0,45,10.0,46,10.0,47,10.0,48,10.0,49,10.0,50,10.0,51,10.0,52,10.0,53,10.0,54,10.0,55,10.0,56,10.0,57,10.0,58,10.0,59,10.0,60,10.0,61,10.0,62,10.0,63,10.0,64,10.0,65,10.0,66,10.0,67,10.0,68,10.0,69,10.0,70,10.0,71,10.0,72,10.0,73,10.0,74,10.0,75,10.0,76,10.0,77,10.0,78,10.0,79,10.0,80,10.0,81,10.0,82,10.0,83,10.0,84,10.0,85,10.0,86,10.0,87,10.0,88,10.0,89,10.0,90,10.0,91,10.0,92,10.0,93,10.0,94,10.0,95,10.0,96,10.0,97,10.0,98,10.0,99,10.0,100,10.0,1,12.0,2,12.0,3,12.0,4,12.0,5,12.0,6,12.0,7,12.0,8,12.0,9,12.0,10,12.0,11,12.0,12,12.0,13,12.0,14,12.0,15,12.0,16,12.0,17,12.0,18,12.0,19,12.0,20,12.0,21,12.0,22,12.0,23,12.0,24,12.0,25,12.0,26,12.0,27,12.0,28,12.0,29,12.0,30,12.0,31,12.0,32,12.0,33,12.0,34,12.0,35,12.0,36,12.0,37,12.0,38,12.0,39,12.0,40,12.0,41,12.0,42,12.0,43,12.0,44,12.0,45,12.0,46,12.0,47,12.0,48,12.0,49,12.0,50,12.0,51,12.0,52,12.0,53,12.0,54,12.0,55,12.0,56,12.0,57,12.0,58,12.0,59,12.0,60,12.0,61,12.0,62,12.0,63,12.0,64,12.0,65,12.0,66,12.0,67,12.0,68,12.0,69,12.0,70,12.0,71,12.0,72,12.0,73,12.0,74,12.0,75,12.0,76,12.0,77,12.0,78,12.0,79,12.0,80,12.0,81,12.0,82,12.0,83,12.0,84,12.0,85,12.0,86,12.0,87,12.0,88,12.0,89,12.0,90,12.0,91,12.0,92,12.0,93,12.0,94,12.0,95,12.0,96,12.0,97,12.0,98,12.0,99,12.0,100,12.0,1,14.0,2,14.0,3,14.0,4,14.0,5,14.0,6,14.0,7,14.0,8,14.0,9,14.0,10,14.0,11,14.0,12,14.0,13,14.0,14,14.0,15,14.0,16,14.0,17,14.0,18,14.0,19,14.0,20,14.0,21,14.0,22,14.0,23,14.0,24,14.0,25,14.0,26,14.0,27,14.0,28,14.0,29,14.0,30,14.0,31,14.0,32,14.0,33,14.0,34,14.0,35,14.0,36,14.0,37,14.0,38,14.0,39,14.0,40,14.0,41,14.0,42,14.0,43,14.0,44,14.0,45,14.0,46,14.0,47,14.0,48,14.0,49,14.0,50,14.0,51,14.0,52,14.0,53,14.0,54,14.0,55,14.0,56,14.0,57,14.0,58,14.0,59,14.0,60,14.0,61,14.0,62,14.0,63,14.0,64,14.0,65,14.0,66,14.0,67,14.0,68,14.0,69,14.0,70,14.0,71,14.0,72,14.0,73,14.0,74,14.0,75,14.0,76,14.0,77,14.0,78,14.0,79,14.0,80,14.0,81,14.0,82,14.0,83,14.0,84,14.0,85,14.0,86,14.0,87,14.0,88,14.0,89,14.0,90,14.0,91,14.0,92,14.0,93,14.0,94,14.0,95,14.0,96,14.0,97,14.0,98,14.0,99,14.0,100,14.0,1,16.0,2,16.0,3,16.0,4,16.0,5,16.0,6,16.0,7,16.0,8,16.0,9,16.0,10,16.0,11,16.0,12,16.0,13,16.0,14,16.0,15,16.0,16,16.0,17,16.0,18,16.0,19,16.0,20,16.0,21,16.0,22,16.0,23,16.0,24,16.0,25,16.0,26,16.0,27,16.0,28,16.0,29,16.0,30,16.0,31,16.0,32,16.0,33,16.0,34,16.0,35,16.0,36,16.0,37,16.0,38,16.0,39,16.0,40,16.0,41,16.0,42,16.0,43,16.0,44,16.0,45,16.0,46,16.0,47,16.0,48,16.0,49,16.0,50,16.0,51,16.0,52,16.0,53,16.0,54,16.0,55,16.0,56,16.0,57,16.0,58,16.0,59,16.0,60,16.0,61,16.0,62,16.0,63,16.0,64,16.0,65,16.0,66,16.0,67,16.0,68,16.0,69,16.0,70,16.0,71,16.0,72,16.0,73,16.0,74,16.0,75,16.0,76,16.0,77,16.0,78,16.0,79,16.0,80,16.0,81,16.0,82,16.0,83,16.0,84,16.0,85,16.0,86,16.0,87,16.0,88,16.0,89,16.0,90,16.0,91,16.0,92,16.0,93,16.0,94,16.0,95,16.0,96,16.0,97,16.0,98,16.0,99,16.0,100,16.0,1,18.0,2,18.0,3,18.0,4,18.0,5,18.0,6,18.0,7,18.0,8,18.0,9,18.0,10,18.0,11,18.0,12,18.0,13,18.0,14,18.0,15,18.0,16,18.0,17,18.0,18,18.0,19,18.0,20,18.0,21,18.0,22,18.0,23,18.0,24,18.0,25,18.0,26,18.0,27,18.0,28,18.0,29,18.0,30,18.0,31,18.0,32,18.0,33,18.0,34,18.0,35,18.0,36,18.0,37,18.0,38,18.0,39,18.0,40,18.0,41,18.0,42,18.0,43,18.0,44,18.0,45,18.0,46,18.0,47,18.0,48,18.0,49,18.0,50,18.0,51,18.0,52,18.0,53,18.0,54,18.0,55,18.0,56,18.0,57,18.0,58,18.0,59,18.0,60,18.0,61,18.0,62,18.0,63,18.0,64,18.0,65,18.0,66,18.0,67,18.0,68,18.0,69,18.0,70,18.0,71,18.0,72,18.0,73,18.0,74,18.0,75,18.0,76,18.0,77,18.0,78,18.0,79,18.0,80,18.0,81,18.0,82,18.0,83,18.0,84,18.0,85,18.0,86,18.0,87,18.0,88,18.0,89,18.0,90,18.0,91,18.0,92,18.0,93,18.0,94,18.0,95,18.0,96,18.0,97,18.0,98,18.0,99,18.0,100,18.0,1,20.0,2,20.0,3,20.0,4,20.0,5,20.0,6,20.0,7,20.0,8,20.0,9,20.0,10,20.0,11,20.0,12,20.0,13,20.0,14,20.0,15,20.0,16,20.0,17,20.0,18,20.0,19,20.0,20,20.0,21,20.0,22,20.0,23,20.0,24,20.0,25,20.0,26,20.0,27,20.0,28,20.0,29,20.0,30,20.0,31,20.0,32,20.0,33,20.0,34,20.0,35,20.0,36,20.0,37,20.0,38,20.0,39,20.0,40,20.0,41,20.0,42,20.0,43,20.0,44,20.0,45,20.0,46,20.0,47,20.0,48,20.0,49,20.0,50,20.0,51,20.0,52,20.0,53,20.0,54,20.0,55,20.0,56,20.0,57,20.0,58,20.0,59,20.0,60,20.0,61,20.0,62,20.0,63,20.0,64,20.0,65,20.0,66,20.0,67,20.0,68,20.0,69,20.0,70,20.0,71,20.0,72,20.0,73,20.0,74,20.0,75,20.0,76,20.0,77,20.0,78,20.0,79,20.0,80,20.0,81,20.0,82,20.0,83,20.0,84,20.0,85,20.0,86,20.0,87,20.0,88,20.0,89,20.0,90,20.0,91,20.0,92,20.0,93,20.0,94,20.0,95,20.0,96,20.0,97,20.0,98,20.0,99,20.0,100,20.0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,397,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,463,464,465,466,467,468,469,470,471,472,473,474,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519,520,521,522,523,524,525,526,527,528,529,530,531,532,533,534,535,536,537,538,539,540,541,542,543,544,545,546,547,548,549,550,551,552,553,554,555,556,557,558,559,560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591,592,593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624,625,626,627,628,629,630,631,632,633,634,635,636,637,638,639,640,641,642,643,644,645,646,647,648,649,650,651,652,653,654,655,656,657,658,659,660,661,662,663,664,665,666,667,668,669,670,671,672,673,674,675,676,677,678,679,680,681,682,683,684,685,686,687,688,689,690,691,692,693,694,695,696,697,698,699,700,701,702,703,704,705,706,707,708,709,710,711,712,713,714,715,716,717,718,719,720,721,722,723,724,725,726,727,728,729,730,731,732,733,734,735,736,737,738,739,740,741,742,743,744,745,746,747,748,749,750,751,752,753,754,755,756,757,758,759,760,761,762,763,764,765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783,784,785,786,787,788,789,790,791,792,793,794,795,796,797,798,799,800,801,802,803,804,805,806,807,808,809,810,811,812,813,814,815,816,817,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,834,835,836,837,838,839,840,841,842,843,844,845,846,847,848,849,850,851,852,853,854,855,856,857,858,859,860,861,862,863,864,865,866,867,868,869,870,871,872,873,874,875,876,877,878,879,880,881,882,883,884,885,886,887,888,889,890,891,892,893,894,895,896,897,898,899,900,901,902,903,904,905,906,907,908,909,910,911,912,913,914,915,916,917,918,919,920,921,922,923,924,925,926,927,928,929,930,931,932,933,934,935,936,937,938,939,940,941,942,943,944,945,946,947,948,949,950,951,952,953,954,955,956,957,958,959,960,961,962,963,964,965,966,967,968,969,970,971,972,973,974,975,976,977,978,979,980,981,982,983,984,985,986,987,988,989,990,991,992,993,994,995,996,997,998,999,1000)
@test got == expected
end
# issue #17255, take `deferred_alloc` into account
# when calculating total allocation size.
@noinline function f17255(n)
GC.enable(false)
b0 = Ref{Int64}(0)
b1 = Ref{Int64}(0)
Base.gc_bytes(b0)
local a
for i in 1:n
a, t, allocd = @timed [Ref(1) for i in 1:1000]
@test allocd > 0
Base.gc_bytes(b1)
if b1[] < b0[]
return false, a
end
end
return true, a
end
@test f17255(10000)[1]
GC.enable(true)
# issue #18710
bad_tvars() where {T} = 1
@test isa(which(bad_tvars, ()), Method)
@test bad_tvars() === 1
bad_tvars2() where {T} = T
@test_throws UndefVarError(:T) bad_tvars2()
missing_tvar(::T...) where {T} = T
@test_throws UndefVarError(:T) missing_tvar()
@test missing_tvar(1) === Int
@test missing_tvar(1, 2, 3) === Int
@test_throws MethodError missing_tvar(1, 2, "3")
# issue #19059 - test for lowering of `let` with assignment not adding Box in simple cases
contains_Box(e::GlobalRef) = (e.name === :Box)
contains_Box(@nospecialize(e)) = false
contains_Box(e::Expr) = any(contains_Box, e.args)
function let_noBox()
local x
for i = 1:2
if i == 1
x = 21
end
let x = x
return () -> x
end
end
end
function let_Box1()
local x
for i = 1:2
if i == 1
x = 22
end
let y = x
return () -> x
end
end
end
function let_Box2()
local x
for i = 1:2
if i == 1
x = 23
end
let x = x
# In the future, this may change to no-Box if lowering improves
return () -> x
x = 43
end
end
end
function let_Box3()
local x
for i = 1:2
if i == 1
x = 24
end
let y
# In the future, this may change to no-Box if lowering improves
y = x
return () -> x
end
end
end
function let_Box4()
local x, g
for i = 1:2
if i == 1
x = 25
end
let x = x
g = () -> x
x = 44
end
@test x == 25
return g
end
end
function let_Box5()
local x, g, h
for i = 1:2
if i == 1
x = 25
end
let x = x
g = () -> (x = 46)
h = () -> x
end
@test x == 25
@test h() == 25
@test g() == 46
@test h() == 46
@test x == 25
return g
end
end
@test any(contains_Box, code_lowered(let_Box1,())[1].code)
@test any(contains_Box, code_lowered(let_Box2,())[1].code)
@test any(contains_Box, code_lowered(let_Box3,())[1].code)
@test any(contains_Box, code_lowered(let_Box4,())[1].code)
@test any(contains_Box, code_lowered(let_Box5,())[1].code)
@test !any(contains_Box, code_lowered(let_noBox,())[1].code)
@test let_Box1()() == 22
@test let_Box2()() == 23
@test let_Box3()() == 24
@test let_Box4()() == 44
@test let_Box5()() == 46
@test let_noBox()() == 21
# issue #37690
function foo37690()
local f
local x
for k = 1:2
x = k
if k == 1
f = () -> x
end
end
f
end
@test foo37690()() == 2
function g37690()
local x
local f
for k = 1:2
end
x = 0
()->x
end
@test g37690().x === 0
function _assigns_and_captures_arg(a)
a = a
return ()->a
end
@test !any(contains_Box, code_lowered(_assigns_and_captures_arg,(Any,))[1].code)
module TestModuleAssignment
using Test
@eval $(GlobalRef(TestModuleAssignment, :x)) = 1
@test x == 1
@eval $(GlobalRef(TestModuleAssignment, :x)) = 2
@test x == 2
end
# issue #14893
module M14893
x = 14893
macro m14893()
:x
end
function f14893()
x = 1
@m14893
end
end
function f14893()
x = 2
M14893.@m14893
end
@test f14893() == 14893
@test M14893.f14893() == 14893
# issue #19599
f19599(x::((S)->Vector{S})(T)...) where {T} = 1
@test f19599([1],[1]) == 1
@test_throws MethodError f19599([1],[1.0])
# avoiding StackOverflowErrors (issues #12007, #10326, #15736)
module SOE
mutable struct Sgnd <: Signed
v::Int
end
using Test
using Dates
@test_throws ErrorException abs(Sgnd(1)) #12007
io = IOBuffer()
@test_throws ErrorException show(io, Sgnd(1)) #12007
struct MyTime <: Dates.TimeType
value::Int
end
@test_throws ErrorException isless(MyTime(1), now())
end # module SOE
# issue #15240
@test_nowarn begin
local p15240
p15240 = ccall(:jl_realloc, Ptr{Cvoid}, (Ptr{Cvoid}, Csize_t), C_NULL, 10)
ccall(:jl_free, Cvoid, (Ptr{Cvoid},), p15240)
end
# issue #19963
@test_nowarn ccall(:jl_free, Cvoid, (Ptr{Cvoid},), C_NULL)
# Wrong string size on 64bits for large string.
if Sys.WORD_SIZE == 64
@noinline function test_large_string20360(slot)
try
# Do no touch the string to avoid triggering OOM
slot[] = Base._string_n(2^32)
GC.gc(false)
catch ex
# This can happen if there's a virtual address size limit
@test isa(ex, OutOfMemoryError)
@test_broken false
end
return
end
@noinline function tester20360()
GC.gc()
# Makes sure the string is rooted during the `GC.gc(false)`
# but is not before the last gc in this function.
slot = Ref{Any}()
test_large_string20360(slot)
slot[] = nothing
GC.gc()
return
end
@test_nowarn tester20360()
end
# issue #39717
let a = Base.StringVector(2^17)
b = String(a)
c = String(a)
GC.gc()
@test sizeof(a) == 0
@test sizeof(b) == 2^17
@test sizeof(c) == 0
end
@test_throws ArgumentError eltype(Bottom)
# issue #16424, re-evaluating type definitions
struct A16424
x
y
end
struct A16424 # allowed
x
y
end
@test_throws ErrorException @eval struct A16424
x
z
end
@test_throws ErrorException @eval struct A16424
x
y::Real
end
struct B16424{T}
a
end
struct B16424{T}
a
end
@test_throws ErrorException @eval struct B16424{S}
a
end
struct C16424{T,S}
x::T
y::S
end
struct C16424{T,S}
x::T
y::S
end
@test_throws ErrorException @eval struct C16424{T,S}
x::S
y::T
end
struct D16424{T<:Real,S<:T}
x::Vector{S}
y::Vector{T}
end
struct D16424{T<:Real,S<:T}
x::Vector{S}
y::Vector{T}
end
@test_throws ErrorException struct D16424{T<:Real,S<:Real}
x::Vector{S}
y::Vector{T}
end
# issue #20999, allow more type redefinitions
struct T20999
x::Array{T} where T<:Real
end
struct T20999
x::Array{T} where T<:Real
end
@test_throws ErrorException struct T20999
x::Array{T} where T<:Integer
end
let a = Vector{Core.TypeofBottom}(undef, 2)
@test a[1] == Union{}
@test a == [Union{}, Union{}]
end
@test_throws TypeError(:T17951, "type definition", Type, Vararg) @eval begin
struct T17951
x::Vararg
end
end
# issue #21178
struct F21178{A,B} end
b21178(::F1,::F2) where {B1,B2,F1<:F21178{B1,<:Any},F2<:F21178{B2}} = F1,F2,B1,B2
@test b21178(F21178{1,2}(),F21178{1,2}()) == (F21178{1,2}, F21178{1,2}, 1, 1)
# issue #21172
a21172 = f21172(x) = 2x
@test f21172(8) == 16
@test a21172 === f21172
# issue #21271
f21271() = convert(Tuple{Type{Int}, Type{Float64}}, (Int, Float64))::Tuple{Type{Int}, Type{Float64}}
f21271(x) = x::Tuple{Type{Int}, Type{Float64}}
@test_throws TypeError f21271()
@test_throws TypeError f21271((Int, Float64))
# issue #21397
bar21397(x::T) where {T} = T
foo21397(x) = bar21397(x)
@test foo21397(Tuple) == DataType
# issue 21216
primitive type FP128test <: AbstractFloat 128 end
struct FP128align <: AbstractFloat
i::Int # cause forced misalignment
fp::FP128test
end
let ni128 = sizeof(FP128test) ÷ sizeof(Int),
ns128 = sizeof(FP128align) ÷ sizeof(Int),
nbit = sizeof(Int) * 8,
arr = Vector{FP128align}(undef, 2),
offset = Base.datatype_alignment(FP128test) ÷ sizeof(Int),
little,
expected,
arrint = reinterpret(Int, arr)
@test length(arrint) == 2 * ns128
arrint .= 1:(2 * ns128)
@test sizeof(FP128test) == 16
@test arr[1].i == 1
@test arr[2].i == 1 + ns128
expected = UInt128(0)
for little in ni128:-1:1
little += offset
expected = (expected << nbit) + little
end
@test arr[1].fp == reinterpret(FP128test, expected)
expected = UInt128(0)
for little in ni128:-1:1
little += offset + ns128
expected = (expected << nbit) + little
end
@test reinterpret(UInt128, arr[2].fp) == expected
end
# issue #21516
struct T21516
x::Vector{Float64}
y::Vector{Float64}
# check that this definition works
T21516(x::Vector{T}, y::Vector{T}) where {T<:Real} = new(float.(x), float.(y))
end
@test isa(T21516([1],[2]).x, Vector{Float64})
# let with type declaration
let letvar::Int = 2
letvar = 3.0
@test letvar === 3
end
# issue #21568
f21568() = 0
function foo21568()
y = 1
@eval f21568(x::AbstractArray{T,1}) where {T<:Real} = $y
end
foo21568()
@test f21568([0]) == 1
# issue #21719
mutable struct T21719{V}
f
tol::Float64
goal::V
end
g21719(f, goal; tol = 1e-6) = T21719(f, tol, goal)
@test isa(g21719(identity, 1.0; tol=0.1), T21719)
# Alignment of perm boxes
for i in 1:10
# Int64 box should be 16bytes aligned even on 32bits
ptr1 = ccall(:jl_box_int64, UInt, (Int64,), i)
ptr2 = ccall(:jl_box_int64, UInt, (Int64,), i)
@test ptr1 === ptr2
@test ptr1 % 16 == 0
end
# issue #21581
global function f21581()::Int
return 2.0
end
@test f21581() === 2
global g21581()::Int = 2.0
@test g21581() === 2
module M21581
macro bar()
:(foo21581(x)::Int = x)
end
M21581.@bar
end
@test M21581.foo21581(1) === 1
module N21581
macro foo(var)
quote
function f(x::T = 1) where T
($(esc(var)), x)
end
f()
end
end
end
let x = 8
@test @N21581.foo(x) === (8, 1)
end
# issue #22122
let
global @inline function f22122(x::T) where {T}
T
end
end
@test f22122(1) === Int
# issue #22256
mutable struct Bar22256{AParameter}
inner::Int
end
mutable struct Foo22256
bar::Bar22256
end
setbar22256_inner(a) = (a.bar.inner = 3; nothing)
let a_foo = Foo22256(Bar22256{true}(2))
@test a_foo.bar.inner == 2
setbar22256_inner(a_foo)
@test a_foo.bar.inner == 3
end
# macro hygiene scope (#22307, #23239)
macro a22307()
return esc(:a22307)
end
macro b22307()
return :(@a22307)
end
function c22307()
a22307 = 1
return @b22307
end
a22307 = 2
@test c22307() == 2
macro identity23239b(x)
return esc(x)
end
macro identity23239c(x)
return quote
$(esc(x))
end
end
macro assign23239d(x, v)
return esc(:($x = $v))
end
macro assign23239e(x, v)
return quote
$(esc(:($x = $v)))
end
end
macro aa23239()
return quote
a = 1
@identity23239b b = 2
@identity23239c c = 3
@assign23239d d 4
@assign23239e e 5
(a, b, c, d, e)
end
end
f23239() = @aa23239()
@test @inferred(f23239()) === (1, 2, 3, 4, 5)
# issue #22026
module M22026
macro foo(TYP)
quote
global foofunction
foofunction(x::Type{T}) where {T<:Number} = x
end
end
struct Foo end
@foo Foo
macro foo2()
quote
global foofunction2
(foofunction2(x::T)::Float32) where {T<:Number} = 2x
end
end
@foo2
end
@test M22026.foofunction(Int16) === Int16
@test M22026.foofunction2(3) === 6.0f0
# tests for isdefined behavior and code generation
global undefined_variable
@test @isdefined Test
@test !@isdefined undefined_variable
@test !@isdefined undefined_variable2
@test let local_undef, local_def = 1
!@isdefined local_undef
@isdefined local_def
end
f_isdefined_latedef() = @isdefined f_isdefined_def
@test !f_isdefined_latedef()
f_isdefined(x) = @isdefined x
f_isdefined_undef() = @isdefined x_isundef
f_isdefined_def() = @isdefined f_isdefined_def
@test f_isdefined(1)
@test f_isdefined("")
@test !f_isdefined_undef()
@test f_isdefined_def()
@test f_isdefined_latedef()
f_isdefined_defvarI() = (x = rand(Int); @isdefined x)
f_isdefined_defvarS() = (x = randstring(1); @isdefined x)
@test f_isdefined_defvarI()
@test f_isdefined_defvarS()
f_isdefined_undefvar() = (local x; @isdefined x)
@test !f_isdefined_undefvar()
f_isdefined_unionvar(y, t) = (t > 0 && (x = (t == 1 ? 1 : y)); @isdefined x)
@test f_isdefined_unionvar(nothing, 1)
@test f_isdefined_unionvar("", 1)
@test f_isdefined_unionvar(1.0, 1)
@test f_isdefined_unionvar(1, 1)
@test !f_isdefined_unionvar(nothing, 0)
@test !f_isdefined_unionvar("", 0)
@test !f_isdefined_unionvar(1.0, 0)
@test !f_isdefined_unionvar(1, 0)
f_isdefined_splat(x...) = @isdefined x
@test f_isdefined_splat(1, 2, 3)
let e = try; @macroexpand @isdefined :x; false; catch ex; ex; end,
__source__ = LineNumberNode(@__LINE__() - 1, Symbol(@__FILE__))
e::MethodError
@test e.f === getfield(@__MODULE__, Symbol("@isdefined"))
@test e.args === (__source__, @__MODULE__, :(:x))
end
f_isdefined_cl_1(y) = (local x; for i = 1:y; x = 2; end; () -> x; @isdefined x)
f_isdefined_cl_2(y) = (local x; for i = 1:y; x = 2; end; () -> @isdefined x)
f_isdefined_cl_3() = (x = 2; () -> x; @isdefined x)
f_isdefined_cl_4() = (local x; () -> x; @isdefined x)
f_isdefined_cl_5() = (x = 2; () -> @isdefined x)
f_isdefined_cl_6() = (local x; () -> @isdefined x)
@test f_isdefined_cl_1(1)
@test !f_isdefined_cl_1(0)
@test f_isdefined_cl_2(1)()
@test !f_isdefined_cl_2(0)()
@test f_isdefined_cl_3()
@test !f_isdefined_cl_4()
@test f_isdefined_cl_5()()
@test !f_isdefined_cl_6()()
f_isdefined_tv(::T) where {T} = @isdefined T
@test f_isdefined_tv(1)
f_isdefined_va(::T...) where {T} = @isdefined T
@test !f_isdefined_va()
@test f_isdefined_va(1, 2, 3)
function f_unused_undefined_sp(::T...) where T
T
return 0
end
@test_throws UndefVarError(:T) f_unused_undefined_sp()
# note: the constant `5` here should be > DataType.ninitialized.
# This tests that there's no crash due to accessing Type.body.layout.
let f(n) = isdefined(typeof(n), 5)
@test f(0) === false
@test isdefined(Int, 5) === false
end
# @isdefined in a loop
let a = []
for i = 1:2
push!(a, @isdefined(j))
local j = 1
end
@test a == [false, false]
end
# while loop scope
let a = [], i = 0
while i < (local b = 2)
push!(a, @isdefined(j))
local j = 1
i += 1
end
@test a == [false, false]
@test b == 2
end
mutable struct MyStruct22929
x::MyStruct22929
MyStruct22929() = new()
end
isdefined_22929_1(x) = isdefined(x, 1)
isdefined_22929_x(x) = isdefined(x, :x)
m22929_1 = MyStruct22929()
m22929_2 = MyStruct22929()
m22929_2.x = m22929_1
@test !isdefined_22929_1(m22929_1)
@test !isdefined_22929_x(m22929_1)
@test isdefined_22929_1(m22929_2)
@test isdefined_22929_x(m22929_2)
# Union type sorting
for T in (
(Nothing, Int8),
(Nothing, Int64),
(Nothing, Tuple{Int64, String}),
(Nothing, Array),
(Float64, Int64),
(Float64, String),
(Float64, Array),
(String, Array),
(Int64, Tuple{Int64, Float64}),
(Tuple{Int64, Float64}, Array)
)
@test Base.uniontypes(Union{T...}) == collect(T)
@test Base.uniontypes(Union{reverse(T)...}) == collect(T)
end
@test Base.uniontypes(Union{Nothing, Union{Int64, Float64}}) == Any[Nothing, Float64, Int64]
module AlternativeIntModule
struct Int64
val::UInt64
end
end
@test Base.uniontypes(Union{Int64, AlternativeIntModule.Int64}) == Any[AlternativeIntModule.Int64, Int64]
@test Base.uniontypes(Union{AlternativeIntModule.Int64, Int64}) == Any[AlternativeIntModule.Int64, Int64]
# because DAlternativeIntModule is alphabetically after Core.Int64
module DAlternativeIntModule
struct Int64
val::UInt64
end
end
@test Base.uniontypes(Union{Int64, DAlternativeIntModule.Int64}) == Any[Int64, DAlternativeIntModule.Int64]
@test Base.uniontypes(Union{DAlternativeIntModule.Int64, Int64}) == Any[Int64, DAlternativeIntModule.Int64]
@test Base.uniontypes(Union{Vector{Int8}, Vector{Int16}}) == Base.uniontypes(Union{Vector{Int16}, Vector{Int8}})
mutable struct ANonIsBitsType
v::Int64
end
@test Base.uniontypes(Union{Int64, ANonIsBitsType}) == Base.uniontypes(Union{ANonIsBitsType, Int64})
# issue 18933
module GlobalDef18933
using Test
import Base.sqrt
# test that global declaration vs assignment operates correctly in local scope
f() = (global sin; nothing)
g() = (global cos; cos = 2; nothing)
h() = (global sqrt; nothing)
@test !@isdefined sin
@test !@isdefined cos
@test @isdefined sqrt
f()
g()
h()
@test !@isdefined sin
@test @isdefined cos
@test sqrt === Base.sqrt
@test cos === 2
# test that function definitions declared global
# introduce a new, local global
let
global tan
@test !@isdefined tan
tan() = nothing
@test @isdefined tan
@test tan() === nothing
end
# test that global declaration side-effects don't ignore conditionals
if false
global sincos
nothing
end
@test which(Main, :sincos) === Base.Math
@test @isdefined sincos
@test sincos === Base.sincos
end
# issue #23218
let idx = (7,5,9)
(v,) = (idx...,)
@test v == 7
end
module UnionOptimizations
using Test
using Dates
using Random
const boxedunions = [Union{}, Union{String, Nothing}]
const unboxedunions = [Union{Int8, Nothing},
Union{Int8, Float16, Nothing},
Union{Int8, UInt8, Int16, UInt16, Int32, UInt32, Int64, UInt64, Int128, UInt128},
Union{Char, Date, Int}]
@test !Base.isbitsunion(boxedunions[1])
@test !Base.isbitsunion(boxedunions[2])
@test Base.isbitsunion(unboxedunions[1])
@test Base.isbitsunion(unboxedunions[2])
@test Base.isbitsunion(unboxedunions[3])
@test Base.bitsunionsize(unboxedunions[1]) == 1
@test Base.bitsunionsize(unboxedunions[2]) == 2
@test Base.bitsunionsize(unboxedunions[3]) == 16
@test Base.bitsunionsize(unboxedunions[4]) == 8
@test sizeof(unboxedunions[1]) == 1
@test sizeof(unboxedunions[2]) == 2
@test sizeof(unboxedunions[3]) == 16
@test sizeof(unboxedunions[4]) == 8
initvalue(::Type{Nothing}) = nothing
initvalue(::Type{Char}) = '\0'
initvalue(::Type{Date}) = Date(0, 12, 31)
initvalue(::Type{T}) where {T <: Number} = T(0)
initvalue2(::Type{Nothing}) = nothing
initvalue2(::Type{Char}) = Char(0x01)
initvalue2(::Type{Date}) = Date(1)
initvalue2(::Type{T}) where {T <: Number} = T(1)
U = unboxedunions[1]
@noinline compare(a, b) = (a === b) # make sure we are testing code-generation of `is`
egal(x, y) = (ccall(:jl_egal, Cint, (Any, Any), x, y) != 0) # make sure we are NOT testing code-generate of `is`
mutable struct UnionField
u::U
end
let x = UnionField(initvalue(Base.uniontypes(U)[1]))
@test x.u === initvalue(Base.uniontypes(U)[1])
x.u = initvalue2(Base.uniontypes(U)[1])
@test x.u === initvalue2(Base.uniontypes(U)[1])
x.u = initvalue(Base.uniontypes(U)[2])
@test x.u === initvalue(Base.uniontypes(U)[2])
end
mutable struct UnionField2
x::Union{Nothing, Int}
@noinline UnionField2() = new()
end
@test UnionField2().x === nothing
struct UnionField3
x::Union{Nothing, Int}
@noinline UnionField3() = new()
end
@test UnionField3().x === nothing
mutable struct UnionField4
x::Union{Nothing, Float64}
y::Union{Nothing, Int8}
z::NTuple{8, UInt8}
@noinline UnionField4() = new()
@noinline UnionField4(x, y) = new(x, y, (0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, 0x88))
end
@test UnionField4().x === nothing
@test UnionField4().y === nothing
let x4 = UnionField4(nothing, Int8(3))
x4copy = deepcopy(x4)
@test x4.x === nothing
@test x4.y === Int8(3)
@test x4.z[1] === 0x11
@test compare(x4, x4)
@test x4 == x4
@test egal(x4, x4)
@test !(x4 === x4copy)
@test !(x4 == x4copy)
@test !egal(x4, x4copy)
end
struct UnionField5
x::Union{Nothing, Float64}
y::Union{Nothing, Int8}
z::NTuple{8, UInt8}
@noinline UnionField5() = new()
@noinline UnionField5(x, y) = new(x, y, (0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77, 0x88))
end
@test UnionField5().x === nothing
@test UnionField5().y === nothing
let x5 = UnionField5(nothing, Int8(3))
x5copy = deepcopy(x5)
@test x5.x === nothing
@test x5.y === Int8(3)
@test x5.z[1] === 0x11
@test compare(x5, x5)
@test x5 == x5
@test compare(x5, x5copy)
@test x5 == x5copy
@test egal(x5, x5copy)
@test objectid(x5) === objectid(x5copy)
@test hash(x5) === hash(x5copy)
end
struct UnionField6
alignment::Int32
padding::NTuple{3, UInt8}
#= implicit-padding::UInt8 =#
maybe_val::Union{UInt16, Nothing} # offset = 8, align = 8, size = 2
end
@test UnionField6(1,(1,1,1),2018).maybe_val == 2018
# PR #23367
struct A23367
x::Union{Int8, Int16, NTuple{7, Int8}, Nothing}
end
struct B23367
x::Int8
y::A23367
z::Int8
end
@noinline get_x(a::A23367) = a.x
function constant23367 end
let
b = B23367(91, A23367(ntuple(i -> Int8(i), Val(7))), 23)
@eval @noinline constant23367(a, b) = (a ? b : $b)
b2 = Ref(b)[] # copy b via field assignment
b3 = B23367[b][1] # copy b via array assignment
addr(@nospecialize x) = ccall(:jl_value_ptr, Ptr{Cvoid}, (Any,), x)
@test addr(b) == addr(b)
# @test addr(b) == addr(b2)
# @test addr(b) == addr(b3)
# @test addr(b2) == addr(b3)
@test b === b2 === b3 === b
@test egal(b, b2) && egal(b2, b3) && egal(b3, b)
@test compare(b, b2) && compare(b, b3) && compare(b2, b3)
@test objectid(b) === objectid(b2) == objectid(b3)
@test b.x === Int8(91)
@test b.z === Int8(23)
@test b.y === A23367((Int8(1), Int8(2), Int8(3), Int8(4), Int8(5), Int8(6), Int8(7)))
@test sizeof(b) == 12
@test A23367(Int8(1)).x === Int8(1)
@test A23367(Int8(0)).x === Int8(0)
@test A23367(Int16(1)).x === Int16(1)
@test A23367(nothing).x === nothing
@test sizeof(b.y) == 8
@test get_x(A23367(Int8(1))) === Int8(1)
# test code-generation of constants
other = B23367(91, A23367(nothing), 23)
@test constant23367(true, other) === other
@test constant23367(false, other) === b
end
for U in boxedunions
local U
for N in (1, 2, 3, 4)
A = Array{U}(undef, ntuple(Returns(0), N)...)
@test isempty(A)
@test sizeof(A) == 0
A = Array{U}(undef, ntuple(Returns(10), N)...)
@test length(A) == 10^N
@test sizeof(A) == sizeof(Int) * (10^N)
@test !isassigned(A, 1)
end
end
struct UnionFieldInlineStruct
x::Int64
y::Union{Float64, Missing}
end
@test sizeof(Vector{UnionFieldInlineStruct}(undef, 2)) == sizeof(UnionFieldInlineStruct) * 2
let x = UnionFieldInlineStruct(1, 3.14)
AInlineUnion = [x for i = 1:10]
@test sizeof(AInlineUnion) == sizeof(UnionFieldInlineStruct) * 10
BInlineUnion = Vector{UnionFieldInlineStruct}(undef, 10)
copyto!(BInlineUnion, AInlineUnion)
@test AInlineUnion == BInlineUnion
@test BInlineUnion[end] == x
CInlineUnion = vcat(AInlineUnion, BInlineUnion)
@test sizeof(CInlineUnion) == sizeof(UnionFieldInlineStruct) * 20
@test CInlineUnion[end] == x
end
# issue 33709
struct A33709
a::Union{Nothing,A33709}
end
let a33709 = A33709(A33709(nothing))
@test isnothing(a33709.a.a)
end
# issue #35793
struct A35793
x::Union{Nothing, Missing}
end
let x = A35793(nothing), y = A35793(missing)
@test x isa A35793
@test x.x === nothing
@test y.x === missing
end
# issue 31583
a31583 = "a"
f31583() = a31583 === "a"
@test f31583()
a31583 = "b"
@test !f31583()
# unsafe_wrap
let
A4 = [1, 2, 3]
@test_throws ArgumentError unsafe_wrap(Array, convert(Ptr{Union{Int, Nothing}}, pointer(A4)), 3)
A5 = [1 2 3; 4 5 6]
@test_throws ArgumentError unsafe_wrap(Array, convert(Ptr{Union{Int, Nothing}}, pointer(A5)), 6)
end
# copyto!
A23567 = Vector{Union{Float64, Nothing}}(undef, 5)
B23567 = collect(Union{Float64, Nothing}, 1.0:3.0)
copyto!(A23567, 2, B23567)
@test A23567[1] === nothing
@test A23567[2] === 1.0
@test A23567[3] === 2.0
@test A23567[4] === 3.0
# vcat
t2 = deepcopy(A23567)
t3 = deepcopy(A23567)
t4 = vcat(A23567, t2, t3)
@test t4[1:5] == A23567
@test t4[6:10] == A23567
@test t4[11:15] == A23567
using Serialization
for U in unboxedunions
local U
for N in (1, 2, 3, 4)
A = Array{U}(undef, ntuple(Returns(0), N)...)
@test isempty(A)
@test sizeof(A) == 0
len = ntuple(Returns(10), N)
mxsz = maximum(sizeof, Base.uniontypes(U))
A = Array{U}(undef, len)
@test length(A) == prod(len)
@test sizeof(A) == prod(len) * mxsz
@test isassigned(A, 1)
@test isassigned(A, length(A))
# arrayref / arrayset
F = Base.uniontypes(U)[1]
@test A[1] === initvalue(F)
A[1] = initvalue2(F)
@test A[1] === initvalue2(F)
F2 = Base.uniontypes(U)[2]
A[2] = initvalue(F2)
@test A[2] === initvalue(F2)
for (i, U2) in enumerate(Base.uniontypes(U))
A[i] = initvalue2(U2)
@test A[i] === initvalue2(U2)
end
# serialize / deserialize
io = IOBuffer()
serialize(io, A)
seekstart(io)
A2 = deserialize(io)
@test A == A2
# reshape
A3 = reshape(A, (div(prod(len), 2), 2))
@test sizeof(A) == prod(len) * mxsz
@test isassigned(A, 1)
@test A[1] === initvalue2(F)
# copy
A4 = copy(A)
@test A == A4
if N == 1
## Dequeue functions
# pop!
F2 = Base.uniontypes(U)[2]
len = len[1]
A = U[initvalue2(F2) for i = 1:len]
for i = 1:len
@test A[end] === initvalue2(F2)
v = pop!(A)
@test v === initvalue2(F2)
end
@test isempty(A)
# popfirst!
A = U[initvalue2(F2) for i = 1:len]
for i = 1:len
@test A[1] === initvalue2(F2)
popfirst!(A)
end
@test isempty(A)
# empty!
A = U[initvalue2(F2) for i = 1:len]
empty!(A)
@test isempty(A)
# resize!
A = U[initvalue2(F2) for i = 1:len]
resize!(A, 1)
@test length(A) === 1
@test A[1] === initvalue2(F2)
resize!(A, len)
@test length(A) === len
@test A[1] === initvalue2(F2)
@test typeof(A[end]) === F
# deleteat!
F = Base.uniontypes(U)[2]
A = U[rand(F(1):F(len)) for i = 1:len]
# The 2-arg `unique` method works around #22688
deleteat!(A, map(Int, sort!(unique(identity, A[1:4]))))
A = U[initvalue2(F2) for i = 1:len]
deleteat!(A, 1:2)
@test length(A) == len - 2
@test all(A .== initvalue2(F2))
deleteat!(A, 1:2)
@test length(A) == len - 4
@test all(A .== initvalue2(F2))
A = U[initvalue2(F2) for i = 1:len]
deleteat!(A, length(A)-1:length(A))
@test length(A) == len - 2
@test all(A .== initvalue2(F2))
deleteat!(A, length(A)-1:length(A))
@test length(A) == len - 4
@test all(A .== initvalue2(F2))
A = U[initvalue2(F2) for i = 1:len]
deleteat!(A, 2:3)
@test length(A) == len - 2
@test all(A .== initvalue2(F2))
A = U[initvalue2(F2) for i = 1:len]
deleteat!(A, length(A)-2:length(A)-1)
@test length(A) == len - 2
@test all(A .== initvalue2(F2))
# pushfirst!
A = U[initvalue2(F2) for i = 1:len]
for i = 1:5
pushfirst!(A, initvalue2(F))
pushfirst!(A, initvalue(F2))
@test A[1] === initvalue(F2)
@test A[2] === initvalue2(F)
end
# push! / append! / prepend!
A = U[initvalue2(F2) for i = 1:len]
push!(A, initvalue2(F))
@test A[end] === initvalue2(F)
push!(A, initvalue2(F2))
@test A[end] === initvalue2(F2)
append!(A, [initvalue(F), initvalue2(F)])
@test A[end] === initvalue2(F)
@test A[end-1] === initvalue(F)
prepend!(A, [initvalue(F), initvalue2(F)])
@test A[2] === initvalue2(F)
@test A[1] === initvalue(F)
# insert!
A = U[initvalue2(F2) for i = 1:len]
insert!(A, 2, initvalue2(F))
@test A[2] === initvalue2(F)
@test A[1] === initvalue2(F2)
@test A[3] === initvalue2(F2)
@test A[end] === initvalue2(F2)
A = U[initvalue2(F2) for i = 1:len]
insert!(A, 8, initvalue2(F))
@test A[8] === initvalue2(F)
@test A[7] === initvalue2(F2)
@test A[9] === initvalue2(F2)
@test A[end] === initvalue2(F2)
# splice!
A = U[initvalue2(F2) for i = 1:len]
V = splice!(A, 1:2)
@test length(A) == len - 2
@test length(V) == 2
@test V[1] == initvalue2(F2)
@test V[2] == initvalue2(F2)
@test A[1] == initvalue2(F2)
@test A[end] == initvalue2(F2)
A = U[initvalue2(F2) for i = 1:len]
V = splice!(A, 4:5)
@test length(A) == len - 2
@test length(V) == 2
@test V[1] == initvalue2(F2)
@test V[2] == initvalue2(F2)
@test A[1] == initvalue2(F2)
@test A[end] == initvalue2(F2)
end
end
end
@testset "jl_array_grow_at_end" begin
# start w/ array, set & check elements, grow it, check that elements stayed correct, set & check elements
A = Vector{Union{Missing, UInt8}}(undef, 2)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
# grow_at_end 2
resize!(A, 5)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === missing
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x05
# grow_at_end 1
Base._growat!(A, 4, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x05
Base.arrayset(true, A, missing, 1)
Base.arrayset(true, A, 0x02, 2)
Base.arrayset(true, A, missing, 3)
Base.arrayset(true, A, 0x04, 4)
Base.arrayset(true, A, missing, 5)
Base.arrayset(true, A, 0x06, 6)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x02
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x04
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x06
# grow_at_end 5
Base._growat!(A, 4, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x02
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x04
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x06
# grow_at_end 6
resize!(A, 8)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x02
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x04
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x06
@test Base.arrayref(true, A, 8) === missing
# grow_at_end 4
resize!(A, 1048576)
resize!(A, 1048577)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x02
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x04
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x06
@test Base.arrayref(true, A, 8) === missing
foreach(9:1048577) do i
@test Base.arrayref(true, A, i) === missing
end
foreach(9:1048577) do i
Base.arrayset(true, A, i % UInt8, i)
@test Base.arrayref(true, A, i) === i % UInt8
end
# grow_at_end 3
A = Vector{Union{Missing, UInt8}}(undef, 1048577)
foreach(1:1048577) do i
@test Base.arrayref(true, A, i) === missing
Base.arrayset(true, A, i % UInt8, i)
@test Base.arrayref(true, A, i) === i % UInt8
end
Base._growat!(A, 1048576, 1)
@test length(A) == 1048578
foreach(1:1048575) do i
@test Base.arrayref(true, A, i) === i % UInt8
@test A[i] === i % UInt8
end
@test Base.arrayref(true, A, 1048576) === missing
@test Base.arrayref(true, A, 1048577) === 1048576 % UInt8
@test Base.arrayref(true, A, 1048578) === 1048577 % UInt8
end # @testset
@testset "jl_array_grow_at_beg" begin
# grow_at_beg 4
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._growat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x01
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x03
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x05
# grow_at_beg 2
Base._growat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x01
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x03
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x05
# grow_at_beg 1
Base._growat!(A, 2, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x01
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x03
@test Base.arrayref(true, A, 7) === missing
@test Base.arrayref(true, A, 8) === 0x05
# grow_at_beg 9
Base._growat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x01
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x03
@test Base.arrayref(true, A, 8) === missing
@test Base.arrayref(true, A, 9) === 0x05
# grow_at_beg 8
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._growat!(A, 2, 1)
Base._growat!(A, 2, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x03
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x05
# grow_at_beg 5
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._growat!(A, 4, 1)
Base._growat!(A, 4, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === missing
@test Base.arrayref(true, A, 7) === 0x05
# grow_at_beg 6
Base._growat!(A, 2, 3)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x03
@test Base.arrayref(true, A, 7) === missing
@test Base.arrayref(true, A, 8) === missing
@test Base.arrayref(true, A, 9) === missing
@test Base.arrayref(true, A, 10) === 0x05
# grow_at_beg 3
A = Vector{Union{Missing, UInt8}}(undef, 1048577)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._growat!(A, 2, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x03
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x05
foreach(7:length(A)) do i
@test Base.arrayref(true, A, i) === missing
Base.arrayset(true, A, i % UInt8, i)
@test Base.arrayref(true, A, i) === i % UInt8
end
end # @testset
@testset "jl_array_del_at_beg" begin
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._deleteat!(A, 2, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === 0x03
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x05
Base._deleteat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === 0x03
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x05
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._growat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x01
@test Base.arrayref(true, A, 3) === missing
@test Base.arrayref(true, A, 4) === 0x03
@test Base.arrayref(true, A, 5) === missing
@test Base.arrayref(true, A, 6) === 0x05
Base._deleteat!(A, 2, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x05
Base._deleteat!(A, 1, 2)
@test Base.arrayref(true, A, 1) === 0x03
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x05
Base._deleteat!(A, 1, 1)
@test Base.arrayref(true, A, 1) === missing
@test Base.arrayref(true, A, 2) === 0x05
end # @testset
@testset "jl_array_del_at_end" begin
A = Vector{Union{Missing, UInt8}}(undef, 5)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
Base._deleteat!(A, 5, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
Base._deleteat!(A, 3, 1)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === missing
end # @testset
# issue #27767
let A=Vector{Union{Int, Missing}}(undef, 1)
resize!(A, 2)
@test length(A) == 2
@test A[2] === missing
end
# issue #27809
let A=Vector{Union{Int, Missing}}(undef, 0)
while length(A) < 2^17
push!(A, 0.0)
end
push!(A, 0.0)
@test !any(ismissing, A)
end
# jl_array_shrink
let A=Vector{Union{UInt8, Missing}}(undef, 1048577)
Base.arrayset(true, A, 0x01, 1)
Base.arrayset(true, A, missing, 2)
Base.arrayset(true, A, 0x03, 3)
Base.arrayset(true, A, missing, 4)
Base.arrayset(true, A, 0x05, 5)
deleteat!(A, 6:1048577)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x05
sizehint!(A, 5)
@test Base.arrayref(true, A, 1) === 0x01
@test Base.arrayref(true, A, 2) === missing
@test Base.arrayref(true, A, 3) === 0x03
@test Base.arrayref(true, A, 4) === missing
@test Base.arrayref(true, A, 5) === 0x05
end
# copyto!/vcat w/ internal padding
let A=[0, missing], B=[missing, 0], C=Vector{Union{Int, Missing}}(undef, 6)
push!(A, missing)
push!(B, missing)
@test isequal(vcat(A, B), [0, missing, missing, missing, 0, missing])
copyto!(C, 1, A)
copyto!(C, 4, B)
@test isequal(C, [0, missing, missing, missing, 0, missing])
end
# non-power-of-2 element sizes, issue #26026
primitive type TypeWith24Bits 24 end
TypeWith24Bits(x::UInt32) = Core.Intrinsics.trunc_int(TypeWith24Bits, x)
let x = TypeWith24Bits(0x112233), y = TypeWith24Bits(0x445566), z = TypeWith24Bits(0x778899)
a = [x, x]
Core.arrayset(true, a, y, 2)
@test a == [x, y]
a[2] = z
@test a == [x, z]
@test pointer(a, 2) - pointer(a, 1) == 4
b = [(x, x), (x, x)]
Core.arrayset(true, b, (x, y), 2)
@test b == [(x, x), (x, y)]
b[2] = (y, z)
@test b == [(x, x), (y, z)]
V = Vector{TypeWith24Bits}(undef, 1000)
p = Ptr{UInt8}(pointer(V))
for i = 1:sizeof(V)
unsafe_store!(p, i % UInt8, i)
end
@test V[1:4] == [TypeWith24Bits(0x030201), TypeWith24Bits(0x070605), TypeWith24Bits(0x0b0a09), TypeWith24Bits(0x0f0e0d)]
end
# issue #29718
function f29718()
nt = NamedTuple{(:a, :b, :c, :d, :e, :f,),
Tuple{Union{Missing, Float64},
Tuple{UInt8},
Union{Missing, Int8},
Int8,
Tuple{UInt8,UInt8},
Union{Missing, Int16}}
}((missing,
(1,),
1,
41,
(1,2),
1915,
))
return Ref{Any}(nt)[].f
end
@test f29718() == 1915
end # module UnionOptimizations
# issue #6614, argument destructuring
f6614((x, y)) = [x, y]
@test f6614((4, 3)) == [4, 3]
g6614((x, y), (z,), (a, b)) = (x,y,z,a,b)
@test g6614((1, 2), (3,), (4, 5)) === (1,2,3,4,5)
@test_throws MethodError g6614(1, 2)
@test_throws MethodError g6614((1, 2), (3,))
@test_throws BoundsError g6614((1, 2), (3,), (1,))
h6614((x, y) = (5, 6)) = (y, x)
@test h6614() == (6, 5)
@test h6614((4, 5)) == (5, 4)
ff6614((x, y)::Tuple{Int, String}) = (x, y)
@test ff6614((1, "")) == (1, "")
@test_throws MethodError ff6614((1, 1))
gg6614((x, y)::Tuple{Int, String} = (2, " ")) = (x, y)
@test gg6614() == (2, " ")
function hh6614()
x, y = 1, 2
function g((x,y))
# make sure x and y are local
end
g((4,5))
x, y
end
@test hh6614() == (1, 2)
# issue #26518
function f26518((a,b)) end
@test f26518((1,2)) === nothing
# issue #36572 - destructuring called object
struct Foo36572
a
b
end
function Base.iterate(f::Foo36572, i=1)
i == 1 ? (f.a, 2) :
i == 2 ? (f.b, 3) : nothing
end
((a,b)::Foo36572)(x) = a*x + b
@test Foo36572(10,2)(3) == 32
# issue 22098
macro m22098 end
handle_on_m22098 = getfield(@__MODULE__, Symbol("@m22098"))
@test isempty(methods(handle_on_m22098))
# issue 24363
mutable struct A24363
x::Union{Int,Nothing}
end
int24363 = A24363(65535)
void24363 = A24363(nothing)
f24363(a) = a.x
@test f24363(int24363) === 65535
@test f24363(void24363) === nothing
# issue 17149
mutable struct Foo17149
end
@test Foo17149() !== Foo17149()
let a = Foo17149()
@test a === a
end
# issue #21004
const PTuple_21004{N,T} = NTuple{N,VecElement{T}}
@test_throws ArgumentError("too few elements for tuple type $PTuple_21004") PTuple_21004(1)
@test_throws UndefVarError(:T) PTuple_21004_2{N,T} = NTuple{N, VecElement{T}}(1)
#issue #22792
foo_22792(::Type{<:Union{Int8,Int,UInt}}) = 1;
@test foo_22792(Union{Int,UInt}) == 1
foo_22792(::Union) = 2;
@test foo_22792(Union{Int,UInt}) == 1
@test foo_22792(Union{Int8,UInt}) == 1
@test foo_22792(Union{Int,UInt}) == 1
# issue #25907
g25907a(x) = x[1]::Integer
@test g25907a(Union{Int, UInt, Nothing}[1]) === 1
g25907b(x) = x[1]::Complex
@test g25907b(Union{Complex{Int}, Complex{UInt}, Nothing}[1im]) === 1im
#issue #26363
@test eltype(Ref(Float64(1))) === Float64
@test ndims(Ref(1)) === 0
@test collect(Ref(1)) == [v for v in Ref(1)] == fill(1)
@test axes(Ref(1)) === size(Ref(1)) === ()
# issue #23206
g1_23206(::Tuple{Type{Int}, T}) where T = 0
g2_23206(::Tuple{Type{Int}}) = 1
@test_throws MethodError g1_23206(tuple(Int, 2))
@test_throws MethodError g2_23206(tuple(Int, 2))
# issue #26739
let x26739 = Int[1]
@test eval(:(identity.($x26739))) == x26739
end
# issue #27018
@test Base.isvatuple(Tuple{Float64,Vararg{Int}})
@test Base.isvatuple(Tuple{T,Vararg{Int}} where T)
@test Base.isvatuple(Tuple{Int,Int,Vararg{Int,N}} where N)
@test Base.isvatuple(Tuple{T,S,Vararg{T}} where T<:S where S)
@test Base.isvatuple(Tuple{T,S,Vararg{T,3}} where T<:S where S)
@test !Base.isvatuple(Tuple{Float64,Vararg{Int,1}})
@test !Base.isvatuple(Tuple{T,Vararg{Int,2}} where T)
@test !Base.isvatuple(Tuple{Int,Int,Vararg{Int,2}})
# Issue 27103
function f27103()
a = @isdefined x
x = 3
b = @isdefined x
(a, b)
end
@test f27103() == (false, true)
g27103() = @isdefined z27103
@test g27103() == false
z27103 = 1
@test g27103() == true
# Issue 27181
struct A27181
typ::Type
end
struct C27181
val
end
function f27181()
invoke(A27181(C27181).typ, Tuple{Any}, nothing)
end
@test f27181() == C27181(nothing)
# Issue #27204
struct Foo27204{T}
end
(::Foo27204{Int})() = 1
(::Foo27204{Float64})() = 2
@noinline f27204(x) = x ? Foo27204{Int}() : Foo27204{Float64}()
foo27204(x) = f27204(x)()
@test foo27204(true) == 1
@test foo27204(false) == 2
# Issue 27209
@noinline function f27209(x::Union{Float64, Nothing})
if x === nothing
y = x; return @isdefined(y)
else
return @isdefined(y)
end
end
g27209(x) = f27209(x ? nothing : 1.0)
@test g27209(true) == true
# Issue 27240
@inline function foo27240()
if rand(Bool)
return foo_nonexistent_27240
else
return bar_nonexistent_27240
end
end
bar27240() = foo27240()
@test_throws UndefVarError bar27240()
# issue #27269
struct T27269{X, Y <: Vector{X}}
v::Vector{Y}
end
@test T27269([[1]]) isa T27269{Int, Vector{Int}}
# issue #27368
struct Combinator27368
op
args::Vector{Any}
Combinator27368(op, args...) =
new(op, collect(Any, args))
end
field27368(name) =
Combinator27368(field27368, name)
translate27368(name::Symbol) =
translate27368(Val{name})
translate27368(::Type{Val{name}}) where {name} =
field27368(name)
@test isa(translate27368(:name), Combinator27368)
# issue #27456
@inline foo27456() = try baz_nonexistent27456(); catch; nothing; end
bar27456() = foo27456()
@test bar27456() == nothing
# issue #27365
mutable struct foo27365
x::Float64
foo27365() = new()
end
function baz27365()
data = foo27365()
return data.x
end
@test isa(baz27365(), Float64)
# Issue #27566
function test27566(a,b)
c = (b,(0,1)...)
test27566(a, c...)
end
test27566(a, b, c, d) = a.*(b, c, d)
@test test27566(1,1) == (1,0,1)
# Issue #27594
struct Iter27594 end
Base.iterate(::Iter27594) = (1, nothing)
Base.iterate(::Iter27594, ::Any) = nothing
function foo27594()
ind = 0
for x in (1,)
for y in Iter27594()
ind += 1
end
end
ind
end
@test foo27594() == 1
# Issue 27597
function f27597(y)
x = Int[]
if isempty(y)
y = 1:length(x)
elseif false
;
end
length(y)
return y
end
@test f27597([1]) == [1]
@test f27597([]) === 1:0
# issue #22291
wrap22291(ind) = (ind...,)
@test @inferred(wrap22291(1)) == (1,)
@test @inferred(wrap22291((1, 2))) == (1, 2)
# Issue 27770
mutable struct Handle27770
ptr::Ptr{Cvoid}
end
Handle27770() = Handle27770(Ptr{Cvoid}(UInt(0xfeedface)))
struct Nullable27770
hasvalue::Bool
value::Handle27770
Nullable27770() = new(false)
Nullable27770(v::Handle27770) = new(true, Handle27770)
end
get27770(n::Nullable27770, v::Handle27770) = n.hasvalue ? n.value : v
foo27770() = get27770(Nullable27770(), Handle27770())
@test foo27770().ptr == Ptr{Cvoid}(UInt(0xfeedface))
bar27770() = Nullable27770().value
@test_throws UndefRefError bar27770()
# Issue 27910
f27910() = ((),)[2]
@test_throws BoundsError f27910()
# Issue 9765
f9765(::Bool) = 1
g9765() = f9765(isa(1, 1))
@test_throws TypeError g9765()
# Issue 28102
struct HasPlain28102
plain::Int
HasPlain28102() = new()
end
@noinline function bam28102()
x = HasPlain28102()
if isdefined(x,:plain)
x.plain
end
end
@test isa(bam28102(), Int)
# Check that the tfunc for fieldtype is correct
struct FooFieldType; x::Int; end
f_fieldtype(b) = fieldtype(b ? Int : FooFieldType, 1)
@test @inferred(f_fieldtype(false)) == Int
@test_throws BoundsError f_fieldtype(true)
# Issue #28224
@noinline make_error28224(n) = n == 5 ? error() : true
function foo28224()
z = 0
try
while make_error28224(z)
z+=1
end
catch end
return z
end
@test foo28224() == 5
# Issue #28208
@noinline function foo28208(a::Bool, b::Bool)
x = (1, 2)
if a
if b
y = nothing
else
y = missing
end
x = y
end
x
end
@test isa(foo28208(false, true), Tuple)
@test foo28208(true, false) === missing
@test foo28208(true, true) === nothing
# Issue #28326
function foo28326(a)
try
@inbounds a[1]
return false
catch
return true
end
end
@test foo28326(Vector(undef, 1))
# Issue #28392
struct Foo28392; end
@test_throws MethodError iterate(Foo28392())
# issue #28399
function g28399(n)
for a = 1:n
c28399 = 1
end
()->c28399
end
function f28399()
for a = __undef_28399__
c28399 = 1
end
()->c28399
end
c28399 = 42
@test g28399(0)() == 42
@test g28399(1)() == 42
@test_throws UndefVarError(:__undef_28399__) f28399()
# issue #28445
mutable struct foo28445
x::Int
end
@noinline make_foo28445() = (foo28445(1), foo28445(rand(1:10)), foo28445(rand(1:10)))
@noinline function use_tuple28445(c)
@test isa(c[2], foo28445)
@test isa(c[3], foo28445)
end
function repackage28445()
(_, a, b) = make_foo28445()
GC.gc()
c = (foo28445(1), foo28445(2), a, b)
use_tuple28445(c)
true
end
@test repackage28445()
# issue #28597
@test_throws ArgumentError Array{Int, 2}(undef, 0, -10)
@test_throws ArgumentError Array{Int, 2}(undef, -10, 0)
@test_throws ArgumentError Array{Int, 2}(undef, -1, -1)
# issue #28812
@test Tuple{Vararg{Array{T} where T,3}} === Tuple{Array,Array,Array}
# issue #29145
struct T29145{A,B}
function T29145()
new{S,Ref{S}}() where S
end
end
@test_throws TypeError T29145()
# issue #29175
function f29175(tuple::T) where {T<:Tuple}
prefix::Tuple{T.parameters[1:end-1]...} = tuple[1:length(T.parameters)-1]
x = prefix
prefix = x # force another conversion to declared type
return prefix
end
@test f29175((1,2,3)) === (1,2)
# issue #29306
let a = [1,2,3,4,missing,6,7]
@test_throws TypeError [ (x>6 ? missing : x) for x in a]
foo(x) = x > 0 ? x : missing
@test_throws TypeError foo(missing)
end
# issue #29152
function f29152()
try
g29152()
finally
end
end
g29152() = (_true29152 ? error() : _true29152 ? 0 : false)
_true29152 = true;
@test_throws ErrorException f29152()
# issue #29828
f29828() = 2::String
g29828() = 2::Any[String][1]
@test_throws TypeError(:typeassert, String, 2) f29828()
@test_throws TypeError(:typeassert, String, 2) g29828()
# splatting in `new`
struct SplatNew{T}
x::Int8
y::T
SplatNew{T}(args...) where {T} = new(0, args..., 1)
SplatNew(args...) = new{Float32}(args...)
SplatNew{Any}(args...) = new(args...)
SplatNew{Tuple{Int16}}(args...) = new([2]..., args...)
SplatNew{Int8}() = new(1, 2, 3)
end
let x = SplatNew{Int16}()
@test x.x === Int8(0)
@test x.y === Int16(1)
end
@test_throws ArgumentError("new: too many arguments (expected 2)") SplatNew{Int16}(1)
let x = SplatNew(3, 2)
@test x.x === Int8(3)
@test x.y === 2.0f0
end
@test_throws ArgumentError("new: too many arguments (expected 2)") SplatNew(1, 2, 3)
@test_throws ArgumentError("new: too few arguments (expected 2)") SplatNew{Any}(1)
let x = SplatNew{Tuple{Int16}}((1,))
@test x.x === Int8(2)
@test x.y === (Int16(1),)
end
@test_throws ArgumentError("new: too many arguments (expected 2)") SplatNew{Int8}()
# Issue #31357 - Missed assignment in nested try/catch
function foo31357(b::Bool)
x = nothing
try
try
x = 12345
if !b
throw("hi")
end
finally
end
catch
end
return x
end
@test foo31357(true) == 12345
@test foo31357(false) == 12345
# Issue #31406
abstract type Shape31406 end
struct ValueOf31406 <: Shape31406
ty::Type
end
struct TupleOf31406 <: Shape31406
cols::Vector{Shape31406}
end
TupleOf31406(cols::Union{Shape31406,Type}...) = TupleOf31406(collect(Shape31406, cols))
@test (TupleOf31406(ValueOf31406(Int64), ValueOf31406(Float64))::TupleOf31406).cols ==
Shape31406[ValueOf31406(Int64), ValueOf31406(Float64)]
@test try
TupleOf31406(ValueOf31406(Int64), Float64)
false
catch ex
if !(ex isa MethodError && ex.f === convert && ex.args == (Shape31406, Float64))
rethrow(ex)
end
true
end
# Issue #31783
struct LL31783{T}
x::T
end
foo31783(tv::TypeVar) = tv.ub == Any ? Union{tv,LL31783{tv}} : tv
@test isa(foo31783(TypeVar(:T)),Union)
# Issue #31649
struct sparse_t31649
val::Vector{Float64}
sub::Vector{Int64}
end
Base.convert(::Any, v::sparse_t31649) = copy(v.val)
let spvec = sparse_t31649(zeros(Float64,5), Vector{Int64}())
@test_throws MethodError repr(spvec)
# Try manually putting the problematic method into the cache (in
# the original issue compiling the showerror method caused this to happen)
@test convert(Any, nothing) === nothing
@test_throws MethodError repr(spvec)
end
# Issue #31062 - Accidental recursion in jl_has_concrete_subtype
struct Bar31062
x::NTuple{N, Bar31062} where N
end
struct Foo31062
x::Foo31062
end
# Use eval to make sure that this actually gets executed and not
# just constant folded by (future) over-eager compiler optimizations
@test isa(Core.eval(@__MODULE__, :(Bar31062(()))), Bar31062)
@test precompile(identity, (Foo31062,))
ftype_eval = Ref(0)
FieldTypeA = String
FieldTypeE = UInt32
struct FieldConvert{FieldTypeA, S}
a::FieldTypeA
b::(ftype_eval[] += 1; Vector{FieldTypeA})
c
d::Any
e::FieldTypeE
FieldConvert(a::S, b, c, d, e) where {S} = new{FieldTypeA, S}(a, b, c, d, e)
end
@test ftype_eval[] == 1
FieldTypeA = UInt64
FieldTypeE = String
let fc = FieldConvert(1.0, [2.0], 0x3, 0x4, 0x5)
@test fc.a === UInt64(1)
@test fc.b isa Vector{UInt64}
@test fc.c === 0x3
@test fc.d === 0x4
@test fc.e === UInt32(0x5)
end
@test ftype_eval[] == 1
let code = code_lowered(FieldConvert)[1].code
@test code[1] == Expr(:call, GlobalRef(Core, :apply_type), GlobalRef(@__MODULE__, :FieldConvert), GlobalRef(@__MODULE__, :FieldTypeA), Expr(:static_parameter, 1))
@test code[2] == Expr(:call, GlobalRef(Core, :fieldtype), Core.SSAValue(1), 1)
@test code[3] == Expr(:call, GlobalRef(Base, :convert), Core.SSAValue(2), Core.SlotNumber(2))
@test code[4] == Expr(:call, GlobalRef(Core, :fieldtype), Core.SSAValue(1), 2)
@test code[5] == Expr(:call, GlobalRef(Base, :convert), Core.SSAValue(4), Core.SlotNumber(3))
@test code[6] == Expr(:call, GlobalRef(Core, :fieldtype), Core.SSAValue(1), 4)
@test code[7] == Expr(:call, GlobalRef(Base, :convert), Core.SSAValue(6), Core.SlotNumber(5))
@test code[8] == Expr(:call, GlobalRef(Core, :fieldtype), Core.SSAValue(1), 5)
@test code[9] == Expr(:call, GlobalRef(Base, :convert), Core.SSAValue(8), Core.SlotNumber(6))
@test code[10] == Expr(:new, Core.SSAValue(1), Core.SSAValue(3), Core.SSAValue(5), Core.SlotNumber(4), Core.SSAValue(7), Core.SSAValue(9))
@test code[11] == Core.ReturnNode(Core.SSAValue(10))
end
# Issue #32820
function f32820(refs)
local x
for r in refs
try
error()
catch e
if !@isdefined(x)
x = []
end
push!(x, 1)
end
end
x
end
@test f32820(Any[1,2]) == Any[1, 1]
# Splatting with bad iterate
struct SplatBadIterate; end
Base.iterate(s::SplatBadIterate, args...) = ()
@test_throws BoundsError (SplatBadIterate()...,)
# issue #33954, layout with circular type parameters but not fields
struct P33954{T}
end
struct A33954
x::P33954{A33954}
end
@test isbitstype(Tuple{A33954})
struct Q33954{T}
x::Int
end
struct B33954
x::Q33954{B33954}
end
@test isbitstype(Tuple{B33954})
@test isbitstype(B33954)
struct A41503{d}
e::d
end
struct B41503{j,k} <: AbstractArray{A41503{B41503{Any,k}},Any}
l::k
end
@test !isbitstype(B41503{Any,Any})
@test_broken isbitstype(B41503{Any,Int})
struct B40050 <: Ref{Tuple{B40050}}
end
@test string((B40050(),)) == "($B40050(),)"
@test_broken isbitstype(Tuple{B40050})
# issue #41654
struct X41654 <: Ref{X41654}
end
@test isbitstype(X41654)
@test ('a'=>X41654(),)[1][2] isa X41654
# issue #43411
struct A43411{S, T}
x::NamedTuple{S, T}
end
@test isbitstype(A43411{(:a,), Tuple{Int}})
# issue #44614
struct T44614_1{T}
m::T
end
struct T44614_2{L}
tuple::NTuple{3, Int64}
T44614_2{L}(t::NTuple{3, Int64}) where {L} = new{sum(t)}(t)
end
struct T44614_3{L, N}
a::Tuple{T44614_2{L}}
param::NTuple{N, T44614_1}
T44614_3(a::Tuple{T44614_2{L}}, pars::NTuple{N, T44614_1}) where {L, N} = new{L, N}(a, pars)
end
@test sizeof((T44614_2{L} where L).body) == 24
let T = T44614_3{L,2} where L
# these values are computable, but we currently don't know how to compute them properly
ex = ErrorException("Argument is an incomplete T44614_3 type and does not have a definite size.")
@test_throws ex sizeof(T.body)
@test_throws ex sizeof(T)
@test_throws BoundsError fieldoffset(T.body, 2)
@test fieldoffset(T{1}, 2) == 24
end
# Issue #34206/34207
function mre34206(a, n)
va = view(a, :)
b = ntuple(_ -> va, n)::Tuple{Vararg{typeof(va)}}
return b[1].offset1
end
@test mre34206([44], 1) == 0
# Issue #34247
function f34247(a)
GC.@preserve a try
catch
end
true
end
@test f34247("")
# Issue #34482
function f34482()
Base.not_int("ABC")
1
end
function g34482()
Core.Intrinsics.arraylen(1)
1
end
function h34482()
Core.Intrinsics.bitcast(1, 1)
1
end
@test_throws ErrorException f34482()
@test_throws TypeError g34482()
@test_throws TypeError h34482()
struct NFANode34126
edges::Vector{Tuple{Nothing,NFANode34126}}
NFANode34126() = new(Tuple{Nothing,NFANode34126}[])
end
@test repr(NFANode34126()) == "$NFANode34126(Tuple{Nothing, $NFANode34126}[])"
# issue #35416
struct Node35416{T,K,X}
end
struct AVL35416{K,V}
avl:: Union{Nothing,Node35416{AVL35416{K,V},<:K,<:V}}
end
@test AVL35416(Node35416{AVL35416{Integer,AbstractString},Int,String}()) isa AVL35416{Integer,AbstractString}
# issue #31696
foo31696(x::Int8, y::Int8) = 1
foo31696(x::T, y::T) where {T <: Int8} = 2
@test length(methods(foo31696)) == 1
let T1 = Tuple{Int8}, T2 = Tuple{T} where T<:Int8, a = T1[(1,)], b = T2[(1,)]
b .= a
@test b[1] == (1,)
a .= b
@test a[1] == (1,)
end
# issue #36104
module M36104
using Test
struct T36104
v::Vector{M36104.T36104}
end
struct T36104 # check that redefining it works, issue #21816
v::Vector{T36104}
end
# with a gensymmed unionall
struct Symmetric{T,S<:AbstractMatrix{<:T}} <: AbstractMatrix{T}
data::S
uplo::Char
end
struct Symmetric{T,S<:AbstractMatrix{<:T}} <: AbstractMatrix{T}
data::S
uplo::Char
end
@test_throws ErrorException begin
struct Symmetric{T,S<:AbstractMatrix{T}} <: AbstractMatrix{T}
data::S
uplo::Char
end
end
end
@test fieldtypes(M36104.T36104) == (Vector{M36104.T36104},)
@test_throws ErrorException("expected") @eval(struct X36104; x::error("expected"); end)
@test @isdefined(X36104)
struct X36104; x::Int; end
@test fieldtypes(X36104) == (Int,)
primitive type P36104 8 end
@test_throws ErrorException("invalid redefinition of constant P36104") @eval(primitive type P36104 16 end)
# Malformed invoke
f_bad_invoke(x::Int) = invoke(x, (Any,), x)
@test_throws TypeError f_bad_invoke(1)
# Fixup for #37044, make sure mutation of `types` field of `DataType` is respected.
struct A37044{T1,T2}
x::T1
y::T2
end
struct Ref37044
x::DataType
end
function f37044(r)
t = r.x
if !isdefined(t, :types)
Base.datatype_fieldtypes(t)
end
return t.types
end
r37044 = Ref37044(A37044{Int}.body)
@test f37044(r37044)[1] === Int
a37265() = 0
b37265() = 0
function c37265(d)
if d == 1
e = a37265
elseif d == 2
e = b37265
else
try
catch
end
end
e
end
@test_throws UndefVarError c37265(0)
@test c37265(1) === a37265
@test c37265(2) === b37265
function c37265_2(d)
if 0
e = a37265
elseif 0
e = b37265
else
try
catch
end
end
e
end
@test_throws TypeError c37265_2(0)
struct PointerImmutable
a::Any
b::Int
end
struct NullableHomogeneousPointerImmutable
x1::PointerImmutable
x2::PointerImmutable
x3::PointerImmutable
NullableHomogeneousPointerImmutable() = new()
NullableHomogeneousPointerImmutable(x1) = new(x1)
NullableHomogeneousPointerImmutable(x1, x2) = new(x1, x2)
NullableHomogeneousPointerImmutable(x1, x2, x3) = new(x1, x2, x3)
end
function getfield_knownindex_unused(v)
v.x1
return
end
function getfield_unknownindex_unused(v, n)
getfield(v, n)
return
end
function getfield_knownindex_used1(r, v)
fld = v.x1
r[] += 1
return fld
end
function getfield_knownindex_used2(r, v)
fld = v.x1
r[] += 1
return fld.a
end
function getfield_knownindex_used3(r, v)
fld = v.x1
r[] += 1
return fld.b
end
let v = NullableHomogeneousPointerImmutable(),
v2 = NullableHomogeneousPointerImmutable(PointerImmutable(1, 2)),
r = Ref(0)
@test_throws UndefRefError getfield_knownindex_unused(v)
@test_throws UndefRefError getfield_unknownindex_unused(v, 1)
@test_throws UndefRefError getfield_unknownindex_unused(v, :x1)
@test_throws UndefRefError getfield_knownindex_used1(r, v)
@test r[] == 0
@test_throws UndefRefError getfield_knownindex_used2(r, v)
@test r[] == 0
@test_throws UndefRefError getfield_knownindex_used3(r, v)
@test r[] == 0
@test getfield_knownindex_unused(v2) === nothing
@test getfield_unknownindex_unused(v2, 1) === nothing
@test getfield_unknownindex_unused(v2, :x1) === nothing
@test getfield_knownindex_used1(r, v2) === PointerImmutable(1, 2)
@test r[] == 1
@test getfield_knownindex_used2(r, v2) === 1
@test r[] == 2
@test getfield_knownindex_used3(r, v2) === 2
@test r[] == 3
end
struct RedefinedSingleton
end
redefined_singleton_ref = Ref{Any}(RedefinedSingleton())
struct RedefinedSingleton
end
cmp_refs(a::Ref{Any}) = a[] === RedefinedSingleton()
@test cmp_refs(redefined_singleton_ref)
struct PointerNopadding{T}
a::Symbol
b::T
end
struct ContainsPointerNopadding{T}
a::PointerNopadding{T}
ContainsPointerNopadding{T}() where T = new{T}()
ContainsPointerNopadding{T}(a) where T = new{T}(a)
end
@test !Base.datatype_haspadding(PointerNopadding{Symbol})
@test !Base.datatype_haspadding(PointerNopadding{Int})
# Sanity check to make sure the meaning of haspadding didn't change.
@test Base.datatype_haspadding(PointerNopadding{Any})
@test !Base.datatype_haspadding(Tuple{PointerNopadding{Symbol}})
@test !Base.datatype_haspadding(Tuple{PointerNopadding{Int}})
@test !Base.datatype_haspadding(ContainsPointerNopadding{Symbol})
@test Base.datatype_haspadding(ContainsPointerNopadding{Int})
# Test the codegen optimized version as well as the unoptimized version of `jl_egal`
@noinline unopt_jl_egal(@nospecialize(a), @nospecialize(b)) =
ccall(:jl_egal, Cint, (Any, Any), a, b) != 0
@noinline opt_jl_egal(a, b) = a === b
let aint = ContainsPointerNopadding{Int}(), asym = ContainsPointerNopadding{Symbol}(),
hint = objectid(aint), hsym = objectid(asym)
# Test that the uninitialized bits field doesn't affect the objectid or ===
for i in 1:100
local i
# Increase the chance one of the objects contains garbage int
local bint = ContainsPointerNopadding{Int}()
local bsym = ContainsPointerNopadding{Symbol}()
@test objectid(bint) === hint
@test objectid(bsym) === hsym
@test aint === bint
@test asym === bsym
@test unopt_jl_egal(aint, bint)
@test unopt_jl_egal(asym, bsym)
@test opt_jl_egal(aint, bint)
@test opt_jl_egal(asym, bsym)
aint = bint
asym = bsym
end
end
# Check === for potentially NULL field
let vnull1 = NullableHomogeneousPointerImmutable(),
vnull2 = NullableHomogeneousPointerImmutable(),
v1 = NullableHomogeneousPointerImmutable(PointerImmutable(1, 2)),
v2 = NullableHomogeneousPointerImmutable(PointerImmutable(1, 2))
@test vnull1 === vnull2
@test unopt_jl_egal(vnull1, vnull2)
@test opt_jl_egal(vnull1, vnull2)
@test v1 === v2
@test unopt_jl_egal(v1, v2)
@test opt_jl_egal(v1, v2)
@test vnull1 !== v1
@test !unopt_jl_egal(vnull1, v1)
@test !opt_jl_egal(vnull1, v1)
@test vnull2 !== v2
@test !unopt_jl_egal(vnull2, v2)
@test !opt_jl_egal(vnull2, v2)
end
# Make sure non-allbits union is handled correctly
@noinline returns_union37557(r) = r[]
@noinline compare_union37557(r1, r2) = returns_union37557(r1) === returns_union37557(r2)
@test !compare_union37557(Ref{Union{Int,Vector{Int}}}(Int[]), Ref{Union{Int,Vector{Int}}}(Int[]))
@test !compare_union37557(Ref{Union{Int,Vector{Int}}}(1), Ref{Union{Int,Vector{Int}}}(Int[]))
@test !compare_union37557(Ref{Union{Int,Vector{Int}}}(1),
Ref{Union{Int,Vector{Int}}}(3))
let array = Int[]
@test compare_union37557(Ref{Union{Int,Vector{Int}}}(array),
Ref{Union{Int,Vector{Int}}}(array))
end
@test compare_union37557(Ref{Union{Int,Vector{Int}}}(1),
Ref{Union{Int,Vector{Int}}}(1))
# issue #38224
struct S38224
i::Union{Int,Missing}
end
@test S38224.flags & 0x10 == 0x10 # .zeroinit
for _ in 1:5
let a = Vector{S38224}(undef, 1000000)
@test all(x->ismissing(x.i), a)
end
end
# Redefining types with Vararg
abstract type RedefineVararg; end
const RedefineVarargN{N} = Tuple{Vararg{RedefineVararg, N}}
const RedefineVarargN{N} = Tuple{Vararg{RedefineVararg, N}}
# NTuples with non-types
@test NTuple{3, 2} == Tuple{2, 2, 2}
# issue #18621
function f18621()
g = (k(i) for i in 1:5)
k = identity
return collect(g)
end
@test f18621() == 1:5
@test [_ for _ in 1:5] == 1:5
# issue #35130
const T35130 = Tuple{Vector{Int}, <:Any}
@eval struct A35130
x::Vector{Tuple{Vector{Int}, Any}}
A35130(x) = $(Expr(:new, :A35130, :x))
end
h35130(x) = A35130(Any[x][1]::Vector{T35130})
@test h35130(T35130[([1],1)]) isa A35130
# issue #41503
let S = Tuple{Tuple{Tuple{K, UInt128} where K<:Tuple{Int64}, Int64}},
T = Tuple{Tuple{Tuple{Tuple{Int64}, UInt128}, Int64}}
@test pointer_from_objref(T) === pointer_from_objref(S)
@test isbitstype(T)
end
# avoid impossible normalization (don't try to form Tuple{Complex{String}} here)
@test Tuple{Complex{T} where String<:T<:String} == Tuple{Complex{T} where String<:T<:String}
# control over compilation/interpreter
@testset "Experimental.@force_compile" begin
function trim_after_eval(str::AbstractString)
rng = findfirst("eval(", str)
@test !isempty(rng)
return str[1:first(rng)-1]
end
btc = eval(quote
Base.Experimental.@force_compile
backtrace()
end)
bti = eval(quote
backtrace()
end)
@test !occursin(r"(interpreter|do_call)", trim_after_eval(string(stacktrace(btc, true))))
@test occursin(r"(interpreter|do_call)", trim_after_eval(string(stacktrace(bti, true))))
end
@testset "rest(svec, ...)" begin
x = Core.svec(1, 2, 3)
a..., = x
@test a == Core.svec(1, 2, 3)
a, b... = x
@test a == 1
@test b == Core.svec(2, 3)
end
@testset "setproperty! on modules" begin
m = Module()
@eval m global x::Int
setglobal!(m, :x, 1)
@test m.x === 1
setglobal!(m, :x, 2, :release)
@test m.x === 2
@test_throws ConcurrencyViolationError setglobal!(m, :x, 3, :not_atomic)
@test_throws ErrorException setglobal!(m, :x, 4., :release)
m.x = 1
@test m.x === 1
setproperty!(m, :x, 2, :release)
@test m.x === 2
@test_throws ConcurrencyViolationError setproperty!(m, :x, 3, :not_atomic)
m.x = 4.
@test m.x === 4
end
# #45350 - Codegen for assignment to binding imported from module
module Foo45350
global x45350::Int = 1
end
import .Foo45350: x45350
f45350() = (global x45350 = 2)
@test_throws ErrorException f45350()
# #46503 - redefine `invoke`d methods
foo46503(@nospecialize(a), b::Union{Vector{Any}, Float64, Nothing}) = rand()
foo46503(a::Int, b::Nothing) = @invoke foo46503(a::Any, b)
@test 0 <= foo46503(1, nothing) <= 1
foo46503(@nospecialize(a), b::Union{Nothing, Float64}) = rand() + 10
@test 10 <= foo46503(1, nothing) <= 11
@testset "effect override on Symbol(::String)" begin
@test Core.Compiler.is_foldable(Base.infer_effects(Symbol, (String,)))
end
@testset "error message for getfield with bad integer type" begin
@test_throws "expected Union{$Int, Symbol}" getfield((1,2), Int8(1))
end
# Correct isdefined error for isdefined of Module of Int fld
f_isdefined_one(@nospecialize(x)) = isdefined(x, 1)
@test (try; f_isdefined_one(@__MODULE__); catch err; err; end).got === 1
# Unspecialized retrieval of vararg length
fvarargN(x::Tuple{Vararg{Int, N}}) where {N} = N
fvarargN(args...) = fvarargN(args)
finvokevarargN() = Base.inferencebarrier(fvarargN)(1, 2, 3)
@test finvokevarargN() == 3
# Make sure that @specialize actually overrides a module annotation
module SpecializeModuleTest
@nospecialize
f(@specialize(x), y) = 2
@specialize
end
@test methods(SpecializeModuleTest.f)[1].nospecialize & 0b11 == 0b10
let # https://github.com/JuliaLang/julia/issues/46918
# jl_binding_type shouldn't be unstable
code = quote
res1 = ccall(:jl_binding_type, Any, (Any, Any), Main, :stderr)
stderr
res2 = ccall(:jl_binding_type, Any, (Any, Any), Main, :stderr)
res3 = ccall(:jl_binding_type, Any, (Any, Any), Main, :stderr)
print(stdout, res1, " ", res2, " ", res3)
end |> x->join(x.args, ';')
cmd = `$(Base.julia_cmd()) -e $code` # N.B make sure not to pass this code as `:block`
stdout = IOBuffer()
stderr = IOBuffer()
@test success(pipeline(Cmd(cmd); stdout, stderr))
@test isempty(String(take!(stderr))) # make sure no error has happened
@test String(take!(stdout)) == "nothing IO IO"
end
Computing file changes ...
