Safe Haskell	None
Language	Haskell2010

Predicate.Util

Contents

TT
BoolT
BoolP
create tree functions
tree manipulation
display options
formatting functions
regular expressions
useful type families
extract values from the type level
printing methods
boolean methods
miscellaneous

Description

Utility methods for Predicate / methods for displaying the evaluation tree

Synopsis

data TT a = TT {
- _tBool :: !(BoolT a)
- _tStrings :: ![String]
- _tForest :: !(Forest PE)
}
tBool :: Lens (TT a) (TT b) (BoolT a) (BoolT b)
tStrings :: Lens' (TT a) [String]
tForest :: Lens' (TT a) (Forest PE)
fixBoolT :: TT Bool -> TT Bool
topMessage :: TT a -> String
topMessage' :: TT a -> String
hasNoTree :: POpts -> Bool
data BoolT a where
- FailT :: !String -> BoolT a
- FalseT :: BoolT Bool
- TrueT :: BoolT Bool
- PresentT :: !a -> BoolT a
_FailT :: Prism' (BoolT a) String
_PresentT :: Prism' (BoolT a) a
_FalseT :: Prism' (BoolT Bool) ()
_TrueT :: Prism' (BoolT Bool) ()
boolT2P :: Lens' (BoolT a) BoolP
data BoolP
data PE = PE BoolP [String]
pStrings :: Lens' PE [String]
pBool :: Lens' PE BoolP
mkNode :: POpts -> BoolT a -> [String] -> [Holder] -> TT a
mkNodeB :: POpts -> Bool -> [String] -> [Holder] -> TT Bool
mkNodeSkipP :: Tree PE
getValAndPE :: TT a -> (Either String a, Tree PE)
getValLRFromTT :: TT a -> Either String a
fromTT :: TT a -> Tree PE
getValueLR :: POpts -> String -> TT a -> [Holder] -> Either (TT x) a
getValueLRHide :: POpts -> String -> TT a -> [Holder] -> Either (TT x) a
fixLite :: forall a. Show a => POpts -> a -> Tree PE -> String
fixit :: ((Int, x), TT a) -> TT a
prefixMsg :: String -> TT a -> TT a
splitAndAlign :: Show x => POpts -> [String] -> [((Int, x), TT a)] -> Either (TT w) [(a, (Int, x), TT a)]
data POpts = POpts {
- oWidth :: !Int
- oDebug :: !ODebug
- oDisp :: !Disp
- oColor :: !(String, PColor)
}
data ODebug
- = OZero
- | OLite
- | OSubNormal
- | ONormal
- | OVerbose
defOpts :: POpts
oz :: POpts
ol :: POpts
olc :: POpts
o0 :: POpts
o2 :: POpts
o2n :: POpts
o3 :: POpts
ou :: POpts
ou3 :: POpts
oun :: POpts
setw :: Int -> POpts -> POpts
setu :: POpts -> POpts
setc :: (String, PColor) -> POpts -> POpts
color0 :: (String, PColor)
color1 :: (String, PColor)
color2 :: (String, PColor)
color3 :: (String, PColor)
color4 :: (String, PColor)
colorMe :: POpts -> BoolP -> String -> String
zero :: POpts -> POpts
lite :: POpts -> POpts
subnormal :: POpts -> POpts
normal :: POpts -> POpts
verbose :: POpts -> POpts
isVerbose :: POpts -> Bool
ansi :: POpts -> POpts
unicode :: POpts -> POpts
showBoolP :: POpts -> BoolP -> String
show01 :: (Show a1, Show a2) => POpts -> String -> a1 -> a2 -> String
lit01 :: Show a1 => POpts -> String -> a1 -> String -> String
show01' :: (Show a1, Show a2) => POpts -> String -> a1 -> String -> a2 -> String
lit01' :: Show a1 => POpts -> String -> a1 -> String -> String -> String
showLit0 :: POpts -> String -> String -> String
showLit1 :: POpts -> String -> String -> String
show0 :: Show a => POpts -> String -> a -> String
show3 :: Show a => POpts -> String -> a -> String
show1 :: Show a => POpts -> String -> a -> String
showL :: Show a => Int -> a -> String
litL :: Int -> String -> String
litBL :: Int -> ByteString -> String
litBS :: Int -> ByteString -> String
data ROpt
- = Anchored
- | Auto_callout
- | Caseless
- | Dollar_endonly
- | Dotall
- | Dupnames
- | Extended
- | Extra
- | Firstline
- | Multiline
- | Newline_cr
- | Newline_crlf
- | Newline_lf
- | No_auto_capture
- | Ungreedy
- | Utf8
- | No_utf8_check
compileRegex :: forall rs a. GetROpts rs => POpts -> String -> String -> [Holder] -> Either (TT a) Regex
class GetROpts (os :: [ROpt]) where
- getROpts :: [PCREOption]
data RReplace
- = RReplace !String
- | RReplace1 (String -> [String] -> String)
- | RReplace2 (String -> String)
- | RReplace3 ([String] -> String)
type family ZwischenT (a :: Nat) (b :: Nat) (v :: Nat) :: Constraint where ...
type family FailWhenT (b :: Bool) (msg :: ErrorMessage) :: Constraint where ...
type family FailUnlessT (b :: Bool) (msg :: ErrorMessage) :: Constraint where ...
type family AndT (b :: Bool) (b1 :: Bool) :: Bool where ...
type family OrT (b :: Bool) (b1 :: Bool) :: Bool where ...
type family NotT (b :: Bool) :: Bool where ...
type family RepeatT (n :: Nat) (p :: k) :: [k] where ...
type family IntersperseT (s :: Symbol) (xs :: [Symbol]) :: Symbol where ...
type family LenT (xs :: [k]) :: Nat where ...
class InductTupleC x where
- type InductTupleP x
- inductTupleC :: x -> InductTupleP x
class InductListC (n :: Nat) a where
- type InductListP n a
- inductListC :: [a] -> InductListP n a
type family FlipT (d :: k1 -> k -> k2) (p :: k) (q :: k1) :: k2 where ...
type family IfT (b :: Bool) (t :: k) (f :: k) :: k where ...
type family SumT (ns :: [Nat]) :: Nat where ...
type family MapT (f :: k -> k1) (xs :: [k]) :: [k1] where ...
type family ConsT s where ...
type family (p :: k -> k1) %% (q :: k) :: k1 where ...
type family (p :: k) %& (q :: k -> k1) :: k1 where ...
type (<%>) s t = AppendSymbol s t
nat :: forall n a. (KnownNat n, Num a) => a
symb :: forall s. KnownSymbol s => String
class GetNats as where
- getNats :: [Int]
class GetSymbs ns where
- getSymbs :: [String]
class GetLen xs where
- getLen :: Int
class GetThese th where
- getThese :: (String, These w v -> Bool)
class GetOrdering (cmp :: Ordering) where
- getOrdering :: Ordering
class GetBool (a :: Bool) where
- getBool :: Bool
data OrderingP
- = CGt
- | CGe
- | CEq
- | CLe
- | CLt
- | CNe
class GetOrd (k :: OrderingP) where
- getOrd :: Ord a => (String, a -> a -> Bool)
prtTTIO :: POpts -> IO (TT a) -> IO ()
prtTT :: POpts -> Identity (TT a) -> IO ()
prtTree :: POpts -> Tree PE -> IO ()
prtTreePure :: POpts -> Tree PE -> String
prettyRational :: Rational -> String
(~>) :: Bool -> Bool -> Bool
data Holder
hh :: TT w -> Holder
showT :: forall (t :: Type). Typeable t => String
prettyOrd :: Ordering -> String
removeAnsi :: Show a => Either String a -> IO ()
class Monad m => MonadEval m where
- runIO :: IO a -> m (Maybe a)
- catchit :: Exception e => a -> m (Either String a)
- catchitNF :: (Exception e, NFData a) => a -> m (Either String a)
- liftEval :: m a -> IO a
errorInProgram :: String -> x
readField :: String -> ReadPrec a -> ReadPrec a
showThese :: These a b -> String

