Search Results for "b-tree implementation"
Sort By:
Showing 153 open source projects for "b-tree implementation"
View related business solutions-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Tree
tree is a library for working with nested data structures
Tree (dm-tree) is a lightweight Python library developed by Google DeepMind for manipulating nested data structures (also called pytrees). It generalizes Python’s built-in map function to operate over arbitrarily nested collections — including lists, tuples, dicts, and custom container types — while preserving their structure. This makes it particularly useful in machine learning pipelines and JAX-based workflows, where complex parameter trees or hierarchical state representations are... -
2
conflux-rust
The official Rust implementation of Conflux protocol
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. ... -
3
WireGuard Linux
Linux kernel implementation of the WireGuard VPN protocol
WireGuard Linux is the Linux kernel implementation of the WireGuard VPN protocol, providing high-performance encrypted networking directly within the Linux networking stack. The repository serves as a mirror of the official development tree and contains the kernel-side code that enables native WireGuard support on Linux systems. By operating inside the kernel rather than user space, the project achieves very low latency and high throughput, making it suitable for servers, embedded systems, and enterprise networking environments. ... -
4
Datahike
A durable Datalog implementation adaptable for distribution
Datahike is a durable Datalog database powered by an efficient Datalog query engine. This project started as a port of DataScript to the hitchhiker-tree. All DataScript tests are passing, but we are still working on the internals. Having said this we consider Datahike usable for medium sized projects, since DataScript is very mature and deployed in many applications and the hitchhiker-tree implementation is heavily tested through generative testing. We are building on the two projects and the storage backends for the hitchhiker-tree through konserve. ... -
One Monitoring Tool for IT, OT and Cloud | Free TrialModern infrastructure spans data centers, cloud platforms and factory floors, and every blind spot between them is a risk. PRTG supports SNMP, WMI, SSH and other standard protocols to monitor IT, OT and hybrid environments through one customizable dashboard. Build the views your team needs, from network health to application performance, without switching tools. Try PRTG free for 30 days now.
-
5
Mctx
Monte Carlo tree search in JAX
mctx is a Monte Carlo Tree Search (MCTS) library developed by Google DeepMind for reinforcement learning research. It enables efficient and flexible implementation of MCTS algorithms, including those used in AlphaZero and MuZero. -
6
Python JSONPath Next-Generation
JSONPath implementation for Python that aims to be standard compliant
A final implementation of JSONPath for Python that aims to be standard compliant, including arithmetic and binary comparison operators, as defined in the original JSONPath proposal. This package merges both jsonpath-rw and jsonpath-rw-ext and provides several AST API enhancements, such as the ability to update or remove nodes in the tree. This library provides a robust and significantly extended implementation of JSONPath for Python. -
7
VimBindings.jl
Vim bindings for the Julia REPL
Vim bindings for the Julia REPL. VimBindings.jl is a Julia package which brings vim emulation directly to the Julia REPL. -
8
BTree implementation for Go
BTree provides a simple, ordered, in-memory data structure for Go
This package is a high-performance, in-memory B-tree for Go that implements an ordered set/map with efficient insert, delete, and range iteration. It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. -
9
EthereumJS Monorepo
Monorepo for the Ethereum VM TypeScript Implementation
This repository holds various protocol building blocks of the Ethereum blockchain execution layer and is managed by the Ethereum Foundation JavaScript team. There is a TypeScript implementation of the Ethereum Virtual Machine (EVM) ready to be used in Node.js or a browser environment, implementations of core structural blockchain building blocks like an Ethereum Tx, Block or Blockchain as well as a Trie (Merkle Patricia Tree) and devp2p (execution networking layer) implementation. All libraries are bound together by the core Common library keeping track of chain specifics and hardfork changes. ... -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
gRPC Elixir
An Elixir implementation of gRPC
The Gun library doesn't have a full 2.0 release yet, so we depend on :grcp_gun 2.0.1 for now. This is the same as :gun 2.0.0-rc.2, but Hex doesn't let us depend on RC versions for releases. Generate Elixir code from the proto file as protobuf-elixir shows(especially the gRPC Support section). Implement the server-side code and remember to return the expected message types. You can start the gRPC server as a supervised process. First, add GRPC.Server.Supervisor to your supervision tree. -
11
Algorithms
Solutions for some common algorithm problems written in Java
Algorithms is an educational Java repository containing tested solutions to common computer science and programming problems. It covers binary trees, linked lists, strings, bit operations, mathematics, sequences, arrays, sorting, and miscellaneous interview-style exercises. Many categories contain several related problems so learners can compare recurring techniques and data structures. Some problems include more than one implementation, allowing different approaches to be examined side by... -
12
Happy DOM
Happy DOM is a JavaScript implementation of a web browser
Happy DOM is a JavaScript implementation of a web browser without its graphical user interface. It includes many web standards from WHATWG DOM and HTML. The goal of Happy DOM is to emulate enough of a web browser to be useful for testing, scraping web sites, and server-side rendering. Happy DOM focuses heavily on performance and can be used as an alternative to JSDOM. Happy DOM now supports Declarative Shadow DOM which can be used for server-side rendering of web components. This package... -
13
CycleGAN and pix2pix in PyTorch
Image-to-Image Translation in PyTorch
CycleGAN and pix2pix in PyTorch repository is a PyTorch implementation of two influential image-to-image translation frameworks: CycleGAN (for unpaired translation) and pix2pix (for paired translation). This repo gives developers and researchers a convenient, modern (PyTorch-based) platform to train and test these methods — supporting both paired datasets (input to output) and unpaired datasets (domain-to-domain) with minimal changes. The code supports standard training and inference... -
14
MegaTTS 3
Official PyTorch Implementation
MegaTTS3 is an open-source text-to-speech (TTS) and voice-cloning system from ByteDance that aims to deliver high-quality, expressive speech synthesis, including zero-shot voice cloning of previously unseen speakers. Its backbone is a lightweight diffusion-transformer (on the order of ~0.45 B parameters), which enables efficient inference while still producing high-fidelity audio. Given a reference audio sample (and corresponding latent representation), MegaTTS3 can generate speech in the... -
15
HCubature.jl
Pure-Julia multidimensional h-adaptive integration
The HCubature module is a pure-Julia implementation of multidimensional "h-adaptive" integration. then hcubature(f, a, b) computes the integral, adaptively subdividing the integration volume into smaller and smaller pieces until convergence is achieved to the desired tolerance (specified by optional rtol and atol keyword arguments. Because hcubature is written purely in Julia, the integrand f(x) can return any vector-like object (technically, any type supporting +, -, * real, and norm: a Banach space). ... -
16
mistletoe
A fast, extensible and spec-compliant Markdown parser in pure Python
mistletoe is a Markdown parser in pure Python, designed to be fast, spec-compliant and fully customizable. Apart from being the fastest CommonMark-compliant Markdown parser implementation in pure Python, mistletoe also supports easy definitions of custom tokens. Parsing Markdown into an abstract syntax tree also allows us to swap out renderers for different output formats, without touching any of the core components. -
17
gitoxide
An idiomatic, lean, fast & safe pure Rust implementation of Git
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. -
18
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
19
AIDE ML
AI-Driven Exploration in the Space of Code
AIDE ML is an open-source research framework designed to explore automated machine learning development through agent-based search and code optimization. The project implements the AIDE algorithm, which uses a tree-search strategy guided by large language models to iteratively generate, evaluate, and refine code. Instead of relying on manual experimentation, the agent autonomously drafts machine learning pipelines, debugs errors, and benchmarks performance against user-defined evaluation metrics. The system repeatedly improves its generated code by exploring different implementation paths and selecting the best-performing solutions. ... -
20
ts-blank-space
A small, fast, pure JavaScript type-stripper
...It is not a type checker and does not perform any other code transformations. The underlying technique can improve build performance and simplify development. The implementation is pure TypeScript. It is simple enough to read and understand in a few minutes because it is only 700 lines of code and reuses the original TypeScript parser. The core idea is to use spaces as a substitute for type annotations. You can think of ts-blank-space as a reference implementation of this type-stripping technique. Much like other compiler techniques seen in the JavaScript ecosystem, such as tree-shaking, it is a reusable idea that any TypeScript compiler could implement. -
21
R Source
Read-only mirror of R source code
...The repository includes build instructions, the full directory structure (src, src/library, doc, etc.), licensing information (GPL-2.0), and documentation. Developers, package authors, and curious users often browse this mirror to inspect implementation details, debug issues, or see how base functions are implemented in C or Fortran. -
22
TensorFlow Serving
Serving system for machine learning models
TensorFlow Serving is a flexible, high-performance serving system for machine learning models, designed for production environments. It deals with the inference aspect of machine learning, taking models after training and managing their lifetimes, providing clients with versioned access via a high-performance, reference-counted lookup table. TensorFlow Serving provides out-of-the-box integration with TensorFlow models, but can be easily extended to serve other types of models and data. The... -
23
Helidon
Java libraries for writing microservices
...Since Helidon is simply a collection of Java libraries running on a fast Netty core, there is no extra overhead or bloat. Helidon supports MicroProfile and provides familiar APIs like JAX-RS, CDI and JSON-P/B. Our implementation runs on our fast Helidon Reactive WebServer. Helidon Reactive WebServer provides a modern functional programming model and runs on top of Netty. Lightweight, flexible and reactive, the Helidon WebServer provides a simple-to-use and fast foundation for your microservices. -
24
memfs
Node.js "fs" and browser "File System API" adapters
memfs is a JavaScript/TypeScript library that implements in-memory versions of the Node.js fs module API and the browser File System Access API. It provides adapters to convert between the Node fs API and the browser File System API, and includes utilities like printing directory trees, creating directory snapshots, and demos such as in-browser Git using an in-memory file system. This is particularly useful for testing, mocking filesystem operations, or using a file system layer inside... -
25
RAPTOR
The official implementation of RAPTOR
RAPTOR is a retrieval architecture designed to improve retrieval-augmented generation systems by organizing documents into hierarchical structures that enable more effective context retrieval. Traditional RAG systems typically retrieve small text chunks independently, which can limit a model’s ability to understand broader document context. RAPTOR addresses this limitation by recursively embedding, clustering, and summarizing documents to create a tree-structured hierarchy of information....
