forked from NathanSnail/wand_eval_tree
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprint.lua
More file actions
79 lines (67 loc) · 2.22 KB
/
Copy pathprint.lua
File metadata and controls
79 lines (67 loc) · 2.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
-- taken from https://stackoverflow.com/questions/9168058/how-to-dump-a-table-to-console make it better at some point
return function(node)
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 .. string.rep("\t", depth) .. key .. " = " .. tostring(v)
elseif type(v) == "table" then
output_str = output_str .. string.rep("\t", depth) .. key .. " = " .. tostring(v) .. " {\n"
table.insert(stack, node)
table.insert(stack, v)
cache[node] = cur_index + 1
break
else
output_str = output_str .. string.rep("\t", depth) .. key .. " = '" .. tostring(v) .. "'"
end
if cur_index == size then
output_str = output_str .. "\n" .. string.rep("\t", depth - 1) .. "}"
else
output_str = output_str .. ","
end
else
-- close the table
if cur_index == size then
output_str = output_str .. "\n" .. string.rep("\t", depth - 1) .. "}"
end
end
cur_index = cur_index + 1
end
if size == 0 then
output_str = output_str .. "\n" .. string.rep("\t", depth - 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)
print(output_str)
end