TT

data TT a Source #

represents the evaluation tree for predicates

Constructors

TT
Fields _tBool :: !(BoolT a) the value at this root node _tStrings :: ![String] detailed information eg input and output and text _tForest :: !(Forest PE) the child nodes

Instances

Foldable TT Source #
Instance details Defined in Predicate.Util Methods fold :: Monoid m => TT m -> m # foldMap :: Monoid m => (a -> m) -> TT a -> m # foldr :: (a -> b -> b) -> b -> TT a -> b # foldr' :: (a -> b -> b) -> b -> TT a -> b # foldl :: (b -> a -> b) -> b -> TT a -> b # foldl' :: (b -> a -> b) -> b -> TT a -> b # foldr1 :: (a -> a -> a) -> TT a -> a # foldl1 :: (a -> a -> a) -> TT a -> a # toList :: TT a -> [a] # null :: TT a -> Bool # length :: TT a -> Int # elem :: Eq a => a -> TT a -> Bool # maximum :: Ord a => TT a -> a # minimum :: Ord a => TT a -> a # sum :: Num a => TT a -> a # product :: Num a => TT a -> a #
Show a => Show (TT a) Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> TT a -> ShowS # show :: TT a -> String # showList :: [TT a] -> ShowS #

tBool :: Lens (TT a) (TT b) (BoolT a) (BoolT b) Source #

