CurryInfo: redblacktree-3.0.0 / Data.Table.RBTree.lookup
definition: 
|
lookup :: key -> TableRBT key a -> Maybe a lookup k = maybe Nothing (Just . snd) . RBT.lookup (k,failed) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Looks up an entry in a table.
@param k - a key under which a value is stored
@param t - a table (represented as a red-black tree)
@return (Just v) if v is the value stored with key k,
otherwise Nothing is returned.
|
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> {.._#lambda508}}
|
|
name:
|
lookup |
|
precedence:
|
no precedence defined |
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
a -> Data.RedBlackTree.RedBlackTree (a, b) -> Prelude.Maybe b |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
possibly non-reducible on same data term |