Rename node_leaf_at_pos -> node_find_pos
It doesn't always return a leaf node, just the smallest node that spans the given position.
This commit is contained in:
parent
8f4939a3d3
commit
b1a7886225
3 changed files with 7 additions and 7 deletions
|
|
@ -29,7 +29,7 @@ size_t ts_node_size(const TSNode *);
|
|||
TSSymbol ts_node_sym(const TSNode *);
|
||||
TSNode *ts_node_child(TSNode *, size_t);
|
||||
size_t ts_node_child_count(const TSNode *);
|
||||
TSNode *ts_node_leaf_at_pos(TSNode *, size_t);
|
||||
TSNode *ts_node_find_pos(TSNode *, size_t);
|
||||
TSNode *ts_node_parent(TSNode *node);
|
||||
TSNode *ts_node_next_sibling(TSNode *node);
|
||||
TSNode *ts_node_prev_sibling(TSNode *node);
|
||||
|
|
|
|||
|
|
@ -92,10 +92,10 @@ describe("Node", []() {
|
|||
});
|
||||
});
|
||||
|
||||
describe("leaf_at_pos", [&]() {
|
||||
describe("find_pos", [&]() {
|
||||
it("can retrieve the leaf node at a given position", [&]() {
|
||||
TSNode *number1 = ts_node_leaf_at_pos(root, 3);
|
||||
TSNode *number2 = ts_node_leaf_at_pos(root, 7);
|
||||
TSNode *number1 = ts_node_find_pos(root, 3);
|
||||
TSNode *number2 = ts_node_find_pos(root, 7);
|
||||
|
||||
AssertThat(ts_node_name(number1), Equals("number"));
|
||||
AssertThat(ts_node_size(number1), Equals<size_t>(2));
|
||||
|
|
@ -108,7 +108,7 @@ describe("Node", []() {
|
|||
});
|
||||
|
||||
it("returns higher-level nodes when no leaf is at the given position", [&]() {
|
||||
TSNode *node = ts_node_leaf_at_pos(root, 6);
|
||||
TSNode *node = ts_node_find_pos(root, 6);
|
||||
|
||||
AssertThat(ts_node_name(node), Equals("array"));
|
||||
|
||||
|
|
|
|||
|
|
@ -77,7 +77,7 @@ TSNode *ts_node_child(TSNode *parent, size_t index) {
|
|||
parent->names);
|
||||
}
|
||||
|
||||
TSNode *ts_node_leaf_at_pos(TSNode *parent, size_t position) {
|
||||
TSNode *ts_node_find_pos(TSNode *parent, size_t position) {
|
||||
size_t child_count;
|
||||
TSChildWithPosition *children =
|
||||
ts_tree_visible_children(parent->content, &child_count);
|
||||
|
|
@ -89,7 +89,7 @@ TSNode *ts_node_leaf_at_pos(TSNode *parent, size_t position) {
|
|||
if (child_left + child.tree->size > position) {
|
||||
TSNode *node =
|
||||
ts_node_make(child.tree, parent, i, child.position, parent->names);
|
||||
TSNode *result = ts_node_leaf_at_pos(node, position);
|
||||
TSNode *result = ts_node_find_pos(node, position);
|
||||
ts_node_release(node);
|
||||
return result;
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue