CurryInfo: redblacktree-3.0.0 / Data.RedBlackTree.lookup
definition: 
|
lookup :: a -> RedBlackTree a -> Maybe a lookup p (RedBlackTree _ eqLk lt t) = lookupTree eqLk lt p t |
|
demand:
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{RedBlackTree}) |-> {Just,Nothing}}
|
|
name:
|
lookup |
|
precedence:
|
no precedence defined |
|
result-values:
|
{Just,Nothing}
|
|
signature:
|
a -> RedBlackTree a -> Prelude.Maybe a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
possibly non-reducible on same data term |