@@ -97,7 +97,7 @@ singleton c = putChar c
9797--
9898append :: Builder -> Builder -> Builder
9999append (Builder f) (Builder g) = Builder (f . g)
100−{-# INLINE [1] append #-}
100+{-# INLINE [0] append #-}
101101
102102-- TODO: Experiment to find the right threshold.
103103copyLimit :: Int
@@ -226,13 +226,13 @@ ensureFree !n = withSize $ \ l ->
226226 if n <= l
227227 then empty
228228 else flush `append'` withBuffer (const (newBuffer (max n defaultChunkSize)))
229−{-# INLINE [1] ensureFree #-}
229+{-# INLINE [0] ensureFree #-}
230230
231231-- | Ensure that @n@ many elements are available, and then use @f@ to
232232-- write some elements into the memory.
233233writeN :: Int -> (forall s. A.MArray s Word16 -> Int -> ST s ()) -> Builder
234234writeN n f = ensureFree n `append'` withBuffer (writeNBuffer n f)
235−{-# INLINE [1] writeN #-}
235+{-# INLINE [0] writeN #-}
236236
237237writeNBuffer :: Int -> (A.MArray s Word16 -> Int -> ST s ()) -> (Buffer s)
238238 -> ST s (Buffer s)