If you ever need to merge two immutable dictionaries (maps) that may share the same key, here is how I did it
let mapMerge group1 group2 appender = group1 |> Seq.fold(fun (acc:Map<'a,'b>) (KeyValue(key, values)) -> match acc.TryFind key with | Some items -> Map.add key (appender values items) acc | None -> Map.add key values acc) group2 // for example, assume map1 and map2 are dictionaries of type // Map<string, seq<string>> // then the appender deals with how to merge duplicate keys let joinMaps = mapMerge map1 map2 Seq.append
It doesn’t matter which group you treat as the source and which group you treat as the seed since you are creating a new dictionary out of the two. By pre-seeding the fold with one of the dictionaries you know that the accumulator will already have some of the values you want. The map will iterate over the second dictionary (used as the source). All you need to do is pull out the data from the dictionary if it exists, and if so return a new dictionary that adds the elements to the accumulator again. By injecting a custom “key conflict” resolver you can merge any kind of item. For my example, I have a map of type
Which is why I injected the
Seq.append function. The types don’t need to be specified in the sequence fold, I just put them there to be explicit for the post.
KeyValuePair is a built in discriminated union that you can use to break up a key value pair tuple that the map iterator gives you.
After figuring this out I realized I could have saved myself a little bit of time if I had just googled it. If I had done that I would’ve found this great question on stackoverflow, which shows a few other methods and basically exactly what I have (though not all preserve key conflicts). Hey, great minds think alike, right?