Parsley.Internal.Backend.Machine.Types.Coins

This module exposes Coins and the relevant operations. These are used by constant input analysis to side-step unnecessary length checks and character reads (in the case of lookahead).

Since: 1.5.0.0

Documentation

data Coins

Packages together the known input that can be consumed after a length-check with the number of characters that can be rewound on a lookahead backtrack.

Since: 1.5.0.0

Constructors

Coins

Fields

• willConsume :: Int

  The number of tokens we know must be consumed along the path to succeed.

• canReclaim :: Int

  The number of tokens we can reclaim if the parser backtracks.

Instances

Show Coins

Defined in Parsley.Internal.Backend.Machine.Types.Coins

Methods

showsPrec :: Int -> Coins -> ShowS

show :: Coins -> String

showList :: [Coins] -> ShowS

int :: Int -> Coins

Makes a Coins value with equal quantities of coins and characters.

Since: 1.5.0.0

zero :: Coins

Makes a Coins value of 0.

Since: 1.5.0.0

minCoins :: Coins -> Coins -> Coins

Takes the pairwise min of two Coins values.

Since: 1.5.0.0

maxCoins :: Coins -> Coins -> Coins

Takes the pairwise max of two Coins values.

Since: 1.5.0.0

plus1 :: Coins -> Coins

Adds 1 to all the Coins values.

Since: 1.5.0.0

plus :: Coins -> Coins -> Coins

Performs the pairwise addition of two Coins values.

Since: 1.5.0.0

minus :: Coins -> Coins -> Coins

Performs the pairwise subtraction of two Coins values.

Since: 1.5.0.0

plusNotReclaim :: Coins -> Int -> Coins

A verson of plus where the reclaim value remains constant.

Since: 1.5.0.0