tree-sitter/spec/runtime
Max Brunsfeld 535879a2bd Represent byte, char and tree counts as 32 bit numbers
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.
2016-11-14 12:19:13 -08:00
..
document_spec.cc Represent byte, char and tree counts as 32 bit numbers 2016-11-14 12:19:13 -08:00
node_spec.cc Fix inconsistencies in nodes sizes after edits 2016-09-19 13:35:08 -07:00
parser_spec.cc Remove logic for recovering from OOM 2016-11-04 09:18:38 -07:00
stack_spec.cc Represent byte, char and tree counts as 32 bit numbers 2016-11-14 12:19:13 -08:00
tree_spec.cc Store shift states for non-terminals directly in the main parse table 2016-11-14 08:36:06 -08:00