Control.Monad.Search.Best

Documentation

data Best a

Unlike Matrix, Recomp, etc., the Best monad only keeps the best set of results. This makes the analytical synthesis like IgorII, and the exhaustive synthesis like Djinn, i.e., the resulting algorithms are more efficient, but cannot be used for (analytically-)generate-and-test.

Constructors

Result [a]

Delay (Best a)

Instances

Monad Best

Methods

(>>=) :: Best a -> (a -> Best b) -> Best b

(>>) :: Best a -> Best b -> Best b

return :: a -> Best a

fail :: String -> Best a

Functor Best

Methods

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

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

Applicative Best

Methods

pure :: a -> Best a

(<*>) :: Best (a -> b) -> Best a -> Best b

(*>) :: Best a -> Best b -> Best b

(<*) :: Best a -> Best b -> Best a

Alternative Best

Methods

empty :: Best a

(<|>) :: Best a -> Best a -> Best a

some :: Best a -> Best [a]

many :: Best a -> Best [a]

MonadPlus Best

Methods

mzero :: Best a

mplus :: Best a -> Best a -> Best a

Search Best

Methods

fromRc :: Recomp a -> Best a

toRc :: Best a -> Recomp a

fromMx :: Matrix a -> Best a

toMx :: Best a -> Matrix a

fromDB :: DBound a -> Best a

fromDF :: [a] -> Best a

toDF :: Best a -> [a]

mapDepth :: (Bag a -> Bag b) -> Best a -> Best b

catBags :: Best (Bag a) -> Best a

mergesortDepthWithBy :: (k -> k -> k) -> (k -> k -> Ordering) -> Best k -> Best k

ifDepth :: (Int -> Bool) -> Best a -> Best a -> Best a

Delay Best

Methods

delay :: Best a -> Best a

ndelay :: Int -> Best a -> Best a

getDepth :: Best Int

Memoable Best Best

Methods

tabulate :: Best a -> Best a

applyMemo :: Best a -> Best a

Read a => Read (Best a)

Methods

readsPrec :: Int -> ReadS (Best a)

readList :: ReadS [Best a]

readPrec :: ReadPrec (Best a)

readListPrec :: ReadPrec [Best a]

Show a => Show (Best a)

Methods

showsPrec :: Int -> Best a -> ShowS

show :: Best a -> String

showList :: [Best a] -> ShowS

getBests :: Best a -> [a]

zero :: Best a

fromLists :: [[a]] -> Best a