Hoogle Search

Within LTS Haskell 22.26 (ghc-9.6.5)

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

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

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

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

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

  5. (<<.&.~) :: Bits a => Optical' (->) q ((,) a) s a -> a -> q s (a, s)

    lens Data.Bits.Lens

    Bitwise .&. the target(s) of a Lens or Traversal, and return the original value, or a monoidal summary of the original values. When you do not need the old value, (.&.~) is more flexible. 

    >>> _2 <<.&.~ 7 $ ("hello", 254)
(254,("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)

  6. (<<.|.~) :: Bits a => Optical' (->) q ((,) a) s a -> a -> q s (a, s)

    lens Data.Bits.Lens

    Bitwise .|. the target(s) of a Lens or Traversal, and return the original value, or a monoidal summary of the original values. When you do not need the old value, (.|.~) is more flexible. 

    >>> _2 <<.|.~ 6 $ ("hello", 3)
(3,("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)

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

    microlens Lens.Micro

    This is a version of (.~) which modifies the structure and returns it along with the old value: 

    >>> (1, 2) & _1 <<.~ 0
(1, (0, 2))
    Simpler type signatures: 
    (<<.~) ::             Lens s t a b      -> b -> s -> (a, t)
(<<.~) :: Monoid a => Traversal s t a b -> b -> s -> (a, t)

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

    diagrams-lib Diagrams.Prelude

    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)

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

    diagrams-lib Diagrams.Prelude

    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)

  10. (!.~) :: Vector v a => v a -> Int -> a

    vector-hashtables Data.Vector.Hashtables.Internal

    Infix version of unsafeIndex.

Page 4 of many | Previous | Next