Search Results for "b-tree implementation"

conflux-rust is the Rust implementation of Conflux, a high-performance Layer 1 blockchain designed to deliver high throughput without compromising decentralization or security. Conflux introduces a Tree-Graph consensus mechanism that allows parallel block processing while maintaining consensus integrity. This implementation focuses on performance and is compatible with the Ethereum Virtual Machine (EVM), enabling developers to deploy smart contracts written for Ethereum. ...

An idiomatic, lean, fast & safe pure Rust implementation of Git. gix is a command-line interface (CLI) to access git repositories. It's written to optimize the user experience and perform as well or better than the canonical implementation. Furthermore, it provides an easy and safe to use API in the form of various small crates for implementing your own tools in a breeze. Please see 'Development Status' for a listing of all crates and their capabilities.

Combine the advantages of a monorepo with those of multirepo setups by leveraging a blazingly-fast, incremental, and reversible implementation of git history filtering. The partial repo will act as a normal git repository but only contain the files found in the subdirectory and only commits affecting those files. The partial repo supports both fetch as well as push operation. This helps not just to improve performance on the client due to having fewer files in the tree, it also enables collaboration on parts of the monorepo with other parties utilizing git's normal distributed development features. ...

Zee is a modern editor for the terminal, in the spirit of Emacs. It is written in Rust and it is somewhat experimental. In the old tradition of text editor demos, here's what it currently looks like editing its own source code.

...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 techniques such as prefix encoding and suffix truncation for reducing the storage costs of long keys with shared prefixes. If keys are the same length and sequential then the system can avoid storing 99%+ of the key data in most cases, essentially acting like a learned index. sled performs prefix encoding on long keys with similar prefixes that are grouped together in a range, as well as suffix truncation to further reduce the indexing costs of long keys.