Permalink
Browse files

Revert INLINE to default pass

  • Loading branch information...
1 parent df335e9 commit e17f7151281ae3ed1de84105c858e65844cf077d @glguy glguy committed Mar 25, 2013
Showing with 12 additions and 12 deletions.
  1. +7 −7 src/Control/Lens/Fold.hs
  2. +2 −2 src/Control/Lens/Indexed.hs
  3. +1 −1 src/Control/Lens/Internal/Indexed.hs
  4. +2 −2 src/Control/Lens/Traversal.hs
View
14 src/Control/Lens/Fold.hs
@@ -195,7 +195,7 @@ folding sfa agb = coerce . traverse_ agb . sfa
-- [1,2,3,4]
folded :: Foldable f => Fold (f a) a
folded f = coerce . getFolding . foldMap (Folding #. f)
-{-# INLINE [0] folded #-}
+{-# INLINE folded #-}
-- | 'Fold' by repeating the input forever.
--
@@ -401,7 +401,7 @@ droppingWhile p l f = (flip evalState True .# getCompose) `rmap` l g where
-- @
foldMapOf :: Profunctor p => Accessing p r s a -> p a r -> s -> r
foldMapOf l f = runAccessor #. l (Accessor #. f)
-{-# INLINE [1] foldMapOf #-}
+{-# INLINE foldMapOf #-}
-- | @
-- 'Data.Foldable.fold' = 'foldOf' 'folded'
@@ -421,7 +421,7 @@ foldMapOf l f = runAccessor #. l (Accessor #. f)
-- @
foldOf :: Getting a s a -> s -> a
foldOf l = runAccessor #. l Accessor
-{-# INLINE [1] foldOf #-}
+{-# INLINE foldOf #-}
-- | Right-associative fold of parts of a structure that are viewed through a 'Lens', 'Getter', 'Fold' or 'Traversal'.
--
@@ -713,7 +713,7 @@ sumOf l = foldlOf' l (+) 0
-- @
traverseOf_ :: (Profunctor p, Functor f) => Accessing p (Traversed r f) s a -> p a (f r) -> s -> f ()
traverseOf_ l f = void . getTraversed #. foldMapOf l (Traversed #. f)
-{-# INLINE [0] traverseOf_ #-}
+{-# INLINE traverseOf_ #-}
-- | Traverse over all of the targets of a 'Fold' (or 'Getter'), computing an 'Applicative' (or 'Functor')-based answer,
-- but unlike 'Control.Lens.Traversal.forOf' do not construct a new structure. 'forOf_' generalizes
@@ -746,7 +746,7 @@ traverseOf_ l f = void . getTraversed #. foldMapOf l (Traversed #. f)
-- @
forOf_ :: (Profunctor p, Functor f) => Accessing p (Traversed r f) s a -> s -> p a (f r) -> f ()
forOf_ = flip . traverseOf_
-{-# INLINE [0] forOf_ #-}
+{-# INLINE forOf_ #-}
-- | Evaluate each action in observed by a 'Fold' on a structure from left to right, ignoring the results.
--
@@ -768,7 +768,7 @@ forOf_ = flip . traverseOf_
-- @
sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f ()
sequenceAOf_ l = void . getTraversed #. foldMapOf l Traversed
-{-# INLINE [1] sequenceAOf_ #-}
+{-# INLINE sequenceAOf_ #-}
-- | Map each target of a 'Fold' on a structure to a monadic action, evaluate these actions from left to right, and ignore the results.
--
@@ -2123,7 +2123,7 @@ ifoldlMOf l f z0 xs = ifoldrOf l f' return xs z0
-- @
itoListOf :: IndexedGetting i (Endo [(i,a)]) s a -> s -> [(i,a)]
itoListOf l = ifoldrOf l (\i a -> ((i,a):)) []
-{-# INLINE [1] itoListOf #-}
+{-# INLINE itoListOf #-}
-- | An infix version of 'itoListOf'.
View
4 src/Control/Lens/Indexed.hs
@@ -214,7 +214,7 @@ class Functor f => FunctorWithIndex i f | f -> i where
-- If you don't need access to the index, then 'mapped' is more flexible in what it accepts.
imapped :: FunctorWithIndex i f => IndexedSetter i (f a) (f b) a b
imapped = conjoined mapped (isets imap)
- {-# INLINE [0] imapped #-}
+ {-# INLINE imapped #-}
-------------------------------------------------------------------------------
-- FoldableWithIndex
@@ -454,7 +454,7 @@ class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t) => Traversabl
-- | The 'IndexedTraversal' of a 'TraversableWithIndex' container.
itraversed :: IndexedTraversal i (t a) (t b) a b
itraversed = conjoined traverse (itraverse . indexed)
- {-# INLINE[0] itraversed #-}
+ {-# INLINE itraversed #-}
-- | Traverse with an index (and the arguments flipped).
--
View
2 src/Control/Lens/Internal/Indexed.hs
@@ -79,7 +79,7 @@ class
-- but this cannot be enforced at the type level.
conjoined :: ((p ~ (->)) => q (a -> b) r) -> q (p a b) r -> q (p a b) r
conjoined _ r = r
- {-# INLINE [0] conjoined #-}
+ {-# INLINE conjoined #-}
instance Conjoined (->) where
distrib = fmap
View
4 src/Control/Lens/Traversal.hs
@@ -901,12 +901,12 @@ imapAccumLOf l = mapAccumLOf l .# Indexed
-- | Traverse any 'Traversable' container. This is an 'IndexedTraversal' that is indexed by ordinal position.
traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b
traversed = conjoined traverse (indexing traverse)
-{-# INLINE [0] traversed #-}
+{-# INLINE traversed #-}
-- | Traverse any 'Traversable' container. This is an 'IndexedTraversal' that is indexed by ordinal position.
traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b
traversed64 = conjoined traverse (indexing64 traverse)
-{-# INLINE[0] traversed64 #-}
+{-# INLINE traversed64 #-}
-- | This is the trivial empty 'Traversal'.
--

0 comments on commit e17f715

Please sign in to comment.