Search Results for "b-tree implementation"
Sort By:
Showing 12 open source projects for "b-tree implementation"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
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
SWIG
A code generator for connecting C/C++ with other programming languages
...SWIG can also export its parse tree in the form of XML. -
3
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... -
4
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.
-
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
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. -
6
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 -
7
Prefix Tree
A lighting-fast prefix tree and DAWG implementation in C and python
A lighting-fast prefix tree (trie) and compressed prefix tree (DAWG) implementation. This library can be usefull for longest-prefix matching, code completion, dictionary compression, spell checking. -
8
The ordered_tree class template is an implementation in C++ of the ordered tree data structure. It implements breadth, depth search, as well as child and leaf iterators. A single header file is needed to use the code.
-
9
This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).
-
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
10
This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.
-
11
a C++ template container implementation of k-dimensional space sorting based on the kd-tree data structure. THIS PROJECT HAS MOVED TO ALIOTH.DEBIAN.ORG
-
12
Adaptations From the Avalon/JXTA World<br> a) James-JXTA (p2p email system) <br> b) IM on JXTA (Jabber)<br> c) JXTA Implementation on Avalon Framework <br>
- Previous
- You're on page 1
- Next
