Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

   parser-regex	Regex.Internal.Regex

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

2. 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".

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

   parser-regex	Regex.Internal.Regex

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

4. manyText :: REText Text

   parser-regex	Regex.Internal.Text

   Parse any Text. Biased towards matching more.

5. manyTextMin :: REText Text

   parser-regex	Regex.Internal.Text

   Parse any Text. Minimal, i.e. biased towards matching less.

6. manyTextOf :: CharSet -> REText Text

   parser-regex	Regex.Internal.Text

   Parse any Text containing members of the CharSet. Biased towards matching more.

7. manyTextOfMin :: CharSet -> REText Text

   parser-regex	Regex.Internal.Text

   Parse any Text containing members of the CharSet. Minimal, i.e. biased towards matching less.

8. data Many a

   parser-regex	Regex.List

   A repeating value or a finite list.

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

   parser-regex	Regex.List

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

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

    parser-regex	Regex.List

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

Page 236 of many | Previous | Next