Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
.|.= ) :: (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
-
optparse-applicative Options.Applicative.Help.Pretty No documentation available.
-
conduit Data.Conduit Combine two Conduits together into a new Conduit (aka fuse). Output from the upstream (left) conduit will be fed into the downstream (right) conduit. Processing will terminate when downstream (right) returns. Leftover data returned from the right Conduit will be discarded. Equivalent to fuse and =$=, however the latter is deprecated and will be removed in a future version. Note that, while this operator looks like categorical composition (from Control.Category), there are a few reasons it's different:
- The position of the type parameters to ConduitT do not match. We would need to change ConduitT i o m r to ConduitT r m i o, which would preclude a Monad or MonadTrans instance.
- The result value from upstream and downstream are allowed to differ between upstream and downstream. In other words, we would need the type signature here to look like ConduitT a b m r -> ConduitT b c m r -> ConduitT a c m r.
- Due to leftovers, we do not have a left identity in Conduit. This can be achieved with the underlying Pipe datatype, but this is not generally recommended. See https://stackoverflow.com/a/15263700.
-
conduit Data.Conduit.Internal Combine two Conduits together into a new Conduit (aka fuse). Output from the upstream (left) conduit will be fed into the downstream (right) conduit. Processing will terminate when downstream (right) returns. Leftover data returned from the right Conduit will be discarded. Equivalent to fuse and =$=, however the latter is deprecated and will be removed in a future version. Note that, while this operator looks like categorical composition (from Control.Category), there are a few reasons it's different:
- The position of the type parameters to ConduitT do not match. We would need to change ConduitT i o m r to ConduitT r m i o, which would preclude a Monad or MonadTrans instance.
- The result value from upstream and downstream are allowed to differ between upstream and downstream. In other words, we would need the type signature here to look like ConduitT a b m r -> ConduitT b c m r -> ConduitT a c m r.
- Due to leftovers, we do not have a left identity in Conduit. This can be achieved with the underlying Pipe datatype, but this is not generally recommended. See https://stackoverflow.com/a/15263700.
(
.!= ) :: Parser (Maybe a) -> a -> Parser agogol-core Gogol.Data.JSON Helper for use in combination with .:? to provide default values for optional JSON object fields. This combinator is most useful if the key and value can be absent from an object without affecting its validity and we know a default value to assign in that case. If the key and value are mandatory, use .: instead. Example usage:
v1 <- o .:? "opt_field_with_dfl" .!= "default_val" v2 <- o .: "mandatory_field" v3 <- o .:? "opt_field2"
(
.: ) :: FromJSON a => Object -> Key -> Parser agogol-core Gogol.Data.JSON Retrieve the value associated with the given key of an Object. The result is empty if the key is not present or the value cannot be converted to the desired type. This accessor is appropriate if the key and value must be present in an object for it to be valid. If the key and value are optional, use .:? instead.
(
.:? ) :: FromJSON a => Object -> Key -> Parser (Maybe a)gogol-core Gogol.Data.JSON Retrieve the value associated with the given key of an Object. The result is Nothing if the key is not present or if its value is Null, or empty if the value cannot be converted to the desired type. This accessor is most useful if the key and value can be absent from an object without affecting its validity. If the key and value are mandatory, use .: instead.
(
.= ) :: (KeyValue e kv, ToJSON v) => Key -> v -> kvgogol-core Gogol.Data.JSON No documentation available.
(
.# ) :: forall a b c q . (Profunctor p, Coercible b a) => p b c -> q a b -> p a cprofunctors Data.Profunctor.Unsafe Strictly map the first argument argument contravariantly with a function that is assumed operationally to be a cast, such as a newtype constructor. Note: This operation is explicitly unsafe since an implementation may choose to use unsafeCoerce to implement this combinator and it has no way to validate that your function meets the requirements. If you implement this combinator with unsafeCoerce, then you are taking upon yourself the obligation that you don't use GADT-like tricks to distinguish values. If you import Data.Profunctor.Unsafe you are taking upon yourself the obligation that you will only call this with a second argument that is operationally identity.
(.#) ≡ \p -> p `seq` \f -> lmap coerce p