some package:parser-combinators

some :: Alternative f => f a -> f [a]

parser-combinators Control.Applicative.Combinators

One or more.

some :: Alternative m => m a -> m (NonEmpty a)

parser-combinators Control.Applicative.Combinators.NonEmpty

some p applies the parser p one or more times and returns a list of the values returned by p.

word = some letter

some :: MonadPlus m => m a -> m [a]

parser-combinators Control.Monad.Combinators

some p applies the parser p one or more times and returns a list of the values returned by p.

word = some letter

some :: MonadPlus m => m a -> m (NonEmpty a)

parser-combinators Control.Monad.Combinators.NonEmpty

some p applies the parser p one or more times and returns a list of the values returned by p.

word = some letter

someTill :: Alternative m => m a -> m end -> m [a]

parser-combinators Control.Applicative.Combinators

someTill p end works similarly to manyTill p end, but p should succeed at least once. end result is consumed and lost. Use someTill_ if you wish to keep it.

someTill p end = liftA2 (:) p (manyTill p end)

See also: skipSome, skipSomeTill.

someTill_ :: Alternative m => m a -> m end -> m ([a], end)

parser-combinators Control.Applicative.Combinators

someTill_ p end works similarly to manyTill_ p end, but p should succeed at least once. Use someTill if you have no need in the result of the end. See also: skipSome, skipSomeTill.

someTill :: Alternative m => m a -> m end -> m (NonEmpty a)

parser-combinators Control.Applicative.Combinators.NonEmpty

someTill p end works similarly to manyTill p end, but p should succeed at least once. See also: skipSome, skipSomeTill.

someTill :: MonadPlus m => m a -> m end -> m [a]

parser-combinators Control.Monad.Combinators

someTill p end works similarly to manyTill p end, but p should succeed at least once. Note that end result is consumed and lost. Use someTill_ if you wish to keep it.

someTill p end = liftM2 (:) p (manyTill p end)