Hoogle Search

Within LTS Haskell 24.56 (ghc-9.10.3)

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

Exact lookup

1. ManyErrors :: [SomeException] -> ManyErrors

   postgresql-simple	Database.PostgreSQL.Simple.Ok

   No documentation available.

2. Many :: [Action] -> Action

   postgresql-simple	Database.PostgreSQL.Simple.ToField

   Concatenate a series of rendering actions.

3. manyMonoidT :: forall (m :: Type -> Type) a e . (Monad m, Monoid a) => ExceptionalT e m a -> ExceptionalT e m a

   explicit-exception	Control.Monad.Exception.Asynchronous.Lazy

   We advise to use the Endo Monoid when you want to read a series of characters into a list. This means you use the difference lists technique in order to build the list, which is efficient.

   import Data.Monoid (Endo, appEndo, )
   import Control.Exception (try, )
   import qualified Control.Monad.Exception.Synchronous as Sync
   

   fmap (flip appEndo []) $ manyMonoidT (fromSynchronousMonoidT $ fmap (Endo . (:)) $ Sync.fromEitherT $ try getChar)
   

   If you want Lazy IO you must additionally convert getChar to LazyIO monad.

4. manySynchronousT :: Monad m => (m (Exceptional e b) -> m (Exceptional e b)) -> (a -> b -> b) -> b -> ExceptionalT e m a -> m (Exceptional e b)

   explicit-exception	Control.Monad.Exception.Asynchronous.Lazy

   Deprecated: use manyMonoidT with appropriate Monad like LazyIO and result Monoid like Endo instead

5. manyMonoidT :: forall (m :: Type -> Type) a e . (Monad m, Monoid a) => ExceptionalT e m a -> ExceptionalT e m a

   explicit-exception	Control.Monad.Exception.Asynchronous.Strict

   We advise to use the Endo Monoid when you want to read a series of characters into a list. This means you use the difference lists technique in order to build the list, which is efficient.

   import Data.Monoid (Endo, appEndo, )
   import Control.Exception (try, )
   import qualified Control.Monad.Exception.Synchronous as Sync
   

   fmap (flip appEndo []) $ manyMonoidT (fromSynchronousMonoidT $ fmap (Endo . (:)) $ Sync.fromEitherT $ try getChar)
   

   If you want Lazy IO you must additionally convert getChar to LazyIO monad.

6. manySynchronousT :: Monad m => (m (Exceptional e b) -> m (Exceptional e b)) -> (a -> b -> b) -> b -> ExceptionalT e m a -> m (Exceptional e b)

   explicit-exception	Control.Monad.Exception.Asynchronous.Strict

   Deprecated: use manyMonoidT with appropriate Monad like LazyIO and result Monoid like Endo instead

7. manyMonoidT :: forall (m :: Type -> Type) a e0 e1 . (Monad m, Monoid a) => (e0 -> Maybe e1) -> ExceptionalT e0 m a -> ExceptionalT e1 m a

   explicit-exception	Control.Monad.Exception.Synchronous

   No documentation available.

8. manyT :: forall (m :: Type -> Type) e0 e1 a b . Monad m => (e0 -> Maybe e1) -> (a -> b -> b) -> b -> ExceptionalT e0 m a -> ExceptionalT e1 m b

   explicit-exception	Control.Monad.Exception.Synchronous

   Repeat an action until an exception occurs. Initialize the result with empty and add new elements using cons (e.g. [] and (:)). The exception handler decides whether the terminating exception is re-raised (Just) or catched (Nothing).

9. biany :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool

   rio	RIO.Prelude

   Determines whether any element of the structure satisfies its appropriate predicate argument. Empty structures yield False.

   Examples

   Basic usage:

   >>> biany even isDigit (27, 't')
   False
   

   >>> biany even isDigit (27, '8')
   True
   

   >>> biany even isDigit (26, 't')
   True
   

   >>> biany even isDigit (Left 27)
   False
   

   >>> biany even isDigit (Left 26)
   True
   

   >>> biany even isDigit (BiList [27, 53] ['t', '8'])
   True
   

   Empty structures yield False:

   >>> biany even isDigit (BiList [] [])
   False
   

10. many :: Alternative f => f a -> f [a]

    rio	RIO.Prelude

    Zero or more.

    Examples

    >>> many (putStr "la")
    lalalalalalalalala... * goes on forever *
    

    >>> many Nothing
    Just []
    

    >>> take 5 <$> many (Just 1)
    * hangs forever *
    

    Note that this function can be used with Parsers based on Applicatives. In that case many parser will attempt to parse parser zero or more times until it fails.

Page 129 of many | Previous | Next