aboutsummaryrefslogtreecommitdiffstats
path: root/src
diff options
context:
space:
mode:
authorStefan Kangas2022-11-21 15:39:43 +0100
committerStefan Kangas2022-11-22 02:24:20 +0100
commit40539c7587dc474b424cff732973fe8958eadf14 (patch)
treec98fb6254b98c1a2c8738edaf8141569ece244ad /src
parentaeadba1418d8fc18f17b4ae415cde35e9e272e7a (diff)
downloademacs-40539c7587dc474b424cff732973fe8958eadf14.tar.gz
emacs-40539c7587dc474b424cff732973fe8958eadf14.zip
; Fix typos
Diffstat (limited to 'src')
-rw-r--r--src/treesit.c10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/treesit.c b/src/treesit.c
index 91c26374b3c..463e2458a63 100644
--- a/src/treesit.c
+++ b/src/treesit.c
@@ -295,7 +295,7 @@ init_treesit_functions (void)
295 a node. But since we can just retrieve a new node, it shouldn't 295 a node. But since we can just retrieve a new node, it shouldn't
296 be a limitation. 296 be a limitation.
297 297
298 - I didn't expose setting timeout and cancellation flag for a 298 - I didn't expose setting timeout and cancelation flag for a
299 parser, mainly because I don't think they are really necessary 299 parser, mainly because I don't think they are really necessary
300 in Emacs's use cases. 300 in Emacs's use cases.
301 301
@@ -891,7 +891,7 @@ treesit_ensure_parsed (Lisp_Object parser)
891 when 1) language is not set (impossible in Emacs because the user 891 when 1) language is not set (impossible in Emacs because the user
892 has to supply a language to create a parser), 2) parse canceled 892 has to supply a language to create a parser), 2) parse canceled
893 due to timeout (impossible because we don't set a timeout), 3) 893 due to timeout (impossible because we don't set a timeout), 3)
894 parse canceled due to cancellation flag (impossible because we 894 parse canceled due to cancelation flag (impossible because we
895 don't set the flag). (See comments for ts_parser_parse in 895 don't set the flag). (See comments for ts_parser_parse in
896 tree_sitter/api.h.) */ 896 tree_sitter/api.h.) */
897 if (new_tree == NULL) 897 if (new_tree == NULL)
@@ -1079,7 +1079,7 @@ treesit_compose_query_signal_data (uint32_t error_offset,
1079 1079
1080/* Ensure the QUERY is compiled. Return the TSQuery. It could be 1080/* Ensure the QUERY is compiled. Return the TSQuery. It could be
1081 NULL if error occurs, in which case ERROR_OFFSET and ERROR_TYPE are 1081 NULL if error occurs, in which case ERROR_OFFSET and ERROR_TYPE are
1082 bound. If error occures, return NULL, and assign SIGNAL_SYMBOL and 1082 bound. If error occurs, return NULL, and assign SIGNAL_SYMBOL and
1083 SIGNAL_DATA accordingly. */ 1083 SIGNAL_DATA accordingly. */
1084static TSQuery * 1084static TSQuery *
1085treesit_ensure_query_compiled (Lisp_Object query, Lisp_Object *signal_symbol, 1085treesit_ensure_query_compiled (Lisp_Object query, Lisp_Object *signal_symbol,
@@ -1366,7 +1366,7 @@ treesit_check_range_argument (Lisp_Object ranges)
1366} 1366}
1367 1367
1368/* Generate a list of ranges in Lisp from RANGES. This function 1368/* Generate a list of ranges in Lisp from RANGES. This function
1369 doens't take ownership of RANGES. BUFFER is used to convert 1369 doesn't take ownership of RANGES. BUFFER is used to convert
1370 between tree-sitter buffer offset and buffer position. */ 1370 between tree-sitter buffer offset and buffer position. */
1371static Lisp_Object 1371static Lisp_Object
1372treesit_make_ranges (const TSRange *ranges, uint32_t len, 1372treesit_make_ranges (const TSRange *ranges, uint32_t len,
@@ -2538,7 +2538,7 @@ treesit_traverse_sibling_helper (TSNode node, bool forward, bool named)
2538 } 2538 }
2539} 2539}
2540 2540
2541/* Return the first/last named/unamed child of NODE. FORWARD controls 2541/* Return the first/last named/unnamed child of NODE. FORWARD controls
2542 the direction and NAMED controls the nameness. */ 2542 the direction and NAMED controls the nameness. */
2543static TSNode 2543static TSNode
2544treesit_traverse_child_helper (TSNode node, bool forward, bool named) 2544treesit_traverse_child_helper (TSNode node, bool forward, bool named)