Search Results for "call tree generator"

Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited. General enough to parse any programming language. Fast enough to parse on every keystroke in a text editor. Robust enough to provide useful results even in the presence of syntax errors. Dependency-free so that the runtime library (which is written in pure C) can be embedded in any application. All...

Unlike traditional LSM-tree storage engines, SlateDB writes data to object storage to provide bottomless storage capacity, high durability, and easy replication. SlateDB is an embedded storage engine built as a log-structured merge-tree. Unlike traditional LSM-tree storage engines, SlateDB writes data to object storage (S3, GCS, ABS, MinIO, Tigris, and so on). Leveraging object storage allows SlateDB to provide bottomless storage capacity, high durability, and easy replication. The trade-off...

Serializable (ACID) transactions for atomically reading and writing to multiple keys in multiple keyspaces. Fully atomic single-key operations, including compare and swap. Forward and reverse iterators over ranges of items. A crash-safe monotonic ID generator capable of generating 75-125 million unique ID's per second. Zstd compression (use the compression build feature, disabled by default). Cpu-scalable lock-free implementation. Flash-optimized log-structured storage. Uses modern b-tree...