| definition: |
lookupMin :: Map k a -> Maybe (k, a)
lookupMin Tip = Nothing
lookupMin (Bin k x _ l _) | isBranch l = lookupMin l
| otherwise = Just (k, x)
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Retrieves the smallest key/element pair in the finite map --- according to the basic key ordering. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Tip}) |-> {Nothing} || ({Bin}) |-> {Just,Nothing}}
|
| name: |
lookupMin |
| precedence: |
no precedence defined |
| result-values: |
{Just,Nothing}
|
| signature: |
Map a b -> Prelude.Maybe (a, b) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |