if not chunk then return src()
else return chunk end
else
- table.insert(t, chunk)
+ t[#t+1] = chunk
end
end
end
function sink.table(t)
t = t or {}
local f = function(chunk, err)
- if chunk then table.insert(t, chunk) end
+ if chunk then t[#t+1] = chunk end
return 1
end
return f, t
local s, e = str:find(pat, c, not regex)
max = max - 1
if s and max < 0 then
- table.insert(t, str:sub(c))
+ t[#t+1] = str:sub(c)
else
- table.insert(t, str:sub(c, s and s - 1))
+ t[#t+1] = str:sub(c, s and s - 1)
end
c = e and e + 1 or #str + 1
until not s or max < 0
local result = {}
for i, a in ipairs(arg) do
for j, v in ipairs(a) do
- table.insert(result, v)
+ result[#result+1] = v
end
end
return result
local keys = { }
if t then
for k, _ in kspairs(t) do
- table.insert( keys, k )
+ keys[#keys+1] = k
end
end
return keys
local keys = { }
for k, v in pairs(t) do
- table.insert( keys, k )
+ keys[#keys+1] = k
end
local _pos = 0
while true do
line = pp:read()
if (line == nil) then break end
- table.insert(data, line)
+ data[#data+1] = line
end
pp:close()
local function helper (section)
if not comparator or comparator(section) then
- table.insert(del, section[".name"])
+ del[#del+1] = section[".name"]
end
end
function(section)
if section.affects then
for i, aff in ipairs(section.affects) do
- table.insert(deps, aff)
+ deps[#deps+1] = aff
end
end
end)
for i, dep in ipairs(deps) do
for j, add in ipairs(_resolve_deps(dep)) do
- table.insert(reload, add)
+ reload[#reload+1] = add
end
end
for j, config in ipairs(configlist) do
for i, e in ipairs(_resolve_deps(config)) do
if not util.contains(reloadlist, e) then
- table.insert(reloadlist, e)
+ reloadlist[#reloadlist+1] = e
end
end
end
-- Search all <% %> expressions
local function expr_add(ws1, skip1, command, skip2, ws2)
- table.insert(expr, command)
+ expr[#expr+1] = command
return ( #skip1 > 0 and "" or ws1 ) ..
"<%" .. tostring(#expr) .. "%>" ..
( #skip2 > 0 and "" or ws2 )