definition: |
member :: Ord k => k -> Map k _ -> Bool member k m = isJust (lookup k m) |
demand: |
argument 3 |
deterministic: |
deterministic operation |
documentation: |
--- Does given map contain given key? |
failfree: |
(_, _, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,_,_) |-> {False,True}} |
name: |
member |
precedence: |
no precedence defined |
result-values: |
{False,True} |
signature: |
Prelude.Ord a => a -> Map a b -> Prelude.Bool |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
reducible on all ground data terms |