Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mergeMap :: (Mergeable t, CommutativeId m) => (a -> m) -> t a -> mcommutative Data.Mergeable No documentation available.
mergeMap1 :: (Mergeable1 t, Commutative m) => (a -> m) -> t a -> mcommutative Data.Mergeable No documentation available.
-
A read-only memory-efficient key-value store. A read-only key-value store that uses a sorted vector internally
-
No documentation available.
-
compactmap Data.CompactMap No documentation available.
data
CompactMap (vec :: Type -> Type) k vcompactmap Data.CompactMap.Generic No documentation available.
-
conduino Data.Conduino Map over the input type, output type, and upstream result type. If you want to map over the result type, use fmap.
concatMap :: forall t i o u (m :: Type -> Type) . Foldable t => (i -> t o) -> Pipe i o u m uconduino Data.Conduino.Combinators Map a function returning a container onto every incoming item, and yield all of the outputs from that function.
foldMap :: forall a i o u (m :: Type -> Type) . Monoid a => (i -> a) -> Pipe i o u m aconduino Data.Conduino.Combinators Fold every incoming item according to a monoidal projection, and return the result once finished. This can be used to implement many useful consumers, like ones that find the sum or the maximum item:
sum :: Num i => Pipe i o u m i sum = getSum $ foldMap Sum maximum :: Ord i => Pipe i o u m (Maybe i) maximum = fmap getMax $ foldMap (Just . Max)
-
conduino Data.Conduino.Internal Map over the input type, output type, and upstream result type. If you want to map over the result type, use fmap.