Search Results for "avl tree"
Sort By:
Showing 25 open source projects for "avl tree"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
1
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. Bitarray used to detect existence without having... -
2
avldb
Simple struct storage system, database library and engine.
Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct. -
3
CL4fpc
Containers library for fpc
Some generic container library Red-Black tree, AVL tree, Decart tree, Weight-balanced tree - persistent and nonpersistent version HashMaps, FIFO, ResPool and other -
4
treedb
on-disk memory library
treedb can implement malloc functionality, and much more! Need a heap that allocates from a fixed size chunk of memory? No problem. But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Treedb comes with an AVL tree, doubly-linked-list and variable-entry... -
Deliver secure remote access with OpenVPN.OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
-
5
meta-treedb
on-disk memory library using meta-data
meta-treedb can implement malloc functionality, and much more! Need a heap that allocates from a fixed size chunk of memory? No problem. But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list... -
6
A library written in C that provides a sorted list (based on an AVL or Red-Black tree) for sorting large amounts of data without using up all the physical memory. Uses disk if there is more data in the sorted list than there is memory available.
-
7
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all... -
8
Text Analyzer
Text analyzing software
An application developed in C using the list and the AVL tree data structures, which analyzes a text (.txt file) giving the following information as an output: 1. the total occurrences of every word in the text 2. the exact line of every occurrence of every word 3. the exact position in the line of every occurrence of every word 4. the exact paragraph of every occurrence of every word 5. the exact sentence of every occurrence of every word The output is also written in a .txt... -
9
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...
-
Picsart Enterprise Background Removal API for Stunning eCommerce VisualsWith our Remove Background API tool, you can access the transformative capabilities of automation , which will allow you to turn any photo asset into compelling product imagery. With elevated visuals quality on your digital platforms, you can captivate your audience, and therefore achieve higher engagement and sales.
-
10
This application's purpose is to visualize 5 common in computer science, tree data structures as well as visualizing their insertion, deletion, search and traversal operations. Supported trees: AVL, Red-Black, Splay, Treap, AB. Multilingual. Enjoy!
-
11
libssdi
Data structure library
Library to implement popular data structures in C which doesn't need any modification to existing structures. SSDI stands for Store, Search, Delete, Iterate. Data structures which implement these will be added in this. Inspired by the ease in which a list can be created in Perl. Hope to bring such easy programmability using this library. Currently, sorted linked list, binary tree, AVL tree are implemented. Packaging not implemented. -
12
PhoneBookAVL
Phone Book Implemented in an AVL Tree
In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/ -
13
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.
-
14
TmpltLib
template data structure library for C
Singly Linked-list - Doubly Linked-list - Stack - Queue - Deque - Generic Tree - AVL Tree - RB Tree -
15
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
-
16
A binary self-balancing tree which implements the features of an AVL tree where each operations (add, remove, search) cost O(log(n)) It uses Java Generics in order to manage any kind of java objects associated to a comparable unique key.
-
17
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.
-
18
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++).
-
19
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.
-
20
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.
-
21
A library for c++ applications, implementing a framework for building trees of various types (Common Binary, AVL, etc.). Data Structure, Tree Navigator and Node Processing are separate to provide flexibility as well as speed
-
22
GCS - General Computing Solutions. C library with Hash Tables, Binary AVL Tree, Memory Chunks, Single Linked Lists, Double Linked Lists, Memory Chunk Queue, Base64, Misc.
-
23
.Net Generic Data Structures Provides parametric polymorphic data structores (the first is an AVL Binary tree, always balanced), for the .Net framework.
-
24
A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.
-
25
- Previous
- You're on page 1
- Next
