15 packages tagged with “Avl”
A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.
Immutable persistent collections, algebraic sum-type aka descriminated union, Ref type and supportive extensions for performant functional programming in C#. Split from the DryIoc: https://github.com/dadhi/DryIoc
.Net Standard 2.1 package contains implementation of Standard Binary Search Tree and AVL Tree.
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains the interface definition assembly.
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains the primary implementations.
TypeScript implementation of an AVL tree, a self-balancing binary search tree, with enumerable/iterable collections like set and map.
Self balancing avl tree with Concat and Split operations.
DataStructures for graphs, vertices,edges,nodes and trees. Contains a Binary Search Tree, AVL Tree and a PriorityQueue based on BST Tree which can handle duplicates
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains implementations with Int64 rank indexing.
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains HugeList, a class for efficiently managing very large lists.
TreeLib: Balanced Binary Trees, Rank Augmented provides binary tree collections (AVL, red-black and splay) with optional rank information for order-statistic and sparse indexing applications. This package contains array-embedded implementations.
This library contains an extensible framework for persistent and augmentable binary trees. Out of the box, it provides AVL and weight-balanced trees, adapters to standard collection interfaces (IReadOnlyList, ISet, IReadOnlySet, IDictionary), and indexed access to elements in sort order. By using a novel(?) persistence strategy, it achieves much better performance than standard immutable collections, and only slightly worse than standard SortedSet. The library also provides a tree iterator, which allows non-recursive tree traversal, as well as traversing only a part of the tree. Introductory and API documentation is available at https://zvrba.github.io/Podaga/html/e165bf08-271a-48ee-a361-c437960f8c68.htm
Extension for ImTools package. Forked from original source code. Contains classes like Unit or Union from old ImTools. No changes were made to their code. ---original description--- Immutable persistent collections, algebraic sum-type aka descriminated union, Ref type and supportive extensions for performant functional programming in C#. Split from the DryIoc: https://github.com/dadhi/DryIoc
A library for all the data structures in C#. Every class is generic and reusable.