attoparsec-0.12.1.2: Fast combinator parsing for bytestrings and text

Copyright | Bryan O'Sullivan 2007-2014
License | BSD3
Maintainer | bos@serpentine.com
Stability | experimental
Portability | unknown
Safe Haskell | None
Language | Haskell98

Data.Attoparsec.Zepto

Description

A tiny, highly specialized combinator parser for `ByteString` strings.

While the main attoparsec module generally performs well, this module is particularly fast for simple non-recursive loops that should not normally result in failed parses.

Warning: on more complex inputs involving recursion or failure, parsers based on this module may be as much as ten times slower than regular attoparsec! You should only use this module when you have benchmarks that prove that its use speeds your code up.

Synopsis

- data Parser a
- parse :: Parser a -> ByteString -> Either String a
- atEnd :: Parser Bool
- string :: ByteString -> Parser ()
- take :: Int -> Parser ByteString
- takeWhile :: (Word8 -> Bool) -> Parser ByteString

# Documentation

data Parser a

A simple parser.

This monad is strict in its state, and the monadic bind operator (`>>=`) evaluates each result to weak head normal form before passing it along.

Instances

Alternative Parser |
Monad Parser |
Functor Parser |
MonadPlus Parser |
Applicative Parser |
Monoid (Parser a) |

parse :: Parser a -> ByteString -> Either String a

Run a parser.

atEnd :: Parser Bool

Indicate whether the end of the input has been reached.

string :: ByteString -> Parser ()

Match a string exactly.

take :: Int -> Parser ByteString

Consume `n` bytes of input.

takeWhile :: (Word8 -> Bool) -> Parser ByteString

Consume input while the predicate returns `True`.