Kulitta.Search

Documentation

type Constraints = [[(Int, Int)]]

type Index = Int

type Bound = Int

printIt :: Bool

printIter :: Int

allSolns :: (Eq a, Show a) => QSpace a -> EqRel a -> [a] -> [[a]]

pairProg :: (Eq a, Show a) => QSpace a -> EqRel a -> Predicate (a, a) -> [a] -> [[a]]

choose :: StdGen -> [a] -> (StdGen, a)

type Fallback a = EqClass a -> StdGen -> a -> (StdGen, a)

greedyProg :: (Eq a, Show a) => QSpace a -> EqRel a -> Predicate (a, a) -> Fallback a -> StdGen -> [a] -> [a]

greedyChord :: (Eq a, Show a) => EqClass a -> a -> Predicate (a, a) -> Fallback a -> StdGen -> (StdGen, a)

fallFun :: Show a => Predicate (a, a) -> EqClass a -> StdGen -> a -> (StdGen, a)

defFall :: EqClass AbsChord -> StdGen -> AbsChord -> (StdGen, AbsChord)

nearFall :: EqClass AbsChord -> StdGen -> AbsChord -> (StdGen, AbsChord)

greedyProg' :: (Eq a, Show a) => Predicate (a, a) -> Fallback a -> StdGen -> [EqClass a] -> [a]

pairProg' :: (Eq a, Show a) => Predicate (a, a) -> [EqClass a] -> [[a]]

mkCons :: Eq a => [Term b c] -> Predicate [a]

findInds :: [(String, [Term a b])] -> [Term a b] -> [[(Int, Int)]]

expand' :: [(String, Sentence a b)] -> Sentence a b -> Sentence a b

findIndsSub :: String -> Int -> [Term a b] -> [(Int, Int)]

pAdd :: Num b => b -> (b, b) -> (b, b)

findSoln :: (Eq a, Show a) => Constraints -> Predicate [a] -> [[a]] -> (Int, [a])

findSoln2 :: (NFData a, Eq a, Show a) => Constraints -> Predicate [a] -> [[a]] -> IO (Int, [a])

findSolnPar :: (NFData a, Eq a, Show a) => Constraints -> Predicate [a] -> [[a]] -> Int -> IO (Int, [a])

makeSoln :: Int -> [[a]] -> [Int] -> [a]

fetch :: [p] -> Int -> p

findNext :: Constraints -> [Index] -> [Bound] -> [Index]

findNext2 :: Constraints -> [(Bool, Index, Bound)] -> [Int]

findNextI :: Constraints -> [(Bool, Index, Bound)] -> Int -> [[Index]]

applyCons :: [Int] -> [(Int, Int)] -> [Int]

incr :: [(Bool, Int, Int)] -> [Int]

incr2 :: [(Bool, Int, Int)] -> [Int]

freeInds :: Int -> Constraints -> [Int]

greedyLet :: (Eq a, Show a) => Predicate (a, a) -> Fallback a -> Constraints -> [EqClass a] -> StdGen -> [a]

greedyLetT :: QSpace AbsChord -> EqRel AbsChord -> Predicate (AbsChord, AbsChord) -> Fallback AbsChord -> Constraints -> [TChord] -> StdGen -> [TChord]