Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. (%%=) :: forall (m :: Type -> Type) c s a b . Monad m => LensLike (Writer c) s s a b -> (a -> (c, b)) -> StateT s m c

   lens-family-core	Lens.Family.State.Strict

   (%%=) :: Monad m => Lens s s a b -> (a -> (c, b)) -> StateT s m c
   

   Modify a field of the state while returning another value.

   (%%=) :: (Monad m, Monoid c) => Traversal s s a b -> (a -> (c, b)) -> StateT s m c
   

   Modify each field of the state and return the mconcat of the other values.

2. (%=) :: forall (m :: Type -> Type) s a b . Monad m => ASetter s s a b -> (a -> b) -> StateT s m ()

   lens-family-core	Lens.Family.State.Strict

   Modify a field of the state.

3. (%>) :: forall k l m s t u v (is :: IxList) (js :: IxList) a b . (JoinKinds k l m, IxOptic k s t u v, NonEmptyIndices is) => Optic k is s t u v -> Optic l js u v a b -> Optic m js s t a b

   optics-extra	Optics.Indexed

   Compose two indexed optics and drop indices of the left one. (If you want to compose a non-indexed and an indexed optic, you can just use (%).)

   >>> itoListOf (ifolded %> ifolded) ["foo", "bar"]
   [(0,'f'),(1,'o'),(2,'o'),(0,'b'),(1,'a'),(2,'r')]
   

4. (%%=) :: forall k r s m (is :: IxList) a b . (PermeableOptic k r, MonadState s m) => Optic k is s s a b -> (a -> (r, b)) -> m (ViewResult k r)

   optics-extra	Optics.State.Operators

   Modify the target of an PermeableOptic in the current state returning some extra information of type depending on the optic (r, Maybe r or monoidal summary).

5. (%=) :: forall k s m (is :: IxList) a b . (Is k A_Setter, MonadState s m) => Optic k is s s a b -> (a -> b) -> m ()

   optics-extra	Optics.State.Operators

   Map over the target(s) of an Optic in our monadic state. This is an infix version of modifying.

6. (%~) :: forall (a :: k) (b :: k) . SDecide k => Sing a -> Sing b -> Decision (a :~: b)

   singletons-th	Data.Singletons.TH

   Compute a proof or disproof of equality, given two singletons.

7. (%:) :: LaTeXC l => l -> Text -> l

   HaTeX	Text.LaTeX.Base.Commands

   This operator appends a comment after a expression. For example:

   textbf "I'm just an example." %: "Insert a few words here."
   

   The implementation is

   (%:) l = (l <>) . comment
   

   Since you are writing in Haskell, you may not need to output comments as you can add them in the Haskell source. I added this feature for completeness. It may be useful for debugging the output as well.

8. (%~~) :: (Backprop a, Backprop b, Reifies s W) => Lens' b a -> (BVar s a -> BVar s a) -> BVar s b -> BVar s b

   backprop	Numeric.Backprop

   An infix version of overVar, meant to evoke parallels to %~ from lens. With normal values, you can set modify in a value with a lens:

   x & myLens %~ negate
   

   would "modify" a part of x :: b, specified by myLens :: Lens' a b, using the function negate :: a -> a.

   xVar & myLens %~~ negate
   

   would "modify" a part of xVar :: BVar s b (a BVar holding a b), specified by myLens :: Lens' a b, using the function negate :: BVar s a -> BVar s . The result is a new (updated) value of type BVar s b. Is essentially a convenient wrapper over a viewVar followed by a setVar.

9. (%~~) :: (Num a, Num b, Reifies s W) => Lens' b a -> (BVar s a -> BVar s a) -> BVar s b -> BVar s b

   backprop	Numeric.Backprop.Num

   %~~, but with Num constraints instead of Backprop constraints.

10. (%=) :: MonadState a m => Lens a b -> (b -> b) -> m ()

    data-lens-light	Data.Lens.Light

    Infix modification of a value through a lens into state

Page 19 of many | Previous | Next