-
Notifications
You must be signed in to change notification settings - Fork 19
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Lua environment attached to engine, small fixes for lua scripting, etc..
- Loading branch information
Showing
25 changed files
with
841 additions
and
646 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
-- Main entry point for editor Lua scripts | ||
|
||
luaEditor = luaEditor or {} | ||
|
||
loadScript("ED:/scripts/pretty_table.lua") |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,82 @@ | ||
|
||
luaEditor = luaEditor or {} | ||
|
||
function luaEditor.prettyTable(node) | ||
local cache, stack, output = {}, {}, {} | ||
local depth = 1 | ||
local output_str = "{\n" | ||
|
||
while true do | ||
local size = 0 | ||
|
||
for k, v 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 .. " = {\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) | ||
|
||
return output_str | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
-- Main entry point for engine Lua scripts | ||
|
||
luaEngine = luaEngine or {} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.