24 packages returned for Tags:"trie"

Package type
Sort by
Options
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
  • 26,112 total downloads
  • last updated 9/17/2020
  • Latest version: 1.3.1-alpha
  • trie prefix tree
A trie (prefix tree) data structure implementation in C#.
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.
Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.
A simple implementation of Trie (aka. Prefix Tree), referenced from: https://leetcode.com/articles/implement-trie-prefix-tree/
  • 352 total downloads
  • last updated 7/27/2018
  • Latest version: 1.0.0
  • LRU Trie PrefixTree
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
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