6 packages tagged with “binary-tree”
ZoneTree is a persistent, high-performance, transactional, ACID-compliant ordered key-value database for NET. It can operate in memory or on local/cloud storage.
Package Description
A little library with useful data structures and extension methods. Very useful for students ^-^
Advanced data structures for .NET
A .NET library providing a collection of high-performance, memory-efficient data structures, primarily focused on various trie implementations and advanced search capabilities. Key Features: - Mutable and Immutable Trie Dictionaries: Includes a mutable Double-Array trie and read-only, highly compressed DAWG and LOUDS tries. - Advanced Search: Supports exact match, prefix, common prefix, longest prefix, and wildcard searches (LTR/RTL). - Flexible Record Storage: Each key maps to a list of records, with support for both persistent (serializable) and transient (in-memory) storage per key. - A rich set of underlying data stores, including HashMap, AVL Tree, AA Tree, Treap, and more. Ideal for applications requiring efficient text processing, auto-completion, full-text search engines, morphological analysis, or management of large, static dictionaries. For more details, please visit the project repository on GitHub.
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