lens for accessing BoolT in TT

tStrings :: Lens' (TT a) [String] Source #

tForest :: Lens' (TT a) (Forest PE) Source #

fixBoolT :: TT Bool -> TT Bool Source #

fix PresentT Bool to TrueT or FalseT

topMessage :: TT a -> String Source #

topMessage' :: TT a -> String Source #

hasNoTree :: POpts -> Bool Source #

BoolT

data BoolT a where Source #

contains the typed result from evaluating the expression tree

Constructors

FailT :: !String -> BoolT a
FalseT :: BoolT Bool
TrueT :: BoolT Bool
PresentT :: !a -> BoolT a

Instances

Foldable BoolT Source #
Instance details Defined in Predicate.Util Methods fold :: Monoid m => BoolT m -> m # foldMap :: Monoid m => (a -> m) -> BoolT a -> m # foldr :: (a -> b -> b) -> b -> BoolT a -> b # foldr' :: (a -> b -> b) -> b -> BoolT a -> b # foldl :: (b -> a -> b) -> b -> BoolT a -> b # foldl' :: (b -> a -> b) -> b -> BoolT a -> b # foldr1 :: (a -> a -> a) -> BoolT a -> a # foldl1 :: (a -> a -> a) -> BoolT a -> a # toList :: BoolT a -> [a] # null :: BoolT a -> Bool # length :: BoolT a -> Int # elem :: Eq a => a -> BoolT a -> Bool # maximum :: Ord a => BoolT a -> a # minimum :: Ord a => BoolT a -> a # sum :: Num a => BoolT a -> a # product :: Num a => BoolT a -> a #
Eq a => Eq (BoolT a) Source #
Instance details Defined in Predicate.Util Methods (==) :: BoolT a -> BoolT a -> Bool # (/=) :: BoolT a -> BoolT a -> Bool #
Show a => Show (BoolT a) Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> BoolT a -> ShowS # show :: BoolT a -> String # showList :: [BoolT a] -> ShowS #

_FailT :: Prism' (BoolT a) String Source #

_PresentT :: Prism' (BoolT a) a Source #

_FalseT :: Prism' (BoolT Bool) () Source #

_TrueT :: Prism' (BoolT Bool) () Source #

BoolP

boolT2P :: Lens' (BoolT a) BoolP Source #

a lens from typed BoolT to the untyped BoolP

data BoolP Source #

contains the untyped result from evaluating the expression tree

Instances

Eq BoolP Source #
Instance details Defined in Predicate.Util Methods (==) :: BoolP -> BoolP -> Bool # (/=) :: BoolP -> BoolP -> Bool #
Show BoolP Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> BoolP -> ShowS # show :: BoolP -> String # showList :: [BoolP] -> ShowS #

data PE Source #

represents the untyped evaluation tree for final display

Constructors

PE BoolP [String]

Instances

Show PE Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> PE -> ShowS # show :: PE -> String # showList :: [PE] -> ShowS #

pStrings :: Lens' PE [String] Source #

pBool :: Lens' PE BoolP Source #

create tree functions

mkNode :: POpts -> BoolT a -> [String] -> [Holder] -> TT a Source #

creates a Node for the evaluation tree

mkNodeB :: POpts -> Bool -> [String] -> [Holder] -> TT Bool Source #

