Mirrorlandia_minetest/drawers
1
0
Fork 0
mirror of https://github.com/minetest-mods/drawers.git synced 2024-11-22 14:43:45 +01:00
Code Issues Projects Releases Wiki Activity

Adapt drop function for 2x2 drawers to drop *all* items

Browse Source
This commit is contained in:
LNJ 2017-04-03 12:43:16 +02:00
parent d3d29fb497
commit 69a974cb6b
No known key found for this signature in database
GPG Key ID: 69268DBD835B6B0B
1 changed files with 29 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
lua/api.lua
View File

@ -77,26 +77,39 @@ end
-- drop all items -- drop all items
function drawers.drawer_on_dig(pos, node, player) function drawers.drawer_on_dig(pos, node, player)
local drawerType = 1
if core.registered_nodes[node.name] then
drawerType = core.registered_nodes[node.name].groups.drawer
end
local meta = core.get_meta(pos) local meta = core.get_meta(pos)
local count = meta:get_int("count")
local name = meta:get_string("name") k = 1
while k <= drawerType do
-- don't add a number in meta fields for 1x1 drawers
local vid = tostring(k)
if drawerType == 1 then vid = "" end
local count = meta:get_int("count"..vid)
local name = meta:get_string("name"..vid)
-- drop the items
local stack_max = ItemStack(name):get_stack_max()
local j = math.floor(count / stack_max) + 1
local i = 1
while i <= j do
if not (i == j) then
core.add_item(pos, name .. " " .. stack_max)
else
core.add_item(pos, name .. " " .. count % stack_max)
end
i = i + 1
end
k = k + 1
end
-- remove node -- remove node
core.node_dig(pos, node, player) core.node_dig(pos, node, player)
-- drop the items
local stack_max = ItemStack(name):get_stack_max()
local j = math.floor(count / stack_max) + 1
local i = 1
while i <= j do
if not (i == j) then
core.add_item(pos, name .. " " .. stack_max)
else
core.add_item(pos, name .. " " .. count % stack_max)
end
i = i + 1
end
end end
function drawers.drawer_insert_object(pos, node, stack, direction) function drawers.drawer_insert_object(pos, node, stack, direction)