Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some gsome Data.Some.GADT Map over argument.
mapSome :: (forall (t :: k) . () => f t -> g t) -> Some f -> Some gsome Data.Some.Newtype Map over argument.
mapII :: (a -> b) -> I a -> I bsop-core Data.SOP Lift the given function.
mapIII :: (a -> b -> c) -> I a -> I b -> I csop-core Data.SOP Lift the given function.
mapII :: (a -> b) -> I a -> I bsop-core Data.SOP.BasicFunctors Lift the given function.
mapIII :: (a -> b -> c) -> I a -> I b -> I csop-core Data.SOP.BasicFunctors Lift the given function.
-
dependent-map Data.Dependent.Map O(n). The function mapAccumLWithKey threads an accumulating argument through the map in ascending order of keys.
-
dependent-map Data.Dependent.Map O(n). The function mapAccumRWithKey threads an accumulating argument through the map in descending order of keys.
-
dependent-map Data.Dependent.Map O(n). Map keys/values and separate the Left and Right results.
-
dependent-map Data.Dependent.Map O(n*log n). mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c.