/usr/share/ettercap/lua/third-party/tree.lua is in ettercap-common 1:0.8.2-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 | --- Tables as trees.
local list = require "list"
local metatable = {}
--- Make a table into a tree
-- @param t table
-- @return tree
local function new (t)
return setmetatable (t or {}, metatable)
end
--- Tree <code>__index</code> metamethod.
-- @param tr tree
-- @param i non-table, or list of keys <code>{i<sub>1</sub> ...
-- i<sub>n</sub>}</code>
-- @return <code>tr[i]...[i<sub>n</sub>]</code> if i is a table, or
-- <code>tr[i]</code> otherwise
function metatable.__index (tr, i)
-- FIXME: the following doesn't treat list keys correctly
-- e.g. tr[{{1, 2}, {3, 4}}], maybe flatten first?
if type (i) == "table" and #i > 0 then
return list.foldl (op["[]"], tr, i)
else
return rawget (tr, i)
end
end
--- Tree <code>__newindex</code> metamethod.
-- Sets <code>tr[i<sub>1</sub>]...[i<sub>n</sub>] = v</code> if i is a
-- table, or <code>tr[i] = v</code> otherwise
-- @param tr tree
-- @param i non-table, or list of keys <code>{i<sub>1</sub> ...
-- i<sub>n</sub>}</code>
-- @param v value
function metatable.__newindex (tr, i, v)
if type (i) == "table" then
for n = 1, #i - 1 do
if getmetatable (tr[i[n]]) ~= metatable then
rawset (tr, i[n], new ())
end
tr = tr[i[n]]
end
rawset (tr, i[#i], v)
else
rawset (tr, i, v)
end
end
--- Make a deep copy of a tree, including any metatables
-- @param t table
-- @param nometa if non-nil don't copy metatables
-- @return copy of table
local function clone (t, nometa)
local r = {}
if not nometa then
setmetatable (r, getmetatable (t))
end
local d = {[t] = r}
local function copy (o, x)
for i, v in pairs (x) do
if type (v) == "table" then
if not d[v] then
d[v] = {}
if not nometa then
setmetatable (d[v], getmetatable (v))
end
o[i] = copy (d[v], v)
else
o[i] = d[v]
end
else
o[i] = v
end
end
return o
end
return copy (r, t)
end
--- Deep-merge one tree into another. <code>u</code> is merged into
--- <code>t</code>.
-- @param t first tree
-- @param u second tree
-- @return first tree
local function merge (t, u)
for ty, p, n in nodes (u) do
if ty == "leaf" then
t[p] = n
end
end
return t
end
-- Public interface
local M = {
clone = clone,
merge = merge,
new = new,
}
return M
|