attoparsec 0.13.2.1 → 0.13.2.2
raw patch · 3 files changed
+9/−8 lines, 3 filesdep ~basedep ~semigroupsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, semigroups
API changes (from Hackage documentation)
- Data.Attoparsec.ByteString.Char8: instance a ~ Data.ByteString.Internal.ByteString => Data.String.IsString (Data.Attoparsec.ByteString.Internal.Parser a)
- Data.Attoparsec.Internal.Types: instance Data.Semigroup.Semigroup (Data.Attoparsec.Internal.Types.Parser i a)
- Data.Attoparsec.Internal.Types: instance Data.Semigroup.Semigroup Data.Attoparsec.Internal.Types.More
- Data.Attoparsec.Zepto: instance GHC.Base.Monad m => Data.Semigroup.Semigroup (Data.Attoparsec.Zepto.ZeptoT m a)
+ Data.Attoparsec.ByteString.Char8: instance (a ~ Data.ByteString.Internal.ByteString) => Data.String.IsString (Data.Attoparsec.ByteString.Internal.Parser a)
+ Data.Attoparsec.ByteString.Lazy: (<?>) :: Parser i a -> String -> Parser i a
+ Data.Attoparsec.ByteString.Lazy: anyWord8 :: Parser Word8
+ Data.Attoparsec.ByteString.Lazy: atEnd :: Chunk t => Parser t Bool
+ Data.Attoparsec.ByteString.Lazy: choice :: Alternative f => [f a] -> f a
+ Data.Attoparsec.ByteString.Lazy: compareResults :: (Eq i, Eq r) => IResult i r -> IResult i r -> Maybe Bool
+ Data.Attoparsec.ByteString.Lazy: count :: Monad m => Int -> m a -> m [a]
+ Data.Attoparsec.ByteString.Lazy: eitherP :: (Alternative f) => f a -> f b -> f (Either a b)
+ Data.Attoparsec.ByteString.Lazy: endOfInput :: forall t. Chunk t => Parser t ()
+ Data.Attoparsec.ByteString.Lazy: feed :: Monoid i => IResult i r -> i -> IResult i r
+ Data.Attoparsec.ByteString.Lazy: inClass :: String -> Word8 -> Bool
+ Data.Attoparsec.ByteString.Lazy: infix 0 <?>
+ Data.Attoparsec.ByteString.Lazy: many' :: (MonadPlus m) => m a -> m [a]
+ Data.Attoparsec.ByteString.Lazy: many1 :: Alternative f => f a -> f [a]
+ Data.Attoparsec.ByteString.Lazy: many1' :: (MonadPlus m) => m a -> m [a]
+ Data.Attoparsec.ByteString.Lazy: manyTill :: Alternative f => f a -> f b -> f [a]
+ Data.Attoparsec.ByteString.Lazy: manyTill' :: (MonadPlus m) => m a -> m b -> m [a]
+ Data.Attoparsec.ByteString.Lazy: match :: Parser a -> Parser (ByteString, a)
+ Data.Attoparsec.ByteString.Lazy: notInClass :: String -> Word8 -> Bool
+ Data.Attoparsec.ByteString.Lazy: notWord8 :: Word8 -> Parser Word8
+ Data.Attoparsec.ByteString.Lazy: option :: Alternative f => a -> f a -> f a
+ Data.Attoparsec.ByteString.Lazy: parseOnly :: Parser a -> ByteString -> Either String a
+ Data.Attoparsec.ByteString.Lazy: peekWord8 :: Parser (Maybe Word8)
+ Data.Attoparsec.ByteString.Lazy: peekWord8' :: Parser Word8
+ Data.Attoparsec.ByteString.Lazy: runScanner :: s -> (s -> Word8 -> Maybe s) -> Parser (ByteString, s)
+ Data.Attoparsec.ByteString.Lazy: satisfy :: (Word8 -> Bool) -> Parser Word8
+ Data.Attoparsec.ByteString.Lazy: satisfyWith :: (Word8 -> a) -> (a -> Bool) -> Parser a
+ Data.Attoparsec.ByteString.Lazy: scan :: s -> (s -> Word8 -> Maybe s) -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: sepBy :: Alternative f => f a -> f s -> f [a]
+ Data.Attoparsec.ByteString.Lazy: sepBy' :: (MonadPlus m) => m a -> m s -> m [a]
+ Data.Attoparsec.ByteString.Lazy: sepBy1 :: Alternative f => f a -> f s -> f [a]
+ Data.Attoparsec.ByteString.Lazy: sepBy1' :: (MonadPlus m) => m a -> m s -> m [a]
+ Data.Attoparsec.ByteString.Lazy: skip :: (Word8 -> Bool) -> Parser ()
+ Data.Attoparsec.ByteString.Lazy: skipMany :: Alternative f => f a -> f ()
+ Data.Attoparsec.ByteString.Lazy: skipMany1 :: Alternative f => f a -> f ()
+ Data.Attoparsec.ByteString.Lazy: skipWhile :: (Word8 -> Bool) -> Parser ()
+ Data.Attoparsec.ByteString.Lazy: string :: ByteString -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: take :: Int -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: takeByteString :: Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: takeLazyByteString :: Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: takeTill :: (Word8 -> Bool) -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: takeWhile :: (Word8 -> Bool) -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: takeWhile1 :: (Word8 -> Bool) -> Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: try :: Parser i a -> Parser i a
+ Data.Attoparsec.ByteString.Lazy: type Parser = Parser ByteString
+ Data.Attoparsec.ByteString.Lazy: word8 :: Word8 -> Parser Word8
+ Data.Attoparsec.Internal.Types: instance GHC.Base.Semigroup (Data.Attoparsec.Internal.Types.Parser i a)
+ Data.Attoparsec.Internal.Types: instance GHC.Base.Semigroup Data.Attoparsec.Internal.Types.More
+ Data.Attoparsec.Text.Lazy: (.*>) :: Text -> Parser a -> Parser a
+ Data.Attoparsec.Text.Lazy: (<*.) :: Parser a -> Text -> Parser a
+ Data.Attoparsec.Text.Lazy: (<?>) :: Parser i a -> String -> Parser i a
+ Data.Attoparsec.Text.Lazy: D :: {-# UNPACK #-} !Double -> Number
+ Data.Attoparsec.Text.Lazy: I :: !Integer -> Number
+ Data.Attoparsec.Text.Lazy: anyChar :: Parser Char
+ Data.Attoparsec.Text.Lazy: asciiCI :: Text -> Parser Text
+ Data.Attoparsec.Text.Lazy: atEnd :: Chunk t => Parser t Bool
+ Data.Attoparsec.Text.Lazy: char :: Char -> Parser Char
+ Data.Attoparsec.Text.Lazy: choice :: Alternative f => [f a] -> f a
+ Data.Attoparsec.Text.Lazy: compareResults :: (Eq i, Eq r) => IResult i r -> IResult i r -> Maybe Bool
+ Data.Attoparsec.Text.Lazy: count :: Monad m => Int -> m a -> m [a]
+ Data.Attoparsec.Text.Lazy: data Number
+ Data.Attoparsec.Text.Lazy: decimal :: Integral a => Parser a
+ Data.Attoparsec.Text.Lazy: digit :: Parser Char
+ Data.Attoparsec.Text.Lazy: double :: Parser Double
+ Data.Attoparsec.Text.Lazy: eitherP :: (Alternative f) => f a -> f b -> f (Either a b)
+ Data.Attoparsec.Text.Lazy: endOfInput :: forall t. Chunk t => Parser t ()
+ Data.Attoparsec.Text.Lazy: endOfLine :: Parser ()
+ Data.Attoparsec.Text.Lazy: feed :: Monoid i => IResult i r -> i -> IResult i r
+ Data.Attoparsec.Text.Lazy: hexadecimal :: (Integral a, Bits a) => Parser a
+ Data.Attoparsec.Text.Lazy: inClass :: String -> Char -> Bool
+ Data.Attoparsec.Text.Lazy: infix 0 <?>
+ Data.Attoparsec.Text.Lazy: isEndOfLine :: Char -> Bool
+ Data.Attoparsec.Text.Lazy: isHorizontalSpace :: Char -> Bool
+ Data.Attoparsec.Text.Lazy: letter :: Parser Char
+ Data.Attoparsec.Text.Lazy: many' :: (MonadPlus m) => m a -> m [a]
+ Data.Attoparsec.Text.Lazy: many1 :: Alternative f => f a -> f [a]
+ Data.Attoparsec.Text.Lazy: many1' :: (MonadPlus m) => m a -> m [a]
+ Data.Attoparsec.Text.Lazy: manyTill :: Alternative f => f a -> f b -> f [a]
+ Data.Attoparsec.Text.Lazy: manyTill' :: (MonadPlus m) => m a -> m b -> m [a]
+ Data.Attoparsec.Text.Lazy: match :: Parser a -> Parser (Text, a)
+ Data.Attoparsec.Text.Lazy: notChar :: Char -> Parser Char
+ Data.Attoparsec.Text.Lazy: notInClass :: String -> Char -> Bool
+ Data.Attoparsec.Text.Lazy: number :: Parser Number
+ Data.Attoparsec.Text.Lazy: option :: Alternative f => a -> f a -> f a
+ Data.Attoparsec.Text.Lazy: parseOnly :: Parser a -> Text -> Either String a
+ Data.Attoparsec.Text.Lazy: peekChar :: Parser (Maybe Char)
+ Data.Attoparsec.Text.Lazy: peekChar' :: Parser Char
+ Data.Attoparsec.Text.Lazy: rational :: Fractional a => Parser a
+ Data.Attoparsec.Text.Lazy: runScanner :: s -> (s -> Char -> Maybe s) -> Parser (Text, s)
+ Data.Attoparsec.Text.Lazy: satisfy :: (Char -> Bool) -> Parser Char
+ Data.Attoparsec.Text.Lazy: satisfyWith :: (Char -> a) -> (a -> Bool) -> Parser a
+ Data.Attoparsec.Text.Lazy: scan :: s -> (s -> Char -> Maybe s) -> Parser Text
+ Data.Attoparsec.Text.Lazy: scientific :: Parser Scientific
+ Data.Attoparsec.Text.Lazy: sepBy :: Alternative f => f a -> f s -> f [a]
+ Data.Attoparsec.Text.Lazy: sepBy' :: (MonadPlus m) => m a -> m s -> m [a]
+ Data.Attoparsec.Text.Lazy: sepBy1 :: Alternative f => f a -> f s -> f [a]
+ Data.Attoparsec.Text.Lazy: sepBy1' :: (MonadPlus m) => m a -> m s -> m [a]
+ Data.Attoparsec.Text.Lazy: signed :: Num a => Parser a -> Parser a
+ Data.Attoparsec.Text.Lazy: skip :: (Char -> Bool) -> Parser ()
+ Data.Attoparsec.Text.Lazy: skipMany :: Alternative f => f a -> f ()
+ Data.Attoparsec.Text.Lazy: skipMany1 :: Alternative f => f a -> f ()
+ Data.Attoparsec.Text.Lazy: skipSpace :: Parser ()
+ Data.Attoparsec.Text.Lazy: skipWhile :: (Char -> Bool) -> Parser ()
+ Data.Attoparsec.Text.Lazy: space :: Parser Char
+ Data.Attoparsec.Text.Lazy: string :: Text -> Parser Text
+ Data.Attoparsec.Text.Lazy: stringCI :: Text -> Parser Text
+ Data.Attoparsec.Text.Lazy: take :: Int -> Parser Text
+ Data.Attoparsec.Text.Lazy: takeLazyText :: Parser Text
+ Data.Attoparsec.Text.Lazy: takeText :: Parser Text
+ Data.Attoparsec.Text.Lazy: takeTill :: (Char -> Bool) -> Parser Text
+ Data.Attoparsec.Text.Lazy: takeWhile :: (Char -> Bool) -> Parser Text
+ Data.Attoparsec.Text.Lazy: takeWhile1 :: (Char -> Bool) -> Parser Text
+ Data.Attoparsec.Text.Lazy: try :: Parser i a -> Parser i a
+ Data.Attoparsec.Text.Lazy: type Parser = Parser Text
+ Data.Attoparsec.Zepto: instance GHC.Base.Monad m => GHC.Base.Semigroup (Data.Attoparsec.Zepto.ZeptoT m a)
- Data.Attoparsec.Internal.Types: Parser :: (forall r. State i -> Pos -> More -> Failure i (State i) r -> Success i (State i) a r -> IResult i r) -> Parser i a
+ Data.Attoparsec.Internal.Types: Parser :: forall r. State i -> Pos -> More -> Failure i (State i) r -> Success i (State i) a r -> IResult i r -> Parser i a
Files
- Data/Attoparsec/Text/Internal.hs +2/−5
- attoparsec.cabal +3/−3
- changelog.md +4/−0
Data/Attoparsec/Text/Internal.hs view
@@ -1,4 +1,4 @@-{-# LANGUAGE BangPatterns, CPP, FlexibleInstances, GADTs, OverloadedStrings,+{-# LANGUAGE BangPatterns, FlexibleInstances, GADTs, OverloadedStrings, Rank2Types, RecordWildCards, TypeFamilies, TypeSynonymInstances #-} {-# OPTIONS_GHC -fno-warn-orphans #-} -- |@@ -65,10 +65,7 @@ , atEnd ) where -#if !MIN_VERSION_base(4,8,0)-import Control.Applicative ((<$>))-#endif-import Control.Applicative ((<|>))+import Control.Applicative ((<|>), (<$>), pure, (*>)) import Control.Monad (when) import Data.Attoparsec.Combinator ((<?>)) import Data.Attoparsec.Internal
attoparsec.cabal view
@@ -1,12 +1,12 @@ name: attoparsec-version: 0.13.2.1+version: 0.13.2.2 license: BSD3 license-file: LICENSE category: Text, Parsing author: Bryan O'Sullivan <bos@serpentine.com>-maintainer: Bryan O'Sullivan <bos@serpentine.com>+maintainer: Bryan O'Sullivan <bos@serpentine.com>, Ben Gamari <ben@smart-cactus.org> stability: experimental-tested-with: GHC == 7.0.1, GHC == 7.2.1, GHC == 7.4.2, GHC ==7.6.3, GHC ==7.8.4, GHC ==7.10.3+tested-with: GHC == 7.0.4, GHC == 7.2.2, GHC == 7.4.2, GHC ==7.6.3, GHC ==7.8.4, GHC ==7.10.3, GHC ==8.0.2, GHC ==8.2.2 synopsis: Fast combinator parsing for bytestrings and text cabal-version: >= 1.8 homepage: https://github.com/bos/attoparsec
changelog.md view
@@ -1,3 +1,7 @@+0.13.2.1++* Improved performance of `Data.Attoparsec.Text.asciiCI`+ 0.13.2.0 * `pure` is now strict in `Position`