Hoogle Search

Within LTS Haskell 24.57 (ghc-9.10.3)

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

Exact lookup

1. PMany :: forall a1 a a2 c . {-# UNPACK #-} !Unique -> !a1 -> Solo a -> !a2 -> Solo a -> !a2 -> a1 -> Solo a2 -> !a2 -> !Parser c a1 -> Parser c a

   parser-regex	Regex.Internal.Parser

   No documentation available.

2. data Many a

   parser-regex	Regex.Internal.Regex

   A repeating value or a finite list.

3. RMany :: forall a1 a a2 c . !a1 -> Solo a -> !a2 -> Solo a -> !a2 -> a1 -> Solo a2 -> !a2 -> !RE c a1 -> RE c a

   parser-regex	Regex.Internal.Regex

   No documentation available.

4. foldlMany :: (b -> a -> b) -> b -> RE c a -> RE c b

   parser-regex	Regex.Internal.Regex

   Parse many occurences of the given RE. Biased towards matching more. Also see the section "Looping parsers".

5. foldlMany' :: (b -> a -> b) -> b -> RE c a -> RE c b

   parser-regex	Regex.Internal.Regex

   No documentation available.

6. foldlManyMin :: (b -> a -> b) -> b -> RE c a -> RE c b

   parser-regex	Regex.Internal.Regex

   Parse many occurences of the given RE. Minimal, i.e. biased towards matching less.

7. foldlManyMin' :: (b -> a -> b) -> b -> RE c a -> RE c b

   parser-regex	Regex.Internal.Regex

   No documentation available.

8. manyMin :: RE c a -> RE c [a]

   parser-regex	Regex.Internal.Regex

   Zero or more. Minimal, i.e. biased towards matching less.

9. manyr :: RE c a -> RE c (Many a)

   parser-regex	Regex.Internal.Regex

   Zero or more. Biased towards matching more. Also see the section "Looping parsers".

10. toFindMany :: RE c a -> RE c [a]

    parser-regex	Regex.Internal.Regex

    Results in all non-overlapping occurences of the given RE. Always succeeds.

Page 238 of many | Previous | Next