Safe Haskell	None
Language	Haskell98

Control.Search.Generator

Documentation

(<@>) :: Search -> Search -> Search Source #

mmap :: (FMonadT t, MonadInfoT t, Monad m, Monad n, MonadInfo m) => (forall x. m x -> n x) -> t m a -> t n a Source #

search :: Search -> String Source #

($==) :: Value -> Value -> Constraint Source #

($/=) :: Value -> Value -> Constraint Source #

($<) :: Value -> Value -> Constraint Source #

($<=) :: Value -> Value -> Constraint Source #

($>) :: Value -> Value -> Constraint Source #

($>=) :: Value -> Value -> Constraint Source #

(@>) :: Value -> Value -> Value Source #

newtype VarId Source #

Constructors

VarId Int

Instances

Eq VarId Source #
Methods (==) :: VarId -> VarId -> Bool # (/=) :: VarId -> VarId -> Bool #
Ord VarId Source #
Methods compare :: VarId -> VarId -> Ordering # (<) :: VarId -> VarId -> Bool # (<=) :: VarId -> VarId -> Bool # (>) :: VarId -> VarId -> Bool # (>=) :: VarId -> VarId -> Bool # max :: VarId -> VarId -> VarId # min :: VarId -> VarId -> VarId #
Show VarId Source #
Methods showsPrec :: Int -> VarId -> ShowS # show :: VarId -> String # showList :: [VarId] -> ShowS #

mapE :: (HookStatsM m, HookStatsM n) => (forall x. m x -> n x) -> Eval m -> Eval n Source #

data Eval m Source #

Constructors

Eval

Fields

structs :: ([Struct], [Struct])
treeState_ :: [(String, Type, Info -> m Statement)]
evalState_ :: [(String, Type, Info -> m Value)]
nextSameH :: Info -> m Statement
nextDiffH :: Info -> m Statement
pushLeftH :: Info -> m Statement
pushRightH :: Info -> m Statement
bodyH :: Info -> m Statement
initH :: Info -> m Statement
addH :: Info -> m Statement
returnH :: Info -> m Statement
failH :: Info -> m Statement
tryH :: Info -> m Statement
tryLH :: Info -> m Statement
startTryH :: Info -> m Statement
intArraysE :: [String]
boolArraysE :: [String]
intVarsE :: [String]
deleteH :: Info -> m Statement
toString :: String
canBranch :: m Bool
complete :: Info -> m Value

inite :: Monad m => [(String, Info -> m Value)] -> Info -> m Statement Source #

seqSwitch :: ReaderM SeqPos m => m a -> m a -> m a Source #

class Monad m => VarInfoM m where Source #

Minimal complete definition

lookupVarInfo, setVarInfo

Methods

lookupVarInfo :: VarId -> m Info Source #

setVarInfo :: VarId -> Info -> m () Source #

Instances

(VarInfoM m, FMonadT t) => VarInfoM (t m) Source #
Methods lookupVarInfo :: VarId -> t m Info Source # setVarInfo :: VarId -> Info -> t m () Source #

type MkEval m = Evalable m => Eval m -> State Int (Eval m) Source #

class (VarInfoM m, HookStatsM m, MonadInfo m, MemoM m, GenModeM m, Functor m) => Evalable m Source #

Instances

(VarInfoM m, HookStatsM m, MonadInfo m, MemoM m, GenModeM m, Functor m) => Evalable m Source #

data SeqPos Source #

Constructors

OutS
FirstS
SecondS

Instances

Show SeqPos Source #
Methods showsPrec :: Int -> SeqPos -> ShowS # show :: SeqPos -> String # showList :: [SeqPos] -> ShowS #

data Search Source #

Constructors

(FMonadT t2, MonadInfoT t2) => Search
Fields mkeval :: forall m t1. (HookStatsM m, MonadInfoT t1, FMonadT t1, Evalable m) => MkEval ((t1 :> t2) m) runsearch :: forall m x. Evalable m => t2 m x -> m x

(@.) :: Monad m => m (a -> b) -> m a -> m b Source #

(@$) :: Monad m => (a -> b) -> m a -> m b Source #

(@>>>@) :: Evalable m => m Statement -> m Statement -> m Statement Source #

ref_count :: Info -> Value Source #

ref_countx :: Info -> [Char] -> Value Source #

ref_count_type :: Type Source #

commentEval :: Evalable m => Eval m -> Eval m Source #

(@++@) :: ([a1], [a2]) -> ([a1], [a2]) -> ([a1], [a2]) Source #

entry :: Monad m => (String, Type, Value -> Statement) -> (String, Type, Info -> m Statement) Source #

numSwitch :: ReaderM t m => (t -> m b) -> m b Source #

data SearchCombiner Source #

Constructors

(FMonadT t1, FMonadT t2, MonadInfoT t1, MonadInfoT t2) => SearchCombiner
Fields runner :: forall m x. Evalable m => (t1 :> t2) m x -> m x elems :: [SearchCombinerElem t1 t2]

buildCombiner :: [Search] -> SearchCombiner Source #

extractCombiners :: (Evalable m, FMonadT t', MonadInfoT t', FMonadT t1, MonadInfoT t1, FMonadT t2, MonadInfoT t2) => [SearchCombinerElem t1 t2] -> Eval (t' ((t1 :> t2) m)) -> State Int [Eval (t' ((t1 :> t2) m))] Source #

memo :: Memoable m => String -> Info -> m -> m Source #

memoLoop :: (GenModeM m, MemoM m, MonadInfo m, HookStatsM m, VarInfoM m) => Eval m -> Eval m Source #

rReaderT :: (Show s, MemoM m) => s -> MemoReaderT s m a -> m a Source #

cacheStatement :: Evalable m => String -> Statement -> Info -> m Statement Source #

cloneBase :: Info -> Info Source #

mkCopy :: Info -> String -> Statement Source #

mkUpdate :: Info -> String -> (Value -> Value) -> Statement Source #

rp :: Pretty x => Int -> x -> String Source #

inits :: Evalable m => Eval m -> Info -> m Statement Source #

mseqs :: (Traversable t, Monad m) => t (m Statement) -> m Statement Source #

cachedCommit :: Evalable m => Info -> m Statement Source #

cachedAbort :: Evalable m => Info -> m Statement Source #