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. (.&.~) :: 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. (<.&.=) :: (MonadState s m, Bits a) => LensLike' ((,) a) s a -> a -> m a

   lens	Data.Bits.Lens

   Modify the target(s) of a Lens' (or Traversal') by computing its bitwise .&. with another value, returning the result (or a monoidal summary of all of the results traversed).

   >>> runState (_1 <.&.= 15) (31,0)
   (15,(15,0))
   

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

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. (<<.&.=) :: (MonadState s m, Bits a) => LensLike' ((,) a) s a -> a -> m a

   lens	Data.Bits.Lens

   Modify the target(s) of a Lens', (or Traversal') by computing its bitwise .&. with another value, returning the original value (or a monoidal summary of all the original values). When you do not need the old value, (.&.=) is more flexible.

   >>> runState (_1 <<.&.= 15) (31,0)
   (31,(15,0))
   

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

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. (<&>) :: Functor f => f a -> (a -> b) -> f b

   gogol-core	Gogol.Prelude

   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
   

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

   microlens	Lens.Micro

   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. (<&>) :: Functor f => f a -> (a -> b) -> f b

   base-compat	Data.Functor.Compat

   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
   

9. (.&&.) :: JStgExpr -> JStgExpr -> JStgExpr

   ghc	GHC.JS.Make

   JS infix bit operators

10. (.&.) :: Bits a => a -> a -> a

    ghc	GHC.Prelude.Basic

    No documentation available.

Page 27 of many | Previous | Next