Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapKeys :: (Key s -> Int) -> IntMap s a -> SomeIntMapWith (MapProof 'Int s Int Int) a

   refined-containers	Data.IntMap.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 a . (a -> a -> a) -> (Key s -> Int) -> IntMap s a -> SomeIntMapWith (MapProof 'Int s Int Int) a

   refined-containers	Data.IntMap.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 a b . (a -> Maybe b) -> IntMap s a -> SomeIntMapWith (SupersetProof 'Int s) b

   refined-containers	Data.IntMap.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 -> a -> Maybe b) -> IntMap s a -> SomeIntMapWith (SupersetProof 'Int s) b

   refined-containers	Data.IntMap.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 -> a -> b) -> IntMap s a -> IntMap s b

   refined-containers	Data.IntMap.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. mapAccumLWithKey :: forall s k a b c . (a -> Key s k -> b -> (a, c)) -> a -> Map s k b -> (a, Map s k c)

   refined-containers	Data.Map.Refined

   Thread an accumularing argument through the map in ascending order of keys.

7. mapAccumRWithKey :: forall s k a b c . (a -> Key s k -> b -> (a, c)) -> a -> Map s k b -> (a, Map s k c)

   refined-containers	Data.Map.Refined

   Thread an accumularing argument through the map in descending order of keys.

8. mapEither :: forall s k a b c . Ord k => (a -> Either b c) -> Map s k a -> Some2MapWith (PartitionProof 'Regular s k) k b c

   refined-containers	Data.Map.Refined

   Apply a function to all values in a map and collect the Left and Right results into separate (disjoint) maps.

9. mapEitherWithKey :: forall s k a b c . Ord k => (Key s k -> a -> Either b c) -> Map s k a -> Some2MapWith (PartitionProof 'Regular s k) k b c

   refined-containers	Data.Map.Refined

   Apply a function to all values in a map, together with their corresponding keys, and collect the Left and Right results into separate (disjoint) maps.

10. 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.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.

Page 348 of many | Previous | Next