| Safe Haskell | Safe-Infered | 
|---|
Curry.Module.Meta
- data C_OrRef
 - prim_isFree :: Curry t0 => t0 -> Result (C_IO (C_Either t0 t0))
 - headNormalFormIO :: (Curry a, Curry b) => Prim (a -> Result (C_IO b)) -> a -> Result (C_IO b)
 - searchTree :: Curry a => a -> Result (C_SearchTree a)
 - hnfIO :: BaseCurry t0 => t0 -> t -> C_IO t0
 - nfIO :: BaseCurry t0 => t0 -> t -> C_IO t0
 - gnfIO :: BaseCurry t0 => t0 -> t -> C_IO t0
 - ghnfIO :: BaseCurry t0 => t0 -> t -> C_IO t0
 - getRichSearchTree :: Curry a => a -> Result (C_IO (C_RichSearchTree a))
 - richSearchTree :: Curry a => a -> Result (C_RichSearchTree a)
 - richSearchTr :: Curry a => a -> Result (C_RichSearchTree a)
 - parallelSearch :: Curry a => a -> Result (C_IO (List a))
 - myGetChanContents :: Show a => MyQSem -> Chan (Maybe a) -> IO [a]
 - stopSearch :: MVar [ThreadId] -> IO ()
 - removeId :: MVar [ThreadId] -> Chan (Maybe a) -> ThreadId -> IO ()
 - searchThread :: Curry a => MyQSem -> MVar [ThreadId] -> Chan (Maybe a) -> a -> IO ()
 - newtype MyQSem = MyQSem (MVar (Int, [MVar ()]))
 - newMyQSem :: Int -> IO MyQSem
 - incMyQSem :: MyQSem -> IO ()
 - decMyQSem :: MyQSem -> IO ()
 - testMyQSem :: MyQSem -> IO ()
 - cover :: Curry a => a -> Result a
 - st :: Curry a => a -> Result (C_SearchTree a)
 - richST :: Curry a => a -> Result (C_RichSearchTree a)
 - ors :: Curry a => List a -> Result a
 - prim_throw :: Curry a => C_Exception -> Result a
 - data  C_RichSearchTree t0
- = C_RichFail C_Exception
 - | C_RichValue t0
 - | C_RichChoice C_OrRef (List (C_RichSearchTree t0))
 - | C_RichSuspend
 - | C_RichSearchTreeFail C_Exceptions
 - | C_RichSearchTreeOr OrRef (Branches (C_RichSearchTree t0))
 
 - data C_Exception
 - data C_Seq t0
 - c_isFree :: Curry t0 => t0 -> State -> C_IO (C_Either t0 t0)
 - c_throw :: Curry t0 => C_Exception -> State -> t0
 - c_list :: Curry t0 => C_Seq t0 -> State -> List t0
 - c_interleave :: Curry t0 => C_Seq t0 -> C_Seq t0 -> State -> C_Seq t0
 - c_seq :: Curry t0 => C_SearchTree t0 -> State -> C_Seq t0
 - c_isValOrChoice :: Curry t0 => C_SearchTree t0 -> State -> C_Bool
 - c_allValuesI :: Curry t0 => State -> Prim (C_SearchTree t0 -> State -> List t0)
 - c_interleave_case_0 :: Curry t0 => C_Seq t0 -> C_Seq t0 -> C_Seq t0 -> State -> C_Seq t0
 - c_prim_isFree :: Curry t0 => t0 -> State -> C_IO (C_Either t0 t0)
 - c_headNormalFormIO :: (Curry t0, Curry t1) => Prim (t0 -> State -> C_IO t1) -> t0 -> State -> C_IO t1
 - c_searchTree :: Curry t0 => t0 -> State -> C_SearchTree t0
 - c_gnfIO :: Curry t0 => t0 -> State -> C_IO t0
 - c_ghnfIO :: Curry t0 => t0 -> State -> C_IO t0
 - c_nfIO :: Curry t0 => t0 -> State -> C_IO t0
 - c_hnfIO :: Curry t0 => t0 -> State -> C_IO t0
 - c_getRichSearchTree :: Curry t0 => t0 -> State -> C_IO (C_RichSearchTree t0)
 - c_richSearchTree :: Curry t0 => t0 -> State -> C_RichSearchTree t0
 - c_parallelSearch :: Curry t0 => t0 -> State -> C_IO (List t0)
 - c_cover :: Curry t0 => t0 -> State -> t0
 - c_st :: Curry t0 => t0 -> State -> C_SearchTree t0
 - c_richST :: Curry t0 => t0 -> State -> C_RichSearchTree t0
 - c_ors :: Curry t0 => List t0 -> State -> t0
 - c_prim_throw :: Curry t0 => C_Exception -> State -> t0
 
Documentation
Constructors
| C_OrRef OrRef | |
| C_OrRefFail C_Exceptions | |
| C_OrRefOr OrRef (Branches C_OrRef) | 
searchTree :: Curry a => a -> Result (C_SearchTree a)Source
getRichSearchTree :: Curry a => a -> Result (C_IO (C_RichSearchTree a))Source
richSearchTree :: Curry a => a -> Result (C_RichSearchTree a)Source
richSearchTr :: Curry a => a -> Result (C_RichSearchTree a)Source
testMyQSem :: MyQSem -> IO ()Source
st :: Curry a => a -> Result (C_SearchTree a)Source
richST :: Curry a => a -> Result (C_RichSearchTree a)Source
prim_throw :: Curry a => C_Exception -> Result aSource
data C_RichSearchTree t0 Source
Constructors
| C_RichFail C_Exception | |
| C_RichValue t0 | |
| C_RichChoice C_OrRef (List (C_RichSearchTree t0)) | |
| C_RichSuspend | |
| C_RichSearchTreeFail C_Exceptions | |
| C_RichSearchTreeOr OrRef (Branches (C_RichSearchTree t0)) | 
Instances
| Read t0 => Read (C_RichSearchTree t0) | |
| Show t0 => Show (C_RichSearchTree t0) | |
| BaseCurry t0 => BaseCurry (C_RichSearchTree t0) | |
| Curry t0 => Curry (C_RichSearchTree t0) | 
data C_Exception Source
c_throw :: Curry t0 => C_Exception -> State -> t0Source
c_isValOrChoice :: Curry t0 => C_SearchTree t0 -> State -> C_BoolSource
c_allValuesI :: Curry t0 => State -> Prim (C_SearchTree t0 -> State -> List t0)Source
c_headNormalFormIO :: (Curry t0, Curry t1) => Prim (t0 -> State -> C_IO t1) -> t0 -> State -> C_IO t1Source
c_searchTree :: Curry t0 => t0 -> State -> C_SearchTree t0Source
c_getRichSearchTree :: Curry t0 => t0 -> State -> C_IO (C_RichSearchTree t0)Source
c_richSearchTree :: Curry t0 => t0 -> State -> C_RichSearchTree t0Source
c_st :: Curry t0 => t0 -> State -> C_SearchTree t0Source
c_richST :: Curry t0 => t0 -> State -> C_RichSearchTree t0Source
c_prim_throw :: Curry t0 => C_Exception -> State -> t0Source