Editing Module:Test/lib/search
Jump to navigation
Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 1: | Line 1: | ||
| − | local | + | local Search = {} |
--------------- | --------------- | ||
-- conductor -- | -- conductor -- | ||
--------------- | --------------- | ||
| − | + | -- sibling_key: optional, deprecate | |
| − | -- sibling_key: optional, deprecate | + | function Search.conductor(query, tbl, sibling_key) |
| + | local f_name = "find" | ||
| + | assert(query, string.format("bad argument #1 to '%s' (argument missing, search query)", f_name)) | ||
| + | assert(tbl, string.format("bad argument #2 to '%s' (argument missing, table to search through)", f_name)) | ||
| − | + | Search.state = { | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
["args"] = {}, | ["args"] = {}, | ||
["queried"] = {} | ["queried"] = {} | ||
} | } | ||
| − | + | Search.ancestors = {} | |
| + | |||
| + | Search.state.args.query = query | ||
| + | Search.state.args.table = tbl | ||
| + | Search.state.args.sibling_key = sibling_key | ||
| − | + | local result | |
| − | |||
| − | |||
| − | + | if not sibling_key then | |
| + | result = Search.find_first(query, tbl) | ||
| + | else | ||
| + | result = Search.find_sibling(query, sibling_key, tbl) | ||
| + | end | ||
if result then | if result then | ||
| − | + | Search.generate_anscestry_of_last_search(result) | |
| − | + | result.ancestors = Search.ancestors | |
return result | return result | ||
end | end | ||
| Line 39: | Line 38: | ||
-- ancestry -- | -- ancestry -- | ||
-------------- | -------------- | ||
| − | + | function Search.generate_anscestry_of_last_search(quad) | |
| − | + | quad = quad or {} | |
| − | + | for _,v in ipairs(Search.state.queried) do | |
| − | + | if v.value == quad.parent.table then | |
| − | + | table.insert(Search.ancestors, quad.parent.key) | |
| − | + | Search.generate_anscestry_of_last_search(v, Search.state.queried, ancestors) | |
| − | + | elseif not quad.parent.key then return nil | |
| − | + | end | |
| − | + | end | |
| − | + | end | |
---------------------- | ---------------------- | ||
-- search_condition -- | -- search_condition -- | ||
---------------------- | ---------------------- | ||
| − | + | function Search.search_condition(query, key, value) | |
| − | function | ||
local condition = false | local condition = false | ||
| − | if type(query) == | + | if type(query) == "string" or type(query) == "number" then |
condition = key == query | condition = key == query | ||
elseif query[1] and query[2] then | elseif query[1] and query[2] then | ||
| Line 72: | Line 70: | ||
---------------- | ---------------- | ||
| − | -- | + | -- find_first -- |
---------------- | ---------------- | ||
| − | + | function Search.find_first(query, tbl, tbl_key) | |
| − | function | + | local subtables = {} |
| − | local | ||
| − | for k,v in pairs(tbl) do | + | for k,v in pairs(tbl) do |
local quad = { | local quad = { | ||
| Line 84: | Line 81: | ||
value = v, | value = v, | ||
parent = { | parent = { | ||
| − | key = | + | key = tbl_key, |
table = tbl | table = tbl | ||
} | } | ||
} | } | ||
| − | + | -- I do this to be able to generate ancestry for the searh | |
| − | + | table.insert(Search.state.queried, quad) | |
| − | if | + | if Search.search_condition(query, k, v) then |
| − | + | return quad | |
| − | |||
elseif type(v) == "table" then | elseif type(v) == "table" then | ||
| − | table.insert( | + | table.insert(subtables, k) |
end | end | ||
end | end | ||
| − | for _, | + | -- By doing it like this it will first search through all of the children and after that |
| − | local | + | -- descend into grandchildren. |
| − | if | + | for _,k in ipairs(subtables) do |
| + | local f = Search.find_first(query, tbl[k], k) | ||
| + | if f then return f | ||
| + | end | ||
| + | end | ||
| + | end | ||
| + | |||
| + | ------------------ | ||
| + | -- find_sibling -- | ||
| + | ------------------ | ||
| + | function Search.find_sibling(query, sibling_key, tbl, tbl_key) | ||
| + | local subtables = {} | ||
| + | |||
| + | for k,v in pairs(tbl) do | ||
| + | |||
| + | local quad = { | ||
| + | key = k, | ||
| + | value = v, | ||
| + | parent = { | ||
| + | key = tbl_key, | ||
| + | value = table | ||
| + | } | ||
| + | } | ||
| + | |||
| + | -- I do this to be able to generate ancestry for the searh | ||
| + | table.insert(Search.state.queried, quad) | ||
| + | |||
| + | if Search.search_condition(query, k, v) and tbl[sibling_key] then | ||
| + | local sibling_quad = { | ||
| + | key = sibling_key, | ||
| + | value = tbl[sibling_key], | ||
| + | parent = { | ||
| + | key = tbl_key, | ||
| + | table = tbl | ||
| + | } | ||
| + | } | ||
| + | table.insert(Search.state.queried, sibling_quad) | ||
| + | return sibling_quad | ||
| + | elseif type(v) == "table" then | ||
| + | table.insert(subtables, k) | ||
| + | end | ||
| + | |||
| + | end | ||
| + | |||
| + | -- By doing it like this it will first search through all of the children and after that | ||
| + | -- descend into grandchildren. | ||
| + | for _,k in ipairs(subtables) do | ||
| + | local f = Search.find_sibling(query, sibling_key, tbl[k], k) | ||
| + | if f then return f | ||
| + | end | ||
end | end | ||
end | end | ||
| − | return | + | return Search |