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.

  1. (.@~) :: 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

  2. (.~) :: 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

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

    Cabal-syntax Distribution.Compat.Lens

    No documentation available.

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

    Cabal-syntax Distribution.Compat.Lens

    No documentation available.

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

    hxt Data.Function.Selector

    No documentation available.

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

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

    No documentation available.

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

    relude Relude.Extra.Lens

    The operator form of set.

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

    diagrams-core Diagrams.Core

    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.

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

    diagrams-core Diagrams.Core

    Qualify with the given name.

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

    diagrams-core Diagrams.Core.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.

Page 18 of many | Previous | Next