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. mapEitherWithKey :: (Key s -> a -> Either b c) -> IntMap s a -> Some2IntMapWith (PartitionProof 'Int s Int) b c

   refined-containers	Data.IntMap.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.

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

   refined-containers	Data.IntMap.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.

3. mapKeysWith :: forall s a . (a -> a -> a) -> (Key s -> Int) -> IntMap s a -> SomeIntMapWith (MapProof 'Int s Int Int) a

   refined-containers	Data.IntMap.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.

4. mapMaybe :: forall s a b . (a -> Maybe b) -> IntMap s a -> SomeIntMapWith (SupersetProof 'Int s) b

   refined-containers	Data.IntMap.Refined

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

5. mapMaybeWithKey :: (Key s -> a -> Maybe b) -> IntMap s a -> SomeIntMapWith (SupersetProof 'Int s) b

   refined-containers	Data.IntMap.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.

6. mapWithKey :: (Key s -> a -> b) -> IntMap s a -> IntMap s b

   refined-containers	Data.IntMap.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.

7. mapAccumLWithKey :: forall s a b c . (a -> Key s -> b -> (a, c)) -> a -> IntMap s b -> (a, IntMap s c)

   refined-containers	Data.IntMap.Strict.Refined

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

8. mapAccumRWithKey :: forall s a b c . (a -> Key s -> b -> (a, c)) -> a -> IntMap s b -> (a, IntMap s c)

   refined-containers	Data.IntMap.Strict.Refined

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

9. mapEither :: forall s a b c . (a -> Either b c) -> IntMap s a -> Some2IntMapWith (PartitionProof 'Int s Int) b c

   refined-containers	Data.IntMap.Strict.Refined

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

10. mapEitherWithKey :: (Key s -> a -> Either b c) -> IntMap s a -> Some2IntMapWith (PartitionProof 'Int s Int) b c

    refined-containers	Data.IntMap.Strict.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.

Page 347 of many | Previous | Next