220 lines
4.7 KiB
Lua
220 lines
4.7 KiB
Lua
module 'aux'
|
|
|
|
do
|
|
local classes, constructors, interfaces, objects = {}, {}, {}, setmetatable({}, {__mode='k'})
|
|
local private_mt = {__metatable=false}
|
|
function private_mt:__newindex(k, v)
|
|
classes[self][k] = v
|
|
end
|
|
local public_mt = {__metatable=false}
|
|
function public_mt:__newindex(k, v)
|
|
classes[self][k] = v
|
|
interfaces[self][k] = function(self, ...)
|
|
return classes[self][k](objects[self], unpack(arg))
|
|
end
|
|
end
|
|
local proxy_mt = {__metatable=false, __newindex=nop}
|
|
function proxy_mt:__call()
|
|
local object = setmetatable({}, {__metatable=false, __newindex=nop, __index=interfaces[self]})
|
|
classes[object] = classes[self]
|
|
objects[object] = setmetatable({}, {__index=classes[self]})
|
|
constructors[self](objects[object])
|
|
return object
|
|
end
|
|
function M.class()
|
|
local class, interface = {}, {}
|
|
local private, public, proxy = setmetatable({}, private_mt), setmetatable({}, public_mt), setmetatable({}, proxy_mt)
|
|
classes[private], classes[public], classes[proxy] = class, class, class
|
|
interfaces[public], interfaces[proxy] = interface, interface
|
|
return private, public, function(constructor)
|
|
constructors[proxy] = constructor or nop
|
|
return proxy
|
|
end
|
|
end
|
|
end
|
|
|
|
do
|
|
local _state = setmetatable(t, T('__mode', 'kv'))
|
|
local __index = function(self, k)
|
|
return _state[self].handler({public=self, private=_state[self].state}, k)
|
|
end
|
|
function M.index_function(state, handler) -- TODO rename table-accessor, use predicate to stop
|
|
local state, self = {handler=handler, state=state}, t
|
|
_state[self] = state
|
|
return setmetatable(self, {__metatable=false, __index=__index, state=state})
|
|
end
|
|
end
|
|
|
|
M.select = vararg-function(arg)
|
|
for _ = 1, arg[1] do
|
|
tremove(arg, 1)
|
|
end
|
|
if getn(arg) == 0 then
|
|
return nil
|
|
else
|
|
return unpack(arg)
|
|
end
|
|
end
|
|
|
|
M.join = table.concat
|
|
|
|
function M.range(arg1, arg2)
|
|
local i, n = arg2 and arg1 or 1, arg2 or arg1
|
|
if i <= n then return first, range(i + 1, n) end
|
|
end
|
|
|
|
function M.replicate(count, value)
|
|
if count > 0 then return value, replicate(count - 1, value) end
|
|
end
|
|
|
|
do
|
|
local state
|
|
local function f()
|
|
local temp = state
|
|
state = nil
|
|
return temp
|
|
end
|
|
function M.present(v)
|
|
state = v
|
|
return f
|
|
end
|
|
end
|
|
|
|
M.papply = vararg-function(arg)
|
|
local f, arg1 = tremove(arg, 1), static-arg
|
|
return vararg-function(arg)
|
|
for i = 1, getn(arg) do
|
|
tinsert(arg1, arg[i])
|
|
end
|
|
return f(unpack(arg1))
|
|
end
|
|
end
|
|
|
|
M.index = vararg-function(arg)
|
|
local t = tremove(arg, 1)
|
|
for i = 1, getn(arg) do t = t and t[arg[i]] end return t
|
|
end
|
|
|
|
M.huge = 1.8 * 10 ^ 308
|
|
|
|
function M.get_modified()
|
|
return IsShiftKeyDown() or IsControlKeyDown() or IsAltKeyDown()
|
|
end
|
|
|
|
function M.copy(t)
|
|
local copy = _M.t
|
|
for k, v in t do copy[k] = v end
|
|
table.setn(copy, getn(t))
|
|
return setmetatable(copy, getmetatable(t))
|
|
end
|
|
|
|
function M.size(t)
|
|
local size = 0
|
|
for _ in t do size = size + 1 end
|
|
return size
|
|
end
|
|
|
|
function M.key(value, t)
|
|
for k, v in t do if v == value then return k end end
|
|
end
|
|
|
|
function M.keys(t)
|
|
local keys = _M.t
|
|
for k in t do tinsert(keys, k) end
|
|
return keys
|
|
end
|
|
|
|
function M.values(t)
|
|
local values = _M.t
|
|
for _, v in t do tinsert(values, v) end
|
|
return values
|
|
end
|
|
|
|
function M.eq(t1, t2)
|
|
if not t1 or not t2 then return false end
|
|
for key, value in t1 do
|
|
if t2[key] ~= value then return false end
|
|
end
|
|
for key, value in t2 do
|
|
if t1[key] ~= value then return false end
|
|
end
|
|
return true
|
|
end
|
|
|
|
function M.any(t, predicate)
|
|
for _, v in t do
|
|
if predicate then
|
|
if predicate(v) then return true end
|
|
elseif v then
|
|
return true
|
|
end
|
|
end
|
|
return false
|
|
end
|
|
|
|
function M.all(t, predicate)
|
|
for _, v in t do
|
|
if predicate then
|
|
if not predicate(v) then return false end
|
|
elseif not v then
|
|
return false
|
|
end
|
|
end
|
|
return true
|
|
end
|
|
|
|
function M.filter(t, predicate)
|
|
for k, v in t do
|
|
if not predicate(v, k) then t[k] = nil end
|
|
end
|
|
return t
|
|
end
|
|
|
|
function M.map(t, f)
|
|
for k, v in t do t[k] = f(v, k) end
|
|
return t
|
|
end
|
|
|
|
function M.trim(str)
|
|
return gsub(str, '^%s*(.-)%s*$', '%1')
|
|
end
|
|
|
|
function M.split(str, separator)
|
|
local parts = t
|
|
while true do
|
|
local start_index = strfind(str, separator, 1, true)
|
|
if start_index then
|
|
local part = strsub(str, 1, start_index - 1)
|
|
tinsert(parts, part)
|
|
str = strsub(str, start_index + 1)
|
|
else
|
|
local part = strsub(str, 1)
|
|
tinsert(parts, part)
|
|
return parts
|
|
end
|
|
end
|
|
end
|
|
|
|
function M.tokenize(str)
|
|
local tokens = t
|
|
for token in string.gfind(str, '%S+') do tinsert(tokens, token) end
|
|
return tokens
|
|
end
|
|
|
|
function M.bounded(lower_bound, upper_bound, number)
|
|
return max(lower_bound, min(upper_bound, number))
|
|
end
|
|
|
|
function M.round(x)
|
|
return floor(x + .5)
|
|
end
|
|
|
|
function M.later(t, t0)
|
|
t0 = t0 or GetTime()
|
|
return function() return GetTime() - t0 > t end
|
|
end
|
|
|
|
function M.signal()
|
|
local params
|
|
return vararg-function(arg) params = static-arg end, function() return params end
|
|
end |