Search Results for "avl"
Sort By:
Showing 27 open source projects for "avl"
View related business solutions-
Stay productive working at any distance from anywhere with Monitask.
-
NovusMED is an ecosystem that includes call center, administrative, driver applications, and client/clinic booking applications. NovusMED is the platform of choice for a wide range of medical transportation services and includes configurations for brokerage, providers, senior, community, and home health programs. Accurately manage calls and patient information. Monitor real-time performance and adjust resource capacity to meet changes in service demand. Manage will calls, confirmation calls, and recurring trips/standing orders in real time. Improved mileage reimbursement and cost calculators to manage multiple contractors, funding sources (payors), multiple providers, and volunteer driver programs. Enhanced credential management for vehicles and drivers. Manage subcontractor outsourcing with provider mobile, trip bidding, and trip offers. Able to see the closest vehicle and perform immediate bookings.
-
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
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... -
3
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. -
4
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 -
Pay business bills with bank transfers for free or pay by card, even where cards aren’t accepted.* There’s no monthly fee and your vendors don’t need to sign up.
-
5
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... -
6
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
-
7
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.
-
8
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... -
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...
-
LoanAssistant is a powerful and versatile loan amortization software developed by a dedicated team of successful accountants, software developers, and bankers. The solution is the only loan servicing add-on for QuickBooks that enables users to seamlessly manage multiple loans and credit lines.
-
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
GAD_Tool
Kleines Lerntool zur Visualisierung von Datenstrukturen
... 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 -
12
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.
-
13
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.
-
14
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/ -
15
TmpltLib
template data structure library for C
Singly Linked-list - Doubly Linked-list - Stack - Queue - Deque - Generic Tree - AVL Tree - RB Tree -
16
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.
-
17
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.
-
18
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.
-
19
This is a C++ AVL implementation with complexity guarantees. Provides such useful methods as: - Finding the closest element of a given item - Performing 1 dimensional range queries, and - Merging different trees together.
-
20
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.
-
21
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++).
-
22
Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.
-
23
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.
-
24
-
25
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.