/
NeedToKnow.Bar_Update(groupID, barID); |
end |
function MemberDump(v, bIndex, filter, indent) |
if not v then |
function MemberDump(v, bIndex, filter, indent, recurse) |
if v == nil then |
print("nil") |
return |
elseif type(v) == "table" then |
for index, value in pairs(v) do |
if (not filter) or (type(index) == "string" and index:find(filter)) then |
print(indent, index, value); |
if (type(value) == "table") then MemberDump(value, nil, nil, indent.." | ") end |
if (recurse and type(value) == "table") then MemberDump(value, nil, nil, indent.." | ",true) end |
end |
end |
local mt = getmetatable(v) |
-- An array, like Groups or Bars. Compare each element against def[1] |
for i,v in ipairs(t)do |
local rhs = def[i] |
if not rhs then rhs = def[1] end |
if rhs == nil then rhs = def[1] end |
if NeedToKnow.RemoveDefaultValues(v, rhs, k .. " " .. i) then |
t[i] = nil |
end |
if not k then k = "" end |
local n = table.maxn(t) |
if n > 0 then |
for i=1,n do |
local rhs = def[i] |
if rhs == nil then rhs = def[1] end |
if t[i] == nil then |
t[i] = NeedToKnow.DeepCopy(rhs) |
for i=1,n do |
local rhs = def[i] |
if rhs == nil then rhs = def[1] end |
if t[i] == nil then |
t[i] = NeedToKnow.DeepCopy(rhs) |
else |
NeedToKnow.AddDefaultsToTable(t[i], rhs, k .. " " .. i) |
end |
end |
else |
NeedToKnow.AddDefaultsToTable(t[i], rhs, k .. " " .. i) |
end |
end |
else |
for kD,vD in pairs(def) do |
if t[kD] == nil then |
if type(vD) == "table" then |
t[kD] = NeedToKnow.DeepCopy(vD) |
for kD,vD in pairs(def) do |
if t[kD] == nil then |
if type(vD) == "table" then |
t[kD] = NeedToKnow.DeepCopy(vD) |
else |
t[kD] = vD |
end |
else |
t[kD] = vD |
NeedToKnow.AddDefaultsToTable(t[kD], vD, k .. " " .. kD) |
end |
else |
NeedToKnow.AddDefaultsToTable(t[kD], vD, k .. " " .. kD) |
end |
end |
end |
end |
function NeedToKnow.UncompressProfile(profileSettings) |
end |
end |
for key,value in pairs(dest) do |
if not source[key] then |
if source[key] == nil then |
dest[key] = nil |
end |
end |