Add since-annotations

Author: sjakobi

Data/HashMap/Internal.hs

@@ -790,6 +790,8 @@ infixl 9 !
 -- if present, otherwise return 'Nothing'.
 --
 -- This function can be used for /interning/, i.e. to reduce memory usage.
+--
+-- @since 0.2.21
 lookupKey :: Hashable k => k -> HashMap k v -> Maybe k
 lookupKey k = \m -> fromMaybe# (lookupKeyInSubtree# 0 (hash k) k m)
   where
@@ -1972,6 +1974,8 @@ differenceWith f = differenceWithKey (const f)
 -- encountered, the combining function is applied to the values of these keys.
 -- If it returns 'Nothing', the element is discarded (proper set difference). If
 -- it returns (@'Just' y@), the element is updated with a new value @y@.
+--
+-- @since 0.2.21
 differenceWithKey :: Eq k => (k -> v -> w -> Maybe v) -> HashMap k v -> HashMap k w -> HashMap k v
 differenceWithKey f = go_differenceWithKey 0
   where
@@ -2323,7 +2327,7 @@ searchSwap mary n toFind start = go start toFind start
 -- xs ``disjoint`` ys = null (xs ``intersection`` ys)
 -- @
 --
--- @since FIXME
+-- @since 0.2.21
 disjoint :: Eq k => HashMap k a -> HashMap k b -> Bool
 disjoint = disjointSubtrees 0
 {-# INLINE disjoint #-}

Data/HashMap/Internal/Strict.hs

@@ -632,6 +632,8 @@ differenceWith f = HM.differenceWithKey $
 -- encountered, the combining function is applied to the values of these keys.
 -- If it returns 'Nothing', the element is discarded (proper set difference). If
 -- it returns (@'Just' y@), the element is updated with a new value @y@.
+--
+-- @since 0.2.21
 differenceWithKey :: Eq k => (k -> v -> w -> Maybe v) -> HashMap k v -> HashMap k w -> HashMap k v
 differenceWithKey f = HM.differenceWithKey $
   \k vA vB -> case f k vA vB of

Data/HashSet/Internal.hs

@@ -356,6 +356,8 @@ member a s = case H.lookup a (asMap s) of
 -- present, otherwise return 'Nothing'.
 --
 -- This is useful for /interning/, i.e. to reduce memory usage.
+--
+-- @since 0.2.21
 lookupElement :: Hashable a => a -> HashSet a -> Maybe a
 lookupElement a = H.lookupKey a . asMap
 {-# INLINE lookupElement #-}
@@ -412,7 +414,7 @@ intersection (HashSet a) (HashSet b) = HashSet (H.intersection a b)
 -- xs ``disjoint`` ys = null (xs ``intersection`` ys)
 -- @
 --
--- @since FIXME
+-- @since 0.2.21
 disjoint :: Eq k => HashSet k -> HashSet k -> Bool
 disjoint (HashSet a) (HashSet b) = H.disjoint a b
 {-# INLINE disjoint #-}