Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
contiguous Data.Primitive.Contiguous Map over a mutable array with indices, modifying the elements in place.
-
contiguous Data.Primitive.Contiguous Strictly map over a mutable array with indices, modifying the elements in place.
getAllPropertiesMap :: Client -> MethodCall -> IO (Either MethodError (Map String Variant))dbus DBus.Client No documentation available.
ValueMap :: Type -> Type -> Map Atom Value -> Valuedbus DBus.Internal.Types No documentation available.
bimap :: Ord k' => (k -> v -> (k', v')) -> Map k v -> Map k' v'dbus DBus.Internal.Types No documentation available.
bimapM :: (Monad m, Ord k') => (k -> v -> m (k', v')) -> Map k v -> m (Map k' v')dbus DBus.Internal.Types No documentation available.
ToMap :: Expr s a -> Maybe (Expr s a) -> Expr s adhall Dhall.Core ToMap x (Just t) ~ toMap x : t ToMap x Nothing ~ toMap x
useToMap :: Expr s a -> Maybe (Expr s a)dhall Dhall.Lint This replaces a record of key-value pairs with the equivalent use of toMap This is currently not used by dhall lint because this would sort Map keys, which is not necessarily a behavior-preserving change, but is still made available as a convenient rewrite rule. For example, {json,yaml}-to-dhall use this rewrite to simplify their output.
foldMapWithKey :: (Monoid m, Ord k) => (k -> a -> m) -> Map k a -> mdhall Dhall.Map Fold all of the key-value pairs in a Map, in their original order
>>> foldMapWithKey (,) (fromList [("B",[1]),("A",[2])]) ("BA",[1,2])-
dhall Dhall.Map Create a Map from a Data.Map.Strict.Map