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. mapEither :: forall s k a b c . Hashable k => (a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

   refined-containers	Data.HashMap.Strict.Refined

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

2. mapEitherWithKey :: forall s k a b c . Hashable k => (Key s k -> a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

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

3. mapKeys :: forall s k1 k2 a . Hashable k2 => (Key s k1 -> k2) -> HashMap s k1 a -> SomeHashMapWith (MapProof 'Hashed s k1 k2) k2 a

   refined-containers	Data.HashMap.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 is picked in an unspecified way.

4. mapKeysWith :: forall s k1 k2 a . Hashable k2 => (a -> a -> a) -> (Key s k1 -> k2) -> HashMap s k1 a -> SomeHashMapWith (MapProof 'Hashed s k1 k2) k2 a

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

5. mapMaybe :: forall s k a b . (a -> Maybe b) -> HashMap s k a -> SomeHashMapWith (SupersetProof 'Hashed s) k b

   refined-containers	Data.HashMap.Strict.Refined

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

6. mapMaybeWithKey :: (Key s k -> a -> Maybe b) -> HashMap s k a -> SomeHashMapWith (SupersetProof 'Hashed s) k b

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

7. mapWithKey :: (Key s k -> a -> b) -> HashMap s k a -> HashMap s k b

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

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

   refined-containers	Data.IntMap.Refined

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

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

   refined-containers	Data.IntMap.Refined

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

10. mapEither :: forall s a b c . (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 and collect the Left and Right results into separate (disjoint) maps.

Page 346 of many | Previous | Next