Search Results for "b-tree implementation"
Sort By:
57 projects for "b-tree implementation" with 1 filter applied:
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
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
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. -
2
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.... -
3
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. -
4
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. ... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
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. -
6
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... -
7
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. -
8
SWIG
A code generator for connecting C/C++ with other programming languages
...SWIG can also export its parse tree in the form of XML. -
9
Tokenized Text Aligner
Aligns tokens in two versions of a text with differing tokenization.
...It is intended for use in the preparation of annotated linguistic corpora, where differences in tokenization may arise (i) following corrections or modifications to the source text or (ii) through the creation of different layers of annotation (part-of-speech, treebank) requiring different tokenization. In its default implementation, it produces a human-readable CSV table associating tokens in text A with tokens in text B, and can also inject token-level annotation from text B to text A. The Aligner class on which the default implementation is based can be incorporated into more complex workflows. -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
SAGA - System for Automated Geoscientific Analyses - is a Geographic Information System (GIS) software with immense capabilities for geodata processing and analysis. SAGA is programmed in the object oriented C++ language and supports the implementation of new functions with a very effective Application Programming Interface (API). Functions are organised as modules in framework independent Module Libraries and can be accessed via SAGA’s Graphical User Interface (GUI) or various scripting environments (shell scripts, Python, R, ...). Please provide the following reference in your work if you are using SAGA: Conrad, O., Bechtel, B., Bock, M., Dietrich, H., Fischer, E., Gerlitz, L., Wehberg, J., Wichmann, V., and Boehner, J. (2015): System for Automated Geoscientific Analyses (SAGA) v. 2.1.4. ...
-
11
Simple components for Ada
A software components library
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix... -
12
GnuCOBOL
A free COBOL compiler
GnuCOBOL (formerly OpenCOBOL) is a free, modern COBOL compiler. GnuCOBOL implements a substantial part of the COBOL 85, X/Open COBOL and newer ISO COBOL standards (2002, 2014, 2023), as well as many extensions included in other COBOL compilers (IBM COBOL, MicroFocus COBOL, ACUCOBOL-GT and others). GnuCOBOL translates COBOL into C and internally compiles the translated code using a native C compiler. Build COBOL programs on various platforms, including GNU/Linux, Unix, Mac OS X, and... -
13
Graph of Thoughts
Official Implementation of "Graph of Thoughts
Graph of Thoughts is an open-source framework that implements a novel reasoning paradigm for large language models by organizing reasoning steps as a structured graph instead of a simple linear chain. Traditional reasoning methods such as chain-of-thought generate sequential reasoning steps, but Graph of Thoughts introduces a more flexible structure where multiple reasoning paths can be explored and evaluated simultaneously. In this framework, problems are modeled as a graph of operations... -
14
GenForm
Generation of molecular formulas by high-resolution MS and MS/MS data
This is an open source implementation of molecular formula calculation by high resolution MS and MS/MS data as described in M. Meringer, S. Reinker, J. Zhang, A. Muller: MS/MS Data Improves Automated Determination of Molecular Formulas by Mass Spectrometry. MATCH Commun. Math. Comput. Chem. 65, 259-290, 2011. The software user manual is available here: https://www.researchgate.net/publication/307964728_MOLGEN-MSMS_Software_User_Manual Example MS and MS/MS data files for GenForm can be downloaded here: https://sourceforge.net/p/genform/code/HEAD/tree/trunk/data/ A first program call could look like this: GenForm ms=SinapinicAcidMs.txt msms=SinapinicAcidMsMs.txt exist out -
15
flutter_ume
UME is an in-app debug kits platform for Flutter
flutter_ume is an in-app debug-kit platform for Flutter applications, developed by ByteDance’s Flutter Infra team. It lets developers embed a suite of debugging tools directly into a Flutter app (during development or debug builds), enabling inspection, performance monitoring, UI debugging, network request inspection, widget hierarchy introspection, and more — all from within the running app. UME bundles multiple “plugin kits” (e.g., UI inspector, performance monitor, device info panel,... -
16
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
17
Wheefun Computer Prototyping Kit
A Toolkit for Designing Computers
This package is designed for people who are a) interested in writing emulators or b) integrating this level of detain into their applications (e.g., a video game). The ability to do this is useful because a) it allows for tinkering far before physical implementation of the design is. In addition to a strong core, WFCPK will also include modules emulating various processors (e.g., the MOS 6502 and the Zilog Z80) as well as the Video-Audio Interface (a custom VGA-compatible display and audio controller). ... -
18
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
19
Spatial C++ Library
Library of generic, k-d tree multi-dimensional containers
Spatial is a generic header-only C++ library providing multi-dimensional in-memory containers, iterators and functionals. Spatial is a general purpose library with good overall performance thanks to its self-balancing k-d tree containers. Spatial makes it easy to search for nearest neighbors, orthogonal ranges, or perform ordering of objects in any number of dimensions. Spatial's design borrows heavily from the STL, and strives to follow it's elegant interface; therefore Spatial's... -
20
Arbaro is an implementation of the tree generating algorithm described in Jason Weber & Joseph Penn: Creation and Rendering of Realistic Trees
-
21
igafem
Open source 3D Matlab Isogeometric Analysis Code
Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa. The benefits of such an approach are evident, since the time taken from design to analysis is greatly reduced leading to large savings in cost and time for industry. The tight coupling of CAD and analysis within IGA requires knowledge from both fields and it is one of the goals of the... -
22
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
23
Parallel_Algorithms
list of parallel Algorithms developed in Parallel Algo course
These are the implementation of various parallel algorithms like Symmemtric division for sum and maximum, Optimal sum using parallel algorithms, List ranking, Tree contraction, Matrix vector multiplication, Counting the number of vowels, consonants, digits, Matrix transpose, Block based matrix multiplication, the project folder has 4 implemenations of Matrix Multiplication algorithms, one simple muliplication, Transpose based multiplication, Strip based matrix mulitiplication -
24
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. -
25
XmlPlus xsd2cpp : C++ XML Data Binding
c++ xml data binding tool (free - lgpl)
Provides XML Data Binding for C++ through XML Schema. Features: a) xsd2cpp - generates C++ XML Objects(X/O mapping) b) XML I/O ie. marshalling-unmarshalling(serialization-deserialization) c) roundtrip retains processing instructions and comments
