mirror of
https://github.com/luau-lang/luau.git
synced 2024-11-15 14:25:44 +08:00
551a43c424
- Updated Roblox copyright to 2023 - Floor division operator `//` (implements #832) - Autocomplete now shows `end` within `do` blocks - Restore BraceType when using `Lexer::lookahead` (fixes #1019) # New typechecker - Subtyping tests between metatables and tables - Subtyping tests between string singletons and tables - Subtyping tests for class types # Native codegen - Fixed macOS test failure (wrong spill restore offset) - Fixed clobbering of non-volatile xmm registers on Windows - Fixed wrong storage location of SSA reg spills - Implemented A64 support for add/sub extended - Eliminated zextReg from A64 lowering - Remove identical table slot lookups - Propagate values from predecessor into the linear block - Disabled reuse slot optimization - Keep `LuaNode::val` check for nil when optimizing `CHECK_SLOT_MATCH` - Implemented IR translation of `table.insert` builtin - Fixed mmap error handling on macOS/Linux # Tooling - Used `|` as a column separator instead of `+` in `bench.py` - Added a `table.sort` micro-benchmark - Switched `libprotobuf-mutator` to a less problematic version
133 lines
4.2 KiB
Lua
133 lines
4.2 KiB
Lua
-- This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
|
|
print('testing vectors')
|
|
|
|
-- detect vector size
|
|
local vector_size = if pcall(function() return vector(0, 0, 0).w end) then 4 else 3
|
|
|
|
-- equality
|
|
assert(vector(1, 2, 3) == vector(1, 2, 3))
|
|
assert(vector(0, 1, 2) == vector(-0, 1, 2))
|
|
assert(vector(1, 2, 3) ~= vector(1, 2, 4))
|
|
|
|
-- rawequal
|
|
assert(rawequal(vector(1, 2, 3), vector(1, 2, 3)))
|
|
assert(rawequal(vector(0, 1, 2), vector(-0, 1, 2)))
|
|
assert(not rawequal(vector(1, 2, 3), vector(1, 2, 4)))
|
|
|
|
-- type & tostring
|
|
assert(type(vector(1, 2, 3)) == "vector")
|
|
|
|
if vector_size == 4 then
|
|
assert(tostring(vector(1, 2, 3, 4)) == "1, 2, 3, 4")
|
|
assert(tostring(vector(-1, 2, 0.5, 0)) == "-1, 2, 0.5, 0")
|
|
else
|
|
assert(tostring(vector(1, 2, 3)) == "1, 2, 3")
|
|
assert(tostring(vector(-1, 2, 0.5)) == "-1, 2, 0.5")
|
|
end
|
|
|
|
local t = {}
|
|
|
|
-- basic table access
|
|
t[vector(1, 2, 3)] = 42
|
|
assert(t[vector(1, 2, 3)] == 42)
|
|
assert(t[vector(1, 2, 4)] == nil)
|
|
|
|
-- negative zero should hash the same as zero
|
|
assert(t[vector(0, 0, 0)] == nil)
|
|
t[vector(0, 0, 0)] = "hello"
|
|
assert(t[vector(0, 0, 0)] == "hello")
|
|
assert(t[vector(0, -0, 0)] == "hello")
|
|
|
|
-- test arithmetic instructions
|
|
assert(vector(1, 2, 4) + vector(8, 16, 24) == vector(9, 18, 28));
|
|
assert(vector(1, 2, 4) - vector(8, 16, 24) == vector(-7, -14, -20));
|
|
|
|
local val = 1/'8'
|
|
|
|
assert(vector(1, 2, 4) * vector(8, 16, 24) == vector(8, 32, 96));
|
|
assert(vector(1, 2, 4) * 8 == vector(8, 16, 32));
|
|
assert(vector(1, 2, 4) * (1 / val) == vector(8, 16, 32));
|
|
assert(8 * vector(8, 16, 24) == vector(64, 128, 192));
|
|
assert(vector(1, 2, 4) * '8' == vector(8, 16, 32));
|
|
assert('8' * vector(8, 16, 24) == vector(64, 128, 192));
|
|
|
|
if vector_size == 4 then
|
|
assert(vector(1, 2, 4, 8) / vector(8, 16, 24, 32) == vector(1/8, 2/16, 4/24, 8/32));
|
|
assert(8 / vector(8, 16, 24, 32) == vector(1, 1/2, 1/3, 1/4));
|
|
assert('8' / vector(8, 16, 24, 32) == vector(1, 1/2, 1/3, 1/4));
|
|
else
|
|
assert(vector(1, 2, 4) / vector(8, 16, 24, 1) == vector(1/8, 2/16, 4/24));
|
|
assert(8 / vector(8, 16, 24) == vector(1, 1/2, 1/3));
|
|
assert('8' / vector(8, 16, 24) == vector(1, 1/2, 1/3));
|
|
end
|
|
|
|
assert(vector(1, 2, 4) / 8 == vector(1/8, 1/4, 1/2));
|
|
assert(vector(1, 2, 4) / (1 / val) == vector(1/8, 2/8, 4/8));
|
|
assert(vector(1, 2, 4) / '8' == vector(1/8, 1/4, 1/2));
|
|
|
|
assert(-vector(1, 2, 4) == vector(-1, -2, -4));
|
|
|
|
-- test floor division
|
|
assert(vector(1, 3, 5) // 2 == vector(0, 1, 2))
|
|
assert(vector(1, 3, 5) // val == vector(8, 24, 40))
|
|
|
|
if vector_size == 4 then
|
|
assert(10 // vector(1, 2, 3, 4) == vector(10, 5, 3, 2))
|
|
assert(vector(10, 9, 8, 7) // vector(1, 2, 3, 4) == vector(10, 4, 2, 1))
|
|
else
|
|
assert(10 // vector(1, 2, 3) == vector(10, 5, 3))
|
|
assert(vector(10, 9, 8) // vector(1, 2, 3) == vector(10, 4, 2))
|
|
end
|
|
|
|
-- test NaN comparison
|
|
local nanv = vector(0/0, 0/0, 0/0)
|
|
assert(nanv ~= nanv);
|
|
|
|
-- __index
|
|
assert(vector(1, 2, 2).Magnitude == 3)
|
|
assert(vector(0, 0, 0)['Dot'](vector(1, 2, 4), vector(5, 6, 7)) == 45)
|
|
|
|
-- __namecall
|
|
assert(vector(1, 2, 4):Dot(vector(5, 6, 7)) == 45)
|
|
|
|
-- can't use vector with NaN components as table key
|
|
assert(pcall(function() local t = {} t[vector(0/0, 2, 3)] = 1 end) == false)
|
|
assert(pcall(function() local t = {} t[vector(1, 0/0, 3)] = 1 end) == false)
|
|
assert(pcall(function() local t = {} t[vector(1, 2, 0/0)] = 1 end) == false)
|
|
assert(pcall(function() local t = {} rawset(t, vector(0/0, 2, 3), 1) end) == false)
|
|
|
|
-- make sure we cover both builtin and C impl
|
|
assert(vector(1, 2, 4) == vector("1", "2", "4"))
|
|
|
|
-- validate component access (both cases)
|
|
assert(vector(1, 2, 3).x == 1)
|
|
assert(vector(1, 2, 3).X == 1)
|
|
assert(vector(1, 2, 3).y == 2)
|
|
assert(vector(1, 2, 3).Y == 2)
|
|
assert(vector(1, 2, 3).z == 3)
|
|
assert(vector(1, 2, 3).Z == 3)
|
|
|
|
-- additional checks for 4-component vectors
|
|
if vector_size == 4 then
|
|
assert(vector(1, 2, 3, 4).w == 4)
|
|
assert(vector(1, 2, 3, 4).W == 4)
|
|
end
|
|
|
|
-- negative zero should hash the same as zero
|
|
-- note: our earlier test only really checks the low hash bit, so in absence of perfect avalanche it's insufficient
|
|
do
|
|
local larget = {}
|
|
for i = 1, 2^14 do
|
|
larget[vector(0, 0, i)] = true
|
|
end
|
|
|
|
larget[vector(0, 0, 0)] = 42
|
|
|
|
assert(larget[vector(0, 0, 0)] == 42)
|
|
assert(larget[vector(0, 0, -0)] == 42)
|
|
assert(larget[vector(0, -0, 0)] == 42)
|
|
assert(larget[vector(-0, 0, 0)] == 42)
|
|
end
|
|
|
|
return 'OK'
|