You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I understand that according to #163, the implementations of some and many from Alternative are slower than the MonadPlus implementations.
But does anything prevent us from doing this?
instance (Orde, Streams) =>Alternative (ParsecTesm) where
empty = mzero
(<|>)= mplus
some =Control.Monad.Combinators.some
many =Control.Monad.Combinators.many
This way the user would always get the fastest some and many implementations regardless of whether they follow the advice to use Control.Monad.Combinators or not. Am I missing something?
The text was updated successfully, but these errors were encountered:
I understand that according to #163, the implementations of
some
andmany
from Alternative are slower than the MonadPlus implementations.But does anything prevent us from doing this?
This way the user would always get the fastest
some
andmany
implementations regardless of whether they follow the advice to useControl.Monad.Combinators
or not. Am I missing something?The text was updated successfully, but these errors were encountered: