mirror of
https://github.com/IntQuant/noita_entangled_worlds.git
synced 2025-10-19 15:13:16 +00:00
84 lines
2.7 KiB
Lua
84 lines
2.7 KiB
Lua
local pretty_print = {}
|
|
pretty_print.table = function(node)
|
|
-- to make output beautiful
|
|
local function tab(amt)
|
|
local str = ""
|
|
for _ = 1, amt do
|
|
str = str .. "\t"
|
|
end
|
|
return str
|
|
end
|
|
|
|
local cache, stack, output = {}, {}, {}
|
|
local depth = 1
|
|
local output_str = "{\n"
|
|
|
|
while true do
|
|
local size = 0
|
|
for _, _ in pairs(node) do
|
|
size = size + 1
|
|
end
|
|
|
|
local cur_index = 1
|
|
for k, v in pairs(node) do
|
|
if (cache[node] == nil) or (cur_index >= cache[node]) then
|
|
if string.find(output_str, "}", output_str:len()) then
|
|
output_str = output_str .. ",\n"
|
|
elseif not (string.find(output_str, "\n", output_str:len())) then
|
|
output_str = output_str .. "\n"
|
|
end
|
|
|
|
-- This is necessary for working with HUGE tables otherwise we run out of memory using concat on huge strings
|
|
table.insert(output, output_str)
|
|
output_str = ""
|
|
|
|
local key
|
|
if type(k) == "number" or type(k) == "boolean" then
|
|
key = "[" .. tostring(k) .. "]"
|
|
else
|
|
key = "['" .. tostring(k) .. "']"
|
|
end
|
|
|
|
if type(v) == "number" or type(v) == "boolean" then
|
|
output_str = output_str .. tab(depth) .. key .. " = " .. tostring(v)
|
|
elseif type(v) == "table" then
|
|
output_str = output_str .. tab(depth) .. key .. " = {\n"
|
|
table.insert(stack, node)
|
|
table.insert(stack, v)
|
|
cache[node] = cur_index + 1
|
|
break
|
|
else
|
|
output_str = output_str .. tab(depth) .. key .. " = '" .. tostring(v) .. "'"
|
|
end
|
|
|
|
if cur_index == size then
|
|
output_str = output_str .. "\n" .. tab(depth - 1) .. "}"
|
|
else
|
|
output_str = output_str .. ","
|
|
end
|
|
else
|
|
-- close the table
|
|
if cur_index == size then
|
|
output_str = output_str .. "\n" .. tab(depth - 1) .. "}"
|
|
end
|
|
end
|
|
|
|
cur_index = cur_index + 1
|
|
end
|
|
|
|
if #stack > 0 then
|
|
node = stack[#stack]
|
|
stack[#stack] = nil
|
|
depth = cache[node] == nil and depth + 1 or depth - 1
|
|
else
|
|
break
|
|
end
|
|
end
|
|
|
|
-- This is necessary for working with HUGE tables otherwise we run out of memory using concat on huge strings
|
|
table.insert(output, output_str)
|
|
output_str = table.concat(output)
|
|
|
|
return output_str
|
|
end
|
|
return pretty_print
|