luau/tests/conformance/tables.lua

-- This file is part of the Luau programming language and is licensed under MIT License; see LICENSE.txt for details
-- This file is based on Lua 5.x tests -- https://github.com/lua/lua/tree/master/testes
print('testing tables, next, and for')

local unpack = table.unpack

-- testing table.insert return value
assert(select('#', table.insert({}, 42)) == 0)

local a = {}

-- make sure table has lots of space in hash part
for i=1,100 do a[i.."+"] = true end
for i=1,100 do a[i.."+"] = nil end
-- fill hash part with numeric indices testing size operator
for i=1,100 do
  a[i] = true
  assert(#a == i)
end


if T then
-- testing table sizes

local l2 = math.log(2)
local function log2 (x) return math.log(x)/l2 end

local function mp2 (n)   -- minimum power of 2 >= n
  local mp = 2^math.ceil(log2(n))
  assert(n == 0 or (mp/2 < n and n <= mp))
  return mp
end

local function fb (n)
  local r, nn = T.int2fb(n)
  assert(r < 256)
  return nn
end

-- test fb function
local a = 1
local lim = 2^30
while a < lim do
  local n = fb(a)
  assert(a <= n and n <= a*1.125)
  a = math.ceil(a*1.3)
end

 
local function check (t, na, nh)
  local a, h = T.querytab(t)
  if a ~= na or h ~= nh then
    print(na, nh, a, h)
    assert(nil)
  end
end

-- testing constructor sizes
local lim = 40
local s = 'return {'
for i=1,lim do
  s = s..i..','
  local s = s
  for k=0,lim do 
    local t = loadstring(s..'}')()
    assert(#t == i)
    check(t, fb(i), mp2(k))
    s = string.format('%sa%d=%d,', s, k, k)
  end
end


-- tests with unknown number of elements
local a = {}
for i=1,lim do a[i] = i end   -- build auxiliary table
for k=0,lim do
  local a = {unpack(a,1,k)}
  assert(#a == k)
  check(a, k, 0)
  a = {1,2,3,unpack(a,1,k)}
  check(a, k+3, 0)
  assert(#a == k + 3)
end


print'+'

-- testing tables dynamically built
local lim = 130

do
  local a = {}; a[2] = 1; check(a, 0, 1)
  a = {}; a[0] = 1; check(a, 0, 1); a[2] = 1; check(a, 0, 2)
  a = {}; a[0] = 1; a[1] = 1; check(a, 1, 1)
  a = {}
  for i = 1,lim do
    a[i] = 1
    assert(#a == i)
    check(a, mp2(i), 0)
  end
end

do
  local a = {}
  for i = 1,lim do
    a['a'..i] = 1
    assert(#a == 0)
    check(a, 0, mp2(i))
  end
end

do
  local a = {}
  for i=1,16 do a[i] = i end
  check(a, 16, 0)
  for i=1,11 do a[i] = nil end
  for i=30,40 do a[i] = nil end   -- force a rehash (?)
  check(a, 0, 8)
  a[10] = 1
  for i=30,40 do a[i] = nil end   -- force a rehash (?)
  check(a, 0, 8)
  for i=1,14 do a[i] = nil end
  for i=30,50 do a[i] = nil end   -- force a rehash (?)
  check(a, 0, 4)
end

do   -- rehash moving elements from array to hash
  local a = {}
  for i = 1, 100 do a[i] = i end
  check(a, 128, 0)

  for i = 5, 95 do a[i] = nil end
  check(a, 128, 0)

  a.x = 1     -- force a re-hash
  check(a, 4, 8)

  for i = 1, 4 do assert(a[i] == i) end
  for i = 5, 95 do assert(a[i] == nil) end
  for i = 96, 100 do assert(a[i] == i) end
  assert(a.x == 1)
end

-- reverse filling
for i=1,lim do
  local a = {}
  for i=i,1,-1 do a[i] = i end   -- fill in reverse
  check(a, mp2(i), 0)
end

-- size tests for vararg
lim = 35
function foo (n, ...)
  local arg = {...}
  check(arg, n, 0)
  assert(select('#', ...) == n)
  arg[n+1] = true
  check(arg, mp2(n+1), 0)
  arg.x = true
  check(arg, mp2(n+1), 1)
end
local a = {}
for i=1,lim do a[i] = true; foo(i, unpack(a)) end

end


-- test size operation on empty tables
assert(#{} == 0)
assert(#{nil} == 0)
assert(#{nil, nil} == 0)
assert(#{nil, nil, nil} == 0)
assert(#{nil, nil, nil, nil} == 0)
print'+'


local nofind = {}

a,b,c = 1,2,3
a,b,c = nil

local function find (name)
  local n,v
  while 1 do
    n,v = next(_G, n)
    if not n then return nofind end
    assert(v ~= nil)
    if n == name then return v end
  end
end

local function find1 (name)
  for n,v in pairs(_G) do
    if n==name then return v end
  end
  return nil  -- not found
end

do   -- create 10000 new global variables
  for i=1,10000 do _G[i] = i end
end


a = {x=90, y=8, z=23}
assert(table.foreach(a, function(i,v) if i=='x' then return v end end) == 90)
assert(table.foreach(a, function(i,v) if i=='a' then return v end end) == nil)
table.foreach({}, error)

table.foreachi({x=10, y=20}, error)
local a = {n = 1}
table.foreachi({n=3}, function (i, v)
  assert(a.n == i and not v)
  a.n=a.n+1
end)
a = {10,20,30,nil,50}
table.foreachi(a, function (i,v) assert(a[i] == v) end)
assert(table.foreachi({'a', 'b', 'c'}, function (i,v)
         if i==2 then return v end
       end) == 'b')


-- assert(print==find("print") and print == find1("print"))
-- assert(_G["print"]==find("print"))
-- assert(assert==find1("assert"))
assert(nofind==find("return"))
assert(not find1("return"))
_G["ret" .. "urn"] = nil
assert(nofind==find("return"))
_G["xxx"] = 1
-- assert(xxx==find("xxx"))
print('+')

a = {}
for i=0,10000 do
  if i % 10 ~= 0 then
    a['x'..i] = i
  end
end

n = {n=0}
for i,v in pairs(a) do
  n.n = n.n+1
  assert(i and v and a[i] == v)
end
assert(n.n == 9000)
a = nil

-- remove those 10000 new global variables
for i=1,10000 do _G[i] = nil end

do   -- clear global table
  local a = {}
  local preserve = {io = 1, string = 1, debug = 1, os = 1,
                    coroutine = 1, table = 1, math = 1}
  for n,v in pairs(_G) do a[n]=v end
  for n,v in pairs(a) do
    if not preserve[n] and type(v) ~= "function" and
       not string.find(n, "^[%u_]") then
     _G[n] = nil
    end
    collectgarbage()
  end
end

local function foo ()
  local getfenv, setfenv, assert, next =
        getfenv, setfenv, assert, next
  local n = {gl1=3}
  setfenv(foo, n)
  assert(getfenv(foo) == getfenv(1))
  assert(getfenv(foo) == n)
  assert(print == nil and gl1 == 3)
  gl1 = nil
  gl = 1
  assert(n.gl == 1 and next(n, 'gl') == nil)
end
foo()

print'+'

local function checknext (a)
  local b = {}
  table.foreach(a, function (k,v) b[k] = v end)
  for k,v in pairs(b) do assert(a[k] == v) end
  for k,v in pairs(a) do assert(b[k] == v) end
  b = {}
  do local k,v = next(a); while k do b[k] = v; k,v = next(a,k) end end
  for k,v in pairs(b) do assert(a[k] == v) end
  for k,v in pairs(a) do assert(b[k] == v) end
end

checknext{1,x=1,y=2,z=3}
checknext{1,2,x=1,y=2,z=3}
checknext{1,2,3,x=1,y=2,z=3}
checknext{1,2,3,4,x=1,y=2,z=3}
checknext{1,2,3,4,5,x=1,y=2,z=3}

assert(table.getn{} == 0)
assert(table.getn{[-1] = 2} == 0)
assert(table.getn{1,2,3,nil,nil} == 3)
for i=0,40 do
  local a = {}
  for j=1,i do a[j]=j end
  assert(table.getn(a) == i)
end


assert(table.maxn{} == 0)
assert(table.maxn{[-100] = 1} == 0)
assert(table.maxn{["1000"] = true} == 0)
assert(table.maxn{["1000"] = true, [24.5] = 3} == 24.5)
assert(table.maxn{[1000] = true} == 1000)
assert(table.maxn{[10] = true, [100*math.pi] = print} == 100*math.pi)
a = {[10] = 1, [20] = 2}
a[20] = nil
assert(table.maxn(a) == 10)


-- int overflow
a = {}
for i=0,50 do a[math.pow(2,i)] = true end
assert(a[table.getn(a)])

print("+")


-- erasing values
local t = {[{1}] = 1, [{2}] = 2, [string.rep("x ", 4)] = 3,
           [100.3] = 4, [4] = 5}

local n = 0
for k, v in pairs( t ) do
  n = n+1
  assert(t[k] == v)
  t[k] = nil
  collectgarbage()
  assert(t[k] == nil)
end
assert(n == 5)


local function test (a)
  table.insert(a, 10); table.insert(a, 2, 20);
  table.insert(a, 1, -1); table.insert(a, 40);
  table.insert(a, table.getn(a)+1, 50)
  table.insert(a, 2, -2)
  assert(table.remove(a,1) == -1)
  assert(table.remove(a,1) == -2)
  assert(table.remove(a,1) == 10)
  assert(table.remove(a,1) == 20)
  assert(table.remove(a,1) == 40)
  assert(table.remove(a,1) == 50)
  assert(table.remove(a,1) == nil)
end

a = {n=0, [-7] = "ban"}
test(a)
assert(a.n == 0 and a[-7] == "ban")

a = {[-7] = "ban"};
test(a)
assert(a.n == nil and table.getn(a) == 0 and a[-7] == "ban")


table.insert(a, 1, 10); table.insert(a, 1, 20); table.insert(a, 1, -1)
assert(table.remove(a) == 10)
assert(table.remove(a) == 20)
assert(table.remove(a) == -1)

a = {'c', 'd'}
table.insert(a, 3, 'a')
table.insert(a, 'b')
assert(table.remove(a, 1) == 'c')
assert(table.remove(a, 1) == 'd')
assert(table.remove(a, 1) == 'a')
assert(table.remove(a, 1) == 'b')
assert(table.getn(a) == 0 and a.n == nil)
print("+")

-- out of range insertion
a = {1, 2, 3}
table.insert(a, 0, 0)
assert(a[0] == 0 and table.concat(a) == "123")
table.insert(a, 10, 10)
assert(a[0] == 0 and table.concat(a) == "123" and table.maxn(a) == 10 and a[10] == 10)
table.insert(a, -10^9, 42)
assert(a[0] == 0 and table.concat(a) == "123" and table.maxn(a) == 10 and a[10] == 10 and a[-10^9] == 42)
table.insert(a, 0 / 0, 42) -- platform-dependent behavior atm so hard to validate

a = {}
for i=1,1000 do
  a[i] = i; a[i-1] = nil
end
assert(next(a,nil) == 1000 and next(a,1000) == nil)

assert(next({}) == nil)
assert(next({}, nil) == nil)

-- testing table.create and table.find
do
  local t = table.create(5)
  assert(#t == 0) -- filled with nil!
  t[5] = 5
  assert(#t == 5) -- magic

  local t2 = table.create(5, "nice")
  assert(table.concat(t2,"!") == "nice!nice!nice!nice!nice")

  assert(table.find(t2, "nice") == 1)
  assert(table.find(t2, "nice", 5) == 5)
  assert(table.find(t2, "nice", 6) == nil)

  assert(table.find({false, true}, true) == 2)

  -- make sure table.find checks the hash portion as well by constructing a table literal that forces the value into the hash part
  assert(table.find({[(1)] = true}, true) == 1)
end

-- test table.concat
do
  -- regular usage
  assert(table.concat({}) == "")
  assert(table.concat({}, ",") == "")
  assert(table.concat({"a", "b", "c"}, ",") == "a,b,c")
  assert(table.concat({"a", "b", "c"}, ",", 2) == "b,c")
  assert(table.concat({"a", "b", "c"}, ",", 1, 2) == "a,b")

  -- hash elements
  local t = {}
  t[123] = "a"
  t[124] = "b"

  assert(table.concat(t) == "")
  assert(table.concat(t, ",", 123, 124) == "a,b")
  assert(table.concat(t, ",", 123, 123) == "a")

  -- numeric values
  assert(table.concat({1, 2, 3}, ",") == "1,2,3")
  assert(table.concat({"a", 2, "c"}, ",") == "a,2,c")

  -- error cases
  assert(pcall(table.concat, "") == false)
  assert(pcall(table.concat, t, false) == false)
  assert(pcall(table.concat, t, ",", 1, 100) == false)
end

-- test indexing with strings that have zeroes embedded in them
do
	local t = {}
	t['start\0end'] = 1
	t['start'] = 2
	assert(t['start\0end'] == 1)
	assert(t['start'] == 2)
end

-- test table freezing
do
  local t = {}
  assert(not table.isfrozen(t))
  t[1] = 1
  t.a = 2

  -- basic freeze test to validate invariants
  assert(table.freeze(t) == t)
  assert(table.isfrozen(t))
  assert(not pcall(rawset, t, 1, 2))
  assert(not pcall(rawset, t, "a", 2))
  assert(not pcall(function() t.a = 3 end))
  assert(not pcall(function() t[1] = 3 end))
  assert(not pcall(setmetatable, t, {}))
  assert(not pcall(table.freeze, t)) -- already frozen

  -- can't freeze tables with protected metatable
  local t = {}
  setmetatable(t, { __metatable = "nope" })
  assert(not pcall(table.freeze, t))
  assert(not table.isfrozen(t))

  -- note that it's valid to freeze a table with a metatable and protect it later, freeze doesn't freeze metatable automatically
  local mt = {}
  local t = setmetatable({}, mt)
  table.freeze(t)
  mt.__metatable = "nope"
  assert(table.isfrozen(t))
  assert(getmetatable(t) == "nope")
end

-- test #t
do
  local t = table.create(10, 1)
  assert(#t == 10)
  t[5] = nil
  assert(#t == 10)
  t[10] = nil
  assert(#t == 9)
  t[9] = nil
  t[8] = nil
  assert(#t == 7)

  t = table.create(10)
  assert(#t == 0)
  t[1] = 1
  assert(#t == 1)
  t[2] = 1
  assert(#t == 2)
  t[3] = 1
  t[4] = 1
  assert(#t == 4)

  t = table.create(10)
  assert(#t == 0)
  table.insert(t, 1)
  assert(#t == 1)
  table.insert(t, 1)
  assert(#t == 2)
  table.insert(t, 1)
  table.insert(t, 1)
  assert(#t == 4)

  t = table.create(10, 1)
  assert(#t == 10)
  table.remove(t)
  assert(#t == 9)
  table.remove(t)
  table.remove(t)
  assert(#t == 7)
end

-- test clone
do
  local t = {a = 1, b = 2, 3, 4, 5}
  local tt = table.clone(t)

  assert(#tt == 3)
  assert(tt.a == 1 and tt.b == 2)

  t.c = 3
  assert(tt.c == nil)

  t = table.freeze({"test"})
  tt = table.clone(t)
  assert(table.isfrozen(t) and not table.isfrozen(tt))

  t = setmetatable({}, {})
  tt = table.clone(t)
  assert(getmetatable(t) == getmetatable(tt))

  t = setmetatable({}, {__metatable = "protected"})
  assert(not pcall(table.clone, t))

  function order(t)
    local r = ''
    for k,v in pairs(t) do
      r ..= tostring(v)
    end
    return v
  end

  t = {a = 1, b = 2, c = 3, d = 4, e = 5, f = 6}
  tt = table.clone(t)
  assert(order(t) == order(tt))

  assert(not pcall(table.clone))
  assert(not pcall(table.clone, 42))
end

-- test boundary invariant maintenance during rehash
do
  local arr = table.create(5, 42)

  arr[1] = nil
  arr.a = 'a' -- trigger rehash

  assert(#arr == 5) -- technically 0 is also valid, but it happens to be 5 because array capacity is 5
end

-- test boundary invariant maintenance when replacing hash keys
do
  local arr = {}
  arr.a = 'a'
  arr.a = nil
  arr[1] = 1 -- should rehash and resize array part, otherwise # won't find the boundary in array part

  assert(#arr == 1)
end

-- test boundary invariant maintenance when table is filled from the end
do
  local arr = {}
  for i=5,2,-1 do
    arr[i] = i
    assert(#arr == 0)
  end
  arr[1] = 1
  assert(#arr == 5)
end

-- test boundary invariant maintenance when table is filled using SETLIST opcode
do
  local arr = {[2]=2,1}
  assert(#arr == 2)
end

-- test boundary invariant maintenance when table is filled using table.move
do
  local t1 = {1, 2, 3, 4, 5}
  local t2 = {[6] = 6}

  table.move(t1, 1, 5, 1, t2)
  assert(#t2 == 6)
end

-- test boundary invariant in sparse arrays or various kinds
do
  local function obscuredalloc() return {} end

  local bits = 16

  for i = 1, 2^bits - 1 do
      local t1 = obscuredalloc() -- to avoid NEWTABLE guessing correct size

      for k = 1, bits do
          t1[k] = if bit32.extract(i, k - 1) == 1 then true else nil
      end
  end
end

-- test table.unpack fastcall for rejecting large unpacks
do
  local ok, res = pcall(function()
    local a = table.create(7999, 0)
    local b = table.create(8000, 0)

    local at = { table.unpack(a) }
    local bt = { table.unpack(b) }
  end)

  assert(not ok)
end

-- test iteration with lightuserdata keys
do
  function countud()
    local t = {}
    t[makelud(1)] = 1
    t[makelud(2)] = 2

    local count = 0
    for k,v in pairs(t) do
      count += v
    end

    return count
  end

  assert(countud() == 3)
end

-- test iteration with lightuserdata keys with a substituted environment
do
  local env = { makelud = makelud, pairs = pairs }
  setfenv(countud, env)
  assert(countud() == 3)
end

-- test __newindex-as-a-table indirection: this had memory safety bugs in Lua 5.1.0
do
  local hit = false

  local grandparent = {}
  grandparent.__newindex = function(s,k,v)
    assert(k == "foo" and v == 10)
    hit = true
  end

  local parent = {}
  parent.__newindex = parent
  setmetatable(parent, grandparent)

  local child = setmetatable({}, parent)
  child.foo = 10

  assert(hit and child.foo == nil and parent.foo == nil)
end

-- testing next x GC of deleted keys
do
  local co = coroutine.wrap(function (t)
    for k, v in pairs(t) do
        local k1 = next(t)    -- all previous keys were deleted
        assert(k == k1)       -- current key is the first in the table
        t[k] = nil
        local expected = (type(k) == "table" and k[1] or
                          type(k) == "function" and k() or
                          string.sub(k, 1, 1))
        assert(expected == v)
        coroutine.yield(v)
    end
  end)
  local t = {}
  t[{1}] = 1    -- add several unanchored, collectable keys
  t[{2}] = 2
  t[string.rep("a", 50)] = "a"    -- long string
  t[string.rep("b", 50)] = "b"
  t[{3}] = 3
  t[string.rep("c", 10)] = "c"    -- short string
  t[function () return 10 end] = 10
  local count = 7
  while co(t) do
    collectgarbage("collect")   -- collect dead keys
    count = count - 1
  end
  assert(count == 0 and next(t) == nil)    -- traversed the whole table
end
  
-- test error cases for table functions
do
  assert(pcall(table.insert, {}) == false)
  assert(pcall(table.insert, {}, 1, 2, 3) == false)
  assert(pcall(table.insert, table.freeze({1, 2, 3}), 4) == false)
  assert(pcall(table.insert, table.freeze({1, 2, 3}), 1, 4) == false)

  assert(pcall(table.remove, table.freeze({1})) == false)

  assert(pcall(table.concat, {true}) == false)

  assert(pcall(table.create) == false)
  assert(pcall(table.create, -1) == false)
  assert(pcall(table.create, 1e9) == false)

  assert(pcall(table.find, {}, 42, 0) == false)

  assert(pcall(table.clear, table.freeze({})) == false)
end

-- check that namecall lookup doesn't give up on entries missing from cached slot position
do
  for i = 1,10 do
    local t = setmetatable({}, { __index = { foo = 1 }})

    assert(t.foo == 1)

    t[-i] = 2
    t.foo = function(t, i) return -i end

    assert(t:foo(i) == -i)
  end
end

-- check that fast path for table lookup can't be tricked into assuming a light user data with string pointer is a string
assert((function ()
  local t = {}
  t[makelud("hi")] = "no"
  return t.hi
end)() == nil)

return"OK"