tree-sitter/lib
Max Brunsfeld 1fe0420f0f Avoid unnecessary stack entries in query analysis
When descending into a hidden child rule, the current stack entry
can be reused if it is currently at the end of its rule.

This fixes a test failure when analyzing a Ruby query. The
failure was introduced due to some changes to the Ruby grammar.
This optimization allows us to impose a _smaller_ limit on
the stack size, which should make query analysis faster and
more memory-efficient.
2021-11-19 11:04:36 -08:00
..
binding_rust Restructure test suite's allocation recording so that tests can run in parallel 2021-10-11 17:24:37 -07:00
binding_web fix(wasm): Fix predicates in alternations, resolves #1392 2021-09-21 21:13:41 +03:00
include/tree_sitter Tweak comment formatting in api.h so bindgen doesn't create a doctest 2021-10-11 17:23:44 -07:00
src Avoid unnecessary stack entries in query analysis 2021-11-19 11:04:36 -08:00
.ccls rust: Change QueryCursor::captures to expose the full match 2019-10-03 12:45:58 -07:00
Cargo.toml libs: 0.20.0 2021-06-29 17:18:22 -07:00
README.md lib: remove utf8proc dependency (#436) 2019-10-14 11:18:39 -07:00

Subdirectories

  • src - C source code for the Tree-sitter library
  • include - C headers for the Tree-sitter library
  • binding_rust - Rust bindings to the Tree-sitter library
  • binding_web - JavaScript bindings to the Tree-sitter library, using WebAssembly