|
definition:
|
levelDiag :: SearchTree a -> [a]
levelDiag t = [ x | Value x <- diagonal (levels [t]) ]
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- diagonalization of devels.
---
--- @param t search tree
--- @return enumeration of values in given search tree
---
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_) |-> _}
|
|
name:
|
levelDiag
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Control.Search.SearchTree.SearchTree a -> [a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|