@@ -56,7 +56,7 @@ benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
5656-- generate numbers up to the argument value
5757{-# INLINE source #-}
5858source :: Monad m => Int -> Unfold m Int Int
59−source n = UF.supplySecond n UF.enumerateFromToIntegral
59+source n = UF.second n UF.enumerateFromToIntegral
6060
6161-------------------------------------------------------------------------------
6262-- Benchmark helpers
@@ -75,7 +75,7 @@ drainTransformation unf f seed = drainGeneration (f unf) seed
7575drainTransformationDefault ::
7676 Monad m => Int -> (Unfold m Int Int -> Unfold m c d) -> c -> m ()
7777drainTransformationDefault to =
78− drainTransformation (UF.supplySecond to UF.enumerateFromToIntegral)
78+ drainTransformation (UF.second to UF.enumerateFromToIntegral)
7979
8080{-# INLINE drainProduct #-}
8181drainProduct ::
@@ -98,7 +98,7 @@ drainProductDefault to = drainProduct src src
9898
9999 where
100100
101− src = UF.supplySecond to UF.enumerateFromToIntegral
101+ src = UF.second to UF.enumerateFromToIntegral
102102
103103-------------------------------------------------------------------------------
104104-- Operations on input
@@ -114,26 +114,26 @@ lmapM :: Monad m => Int -> Int -> m ()
114114lmapM size start =
115115 drainTransformationDefault (size + start) (UF.lmapM (return . (+) 1)) start
116116
117−{-# INLINE supply #-}
118−supply :: Monad m => Int -> Int -> m ()
119−supply size start =
120− drainTransformationDefault (size + start) (UF.supply start) undefined
117+{-# INLINE both #-}
118+both :: Monad m => Int -> Int -> m ()
119+both size start =
120+ drainTransformationDefault (size + start) (UF.both start) undefined
121121
122122
123−{-# INLINE supplyFirst #-}
124−supplyFirst :: Monad m => Int -> Int -> m ()
125−supplyFirst size start =
123+{-# INLINE first #-}
124+first :: Monad m => Int -> Int -> m ()
125+first size start =
126126 drainTransformation
127127 (UF.take size UF.enumerateFromThenIntegral)
128− (UF.supplyFirst start)
128+ (UF.first start)
129129 1
130130
131−{-# INLINE supplySecond #-}
132−supplySecond :: Monad m => Int -> Int -> m ()
133−supplySecond size start =
131+{-# INLINE second #-}
132+second :: Monad m => Int -> Int -> m ()
133+second size start =
134134 drainTransformation
135135 (UF.take size UF.enumerateFromThenIntegral)
136− (UF.supplySecond 1)
136+ (UF.second 1)
137137 start
138138
139139{-# INLINE discardFirst #-}
@@ -256,7 +256,7 @@ enumerateFromThenIntegral size start =
256256enumerateFromToIntegral :: Monad m => Int -> Int -> m ()
257257enumerateFromToIntegral size start =
258258 drainGeneration
259− ( UF.supplySecond
259+ ( UF.second
260260 (size + start)
261261 UF.enumerateFromToIntegral
262262 ) start
@@ -280,7 +280,7 @@ enumerateFromToFractional :: Monad m => Int -> Int -> m ()
280280enumerateFromToFractional size start =
281281 let intToDouble x = (fromInteger (fromIntegral x)) :: Double
282282 in drainGeneration
283− ( UF.supplySecond
283+ ( UF.second
284284 (intToDouble $ start + size)
285285 UF.enumerateFromToFractional
286286 )
@@ -448,8 +448,8 @@ concatMapM value start =
448448 where
449449
450450 val = nthRoot 2 value
451− unfoldInGen i = return (UF.supplySecond (i + val) UF.enumerateFromToIntegral)
452− unfoldOut = UF.supplySecond (start + val) UF.enumerateFromToIntegral
451+ unfoldInGen i = return (UF.second (i + val) UF.enumerateFromToIntegral)
452+ unfoldOut = UF.second (start + val) UF.enumerateFromToIntegral
453453
454454{-# INLINE toNull #-}
455455toNull :: Monad m => Int -> Int -> m ()
@@ -619,9 +619,9 @@ o_1_space_transformation_input size =
619619 "transformation/input"
620620 [ benchIO "lmap" $ lmap size
621621 , benchIO "lmapM" $ lmapM size
622− , benchIO "supply" $ supply size
623− , benchIO "supplyFirst" $ supplyFirst size
624− , benchIO "supplySecond" $ supplySecond size
622+ , benchIO "both" $ both size
623+ , benchIO "first" $ first size
624+ , benchIO "second" $ second size
625625 , benchIO "discardFirst" $ discardFirst size
626626 , benchIO "discardSecond" $ discardSecond size
627627 , benchIO "swap" $ swap size