The parser spends the majority of its time allocating and freeing trees and stack nodes. Also, the memory footprint of the AST is a significant concern when using tree-sitter with large files. This library is already unlikely to work very well with source files larger than 4GB, so representing rows, columns, byte lengths and child indices as unsigned 32 bit integers seems like the right choice. |
||
|---|---|---|
| .. | ||
| document_spec.cc | ||
| node_spec.cc | ||
| parser_spec.cc | ||
| stack_spec.cc | ||
| tree_spec.cc | ||