Hoogle Search

Within LTS Haskell 24.11 (ghc-9.10.2)

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

  1. (.~|) :: SBool -> SBool -> SBool

    sbv Data.SBV.Trans

    Symbolic nor

  2. (.~.) :: RTorsor x g => x -> x -> g

    lr-acts Data.Act.Torsor

    Infix synonym for rdiff. This represents a point minus a point.

  3. (<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)

    lens Control.Lens.Lens

    Replace the target of a Lens, but return the old value. When you do not need the old value, (.~) is more flexible. 

    (<<.~) ::             Lens s t a b      -> b -> s -> (a, t)
(<<.~) ::             Iso s t a b       -> b -> s -> (a, t)
(<<.~) :: Monoid a => Traversal s t a b -> b -> s -> (a, t)

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

    lens Control.Lens.Operators

    Set with pass-through. This is mostly present for consistency, but may be useful for chaining assignments. If you do not need a copy of the intermediate result, then using l .~ t directly is a good idea. 

    >>> (a,b) & _1 <.~ c
(c,(c,b))

    >>> ("good","morning","vietnam") & _3 <.~ "world"
("world",("good","morning","world"))

    >>> (42,Map.fromList [("goodnight","gracie")]) & _2.at "hello" <.~ Just "world"
(Just "world",(42,fromList [("goodnight","gracie"),("hello","world")]))

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

  5. (<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t)

    lens Control.Lens.Operators

    Replace the target of a Lens, but return the old value. When you do not need the old value, (.~) is more flexible. 

    (<<.~) ::             Lens s t a b      -> b -> s -> (a, t)
(<<.~) ::             Iso s t a b       -> b -> s -> (a, t)
(<<.~) :: Monoid a => Traversal s t a b -> b -> s -> (a, t)

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

    lens Control.Lens.Setter

    Set with pass-through. This is mostly present for consistency, but may be useful for chaining assignments. If you do not need a copy of the intermediate result, then using l .~ t directly is a good idea. 

    >>> (a,b) & _1 <.~ c
(c,(c,b))

    >>> ("good","morning","vietnam") & _3 <.~ "world"
("world",("good","morning","world"))

    >>> (42,Map.fromList [("goodnight","gracie")]) & _2.at "hello" <.~ Just "world"
(Just "world",(42,fromList [("goodnight","gracie"),("hello","world")]))

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

  7. (.&.~) :: Bits a => ASetter s t a a -> a -> s -> t

    lens Data.Bits.Lens

    Bitwise .&. the target(s) of a Lens or Setter. 

    >>> _2 .&.~ 7 $ ("hello",254)
("hello",6)

    (.&.~) :: Bits a             => Setter s t a a    -> a -> s -> t
(.&.~) :: Bits a             => Iso s t a a       -> a -> s -> t
(.&.~) :: Bits a             => Lens s t a a      -> a -> s -> t
(.&.~) :: (Monoid a, Bits a) => Traversal s t a a -> a -> s -> t

  8. (.|.~) :: Bits a => ASetter s t a a -> a -> s -> t

    lens Data.Bits.Lens

    Bitwise .|. the target(s) of a Lens or Setter. 

    >>> _2 .|.~ 6 $ ("hello",3)
("hello",7)

    (.|.~) :: Bits a             => Setter s t a a    -> a -> s -> t
(.|.~) :: Bits a             => Iso s t a a       -> a -> s -> t
(.|.~) :: Bits a             => Lens s t a a      -> a -> s -> t
(.|.~) :: (Monoid a, Bits a) => Traversal s t a a -> a -> s -> t

  9. (<.&.~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)

    lens Data.Bits.Lens

    Bitwise .&. the target(s) of a Lens or Traversal, returning the result (or a monoidal summary of all of the results). 

    >>> _2 <.&.~ 7 $ ("hello",254)
(6,("hello",6))

    (<.&.~) :: Bits a             => Iso       s t a a -> a -> s -> (a, t)
(<.&.~) :: Bits a             => Lens      s t a a -> a -> s -> (a, t)
(<.&.~) :: (Bits a, Monoid a) => Traversal s t a a -> a -> s -> (a, t)

  10. (<.|.~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)

    lens Data.Bits.Lens

    Bitwise .|. the target(s) of a Lens (or Traversal), returning the result (or a monoidal summary of all of the results). 

    >>> _2 <.|.~ 6 $ ("hello",3)
(7,("hello",7))

    (<.|.~) :: Bits a             => Iso s t a a       -> a -> s -> (a, t)
(<.|.~) :: Bits a             => Lens s t a a      -> a -> s -> (a, t)
(<.|.~) :: (Bits a, Monoid a) => Traversal s t a a -> a -> s -> (a, t)

Page 3 of many | Previous | Next