Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

Exact lookup

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

2. (<.|.~) :: 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 <.|.~ 6 $ ("hello",3)
   (7,("hello",7))
   

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

3. (<<.|.=) :: (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 <<.|.= 7) (28,0)
   (28,(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
   

4. (<<.|.~) :: 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 <<.|.~ 6 $ ("hello", 3)
   (3,("hello",7))
   

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

5. (||.) :: forall v . [Filter v] -> [Filter v] -> [Filter v]

   persistent	Database.Persist

   The OR of two lists of filters. For example:

   selectList
   ([ PersonAge >. 25
   , PersonAge <. 30 ] ||.
   [ PersonIncome >. 15000
   , PersonIncome <. 25000 ])
   []
   

   will filter records where a person's age is between 25 and 30 or a person's income is between (15000 and 25000). If you are looking for an (&&.) operator to do (A AND B AND (C OR D)) you can use the (++) operator instead as there is no (&&.). For example:

   selectList
   ([ PersonAge >. 25
   , PersonAge <. 30 ] ++
   ([PersonCategory ==. 1] ||.
   [PersonCategory ==. 5]))
   []
   

   will filter records where a person's age is between 25 and 30 and (person's category is either 1 or 5).

6. (.|.) :: JExpr -> JExpr -> JExpr

   ghc	GHC.JS.Make

   JS infix bit operators

7. (.||.) :: JExpr -> JExpr -> JExpr

   ghc	GHC.JS.Make

   JS infix bit operators

8. (.|.) :: Bits a => a -> a -> a

   ghc	GHC.Prelude.Basic

   Bitwise "or"

9. (.|.) :: BitOps bits => bits -> bits -> bits

   basement	Basement.Bits

   No documentation available.

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

    ghc-lib-parser	GHC.Prelude.Basic

    Bitwise "or"

Page 2 of many | Previous | Next