Help | Examples | About | API | Blog | Hackage | Haskell
Concurrently search more than 6377 packages and more than 599194 functions! (Index generated: Tue, 22 Apr 2014 14:04:47 UTC )
Found 165 functions, 0 packages and 45 completions.
Data.Ratio.(%):: a -> a -> Ratio a infixl 7
base

Forms the ratio of two integral numbers.

Source
Ratio.(%):: a -> a -> Ratio a infixl 7
haskell98

Forms the ratio of two integral numbers.

Data.Accessor.(%:):: T r a -> (a -> a) -> StateT r m ()
data-accessor

Infix variant of modify.

Source
Data.Accessor.(%=):: T r a -> a -> StateT r m ()
data-accessor

Infix variant of set.

Source
Control.Lens.Setter.(%@=):: AnIndexedSetter i s s a b -> (i -> a -> b) -> m ()
lens

Adjust every target in the current state of an IndexedSetter, IndexedLens or IndexedTraversal with access to the index.

When you do not need access to the index then (%=) is more liberal in what it can accept.

 l %= f ≡ l %@= const f
 (%@=) :: MonadState s m => IndexedSetter i s s a b    -> (i -> a -> b) -> m ()
 (%@=) :: MonadState s m => IndexedLens i s s a b      -> (i -> a -> b) -> m ()
 (%@=) :: MonadState s m => IndexedTraversal i s t a b -> (i -> a -> b) -> m ()
Source
Control.Lens.Setter.(%@~):: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t
lens

Adjust every target of an IndexedSetter, IndexedLens or IndexedTraversal with access to the index.

 (%@~) ≡ imapOf

When you do not need access to the index then (%@~) is more liberal in what it can accept.

 l %~ f ≡ l %@~ const f
 (%@~) :: IndexedSetter i s t a b    -> (i -> a -> b) -> s -> t
 (%@~) :: IndexedLens i s t a b      -> (i -> a -> b) -> s -> t
 (%@~) :: IndexedTraversal i s t a b -> (i -> a -> b) -> s -> t
Source
Control.Lens.Setter.(%=):: Setting p s s a b -> p a b -> m ()
lens

Map over the target of a Lens or all of the targets of a Setter or Traversal in our monadic state.

>>> execState (do _1 %= f;_2 %= g) (a,b)
(f a,g b)
>>> execState (do both %= f) (a,b)
(f a,f b)
 (%=) :: MonadState s m => Iso' s a       -> (a -> a) -> m ()
 (%=) :: MonadState s m => Lens' s a      -> (a -> a) -> m ()
 (%=) :: MonadState s m => Traversal' s a -> (a -> a) -> m ()
 (%=) :: MonadState s m => Setter' s a    -> (a -> a) -> m ()
 (%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m ()
Source
Control.Lens.Setter.(%~):: Setting p s t a b -> p a b -> s -> t
lens
No description.
Source
Control.Lens.Lens.(%%@=):: IndexedLensLike i ((,) r) s s a b -> (i -> a -> (r, b)) -> m r
lens

Adjust the target of an IndexedLens returning a supplementary result, or adjust all of the targets of an IndexedTraversal within the current state, and return a monoidal summary of the supplementary results.

l %%@= f ≡ state (l %%@~ f)
 (%%@=) :: MonadState s m                 => IndexedLens i s s a b      -> (i -> a -> (r, b)) -> s -> m r
 (%%@=) :: (MonadState s m, Monoid r) => IndexedTraversal i s s a b -> (i -> a -> (r, b)) -> s -> m r
Source
Control.Lens.Lens.(%%@~):: IndexedLensLike i f s t a b -> (i -> a -> f b) -> s -> f t
lens

Adjust the target of an IndexedLens returning a supplementary result, or adjust all of the targets of an IndexedTraversal and return a monoidal summary of the supplementary results and the answer.

(%%@~) ≡ withIndex
 (%%@~) :: Functor f => IndexedLens i s t a b      -> (i -> a -> f b) -> s -> f t
 (%%@~) :: Applicative f => IndexedTraversal i s t a b -> (i -> a -> f b) -> s -> f t

In particular, it is often useful to think of this function as having one of these even more restricted type signatures:

 (%%@~) ::             IndexedLens i s t a b      -> (i -> a -> (r, b)) -> s -> (r, t)
 (%%@~) :: Monoid r => IndexedTraversal i s t a b -> (i -> a -> (r, b)) -> s -> (r, t)
Source
Powered by Haskell, HXT, Snap, and
Please send any feedback to hayoo@holumbus.org