| Copyright | © 2017–present Mark Karpov | 
|---|---|
| License | BSD 3 clause | 
| Maintainer | Mark Karpov <markkarpov92@gmail.com> | 
| Stability | experimental | 
| Portability | portable | 
| Safe Haskell | Safe-Inferred | 
| Language | Haskell2010 | 
Control.Monad.Combinators.NonEmpty
Description
The module provides NonEmpty list variants of some of the functions
 from Control.Monad.Combinators.
Since: 0.4.0
Documentation
some :: MonadPlus m => m a -> m (NonEmpty a) #
some pp one or more times and returns a
 list of the values returned by p.
word = some letter
endBy1 :: MonadPlus m => m a -> m sep -> m (NonEmpty a) #
endBy1 p sepp, separated and
 ended by sep. Returns a non-empty list of values returned by p.
someTill :: MonadPlus m => m a -> m end -> m (NonEmpty a) #
someTill p endmanyTill p endp
 should succeed at least once.
See also: skipSome, skipSomeTill.