Safe Haskell	None
Language	Haskell98

Control.Monad.Search.Combinatorial

Documentation

newtype Matrix a Source

Constructors

Mx
Fields unMx :: Stream (Bag a)

Instances

(/\) :: Monad m => (a -> m b) -> (t -> m a) -> t -> m b Source

(\/) :: MonadPlus m => (t -> m a) -> (t -> m a) -> t -> m a Source

newtype Recomp a Source

Constructors

Rc
Fields unRc :: Int -> Bag a

newtype RecompT m a Source

Constructors

RcT
Fields unRcT :: Int -> m (Bag a)

Instances

(Functor m, Monad m) => Monad (RecompT m) Source
Functor f => Functor (RecompT f) Source
(Functor m, Monad m) => Applicative (RecompT m) Source
(Functor m, Monad m) => Alternative (RecompT m) Source
(Functor m, Monad m) => MonadPlus (RecompT m) Source
(Functor m, Monad m) => Search (RecompT m) Source
Monad m => Delay (RecompT m) Source
(Functor m, Monad m) => Monoid (RecompT m a) Source

rcToMx :: Recomp a -> Matrix a Source

mxToRc :: Matrix a -> Recomp a Source

class (Delay m, MonadPlus m, Functor m) => Search m where Source

Minimal complete definition

fromRc, toRc, fromMx, toMx, fromDB, fromDF, toDF, mapDepth, ifDepth

Methods

fromRc :: Recomp a -> m a Source

toRc :: m a -> Recomp a Source

fromMx :: Matrix a -> m a Source

toMx :: m a -> Matrix a Source

fromDB :: DBound a -> m a Source

fromDF :: [a] -> m a Source

toDF :: m a -> [a] Source

mapDepth :: (Bag a -> Bag b) -> m a -> m b Source

mapDepth applies a function to the bag at each depth.

catBags :: m (Bag a) -> m a Source

catBags flattens each bag.

mergesortDepthWithBy Source

Arguments

:: (k -> k -> k)	Combiner, which is used when there are equivalent elements (compared by the comparer specified by the next argument). The return value of this combiner should also be equivalent to the two arguments.
-> (k -> k -> Ordering)	Comparer
-> m k
-> m k

mergesortDepthWithBy converts bags to sets, by (possibly sorting each bag and) removing duplicates. Efficiency on lists with lots of duplicates is required.

ifDepth :: (Int -> Bool) -> m a -> m a -> m a Source

Instances

Search DBound Source
Search Recomp Source
Search Matrix Source
Search Best Source
(Functor m, Monad m) => Search (DBoundT m) Source
(Functor m, Monad m) => Search (RecompT m) Source

diag :: Stream (Stream a) -> Stream (Bag a) Source

class Delay m where Source

Minimal complete definition

getDepth

Methods

delay :: m a -> m a Source

ndelay :: Int -> m a -> m a Source

getDepth :: m Int Source

Instances

Delay DBound Source
Delay Recomp Source
Delay Matrix Source
Delay Best Source
Monad m => Delay (DBoundT m) Source
Monad m => Delay (RecompT m) Source
(Monad m, Delay m) => Delay (StateT s m) Source

msumMx :: Bag a -> Matrix a Source

msumRc :: Bag a -> Recomp a Source

listToRc :: Bag a -> Recomp a Source

consMx :: Bag a -> Matrix a -> Matrix a Source

consRc :: Bag a -> Recomp a -> Recomp a Source

zipWithBF :: Monad m => (a -> b -> m c) -> m a -> m b -> m c Source

printMx :: Show a => Matrix a -> IO () Source

printNMx :: Show a => Int -> Matrix a -> IO () Source

type Bag a = [a] Source

type Stream a = [a] Source

cat :: [[a]] -> [a] Source

toList :: a -> a Source

scanl1BF :: Search m => m x -> m x Source

zipDepthMx :: (Int -> Bag a -> Bag b) -> Matrix a -> Matrix b Source

zipDepthRc :: (Int -> Bag a -> Bag b) -> Recomp a -> Recomp b Source

zipDepth3Mx :: (Int -> Bag a -> Bag b -> Bag c) -> Matrix a -> Matrix b -> Matrix c Source

zipDepth3Rc :: (Int -> Bag a -> Bag b -> Bag c) -> Recomp a -> Recomp b -> Recomp c Source

scanlRc :: (Bag a -> Bag b -> Bag a) -> Bag a -> Recomp b -> Recomp a Source

newtype DBound a Source

Constructors

DB
Fields unDB :: Int -> Bag (a, Int)

newtype DBoundT m a Source

Constructors

DBT
Fields unDBT :: Int -> m (Bag (a, Int))

Instances

(Functor m, Monad m) => Monad (DBoundT m) Source
Functor f => Functor (DBoundT f) Source
(Functor m, Monad m) => Applicative (DBoundT m) Source
(Functor m, Monad m) => Alternative (DBoundT m) Source
(Functor m, Monad m) => MonadPlus (DBoundT m) Source
(Functor m, Monad m) => Search (DBoundT m) Source
Monad m => Delay (DBoundT m) Source
(Functor m, Monad m) => DB (DBoundT m) Source

newtype DBMemo a Source

Constructors

DBM
Fields unDBM :: Stream (Bag (a, Int))

Instances

Memoable DBMemo DBound Source

class Search n => Memoable m n where Source

Methods

tabulate :: n a -> m a Source

applyMemo :: m a -> n a Source

Instances

Memoable DBMemo DBound Source
Memoable Matrix Recomp Source
Memoable Best Best Source

shrink :: (Num t1, Ix t1) => (t -> t -> t) -> (t -> t -> Maybe Ordering) -> t1 -> [(t, t1)] -> [(t, t1)] Source

class Search m => DB m where Source

Methods

mapDepthDB :: (Bag (a, Int) -> Bag (b, Int)) -> m a -> m b Source

zipDepthDB :: (Int -> Bag (a, Int) -> Bag (b, Int)) -> m a -> m b Source

Instances

DB DBound Source
(Functor m, Monad m) => DB (DBoundT m) Source

dbtToRcT :: Monad m => DBoundT m a -> RecompT m a Source

Monad Matrix Source
Functor Matrix Source
Applicative Matrix Source
Alternative Matrix Source
MonadPlus Matrix Source
Search Matrix Source
Delay Matrix Source
SStrategy Matrix Source
Memoable Matrix Recomp Source
Show a => Show (Matrix a) Source
Monoid (Matrix a) Source

Monad Recomp Source
Functor Recomp Source
Applicative Recomp Source
Alternative Recomp Source
MonadPlus Recomp Source
Search Recomp Source
Delay Recomp Source
Memoable Matrix Recomp Source
Show (Recomp a) Source
Monoid (Recomp a) Source

Monad DBound Source
Functor DBound Source
Applicative DBound Source
Alternative DBound Source
MonadPlus DBound Source
Search DBound Source
Delay DBound Source
DB DBound Source
SStrategy DBound Source
Memoable DBMemo DBound Source
Show (DBound a) Source