PBCD.DataStructures.Trie 1.0.1

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.

Install-Package PBCD.DataStructures.Trie -Version 1.0.1

dotnet add package PBCD.DataStructures.Trie --version 1.0.1

<PackageReference Include="PBCD.DataStructures.Trie" Version="1.0.1" />

paket add PBCD.DataStructures.Trie --version 1.0.1

#r "nuget: PBCD.DataStructures.Trie, 1.0.1"

// Install PBCD.DataStructures.Trie as a Cake Addin
#addin nuget:?package=PBCD.DataStructures.Trie&version=1.0.1

// Install PBCD.DataStructures.Trie as a Cake Tool
#tool nuget:?package=PBCD.DataStructures.Trie&version=1.0.1

[TestMethod]
public void Trie_Indexer()
{
    var T = new Trie<char, bool>();
    T["Test"] = true;
    Assert.AreEqual(T["Test"], true);
    Assert.AreEqual(T["something else"], false);
}

[TestMethod]
public void Trie_Indexer()
{
    var T = new Trie<char, bool>();
    T["Test"] = true;
    Assert.AreEqual(T["Test"], true);
    Assert.AreEqual(T["something else"], false);
}

Release Notes

The feature of this TRIE tree is that you can use any IEnumerable<TKey> (and not only chars) for storing data. It also, has a counting query method.
In version 1.0.1 an indexer is added so you can use the trie like this:
var T = new Trie<string, bool>();
T["PBCD"] = true;
If (T["PBCD"]) ...

Dependencies

• .NETStandard 2.0

  • No dependencies.

Used By

Version History