traxys/tree-sitter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Remove unnecessary accessor functions for tree

Browse source
This commit is contained in:
Max Brunsfeld 2014-07-14 21:11:15 -07:00
parent 6e551d6d9f
commit 25f927e321
9 changed files with 41 additions and 55 deletions
Download patch file Download diff file Expand all files Collapse all files

48
src/runtime/tree.c
View file

@ -29,10 +29,10 @@ TSTree * ts_tree_make_node(TSSymbol symbol, size_t child_count, size_t immediate
TSTree *child = immediate_children[i];
ts_tree_retain(child);
if (i == 0) {
offset = ts_tree_offset(child);
size = ts_tree_size(child);
offset = child->offset;
size = child->size;
} else {
size += ts_tree_offset(child) + ts_tree_size(child);
size += child->offset + child->size;
}
}
TSTree *result = ts_tree_make(symbol, size, offset);
@ -50,35 +50,10 @@ TSTree * ts_tree_make_error(char lookahead_char, size_t expected_input_count, co
return result;
}
TSSymbol ts_tree_symbol(const TSTree *tree) {
return tree->symbol;
}
void ts_tree_retain(TSTree *tree) {
tree->ref_count++;
}
size_t ts_tree_offset(const TSTree *tree) {
return tree->offset;
}
size_t ts_tree_size(const TSTree *tree) {
return tree->size;
}
size_t ts_tree_total_size(const TSTree *tree) {
return ts_tree_offset(tree) + ts_tree_size(tree);
}
TSTree ** ts_tree_immediate_children(const TSTree *tree, size_t *count) {
if (!tree || tree->symbol == ts_builtin_sym_error) {
if (count) *count = 0;
return NULL;
}
if (count) *count = tree->data.children.immediate_count;
return tree->data.children.contents + tree->data.children.count;
}
void ts_tree_release(TSTree *tree) {
tree->ref_count--;
if (tree->ref_count == 0) {
@ -91,6 +66,19 @@ void ts_tree_release(TSTree *tree) {
}
}
size_t ts_tree_total_size(const TSTree *tree) {
return tree->offset + tree->size;
}
TSTree ** ts_tree_immediate_children(const TSTree *tree, size_t *count) {
if (!tree || tree->symbol == ts_builtin_sym_error) {
if (count) *count = 0;
return NULL;
}
if (count) *count = tree->data.children.immediate_count;
return tree->data.children.contents + tree->data.children.count;
}
int ts_tree_equals(const TSTree *node1, const TSTree *node2) {
if (node1->symbol != node2->symbol) return 0;
if (node1->symbol == ts_builtin_sym_error) {
@ -156,7 +144,3 @@ char * ts_tree_string(const TSTree *tree, const char **symbol_names) {
tree_write_to_string(tree, symbol_names, result, size);
return result;
}
char * ts_tree_error_string(const TSTree *tree, const char **symbol_names) {
return NULL;
}