|
definition:
|
changeTrees :: Int -> ImportTree -> IO ImportTree
changeTrees _ [] = return [] -- should not occur
changeTrees n (Leaf t v : trees) =
if n==0 then openNode v >>= \newst -> return (Node t v newst : trees)
else changeTrees (n-1) trees >>= \nts -> return (Leaf t v : nts)
changeTrees n (Node t v subtrees : trees) =
if n==0 then return (Leaf t v : trees)
else let l = length (tree2strings 0 (Node t v subtrees)) in
if n < l
then (changeTrees (n-1) subtrees) >>= \nsts ->
return (Node t v nsts : trees)
else changeTrees (n-l) trees >>= \nts -> return (Node t v subtrees : nts)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- change tree when click on some line (i.e., open or close a node):
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]}) |-> _ || (_,{:}) |-> _}
|
|
name:
|
changeTrees
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Int -> [Tree (String, [(String, [String])])]
-> Prelude.IO [Tree (String, [(String, [String])])]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|