Hoogle Search

Within LTS Haskell 24.16 (ghc-9.10.3)

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

Exact lookup

1. map :: (Num prob, Ord a) => Change a -> T prob a -> T prob a

   probability	Numeric.Probability.Transition

   map maps a change function to the result of a transformation (map is somehow a lifted form of map) The restricted type of f results from the fact that the argument to t cannot be changed to b in the result T type.

2. map :: forall s k a b . (a -> b) -> HashMap s k a -> HashMap s k b

   refined-containers	Data.HashMap.Refined

   Apply a function to all values in a map. The set of keys remains the same.

3. map :: forall s k a b . (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. The set of keys remains the same.

4. map :: forall s a b . (Hashable b, KnownHashSet s a) => (Element s a -> b) -> SomeHashSetWith (MapProof 'Hashed s a b) b

   refined-containers	Data.HashSet.Refined

   Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

5. map :: forall s a b . (a -> b) -> IntMap s a -> IntMap s b

   refined-containers	Data.IntMap.Refined

   Apply a function to all values in a map. The set of keys remains the same.

6. map :: forall s a b . (a -> b) -> IntMap s a -> IntMap s b

   refined-containers	Data.IntMap.Strict.Refined

   Apply a function to all values in a map. The set of keys remains the same.

7. map :: KnownIntSet s => (Element s -> Int) -> SomeIntSetWith (MapProof 'Int s Int Int)

   refined-containers	Data.IntSet.Refined

   Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

8. map :: forall s k a b . (a -> b) -> Map s k a -> Map s k b

   refined-containers	Data.Map.Refined

   Apply a function to all values in a map. The set of keys remains the same.

9. map :: forall s k a b . (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. The set of keys remains the same.

10. map :: forall s a b . (Ord b, KnownSet s a) => (Element s a -> b) -> SomeSetWith (MapProof 'Regular s a b) b

    refined-containers	Data.Set.Refined

    Apply the given function to each element of the set and collect the results. Note that the resulting set can be smaller.

Page 35 of many | Previous | Next