.&.

(.&.) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Property

QuickCheck Test.QuickCheck, tasty-quickcheck Test.Tasty.QuickCheck, checkers Test.QuickCheck.Checkers

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.

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

ghc GHC.Prelude.Basic

(.&.) :: BitOps bits => bits -> bits -> bits

basement Basement.Bits

(.&.) :: (Enum a, Bits w) => T w a -> T w a -> T w a

enumset Data.EnumBitSet

(.&.) :: BitWise a => a -> a -> a

hw-bits HaskellWorks.Data.Bits.BitWise

Bit-wise AND

(.&.) :: Wrd n -> Wrd n -> Wrd n

bin Data.Wrd

(.&.) :: C bits => bits -> bits -> bits

set-cover Math.SetCover.Bit

(.&.) :: (IsPath a, IsPath b) => a -> b -> Path

funcmp FMP.Picture

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

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

(.&.?) :: Bits a => FindClause a -> a -> FindClause a

filemanip System.FilePath.Find

This operator is useful to check if bits are set in a FileMode.

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

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

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

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