Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. bimapRecovered :: Bimatchable t => (a -> a') -> (b -> b') -> t a b -> t a' b'

   matchable	Data.Bimatchable

   No documentation available.

2. fmapRecovered :: Matchable t => (a -> b) -> t a -> t b

   matchable	Data.Matchable

   Matchable t implies Functor t. It is not recommended to implement fmap through this function, so it is named fmapRecovered but not fmapDefault.

3. parMap :: forall t b (iv :: Type -> Type) p a . (Traversable t, NFData b, ParFuture iv p) => (a -> b) -> t a -> p (t b)

   monad-par-extras	Control.Monad.Par.Combinator

   Applies the given function to each element of a data structure in parallel (fully evaluating the results), and returns a new data structure containing the results.

   parMap f xs = mapM (spawnP . f) xs >>= mapM get
   

   parMap is commonly used for lists, where it has this specialised type:

   parMap :: NFData b => (a -> b) -> [a] -> Par [b]
   

4. parMapM :: forall t b (iv :: Type -> Type) p a . (Traversable t, NFData b, ParFuture iv p) => (a -> p b) -> t a -> p (t b)

   monad-par-extras	Control.Monad.Par.Combinator

   Like parMap, but the function is a Par monad operation.

   parMapM f xs = mapM (spawn . f) xs >>= mapM get
   

5. parMapReduceRange :: forall a (iv :: Type -> Type) p . (NFData a, ParFuture iv p) => InclusiveRange -> (Int -> p a) -> (a -> a -> p a) -> a -> p a

   monad-par-extras	Control.Monad.Par.Combinator

   "Auto-partitioning" version of parMapReduceRangeThresh that chooses the threshold based on the size of the range and the number of processors..

6. parMapReduceRangeThresh :: forall a (iv :: Type -> Type) p . (NFData a, ParFuture iv p) => Int -> InclusiveRange -> (Int -> p a) -> (a -> a -> p a) -> a -> p a

   monad-par-extras	Control.Monad.Par.Combinator

   Computes a binary map/reduce over a finite range. The range is recursively split into two, the result for each half is computed in parallel, and then the two results are combined. When the range reaches the threshold size, the remaining elements of the range are computed sequentially. For example, the following is a parallel implementation of

   foldl (+) 0 (map (^2) [1..10^6])
   

   parMapReduceRangeThresh 100 (InclusiveRange 1 (10^6))
   (\x -> return (x^2))
   (\x y -> return (x+y))
   0
   

7. package monoidmap-internal

   Internal support for monoidmap. Internal support for the monoidmap package.

8. newtype MonoidMap k v

   monoidmap-internal	Data.MonoidMap.Internal

   No documentation available.

9. MonoidMap :: Map k (NonNull v) -> MonoidMap k v

   monoidmap-internal	Data.MonoidMap.Internal

   No documentation available.

10. foldMapWithKey :: Monoid r => (k -> v -> r) -> MonoidMap k v -> r

    monoidmap-internal	Data.MonoidMap.Internal

    Folds over the keys and values in the map using the given monoid. Satisfies the following property:

    foldMapWithKey f m == Map.foldMapWithKey f (toMap m)
    

Page 1074 of many | Previous | Next