18 packages returned for Tags:"trie"

A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.

DBreeze database key features: - Embedded .NET family assembly, platform independent and without references to other libraries. - Multi-threaded, ACID compliant, with a solution for deadlocks resolving/elimination, parallel reads and synchronized writes/reads. - No fixed scheme for table... More information

A generic Trie implementation with an abstracted storage pattern for simple replacement with more complex storage needs.

Wordament solver that handles an arbitrary number of special tiles, finds the many-to-many word-path relationships, and approximates a best path.

Apache Shiro styled permission manager.

Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie: efficient text search of many substrings with O(n) complexity. Automata state may be efficiently serialized to binary stream.

字典前缀树，扩展词的自定义扩展信息

A simple immutable prefix tree / trie implementation

C# implementation of a Trie (prefix tree) that is IEnumerable. You may conduct a prefix tree and not have to run on the trie all the way to it's end - just for the amount of results you need. This is perfect for autocomplete or any other scenario where you may want a fixed amount of results yielded... More information

字典前缀树

General purpose data structures and algorithms mostly to cover the functionallity or performance gap in the framework. Includes: ProrityQueue, Bag, SymboleTable, Trie, UnionFind, Search Trees (BST, OST, RBT), sorting and graph algorithms.

This TRIE works with any chain of keys (IEnumerable<TKey>) and not just strings. Also, in addition to regular TRIE functions, this one returns the number of matching prefixes in O(l) where l is the length of the prefix.

Immutable collections that use trie as their internal data structure, and provide a direct replacement for the .net's implementation of ImmutableList and ImmutableDictionary

A Trie (Prefix tree) which only stores the latest N most used words. Support predict words based on a prefix used in autocomplete fields. It uses a double a Trie in combination with a double linked list to store only an specific number of words, if more words are added over the capacity, the least... More information

A trie (prefix tree) data structure implementation in C#.

DBreezeBased Features: DBreezeBased enables Google-like search in your application. Works on Servers/Desktops/Mobile Platforms Xamarin/MONO/.NET Standalone and In-Transactional modes (separate or existing DBreeze instances and shared transactions) Can search words and words parts among... More information

MoreComplexDataStructures is a class library containing a collection of data structures (plus related utility classes) more complex than those found in the standard .NET framework. The project currently contains the following data structures and utility classes... WeightBalancedTree - An... More information

A library for all the data structures in C#. Every class is generic and reusable.