"#if" directive around nullness removed from src/Compiler/Utilities/HashMultiMap.fs

src/Compiler/Utilities/HashMultiMap.fs

@@ -8,17 +8,13 @@
 // Each entry in the HashMultiMap dictionary has at least one entry. Under normal usage each entry has _only_
 // one entry. So use two hash tables: one for the main entries and one for the overflow.
 [<Sealed>]
-type internal HashMultiMap<'Key, 'Value
-#if !NO_CHECKNULLS
-    when 'Key:not null
-#endif
-    >(size: int, comparer: IEqualityComparer<'Key>, ?useConcurrentDictionary: bool) =
+type internal HashMultiMap<'Key, 'Value>(size: int, comparer: IEqualityComparer<'Key>, ?useConcurrentDictionary: bool) =
 
     let comparer = comparer
 
     let firstEntries: IDictionary<_, _> =
         if defaultArg useConcurrentDictionary false then
             ConcurrentDictionary<_, _>(comparer)
         else
             Dictionary<_, _>(size, comparer)
 
@@ -29,10 +25,10 @@
             Dictionary<_, _>(3, comparer)
 
     new(comparer: IEqualityComparer<'Key>, ?useConcurrentDictionary: bool) =
         HashMultiMap<'Key, 'Value>(11, comparer, defaultArg useConcurrentDictionary false)
 
     new(entries: seq<'Key * 'Value>, comparer: IEqualityComparer<'Key>, ?useConcurrentDictionary: bool) as this =
         HashMultiMap<'Key, 'Value>(11, comparer, defaultArg useConcurrentDictionary false)
         then entries |> Seq.iter (fun (k, v) -> this.Add(k, v))
 
     member _.GetRest(k) =
@@ -154,8 +150,8 @@
     interface IDictionary<'Key, 'Value> with
 
         member s.Item
             with get x = s[x]
             and set x v = s[x] <- v
 
         member s.Keys = ([| for kvp in s -> kvp.Key |] :> ICollection<'Key>)