Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. (<$>?) :: BEncode a => (Maybe a -> b) -> BKey -> Get b

   bencoding	Data.BEncode

   Shorthand for: f <$> optional (field (req k)).

2. (~$$~) :: b -> a -> (a -> b -> r) -> r

   between	Data.Function.Between.Lazy

   Infix version of common pattern:

   \f -> a `f` b     -- Notice the order of 'a' and 'b'.
   

   Since version 0.11.0.0.

3. (~$~) :: a -> b -> (a -> b -> r) -> r

   between	Data.Function.Between.Lazy

   Infix version of common pattern:

   \f -> a `f` b
   

   Where a and b are fixed parameters. There is also prefix version named inbetween. Since version 0.11.0.0.

4. (~$$~) :: b -> a -> (a -> b -> r) -> r

   between	Data.Function.Between.Strict

   Infix version of common pattern:

   \f -> (f $! a) $! b   -- Notice the order of 'a' and 'b'.
   

   Since version 0.11.0.0.

5. (~$~) :: a -> b -> (a -> b -> r) -> r

   between	Data.Function.Between.Strict

   Infix version of common pattern:

   \f -> (f $! a) $! b
   

   Where a and b are fixed parameters. There is also prefix version named inbetween. Since version 0.11.0.0.

6. (<$) :: Functor f => a -> f b -> f a

   classy-prelude-yesod	ClassyPrelude.Yesod

   Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

   Examples

   Perform a computation with Maybe and replace the result with a constant value if it is Just:

   >>> 'a' <$ Just 2
   Just 'a'
   
   >>> 'a' <$ Nothing
   Nothing
   

7. (<$>) :: Functor f => (a -> b) -> f a -> f b

   classy-prelude-yesod	ClassyPrelude.Yesod

   An infix synonym for fmap. The name of this operator is an allusion to $. Note the similarities between their types:

   ($)  ::              (a -> b) ->   a ->   b
   (<$>) :: Functor f => (a -> b) -> f a -> f b
   

   Whereas $ is function application, <$> is function application lifted over a Functor.

   Examples

   Convert from a Maybe Int to a Maybe String using show:

   >>> show <$> Nothing
   Nothing
   

   >>> show <$> Just 3
   Just "3"
   

   Convert from an Either Int Int to an Either Int String using show:

   >>> show <$> Left 17
   Left 17
   

   >>> show <$> Right 17
   Right "17"
   

   Double each element of a list:

   >>> (*2) <$> [1,2,3]
   [2,4,6]
   

   Apply even to the second element of a pair:

   >>> even <$> (2,2)
   (2,True)
   

8. (=$) :: forall (m :: Type -> Type) a b c r . Monad m => Conduit a m b -> ConduitT b c m r -> ConduitT a c m r

   classy-prelude-yesod	ClassyPrelude.Yesod

   A synonym for =$= for backwards compatibility. Since 0.4.0

9. (=$$+) :: forall (m :: Type -> Type) a b r . Monad m => ConduitT a b m () -> ConduitT b Void m r -> ConduitT a Void m (SealedConduitT a b m (), r)

   classy-prelude-yesod	ClassyPrelude.Yesod

   The connect-and-resume operator. This does not close the Conduit, but instead returns it to be used again. This allows a Conduit to be used incrementally in a large program, without forcing the entire program to live in the Sink monad. Leftover data returned from the Sink will be discarded. Mnemonic: connect + do more. Since 1.0.17

10. (=$$++) :: forall (m :: Type -> Type) i o r . Monad m => SealedConduitT i o m () -> ConduitT o Void m r -> ConduitT i Void m (SealedConduitT i o m (), r)

    classy-prelude-yesod	ClassyPrelude.Yesod

    Continue processing after usage of =$$+. Connect a SealedConduitT to a sink and return the output of the sink together with a new SealedConduitT. Since 1.0.17

Page 78 of many | Previous | Next