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.
-
units Data.Metrology.Vector Subtract point quantities.
-
units Data.Metrology.Vector Subract a vector from a point.
-
units Data.Metrology.Vector Take a inner (dot) product between two quantities.
(
.|. ) :: Bits a => a -> a -> abase Data.Bits Bitwise "or"
(
.|. ) :: Bits a => a -> a -> abase GHC.Bits Bitwise "or"
(
.||. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> PropertyQuickCheck Test.QuickCheck Disjunction: p1 .||. p2 passes unless p1 and p2 simultaneously fail.
(
.||. ) :: (Testable prop1, Testable prop2) => prop1 -> prop2 -> Propertytasty-quickcheck Test.Tasty.QuickCheck Disjunction: p1 .||. p2 passes unless p1 and p2 simultaneously fail.
(
.|.= ) :: (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) (15,7)
(.|.=) :: (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 -> tlens 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
(
<.|.= ) :: (MonadState s m, Bits a) => LensLike' ((,) a) s a -> a -> m alens 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 <.|.= 7) (28,0) (31,(31,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