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

definition: Info 
 
showSearchTree :: Show a => SearchTree a -> String
showSearchTree st = showsST [] st ""
 where
  -- `showsST ctxt <SearchTree>`, where `ctxt` is a stack of boolean flags
  -- indicating whether we show the last alternative of the respective
  -- level to enable drawing aesthetical corners
  showsST ctxt (Value  a) = indent ctxt . shows a      . nl
  showsST ctxt (Fail _)   = indent ctxt . showChar '!' . nl
  showsST ctxt (Or t1 t2) = indent ctxt . showChar '?' . nl
                          . showsST (False : ctxt) t1
                          . showsST (True  : ctxt) t2

  indent []     = id
  indent (i:is) = showString (concatMap showIndent $ reverse is)
                . showChar   (if i then llc else lmc)
                . showString (hbar : " ")
    where showIndent isLast = (if isLast then ' ' else vbar) : "  "

  vbar = '\x2502' -- vertical bar
  hbar = '\x2500' -- horizontal bar
  llc  = '\x2514' -- left lower corner
  lmc  = '\x251c' -- left middle corner

  nl           = showChar '\n'
  shows x      = showString (show x)
  showChar c   = (c:)
  showString s = (s++)
demand: Info 
 argument 2
deterministic: Info 
 deterministic operation
documentation: Info 
 
Shows the search tree as an intended line structure
failfree: Info 
 (_, _)
indeterministic: Info 
 referentially transparent operation
infix: Info 
 no fixity defined
iotype: Info 
 {(_,_) |-> _}
name: Info 
 showSearchTree
precedence: Info 
 no precedence defined
result-values: Info 
 _
signature: Info 
 Prelude.Show a => SearchTree a -> String
solution-complete: Info 
 operation might suspend on free variables
terminating: Info 
 yes
totally-defined: Info 
 reducible on all ground data terms