summaryrefslogtreecommitdiffstatshomepage
path: root/test/functional/treesitter/node_spec.lua
AgeCommit message (Expand)AuthorFiles
2025-09-24test: remove a few more redundant clear() calls (#35903)zeertzjq1
2025-07-02test(treesitter): test tree:root() is idempotentRodrigodd1
2025-06-06test(treesitter): test node access after tree editRodrigodd1
2025-02-26feat(lua): vim.text.indent()Justin M. Keyes1
2025-02-21fix(treesitter): `TSNode:field()` returns all children with the given fieldRiley Bruins1
2025-01-27build(deps)!: bump tree-sitter to HEAD, wasmtime to v29.0.1 (#32200)Christian Clason1
2025-01-12feat(treesitter)!: don't parse tree in get_parser() or start()Riley Bruins1
2024-10-11feat(treesitter): introduce child_with_descendant()Riley Bruins1
2024-09-21test: support upvalues in exec_luaLewis Russell1
2024-08-02test: allow exec_lua to handle functionsLewis Russell1
2024-07-29feat(treesitter): allow get_node to return anonymous nodesRiley Bruins1
2024-05-16perf(treesitter): use child_containing_descendant() in has-ancestor? (#28512)vanaigr1
2024-04-23test: improve test conventionsdundargoc1
2024-04-10refactor(test): inject after_each differentlyLewis Russell1
2024-04-08test: improve test conventionsdundargoc1
2024-03-09feat!: remove deprecated functionsdundargoc1
2024-01-03refactor: format test/*Justin M. Keyes1
2023-12-04fix(treesitter): allow passing lang to vim.treesitter.get_node() now correctl...Jongwook Choi1
2023-08-29fix(treesitter): fix another TSNode:tree() double freebfredl1
2023-08-29fix(treesitter): fix TSNode:tree() double free (#24796)nwounkn1
2023-03-24feat(treesitter)!: deprecate top level indexes to modules (#22761)Lewis Russell1
2022-09-06ci(tests): don't skip parsers on functionaltestChristian Clason1
2022-08-25feat(treesitter): upstream node_length() as a node methodQuentin Rasmont1
2022-08-25feat(treesitter): upstream get_root_for_node() as a node methodQuentin Rasmont1
2022-08-25feat(treesitter): upstream get_named_children() as a node methodQuentin Rasmont1
2021-08-20feat(treesitter): add next, prev sibling methodDylan Kendal1