creates a Boolean node for a predicate type

mkNodeSkipP :: Tree PE Source #

tree manipulation

getValAndPE :: TT a -> (Either String a, Tree PE) Source #

getValLRFromTT :: TT a -> Either String a Source #

fromTT :: TT a -> Tree PE Source #

converts a typed tree to an untyped on for display

getValueLR :: POpts -> String -> TT a -> [Holder] -> Either (TT x) a Source #

see getValueLRImpl : add more detail to the tree if there are errors

getValueLRHide :: POpts -> String -> TT a -> [Holder] -> Either (TT x) a Source #

see getValueLRImpl : add less detail to the tree if there are errors

fixLite :: forall a. Show a => POpts -> a -> Tree PE -> String Source #

fixit :: ((Int, x), TT a) -> TT a Source #

prefixMsg :: String -> TT a -> TT a Source #

splitAndAlign :: Show x => POpts -> [String] -> [((Int, x), TT a)] -> Either (TT w) [(a, (Int, x), TT a)] Source #

extract values from the trees or if there are errors returned a tree with added context

display options

data POpts Source #

customizable options

Constructors

POpts
Fields oWidth :: !Int length of data to display for `showLitImpl` oDebug :: !ODebug debug level oDisp :: !Disp display the tree using the normal tree or unicode oColor :: !(String, PColor) color palette used

Instances

Show POpts Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> POpts -> ShowS # show :: POpts -> String # showList :: [POpts] -> ShowS #

data ODebug Source #

Constructors

OZero	one line summary used mainly for testing
OLite	one line summary with additional context from the head of the evaluation tree
OSubNormal	outputs the evaluation tree but skips noisy subtrees
ONormal	outputs the evaluation tree but skips noisy subtrees
OVerbose	outputs the entire evaluation tree

Instances

Bounded ODebug Source #
Instance details Defined in Predicate.Util Methods minBound :: ODebug # maxBound :: ODebug #
Enum ODebug Source #
Instance details Defined in Predicate.Util Methods succ :: ODebug -> ODebug # pred :: ODebug -> ODebug # toEnum :: Int -> ODebug # fromEnum :: ODebug -> Int # enumFrom :: ODebug -> [ODebug] # enumFromThen :: ODebug -> ODebug -> [ODebug] # enumFromTo :: ODebug -> ODebug -> [ODebug] # enumFromThenTo :: ODebug -> ODebug -> ODebug -> [ODebug] #
Eq ODebug Source #
Instance details Defined in Predicate.Util Methods (==) :: ODebug -> ODebug -> Bool # (/=) :: ODebug -> ODebug -> Bool #
Ord ODebug Source #
Instance details Defined in Predicate.Util Methods compare :: ODebug -> ODebug -> Ordering # (<) :: ODebug -> ODebug -> Bool # (<=) :: ODebug -> ODebug -> Bool # (>) :: ODebug -> ODebug -> Bool # (>=) :: ODebug -> ODebug -> Bool # max :: ODebug -> ODebug -> ODebug # min :: ODebug -> ODebug -> ODebug #
Show ODebug Source #
Instance details Defined in Predicate.Util Methods showsPrec :: Int -> ODebug -> ShowS # show :: ODebug -> String # showList :: [ODebug] -> ShowS #

defOpts :: POpts Source #

oz :: POpts Source #

minimal data without colors

ol :: POpts Source #

returns the summary without colors

olc :: POpts Source #

same as ol but with colors

o0 :: POpts Source #

displays the detailed evaluation tree without colors.

o2 :: POpts Source #

displays the detailed evaluation tree using colors.

o2n :: POpts Source #

same as o2 but for a narrow display

o3 :: POpts Source #

same as o2 for a wider display and verbose debug mode setting

ou :: POpts Source #

displays the detailed evaluation tree using unicode and colors. (o2 works better on Windows)

ou3 :: POpts Source #

same as ou for a wider display and verbose debug mode setting

oun :: POpts Source #

same as ou but for a narrow display

setw :: Int -> POpts -> POpts Source #

helper method to limit the width of the tree

setu :: POpts -> POpts Source #

set display to unicode and colors

setc :: (String, PColor) -> POpts -> POpts Source #

set a color palette

color0 :: (String, PColor) Source #

no colors are displayed

color palettes