|
definition:
|
lookup :: Ord k => k -> Map k a -> Maybe a
lookup _ Tip = Nothing
lookup key_to_find (Bin k a _ m_l m_r)
= if key_to_find < k
then lookup key_to_find m_l
else if key_to_find == k
then Just a
else lookup key_to_find m_r
|
|
demand:
|
argument 3
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Retrieves element bound to given key
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{Tip}) |-> {Nothing} || (_,_,{Bin}) |-> {Just,Nothing}}
|
|
name:
|
lookup
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Just,Nothing}
|
|
signature:
|
Prelude.Ord a => a -> Map a b -> Prelude.Maybe b
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|