Add mutable operations to Levenshtrie

Author: andrewjsaid

src/Levenshtypo.Generator/CSharpStateMachineGenerator.cs

@@ -169,8 +169,6 @@ public bool MoveNext(Rune c, out State next)
                     });
                 
                 public int Distance => DistanceData[Math.Min({{maxDistance}}, _sRune.Length - _sIndex) * {{groupMap.Count}} + _state];
-
-                public int MinimumDistance => MinDistanceData[_state];
             }
             """);
 

src/Levenshtypo.Tests/LevenshtrieCustomTraversalTests.cs

@@ -59,8 +59,6 @@ public OnlyGetNChars(int numLeft)
 
         public int Distance => 0;
 
-        public int MinimumDistance => 0;
-
         public bool MoveNext(Rune c, out OnlyGetNChars next)
         {
             var nextNumLeft = _numLeft - 1;

src/Levenshtypo.Tests/LevenshtrieMutationTests.cs

@@ -0,0 +1,69 @@
+using Shouldly;
+
+namespace Levenshtypo.Tests;
+
+public class LevenshtrieMutationTests
+{
+    [Fact]
+    public void GeneratedTests_Guids()
+    {
+        RunTest(Enumerable.Range(0, 100_000).Select(_ => Guid.NewGuid().ToString()));
+    }
+
+    [Fact]
+    public void GeneratedTests_Integers()
+    {
+        RunTest(Enumerable.Range(0, 100_000).Select(i => i.ToString()));
+    }
+
+    [Fact]
+    public void HandWrittenTests()
+    {
+        RunTest([
+            "a",
+            "abcde", // extend head
+            "abcdefghi", // extend tail data
+            "az", // branch off head
+            "abz", // branch off tail data
+            "abc", // stop at head
+            "abcdefg", // stop at tail data
+            "",
+            "z" // branch off root
+            ]);
+    }
+        
+
+    private void RunTest(IEnumerable<string> keys)
+    {
+        var trie = Levenshtrie.CreateEmpty<string>();
+
+        var addedKeys = new List<string>();
+
+        foreach (var key in keys)
+        {
+            addedKeys.Add(key);
+
+            trie.TryGetValue(key, out _).ShouldBeFalse();
+
+            trie.Add(key, key);
+
+            trie.TryGetValue(key, out var found).ShouldBeTrue();
+            ReferenceEquals(key, found).ShouldBeTrue();
+        }
+
+        foreach (var key in addedKeys)
+        {
+            trie.TryGetValue(key, out var found).ShouldBeTrue();
+            ReferenceEquals(key, found).ShouldBeTrue();
+        }
+
+        foreach (var key in addedKeys)
+        {
+            trie.Remove(key);
+
+            trie.TryGetValue(key, out var found).ShouldBeFalse();
+            found.ShouldBeNull();
+        }
+    }
+
+}

src/Levenshtypo.Tests/LevenshtrieTryGetValueTests.cs

@@ -7,31 +7,31 @@ public class LevenshtrieTryGetValueTests
     [Fact]
     public void LargeDataSet()
     {
-        var enFrozenTries = new List<KeyValuePair<string, int>>();
-        var nonEnFrozenTries = new List<KeyValuePair<string, int>>();
+        var inKeys = new List<KeyValuePair<string, int>>();
+        var outKeys = new List<KeyValuePair<string, int>>();
 
         for (int i = 0; i < 10000; i++)
         {
             if (i % 17 == 0)
             {
-                nonEnFrozenTries.Add(new KeyValuePair<string, int>(i.ToString(), i));
+                outKeys.Add(new KeyValuePair<string, int>(i.ToString(), i));
             }
             else
             {
-                enFrozenTries.Add(new KeyValuePair<string, int>(i.ToString(), i));
+                inKeys.Add(new KeyValuePair<string, int>(i.ToString(), i));
             }
         }
 
-        var t = Levenshtrie<int>.Create(enFrozenTries);
-
-        foreach (var (key, value) in enFrozenTries)
+        var t = Levenshtrie<int>.Create(inKeys);
+        
+        foreach (var (key, value) in inKeys)
         {
             var found = t.TryGetValue(key, out var actual);
             found.ShouldBeTrue();
             actual.ShouldBe(value);
         }
 
-        foreach (var (key, value) in nonEnFrozenTries)
+        foreach (var (key, value) in outKeys)
         {
             var found = t.TryGetValue(key, out var actual);
             found.ShouldBeFalse();

src/Levenshtypo/Distance0Levenshtomaton.cs

@@ -72,7 +72,5 @@ public bool MoveNext(Rune c, out State next)
         public bool IsFinal => _sIndex == _sRune.Length;
 
         public int Distance => 0;
-
-        public int MinimumDistance => 0;
     }
 }