did stuff, done stuff

parser/src/stack/stack_funcs1.c

@@ -28,10 +28,10 @@ bool	ts_stack_is_paused(const t_stack *self, t_stack_version version)
 	return (array_get(&self->heads, version)->status == SStatusPaused);
 }
 
-Subtree	ts_stack_resume(t_stack *self, t_stack_version version)
+t_subtree	ts_stack_resume(t_stack *self, t_stack_version version)
 {
 	t_stack_head	*head;
-	Subtree			result;
+	t_subtree			result;
 
 	head = array_get(&self->heads, version);
 	assert(head->status == SStatusPaused);

parser/src/stack/stack_funcs2.c

@@ -51,7 +51,7 @@ bool	ts_stack_has_advanced_since_error(const t_stack *self,
 {
 	const t_stack_head	*head = array_get(&self->heads, version);
 	const t_stack_node	*node = head->node;
-	Subtree				subtree;
+	t_subtree				subtree;
 
 	if (node->error_cost == 0)
 		return (true);

parser/src/stack/stack_funcs3.c

@@ -13,7 +13,7 @@
 #include "parser/stack.h"
 #include "parser/_inner/stack.h"
 
-bool	stack__subtree_is_equivalent(Subtree left, Subtree right)
+bool	stack__subtree_is_equivalent(t_subtree left, t_subtree right)
 {
 	if (left == right)
 		return (true);
@@ -97,7 +97,7 @@ t_stack_version original_version, t_stack_node *node, SubtreeArray *subtrees)
 }
 
 void	ts_stack_set_last_external_token(t_stack *self, t_stack_version version,
-		Subtree token)
+		t_subtree token)
 {
 	t_stack_head	*head;
 

parser/src/stack/stack_funcs4.c

@@ -28,7 +28,7 @@ Length	ts_stack_position(const t_stack *self, t_stack_version version)
 	return (array_get(&self->heads, version)->node->position);
 }
 
-Subtree	ts_stack_last_external_token(const t_stack *self,
+t_subtree	ts_stack_last_external_token(const t_stack *self,
 		t_stack_version version)
 {
 	return (array_get(&self->heads, version)->last_external_token);

parser/src/stack/stack_iter.c

@@ -46,7 +46,7 @@ t_stack_slice_array	stack__iter(t_stack *self, t_stack_version version,
 	{
 		include_subtrees = true;
 		array_reserve(&new_iterator.subtrees,
-			(t_u32)ts_subtree_alloc_size(goal_subtree_count) / sizeof(Subtree));
+			(t_u32)ts_subtree_alloc_size(goal_subtree_count) / sizeof(t_subtree));
 	}
 	array_push(&self->iterators, new_iterator);
 	while (self->iterators.size > 0)

parser/src/stack/stack_manipulate.c

@@ -13,7 +13,7 @@
 #include "parser/_inner/stack.h"
 #include "parser/language.h"
 
-void	ts_stack_push(t_stack *self, t_stack_version version, Subtree subtree,
+void	ts_stack_push(t_stack *self, t_stack_version version, t_subtree subtree,
 		bool pending, TSStateId state)
 {
 	t_stack_head	*head;

parser/src/stack/stack_manipulate2.c

@@ -56,7 +56,7 @@ void	ts_stack_halt(t_stack *self, t_stack_version version)
 }
 
 void	ts_stack_pause(t_stack *self, t_stack_version version,
-		Subtree lookahead)
+		t_subtree lookahead)
 {
 	t_stack_head	*head;
 

parser/src/stack/stack_node.c

@@ -70,7 +70,7 @@ void	stack_node_release(t_stack_node *self)
 // Count intermediate error nodes even though they are not visible,
 // because a stack version's node count is used to check whether it
 // has made any progress since the last time it encountered an error.
-t_u32	stack__subtree_node_count(Subtree subtree)
+t_u32	stack__subtree_node_count(t_subtree subtree)
 {
 	t_u32	count;
 
@@ -83,7 +83,7 @@ t_u32	stack__subtree_node_count(Subtree subtree)
 }
 
 t_stack_node	*stack_node_new(t_stack_node *previous_node,
-		Subtree subtree, bool is_pending, TSStateId state)
+		t_subtree subtree, bool is_pending, TSStateId state)
 {
 	t_stack_node	*node;