diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -28,3 +28,7 @@
 ## 0.2.1.0 -- 2021-10-30
 
 * Second version revised A. Discontinued the base < 4.9 versions. 
+
+## 0.2.1.1 -- 2021-10-30
+
+* Second version revised B. Added inlining of the Case.Hashable.Cuckoo.getBFstL' function.
diff --git a/Case/Hashable/Cuckoo.hs b/Case/Hashable/Cuckoo.hs
--- a/Case/Hashable/Cuckoo.hs
+++ b/Case/Hashable/Cuckoo.hs
@@ -27,6 +27,7 @@
 getBFstL' def pairs key = fromMaybe def
   ((\(ST st_rep) -> case runRW# st_rep of (# _, a #) -> a) . -- Actually is rewritten from the GHC.ST.runST to remove the forall constraint
     lookup2 pairs $ key)
+{-# INLINE getBFstL' #-}
 
 lookup2 pairs key = H.fromList pairs >>= \ht -> C.lookup ht key
 {-# INLINE lookup2 #-}
diff --git a/mmsyn2-array.cabal b/mmsyn2-array.cabal
--- a/mmsyn2-array.cabal
+++ b/mmsyn2-array.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                mmsyn2-array
-version:             0.2.1.0
+version:             0.2.1.1
 synopsis:            A library that can be used for multiple Ord a => a -> b transformations.
 description:         A library that can be used as a @case ... of@ construction replacement for various cases. Since the 0.2.0.0 version also uses the cuckoo hashtables in the respective module.
 homepage:            https://hackage.haskell.org/package/mmsyn2-array
