Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. TkMapBegin :: Tokens -> Tokens

   serialise	Codec.Serialise.Encoding

   No documentation available.

2. TkMapLen :: Word -> Tokens -> Tokens

   serialise	Codec.Serialise.Encoding

   No documentation available.

3. encodeMapLen :: Word -> Encoding

   serialise	Codec.Serialise.Encoding

   Encode the length of a Map, used to indicate that the following tokens represent the map values.

4. encodeMapLenIndef :: Encoding

   serialise	Codec.Serialise.Encoding

   Encode a token specifying that this is the beginning of an indefinite map of unknown size. Tokens representing the map are expected afterwords, followed by a break token (see encodeBreak) when the map has ended.

5. foldMapUnion :: forall c a (as :: [Type]) . All c as => Proxy c -> (forall x . c x => x -> a) -> Union as -> a

   servant-client-core	Servant.Client.Core

   Convenience function to apply a function to an unknown union element using a type class. All elements of the union must have instances in the type class, and the function is applied unconditionally. See also: matchUnion.

6. foldMapUnion :: forall c a (as :: [Type]) . All c as => Proxy c -> (forall x . c x => x -> a) -> Union as -> a

   servant-client-core	Servant.Client.Core.HasClient

   Convenience function to apply a function to an unknown union element using a type class. All elements of the union must have instances in the type class, and the function is applied unconditionally. See also: matchUnion.

7. foldMapUnion :: forall c a (as :: [Type]) . All c as => Proxy c -> (forall x . c x => x -> a) -> Union as -> a

   servant-client-core	Servant.Client.Core.Reexport

   Convenience function to apply a function to an unknown union element using a type class. All elements of the union must have instances in the type class, and the function is applied unconditionally. See also: matchUnion.

8. bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d

   streaming	Streaming

   Map over both arguments at the same time.

   bimap f g ≡ first f . second g
   

   Examples

   >>> bimap toUpper (+1) ('j', 3)
   ('J',4)
   

   >>> bimap toUpper (+1) (Left 'j')
   Left 'J'
   

   >>> bimap toUpper (+1) (Right 3)
   Right 4
   

9. foldMap :: (Monad m, Monoid w) => (a -> w) -> Stream (Of a) m r -> m (Of w r)

   streaming	Streaming.Prelude

   Map each element of the stream to a monoid, and take the monoidal sum of the results.

   >>> S.foldMap Sum $ S.take 2 (S.stdinLn)
   1<Enter>
   2<Enter>
   3<Enter>
   Sum {getSum = 6} :> ()
   

10. foldMap_ :: (Monad m, Monoid w) => (a -> w) -> Stream (Of a) m r -> m w

    streaming	Streaming.Prelude

    No documentation available.

Page 522 of many | Previous | Next