@@ -333,11 +333,10 @@ tapOffsetEvery offset n (Fold fstep initial extract) (Stream step state) =
333333pollCounts
334334 :: MonadAsync m
335335 => (a -> Bool)
336− -> (Stream m Int -> Stream m Int)
337− -> Fold m Int b
336+ -> (Stream m Int -> m b)
338337 -> Stream m a
339338 -> Stream m a
340−pollCounts predicate transf fld (Stream step state) = Stream step' Nothing
339+pollCounts predicate fld (Stream step state) = Stream step' Nothing
341340 where
342341
343342 {-# INLINE_LATE step' #-}
@@ -347,8 +346,8 @@ pollCounts predicate transf fld (Stream step state) = Stream step' Nothing
347346 -- However, an Int on a 32-bit machine may overflow quickly.
348347 countVar <- liftIO $ Prim.newIORef (0 :: Int)
349348 tid <- forkManaged
350− $ void $ fold fld
351− $ transf $ Prim.toStreamD countVar
349+ $ void $ fld
350+ $ Prim.toStreamD countVar
352351 return $ Skip (Just (countVar, tid, state))
353352
354353 step' gst (Just (countVar, tid, st)) = do