raphael/minishell
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

did stuff, done stuff

Browse source
This commit is contained in:
Maieul BOYER 2024-08-31 18:48:20 +00:00
parent 4a8fb259dc
commit 62a4f377a1
37 changed files with 325 additions and 399 deletions
Download patch file Download diff file Expand all files Collapse all files

4
parser/src/node/node_child.c
View file

@ -14,7 +14,7 @@
t_u32 ts_node_child_count(TSNode self)
{
Subtree tree;
t_subtree tree;
tree = ts_node__subtree(self);
if (ts_subtree_child_count(tree) > 0)
@ -25,7 +25,7 @@ t_u32 ts_node_child_count(TSNode self)
t_u32 ts_node_named_child_count(TSNode self)
{
Subtree tree;
t_subtree tree;
tree = ts_node__subtree(self);
if (ts_subtree_child_count(tree) > 0)

2
parser/src/node/node_constructor.c
View file

@ -14,7 +14,7 @@
#include "parser/length.h"
#include "parser/subtree.h"
TSNode ts_node_new(const TSTree *tree, const Subtree *subtree, \
TSNode ts_node_new(const TSTree *tree, const t_subtree *subtree, \
Length position, TSSymbol alias)
{
return ((TSNode){

4
parser/src/node/node_getter_funcs2.c
View file

@ -34,7 +34,7 @@ t_u32 ts_node__alias(const TSNode *self)
return (self->alias);
}
Subtree ts_node__subtree(TSNode self)
t_subtree ts_node__subtree(TSNode self)
{
return (*(const Subtree *)self.id);
return (*(const t_subtree *)self.id);
}

4
parser/src/node/node_iterator.c
View file

@ -16,7 +16,7 @@
NodeChildIterator ts_node_iterate_children(const TSNode *node)
{
Subtree subtree;
t_subtree subtree;
const TSSymbol *alias_sequence;
subtree = ts_node__subtree(*node);
@ -42,7 +42,7 @@ bool ts_node_child_iterator_done(NodeChildIterator *self)
bool ts_node_child_iterator_next(NodeChildIterator *self, TSNode *result)
{
const Subtree *child;
const t_subtree *child;
TSSymbol alias_symbol;
if (!self->parent || ts_node_child_iterator_done(self))

4
parser/src/node/node_relevent.c
View file

@ -17,7 +17,7 @@
bool ts_node__is_relevant(TSNode self, bool include_anonymous)
{
TSSymbol alias;
Subtree tree;
t_subtree tree;
tree = ts_node__subtree(self);
if (include_anonymous)
@ -31,7 +31,7 @@ bool ts_node__is_relevant(TSNode self, bool include_anonymous)
t_u32 ts_node__relevant_child_count(TSNode self, bool include_anonymous)
{
Subtree tree;
t_subtree tree;
tree = ts_node__subtree(self);
if (ts_subtree_child_count(tree) > 0)