tibia-client/modules/corelib/table.lua

185 lines
3.2 KiB
Lua
Raw Normal View History

2012-06-26 00:13:30 +02:00
-- @docclass table
function table.dump(t, depth)
if not depth then depth = 0 end
for k,v in pairs(t) do
2011-12-07 01:31:55 +01:00
str = (' '):rep(depth * 2) .. k .. ': '
if type(v) ~= "table" then
2011-11-17 21:40:31 +01:00
print(str .. tostring(v))
else
print(str)
table.dump(v, depth+1)
end
end
end
function table.clear(t)
for k,v in pairs(t) do
t[k] = nil
end
end
function table.copy(t)
local res = {}
for k,v in pairs(t) do
res[k] = v
end
return res
end
function table.recursivecopy(t)
local res = {}
for k,v in pairs(t) do
if type(v) == "table" then
res[k] = table.recursivecopy(v)
else
res[k] = v
end
end
return res
end
2012-01-05 02:55:07 +01:00
function table.selectivecopy(t, keys)
local res = { }
for i,v in ipairs(keys) do
res[v] = t[v]
end
return res
end
function table.merge(t, src)
for k,v in pairs(src) do
t[k] = v
end
end
2012-01-05 02:55:07 +01:00
function table.find(t, value, lowercase)
2012-01-05 02:55:07 +01:00
for k,v in pairs(t) do
if lowercase and type(value) == 'string' and type(v) == 'string' then
if v:lower() == value:lower() then return k end
end
2012-01-05 02:55:07 +01:00
if v == value then return k end
end
end
function table.findbykey(t, key, lowercase)
for k,v in pairs(t) do
if lowercase and type(key) == 'string' and type(k) == 'string' then
if k:lower() == key:lower() then return v end
end
if k == key then return v end
end
end
function table.contains(t, value, lowercase)
return table.find(t, value, lowercase) ~= nil
end
function table.findkey(t, key)
if t and type(t) == 'table' then
for k,v in pairs(t) do
if k == key then return k end
end
end
end
function table.haskey(t, key)
return table.findkey(t, key) ~= nil
end
2012-01-05 02:55:07 +01:00
function table.removevalue(t, value)
for k,v in pairs(t) do
if v == value then
2012-01-07 21:00:07 +01:00
table.remove(t, k)
2013-01-26 23:12:00 +01:00
return true
2012-01-05 02:55:07 +01:00
end
end
2013-01-26 23:12:00 +01:00
return false
2012-01-07 21:00:07 +01:00
end
2013-01-26 21:10:30 +01:00
function table.popvalue(value)
local index = nil
for k,v in pairs(t) do
if v == value or not value then
index = k
end
end
if index then
table.remove(t, index)
return true
end
return false
end
2012-01-07 21:00:07 +01:00
function table.compare(t, other)
if #t ~= #other then return false end
for k,v in pairs(t) do
if v ~= other[k] then return false end
2012-01-05 02:55:07 +01:00
end
2012-01-07 21:00:07 +01:00
return true
2012-01-05 02:55:07 +01:00
end
function table.empty(t)
if t and type(t) == 'table' then
return next(t) == nil
end
return true
end
function table.permute(t, n, count)
n = n or #t
for i=1,count or n do
local j = math.random(i, n)
t[i], t[j] = t[j], t[i]
end
return t
end
function table.findbyfield(t, fieldname, fieldvalue)
for _i,subt in pairs(t) do
if subt[fieldname] == fieldvalue then
return subt
end
end
return nil
end
function table.size(t)
local size = 0
for i, n in pairs(t) do
size = size + 1
end
return size
end
function table.tostring(t)
local maxn = #t
local str = ""
for k,v in pairs(t) do
v = tostring(v)
if k == maxn and k ~= 1 then
str = str .. " and " .. v
elseif maxn > 1 and k ~= 1 then
str = str .. ", " .. v
else
str = str .. " " .. v
end
end
return str
end
2013-03-02 21:01:29 +01:00
function table.collect(t, func)
local res = {}
for k,v in pairs(t) do
local a,b = func(k,v)
if a and b then
res[a] = b
elseif a ~= nil then
table.insert(res,a)
end
end
return res
end