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. ManyReader :: ReaderT r m a -> ManyReader (m :: Type -> Type) r a

   parameterized	Parameterized.Control.Monad.Trans.Reader

   No documentation available.

2. runManyReader :: ManyReader (m :: Type -> Type) r a -> ReaderT r m a

   parameterized	Parameterized.Control.Monad.Trans.Reader

   No documentation available.

3. newtype ManyState (m :: Type -> Type) s a

   parameterized	Parameterized.Control.Monad.Trans.State.Strict

   Given a ManyState that modifies Many a, and another ManyState that modifes Many b make a State that accepts Many (AppendUnique a b) with the compile time constraint that all the types in (AppendUnique a b) are distinct.

4. ManyState :: StateT s m a -> ManyState (m :: Type -> Type) s a

   parameterized	Parameterized.Control.Monad.Trans.State.Strict

   No documentation available.

5. runManyState :: ManyState (m :: Type -> Type) s a -> StateT s m a

   parameterized	Parameterized.Control.Monad.Trans.State.Strict

   No documentation available.

6. data Many a

   parser-regex	Regex.Base

   A repeating value or a finite list.

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

   parser-regex	Regex.Base

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

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

   parser-regex	Regex.Base

   No documentation available.

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

   parser-regex	Regex.Base

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

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

    parser-regex	Regex.Base

    No documentation available.

Page 234 of many | Previous | Next