Control.Monad.Search

Documentation

class MonadPlus m => MonadSearch m where

MonadSearch represents searches with backtracking.

Minimal complete definition

fromList, toList

Methods

fromList :: [a] -> m a

toList :: m a -> [a]

failure :: m a -> Bool

failure :: m a -> Bool

lnot :: DFS a -> m ()

lnot :: DFS a -> m ()

guard :: Bool -> m ()

guard :: Bool -> m ()

Instances

MonadSearch BFS

Defined in Control.Monad.Search

Methods

fromList :: [a] -> BFS a

toList :: BFS a -> [a]

failure :: BFS a -> Bool

lnot :: DFS a -> BFS ()

guard :: Bool -> BFS ()

MonadSearch DFS

Defined in Control.Monad.Search

Methods

fromList :: [a] -> DFS a

toList :: DFS a -> [a]

failure :: DFS a -> Bool

lnot :: DFS a -> DFS ()

guard :: Bool -> DFS ()

data DFS a

DFS implementation of MonadSearch.

Instances

Monad DFS

Defined in Control.Monad.Search

Methods

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

(>>) :: DFS a -> DFS b -> DFS b

return :: a -> DFS a

fail :: String -> DFS a

Functor DFS

Defined in Control.Monad.Search

Methods

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

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

Applicative DFS

Defined in Control.Monad.Search

Methods

pure :: a -> DFS a

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

liftA2 :: (a -> b -> c) -> DFS a -> DFS b -> DFS c

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

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

Alternative DFS

Defined in Control.Monad.Search

Methods

empty :: DFS a

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

some :: DFS a -> DFS [a]

many :: DFS a -> DFS [a]

MonadPlus DFS

Defined in Control.Monad.Search

Methods

mzero :: DFS a

mplus :: DFS a -> DFS a -> DFS a

MonadSearch DFS

Defined in Control.Monad.Search

Methods

fromList :: [a] -> DFS a

toList :: DFS a -> [a]

failure :: DFS a -> Bool

lnot :: DFS a -> DFS ()

guard :: Bool -> DFS ()

dfs :: a -> DFS a

data BFS a

BFS implementation of MonadSearch.

Instances

Monad BFS

Defined in Control.Monad.Search

Methods

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

(>>) :: BFS a -> BFS b -> BFS b

return :: a -> BFS a

fail :: String -> BFS a

Functor BFS

Defined in Control.Monad.Search

Methods

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

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

Applicative BFS

Defined in Control.Monad.Search

Methods

pure :: a -> BFS a

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

liftA2 :: (a -> b -> c) -> BFS a -> BFS b -> BFS c

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

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

Alternative BFS

Defined in Control.Monad.Search

Methods

empty :: BFS a

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

some :: BFS a -> BFS [a]

many :: BFS a -> BFS [a]

MonadPlus BFS

Defined in Control.Monad.Search

Methods

mzero :: BFS a

mplus :: BFS a -> BFS a -> BFS a

MonadSearch BFS

Defined in Control.Monad.Search

Methods

fromList :: [a] -> BFS a

toList :: BFS a -> [a]

failure :: BFS a -> Bool

lnot :: DFS a -> BFS ()

guard :: Bool -> BFS ()

bfs :: a -> BFS a