mirror of
https://github.com/appgurueu/modlib.git
synced 2024-11-22 07:13:45 +01:00
141 lines
2.8 KiB
Lua
141 lines
2.8 KiB
Lua
local coroutine_create, coroutine_resume, coroutine_yield, coroutine_status, unpack, select
|
|
= coroutine.create, coroutine.resume, coroutine.yield, coroutine.status, unpack, select
|
|
|
|
local add = modlib.func.add
|
|
|
|
--+ For all functions which aggregate over single values, use modlib.table.ivalues - not ipairs - for lists!
|
|
--+ Otherwise they will be applied to the indices.
|
|
local iterator = {}
|
|
|
|
-- Equivalent to `for x, y, z in iterator, state, ... do callback(x, y, z) end`
|
|
function iterator.foreach(callback, iterator, state, ...)
|
|
local function loop(...)
|
|
if ... == nil then return end
|
|
callback(...)
|
|
return loop(iterator(state, ...))
|
|
end
|
|
return loop(iterator(state, ...))
|
|
end
|
|
|
|
function iterator.for_generator(caller, ...)
|
|
local co = coroutine_create(function(...)
|
|
return caller(function(...)
|
|
return coroutine_yield(...)
|
|
end, ...)
|
|
end)
|
|
local args, n_args = {...}, select("#", ...)
|
|
return function()
|
|
if coroutine_status(co) == "dead" then
|
|
return
|
|
end
|
|
local function _iterate(status, ...)
|
|
if not status then
|
|
error((...))
|
|
end
|
|
return ...
|
|
end
|
|
return _iterate(coroutine_resume(co, unpack(args, 1, n_args)))
|
|
end
|
|
end
|
|
|
|
function iterator.range(from, to, step)
|
|
if not step then
|
|
if not to then
|
|
from, to = 1, from
|
|
end
|
|
step = 1
|
|
end
|
|
|
|
return function(_, current)
|
|
current = current + step
|
|
if current > to then
|
|
return
|
|
end
|
|
return current
|
|
end, nil, from - step
|
|
end
|
|
|
|
function iterator.aggregate(binary_func, total, ...)
|
|
for value in ... do
|
|
total = binary_func(total, value)
|
|
end
|
|
return total
|
|
end
|
|
|
|
function iterator.min(less_than_func, ...)
|
|
local min
|
|
for value in ... do
|
|
if min == nil or less_than_func(value, min) then
|
|
min = value
|
|
end
|
|
end
|
|
return min
|
|
end
|
|
|
|
-- TODO iterator.max
|
|
|
|
function iterator.count(...)
|
|
local count = 0
|
|
for _ in ... do
|
|
count = count + 1
|
|
end
|
|
return count
|
|
end
|
|
|
|
function iterator.sum(...)
|
|
return iterator.aggregate(add, 0, ...)
|
|
end
|
|
|
|
function iterator.average(...)
|
|
local count = 0
|
|
local sum = 0
|
|
for value in ... do
|
|
count = count + 1
|
|
sum = sum + value
|
|
end
|
|
return sum / count
|
|
end
|
|
|
|
--: ... **restartable** iterator
|
|
-- A single pass method for calculating the standard deviation exists but is highly inaccurate
|
|
function iterator.standard_deviation(...)
|
|
local avg = iterator.average(...)
|
|
local count = 0
|
|
local sum = 0
|
|
for value in ... do
|
|
count = count + 1
|
|
sum = sum + (value - avg)^2
|
|
end
|
|
return (sum / count)^.5
|
|
end
|
|
|
|
-- Comprehensions ("collectors")
|
|
|
|
-- Shorthand for `for k, v in ... do t[k] = v end`
|
|
function iterator.to_table(...)
|
|
local t = {}
|
|
for k, v in ... do
|
|
t[k] = v
|
|
end
|
|
return t
|
|
end
|
|
|
|
-- Shorthand for `for k in ... do t[#t + 1] = k end`
|
|
function iterator.to_list(...)
|
|
local t = {}
|
|
for k in ... do
|
|
t[#t + 1] = k
|
|
end
|
|
return t
|
|
end
|
|
|
|
-- Shorthand for `for k in ... do t[k] = true end`
|
|
function iterator.to_set(...)
|
|
local t = {}
|
|
for k in ... do
|
|
t[k] = true
|
|
end
|
|
return t
|
|
end
|
|
|
|
return iterator |