CurryInfo: base-3.4.0 / Control.Search.SearchTree.printValuesWith

 
printValuesWith :: Show a => Strategy a -> a -> IO ()
printValuesWith strategy exp =
  getAllValuesWith strategy exp >>= printValues
 where
  printValues [] = return ()
  printValues (x:xs) = do
   putStr (show x)
   hFlush stdout
   _ <- getLine
   printValues xs

 no demanded arguments

 deterministic operation

 
Prints the values of an expression w.r.t. a search strategy
on demand by the user. Thus, the user must type <ENTER> before
another value is computed and printed.
A search strategy is an operation to traverse a search tree
and collect all values, e.g., 'dfsStrategy' or 'bfsStrategy'.
Conceptually, all printed values are computed on a copy of the expression,
i.e., the evaluation of the expression does not share any results.

 (_, _, _)

 referentially transparent operation

 no fixity defined

 {(_,_,_) |-> _}

 printValuesWith

 no precedence defined

 _

 Prelude.Show a => (SearchTree a -> ValueSequence a) -> a -> Prelude.IO ()

 operation might suspend on free variables

 possibly non-terminating

 reducible on all ground data terms