Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. map :: Monoid b => (a -> b) -> Path a -> Path b

   lca	Data.LCA.Online.Monoidal

   O(n) Re-annotate a Path full of monoidal values using a different Monoid.

2. map :: (a -> b) -> [a] -> [b]

   listsafe	Data.List.Safe

   map f xs is the list obtained by applying f to each element of xs, i.e.,

   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
   map f [x1, x2, ...] == [f x1, f x2, ...]
   

   this means that map id == id

   Examples

   >>> map (+1) [1, 2, 3]
   [2,3,4]
   

   >>> map id [1, 2, 3]
   [1,2,3]
   

   >>> map (\n -> 3 * n + 1) [1, 2, 3]
   [4,7,10]
   

3. map :: (Num prob, Ord b) => (a -> b) -> T prob a -> T prob b

   probability	Numeric.Probability.Distribution

   fmap with normalization

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

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

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

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

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

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

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

Page 46 of many | Previous | Next