mirrors/neovim
1
0
Fork 0
mirror of https://github.com/neovim/neovim.git synced 2025-10-01 23:48:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(treesitter): add next, prev sibling method

Browse Source 
Add tsnode methods to change to the next, previous, named or unnamed
nodes.
This commit is contained in:
Dylan Kendal
2021-08-20 01:35:25 -04:00
parent 2ae9ff1285
commit 140084180e
3 changed files with 122 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
src/nvim/lua/treesitter.c
View File

@@ -80,6 +80,10 @@ static struct luaL_Reg node_meta[] = {
{ "parent", node_parent },
{ "iter_children", node_iter_children },
{ "_rawquery", node_rawquery },
{ "next_sibling", node_next_sibling },
{ "prev_sibling", node_prev_sibling },
{ "next_named_sibling", node_next_named_sibling },
{ "prev_named_sibling", node_prev_named_sibling },
{ NULL, NULL }
};
@@ -992,6 +996,50 @@ static int node_parent(lua_State *L)
return 1;
}
static int node_next_sibling(lua_State *L)
{
TSNode node;
if (!node_check(L, 1, &node)) {
return 0;
}
TSNode sibling = ts_node_next_sibling(node);
push_node(L, sibling, 1);
return 1;
}
static int node_prev_sibling(lua_State *L)
{
TSNode node;
if (!node_check(L, 1, &node)) {
return 0;
}
TSNode sibling = ts_node_prev_sibling(node);
push_node(L, sibling, 1);
return 1;
}
static int node_next_named_sibling(lua_State *L)
{
TSNode node;
if (!node_check(L, 1, &node)) {
return 0;
}
TSNode sibling = ts_node_next_named_sibling(node);
push_node(L, sibling, 1);
return 1;
}
static int node_prev_named_sibling(lua_State *L)
{
TSNode node;
if (!node_check(L, 1, &node)) {
return 0;
}
TSNode sibling = ts_node_prev_named_sibling(node);
push_node(L, sibling, 1);
return 1;
}
/// assumes the match table being on top of the stack
static void set_match(lua_State *L, TSQueryMatch *match, int nodeidx)
{