@@ -348,7 +348,7 @@ transform (Pipe pstep1 pstep2 pinitial) (Fold fstep finitial fextract) =
348-- from the 'Foldable', the result is 'None' for empty containers.
348-- from the 'Foldable', the result is 'None' for empty containers.
349{-# INLINABLE _Fold1 #-}
349{-# INLINABLE _Fold1 #-}
350_Fold1 :: Monad m => (a -> a -> a) -> Fold m a (Maybe a)
350_Fold1 :: Monad m => (a -> a -> a) -> Fold m a (Maybe a)
351−_Fold1 step = Fold step_ (return Nothing') fromStrictMaybe
351+_Fold1 step = Fold step_ (return Nothing') (return . toMaybe)
353 step_ mx a = return $ Just' $
353 step_ mx a = return $ Just' $
354 case mx of
354 case mx of
@@ -692,7 +692,7 @@ head = _Fold1 const
692-- @since 0.7.0
692-- @since 0.7.0
693{-# INLINABLE find #-}
693{-# INLINABLE find #-}
694find :: Monad m => (a -> Bool) -> Fold m a (Maybe a)
694find :: Monad m => (a -> Bool) -> Fold m a (Maybe a)
695−find predicate = Fold step (return Nothing') fromStrictMaybe
695+find predicate = Fold step (return Nothing') (return . toMaybe)
697 step x a = return $
697 step x a = return $
698 case x of
698 case x of
@@ -707,7 +707,7 @@ find predicate = Fold step (return Nothing') fromStrictMaybe
707-- @since 0.7.0
707-- @since 0.7.0
708{-# INLINABLE lookup #-}
708{-# INLINABLE lookup #-}
709lookup :: (Eq a, Monad m) => a -> Fold m (a,b) (Maybe b)
709lookup :: (Eq a, Monad m) => a -> Fold m (a,b) (Maybe b)
710−lookup a0 = Fold step (return Nothing') fromStrictMaybe
710+lookup a0 = Fold step (return Nothing') (return . toMaybe)
712 step x (a,b) = return $
712 step x (a,b) = return $
713 case x of
713 case x of