Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. encodeMany :: forall (m :: Type -> Type) t . (Coded c, MonadPut m, Foldable t) => t c -> Coding m ()

    bits Data.Bits.Coded

    No documentation available.

  2. manyCharacters :: (Char -> Bool) -> ReadP Text

    burrito Burrito.Internal.Match

    No documentation available.

  3. data ManyUpperBound

    butcher UI.Butcher.Monadic.Command

    Specifies whether we accept 0-1 or 0-n for CmdParserParts.

  4. ManyUpperBound1 :: ManyUpperBound

    butcher UI.Butcher.Monadic.Command

    No documentation available.

  5. ManyUpperBoundN :: ManyUpperBound

    butcher UI.Butcher.Monadic.Command

    No documentation available.

  6. addCmdPartMany :: forall (f :: Type -> Type) p out . (Applicative f, Typeable p) => ManyUpperBound -> PartDesc -> (String -> Maybe (p, String)) -> CmdParser f out [p]

    butcher UI.Butcher.Monadic.Command

    Add part that is not required to occur, and can occur as often as indicated by ManyUpperBound. Must not succeed on empty input.

  7. addCmdPartManyInp :: forall (f :: Type -> Type) p out . (Applicative f, Typeable p) => ManyUpperBound -> PartDesc -> (Input -> Maybe (p, Input)) -> CmdParser f out [p]

    butcher UI.Butcher.Monadic.Command

    Add part that is not required to occur, and can occur as often as indicated by ManyUpperBound. Must not succeed on empty input. Only difference to addCmdPart is that it accepts Input, i.e. can behave differently for String and [String] input.

  8. PartMany :: PartDesc -> PartDesc

    butcher UI.Butcher.Monadic.Types

    No documentation available.

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

    cabal-install-solver Distribution.Solver.Compat.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.

  10. filterIfAny :: (a -> Bool) -> PSQ k a -> PSQ k a

    cabal-install-solver Distribution.Solver.Modular.PSQ

    Will partition the list according to the predicate. If there is any element that satisfies the predicate, then only the elements satisfying the predicate are returned. Otherwise, the rest is returned.

Page 187 of many | Previous | Next