Search Results for "b-tree"

L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/

...It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net

bincmp is intended as a cross-platform, tiny and fast binary comparer of two files. it is much faster than "fc /b", for example. bincmp2 is more powerful, but currently windows-only.

The repository have a library to each common data structures algorithms like Doubly linked list, Generic trees, Queue, Stack... Each lib have a option to carry your custom data in elements, other cool resources.

...The stack, the tree and the hash table accept int, float and char* data type To look at the python library : https://github.com/mnoorfawi/struct-pie

B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.

Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;

BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).

...And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers.

the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.

Klib is a small fast lightweighted library that provides a generic hash table, a generic B-tree and generic sorting algorithms for C programmers.

A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

This small C package is made of an independent AVL tree library, and of an extension module for Python that builds upon it to provide objects of type 'avl_tree' in Python, which can behave as sorted containers or sequential lists.

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.

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.

This project provides IEEE 802.1d Rapid Spanning Tree Protocol (RSTP) in Linux Kernel. The project is based on the existing ethernet bridging functionality in Linux Kernel.

The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion