Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. (=$) :: 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-conduit	ClassyPrelude.Conduit

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

2. (=$$+) :: 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-conduit	ClassyPrelude.Conduit

   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

3. (=$$++) :: 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-conduit	ClassyPrelude.Conduit

   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

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

   classy-prelude-conduit	ClassyPrelude.Conduit

   Same as =$$++, but doesn't include the updated SealedConduitT. NOTE In previous versions, this would cause finalizers to run. Since version 1.3.0, there are no finalizers in conduit. Since 1.0.17

5. (=$=) :: 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-conduit	ClassyPrelude.Conduit

   Deprecated fusion operator. Since 0.4.0

6. (<$?>) :: Filtrable f => (a -> Maybe b) -> f a -> f b

   filtrable	Data.Filtrable

   Infix synonym of mapMaybe

7. (!$!) :: SemigroupIn t (AltConst b :: Type -> Type) => (forall x . () => f x -> b) -> (forall x . () => g x -> b) -> t f g a -> b

   functor-combinators	Data.Functor.Combinator

   Infix alias for biget

   -- Return the length of either the list, or the Map, depending on which
   --   one s in the +
   length !$! length
   :: ([] :+: Map Int) Char
   -> Int
   
   -- Return the length of both the list and the map, added together
   Sum . length !$! Sum . length
   :: Day [] (Map Int) Char
   -> Sum Int
   

8. (!$!) :: SemigroupIn t (AltConst b :: Type -> Type) => (forall x . () => f x -> b) -> (forall x . () => g x -> b) -> t f g a -> b

   functor-combinators	Data.HBifunctor.Associative

   Infix alias for biget

   -- Return the length of either the list, or the Map, depending on which
   --   one s in the +
   length !$! length
   :: ([] :+: Map Int) Char
   -> Int
   
   -- Return the length of both the list and the map, added together
   Sum . length !$! Sum . length
   :: Day [] (Map Int) Char
   -> Sum Int
   

9. (:<$>:) :: (b -> a) -> f b -> Post a (f :: Type -> Type) b

   functor-combinators	Data.HFunctor.Route

   No documentation available.

10. (:>$<:) :: (a -> b) -> f b -> Pre a (f :: Type -> Type) b

    functor-combinators	Data.HFunctor.Route

    No documentation available.

Page 65 of many | Previous | Next