Remove Leaf vs Leaf case

lookupCont can do the work

Author: sjakobi

Data/HashMap/Internal.hs

@@ -2327,8 +2327,6 @@ disjoint = disjointSubtrees 0
 
 disjointSubtrees :: Eq k => Shift -> HashMap k a -> HashMap k b -> Bool
 disjointSubtrees !_s Empty _b = True
-disjointSubtrees _ (Leaf hA (L kA _)) (Leaf hB (L kB _)) =
-  hA /= hB || kA /= kB
 disjointSubtrees s (Leaf hA (L kA _)) b =
   lookupCont (\_ -> True) (\_ _ -> False) hA kA s b
 disjointSubtrees s (BitmapIndexed bmA aryA) (BitmapIndexed bmB aryB) =