Portability | LiberalTypeSynonyms |
---|---|
Stability | experimental |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Safe Haskell | Safe-Inferred |
- (|~) :: Bits a => Setting s t a a -> a -> s -> t
- (&~) :: Bits a => Setting s t a a -> a -> s -> t
- (<|~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
- (<&~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)
- (|=) :: (MonadState s m, Bits a) => Simple Setting s a -> a -> m ()
- (&=) :: (MonadState s m, Bits a) => Simple Setting s a -> a -> m ()
- (<|=) :: (MonadState s m, Bits a) => SimpleLensLike ((,) a) s a -> a -> m a
- (<&=) :: (MonadState s m, Bits a) => SimpleLensLike ((,) a) s a -> a -> m a
- bitAt :: Bits b => Int -> SimpleIndexedLens Int b Bool
- traverseBits :: (Num b, Bits b) => SimpleIndexedTraversal Int b Bool
Documentation
(<|~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)Source
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)
(<&~) :: Bits a => LensLike ((,) a) s t a a -> a -> s -> (a, t)Source
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) => Simple Setting s a -> a -> m ()Source
Modify the target(s) of a Simple
Lens
, Setter
or Traversal
by computing its bitwise .|.
with another value.
(|=
) :: (MonadState
s m,Bits
a) =>Simple
Setter
s a -> a -> m () (|=
) :: (MonadState
s m,Bits
a) =>Simple
Iso
s a -> a -> m () (|=
) :: (MonadState
s m,Bits
a) =>Simple
Lens
s a -> a -> m () (|=
) :: (MonadState
s m,Bits
a) =>Simple
Traversal
s a -> a -> m ()
(&=) :: (MonadState s m, Bits a) => Simple Setting s a -> a -> m ()Source
Modify the target(s) of a Simple
Lens
, Setter
or Traversal
by computing its bitwise .&.
with another value.
(&=
) :: (MonadState
s m,Bits
a) =>Simple
Setter
s a -> a -> m () (&=
) :: (MonadState
s m,Bits
a) =>Simple
Iso
s a -> a -> m () (&=
) :: (MonadState
s m,Bits
a) =>Simple
Lens
s a -> a -> m () (&=
) :: (MonadState
s m,Bits
a) =>Simple
Traversal
s a -> a -> m ()
(<|=) :: (MonadState s m, Bits a) => SimpleLensLike ((,) a) s a -> a -> m aSource
Modify the target(s) of a Simple
Lens
, (or Traversal
) by computing its bitwise .|.
with another value,
returning the result (or a monoidal summary of all of the results traversed)
(<|=
) :: (MonadState
s m,Bits
a) =>Simple
Lens
s a -> a -> m a (<|=
) :: (MonadState
s m,Bits
a,Monoid
a) =>Simple
Traversal
s a -> a -> m a
(<&=) :: (MonadState s m, Bits a) => SimpleLensLike ((,) a) s a -> a -> m aSource
Modify the target(s) of a Simple
Lens
(or Traversal
) by computing its bitwise .&.
with another value,
returning the result (or a monoidal summary of all of the results traversed)
(<&=
) :: (MonadState
s m,Bits
a) =>Simple
Lens
s a -> a -> m a (<&=
) :: (MonadState
s m,Bits
a,Monoid
a) =>Simple
Traversal
s a -> a -> m a
traverseBits :: (Num b, Bits b) => SimpleIndexedTraversal Int b BoolSource
Traverse over all bits in a numeric type.
The bit position is available as the index.
>>>
import Data.Word
>>>
toListOf traverseBits (5 :: Word8)
[True,False,True,False,False,False,False,False]
If you supply this an Integer
, the result will
be an infinite Traversal
that can be productively consumed.