Hoogle Search

Within LTS Haskell 24.22 (ghc-9.10.3)

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

Exact lookup

1. (<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t)

   lens	Control.Lens.Lens

   Logically && a Boolean valued Lens and return the result. When you do not need the result of the operation, (&&~) is more flexible.

   (<&&~) :: Lens' s Bool -> Bool -> s -> (Bool, s)
   (<&&~) :: Iso' s Bool  -> Bool -> s -> (Bool, s)
   

2. (<&>) :: Functor f => f a -> (a -> b) -> f b

   lens	Control.Lens.Lens

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

3. (<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool

   lens	Control.Lens.Lens

   Modify the target of a Lens into your Monad's state by taking its logical && with a value and return the old value that was replaced. When you do not need the result of the operation, (&&=) is more flexible.

   (<<&&=) :: MonadState s m => Lens' s Bool -> Bool -> m Bool
   (<<&&=) :: MonadState s m => Iso' s Bool -> Bool -> m Bool
   

4. (<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s)

   lens	Control.Lens.Lens

   Logically && the target of a Bool-valued Lens and return the old value. When you do not need the old value, (&&~) is more flexible.

   >>> (False,6) & _1 <<&&~ True
   (False,(False,6))
   

   >>> ("hello",True) & _2 <<&&~ False
   (True,("hello",False))
   

   (<<&&~) :: Lens' s Bool -> Bool -> s -> (Bool, s)
   (<<&&~) :: Iso' s Bool -> Bool -> s -> (Bool, s)
   

5. (<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool

   lens	Control.Lens.Operators

   Logically && a Boolean valued Lens into your Monad's state and return the result. When you do not need the result of the operation, (&&=) is more flexible.

   (<&&=) :: MonadState s m => Lens' s Bool -> Bool -> m Bool
   (<&&=) :: MonadState s m => Iso' s Bool  -> Bool -> m Bool
   

6. (<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t)

   lens	Control.Lens.Operators

   Logically && a Boolean valued Lens and return the result. When you do not need the result of the operation, (&&~) is more flexible.

   (<&&~) :: Lens' s Bool -> Bool -> s -> (Bool, s)
   (<&&~) :: Iso' s Bool  -> Bool -> s -> (Bool, s)
   

7. (<&>) :: Functor f => f a -> (a -> b) -> f b

   lens	Control.Lens.Operators

   Flipped version of <$>.

   (<&>) = flip fmap
   

   Examples

   Apply (+1) to a list, a Just and a Right:

   >>> Just 2 <&> (+1)
   Just 3
   

   >>> [1,2,3] <&> (+1)
   [2,3,4]
   

   >>> Right 3 <&> (+1)
   Right 4
   

8. (<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool

   lens	Control.Lens.Operators

   Modify the target of a Lens into your Monad's state by taking its logical && with a value and return the old value that was replaced. When you do not need the result of the operation, (&&=) is more flexible.

   (<<&&=) :: MonadState s m => Lens' s Bool -> Bool -> m Bool
   (<<&&=) :: MonadState s m => Iso' s Bool -> Bool -> m Bool
   

9. (<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s)

   lens	Control.Lens.Operators

   Logically && the target of a Bool-valued Lens and return the old value. When you do not need the old value, (&&~) is more flexible.

   >>> (False,6) & _1 <<&&~ True
   (False,(False,6))
   

   >>> ("hello",True) & _2 <<&&~ False
   (True,("hello",False))
   

   (<<&&~) :: Lens' s Bool -> Bool -> s -> (Bool, s)
   (<<&&~) :: Iso' s Bool -> Bool -> s -> (Bool, s)
   

10. (.&.=) :: (MonadState s m, Bits a) => ASetter' s a -> a -> m ()

    lens	Data.Bits.Lens

    Modify the target(s) of a Lens', Setter' or Traversal' by computing its bitwise .&. with another value.

    >>> execState (do _1 .&.= 15; _2 .&.= 3) (7,7)
    (7,3)
    

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

Page 26 of many | Previous | Next