Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. hasAny :: Eq a => [a] -> [a] -> Bool

    MissingH Data.List.Utils

    Returns true if the given list contains any of the elements in the search list.

  2. fromAny :: String -> Identifier String

    casing Text.Casing

    Convert from anything, including mixed casing.

  3. matchMany :: [(a, FilePattern)] -> [(b, FilePath)] -> [(a, b, [String])]

    filepattern System.FilePattern

    Efficiently match many FilePatterns against many FilePaths in a single operation. Note that the returned matches are not guaranteed to be in any particular order.

    matchMany [(a, pat)] [(b, path)] == maybeToList (map (a,b,) (match pat path))
    

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

    graphviz Data.GraphViz.Parsing

    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.

  5. many1 :: PolyParse p => p a -> p [a]

    graphviz Data.GraphViz.Parsing

    Parse a non-empty list of items.

  6. many1Satisfy :: (Char -> Bool) -> Parser s Text

    graphviz Data.GraphViz.Parsing

    many1Satisfy p is a more efficient fused version of many1 (satisfy p)

  7. manyFinally :: PolyParse p => p a -> p z -> p [a]

    graphviz Data.GraphViz.Parsing

    manyFinally e t parses a possibly-empty sequence of e's, terminated by a t. The final t is discarded. Any parse failures could be due either to a badly-formed terminator or a badly-formed element, so it raises both possible errors.

  8. manyFinally' :: (PolyParse p, Show a) => p a -> p z -> p [a]

    graphviz Data.GraphViz.Parsing

    manyFinally' is like manyFinally, except when the terminator parser overlaps with the element parser. In manyFinally e t, the parser t is tried only when parser e fails, whereas in manyFinally' e t, the parser t is always tried first, then parser e only if the terminator is not found. For instance, manyFinally (accept "01") (accept "0") on input "0101010" returns ["01","01","01"], whereas manyFinally' with the same arguments and input returns [].

  9. manySatisfy :: (Char -> Bool) -> Parser s Text

    graphviz Data.GraphViz.Parsing

    manySatisfy p is a more efficient fused version of many (satisfy p)

  10. decomposeAny :: Ord n => DotGraph n -> Maybe (Context n, DotGraph n)

    graphviz Data.GraphViz.Types.Graph

    As with decompose, but do not specify which node to decompose.

Page 146 of many | Previous | Next