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. atLeastMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.Base

   At least n times. Minimal, i.e. biased towards matching less.

2. atMostMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.Base

   At most n times. Minimal, i.e. biased towards matching less.

3. atLeastMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.Internal.Regex

   At least n times. Minimal, i.e. biased towards matching less.

4. atMostMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.Internal.Regex

   At most n times. Minimal, i.e. biased towards matching less.

5. atLeastMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.List

   At least n times. Minimal, i.e. biased towards matching less.

6. atMostMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.List

   At most n times. Minimal, i.e. biased towards matching less.

7. manyListMin :: RE c [c]

   parser-regex	Regex.List

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

8. someListMin :: RE c [c]

   parser-regex	Regex.List

   Parse any non-empty String. Minimal, i.e. biased towards matching less.

9. atLeastMin :: Int -> RE c a -> RE c [a]

   parser-regex	Regex.Text

   At least n times. Minimal, i.e. biased towards matching less.

10. atMostMin :: Int -> RE c a -> RE c [a]

    parser-regex	Regex.Text

    At most n times. Minimal, i.e. biased towards matching less.

Page 195 of many | Previous | Next