我需要一个程序(用于windows),可以按字母顺序排序Lua程序执行和关闭后保存的文件中的Lua值。我必须不断合并2个这样的文件,每次运行比较软件之前手动对它们进行排序是很痛苦的。如果可能的话,不需要Lua才能工作。
文件结构如下:
SavedVars = {
["1"] = {
["Val1"] = true,
["Val2"] = true,
["Val3"] = false,
...
["ValX"] = true,
},
["2"] = {
["Val1"] = true,
["Val2"] = true,
["Val3"] = false,
...
["ValX"] = true, },
["X"] = {
["Val1"] = true,
["Val2"] = true,
["Val3"] = false,
...
["ValX"] = true, },
}
SavedStats = {
["1"] = {
["Val1"] = 0,
["Val2"] = 1,
["Val3"] = 55,
...
["ValX"] = -55,
},
["2"] = {
["Val1"] = 0,0005,
["Val2"] = -0,0000000007648,
["Val3"] = 4,
...
["ValX"] = true, },
["X"] = {
["Val1"] = 0,
["Val2"] = 0,
["Val3"] = 0,
...
["ValX"] = 0, },
}
答案 0 :(得分:3)
更改您的Lua程序以按排序顺序输出内容。
我不确定你输出的是什么,我假设serialization function in "Programming in Lua"之类的东西,加上缩进。
您只需使用chapter 19.3中的for k,v in pairs(o) do
功能将for k,v in pairsByKeys(o) do
更改为pairsByKeys
。这是一个完整的例子,它会输出你在那里给出的东西。
-- serializes some object to the standard output.
--
-- o - the object to be formatted.
-- indent - a string used for indentation for tables.
-- cmp - a comparison function to sort the subtables.
-- May be nil, then we sort alphabetically (strings)
-- or numerically (numbers).
--
-- from http://www.lua.org/pil/12.1.1.html, modified to include
-- indentation and sorting.
--
function serialize_sorted (o, indent, cmp)
if type(o) == "nil" then
-- this should not really happen on recursion, as nil can
-- be neither key nor value in a table.
io.write("nil")
elseif type(o) == "number" then
io.write(o)
elseif type(o) == "string" then
io.write(string.format("%q", o))
elseif type(o) == "boolean" then
io.write( tostring(o) )
elseif type(o) == "table" then
io.write("{\n")
local subindent = indent .. " "
for k,v in pairsByKeys(o) do
io.write(subindent)
io.write("[")
serialize_sorted(k, subindent, cmp)
io.write("] = ")
serialize_sorted(v, subindent, cmp)
io.write(",\n")
end
io.write(indent .. "}")
else
error("cannot serialize a " .. type(o))
end
end
-- iterates over a table by key order.
--
-- t - the table to iterate over.
-- f - a comparator function used to sort the keys.
-- It may be nil, then we use the default order
-- for strings or numbers.
--
-- from http://www.lua.org/pil/19.3.html
--
function pairsByKeys (t, f)
local a = {}
for n in pairs(t) do table.insert(a, n) end
table.sort(a, f)
local i = 0 -- iterator counter
local iter = function () -- iterator function
i = i + 1
if a[i] == nil then return nil
else return a[i], t[a[i]]
end
end
return iter
end
-- our unsorted test table
testTable = {
["2"] = {
["Val1"] = true,
["ValX"] = true,
["Val2"] = true,
["Val3"] = false,
},
["1"] = {
["ValX"] = true,
["Val1"] = true,
["Val2"] = true,
["Val3"] = false,
},
["X"] = {
["Val3"] = false,
["ValX"] = true,
["Val1"] = true,
["Val2"] = true,
},
}
-- the output.
io.write("SavedVars = ")
serialize_sorted(testTable, "")
如果无法更改程序,可以在Lua中加载输入,然后使用此序列化方法再次输出它们。以下程序执行此操作(使用上面的serialize_sorted方法):
-- loads a string to a table.
-- this executes the string with the
-- environment of a new table, and then
-- returns the table.
--
-- The code in the string should not need
-- any variables it does not declare itself,
-- as these are not available on runtime.
-- It runs in a really empty environment.
function loadTable(data)
local table = {}
local f = assert(loadstring(data))
setfenv(f, table)
f()
return table
end
-- read input from stdin
local data = io.read("*all")
-- load table
local testTable = loadTable(data)
-- output everything
for k, v in pairsByKeys(testTable) do
io.write(k .. " = ")
serialize_sorted(v, "")
io.write("\n")
end
这可以创建像您的问题中的文件,即使是缩进,但也可以使用正确的逗号。
如果您的某个表包含字符串和数字键,则此排序不起作用 - 那么您必须考虑如何相对地对它们进行排序,并传递比较器函数。