Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. (.>) :: (IsName a1, IsName a2) => a1 -> a2 -> Name

   diagrams-lib	Diagrams.Names

   Convenient operator for writing qualified names with atomic components of different types. Instead of writing toName a1 <> toName a2 <> toName a3 you can just write a1 .> a2 .> a3.

2. (.>>) :: (Qualifiable q, IsName a) => a -> q -> q

   diagrams-lib	Diagrams.Names

   Qualify with the given name.

3. (.=) :: MonadState s m => ASetter s s a b -> b -> m ()

   diagrams-lib	Diagrams.Prelude

   Replace the target of a Lens or all of the targets of a Setter or Traversal in our monadic state with a new value, irrespective of the old. This is an infix version of assign.

   >>> execState (do _1 .= c; _2 .= d) (a,b)
   (c,d)
   

   >>> execState (both .= c) (a,b)
   (c,c)
   

   (.=) :: MonadState s m => Iso' s a       -> a -> m ()
   (.=) :: MonadState s m => Lens' s a      -> a -> m ()
   (.=) :: MonadState s m => Traversal' s a -> a -> m ()
   (.=) :: MonadState s m => Setter' s a    -> a -> m ()
   

   It puts the state in the monad or it gets the hose again.

4. (.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m ()

   diagrams-lib	Diagrams.Prelude

   Replace 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 .= b ≡ l .@= const b
   

   (.@=) :: MonadState s m => IndexedSetter i s s a b    -> (i -> b) -> m ()
   (.@=) :: MonadState s m => IndexedLens i s s a b      -> (i -> b) -> m ()
   (.@=) :: MonadState s m => IndexedTraversal i s t a b -> (i -> b) -> m ()
   

5. (.@~) :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t

   diagrams-lib	Diagrams.Prelude

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

   (.@~) ≡ iset
   

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

   l .~ b ≡ l .@~ const b
   

   (.@~) :: IndexedSetter i s t a b    -> (i -> b) -> s -> t
   (.@~) :: IndexedLens i s t a b      -> (i -> b) -> s -> t
   (.@~) :: IndexedTraversal i s t a b -> (i -> b) -> s -> t
   

6. (.~) :: ASetter s t a b -> b -> s -> t

   diagrams-lib	Diagrams.Prelude

   Replace the target of a Lens or all of the targets of a Setter or Traversal with a constant value. This is an infix version of set, provided for consistency with (.=).

   f <$ a ≡ mapped .~ f $ a
   

   >>> (a,b,c,d) & _4 .~ e
   (a,b,c,e)
   

   >>> (42,"world") & _1 .~ "hello"
   ("hello","world")
   

   >>> (a,b) & both .~ c
   (c,c)
   

   (.~) :: Setter s t a b    -> b -> s -> t
   (.~) :: Iso s t a b       -> b -> s -> t
   (.~) :: Lens s t a b      -> b -> s -> t
   (.~) :: Traversal s t a b -> b -> s -> t
   

7. (.&&&.) :: Selector s a -> Selector s b -> Selector s (a, b)

   hxt	Data.Function.Selector

   No documentation available.

8. (.&&&.) :: Selector s a -> Selector s b -> Selector s (a, b)

   hxt	Text.XML.HXT.Arrow.XmlState.TypeDefs

   No documentation available.

9. (.=) :: MonadState s m => ASetter s s a b -> b -> m ()

   microlens-mtl	Lens.Micro.Mtl

   Modify state by “assigning” a value to a part of the state. This is merely (.~) which works in MonadState:

   l .= x = modify (l .~ x)
   

   If you also want to know the value that was replaced by (.=), use (<<.=).

10. (.~) :: Lens' s a -> a -> s -> s

    relude	Relude.Extra.Lens

    The operator form of set.

Page 14 of many | Previous | Next