| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Text.Regex.PDeriv.Common
Description
this module contains the defs of common data types and type classes
- data Range = Range !Int !Int
- range :: Int -> Int -> Range
- minRange :: (a, b) -> a
- maxRange :: (a, b) -> b
- type Letter = (Char, Int)
- class PosEpsilon a where
- class IsEpsilon a where
- class IsPhi a where
- class Simplifiable a where
- my_hash :: Int -> Char -> Int
- my_lookup :: Int -> Char -> IntMap [Int] -> [Int]
- data GFlag
- class IsGreedy a where
- nub2 :: [(Int, a)] -> [(Int, a)]
- nub3 :: [(Int, a, Int)] -> [(Int, a, Int)]
- preBinder :: Int
- preBinder_ :: Int
- subBinder :: Int
- mainBinder :: Int
Documentation
(sub)words represent by range type Range = (Int,Int)
class PosEpsilon a where Source #
test for 'epsilon in a' epsilon-possession
Minimal complete definition
Methods
posEpsilon :: a -> Bool Source #
Instances
test for phi == a
Minimal complete definition
class Simplifiable a where Source #
Minimal complete definition
Instances
| Simplifiable RE Source # | |
| Simplifiable Pat Source # | mainly interested in simplifying epsilon, p --> p could be made more optimal, e.g. (epsilon, epsilon) --> epsilon |
The greediness flag
nub2 :: [(Int, a)] -> [(Int, a)] Source #
remove duplications in a list of pairs, using the first components as key.
preBinder_ :: Int Source #
mainBinder :: Int Source #