benbot/nvim-treesitter
1
0
Fork 0
mirror of https://github.com/nvim-treesitter/nvim-treesitter.git synced 2026-07-04 12:30:01 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add predicate: has-ancestor?

Browse source
This commit is contained in:
Stephan Seitz 2020-07-24 21:03:46 +02:00 • committed by Thomas Vigouroux
parent 5462fc92cb
commit 6f771507a8
1 changed files with 26 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

31
lua/nvim-treesitter/query_predicates.lua
View file

@ -12,8 +12,13 @@ local function get_node(query, match, pred_item)
return utils.get_at_path(match, query.captures[pred_item]..'.node')
end
local function unlispify(name)
if not name then return '' end
return string.gsub(string.gsub(name, "%?$", '') or '', '-', '_')
end
function M.check_predicate(query, match, pred)
local check_function = M[string.gsub('check_'..pred[1], "%?$", '')]
local check_function = M[unlispify(pred[1])]
if check_function then
return check_function(query, match, pred)
else
@ -22,7 +27,7 @@ function M.check_predicate(query, match, pred)
end
function M.check_negated_predicate(query, match, pred)
local check_function = M[string.gsub('check_'..string.sub(pred[1], #"not-" + 1), "%?$", '')]
local check_function = M[unlispify(string.sub(pred[1], #"not-" + 1))]
if check_function then
return not check_function(query, match, pred)
else
@ -30,7 +35,7 @@ function M.check_negated_predicate(query, match, pred)
end
end
function M.check_first(query, match, pred)
function M.first(query, match, pred)
if #pred ~= 2 then error("first? must have exactly one argument!") end
local node = get_node(query, match, pred[2])
if node and node:parent() then
@ -38,7 +43,7 @@ function M.check_first(query, match, pred)
end
end
function M.check_last(query, match, pred)
function M.last(query, match, pred)
if #pred ~= 2 then error("first? must have exactly one argument!") end
local node = get_node(query, match, pred[2])
if node and node:parent() then
@ -47,7 +52,7 @@ function M.check_last(query, match, pred)
end
end
function M.check_nth(query, match, pred)
function M.nth(query, match, pred)
if #pred ~= 3 then error("nth? must have exactly two arguments!") end
local node = get_node(query, match, pred[2])
if node and node:parent() then
@ -55,4 +60,20 @@ function M.check_nth(query, match, pred)
end
end
function M.has_ancestor(query, match, pred)
if #pred ~= 3 then error("has-ancestor? must have exactly two arguments!") end
local node = get_node(query, match, pred[2])
local ancestor_type = pred[3]
if not node then return true end
node = node:parent()
while node do
if node:type() == ancestor_type then
return true
end
node = node:parent()
end
return false
end
return M