Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
<: ) :: Typeable t => TypeMap x -> (proxy t, Item x t) -> TypeMap xtype-map Data.TypeMap.Dynamic Infix version of insert to facilitate a literal-ish syntax:
empty <: (Proxy k1, v1) <: (Proxy k2, v2)
(
<: ) :: Typeable t => TypeMap x -> (proxy t, Item x t) -> TypeMap xtype-map Data.TypeMap.Dynamic.Alt Infix version of insert to facilitate a literal-ish syntax:
empty <: at t1 v1 <: at t2 v2
(
<: ) :: Typeable t => TypeMap x -> (proxy t, Item x t) -> TypeMap xtype-map Data.TypeMap.Internal.Dynamic Infix version of insert to facilitate a literal-ish syntax:
empty <: (Proxy k1, v1) <: (Proxy k2, v2)
(
<: ) :: Typeable t => TypeMap x -> (proxy t, Item x t) -> TypeMap xtype-map Data.TypeMap.Internal.Dynamic.Alt Infix version of insert to facilitate a literal-ish syntax:
empty <: at t1 v1 <: at t2 v2
(
=:= ) :: forall (w :: (Type -> Type) -> Type -> Type) s a . C w => T w s a -> T w s a -> T w s ()unique-logic UniqueLogic.ST.Expression No documentation available.
-
unique-logic-tf UniqueLogic.ST.TF.Expression No documentation available.
(
.: ) :: FromJSON a => Object -> Key -> Parser ayesod-auth-oauth2 Yesod.Auth.OAuth2.Prelude 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)yesod-auth-oauth2 Yesod.Auth.OAuth2.Prelude 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.
(
.: ) :: Assoc -> BDict -> BDictbencoding Data.BEncode Cons a key/value pair.
(
@: ) :: Integral ix => BV -> [ix] -> BVbv Data.BitVector Bit list indexing.
u @: is ==. fromBits $ List.map (u @.) is