This function (and the similar `ts_tree_cursor_goto_first_child_for_byte`) allows you to efficiently seek the tree cursor to a given position, exploiting the tree's internal balancing, without having to visit all of the preceding siblings of each node. |
||
|---|---|---|
| .. | ||
| api.h | ||
| parser.h | ||