Add complexity annotations

Author: sjakobi

Data/HashMap/Internal.hs

@@ -2316,7 +2316,8 @@ searchSwap mary n toFind start = go start toFind start
           else go i0 k (i + 1)
 {-# INLINE searchSwap #-}
 
--- | Check whether the key sets of two maps are disjoint (i.e., their 'intersection' is empty).
+-- | \(O(n \log m)\) Check whether the key sets of two maps are disjoint
+-- (i.e., their 'intersection' is empty).
 --
 -- @
 -- xs ``disjoint`` ys = null (xs ``intersection`` ys)

Data/HashSet/Internal.hs

@@ -405,7 +405,8 @@ intersection :: Eq a => HashSet a -> HashSet a -> HashSet a
 intersection (HashSet a) (HashSet b) = HashSet (H.intersection a b)
 {-# INLINABLE intersection #-}
 
--- | Check whether two sets are disjoint (i.e., their intersection is empty).
+-- | \(O(n \log m)\) Check whether two sets are disjoint (i.e., their
+-- intersection is empty).
 --
 -- @
 -- xs ``disjoint`` ys = null (xs ``intersection`` ys)