From d24cc1f48cef1c7f6bc041e7e73ee40a1fc7b731 Mon Sep 17 00:00:00 2001 From: Brian Shu Date: Thu, 14 Apr 2022 16:54:32 -0400 Subject: [PATCH] use Exts.inline --- Data/HashMap/Internal/Strict.hs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Data/HashMap/Internal/Strict.hs b/Data/HashMap/Internal/Strict.hs index a8b74dc8..798292db 100644 --- a/Data/HashMap/Internal/Strict.hs +++ b/Data/HashMap/Internal/Strict.hs @@ -128,17 +128,17 @@ import Data.Bits ((.&.), (.|.)) import Data.Coerce (coerce) import Data.Functor.Identity (Identity (..)) -- See Note [Imports from Data.HashMap.Internal] +import Data.Hashable (Hashable) import Data.HashMap.Internal (Hash, HashMap (..), Leaf (..), LookupRes (..), bitsPerSubkey, fullNodeMask, hash, index, mask, ptrEq, sparseIndex) -import Data.Hashable (Hashable) import Prelude hiding (lookup, map) -- See Note [Imports from Data.HashMap.Internal] import qualified Data.HashMap.Internal as HM import qualified Data.HashMap.Internal.Array as A import qualified Data.List as List -import GHC.Exts (inline) +import qualified GHC.Exts as Exts {- Note [Imports from Data.HashMap.Internal] @@ -617,7 +617,7 @@ differenceWith f a b = HM.foldlWithKey' go HM.empty a -- maps. intersectionWith :: (Eq k, Hashable k) => (v1 -> v2 -> v3) -> HashMap k v1 -> HashMap k v2 -> HashMap k v3 -intersectionWith f = inline intersectionWithKey $ const f +intersectionWith f = Exts.inline intersectionWithKey $ const f {-# INLINABLE intersectionWith #-} -- | /O(n+m)/ Intersection of two maps. If a key occurs in both maps