at 22.05-pre 33 lines 1.5 kB view raw
1diff --git a/server/src-lib/Data/HashMap/Strict/Extended.hs b/server/src-lib/Data/HashMap/Strict/Extended.hs 2index eaff0dfba..9902cadd0 100644 3--- a/src-lib/Data/HashMap/Strict/Extended.hs 4+++ b/src-lib/Data/HashMap/Strict/Extended.hs 5@@ -7,7 +7,6 @@ module Data.HashMap.Strict.Extended 6 , groupOnNE 7 , differenceOn 8 , lpadZip 9- , mapKeys 10 , unionsWith 11 ) where 12 13@@ -54,20 +53,6 @@ lpadZip left = catMaybes . flip A.alignWith left \case 14 That b -> Just (Nothing, b) 15 These a b -> Just (Just a, b) 16 17--- | @'mapKeys' f s@ is the map obtained by applying @f@ to each key of @s@. 18--- 19--- The size of the result may be smaller if @f@ maps two or more distinct 20--- keys to the same new key. In this case the value at the greatest of the 21--- original keys is retained. 22--- 23--- > mapKeys (+ 1) (fromList [(5,"a"), (3,"b")]) == fromList [(4, "b"), (6, "a")] 24--- > mapKeys (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "c" 25--- > mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "c" 26--- 27--- copied from https://hackage.haskell.org/package/containers-0.6.4.1/docs/src/Data.Map.Internal.html#mapKeys 28-mapKeys :: (Ord k2, Hashable k2) => (k1 -> k2) -> HashMap k1 a -> HashMap k2 a 29-mapKeys f = fromList . foldrWithKey (\k x xs -> (f k, x) : xs) [] 30- 31 -- | The union of a list of maps, with a combining operation: 32 -- (@'unionsWith' f == 'Prelude.foldl' ('unionWith' f) 'empty'@). 33 --