minetest-mods/xdecor
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Optimize table inserting

Browse Source
This commit is contained in:
kilbith 2015-08-24 21:44:39 +02:00
parent f1a50fdd9a
commit df80f18f90
2 changed files with 17 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
worktable.lua
View File

@ -98,7 +98,7 @@ function worktable.dig(pos, _)
if not inv:is_empty("input") or not inv:is_empty("forms") or not
inv:is_empty("hammer") or not inv:is_empty("tool") or not
inv:is_empty("storage") or not inv:is_empty("craft") then
inv:is_empty("storage") then
return false
end
return true
@ -146,7 +146,7 @@ local function update_form_inventory(inv, input_stack)
local form_name = form[1]
local count = math.min(worktable.anz(form_name) * inv:get_stack("input", 1):get_count(), input_stack:get_stack_max())
table.insert(form_inv_list, string.format("xdecor:%s_%s %d", form_name, material_name, count))
form_inv_list[#form_inv_list+1] = string.format("xdecor:%s_%s %d", form_name, material_name, count)
end
inv:set_list("forms", form_inv_list)
end

30
xwall.lua
View File

@ -104,33 +104,33 @@ function xwall.construct_node_box_data(node_box_list, center_node_box_list, node
res.c0, res.c1, res.c2, res.c3, res.c4 = {}, {}, {}, {}, {}
for _, v in pairs(node_box_list) do
table.insert(res.c1, v)
table.insert(res.c2, v)
table.insert(res.c3, v)
table.insert(res.c4, v)
res.c1[#res.c1+1] = v
res.c2[#res.c2+1] = v
res.c3[#res.c3+1] = v
res.c4[#res.c4+1] = v
end
for _, v in pairs(node_box_list) do
table.insert(res.c2, {v[3], v[2], v[1], v[6], v[5], v[4]})
table.insert(res.c3, {v[3], v[2], v[1], v[6], v[5], v[4]})
table.insert(res.c4, {v[3], v[2], v[1], v[6], v[5], v[4]})
res.c2[#res.c2+1] = {v[3], v[2], v[1], v[6], v[5], v[4]}
res.c3[#res.c3+1] = {v[3], v[2], v[1], v[6], v[5], v[4]}
res.c4[#res.c4+1] = {v[3], v[2], v[1], v[6], v[5], v[4]}
end
for _, v in pairs(node_box_list) do
table.insert(res.c3, {v[4], v[2], v[3]-0.5, v[1], v[5], v[6]-0.5})
table.insert(res.c4, {v[4], v[2], v[3]-0.5, v[1], v[5], v[6]-0.5})
res.c3[#res.c3+1] = {v[4], v[2], v[3]-0.5, v[1], v[5], v[6]-0.5}
res.c4[#res.c4+1] = {v[4], v[2], v[3]-0.5, v[1], v[5], v[6]-0.5}
end
for _, v in pairs(node_box_list) do
table.insert(res.c4, {v[3]-0.5, v[2], v[4], v[6]-0.5, v[5], v[1]})
res.c4[#res.c4+1] = {v[3]-0.5, v[2], v[4], v[6]-0.5, v[5], v[1]}
end
for _, v in pairs(center_node_box_list) do
table.insert(res.c0, v)
table.insert(res.c1, v)
table.insert(res.c2, v)
table.insert(res.c3, v)
table.insert(res.c4, v)
res.c0[#res.c0+1] = v
res.c1[#res.c1+1] = v
res.c2[#res.c2+1] = v
res.c3[#res.c3+1] = v
res.c4[#res.c4+1] = v
end
if #res.c0 < 1 then res.c0 = nil end