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.
(
&> ) :: Applicative f => f Any -> f Any -> f Anyxmonad-contrib XMonad.Util.PureX Akin to a low precedence <>. Combines applicative effects left-to-right and wrapped Bools with && (instead of ||).
(
&&& ) :: Monad m => m Bool -> m Bool -> m Boolyjtools Data.Bool.Tools No documentation available.
(
.&. ) :: Bits a => a -> a -> abase Data.Bits Bitwise "and"
(
<&> ) :: Functor f => f a -> (a -> b) -> f bbase Data.Functor 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
(
.&. ) :: Bits a => a -> a -> abase GHC.Bits Bitwise "and"
(
.&&. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> PropertyQuickCheck Test.QuickCheck Conjunction: p1 .&&. p2 passes if both p1 and p2 pass.
(
.&. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> PropertyQuickCheck Test.QuickCheck Nondeterministic choice: p1 .&. p2 picks randomly one of p1 and p2 to test. If you test the property 100 times it makes 100 random choices.
(
.&&. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Propertytasty-quickcheck Test.Tasty.QuickCheck Conjunction: p1 .&&. p2 passes if both p1 and p2 pass.
(
.&. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Propertytasty-quickcheck Test.Tasty.QuickCheck Nondeterministic choice: p1 .&. p2 picks randomly one of p1 and p2 to test. If you test the property 100 times it makes 100 random choices.
(
<&&= ) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Boollens Control.Lens.Lens 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