incremental-parser 0.3.1.1 → 0.3.2
raw patch · 2 files changed
+6/−2 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Text.ParserCombinators.Incremental: instance (GHC.Base.Monoid s, Data.Semigroup.Semigroup r) => Data.Semigroup.Semigroup (Text.ParserCombinators.Incremental.Parser t s r)
- Text.ParserCombinators.Incremental: instance (GHC.Base.Monoid s, GHC.Base.Monoid r, Data.Semigroup.Semigroup r) => GHC.Base.Monoid (Text.ParserCombinators.Incremental.Parser t s r)
+ Text.ParserCombinators.Incremental: instance (GHC.Base.Monoid s, GHC.Base.Monoid r, GHC.Base.Semigroup r) => GHC.Base.Monoid (Text.ParserCombinators.Incremental.Parser t s r)
+ Text.ParserCombinators.Incremental: instance (GHC.Base.Monoid s, GHC.Base.Semigroup r) => GHC.Base.Semigroup (Text.ParserCombinators.Incremental.Parser t s r)
+ Text.ParserCombinators.Incremental: instance GHC.Base.Monoid s => Control.Monad.Fail.MonadFail (Text.ParserCombinators.Incremental.Parser t s)
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: (+<*>) :: MonoidApplicative f => f (a -> a) -> f a -> f a
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: (<<|>) :: Monoid s => Parser t s r -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: (<?>) :: Monoid s => Parser t s r -> String -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: (<||>) :: Parser t s r -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: (><) :: (MonoidApplicative f, Semigroup a) => f a -> f a -> f a
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: acceptAll :: (Semigroup s, Monoid s) => Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: and :: (Monoid s, Monoid r1, Monoid r2) => Parser t s r1 -> Parser t s r2 -> Parser t s (r1, r2)
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: andThen :: (Monoid s, Monoid r1, Monoid r2) => Parser t s r1 -> Parser t s r2 -> Parser t s (r1, r2)
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: anyToken :: FactorialMonoid s => Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: completeResults :: Parser t s r -> [(r, s)]
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: concatMany :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: concatSome :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: count :: (Monoid s, Monoid r, Semigroup r) => Int -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: defaultMany :: (Monoid s, Alternative (Parser t s)) => Parser t s r -> Parser t s [r]
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: defaultSome :: (Monoid s, Alternative (Parser t s)) => Parser t s r -> Parser t s [r]
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: eof :: (MonoidNull s, Monoid r, Semigroup r) => Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: failure :: Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: feed :: Monoid s => s -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: feedEof :: Monoid s => Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: infix 0 <?>
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: infixl 3 <<|>
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: infixl 4 +<*>
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: infixl 5 ><
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: inspect :: Parser t s r -> ([(r, s)], Maybe (Maybe (r -> r), Parser t s r))
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: isInfallible :: Parser t s r -> Bool
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: lookAhead :: Monoid s => Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: manyTill :: (Monoid s, Monoid r, Semigroup r) => Parser t s r -> Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s b
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: mapType :: (Parser t s r -> Parser b s r) -> Parser t s r -> Parser b s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: moptional :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: more :: (s -> Parser t s r) -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: notFollowedBy :: (Monoid s, Monoid r) => Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: resultPrefix :: Monoid r => Parser t s r -> (r, Parser t s r)
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: results :: Monoid r => Parser t s r -> ([(r, s)], Maybe (r, Parser t s r))
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: satisfy :: FactorialMonoid s => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: satisfyChar :: TextualMonoid s => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: showWith :: (Monoid s, Monoid r, Show s) => ((s -> Parser t s r) -> String) -> (r -> String) -> Parser t s r -> String
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: skip :: (Monoid s, Monoid r, Semigroup r) => Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: string :: (LeftReductiveMonoid s, MonoidNull s, Semigroup s) => s -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: takeCharsWhile :: (TextualMonoid s, MonoidNull s) => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: takeCharsWhile1 :: (TextualMonoid s, MonoidNull s) => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: takeWhile :: (FactorialMonoid s, MonoidNull s) => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: takeWhile1 :: (FactorialMonoid s, MonoidNull s) => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.LeftBiasedLocal: token :: (Eq s, FactorialMonoid s) => s -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: (+<*>) :: MonoidApplicative f => f (a -> a) -> f a -> f a
+ Text.ParserCombinators.Incremental.Symmetric: (<<|>) :: Monoid s => Parser t s r -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: (<?>) :: Monoid s => Parser t s r -> String -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: (<||>) :: Parser t s r -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: (><) :: (MonoidApplicative f, Semigroup a) => f a -> f a -> f a
+ Text.ParserCombinators.Incremental.Symmetric: acceptAll :: (Semigroup s, Monoid s) => Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: and :: (Monoid s, Monoid r1, Monoid r2) => Parser t s r1 -> Parser t s r2 -> Parser t s (r1, r2)
+ Text.ParserCombinators.Incremental.Symmetric: andThen :: (Monoid s, Monoid r1, Monoid r2) => Parser t s r1 -> Parser t s r2 -> Parser t s (r1, r2)
+ Text.ParserCombinators.Incremental.Symmetric: anyToken :: FactorialMonoid s => Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: completeResults :: Parser t s r -> [(r, s)]
+ Text.ParserCombinators.Incremental.Symmetric: concatMany :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.Symmetric: concatSome :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.Symmetric: count :: (Monoid s, Monoid r, Semigroup r) => Int -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: defaultMany :: (Monoid s, Alternative (Parser t s)) => Parser t s r -> Parser t s [r]
+ Text.ParserCombinators.Incremental.Symmetric: defaultSome :: (Monoid s, Alternative (Parser t s)) => Parser t s r -> Parser t s [r]
+ Text.ParserCombinators.Incremental.Symmetric: eof :: (MonoidNull s, Monoid r, Semigroup r) => Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: failure :: Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: feed :: Monoid s => s -> Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: feedEof :: Monoid s => Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: infix 0 <?>
+ Text.ParserCombinators.Incremental.Symmetric: infixl 3 <<|>
+ Text.ParserCombinators.Incremental.Symmetric: infixl 4 +<*>
+ Text.ParserCombinators.Incremental.Symmetric: infixl 5 ><
+ Text.ParserCombinators.Incremental.Symmetric: inspect :: Parser t s r -> ([(r, s)], Maybe (Maybe (r -> r), Parser t s r))
+ Text.ParserCombinators.Incremental.Symmetric: isInfallible :: Parser t s r -> Bool
+ Text.ParserCombinators.Incremental.Symmetric: lookAhead :: Monoid s => Parser t s r -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: manyTill :: (Monoid s, Monoid r, Semigroup r) => Parser t s r -> Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: mapIncremental :: (Monoid s, Monoid a, Monoid b) => (a -> b) -> Parser p s a -> Parser p s b
+ Text.ParserCombinators.Incremental.Symmetric: mapType :: (Parser t s r -> Parser b s r) -> Parser t s r -> Parser b s r
+ Text.ParserCombinators.Incremental.Symmetric: moptional :: (MonoidAlternative f, Semigroup a, Monoid a) => f a -> f a
+ Text.ParserCombinators.Incremental.Symmetric: more :: (s -> Parser t s r) -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: notFollowedBy :: (Monoid s, Monoid r) => Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: resultPrefix :: Monoid r => Parser t s r -> (r, Parser t s r)
+ Text.ParserCombinators.Incremental.Symmetric: results :: Monoid r => Parser t s r -> ([(r, s)], Maybe (r, Parser t s r))
+ Text.ParserCombinators.Incremental.Symmetric: satisfy :: FactorialMonoid s => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: satisfyChar :: TextualMonoid s => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: showWith :: (Monoid s, Monoid r, Show s) => ((s -> Parser t s r) -> String) -> (r -> String) -> Parser t s r -> String
+ Text.ParserCombinators.Incremental.Symmetric: skip :: (Monoid s, Monoid r, Semigroup r) => Parser t s r' -> Parser t s r
+ Text.ParserCombinators.Incremental.Symmetric: string :: (LeftReductiveMonoid s, MonoidNull s, Semigroup s) => s -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: takeCharsWhile :: (TextualMonoid s, MonoidNull s) => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: takeCharsWhile1 :: (TextualMonoid s, MonoidNull s) => (Char -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: takeWhile :: (FactorialMonoid s, MonoidNull s) => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: takeWhile1 :: (FactorialMonoid s, MonoidNull s) => (s -> Bool) -> Parser t s s
+ Text.ParserCombinators.Incremental.Symmetric: token :: (Eq s, FactorialMonoid s) => s -> Parser t s s
Files
Text/ParserCombinators/Incremental.hs view
@@ -49,6 +49,7 @@ import Control.Applicative (Applicative (pure, (<*>), (*>), (<*)), Alternative ((<|>)), (<$>)) import Control.Applicative.Monoid(MonoidApplicative(..), MonoidAlternative(..)) import Control.Monad (ap)+import Control.Monad.Fail (MonadFail(fail)) import Data.Maybe (fromMaybe) import Data.Semigroup (Semigroup(..)) import Data.Monoid (Monoid, mempty, mappend)@@ -155,6 +156,9 @@ Result s r >>= f = feed s (f r) p >>= f = apply (>>= f) p (>>) = (*>)++instance Monoid s => MonadFail (Parser t s) where+ fail = Failure -- | The '+<*>' operator is specialized to return incremental parsing results. instance Monoid s => MonoidApplicative (Parser t s) where
incremental-parser.cabal view
@@ -1,5 +1,5 @@ Name: incremental-parser-Version: 0.3.1.1+Version: 0.3.2 Cabal-Version: >= 1.10 Build-Type: Simple Synopsis: Generic parser library capable of providing partial results from partial input.@@ -28,7 +28,7 @@ Exposed-Modules: Text.ParserCombinators.Incremental, Text.ParserCombinators.Incremental.LeftBiasedLocal, Text.ParserCombinators.Incremental.Symmetric, Control.Applicative.Monoid- Build-Depends: base < 5, monoid-subclasses < 0.5+ Build-Depends: base >= 4.9 && < 5, monoid-subclasses < 0.5 if impl(ghc >= 7.0.0) default-language: Haskell2010