diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -71,3 +71,7 @@
 
 * Fourth version revised E. Changed the documentation for both modules.
 
+## 0.4.2.2 -- 2019-11-18
+
+* Fourth version revised F. Fixed unnecessary inlining.
+
diff --git a/Data/List/InnToOut/Basic.hs b/Data/List/InnToOut/Basic.hs
--- a/Data/List/InnToOut/Basic.hs
+++ b/Data/List/InnToOut/Basic.hs
@@ -18,11 +18,11 @@
 -- | Function that applies additional function @f :: a -> [a]@ to @a@ if @p :: a -> Bool@ and @p a = True@
 mapI :: (a -> Bool) -> (a -> [a]) -> [a] -> [a]
 mapI p f = concatMap (\x -> if p x then f x else [x])
-{-#INLINE mapI#-}
+{-#NOINLINE mapI#-}
 
 -- | Function that applies additional function @f :: a -> b@ to @a@ if @p :: a -> Bool@ and @p a = True@ and otherwise another 
 -- function @g :: a -> [b]@ to @[a]@ and combines results to obtain @[b]@
 mapI2 :: (a -> Bool) -> (a -> b) -> (a -> [b]) -> [a] -> [b]
 mapI2 p f g = concatMap (\x -> if p x then [f x] else g x)
-{-#INLINE mapI2#-}
+{-#NOINLINE mapI2#-}
 
diff --git a/Data/List/InnToOut/Unsafe.hs b/Data/List/InnToOut/Unsafe.hs
--- a/Data/List/InnToOut/Unsafe.hs
+++ b/Data/List/InnToOut/Unsafe.hs
@@ -24,14 +24,14 @@
 -- the code does what you expect.
 unsafeMapI22M :: Monad m => (a -> Bool) -> (a -> b) -> (b -> d) -> (a -> m c) -> (m c -> d) -> [a] -> [d]
 unsafeMapI22M p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
-{-#INLINE unsafeMapI22M#-}
+{-#NOINLINE unsafeMapI22M#-}
 
 -- | Unsafe function in which the first intermediate result @b@ is in the @Monad m@. It appears if the predicate @p :: a -> Bool@ is @True@ on @a@.
 -- It can have unpredictable behaviour. Use it ONLY if you surely know what you are doing. It's your responsibility to check whether 
 -- the code does what you expect.
 unsafeMapI2M2 :: Monad m => (a -> Bool) -> (a -> m b) -> (m b -> d) -> (a -> c) -> (c -> d) -> [a] -> [d]
 unsafeMapI2M2 p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
-{-#INLINE unsafeMapI2M2#-}
+{-#NOINLINE unsafeMapI2M2#-}
 
 -- | Unsafe function in which both the intermediate results @b@ and @c@ are in the Monads. They appear whenever the predicate @p :: a -> Bool@ is @True@ or @False@, but 
 -- the first one is used if @p a = True@ and the second one -- if @p a = False@.
@@ -39,18 +39,18 @@
 -- the code does what you expect.
 unsafeMapI2M2M :: (Monad m0, Monad m) => (a -> Bool) -> (a -> m0 b) -> (m0 b -> d) -> (a -> m c) -> (m c -> d) -> [a] -> [d]
 unsafeMapI2M2M p f1 g f2 h = map (\x -> if p x then g (f1 x) else h (f2 x)) 
-{-#INLINE unsafeMapI2M2M#-}
+{-#NOINLINE unsafeMapI2M2M#-}
 
 -- | Unsafe function in which the second intermediate result @b@ is in the @Monad m@. It appears if the predicate @p :: a -> Bool@ is @False@ on @a@.
 -- It can have unpredictable behaviour. Use it ONLY if you surely know what you are doing. It's your responsibility to check whether 
 -- the code does what you expect.
 unsafeMapI12M :: Monad m => (a -> Bool) -> (a -> c) -> (a -> m b) -> (m b -> c) -> [a] -> [c]
 unsafeMapI12M p f g h = map (\x -> if p x then f x else h (g x)) 
-{-#INLINE unsafeMapI12M#-}
+{-#NOINLINE unsafeMapI12M#-}
 
 -- | Unsafe function in which the first intermediate result @b@ is in the @Monad m@. It appears if the predicate @p :: a -> Bool@ is @True@ on @a@.
 -- It can have unpredictable behaviour. Use it ONLY if you surely know what you are doing. It's your responsibility to check whether 
 -- the code does what you expect.
 unsafeMapI2M1 :: Monad m => (a -> Bool) -> (a -> m b) -> (m b -> c) -> (a -> c) -> [a] -> [c]
 unsafeMapI2M1 p f g h = map (\x -> if p x then g (f x) else h x) 
-{-#INLINE unsafeMapI2M1#-}
+{-#NOINLINE unsafeMapI2M1#-}
diff --git a/mmsyn5.cabal b/mmsyn5.cabal
--- a/mmsyn5.cabal
+++ b/mmsyn5.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                mmsyn5
-version:             0.4.2.1
+version:             0.4.2.2
 synopsis:            Various additional operations on lists (some with intermediate Monads)
 description:         A small library to deal with a little bit more complex operations on lists than Data.List module
 homepage:            https://hackage.haskell.org/package/mmsyn5