FlatParse.Internal

Documentation

shortInteger :: Int# -> Integer

isDigit :: Char -> Bool

isDigit c = '0' <= c && c <= '9'

isLatinLetter :: Char -> Bool

isLatinLetter c = ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z')

isGreekLetter :: Char -> Bool

isGreekLetter c = ('Α' <= c && c <= 'Ω') || ('α' <= c && c <= 'ω')

mul10 :: Int# -> Int#

readInt' :: Int# -> Addr# -> Addr# -> (# Int#, Addr# #)

readInt :: Addr# -> Addr# -> (# (# #) | (# Int#, Addr# #) #)

Read an Int from the input, as a non-empty digit sequence. The Int may overflow in the result.

readInteger :: ForeignPtrContents -> Addr# -> Addr# -> (# (# #) | (# Integer, Addr# #) #)

Read an Integer from the input, as a non-empty digit sequence.

newtype Pos

Byte offset counted backwards from the end of the buffer.

Constructors

Pos Int

Instances

Eq Pos

Defined in FlatParse.Internal

Methods

(==) :: Pos -> Pos -> Bool

(/=) :: Pos -> Pos -> Bool

Ord Pos

Defined in FlatParse.Internal

Methods

compare :: Pos -> Pos -> Ordering

(<) :: Pos -> Pos -> Bool

(<=) :: Pos -> Pos -> Bool

(>) :: Pos -> Pos -> Bool

(>=) :: Pos -> Pos -> Bool

max :: Pos -> Pos -> Pos

min :: Pos -> Pos -> Pos

Show Pos

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Pos -> ShowS

show :: Pos -> String

showList :: [Pos] -> ShowS

data Span

A pair of positions.

Constructors

Span !Pos !Pos

Instances

Eq Span

Defined in FlatParse.Internal

Methods

(==) :: Span -> Span -> Bool

(/=) :: Span -> Span -> Bool

Show Span

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Span -> ShowS

show :: Span -> String

showList :: [Span] -> ShowS

addrToPos# :: Addr# -> Addr# -> Pos

posToAddr# :: Addr# -> Pos -> Addr#

unsafeSlice :: ByteString -> Span -> ByteString

Slice into a ByteString using a Span. The result is invalid if the Span is not a valid slice of the first argument.

packUTF8 :: String -> ByteString

Convert a String to an UTF-8-coded ByteString.

charToBytes :: Char -> [Word]

strToBytes :: String -> [Word]

packBytes :: [Word] -> Word

splitBytes :: [Word] -> ([Word], [Word])

derefChar8# :: Addr# -> Char#

data Trie a

Constructors

Branch !a !(Map Word (Trie a))

Instances

Show a => Show (Trie a)

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Trie a -> ShowS

show :: Trie a -> String

showList :: [Trie a] -> ShowS

type Rule = Maybe Int

nilTrie :: Trie Rule

updRule :: Int -> Maybe Int -> Maybe Int

insert :: Int -> [Word] -> Trie Rule -> Trie Rule

listToTrie :: [(Int, String)] -> Trie Rule

mindepths :: Trie Rule -> Trie (Rule, Int)

Decorate a trie with the minimum lengths of non-empty paths. This is used later to place ensureBytes#.

data Trie' a

Constructors

Branch' !a !(Map Word (Trie' a))

Path !a ![Word] !(Trie' a)

Instances

Show a => Show (Trie' a)

Defined in FlatParse.Internal

Methods

showsPrec :: Int -> Trie' a -> ShowS

show :: Trie' a -> String

showList :: [Trie' a] -> ShowS

pathify :: Trie (Rule, Int) -> Trie' (Rule, Int)

Compress linear paths.

fallbacks :: Trie' (Rule, Int) -> Trie' (Rule, Int, Int)

Compute where to fall back after we exhausted a branch. If the branch is empty, that means we've succeded at reading and we jump to the rhs rule.

ensureBytes :: Trie' (Rule, Int, Int) -> Trie' (Rule, Int, Maybe Int)

Decorate with ensureBytes# invocations, represented as `Maybe Int`.

compileTrie :: [(Int, String)] -> Trie' (Rule, Int, Maybe Int)