From 38b534d935711dca2761153fc0f08336a6971287 Mon Sep 17 00:00:00 2001
From: Humza Shahid <humzasaur@gmail.com>
Date: Wed, 4 Sep 2024 08:11:43 +0100
Subject: [PATCH] discover error, make note of it, and update todo comment

---
 src/string-set.sml | 25 +++++++++++++++----------
 1 file changed, 15 insertions(+), 10 deletions(-)

diff --git a/src/string-set.sml b/src/string-set.sml
index 3634002..2c9177a 100644
--- a/src/string-set.sml
+++ b/src/string-set.sml
@@ -207,16 +207,6 @@ struct
     helpInsertBinSearch
       (findChr, keyPos, children, 0, Vector.length children - 1)
 
-  (* 
-   * todo: 
-   * Complete code for CHILDREN and FOUND_WITH_CHILDREN cases in insert function.
-   * The start will be similar to the exists function, 
-   * with binary search possibly followed by a string matching comparison.
-   * No string matching comparison is needed if the current char is not found
-   * in the binary search stage, however; 
-   * instead, we will insert a new element into the array when that happens.
-   *)
-
   fun insertDifferenceFoundAt
     ( insKey
     , insIdx
@@ -245,6 +235,11 @@ struct
       SOME node
     end
 
+  (* 
+   * todo: 
+   * - Debug the Subscript error raised when calling helpInsert
+   * - Complete code for FOUND_WITH_CHILDREN case in insert function.
+   *)
 
   fun helpInsert (insKey, keyPos, trie) : t option =
     case trie of
@@ -416,4 +411,14 @@ struct
       | NONE => trie
     else
       trie
+
+  fun fromString str =
+    CHILDREN {keys = Vector.fromList [str], children = Vector.fromList [FOUND]}
+
+  fun helpAddList (str, acc) = insert (str, acc)
+
+  fun addList (lst, trie) =
+    List.foldl helpAddList trie lst
+
+  val trie = let val trie = fromString "hello" in addList (["bye"], trie) end
 end