Search Results for "avl"
Sort By:
Showing 37 open source projects for "avl"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$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.
-
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 to... -
2
ALEPH-w
Data structures and Algorithms library
Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. ... -
3
Traccar (GPS tracking system)
Open source system for GPS tracking devices
Open source server for GPS trackers. It includes support for popular devices: TK101, TK102, TK103, TK201, TK202, TK203, TK206, GPS-103, GL100, GL200, AVL-05, AVL-08, Mini MT, GT30i, GT60, VT300, VT310, VT400, PST-AVL01, PT60, PT300X, PT30, MVT340, MVT380, MVT600, GT30, GT30X, MT80, GT200, GT300, GT500, Datamax, ST210, ST900, ST910 and many others. Application includes embedded web server to track devices on map. Official web page: https://www.traccar.org/ Demo: https://www.traccar.org/demo-server/ Source code repository: https://github.com/tananaev/traccar Issues tracker: https://github.com/tananaev/traccar/issues -
4
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. -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
5
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
6
one advanced C lib for UNIX and WINDOWS
one server framework
Advanced C/C++ library(ACL) for UNIX-like OS and WIN32 OS, including sync/async/ssl iostream for net/file, thread pool, process pool, db pool, server framework, event, memory, string, array/hash/ring/list, xml and json parser, http/smtp/icmp protocol, SSL/TLS, C unit test, etc -
7
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 -
8
treedb
on-disk memory library
...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 sized-array implementations for you to use in your data structures. -
9
meta-treedb
on-disk memory library using meta-data
...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 and variable-entry-sized-array implementations for you to use in your data structures. So, what distinguishes meta-treedb from treedb? * "class" interfaces for treedb collections These are vtables (virtual function tables) that implement the interface. * faster compiles - only the "class" interfaces are visible to client code This is at the expense of a small performance hit... -
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.
-
10
Combustion analysis of internal combustion engine in-cylinder pressure data. For use in the development, calibration and modelling of internal combustion engines. Compatible with data recorded with AVL Indiwin/Indimaster/Indiset I-File format. Go to www.catool.org to download the latest version
-
11
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.
-
12
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
...Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix. -
13
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. -
14
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.
-
15
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!
-
16
GAD_Tool
Kleines Lerntool zur Visualisierung von Datenstrukturen
...Da das Hauptaugenmerk "es soll Funktionieren" war, gibt es derzeit noch keine Dokumentation. Features: - Schrittweise abarbeitung aller Algorithmen - Sortieralgorithmen - Dynamische Arrays - Binär und Binomial Heaps - AVL Bäume - (a,b) Bäume - Hashing In Planung: - Graphen - O-Notation Wichtiger Hinweis: Auch wenn dieses Programm aufzeigen soll wie einige der bekanntesten Algorithmen und Datenstrukturen effizient realisiert werden, sind diese, vorwiegend, aufgrund von Einschränkungen durch die schrittweise Visualisierung, nicht effizient implementiert -
17
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/ -
18
A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.
-
19
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.
-
20
TmpltLib
template data structure library for C
Singly Linked-list - Doubly Linked-list - Stack - Queue - Deque - Generic Tree - AVL Tree - RB Tree -
21
This is a recursive AVL that I wrote up in a few hours. I didn't like how my previous one worked so I decided to rewrite it. This was the project that really set my mind into recursive thinking.
-
22
The project's purpose is to implement different types of data structures (Avl trees, Red-black trees, Binary heaps, etc.) using easy-to-read C code so it may be helpful to newbies to the world of data structure.
-
23
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
-
24
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.
-
25
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.
