Pinchot.Intervals

Intervals describe terminal symbols. Ordinarily you will not need to use this module, as Pinchot re-exports the things you usually need.

Documentation

data Intervals a

Groups of terminals. Create an Intervals using include, exclude, solo and pariah. Combine Intervals using mappend, which will combine both the included and excluded terminal symbols from each operand.

Constructors

Intervals

Fields

• _included :: Seq (a, a)

  Each pair (a, b) is an inclusive range of terminal symbols, in order. For instance, (a, c) includes the characters a, b, and c. The included sequence contains all terminals that are included in the Intervals, except for those that are excluded.

• _excluded :: Seq (a, a)

  Each symbol in excluded is not in the Intervals, even if the symbol is included.

Instances

Functor Intervals

Methods

fmap :: (a -> b) -> Intervals a -> Intervals b

(<$) :: a -> Intervals b -> Intervals a

Eq a => Eq (Intervals a)

Methods

(==) :: Intervals a -> Intervals a -> Bool

(/=) :: Intervals a -> Intervals a -> Bool

Data a => Data (Intervals a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Intervals a -> c (Intervals a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Intervals a)

toConstr :: Intervals a -> Constr

dataTypeOf :: Intervals a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Intervals a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Intervals a))

gmapT :: (forall b. Data b => b -> b) -> Intervals a -> Intervals a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Intervals a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Intervals a -> r

gmapQ :: (forall d. Data d => d -> u) -> Intervals a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Intervals a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Intervals a -> m (Intervals a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Intervals a -> m (Intervals a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Intervals a -> m (Intervals a)

Ord a => Ord (Intervals a)

Methods

compare :: Intervals a -> Intervals a -> Ordering

(<) :: Intervals a -> Intervals a -> Bool

(<=) :: Intervals a -> Intervals a -> Bool

(>) :: Intervals a -> Intervals a -> Bool

(>=) :: Intervals a -> Intervals a -> Bool

max :: Intervals a -> Intervals a -> Intervals a

min :: Intervals a -> Intervals a -> Intervals a

Show a => Show (Intervals a)

Methods

showsPrec :: Int -> Intervals a -> ShowS

show :: Intervals a -> String

showList :: [Intervals a] -> ShowS

Monoid (Intervals a)

Methods

mempty :: Intervals a

mappend :: Intervals a -> Intervals a -> Intervals a

mconcat :: [Intervals a] -> Intervals a

Lift a => Lift (Intervals a)

Methods

lift :: Intervals a -> Q Exp

PrettyVal a => PrettyVal (Intervals a)

Methods

prettyVal :: Intervals a -> Value

listValue :: [Intervals a] -> Value

included :: forall a. Lens' (Intervals a) (Seq (a, a))

excluded :: forall a. Lens' (Intervals a) (Seq (a, a))

include :: a -> a -> Intervals a

Include a range of symbols in the Intervals. For instance, to include the characters a, b, and c, use include a c. Example: rLetter.

exclude :: a -> a -> Intervals a

Exclude a range of symbols in the Intervals. Each symbol that is excluded is not included in the Intervals, even if it is also included.

solo :: a -> Intervals a

Include a single symbol. Example: rNorth.

pariah :: a -> Intervals a

Exclude a single symbol.

endLeft :: Ord a => (a, a) -> a

Left endpoint.

endRight :: Ord a => (a, a) -> a

Right endpoint.

inInterval :: Ord a => a -> (a, a) -> Bool

Is this symbol included in the interval?

members :: (Ord a, Enum a) => (a, a) -> Seq a

Enumerate all members of an interval.

sortIntervalSeq :: Ord a => Seq (a, a) -> Seq (a, a)

Sort a sequence of intervals.

standardizeInterval :: Ord a => (a, a) -> (a, a)

Arrange an interval so the lower bound is first in the pair.

standardizeIntervalSeq :: (Ord a, Enum a) => Seq (a, a) -> Seq (a, a)

Sorts the intervals using sortIntervalSeq and presents them in a regular order using flatten. The function standardizeIntervalSeq a has the following properties, where b is the result:

uniqueMembers a == uniqueMembers b

let go [] = True
    go (_:[]) = True
    go (x:y:xs)
         | endRight x < endLeft y
             && endRight x < pred (endLeft x)
             = go (y:xs)
         | otherwise = False
in go b

The second property means that adjacent intervals in the list must be separated by at least one point on the number line.

flattenIntervalSeq :: (Ord a, Enum a) => Seq (a, a) -> Seq (a, a)

Presents the intervals in a standard order, as described in standardizeIntervalSeq. If the input has already been sorted with sortIntervalSeq, the same properties for standardizeIntervalSeq hold for this function. Otherwise, its properties are undefined.

removeExcludes

Arguments

:: (Ord a, Enum a)

=> Seq (a, a)

Included intervals (not necessarily sorted)

-> Seq (a, a)

Excluded intervals (not necessarily sorted)

-> Seq (a, a)

Removes excluded members from a list of Interval. The following properties hold:

removeProperties
  :: (Ord a, Enum a)
  => Seq (a, a)
  -> Seq (a, a)
  -> [Bool]
removeProperties inc exc =

 let r = removeExcludes inc exc
     allExcluded = concatMap members exc
     allIncluded = concatMap members inc
     allResults = concatMap members r
 in [
   -- intervals remain in original order
   allResults == filter (not . (`elem` allExcluded)) allIncluded

 -- Every resulting member was a member of the original include list
 , all (`elem` allIncluded) allResults

 -- No resulting member is in the exclude list
 , all (not . (`elem` allExcluded)) allResults

 -- Every included member that is not in the exclude list is
 -- in the result
 , all (x -> x `elem` allExcluded || x `elem` allResults)
       allIncluded

 ]

remover

Arguments

:: (Ord a, Enum a)

=> (a, a)

Remove this interval

-> Seq (a, a)

From this sequence of intervals

-> Seq (a, a)

removeInterval

Arguments

:: (Ord a, Enum a)

=> (a, a)

Remove this interval

-> (a, a)

From this interval

-> (Maybe (a, a), Maybe (a, a))

Removes a single interval from a single other interval. Returns a sequence of intervals, which always

standardizeIntervals :: (Ord a, Enum a) => Intervals a -> Intervals a

Runs standardizeIntervalSeq on the included and excluded intervals.

splitIntervals :: (Ord a, Enum a) => Intervals a -> Seq (a, a)

Sorts the intervals using standardizeIntervalSeq, and then removes the excludes with removeExcludes.

inIntervals :: (Enum a, Ord a) => Intervals a -> a -> Bool

True if the given element is a member of the Intervals.

liftSeq :: Lift a => Seq a -> ExpQ