CurryInfo: redblacktree-3.0.0 / Data.Table.RBTree.toList

definition:
 
toList :: TableRBT key a -> [(key,a)]
toList = RBT.toList
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
Transforms the nodes of red-black tree into a list.
failfree:
 ()
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {() |-> {toList}}
name:
 toList
precedence:
 no precedence defined
result-values:
 {toList}
signature:
 Data.RedBlackTree.RedBlackTree (a, b) -> [(a, b)]
solution-complete:
 operationally complete operation
terminating:
 yes
totally-defined:
 reducible on all ground data terms