Remove bold from some "Complexity" clauses for comparison.

Author: m-renaud

Data/HashSet/Base.hs

@@ -283,7 +283,7 @@ singleton a = HashSet (H.singleton a ())
 -- >>> HashSet.toMap (HashSet.singleton 1)
 -- fromList [(1,())]
 --
--- __Complexity:__ /O(1)/
+-- /Complexity:/ /O(1)/
 toMap :: HashSet a -> HashMap a ()
 toMap = asMap
 
@@ -292,7 +292,7 @@ toMap = asMap
 -- >>> HashSet.fromMap (HashMap.singleton 1 ())
 -- fromList [1]
 --
--- __Complexity:__ /O(1)/
+-- /Complexity:/ /O(1)/
 fromMap :: HashMap a () -> HashSet a
 fromMap = HashSet
 
@@ -301,7 +301,7 @@ fromMap = HashSet
 -- >>> HashSet.keysSet (HashMap.fromList [(1, "a"), (2, "b")]
 -- fromList [1,2]
 --
--- __Complexity:__ /O(n)/
+-- /Complexity:/ /O(n)/
 --
 -- @since 0.2.10.0
 keysSet :: HashMap k a -> HashSet k
@@ -346,7 +346,8 @@ null = H.null . asMap
 -- >>> HashSet.size (HashSet.fromList [1,2,3])
 -- 3
 --
--- __Complexity:__ /O(n)/
+-- __Complexity:__ /O(n)/ - The implementation of @HashSet@ does not save the
+-- size in a field so must traverse the entire data structure on each call.
 size :: HashSet a -> Int
 size = H.size . asMap
 {-# INLINE size #-}
@@ -468,7 +469,7 @@ foldl f z0 = foldlWithKey g z0 . asMap
 -- | Filter this set by retaining only elements satisfying a
 -- predicate.
 --
--- __Complexity:__ /O(n)/
+-- /Complexity:/ /O(n)/
 filter :: (a -> Bool) -> HashSet a -> HashSet a
 filter p = HashSet . H.filterWithKey q . asMap
   where q k _ = p k
@@ -477,14 +478,14 @@ filter p = HashSet . H.filterWithKey q . asMap
 -- | Return a list of this set's elements.  The list is
 -- produced lazily.
 --
--- __Complexity:__ /O(n)/
+-- /Complexity:/ /O(n)/
 toList :: HashSet a -> [a]
 toList t = build (\ c z -> foldrWithKey ((const .) c) z (asMap t))
 {-# INLINE toList #-}
 
 -- | Construct a set from a list of elements.
 --
--- __Complexity:__ /O(n*min(W, n))/
+-- /Complexity:/ /O(n*min(W, n))/
 fromList :: (Eq a, Hashable a) => [a] -> HashSet a
 fromList = HashSet . List.foldl' (\ m k -> H.insert k () m) H.empty
 {-# INLINE fromList #-}