Refactor typer (2)

Author: cannorin

lib/DataTypes/Trie.fs

@@ -99,6 +99,20 @@ module Trie =
       | Some child -> getLongestMatch ks child
       | None -> {| value = trie.value; rest = k :: ks |}
 
+  let collectPath (ks: 'k list) (collector: 'k list -> 'v option -> 'a option) (trie: Trie<'k, 'v>) : 'a list =
+    let rec go acc ks trie =
+      let acc =
+        match collector ks trie.value with
+        | Some a -> a :: acc
+        | None -> acc
+      match ks with
+      | [] -> List.rev acc
+      | k :: ks ->
+        match Map.tryFind k trie.children with
+        | Some child -> go acc ks child
+        | None -> List.rev acc
+    go [] ks trie
+
   let fold (f: 'state -> 'k list -> 'v -> 'state) (s: 'state) (t: Trie<'k, 'v>) =
     let rec go ksRev state t =
       let state =

lib/Extensions.fs

@@ -64,6 +64,10 @@ module List =
       ) ([], [])
     List.rev xs1, List.rev xs2
 
+module Map =
+  let addNoOverwrite k v m =
+    m |> Map.change k (function None -> Some v | Some v -> Some v)
+
 type MutableMap<'k, 'v> = Collections.Generic.Dictionary<'k, 'v>
 type MutableSet<'v> = Collections.Generic.HashSet<'v>