Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. mapKeys :: forall s k1 k2 a . Ord k2 => (Key s k1 -> k2) -> Map s k1 a -> SomeMapWith (MapProof 'Regular s k1 k2) k2 a

    refined-containers Data.Map.Strict.Refined

    mapKeys f m applies f to each key of m and collects the results into a new map. For keys that were mapped to the same new key, the value corresponding to the greatest of the original keys is retained.

  2. mapKeysWith :: forall s k1 k2 a . Ord k2 => (a -> a -> a) -> (Key s k1 -> k2) -> Map s k1 a -> SomeMapWith (MapProof 'Regular s k1 k2) k2 a

    refined-containers Data.Map.Strict.Refined

    mapKeysWith c f m applies f to each key of m and collects the results into a new map. For keys that were mapped to the same new key, c acts as the combining function for corresponding values.

  3. mapMaybe :: forall s k a b . (a -> Maybe b) -> Map s k a -> SomeMapWith (SupersetProof 'Regular s) k b

    refined-containers Data.Map.Strict.Refined

    Apply a function to all values in a map and collect only the Just results, returning a potentially smaller map.

  4. mapMaybeWithKey :: (Key s k -> a -> Maybe b) -> Map s k a -> SomeMapWith (SupersetProof 'Regular s) k b

    refined-containers Data.Map.Strict.Refined

    Apply a function to all values in a map, together with their corresponding keys, and collect only the Just results, returning a potentially smaller map.

  5. mapWithKey :: (Key s k -> a -> b) -> Map s k a -> Map s k b

    refined-containers Data.Map.Strict.Refined

    Apply a function to all values in a map, together with their corresponding keys, that are proven to be in the map. The set of keys remains the same.

  6. mapOp :: (Functor f, HasField s "mapOp" a) => LensLike' f s a

    riak-protobuf Data.Riak.Proto

    No documentation available.

  7. mapValue :: (Functor f, HasField s "mapValue" a) => LensLike' f s a

    riak-protobuf Data.Riak.Proto

    No documentation available.

  8. mapSelected :: forall (f :: Type -> Type) a c b . Functor f => (a -> c) -> Selection f b a -> Selection f b c

    selections Data.Functor.Selection

    Map over selected values

    mapSelected = fmap
    

  9. mapUnselected :: forall (f :: Type -> Type) b c a . Functor f => (b -> c) -> Selection f b a -> Selection f c a

    selections Data.Functor.Selection

    Map over unselected values

    mapUnselected = first
    

  10. mapException :: (Exception e1, Exception e2, MonadCatch m) => (e1 -> e2) -> m a -> m a

    servant-exceptions-server Servant.Exception.Server

    Catch and rethrow using mapping function f.

Page 353 of many | Previous | Next