This software is a library of data structures.
This software boasts a number of impressive features, including Binary Search Tree (BST) and BST backed lists. The BST backed lists are highly versatile, with the ability to support both sequential and random access. Most operations have a complexity of log(N), which extends to reading, inserting, deleting, and both sequential and random access. These lists are built on top of AVL self-balancing BSTs.
The programming interface is equally impressive, as it allows for both static and dynamic lists-specific operations, as well as BST specific operations (such as searching and sorting). While the BST backed lists may not excel in any one area, they do offer reliable performance in a variety of contexts - outperforming both static and dynamic lists.
Another important aspect of this software's functionality is its portability. The library is designed to be highly portable, capable of running seamlessly on common 32bit or 64bit UNIX systems. So, if you're looking for a reliable, versatile software solution that is easy to implement across a range of systems, this software may be just what you need.
The programming interface is equally impressive, as it allows for both static and dynamic lists-specific operations, as well as BST specific operations (such as searching and sorting). While the BST backed lists may not excel in any one area, they do offer reliable performance in a variety of contexts - outperforming both static and dynamic lists.
Another important aspect of this software's functionality is its portability. The library is designed to be highly portable, capable of running seamlessly on common 32bit or 64bit UNIX systems. So, if you're looking for a reliable, versatile software solution that is easy to implement across a range of systems, this software may be just what you need.
What's New
Version 0.20091022: N/A